java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/loop-acceleration/nested_true-unreach-call1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 12:13:40,176 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 12:13:40,179 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 12:13:40,196 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 12:13:40,197 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 12:13:40,198 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 12:13:40,200 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 12:13:40,202 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 12:13:40,206 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 12:13:40,206 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 12:13:40,209 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 12:13:40,209 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 12:13:40,210 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 12:13:40,211 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 12:13:40,220 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 12:13:40,220 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 12:13:40,221 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 12:13:40,224 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 12:13:40,226 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 12:13:40,227 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 12:13:40,232 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 12:13:40,233 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 12:13:40,236 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 12:13:40,237 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 12:13:40,237 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 12:13:40,238 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 12:13:40,239 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 12:13:40,240 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 12:13:40,240 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 12:13:40,241 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 12:13:40,242 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 12:13:40,245 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 12:13:40,245 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 12:13:40,246 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 12:13:40,246 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 12:13:40,249 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 12:13:40,249 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-10-24 12:13:40,279 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 12:13:40,279 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 12:13:40,280 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 12:13:40,280 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 12:13:40,280 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 12:13:40,281 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 12:13:40,281 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 12:13:40,281 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 12:13:40,282 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 12:13:40,282 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 12:13:40,282 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 12:13:40,282 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 12:13:40,283 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 12:13:40,283 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 12:13:40,283 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 12:13:40,283 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 12:13:40,284 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 12:13:40,285 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 12:13:40,285 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 12:13:40,285 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 12:13:40,285 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 12:13:40,286 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 12:13:40,286 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 12:13:40,286 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 12:13:40,286 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 12:13:40,286 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 12:13:40,287 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 12:13:40,287 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 12:13:40,288 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 12:13:40,288 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 12:13:40,288 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 12:13:40,288 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 12:13:40,288 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 12:13:40,288 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 12:13:40,354 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 12:13:40,367 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 12:13:40,370 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 12:13:40,372 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 12:13:40,372 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 12:13:40,373 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loop-acceleration/nested_true-unreach-call1.i [2018-10-24 12:13:40,426 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/b1c019173/9060b4a44fc04d5f9672ec981d3927b1/FLAG9d8529b28 [2018-10-24 12:13:40,807 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 12:13:40,808 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/nested_true-unreach-call1.i [2018-10-24 12:13:40,813 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/b1c019173/9060b4a44fc04d5f9672ec981d3927b1/FLAG9d8529b28 [2018-10-24 12:13:40,827 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/b1c019173/9060b4a44fc04d5f9672ec981d3927b1 [2018-10-24 12:13:40,839 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 12:13:40,840 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 12:13:40,841 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 12:13:40,841 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 12:13:40,844 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 12:13:40,845 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:13:40" (1/1) ... [2018-10-24 12:13:40,847 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@411d0534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:13:40, skipping insertion in model container [2018-10-24 12:13:40,847 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:13:40" (1/1) ... [2018-10-24 12:13:40,857 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 12:13:40,878 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 12:13:41,072 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 12:13:41,077 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 12:13:41,097 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 12:13:41,118 INFO L193 MainTranslator]: Completed translation [2018-10-24 12:13:41,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:13:41 WrapperNode [2018-10-24 12:13:41,119 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 12:13:41,120 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 12:13:41,120 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 12:13:41,120 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 12:13:41,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:13:41" (1/1) ... [2018-10-24 12:13:41,135 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:13:41" (1/1) ... [2018-10-24 12:13:41,141 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 12:13:41,142 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 12:13:41,142 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 12:13:41,142 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 12:13:41,152 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:13:41" (1/1) ... [2018-10-24 12:13:41,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:13:41" (1/1) ... [2018-10-24 12:13:41,153 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:13:41" (1/1) ... [2018-10-24 12:13:41,153 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:13:41" (1/1) ... [2018-10-24 12:13:41,156 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:13:41" (1/1) ... [2018-10-24 12:13:41,163 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:13:41" (1/1) ... [2018-10-24 12:13:41,164 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:13:41" (1/1) ... [2018-10-24 12:13:41,165 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 12:13:41,166 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 12:13:41,166 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 12:13:41,166 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 12:13:41,167 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:13:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 12:13:41,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 12:13:41,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 12:13:41,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 12:13:41,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 12:13:41,298 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 12:13:41,298 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 12:13:41,299 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-24 12:13:41,299 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-24 12:13:41,511 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 12:13:41,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:13:41 BoogieIcfgContainer [2018-10-24 12:13:41,512 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 12:13:41,513 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 12:13:41,513 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 12:13:41,516 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 12:13:41,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:13:40" (1/3) ... [2018-10-24 12:13:41,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46065a22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:13:41, skipping insertion in model container [2018-10-24 12:13:41,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:13:41" (2/3) ... [2018-10-24 12:13:41,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46065a22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:13:41, skipping insertion in model container [2018-10-24 12:13:41,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:13:41" (3/3) ... [2018-10-24 12:13:41,520 INFO L112 eAbstractionObserver]: Analyzing ICFG nested_true-unreach-call1.i [2018-10-24 12:13:41,530 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 12:13:41,537 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 12:13:41,554 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 12:13:41,588 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 12:13:41,588 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 12:13:41,588 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 12:13:41,588 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 12:13:41,588 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 12:13:41,589 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 12:13:41,589 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 12:13:41,589 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 12:13:41,607 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-10-24 12:13:41,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-24 12:13:41,614 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:13:41,615 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:13:41,617 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:13:41,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:13:41,624 INFO L82 PathProgramCache]: Analyzing trace with hash -283544510, now seen corresponding path program 1 times [2018-10-24 12:13:41,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:13:41,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:13:41,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:13:41,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:13:41,678 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:13:41,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:13:41,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:13:41,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:13:41,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 12:13:41,738 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:13:41,742 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-24 12:13:41,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-24 12:13:41,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-24 12:13:41,756 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2018-10-24 12:13:41,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:13:41,777 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2018-10-24 12:13:41,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-24 12:13:41,779 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-10-24 12:13:41,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:13:41,787 INFO L225 Difference]: With dead ends: 37 [2018-10-24 12:13:41,787 INFO L226 Difference]: Without dead ends: 15 [2018-10-24 12:13:41,791 INFO L605 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-10-24 12:13:41,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-10-24 12:13:41,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-10-24 12:13:41,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-24 12:13:41,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-10-24 12:13:41,829 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2018-10-24 12:13:41,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:13:41,829 INFO L481 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-10-24 12:13:41,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-24 12:13:41,830 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-10-24 12:13:41,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-24 12:13:41,830 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:13:41,831 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:13:41,831 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:13:41,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:13:41,832 INFO L82 PathProgramCache]: Analyzing trace with hash -863512858, now seen corresponding path program 1 times [2018-10-24 12:13:41,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:13:41,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:13:41,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:13:41,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:13:41,834 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:13:41,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:13:42,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:13:42,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:13:42,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 12:13:42,020 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:13:42,023 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 12:13:42,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 12:13:42,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 12:13:42,024 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 3 states. [2018-10-24 12:13:42,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:13:42,110 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-10-24 12:13:42,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 12:13:42,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-10-24 12:13:42,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:13:42,117 INFO L225 Difference]: With dead ends: 25 [2018-10-24 12:13:42,118 INFO L226 Difference]: Without dead ends: 20 [2018-10-24 12:13:42,119 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 12:13:42,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-10-24 12:13:42,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2018-10-24 12:13:42,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-24 12:13:42,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-10-24 12:13:42,131 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 11 [2018-10-24 12:13:42,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:13:42,131 INFO L481 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-10-24 12:13:42,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 12:13:42,132 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-10-24 12:13:42,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-24 12:13:42,136 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:13:42,136 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:13:42,136 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:13:42,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:13:42,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1427803270, now seen corresponding path program 1 times [2018-10-24 12:13:42,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:13:42,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:13:42,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:13:42,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:13:42,143 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:13:42,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:13:42,242 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:13:42,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:13:42,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 12:13:42,243 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:13:42,243 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 12:13:42,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 12:13:42,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 12:13:42,244 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 3 states. [2018-10-24 12:13:42,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:13:42,270 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-10-24 12:13:42,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 12:13:42,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-24 12:13:42,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:13:42,272 INFO L225 Difference]: With dead ends: 29 [2018-10-24 12:13:42,272 INFO L226 Difference]: Without dead ends: 19 [2018-10-24 12:13:42,273 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 12:13:42,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-24 12:13:42,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-10-24 12:13:42,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-24 12:13:42,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-10-24 12:13:42,278 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2018-10-24 12:13:42,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:13:42,279 INFO L481 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-10-24 12:13:42,279 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 12:13:42,279 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-10-24 12:13:42,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-24 12:13:42,280 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:13:42,280 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:13:42,280 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:13:42,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:13:42,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1523179828, now seen corresponding path program 1 times [2018-10-24 12:13:42,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:13:42,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:13:42,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:13:42,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:13:42,282 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:13:42,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:13:42,414 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:13:42,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:13:42,415 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:13:42,418 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-10-24 12:13:42,420 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [18], [22], [24], [28], [34], [37], [39], [45], [46], [47], [49] [2018-10-24 12:13:42,462 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 12:13:42,462 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:13:42,563 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-24 12:13:43,434 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:13:43,436 INFO L272 AbstractInterpreter]: Visited 16 different actions 315 times. Merged at 7 different actions 171 times. Widened at 3 different actions 50 times. Found 33 fixpoints after 4 different actions. Largest state had 4 variables. [2018-10-24 12:13:43,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:13:43,489 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:13:43,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:13:43,489 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 12:13:43,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:13:43,505 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:13:43,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:13:43,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:13:43,957 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:13:43,957 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:13:44,304 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-24 12:13:44,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:13:44,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 9 [2018-10-24 12:13:44,332 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:13:44,333 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 12:13:44,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 12:13:44,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-10-24 12:13:44,334 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 7 states. [2018-10-24 12:13:44,702 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2018-10-24 12:13:44,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:13:44,750 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2018-10-24 12:13:44,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-24 12:13:44,752 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-10-24 12:13:44,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:13:44,753 INFO L225 Difference]: With dead ends: 49 [2018-10-24 12:13:44,754 INFO L226 Difference]: Without dead ends: 37 [2018-10-24 12:13:44,754 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-10-24 12:13:44,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-24 12:13:44,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2018-10-24 12:13:44,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-24 12:13:44,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-10-24 12:13:44,762 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 18 [2018-10-24 12:13:44,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:13:44,762 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-10-24 12:13:44,763 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 12:13:44,763 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-10-24 12:13:44,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-24 12:13:44,764 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:13:44,764 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:13:44,764 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:13:44,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:13:44,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1070919706, now seen corresponding path program 2 times [2018-10-24 12:13:44,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:13:44,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:13:44,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:13:44,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:13:44,767 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:13:44,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:13:44,880 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-24 12:13:44,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:13:44,883 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:13:44,883 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:13:44,883 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:13:44,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:13:44,883 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 12:13:44,892 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:13:44,892 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:13:44,912 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-24 12:13:44,912 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:13:44,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:13:47,131 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((v_main_~x~0_BEFORE_CALL_1 Int)) (let ((.cse0 (mod v_main_~x~0_BEFORE_CALL_1 2))) (and (<= 268435455 (mod v_main_~x~0_BEFORE_CALL_1 4294967296)) (= .cse0 |c___VERIFIER_assert_#in~cond|) (= .cse0 0) (< (mod (+ v_main_~x~0_BEFORE_CALL_1 4294967295) 4294967296) 268435455) (<= .cse0 2147483647)))) (exists ((v_prenex_5 Int)) (let ((.cse3 (mod v_prenex_5 2))) (let ((.cse1 (mod (+ .cse3 4294967294) 4294967296)) (.cse2 (mod v_prenex_5 4294967296))) (and (<= .cse1 2147483647) (<= 268435455 .cse2) (= |c___VERIFIER_assert_#in~cond| .cse1) (< .cse2 0) (< (mod (+ v_prenex_5 4294967295) 4294967296) 268435455) (not (= .cse3 0)))))) (exists ((v_prenex_4 Int)) (let ((.cse5 (mod v_prenex_4 4294967296)) (.cse4 (mod v_prenex_4 2))) (and (< 2147483647 .cse4) (<= 0 .cse5) (<= 268435455 .cse5) (= (+ |c___VERIFIER_assert_#in~cond| 4294967296) .cse4) (< (mod (+ v_prenex_4 4294967295) 4294967296) 268435455)))) (exists ((v_prenex_3 Int)) (let ((.cse8 (mod v_prenex_3 2))) (let ((.cse7 (mod v_prenex_3 4294967296)) (.cse6 (mod (+ .cse8 4294967294) 4294967296))) (and (= (+ |c___VERIFIER_assert_#in~cond| 4294967296) .cse6) (<= 268435455 .cse7) (< .cse7 0) (< 2147483647 .cse6) (< (mod (+ v_prenex_3 4294967295) 4294967296) 268435455) (not (= .cse8 0)))))) (exists ((v_prenex_1 Int)) (let ((.cse9 (mod v_prenex_1 2))) (and (<= 268435455 (mod v_prenex_1 4294967296)) (< 2147483647 .cse9) (= .cse9 0) (< (mod (+ v_prenex_1 4294967295) 4294967296) 268435455) (= (+ |c___VERIFIER_assert_#in~cond| 4294967296) .cse9)))) (exists ((v_prenex_2 Int)) (let ((.cse10 (mod v_prenex_2 4294967296)) (.cse11 (mod v_prenex_2 2))) (and (<= 0 .cse10) (< (mod (+ v_prenex_2 4294967295) 4294967296) 268435455) (<= .cse11 2147483647) (<= 268435455 .cse10) (= .cse11 |c___VERIFIER_assert_#in~cond|))))) is different from true [2018-10-24 12:13:49,183 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((v_main_~x~0_BEFORE_CALL_1 Int)) (let ((.cse0 (mod v_main_~x~0_BEFORE_CALL_1 2))) (and (<= 268435455 (mod v_main_~x~0_BEFORE_CALL_1 4294967296)) (= .cse0 0) (< (mod (+ v_main_~x~0_BEFORE_CALL_1 4294967295) 4294967296) 268435455) (<= .cse0 2147483647) (= .cse0 c___VERIFIER_assert_~cond)))) (exists ((v_prenex_5 Int)) (let ((.cse3 (mod v_prenex_5 2))) (let ((.cse1 (mod (+ .cse3 4294967294) 4294967296)) (.cse2 (mod v_prenex_5 4294967296))) (and (<= .cse1 2147483647) (= .cse1 c___VERIFIER_assert_~cond) (<= 268435455 .cse2) (< .cse2 0) (< (mod (+ v_prenex_5 4294967295) 4294967296) 268435455) (not (= .cse3 0)))))) (exists ((v_prenex_2 Int)) (let ((.cse4 (mod v_prenex_2 2)) (.cse5 (mod v_prenex_2 4294967296))) (and (= .cse4 c___VERIFIER_assert_~cond) (<= 0 .cse5) (< (mod (+ v_prenex_2 4294967295) 4294967296) 268435455) (<= .cse4 2147483647) (<= 268435455 .cse5)))) (exists ((v_prenex_1 Int)) (let ((.cse6 (mod v_prenex_1 2))) (and (<= 268435455 (mod v_prenex_1 4294967296)) (< 2147483647 .cse6) (= .cse6 0) (< (mod (+ v_prenex_1 4294967295) 4294967296) 268435455) (= (+ c___VERIFIER_assert_~cond 4294967296) .cse6)))) (exists ((v_prenex_3 Int)) (let ((.cse9 (mod v_prenex_3 2))) (let ((.cse8 (mod v_prenex_3 4294967296)) (.cse7 (mod (+ .cse9 4294967294) 4294967296))) (and (= (+ c___VERIFIER_assert_~cond 4294967296) .cse7) (<= 268435455 .cse8) (< .cse8 0) (< 2147483647 .cse7) (< (mod (+ v_prenex_3 4294967295) 4294967296) 268435455) (not (= .cse9 0)))))) (exists ((v_prenex_4 Int)) (let ((.cse10 (mod v_prenex_4 2)) (.cse11 (mod v_prenex_4 4294967296))) (and (= (+ c___VERIFIER_assert_~cond 4294967296) .cse10) (< 2147483647 .cse10) (<= 0 .cse11) (<= 268435455 .cse11) (< (mod (+ v_prenex_4 4294967295) 4294967296) 268435455))))) is different from true [2018-10-24 12:13:49,283 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-24 12:13:49,283 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:14:03,774 WARN L832 $PredicateComparison]: unable to prove that (forall ((main_~x~0 Int)) (let ((.cse0 (+ main_~x~0 1))) (or (not (= 0 (mod .cse0 2))) (<= 268435455 (mod main_~x~0 4294967296)) (< (mod .cse0 4294967296) 268435455)))) is different from false [2018-10-24 12:14:05,781 WARN L854 $PredicateComparison]: unable to prove that (forall ((main_~x~0 Int)) (let ((.cse0 (+ main_~x~0 1))) (or (not (= 0 (mod .cse0 2))) (<= 268435455 (mod main_~x~0 4294967296)) (< (mod .cse0 4294967296) 268435455)))) is different from true [2018-10-24 12:14:05,803 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 1 not checked. [2018-10-24 12:14:05,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-10-24 12:14:05,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5, 8] total 16 [2018-10-24 12:14:05,824 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:14:05,825 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 12:14:05,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 12:14:05,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=126, Unknown=7, NotChecked=72, Total=240 [2018-10-24 12:14:05,826 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 7 states. [2018-10-24 12:14:06,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:14:06,002 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2018-10-24 12:14:06,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 12:14:06,003 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-10-24 12:14:06,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:14:06,004 INFO L225 Difference]: With dead ends: 30 [2018-10-24 12:14:06,004 INFO L226 Difference]: Without dead ends: 0 [2018-10-24 12:14:06,005 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=41, Invalid=146, Unknown=7, NotChecked=78, Total=272 [2018-10-24 12:14:06,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-24 12:14:06,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-24 12:14:06,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-24 12:14:06,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-24 12:14:06,006 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2018-10-24 12:14:06,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:14:06,006 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-24 12:14:06,007 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 12:14:06,007 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-24 12:14:06,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-24 12:14:06,012 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-24 12:14:06,325 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-10-24 12:14:06,326 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-24 12:14:06,326 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-24 12:14:06,326 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-24 12:14:06,326 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-24 12:14:06,326 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-24 12:14:06,326 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 8 19) no Hoare annotation was computed. [2018-10-24 12:14:06,326 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 8 19) no Hoare annotation was computed. [2018-10-24 12:14:06,326 INFO L425 ceAbstractionStarter]: For program point L13-1(lines 13 15) no Hoare annotation was computed. [2018-10-24 12:14:06,327 INFO L425 ceAbstractionStarter]: For program point L11-1(lines 11 17) no Hoare annotation was computed. [2018-10-24 12:14:06,327 INFO L421 ceAbstractionStarter]: At program point L13-3(lines 13 15) the Hoare annotation is: (or (= main_~x~0 0) (and (< (mod (+ main_~x~0 4294967295) 4294967296) 268435455) (< (mod main_~x~0 4294967296) 268435455))) [2018-10-24 12:14:06,327 INFO L425 ceAbstractionStarter]: For program point L13-4(lines 13 15) no Hoare annotation was computed. [2018-10-24 12:14:06,327 INFO L421 ceAbstractionStarter]: At program point L11-3(lines 11 17) the Hoare annotation is: (or (< (mod (+ main_~x~0 4294967295) 4294967296) 268435455) (and (<= 0 main_~y~0) (<= main_~x~0 0) (<= 0 main_~x~0) (<= main_~y~0 0))) [2018-10-24 12:14:06,327 INFO L421 ceAbstractionStarter]: At program point L11-4(lines 11 17) the Hoare annotation is: (and (< (mod (+ main_~x~0 4294967295) 4294967296) 268435455) (<= 268435455 (mod main_~x~0 4294967296))) [2018-10-24 12:14:06,328 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 8 19) the Hoare annotation is: true [2018-10-24 12:14:06,328 INFO L425 ceAbstractionStarter]: For program point L3-2(lines 2 7) no Hoare annotation was computed. [2018-10-24 12:14:06,328 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 2 7) the Hoare annotation is: true [2018-10-24 12:14:06,328 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 2 7) no Hoare annotation was computed. [2018-10-24 12:14:06,328 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2018-10-24 12:14:06,329 INFO L425 ceAbstractionStarter]: For program point L4(line 4) no Hoare annotation was computed. [2018-10-24 12:14:06,329 INFO L425 ceAbstractionStarter]: For program point L3(lines 3 5) no Hoare annotation was computed. [2018-10-24 12:14:06,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 12:14:06 BoogieIcfgContainer [2018-10-24 12:14:06,342 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 12:14:06,343 INFO L168 Benchmark]: Toolchain (without parser) took 25503.92 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 752.4 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -572.0 MB). Peak memory consumption was 180.3 MB. Max. memory is 7.1 GB. [2018-10-24 12:14:06,345 INFO L168 Benchmark]: CDTParser took 0.18 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-10-24 12:14:06,345 INFO L168 Benchmark]: CACSL2BoogieTranslator took 278.63 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-10-24 12:14:06,346 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.44 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-10-24 12:14:06,347 INFO L168 Benchmark]: Boogie Preprocessor took 23.59 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-10-24 12:14:06,348 INFO L168 Benchmark]: RCFGBuilder took 346.89 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 752.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -803.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2018-10-24 12:14:06,349 INFO L168 Benchmark]: TraceAbstraction took 24829.34 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 220.8 MB). Peak memory consumption was 220.8 MB. Max. memory is 7.1 GB. [2018-10-24 12:14:06,354 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.18 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 278.63 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 21.44 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 23.59 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 346.89 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 752.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -803.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 24829.34 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 220.8 MB). Peak memory consumption was 220.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: (x + 4294967295) % 4294967296 < 268435455 || (((0 <= y && x <= 0) && 0 <= x) && y <= 0) - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: x == 0 || ((x + 4294967295) % 4294967296 < 268435455 && x % 4294967296 < 268435455) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 1 error locations. SAFE Result, 24.7s OverallTime, 5 OverallIterations, 6 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 83 SDtfs, 20 SDslu, 92 SDs, 0 SdLazy, 58 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 18.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.0s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 12 PreInvPairs, 22 NumberOfFragments, 56 HoareAnnotationTreeSize, 12 FomulaSimplifications, 106 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 462 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 22.1s InterpolantComputationTime, 131 NumberOfCodeBlocks, 118 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 169 ConstructedInterpolants, 3 QuantifiedInterpolants, 24189 SizeOfPredicates, 5 NumberOfNonLiveVariables, 70 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 9 InterpolantComputations, 4 PerfectInterpolantSequences, 110/125 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...