java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/loops/invert_string_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 21:58:13,337 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 21:58:13,339 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 21:58:13,351 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 21:58:13,352 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 21:58:13,353 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 21:58:13,355 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 21:58:13,357 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 21:58:13,359 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 21:58:13,359 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 21:58:13,360 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 21:58:13,361 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 21:58:13,362 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 21:58:13,363 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 21:58:13,364 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 21:58:13,365 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 21:58:13,366 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 21:58:13,368 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 21:58:13,370 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 21:58:13,371 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 21:58:13,373 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 21:58:13,374 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 21:58:13,376 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 21:58:13,376 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 21:58:13,376 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 21:58:13,377 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 21:58:13,378 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 21:58:13,379 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 21:58:13,380 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 21:58:13,381 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 21:58:13,382 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 21:58:13,382 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 21:58:13,382 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 21:58:13,383 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 21:58:13,384 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 21:58:13,384 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 21:58:13,385 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-07 21:58:13,400 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 21:58:13,401 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 21:58:13,402 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 21:58:13,402 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 21:58:13,402 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 21:58:13,402 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 21:58:13,403 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 21:58:13,403 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 21:58:13,403 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 21:58:13,403 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 21:58:13,403 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 21:58:13,404 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 21:58:13,404 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 21:58:13,404 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 21:58:13,405 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 21:58:13,405 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 21:58:13,405 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 21:58:13,405 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 21:58:13,406 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 21:58:13,406 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 21:58:13,406 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 21:58:13,406 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 21:58:13,406 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 21:58:13,407 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 21:58:13,407 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 21:58:13,407 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 21:58:13,407 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 21:58:13,407 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 21:58:13,408 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 21:58:13,408 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 21:58:13,408 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 21:58:13,408 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 21:58:13,408 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 21:58:13,409 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 21:58:13,409 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 21:58:13,455 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 21:58:13,473 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 21:58:13,478 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 21:58:13,479 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 21:58:13,480 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 21:58:13,481 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/invert_string_false-unreach-call_true-termination.i [2018-11-07 21:58:13,541 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc47b3f27/0d5755b305cc4d4abf281f99a8ea74a6/FLAGdf1050557 [2018-11-07 21:58:13,986 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 21:58:13,987 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/invert_string_false-unreach-call_true-termination.i [2018-11-07 21:58:13,994 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc47b3f27/0d5755b305cc4d4abf281f99a8ea74a6/FLAGdf1050557 [2018-11-07 21:58:14,016 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc47b3f27/0d5755b305cc4d4abf281f99a8ea74a6 [2018-11-07 21:58:14,028 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 21:58:14,029 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 21:58:14,030 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 21:58:14,030 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 21:58:14,037 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 21:58:14,038 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:58:14" (1/1) ... [2018-11-07 21:58:14,041 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7047ba1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:14, skipping insertion in model container [2018-11-07 21:58:14,041 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:58:14" (1/1) ... [2018-11-07 21:58:14,052 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 21:58:14,077 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 21:58:14,302 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 21:58:14,306 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 21:58:14,332 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 21:58:14,359 INFO L193 MainTranslator]: Completed translation [2018-11-07 21:58:14,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:14 WrapperNode [2018-11-07 21:58:14,360 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 21:58:14,361 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 21:58:14,361 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 21:58:14,361 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 21:58:14,374 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:14" (1/1) ... [2018-11-07 21:58:14,384 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:14" (1/1) ... [2018-11-07 21:58:14,392 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 21:58:14,392 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 21:58:14,392 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 21:58:14,393 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 21:58:14,405 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:14" (1/1) ... [2018-11-07 21:58:14,406 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:14" (1/1) ... [2018-11-07 21:58:14,408 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:14" (1/1) ... [2018-11-07 21:58:14,408 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:14" (1/1) ... [2018-11-07 21:58:14,416 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:14" (1/1) ... [2018-11-07 21:58:14,422 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:14" (1/1) ... [2018-11-07 21:58:14,423 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:14" (1/1) ... [2018-11-07 21:58:14,426 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 21:58:14,427 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 21:58:14,427 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 21:58:14,427 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 21:58:14,428 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 21:58:14,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-07 21:58:14,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 21:58:14,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 21:58:14,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-07 21:58:14,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 21:58:14,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 21:58:14,582 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 21:58:14,582 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 21:58:14,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-07 21:58:14,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 21:58:14,583 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 21:58:14,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-07 21:58:15,114 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 21:58:15,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:58:15 BoogieIcfgContainer [2018-11-07 21:58:15,115 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 21:58:15,116 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 21:58:15,116 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 21:58:15,119 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 21:58:15,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 09:58:14" (1/3) ... [2018-11-07 21:58:15,120 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e4e961f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:58:15, skipping insertion in model container [2018-11-07 21:58:15,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:58:14" (2/3) ... [2018-11-07 21:58:15,121 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e4e961f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:58:15, skipping insertion in model container [2018-11-07 21:58:15,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:58:15" (3/3) ... [2018-11-07 21:58:15,123 INFO L112 eAbstractionObserver]: Analyzing ICFG invert_string_false-unreach-call_true-termination.i [2018-11-07 21:58:15,134 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 21:58:15,143 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 21:58:15,162 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 21:58:15,199 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 21:58:15,200 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 21:58:15,200 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 21:58:15,200 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 21:58:15,200 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 21:58:15,200 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 21:58:15,200 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 21:58:15,201 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 21:58:15,222 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-11-07 21:58:15,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-07 21:58:15,229 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 21:58:15,230 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 21:58:15,233 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 21:58:15,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 21:58:15,240 INFO L82 PathProgramCache]: Analyzing trace with hash 931697409, now seen corresponding path program 1 times [2018-11-07 21:58:15,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 21:58:15,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:58:15,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 21:58:15,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:58:15,297 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 21:58:15,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 21:58:15,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 21:58:15,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 21:58:15,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 21:58:15,414 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 21:58:15,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 21:58:15,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 21:58:15,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 21:58:15,438 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 2 states. [2018-11-07 21:58:15,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 21:58:15,465 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2018-11-07 21:58:15,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 21:58:15,467 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-11-07 21:58:15,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 21:58:15,477 INFO L225 Difference]: With dead ends: 74 [2018-11-07 21:58:15,477 INFO L226 Difference]: Without dead ends: 36 [2018-11-07 21:58:15,481 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 21:58:15,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-07 21:58:15,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-07 21:58:15,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-07 21:58:15,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-11-07 21:58:15,529 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 22 [2018-11-07 21:58:15,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 21:58:15,530 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-11-07 21:58:15,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 21:58:15,530 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-11-07 21:58:15,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-07 21:58:15,531 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 21:58:15,532 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 21:58:15,532 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 21:58:15,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 21:58:15,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1467881940, now seen corresponding path program 1 times [2018-11-07 21:58:15,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 21:58:15,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:58:15,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 21:58:15,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:58:15,535 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 21:58:15,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 21:58:15,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 21:58:15,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 21:58:15,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 21:58:15,873 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 21:58:15,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 21:58:15,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 21:58:15,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 21:58:15,876 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 5 states. [2018-11-07 21:58:16,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 21:58:16,174 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2018-11-07 21:58:16,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 21:58:16,175 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-11-07 21:58:16,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 21:58:16,176 INFO L225 Difference]: With dead ends: 58 [2018-11-07 21:58:16,177 INFO L226 Difference]: Without dead ends: 42 [2018-11-07 21:58:16,178 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-07 21:58:16,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-07 21:58:16,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2018-11-07 21:58:16,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-07 21:58:16,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-11-07 21:58:16,185 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 24 [2018-11-07 21:58:16,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 21:58:16,186 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-11-07 21:58:16,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 21:58:16,186 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-11-07 21:58:16,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-07 21:58:16,187 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 21:58:16,188 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 21:58:16,188 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 21:58:16,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 21:58:16,189 INFO L82 PathProgramCache]: Analyzing trace with hash 267373412, now seen corresponding path program 1 times [2018-11-07 21:58:16,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 21:58:16,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:58:16,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 21:58:16,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:58:16,191 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 21:58:16,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 21:58:16,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 21:58:16,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 21:58:16,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 21:58:16,377 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 21:58:16,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 21:58:16,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 21:58:16,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 21:58:16,381 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 5 states. [2018-11-07 21:58:16,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 21:58:16,583 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2018-11-07 21:58:16,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 21:58:16,586 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-11-07 21:58:16,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 21:58:16,590 INFO L225 Difference]: With dead ends: 74 [2018-11-07 21:58:16,590 INFO L226 Difference]: Without dead ends: 50 [2018-11-07 21:58:16,591 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-07 21:58:16,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-07 21:58:16,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 40. [2018-11-07 21:58:16,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-07 21:58:16,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2018-11-07 21:58:16,604 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 30 [2018-11-07 21:58:16,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 21:58:16,604 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2018-11-07 21:58:16,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 21:58:16,604 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-11-07 21:58:16,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-07 21:58:16,606 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 21:58:16,606 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 21:58:16,606 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 21:58:16,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 21:58:16,607 INFO L82 PathProgramCache]: Analyzing trace with hash -190039143, now seen corresponding path program 1 times [2018-11-07 21:58:16,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 21:58:16,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:58:16,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 21:58:16,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:58:16,609 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 21:58:16,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 21:58:17,270 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2018-11-07 21:58:17,715 WARN L179 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2018-11-07 21:58:18,251 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 21:58:18,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 21:58:18,252 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 21:58:18,253 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 36 with the following transitions: [2018-11-07 21:58:18,255 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [8], [12], [15], [17], [18], [19], [21], [25], [26], [30], [33], [35], [36], [37], [38], [40], [44], [48], [53], [54], [55], [68], [71], [73], [79], [80], [81], [83] [2018-11-07 21:58:18,295 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 21:58:18,296 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 21:58:18,415 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 21:58:18,767 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 21:58:18,769 INFO L272 AbstractInterpreter]: Visited 33 different actions 212 times. Merged at 20 different actions 148 times. Widened at 4 different actions 12 times. Found 15 fixpoints after 5 different actions. Largest state had 26 variables. [2018-11-07 21:58:18,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 21:58:18,822 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 21:58:18,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 21:58:18,823 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2018-11-07 21:58:18,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 21:58:18,843 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 21:58:18,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 21:58:18,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 21:58:18,972 INFO L477 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 [2018-11-07 21:58:18,975 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-07 21:58:19,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 21:58:19,021 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-07 21:58:19,052 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 21:58:19,057 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 21:58:19,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-07 21:58:19,058 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-07 21:58:19,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 21:58:19,123 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-11-07 21:58:19,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2018-11-07 21:58:19,595 INFO L477 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 12 treesize of output 11 [2018-11-07 21:58:19,595 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 21:58:19,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 21:58:19,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 21:58:19,703 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-11-07 21:58:19,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-11-07 21:58:19,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 13 treesize of output 5 [2018-11-07 21:58:19,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 21:58:19,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2018-11-07 21:58:19,828 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-07 21:58:19,830 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 21:58:19,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 21:58:19,842 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2018-11-07 21:58:19,871 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 21:58:19,871 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 21:58:20,466 INFO L477 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 23 treesize of output 26 [2018-11-07 21:58:20,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-07 21:58:20,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 21:58:20,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-11-07 21:58:20,592 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-07 21:58:20,687 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-07 21:58:20,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-07 21:58:20,701 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:37, output treesize:22 [2018-11-07 21:58:21,081 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 21:58:21,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 21:58:21,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 14] total 34 [2018-11-07 21:58:21,104 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 21:58:21,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-07 21:58:21,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-07 21:58:21,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=999, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 21:58:21,109 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 23 states. [2018-11-07 21:58:23,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 21:58:23,368 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2018-11-07 21:58:23,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-07 21:58:23,369 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 35 [2018-11-07 21:58:23,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 21:58:23,371 INFO L225 Difference]: With dead ends: 125 [2018-11-07 21:58:23,371 INFO L226 Difference]: Without dead ends: 123 [2018-11-07 21:58:23,373 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 48 SyntacticMatches, 5 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 720 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=545, Invalid=2647, Unknown=0, NotChecked=0, Total=3192 [2018-11-07 21:58:23,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-07 21:58:23,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 56. [2018-11-07 21:58:23,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-07 21:58:23,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-11-07 21:58:23,388 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 35 [2018-11-07 21:58:23,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 21:58:23,388 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-11-07 21:58:23,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-07 21:58:23,388 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-11-07 21:58:23,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-07 21:58:23,390 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 21:58:23,390 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 21:58:23,390 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 21:58:23,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 21:58:23,391 INFO L82 PathProgramCache]: Analyzing trace with hash 206412561, now seen corresponding path program 2 times [2018-11-07 21:58:23,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 21:58:23,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:58:23,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 21:58:23,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:58:23,392 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 21:58:23,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 21:58:23,493 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 21:58:23,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 21:58:23,493 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 21:58:23,493 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 21:58:23,494 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 21:58:23,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 21:58:23,494 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2018-11-07 21:58:23,518 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 21:58:23,518 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 21:58:23,581 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 21:58:23,581 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 21:58:23,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 21:58:23,593 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 21:58:23,593 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 21:58:23,659 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 21:58:23,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 21:58:23,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2018-11-07 21:58:23,682 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 21:58:23,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 21:58:23,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 21:58:23,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-07 21:58:23,683 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 7 states. [2018-11-07 21:58:23,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 21:58:23,881 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2018-11-07 21:58:23,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 21:58:23,882 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-11-07 21:58:23,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 21:58:23,886 INFO L225 Difference]: With dead ends: 123 [2018-11-07 21:58:23,886 INFO L226 Difference]: Without dead ends: 103 [2018-11-07 21:58:23,886 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 78 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-11-07 21:58:23,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-07 21:58:23,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 71. [2018-11-07 21:58:23,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-07 21:58:23,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-11-07 21:58:23,900 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 41 [2018-11-07 21:58:23,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 21:58:23,900 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-11-07 21:58:23,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 21:58:23,900 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-11-07 21:58:23,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-07 21:58:23,902 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 21:58:23,902 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 21:58:23,902 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 21:58:23,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 21:58:23,903 INFO L82 PathProgramCache]: Analyzing trace with hash 964997654, now seen corresponding path program 1 times [2018-11-07 21:58:23,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 21:58:23,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:58:23,904 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 21:58:23,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:58:23,905 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 21:58:23,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 21:58:24,005 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 21:58:24,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 21:58:24,006 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 21:58:24,006 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 47 with the following transitions: [2018-11-07 21:58:24,006 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [8], [12], [15], [17], [18], [19], [21], [25], [26], [30], [33], [35], [36], [37], [38], [40], [44], [48], [53], [54], [55], [57], [59], [68], [71], [73], [76], [78], [79], [80], [81], [83], [84] [2018-11-07 21:58:24,009 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 21:58:24,027 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 21:58:24,039 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 21:58:24,325 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 21:58:24,326 INFO L272 AbstractInterpreter]: Visited 38 different actions 289 times. Merged at 23 different actions 184 times. Widened at 5 different actions 16 times. Found 20 fixpoints after 6 different actions. Largest state had 28 variables. [2018-11-07 21:58:24,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 21:58:24,362 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 21:58:24,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 21:58:24,362 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2018-11-07 21:58:24,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 21:58:24,377 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 21:58:24,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 21:58:24,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 21:58:24,489 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 21:58:24,489 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 21:58:24,533 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 21:58:24,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 21:58:24,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2018-11-07 21:58:24,554 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 21:58:24,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 21:58:24,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 21:58:24,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-07 21:58:24,555 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 11 states. [2018-11-07 21:58:24,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 21:58:24,798 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2018-11-07 21:58:24,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 21:58:24,798 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 46 [2018-11-07 21:58:24,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 21:58:24,799 INFO L225 Difference]: With dead ends: 109 [2018-11-07 21:58:24,799 INFO L226 Difference]: Without dead ends: 72 [2018-11-07 21:58:24,800 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 85 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2018-11-07 21:58:24,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-07 21:58:24,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 51. [2018-11-07 21:58:24,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-07 21:58:24,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2018-11-07 21:58:24,808 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 46 [2018-11-07 21:58:24,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 21:58:24,808 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2018-11-07 21:58:24,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 21:58:24,809 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2018-11-07 21:58:24,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-07 21:58:24,810 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 21:58:24,810 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 21:58:24,810 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 21:58:24,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 21:58:24,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1781688252, now seen corresponding path program 3 times [2018-11-07 21:58:24,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 21:58:24,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:58:24,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 21:58:24,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:58:24,812 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 21:58:24,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 21:58:25,653 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 29 [2018-11-07 21:58:26,224 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 21:58:26,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 21:58:26,224 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 21:58:26,224 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 21:58:26,225 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 21:58:26,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 21:58:26,225 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2018-11-07 21:58:26,241 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 21:58:26,241 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 21:58:26,263 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 21:58:26,264 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 21:58:26,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 21:58:26,283 INFO L477 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 [2018-11-07 21:58:26,284 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-07 21:58:26,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 21:58:26,360 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-07 21:58:26,384 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 21:58:26,387 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 21:58:26,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-07 21:58:26,388 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-07 21:58:26,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 21:58:26,394 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-11-07 21:58:26,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2018-11-07 21:58:26,737 INFO L477 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 14 treesize of output 13 [2018-11-07 21:58:26,737 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 21:58:26,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 21:58:26,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 21:58:26,751 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-11-07 21:58:26,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2018-11-07 21:58:26,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 7 [2018-11-07 21:58:26,854 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 21:58:26,862 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 21:58:26,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-07 21:58:26,864 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-07 21:58:26,869 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 21:58:26,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 21:58:26,877 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:40, output treesize:3 [2018-11-07 21:58:26,920 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 21:58:26,920 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 21:58:31,128 INFO L477 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 23 treesize of output 26 [2018-11-07 21:58:31,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-07 21:58:31,186 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 21:58:31,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-11-07 21:58:31,208 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-07 21:58:31,238 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-07 21:58:31,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-07 21:58:31,251 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:37, output treesize:15 [2018-11-07 21:58:31,523 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 21:58:31,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 21:58:31,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 17] total 47 [2018-11-07 21:58:31,553 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 21:58:31,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-07 21:58:31,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-07 21:58:31,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=1928, Unknown=2, NotChecked=0, Total=2162 [2018-11-07 21:58:31,559 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 35 states. [2018-11-07 21:58:34,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 21:58:34,486 INFO L93 Difference]: Finished difference Result 160 states and 174 transitions. [2018-11-07 21:58:34,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-07 21:58:34,487 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 46 [2018-11-07 21:58:34,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 21:58:34,489 INFO L225 Difference]: With dead ends: 160 [2018-11-07 21:58:34,490 INFO L226 Difference]: Without dead ends: 158 [2018-11-07 21:58:34,492 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1905 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=1018, Invalid=5786, Unknown=2, NotChecked=0, Total=6806 [2018-11-07 21:58:34,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-11-07 21:58:34,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 67. [2018-11-07 21:58:34,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-07 21:58:34,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2018-11-07 21:58:34,506 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 46 [2018-11-07 21:58:34,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 21:58:34,507 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2018-11-07 21:58:34,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-07 21:58:34,507 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2018-11-07 21:58:34,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-07 21:58:34,509 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 21:58:34,509 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 21:58:34,509 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 21:58:34,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 21:58:34,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1828921100, now seen corresponding path program 4 times [2018-11-07 21:58:34,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 21:58:34,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:58:34,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 21:58:34,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:58:34,511 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 21:58:34,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 21:58:34,607 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 24 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 21:58:34,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 21:58:34,608 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 21:58:34,608 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 21:58:34,608 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 21:58:34,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 21:58:34,609 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 21:58:34,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 21:58:34,618 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 21:58:34,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 21:58:34,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 21:58:34,670 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 24 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 21:58:34,670 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 21:58:34,926 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 24 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 21:58:34,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 21:58:34,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 8 [2018-11-07 21:58:34,949 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 21:58:34,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 21:58:34,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 21:58:34,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-07 21:58:34,949 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand 8 states. [2018-11-07 21:58:35,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 21:58:35,201 INFO L93 Difference]: Finished difference Result 149 states and 160 transitions. [2018-11-07 21:58:35,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 21:58:35,206 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2018-11-07 21:58:35,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 21:58:35,207 INFO L225 Difference]: With dead ends: 149 [2018-11-07 21:58:35,208 INFO L226 Difference]: Without dead ends: 129 [2018-11-07 21:58:35,208 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 99 SyntacticMatches, 7 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2018-11-07 21:58:35,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-11-07 21:58:35,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 88. [2018-11-07 21:58:35,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-07 21:58:35,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2018-11-07 21:58:35,231 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 52 [2018-11-07 21:58:35,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 21:58:35,231 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2018-11-07 21:58:35,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 21:58:35,231 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-11-07 21:58:35,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-07 21:58:35,237 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 21:58:35,237 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 21:58:35,237 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 21:58:35,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 21:58:35,240 INFO L82 PathProgramCache]: Analyzing trace with hash -906714605, now seen corresponding path program 2 times [2018-11-07 21:58:35,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 21:58:35,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:58:35,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 21:58:35,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 21:58:35,241 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 21:58:35,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-07 21:58:35,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-07 21:58:35,363 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-07 21:58:35,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 09:58:35 BoogieIcfgContainer [2018-11-07 21:58:35,444 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 21:58:35,445 INFO L168 Benchmark]: Toolchain (without parser) took 21416.74 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 21:58:35,446 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 21:58:35,447 INFO L168 Benchmark]: CACSL2BoogieTranslator took 329.96 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-07 21:58:35,448 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 21:58:35,448 INFO L168 Benchmark]: Boogie Preprocessor took 34.52 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 21:58:35,448 INFO L168 Benchmark]: RCFGBuilder took 687.58 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 744.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -789.3 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. [2018-11-07 21:58:35,449 INFO L168 Benchmark]: TraceAbstraction took 20328.67 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 327.2 MB). Free memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: -313.3 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2018-11-07 21:58:35,453 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 329.96 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 31.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.52 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 687.58 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 744.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -789.3 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20328.67 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 327.2 MB). Free memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: -313.3 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L13] int MAX = __VERIFIER_nondet_uint(); [L14] FCALL char str1[MAX], str2[MAX]; VAL [MAX=2, str1={4:0}, str2={6:0}] [L15] int cont, i, j; [L16] cont = 0 [L18] i=0 VAL [cont=0, i=0, MAX=2, str1={4:0}, str2={6:0}] [L18] COND TRUE i= 0 VAL [cont=0, i=1, j=0, MAX=2, str1={4:0}, str2={6:0}] [L26] EXPR, FCALL str1[0] VAL [cont=0, i=1, j=0, MAX=2, str1={4:0}, str1[0]=1, str2={6:0}] [L26] FCALL str2[j] = str1[0] VAL [cont=0, i=1, j=0, MAX=2, str1={4:0}, str1[0]=1, str2={6:0}] [L27] j++ VAL [cont=0, i=1, j=1, MAX=2, str1={4:0}, str2={6:0}] [L25] i-- VAL [cont=0, i=0, j=1, MAX=2, str1={4:0}, str2={6:0}] [L25] COND TRUE i >= 0 VAL [cont=0, i=0, j=1, MAX=2, str1={4:0}, str2={6:0}] [L26] EXPR, FCALL str1[0] VAL [cont=0, i=0, j=1, MAX=2, str1={4:0}, str1[0]=1, str2={6:0}] [L26] FCALL str2[j] = str1[0] VAL [cont=0, i=0, j=1, MAX=2, str1={4:0}, str1[0]=1, str2={6:0}] [L27] j++ VAL [cont=0, i=0, j=2, MAX=2, str1={4:0}, str2={6:0}] [L25] i-- VAL [cont=0, i=-1, j=2, MAX=2, str1={4:0}, str2={6:0}] [L25] COND FALSE !(i >= 0) VAL [cont=0, i=-1, j=2, MAX=2, str1={4:0}, str2={6:0}] [L30] j = MAX-1 [L31] i=0 VAL [cont=0, i=0, j=1, MAX=2, str1={4:0}, str2={6:0}] [L31] COND TRUE i