YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 05:01:09,369 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 05:01:09,371 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 05:01:09,382 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 05:01:09,382 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 05:01:09,384 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 05:01:09,385 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 05:01:09,387 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 05:01:09,388 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 05:01:09,389 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 05:01:09,390 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 05:01:09,390 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 05:01:09,391 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 05:01:09,392 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 05:01:09,393 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 05:01:09,393 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 05:01:09,394 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 05:01:09,396 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 05:01:09,398 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 05:01:09,399 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 05:01:09,400 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 05:01:09,401 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 05:01:09,403 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 05:01:09,403 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 05:01:09,404 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 05:01:09,404 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 05:01:09,405 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 05:01:09,406 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 05:01:09,406 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 05:01:09,406 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 05:01:09,407 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 05:01:09,408 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 05:01:09,409 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 05:01:09,409 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 05:01:09,410 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 05:01:09,410 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 05:01:09,410 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 05:01:09,411 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 05:01:09,412 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 05:01:09,412 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-22 05:01:09,426 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 05:01:09,427 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 05:01:09,428 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 05:01:09,428 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 05:01:09,428 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 05:01:09,428 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 05:01:09,428 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 05:01:09,428 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 05:01:09,429 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 05:01:09,429 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 05:01:09,429 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 05:01:09,429 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 05:01:09,429 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 05:01:09,429 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 05:01:09,429 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:01:09,430 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 05:01:09,430 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 05:01:09,430 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 05:01:09,430 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 05:01:09,430 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 05:01:09,430 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 05:01:09,431 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 05:01:09,431 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 05:01:09,431 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 05:01:09,431 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 05:01:09,431 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 05:01:09,431 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 05:01:09,432 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 05:01:09,432 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 05:01:09,458 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 05:01:09,471 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 05:01:09,474 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 05:01:09,475 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 05:01:09,476 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 05:01:09,477 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 05:01:09,547 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/3086669b1d4d466fad19919df13e8a37/FLAGe336a73be [2020-06-22 05:01:09,894 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 05:01:09,894 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 05:01:09,895 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 05:01:09,901 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/3086669b1d4d466fad19919df13e8a37/FLAGe336a73be [2020-06-22 05:01:10,296 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/3086669b1d4d466fad19919df13e8a37 [2020-06-22 05:01:10,308 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 05:01:10,309 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 05:01:10,311 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 05:01:10,311 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 05:01:10,315 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 05:01:10,316 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 05:01:10" (1/1) ... [2020-06-22 05:01:10,319 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6746beaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:01:10, skipping insertion in model container [2020-06-22 05:01:10,319 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 05:01:10" (1/1) ... [2020-06-22 05:01:10,327 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 05:01:10,345 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 05:01:10,576 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 05:01:10,589 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 05:01:10,607 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 05:01:10,623 INFO L195 MainTranslator]: Completed translation [2020-06-22 05:01:10,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:01:10 WrapperNode [2020-06-22 05:01:10,639 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 05:01:10,640 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 05:01:10,640 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 05:01:10,640 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 05:01:10,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:01:10" (1/1) ... [2020-06-22 05:01:10,657 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:01:10" (1/1) ... [2020-06-22 05:01:10,679 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 05:01:10,680 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 05:01:10,680 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 05:01:10,680 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 05:01:10,689 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:01:10" (1/1) ... [2020-06-22 05:01:10,689 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:01:10" (1/1) ... [2020-06-22 05:01:10,691 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:01:10" (1/1) ... [2020-06-22 05:01:10,691 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:01:10" (1/1) ... [2020-06-22 05:01:10,698 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:01:10" (1/1) ... [2020-06-22 05:01:10,702 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:01:10" (1/1) ... [2020-06-22 05:01:10,703 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:01:10" (1/1) ... [2020-06-22 05:01:10,705 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 05:01:10,705 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 05:01:10,706 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 05:01:10,706 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 05:01:10,707 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:01:10" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 05:01:10,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 05:01:10,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-06-22 05:01:10,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 05:01:10,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 05:01:10,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 05:01:10,966 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 05:01:10,966 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2020-06-22 05:01:10,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 05:01:10 BoogieIcfgContainer [2020-06-22 05:01:10,968 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 05:01:10,968 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 05:01:10,968 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 05:01:10,970 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 05:01:10,971 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 05:01:10" (1/1) ... [2020-06-22 05:01:10,987 INFO L313 BlockEncoder]: Initial Icfg 19 locations, 21 edges [2020-06-22 05:01:10,988 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 05:01:10,989 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 05:01:10,990 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 05:01:10,990 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 05:01:10,992 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 05:01:10,992 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 05:01:10,993 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 05:01:11,016 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 05:01:11,044 INFO L200 BlockEncoder]: SBE split 8 edges [2020-06-22 05:01:11,048 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 05:01:11,050 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 05:01:11,076 INFO L100 BaseMinimizeStates]: Removed 10 edges and 5 locations by large block encoding [2020-06-22 05:01:11,079 INFO L70 RemoveSinkStates]: Removed 9 edges and 2 locations by removing sink states [2020-06-22 05:01:11,081 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 05:01:11,081 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 05:01:11,081 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 05:01:11,082 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 05:01:11,082 INFO L313 BlockEncoder]: Encoded RCFG 12 locations, 20 edges [2020-06-22 05:01:11,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 05:01:11 BasicIcfg [2020-06-22 05:01:11,083 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 05:01:11,084 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 05:01:11,084 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 05:01:11,087 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 05:01:11,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 05:01:10" (1/4) ... [2020-06-22 05:01:11,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@109b27c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 05:01:11, skipping insertion in model container [2020-06-22 05:01:11,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:01:10" (2/4) ... [2020-06-22 05:01:11,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@109b27c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 05:01:11, skipping insertion in model container [2020-06-22 05:01:11,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 05:01:10" (3/4) ... [2020-06-22 05:01:11,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@109b27c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 05:01:11, skipping insertion in model container [2020-06-22 05:01:11,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 05:01:11" (4/4) ... [2020-06-22 05:01:11,091 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 05:01:11,101 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 05:01:11,109 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2020-06-22 05:01:11,125 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-06-22 05:01:11,154 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 05:01:11,155 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 05:01:11,155 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 05:01:11,155 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 05:01:11,155 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 05:01:11,156 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 05:01:11,156 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 05:01:11,156 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 05:01:11,156 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 05:01:11,170 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2020-06-22 05:01:11,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 05:01:11,176 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 05:01:11,177 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 05:01:11,179 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== [2020-06-22 05:01:11,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:01:11,185 INFO L82 PathProgramCache]: Analyzing trace with hash 3653978, now seen corresponding path program 1 times [2020-06-22 05:01:11,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:01:11,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:01:11,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:11,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:01:11,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:11,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:01:11,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:01:11,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 05:01:11,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 05:01:11,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 05:01:11,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 05:01:11,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 05:01:11,380 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 3 states. [2020-06-22 05:01:11,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:01:11,451 INFO L93 Difference]: Finished difference Result 12 states and 20 transitions. [2020-06-22 05:01:11,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 05:01:11,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 05:01:11,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 05:01:11,465 INFO L225 Difference]: With dead ends: 12 [2020-06-22 05:01:11,465 INFO L226 Difference]: Without dead ends: 11 [2020-06-22 05:01:11,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 05:01:11,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2020-06-22 05:01:11,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-06-22 05:01:11,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-06-22 05:01:11,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 18 transitions. [2020-06-22 05:01:11,502 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 18 transitions. Word has length 4 [2020-06-22 05:01:11,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 05:01:11,503 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 18 transitions. [2020-06-22 05:01:11,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 05:01:11,503 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 18 transitions. [2020-06-22 05:01:11,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 05:01:11,503 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 05:01:11,504 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 05:01:11,504 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== [2020-06-22 05:01:11,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:01:11,504 INFO L82 PathProgramCache]: Analyzing trace with hash 3653980, now seen corresponding path program 1 times [2020-06-22 05:01:11,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:01:11,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:01:11,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:11,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:01:11,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:11,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:01:11,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:01:11,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 05:01:11,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 05:01:11,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 05:01:11,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 05:01:11,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 05:01:11,542 INFO L87 Difference]: Start difference. First operand 11 states and 18 transitions. Second operand 4 states. [2020-06-22 05:01:11,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:01:11,590 INFO L93 Difference]: Finished difference Result 12 states and 18 transitions. [2020-06-22 05:01:11,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 05:01:11,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2020-06-22 05:01:11,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 05:01:11,591 INFO L225 Difference]: With dead ends: 12 [2020-06-22 05:01:11,592 INFO L226 Difference]: Without dead ends: 11 [2020-06-22 05:01:11,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 05:01:11,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2020-06-22 05:01:11,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-06-22 05:01:11,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-06-22 05:01:11,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2020-06-22 05:01:11,596 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 17 transitions. Word has length 4 [2020-06-22 05:01:11,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 05:01:11,596 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 17 transitions. [2020-06-22 05:01:11,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 05:01:11,596 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 17 transitions. [2020-06-22 05:01:11,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 05:01:11,597 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 05:01:11,597 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 05:01:11,597 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== [2020-06-22 05:01:11,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:01:11,598 INFO L82 PathProgramCache]: Analyzing trace with hash 3653981, now seen corresponding path program 1 times [2020-06-22 05:01:11,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:01:11,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:01:11,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:11,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:01:11,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:11,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:01:11,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:01:11,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 05:01:11,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 05:01:11,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 05:01:11,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 05:01:11,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 05:01:11,628 INFO L87 Difference]: Start difference. First operand 11 states and 17 transitions. Second operand 3 states. [2020-06-22 05:01:11,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:01:11,664 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2020-06-22 05:01:11,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 05:01:11,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 05:01:11,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 05:01:11,665 INFO L225 Difference]: With dead ends: 11 [2020-06-22 05:01:11,666 INFO L226 Difference]: Without dead ends: 10 [2020-06-22 05:01:11,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 05:01:11,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2020-06-22 05:01:11,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2020-06-22 05:01:11,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-06-22 05:01:11,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 16 transitions. [2020-06-22 05:01:11,669 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 16 transitions. Word has length 4 [2020-06-22 05:01:11,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 05:01:11,669 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 16 transitions. [2020-06-22 05:01:11,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 05:01:11,669 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 16 transitions. [2020-06-22 05:01:11,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 05:01:11,670 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 05:01:11,670 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 05:01:11,670 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== [2020-06-22 05:01:11,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:01:11,671 INFO L82 PathProgramCache]: Analyzing trace with hash 113274074, now seen corresponding path program 1 times [2020-06-22 05:01:11,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:01:11,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:01:11,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:11,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:01:11,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:11,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:01:11,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:01:11,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 05:01:11,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 05:01:11,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 05:01:11,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 05:01:11,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 05:01:11,703 INFO L87 Difference]: Start difference. First operand 10 states and 16 transitions. Second operand 3 states. [2020-06-22 05:01:11,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:01:11,741 INFO L93 Difference]: Finished difference Result 10 states and 16 transitions. [2020-06-22 05:01:11,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 05:01:11,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 05:01:11,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 05:01:11,742 INFO L225 Difference]: With dead ends: 10 [2020-06-22 05:01:11,742 INFO L226 Difference]: Without dead ends: 9 [2020-06-22 05:01:11,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 05:01:11,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2020-06-22 05:01:11,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-06-22 05:01:11,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-06-22 05:01:11,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2020-06-22 05:01:11,745 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 14 transitions. Word has length 5 [2020-06-22 05:01:11,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 05:01:11,745 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 14 transitions. [2020-06-22 05:01:11,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 05:01:11,746 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 14 transitions. [2020-06-22 05:01:11,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 05:01:11,746 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 05:01:11,746 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 05:01:11,746 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== [2020-06-22 05:01:11,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:01:11,747 INFO L82 PathProgramCache]: Analyzing trace with hash 113274076, now seen corresponding path program 1 times [2020-06-22 05:01:11,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:01:11,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:01:11,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:11,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:01:11,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:11,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:01:11,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:01:11,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 05:01:11,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 05:01:11,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 05:01:11,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 05:01:11,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 05:01:11,781 INFO L87 Difference]: Start difference. First operand 9 states and 14 transitions. Second operand 4 states. [2020-06-22 05:01:11,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:01:11,824 INFO L93 Difference]: Finished difference Result 15 states and 22 transitions. [2020-06-22 05:01:11,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 05:01:11,824 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-06-22 05:01:11,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 05:01:11,827 INFO L225 Difference]: With dead ends: 15 [2020-06-22 05:01:11,827 INFO L226 Difference]: Without dead ends: 14 [2020-06-22 05:01:11,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-06-22 05:01:11,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-06-22 05:01:11,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 10. [2020-06-22 05:01:11,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-06-22 05:01:11,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 16 transitions. [2020-06-22 05:01:11,832 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 16 transitions. Word has length 5 [2020-06-22 05:01:11,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 05:01:11,833 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 16 transitions. [2020-06-22 05:01:11,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 05:01:11,833 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 16 transitions. [2020-06-22 05:01:11,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 05:01:11,833 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 05:01:11,833 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 05:01:11,834 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== [2020-06-22 05:01:11,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:01:11,834 INFO L82 PathProgramCache]: Analyzing trace with hash 113274077, now seen corresponding path program 1 times [2020-06-22 05:01:11,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:01:11,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:01:11,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:11,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:01:11,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:11,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:01:11,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:01:11,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 05:01:11,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 05:01:11,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 05:01:11,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 05:01:11,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-06-22 05:01:11,887 INFO L87 Difference]: Start difference. First operand 10 states and 16 transitions. Second operand 5 states. [2020-06-22 05:01:11,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:01:11,947 INFO L93 Difference]: Finished difference Result 14 states and 21 transitions. [2020-06-22 05:01:11,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 05:01:11,948 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2020-06-22 05:01:11,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 05:01:11,948 INFO L225 Difference]: With dead ends: 14 [2020-06-22 05:01:11,949 INFO L226 Difference]: Without dead ends: 13 [2020-06-22 05:01:11,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-06-22 05:01:11,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-06-22 05:01:11,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 10. [2020-06-22 05:01:11,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-06-22 05:01:11,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2020-06-22 05:01:11,952 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 15 transitions. Word has length 5 [2020-06-22 05:01:11,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 05:01:11,952 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 15 transitions. [2020-06-22 05:01:11,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 05:01:11,953 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 15 transitions. [2020-06-22 05:01:11,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-06-22 05:01:11,953 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 05:01:11,953 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 05:01:11,953 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== [2020-06-22 05:01:11,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:01:11,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1482188220, now seen corresponding path program 1 times [2020-06-22 05:01:11,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:01:11,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:01:11,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:11,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:01:11,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:11,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:01:11,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:01:11,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 05:01:11,999 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 05:01:12,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:01:12,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:01:12,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 05:01:12,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:01:12,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:01:12,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-06-22 05:01:12,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-06-22 05:01:12,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 05:01:12,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 05:01:12,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-06-22 05:01:12,089 INFO L87 Difference]: Start difference. First operand 10 states and 15 transitions. Second operand 6 states. [2020-06-22 05:01:12,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:01:12,147 INFO L93 Difference]: Finished difference Result 14 states and 20 transitions. [2020-06-22 05:01:12,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 05:01:12,147 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2020-06-22 05:01:12,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 05:01:12,148 INFO L225 Difference]: With dead ends: 14 [2020-06-22 05:01:12,148 INFO L226 Difference]: Without dead ends: 13 [2020-06-22 05:01:12,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-06-22 05:01:12,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-06-22 05:01:12,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 10. [2020-06-22 05:01:12,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-06-22 05:01:12,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2020-06-22 05:01:12,151 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 14 transitions. Word has length 7 [2020-06-22 05:01:12,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 05:01:12,152 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 14 transitions. [2020-06-22 05:01:12,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 05:01:12,152 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 14 transitions. [2020-06-22 05:01:12,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-06-22 05:01:12,152 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 05:01:12,152 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 05:01:12,153 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== [2020-06-22 05:01:12,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:01:12,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1482188221, now seen corresponding path program 1 times [2020-06-22 05:01:12,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:01:12,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:01:12,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:12,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:01:12,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:12,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:01:12,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:01:12,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 05:01:12,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-06-22 05:01:12,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 05:01:12,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 05:01:12,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-06-22 05:01:12,243 INFO L87 Difference]: Start difference. First operand 10 states and 14 transitions. Second operand 6 states. [2020-06-22 05:01:12,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:01:12,333 INFO L93 Difference]: Finished difference Result 21 states and 30 transitions. [2020-06-22 05:01:12,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 05:01:12,334 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2020-06-22 05:01:12,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 05:01:12,335 INFO L225 Difference]: With dead ends: 21 [2020-06-22 05:01:12,335 INFO L226 Difference]: Without dead ends: 16 [2020-06-22 05:01:12,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-06-22 05:01:12,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-06-22 05:01:12,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2020-06-22 05:01:12,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-06-22 05:01:12,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2020-06-22 05:01:12,339 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 19 transitions. Word has length 7 [2020-06-22 05:01:12,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 05:01:12,339 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-06-22 05:01:12,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 05:01:12,340 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2020-06-22 05:01:12,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-06-22 05:01:12,340 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 05:01:12,340 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 05:01:12,340 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== [2020-06-22 05:01:12,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:01:12,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1482186796, now seen corresponding path program 1 times [2020-06-22 05:01:12,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:01:12,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:01:12,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:12,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:01:12,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:12,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:01:12,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:01:12,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 05:01:12,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 05:01:12,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 05:01:12,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 05:01:12,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 05:01:12,371 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand 3 states. [2020-06-22 05:01:12,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:01:12,393 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2020-06-22 05:01:12,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 05:01:12,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-06-22 05:01:12,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 05:01:12,394 INFO L225 Difference]: With dead ends: 14 [2020-06-22 05:01:12,394 INFO L226 Difference]: Without dead ends: 8 [2020-06-22 05:01:12,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 05:01:12,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2020-06-22 05:01:12,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2020-06-22 05:01:12,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-06-22 05:01:12,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2020-06-22 05:01:12,397 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 7 [2020-06-22 05:01:12,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 05:01:12,398 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 10 transitions. [2020-06-22 05:01:12,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 05:01:12,398 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2020-06-22 05:01:12,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-06-22 05:01:12,398 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 05:01:12,398 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 05:01:12,399 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== [2020-06-22 05:01:12,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:01:12,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1768479731, now seen corresponding path program 1 times [2020-06-22 05:01:12,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:01:12,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:01:12,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:12,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:01:12,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:12,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:01:12,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:01:12,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 05:01:12,544 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 05:01:12,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:01:12,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:01:12,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 26 conjunts are in the unsatisfiable core [2020-06-22 05:01:12,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:01:12,630 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2020-06-22 05:01:12,630 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 05:01:12,647 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 05:01:12,648 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 05:01:12,648 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 [2020-06-22 05:01:12,696 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 05:01:12,697 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2020-06-22 05:01:12,701 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 05:01:12,716 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 05:01:12,722 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 05:01:12,722 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 [2020-06-22 05:01:12,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:01:12,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 05:01:12,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2020-06-22 05:01:12,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-06-22 05:01:12,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-06-22 05:01:12,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-06-22 05:01:12,789 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 9 states. [2020-06-22 05:01:13,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:01:13,032 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2020-06-22 05:01:13,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 05:01:13,032 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2020-06-22 05:01:13,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 05:01:13,033 INFO L225 Difference]: With dead ends: 11 [2020-06-22 05:01:13,033 INFO L226 Difference]: Without dead ends: 10 [2020-06-22 05:01:13,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-06-22 05:01:13,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2020-06-22 05:01:13,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2020-06-22 05:01:13,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-06-22 05:01:13,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2020-06-22 05:01:13,037 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 13 transitions. Word has length 7 [2020-06-22 05:01:13,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 05:01:13,037 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 13 transitions. [2020-06-22 05:01:13,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-06-22 05:01:13,037 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2020-06-22 05:01:13,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-06-22 05:01:13,038 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 05:01:13,038 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2020-06-22 05:01:13,038 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== [2020-06-22 05:01:13,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:01:13,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1298045101, now seen corresponding path program 2 times [2020-06-22 05:01:13,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:01:13,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:01:13,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:13,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:01:13,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:13,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:01:13,200 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:01:13,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 05:01:13,200 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 05:01:13,211 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 05:01:13,232 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 05:01:13,232 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 05:01:13,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 26 conjunts are in the unsatisfiable core [2020-06-22 05:01:13,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:01:13,241 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-06-22 05:01:13,242 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 05:01:13,246 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 05:01:13,246 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 05:01:13,246 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-06-22 05:01:13,265 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 05:01:13,265 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 05:01:13,271 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 05:01:13,272 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 05:01:13,272 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2020-06-22 05:01:13,305 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 05:01:13,306 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2020-06-22 05:01:13,307 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 05:01:13,317 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 05:01:13,320 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 05:01:13,320 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:24 [2020-06-22 05:01:13,359 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 05:01:13,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 05:01:13,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2020-06-22 05:01:13,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-06-22 05:01:13,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-06-22 05:01:13,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-06-22 05:01:13,386 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. Second operand 10 states. [2020-06-22 05:01:13,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:01:13,774 INFO L93 Difference]: Finished difference Result 14 states and 18 transitions. [2020-06-22 05:01:13,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-06-22 05:01:13,774 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2020-06-22 05:01:13,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 05:01:13,775 INFO L225 Difference]: With dead ends: 14 [2020-06-22 05:01:13,775 INFO L226 Difference]: Without dead ends: 13 [2020-06-22 05:01:13,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2020-06-22 05:01:13,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-06-22 05:01:13,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2020-06-22 05:01:13,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-06-22 05:01:13,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2020-06-22 05:01:13,779 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 9 [2020-06-22 05:01:13,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 05:01:13,780 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2020-06-22 05:01:13,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-06-22 05:01:13,780 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2020-06-22 05:01:13,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-06-22 05:01:13,780 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 05:01:13,780 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2020-06-22 05:01:13,781 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC]=== [2020-06-22 05:01:13,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:01:13,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1880843566, now seen corresponding path program 1 times [2020-06-22 05:01:13,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:01:13,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:01:13,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:13,782 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:01:13,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:13,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:01:13,871 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-06-22 05:01:13,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 05:01:13,871 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 05:01:13,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:01:13,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:01:13,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 31 conjunts are in the unsatisfiable core [2020-06-22 05:01:13,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:01:13,920 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-06-22 05:01:13,920 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 05:01:13,929 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 05:01:13,930 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 05:01:13,930 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-06-22 05:01:13,936 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-06-22 05:01:13,936 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 05:01:13,939 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 05:01:13,939 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 05:01:13,939 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2020-06-22 05:01:13,958 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 05:01:13,959 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2020-06-22 05:01:13,960 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 05:01:13,968 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 05:01:13,969 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 05:01:13,969 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2020-06-22 05:01:14,000 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-06-22 05:01:14,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 05:01:14,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2020-06-22 05:01:14,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-06-22 05:01:14,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 05:01:14,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-06-22 05:01:14,028 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand 8 states. [2020-06-22 05:01:14,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:01:14,099 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2020-06-22 05:01:14,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 05:01:14,100 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2020-06-22 05:01:14,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 05:01:14,100 INFO L225 Difference]: With dead ends: 12 [2020-06-22 05:01:14,100 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 05:01:14,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-06-22 05:01:14,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 05:01:14,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 05:01:14,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 05:01:14,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 05:01:14,102 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2020-06-22 05:01:14,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 05:01:14,102 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 05:01:14,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-06-22 05:01:14,102 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 05:01:14,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 05:01:14,106 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 05:01:14,307 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 39 [2020-06-22 05:01:14,310 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 05:01:14,310 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC(line 30) no Hoare annotation was computed. [2020-06-22 05:01:14,310 INFO L448 ceAbstractionStarter]: For program point L28-1(lines 28 29) no Hoare annotation was computed. [2020-06-22 05:01:14,311 INFO L444 ceAbstractionStarter]: At program point L28-3(lines 28 29) the Hoare annotation is: (let ((.cse4 (select |#memory_int| ULTIMATE.start_cstrlen_~p~0.base)) (.cse1 (select |#length| ULTIMATE.start_cstrlen_~p~0.base))) (let ((.cse0 (= 0 ULTIMATE.start_cstrlen_~p~0.offset)) (.cse9 (<= (+ ULTIMATE.start_cstrlen_~p~0.offset 1) .cse1)) (.cse8 (<= 1 ULTIMATE.start___VERIFIER_nondet_String_~length~0)) (.cse2 (= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset 0)) (.cse3 (= (select |#valid| ULTIMATE.start_cstrlen_~p~0.base) 1)) (.cse5 (= ULTIMATE.start_cstrlen_~p~0.base ULTIMATE.start_cstrlen_~s.base)) (.cse6 (= (select |#length| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) ULTIMATE.start___VERIFIER_nondet_String_~length~0)) (.cse10 (= 0 (select .cse4 (+ .cse1 (- 1))))) (.cse7 (= (select |#valid| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) 1))) (or (and (= (+ ULTIMATE.start___VERIFIER_nondet_String_~length~0 ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset) 1) .cse0 (<= 1 .cse1) .cse2 .cse3 (= (select .cse4 ULTIMATE.start_cstrlen_~p~0.offset) 0) .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse2 .cse9 .cse3 .cse6 .cse10 .cse5 .cse7) (and (<= 1 ULTIMATE.start_cstrlen_~p~0.offset) .cse9 .cse8 .cse2 .cse3 .cse5 .cse6 .cse10 .cse7)))) [2020-06-22 05:01:14,311 INFO L448 ceAbstractionStarter]: For program point L28-4(lines 28 29) no Hoare annotation was computed. [2020-06-22 05:01:14,311 INFO L444 ceAbstractionStarter]: At program point L16(line 16) the Hoare annotation is: (and (<= 1 ULTIMATE.start___VERIFIER_nondet_String_~length~0) (= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset 0) (= (select |#length| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) ULTIMATE.start___VERIFIER_nondet_String_~length~0) (= (select |#valid| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) 1)) [2020-06-22 05:01:14,311 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 28) no Hoare annotation was computed. [2020-06-22 05:01:14,311 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 28) no Hoare annotation was computed. [2020-06-22 05:01:14,312 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 05:01:14,312 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 05:01:14,312 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 14) no Hoare annotation was computed. [2020-06-22 05:01:14,312 INFO L448 ceAbstractionStarter]: For program point L12-2(lines 12 14) no Hoare annotation was computed. [2020-06-22 05:01:14,312 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 05:01:14,320 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 05:01:14,328 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 05:01:14,331 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 05:01:14,331 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 05:01:14,332 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 05:01:14,332 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 05:01:14,332 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 05:01:14,332 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 05:01:14,332 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 05:01:14,333 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 05:01:14,333 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 05:01:14,333 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 05:01:14,333 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 05:01:14,336 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 05:01:14,336 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 05:01:14,337 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 05:01:14,337 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 05:01:14,337 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 05:01:14,337 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 05:01:14,338 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 05:01:14,338 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 05:01:14,338 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 05:01:14,338 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 05:01:14,338 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 05:01:14,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 05:01:14 BasicIcfg [2020-06-22 05:01:14,341 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 05:01:14,342 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 05:01:14,342 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 05:01:14,345 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 05:01:14,346 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 05:01:14,346 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 05:01:10" (1/5) ... [2020-06-22 05:01:14,347 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@10b03a4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 05:01:14, skipping insertion in model container [2020-06-22 05:01:14,347 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 05:01:14,347 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:01:10" (2/5) ... [2020-06-22 05:01:14,347 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@10b03a4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 05:01:14, skipping insertion in model container [2020-06-22 05:01:14,347 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 05:01:14,347 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 05:01:10" (3/5) ... [2020-06-22 05:01:14,348 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@10b03a4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 05:01:14, skipping insertion in model container [2020-06-22 05:01:14,348 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 05:01:14,348 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 05:01:11" (4/5) ... [2020-06-22 05:01:14,348 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@10b03a4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 05:01:14, skipping insertion in model container [2020-06-22 05:01:14,348 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 05:01:14,348 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 05:01:14" (5/5) ... [2020-06-22 05:01:14,350 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 05:01:14,370 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 05:01:14,370 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 05:01:14,370 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 05:01:14,370 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 05:01:14,371 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 05:01:14,371 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 05:01:14,371 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 05:01:14,371 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 05:01:14,371 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 05:01:14,374 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2020-06-22 05:01:14,379 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-06-22 05:01:14,379 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:01:14,379 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:01:14,383 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 05:01:14,383 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 05:01:14,384 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 05:01:14,384 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2020-06-22 05:01:14,385 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-06-22 05:01:14,385 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:01:14,385 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:01:14,385 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 05:01:14,385 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 05:01:14,390 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue [90] ULTIMATE.startENTRY-->L12: Formula: (and (= (store |v_#valid_10| 0 0) |v_#valid_9|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_10|} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_3|, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_9|, ULTIMATE.start_main_#t~ret4.base=|v_ULTIMATE.start_main_#t~ret4.base_4|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_10, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_6|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_4|, ULTIMATE.start_main_#t~ret5=|v_ULTIMATE.start_main_#t~ret5_4|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_3|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_7, ULTIMATE.start_main_#t~ret4.offset=|v_ULTIMATE.start_main_#t~ret4.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, #NULL.offset, #NULL.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~ret4.base, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start_main_#t~ret5, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base, ULTIMATE.start_main_#t~ret4.offset] 8#L12true [59] L12-->L12-2: Formula: (>= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6 1) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6} AuxVars[] AssignedVars[] 4#L12-2true [69] L12-2-->L16: Formula: (and (= (store |v_#length_2| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7) |v_#length_1|) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (< 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (= (select |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) 0) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| 1)) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2, #valid=|v_#valid_3|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_1|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #valid, #length, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 6#L16true [92] L16-->L28-3: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_8 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_12))) (and (= |v_ULTIMATE.start_main_#t~ret4.offset_5| |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_6|) (<= .cse0 (select |v_#length_8| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9)) (= |v_ULTIMATE.start_cstrlen_#in~s.base_2| v_ULTIMATE.start_cstrlen_~s.base_5) (= |v_ULTIMATE.start_cstrlen_#in~s.offset_2| v_ULTIMATE.start_cstrlen_~s.offset_4) (<= 1 .cse0) (= |v_ULTIMATE.start_cstrlen_#in~s.base_2| |v_ULTIMATE.start_main_#t~ret4.base_5|) (= |v_ULTIMATE.start_main_#t~ret4.base_5| |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_6|) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9 |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_6|) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_6| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_8) (= (store |v_#memory_int_7| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9 (store (select |v_#memory_int_7| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_8 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_12 (- 1)) 0)) |v_#memory_int_6|) (= v_ULTIMATE.start_cstrlen_~s.base_5 v_ULTIMATE.start_cstrlen_~p~0.base_10) (= |v_ULTIMATE.start_main_#t~ret4.offset_5| |v_ULTIMATE.start_cstrlen_#in~s.offset_2|) (= v_ULTIMATE.start_cstrlen_~p~0.offset_8 v_ULTIMATE.start_cstrlen_~s.offset_4) (= 1 (select |v_#valid_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9)))) InVars {ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_8, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_7|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_12, #length=|v_#length_8|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9} OutVars{ULTIMATE.start_cstrlen_~p~0.offset=v_ULTIMATE.start_cstrlen_~p~0.offset_8, ULTIMATE.start_cstrlen_#t~post3.offset=|v_ULTIMATE.start_cstrlen_#t~post3.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_6|, ULTIMATE.start_cstrlen_~s.base=v_ULTIMATE.start_cstrlen_~s.base_5, ULTIMATE.start_cstrlen_#in~s.base=|v_ULTIMATE.start_cstrlen_#in~s.base_2|, ULTIMATE.start_cstrlen_~s.offset=v_ULTIMATE.start_cstrlen_~s.offset_4, ULTIMATE.start_cstrlen_~p~0.base=v_ULTIMATE.start_cstrlen_~p~0.base_10, ULTIMATE.start_cstrlen_#in~s.offset=|v_ULTIMATE.start_cstrlen_#in~s.offset_2|, ULTIMATE.start_cstrlen_#res=|v_ULTIMATE.start_cstrlen_#res_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_8, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_#t~ret4.base=|v_ULTIMATE.start_main_#t~ret4.base_5|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_12, #length=|v_#length_8|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_6|, ULTIMATE.start_cstrlen_#t~post3.base=|v_ULTIMATE.start_cstrlen_#t~post3.base_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9, ULTIMATE.start_cstrlen_#t~mem2=|v_ULTIMATE.start_cstrlen_#t~mem2_7|, ULTIMATE.start_main_#t~ret4.offset=|v_ULTIMATE.start_main_#t~ret4.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrlen_~p~0.offset, ULTIMATE.start_cstrlen_#t~post3.offset, ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_cstrlen_~s.base, ULTIMATE.start_cstrlen_#in~s.base, ULTIMATE.start_cstrlen_~s.offset, ULTIMATE.start_cstrlen_~p~0.base, ULTIMATE.start_cstrlen_#in~s.offset, ULTIMATE.start_cstrlen_#res, #memory_int, ULTIMATE.start_main_#t~ret4.base, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start_cstrlen_#t~post3.base, ULTIMATE.start_cstrlen_#t~mem2, ULTIMATE.start_main_#t~ret4.offset] 14#L28-3true [2020-06-22 05:01:14,391 INFO L796 eck$LassoCheckResult]: Loop: 14#L28-3true [56] L28-3-->L28-1: Formula: (and (<= (+ v_ULTIMATE.start_cstrlen_~p~0.offset_4 1) (select |v_#length_5| v_ULTIMATE.start_cstrlen_~p~0.base_4)) (= (select (select |v_#memory_int_3| v_ULTIMATE.start_cstrlen_~p~0.base_4) v_ULTIMATE.start_cstrlen_~p~0.offset_4) |v_ULTIMATE.start_cstrlen_#t~mem2_2|) (<= 0 v_ULTIMATE.start_cstrlen_~p~0.offset_4) (= 1 (select |v_#valid_7| v_ULTIMATE.start_cstrlen_~p~0.base_4))) InVars {#memory_int=|v_#memory_int_3|, ULTIMATE.start_cstrlen_~p~0.offset=v_ULTIMATE.start_cstrlen_~p~0.offset_4, ULTIMATE.start_cstrlen_~p~0.base=v_ULTIMATE.start_cstrlen_~p~0.base_4, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_cstrlen_~p~0.offset=v_ULTIMATE.start_cstrlen_~p~0.offset_4, ULTIMATE.start_cstrlen_~p~0.base=v_ULTIMATE.start_cstrlen_~p~0.base_4, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_3|, #length=|v_#length_5|, ULTIMATE.start_cstrlen_#t~mem2=|v_ULTIMATE.start_cstrlen_#t~mem2_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrlen_#t~mem2] 7#L28-1true [88] L28-1-->L28-3: Formula: (and (= v_ULTIMATE.start_cstrlen_~p~0.offset_6 (+ v_ULTIMATE.start_cstrlen_~p~0.offset_7 1)) (> 0 |v_ULTIMATE.start_cstrlen_#t~mem2_6|) (= v_ULTIMATE.start_cstrlen_~p~0.base_8 v_ULTIMATE.start_cstrlen_~p~0.base_7)) InVars {ULTIMATE.start_cstrlen_~p~0.offset=v_ULTIMATE.start_cstrlen_~p~0.offset_7, ULTIMATE.start_cstrlen_~p~0.base=v_ULTIMATE.start_cstrlen_~p~0.base_8, ULTIMATE.start_cstrlen_#t~mem2=|v_ULTIMATE.start_cstrlen_#t~mem2_6|} OutVars{ULTIMATE.start_cstrlen_~p~0.offset=v_ULTIMATE.start_cstrlen_~p~0.offset_6, ULTIMATE.start_cstrlen_#t~post3.offset=|v_ULTIMATE.start_cstrlen_#t~post3.offset_2|, ULTIMATE.start_cstrlen_~p~0.base=v_ULTIMATE.start_cstrlen_~p~0.base_7, ULTIMATE.start_cstrlen_#t~post3.base=|v_ULTIMATE.start_cstrlen_#t~post3.base_2|, ULTIMATE.start_cstrlen_#t~mem2=|v_ULTIMATE.start_cstrlen_#t~mem2_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrlen_~p~0.offset, ULTIMATE.start_cstrlen_#t~post3.offset, ULTIMATE.start_cstrlen_~p~0.base, ULTIMATE.start_cstrlen_#t~post3.base, ULTIMATE.start_cstrlen_#t~mem2] 14#L28-3true [2020-06-22 05:01:14,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:01:14,392 INFO L82 PathProgramCache]: Analyzing trace with hash 3663641, now seen corresponding path program 1 times [2020-06-22 05:01:14,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:01:14,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:01:14,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:14,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:01:14,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:14,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:01:14,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:01:14,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:01:14,422 INFO L82 PathProgramCache]: Analyzing trace with hash 2785, now seen corresponding path program 1 times [2020-06-22 05:01:14,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:01:14,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:01:14,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:14,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:01:14,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:14,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:01:14,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:01:14,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:01:14,429 INFO L82 PathProgramCache]: Analyzing trace with hash -774206471, now seen corresponding path program 1 times [2020-06-22 05:01:14,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:01:14,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:01:14,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:14,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:01:14,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:01:14,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:01:14,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:01:14,615 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2020-06-22 05:01:14,681 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:01:14,682 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:01:14,682 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:01:14,682 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:01:14,682 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 05:01:14,683 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 05:01:14,683 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:01:14,683 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:01:14,683 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso [2020-06-22 05:01:14,683 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:01:14,683 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:01:14,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:01:14,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:01:14,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:01:14,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:01:14,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:01:14,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:01:14,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:01:14,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:01:14,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:01:14,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:01:15,161 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:01:15,167 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 05:01:15,169 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:01:15,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:01:15,170 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:01:15,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:01:15,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:01:15,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:01:15,174 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:01:15,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:01:15,176 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:01:15,177 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:01:15,177 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:01:15,177 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:01:15,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:01:15,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:01:15,178 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:01:15,178 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:01:15,178 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:01:15,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:01:15,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:01:15,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:01:15,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:01:15,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:01:15,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:01:15,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:01:15,180 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:01:15,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:01:15,181 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:01:15,181 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:01:15,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:01:15,182 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:01:15,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:01:15,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:01:15,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:01:15,182 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:01:15,183 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:01:15,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:01:15,184 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:01:15,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:01:15,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:01:15,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:01:15,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:01:15,187 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 05:01:15,187 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 05:01:15,189 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:01:15,189 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:01:15,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:01:15,190 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:01:15,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:01:15,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:01:15,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:01:15,190 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:01:15,191 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:01:15,191 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:01:15,192 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:01:15,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:01:15,192 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:01:15,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:01:15,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:01:15,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:01:15,193 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:01:15,193 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:01:15,193 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:01:15,194 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:01:15,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:01:15,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:01:15,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:01:15,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:01:15,200 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 05:01:15,200 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 05:01:15,221 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 05:01:15,241 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 05:01:15,241 INFO L444 ModelExtractionUtils]: 30 out of 34 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 05:01:15,244 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 05:01:15,245 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 05:01:15,245 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 05:01:15,246 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrlen_~p~0.offset, v_rep(select #length ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base)_1) = -1*ULTIMATE.start_cstrlen_~p~0.offset + 1*v_rep(select #length ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base)_1 Supporting invariants [] [2020-06-22 05:01:15,257 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2020-06-22 05:01:15,261 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 05:01:15,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:01:15,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:01:15,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 14 conjunts are in the unsatisfiable core [2020-06-22 05:01:15,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:01:15,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:01:15,335 WARN L254 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:01:15,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:01:15,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:01:15,397 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 05:01:15,401 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2020-06-22 05:01:15,402 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 12 states. Second operand 4 states. [2020-06-22 05:01:15,490 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 12 states.. Second operand 4 states. Result 18 states and 38 transitions. Complement of second has 7 states. [2020-06-22 05:01:15,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-06-22 05:01:15,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 05:01:15,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2020-06-22 05:01:15,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 4 letters. Loop has 2 letters. [2020-06-22 05:01:15,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:01:15,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 6 letters. Loop has 2 letters. [2020-06-22 05:01:15,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:01:15,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 4 letters. Loop has 4 letters. [2020-06-22 05:01:15,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:01:15,501 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 38 transitions. [2020-06-22 05:01:15,502 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 05:01:15,503 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 0 states and 0 transitions. [2020-06-22 05:01:15,504 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 05:01:15,504 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 05:01:15,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 05:01:15,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 05:01:15,505 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 05:01:15,505 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 05:01:15,505 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 05:01:15,505 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 05:01:15,505 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 05:01:15,505 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 05:01:15,505 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 05:01:15,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 05:01:15 BasicIcfg [2020-06-22 05:01:15,511 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 05:01:15,512 INFO L168 Benchmark]: Toolchain (without parser) took 5203.30 ms. Allocated memory was 649.6 MB in the beginning and 770.2 MB in the end (delta: 120.6 MB). Free memory was 558.8 MB in the beginning and 682.9 MB in the end (delta: -124.1 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 05:01:15,512 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 649.6 MB. Free memory is still 580.4 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 05:01:15,513 INFO L168 Benchmark]: CACSL2BoogieTranslator took 328.47 ms. Allocated memory was 649.6 MB in the beginning and 681.1 MB in the end (delta: 31.5 MB). Free memory was 558.8 MB in the beginning and 643.9 MB in the end (delta: -85.1 MB). Peak memory consumption was 29.0 MB. Max. memory is 50.3 GB. [2020-06-22 05:01:15,513 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.80 ms. Allocated memory is still 681.1 MB. Free memory was 643.9 MB in the beginning and 641.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-06-22 05:01:15,514 INFO L168 Benchmark]: Boogie Preprocessor took 25.49 ms. Allocated memory is still 681.1 MB. Free memory was 641.7 MB in the beginning and 640.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-06-22 05:01:15,514 INFO L168 Benchmark]: RCFGBuilder took 262.34 ms. Allocated memory is still 681.1 MB. Free memory was 640.6 MB in the beginning and 621.4 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 50.3 GB. [2020-06-22 05:01:15,515 INFO L168 Benchmark]: BlockEncodingV2 took 114.69 ms. Allocated memory is still 681.1 MB. Free memory was 621.4 MB in the beginning and 613.8 MB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 50.3 GB. [2020-06-22 05:01:15,515 INFO L168 Benchmark]: TraceAbstraction took 3257.35 ms. Allocated memory was 681.1 MB in the beginning and 748.2 MB in the end (delta: 67.1 MB). Free memory was 612.7 MB in the beginning and 522.0 MB in the end (delta: 90.7 MB). Peak memory consumption was 157.8 MB. Max. memory is 50.3 GB. [2020-06-22 05:01:15,516 INFO L168 Benchmark]: BuchiAutomizer took 1169.49 ms. Allocated memory was 748.2 MB in the beginning and 770.2 MB in the end (delta: 22.0 MB). Free memory was 522.0 MB in the beginning and 682.9 MB in the end (delta: -160.9 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 05:01:15,520 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 19 locations, 21 edges - StatisticsResult: Encoded RCFG 12 locations, 20 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 649.6 MB. Free memory is still 580.4 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 328.47 ms. Allocated memory was 649.6 MB in the beginning and 681.1 MB in the end (delta: 31.5 MB). Free memory was 558.8 MB in the beginning and 643.9 MB in the end (delta: -85.1 MB). Peak memory consumption was 29.0 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 39.80 ms. Allocated memory is still 681.1 MB. Free memory was 643.9 MB in the beginning and 641.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 25.49 ms. Allocated memory is still 681.1 MB. Free memory was 641.7 MB in the beginning and 640.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 262.34 ms. Allocated memory is still 681.1 MB. Free memory was 640.6 MB in the beginning and 621.4 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 114.69 ms. Allocated memory is still 681.1 MB. Free memory was 621.4 MB in the beginning and 613.8 MB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 50.3 GB. * TraceAbstraction took 3257.35 ms. Allocated memory was 681.1 MB in the beginning and 748.2 MB in the end (delta: 67.1 MB). Free memory was 612.7 MB in the beginning and 522.0 MB in the end (delta: 90.7 MB). Peak memory consumption was 157.8 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 1169.49 ms. Allocated memory was 748.2 MB in the beginning and 770.2 MB in the end (delta: 22.0 MB). Free memory was 522.0 MB in the beginning and 682.9 MB in the end (delta: -160.9 MB). There was no memory consumed. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer arithmetic is always legal For all program executions holds that pointer arithmetic is always legal at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - InvariantResult [Line: 16]: Loop Invariant [2020-06-22 05:01:15,529 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 05:01:15,530 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((1 <= length && nondetString == 0) && unknown-#length-unknown[nondetString] == length) && \valid[nondetString] == 1 - InvariantResult [Line: 28]: Loop Invariant [2020-06-22 05:01:15,532 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 05:01:15,532 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 05:01:15,532 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 05:01:15,532 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 05:01:15,532 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 05:01:15,532 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 05:01:15,533 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 05:01:15,533 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 05:01:15,533 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 05:01:15,533 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 05:01:15,533 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 05:01:15,536 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 05:01:15,536 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 05:01:15,536 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 05:01:15,536 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 05:01:15,537 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 05:01:15,537 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 05:01:15,537 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 05:01:15,537 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 05:01:15,537 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 05:01:15,538 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 05:01:15,538 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((length + nondetString == 1 && 0 == p) && 1 <= unknown-#length-unknown[p]) && nondetString == 0) && \valid[p] == 1) && unknown-#memory_int-unknown[p][p] == 0) && p == s) && unknown-#length-unknown[nondetString] == length) && \valid[nondetString] == 1) || ((((((((0 == p && 1 <= length) && nondetString == 0) && p + 1 <= unknown-#length-unknown[p]) && \valid[p] == 1) && unknown-#length-unknown[nondetString] == length) && 0 == unknown-#memory_int-unknown[p][unknown-#length-unknown[p] + -1]) && p == s) && \valid[nondetString] == 1)) || ((((((((1 <= p && p + 1 <= unknown-#length-unknown[p]) && 1 <= length) && nondetString == 0) && \valid[p] == 1) && p == s) && unknown-#length-unknown[nondetString] == length) && 0 == unknown-#memory_int-unknown[p][unknown-#length-unknown[p] + -1]) && \valid[nondetString] == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 12 locations, 5 error locations. SAFE Result, 3.1s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 33 SDtfs, 171 SDslu, 79 SDs, 0 SdLazy, 322 SolverSat, 78 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 13 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 7 NumberOfFragments, 152 HoareAnnotationTreeSize, 2 FomulaSimplifications, 163 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 73 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 109 NumberOfCodeBlocks, 109 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 93 ConstructedInterpolants, 4 QuantifiedInterpolants, 4835 SizeOfPredicates, 33 NumberOfNonLiveVariables, 263 ConjunctsInSsa, 86 ConjunctsInUnsatCore, 16 InterpolantComputations, 9 PerfectInterpolantSequences, 9/31 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function -1 * p + unknown-#length-unknown[malloc(length * sizeof(char))] and consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.1s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 0.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 5 SDtfs, 54 SDslu, 3 SDs, 0 SdLazy, 41 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital123 mio100 ax100 hnf100 lsp95 ukn92 mio100 lsp47 div100 bol100 ite100 ukn100 eq198 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 05:01:07.057 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 05:01:15.780 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check