java -ea -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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-acceleration/functions_true-unreach-call1_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:32:38,436 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:32:38,438 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:32:38,456 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:32:38,456 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:32:38,457 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:32:38,459 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:32:38,461 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:32:38,464 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:32:38,465 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:32:38,466 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:32:38,467 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:32:38,469 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:32:38,470 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:32:38,471 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:32:38,472 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:32:38,474 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:32:38,482 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:32:38,485 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:32:38,490 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:32:38,491 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:32:38,492 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:32:38,495 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:32:38,495 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:32:38,496 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:32:38,496 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:32:38,498 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:32:38,498 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:32:38,502 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:32:38,505 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:32:38,505 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:32:38,508 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:32:38,508 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:32:38,508 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:32:38,510 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:32:38,511 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:32:38,511 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-14 17:32:38,537 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:32:38,537 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:32:38,538 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:32:38,538 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:32:38,539 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:32:38,539 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:32:38,539 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:32:38,540 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:32:38,541 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:32:38,541 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:32:38,541 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:32:38,541 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:32:38,542 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:32:38,542 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:32:38,542 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:32:38,542 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:32:38,542 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:32:38,543 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:32:38,543 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:32:38,543 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:32:38,543 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:32:38,543 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:32:38,544 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:32:38,544 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:32:38,544 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:32:38,544 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:32:38,545 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:32:38,546 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:32:38,546 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:32:38,546 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:32:38,614 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:32:38,628 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:32:38,633 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:32:38,634 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:32:38,635 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:32:38,636 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/functions_true-unreach-call1_true-termination.i [2018-11-14 17:32:38,701 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28d78725f/c418021dc1b6404ea1d50a282d0a2936/FLAG6b009794c [2018-11-14 17:32:39,161 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:32:39,162 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/functions_true-unreach-call1_true-termination.i [2018-11-14 17:32:39,169 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28d78725f/c418021dc1b6404ea1d50a282d0a2936/FLAG6b009794c [2018-11-14 17:32:39,187 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28d78725f/c418021dc1b6404ea1d50a282d0a2936 [2018-11-14 17:32:39,197 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:32:39,199 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:32:39,200 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:32:39,200 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:32:39,204 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:32:39,205 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:32:39" (1/1) ... [2018-11-14 17:32:39,208 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d9327bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:32:39, skipping insertion in model container [2018-11-14 17:32:39,209 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:32:39" (1/1) ... [2018-11-14 17:32:39,218 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:32:39,238 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:32:39,462 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:32:39,468 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:32:39,490 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:32:39,509 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:32:39,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:32:39 WrapperNode [2018-11-14 17:32:39,510 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:32:39,511 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:32:39,511 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:32:39,511 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:32:39,527 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:32:39" (1/1) ... [2018-11-14 17:32:39,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:32:39" (1/1) ... [2018-11-14 17:32:39,534 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:32:39" (1/1) ... [2018-11-14 17:32:39,534 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:32:39" (1/1) ... [2018-11-14 17:32:39,540 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:32:39" (1/1) ... [2018-11-14 17:32:39,545 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:32:39" (1/1) ... [2018-11-14 17:32:39,546 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:32:39" (1/1) ... [2018-11-14 17:32:39,547 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:32:39,548 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:32:39,548 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:32:39,548 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:32:39,549 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:32:39" (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-14 17:32:39,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:32:39,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:32:39,679 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 17:32:39,679 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2018-11-14 17:32:39,679 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:32:39,679 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:32:39,679 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 17:32:39,679 INFO L130 BoogieDeclarations]: Found specification of procedure f [2018-11-14 17:32:39,680 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:32:39,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:32:39,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:32:40,090 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:32:40,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:32:40 BoogieIcfgContainer [2018-11-14 17:32:40,091 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:32:40,092 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:32:40,092 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:32:40,095 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:32:40,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:32:39" (1/3) ... [2018-11-14 17:32:40,097 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7676f1f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:32:40, skipping insertion in model container [2018-11-14 17:32:40,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:32:39" (2/3) ... [2018-11-14 17:32:40,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7676f1f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:32:40, skipping insertion in model container [2018-11-14 17:32:40,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:32:40" (3/3) ... [2018-11-14 17:32:40,100 INFO L112 eAbstractionObserver]: Analyzing ICFG functions_true-unreach-call1_true-termination.i [2018-11-14 17:32:40,110 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:32:40,118 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:32:40,135 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:32:40,163 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:32:40,164 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:32:40,164 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:32:40,165 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:32:40,165 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:32:40,165 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:32:40,165 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:32:40,165 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:32:40,165 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:32:40,185 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-11-14 17:32:40,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-14 17:32:40,192 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:32:40,193 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:32:40,195 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:32:40,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:32:40,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1196028990, now seen corresponding path program 1 times [2018-11-14 17:32:40,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:32:40,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:32:40,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:40,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:32:40,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:40,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:40,361 INFO L256 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {26#true} is VALID [2018-11-14 17:32:40,365 INFO L273 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2018-11-14 17:32:40,365 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #36#return; {26#true} is VALID [2018-11-14 17:32:40,366 INFO L256 TraceCheckUtils]: 3: Hoare triple {26#true} call #t~ret1 := main(); {26#true} is VALID [2018-11-14 17:32:40,366 INFO L273 TraceCheckUtils]: 4: Hoare triple {26#true} ~x~0 := 0; {26#true} is VALID [2018-11-14 17:32:40,367 INFO L273 TraceCheckUtils]: 5: Hoare triple {26#true} assume !true; {27#false} is VALID [2018-11-14 17:32:40,368 INFO L256 TraceCheckUtils]: 6: Hoare triple {27#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {27#false} is VALID [2018-11-14 17:32:40,368 INFO L273 TraceCheckUtils]: 7: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2018-11-14 17:32:40,368 INFO L273 TraceCheckUtils]: 8: Hoare triple {27#false} assume ~cond == 0; {27#false} is VALID [2018-11-14 17:32:40,369 INFO L273 TraceCheckUtils]: 9: Hoare triple {27#false} assume !false; {27#false} is VALID [2018-11-14 17:32:40,371 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-14 17:32:40,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:32:40,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:32:40,380 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-14 17:32:40,383 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:32:40,387 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:32:40,462 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:40,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:32:40,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:32:40,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:32:40,473 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2018-11-14 17:32:40,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:40,552 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-14 17:32:40,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:32:40,552 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-14 17:32:40,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:32:40,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:32:40,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 37 transitions. [2018-11-14 17:32:40,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:32:40,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 37 transitions. [2018-11-14 17:32:40,569 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 37 transitions. [2018-11-14 17:32:40,876 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:40,886 INFO L225 Difference]: With dead ends: 34 [2018-11-14 17:32:40,886 INFO L226 Difference]: Without dead ends: 17 [2018-11-14 17:32:40,890 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-14 17:32:40,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-14 17:32:40,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-14 17:32:40,926 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:32:40,927 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 17 states. [2018-11-14 17:32:40,927 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-14 17:32:40,928 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-14 17:32:40,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:40,933 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-11-14 17:32:40,933 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-14 17:32:40,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:40,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:40,934 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-14 17:32:40,934 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-14 17:32:40,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:40,938 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-11-14 17:32:40,938 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-14 17:32:40,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:40,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:40,939 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:32:40,939 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:32:40,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 17:32:40,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-11-14 17:32:40,944 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 10 [2018-11-14 17:32:40,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:32:40,944 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-11-14 17:32:40,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:32:40,945 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-14 17:32:40,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-14 17:32:40,945 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:32:40,946 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:32:40,946 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:32:40,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:32:40,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1888530020, now seen corresponding path program 1 times [2018-11-14 17:32:40,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:32:40,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:32:40,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:40,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:32:40,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:40,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:41,264 INFO L256 TraceCheckUtils]: 0: Hoare triple {135#true} call ULTIMATE.init(); {135#true} is VALID [2018-11-14 17:32:41,264 INFO L273 TraceCheckUtils]: 1: Hoare triple {135#true} assume true; {135#true} is VALID [2018-11-14 17:32:41,265 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {135#true} {135#true} #36#return; {135#true} is VALID [2018-11-14 17:32:41,265 INFO L256 TraceCheckUtils]: 3: Hoare triple {135#true} call #t~ret1 := main(); {135#true} is VALID [2018-11-14 17:32:41,266 INFO L273 TraceCheckUtils]: 4: Hoare triple {135#true} ~x~0 := 0; {137#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:41,275 INFO L273 TraceCheckUtils]: 5: Hoare triple {137#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {137#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:41,289 INFO L273 TraceCheckUtils]: 6: Hoare triple {137#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {136#false} is VALID [2018-11-14 17:32:41,289 INFO L256 TraceCheckUtils]: 7: Hoare triple {136#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {136#false} is VALID [2018-11-14 17:32:41,290 INFO L273 TraceCheckUtils]: 8: Hoare triple {136#false} ~cond := #in~cond; {136#false} is VALID [2018-11-14 17:32:41,290 INFO L273 TraceCheckUtils]: 9: Hoare triple {136#false} assume ~cond == 0; {136#false} is VALID [2018-11-14 17:32:41,290 INFO L273 TraceCheckUtils]: 10: Hoare triple {136#false} assume !false; {136#false} is VALID [2018-11-14 17:32:41,292 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-14 17:32:41,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:32:41,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:32:41,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-14 17:32:41,295 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:32:41,295 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:32:41,368 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:41,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:32:41,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:32:41,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:32:41,370 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 3 states. [2018-11-14 17:32:41,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:41,567 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-14 17:32:41,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:32:41,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-14 17:32:41,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:32:41,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:32:41,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2018-11-14 17:32:41,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:32:41,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2018-11-14 17:32:41,574 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 27 transitions. [2018-11-14 17:32:41,632 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:41,634 INFO L225 Difference]: With dead ends: 26 [2018-11-14 17:32:41,635 INFO L226 Difference]: Without dead ends: 21 [2018-11-14 17:32:41,636 INFO L604 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-11-14 17:32:41,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-14 17:32:41,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-11-14 17:32:41,653 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:32:41,653 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 19 states. [2018-11-14 17:32:41,653 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 19 states. [2018-11-14 17:32:41,654 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 19 states. [2018-11-14 17:32:41,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:41,657 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-11-14 17:32:41,657 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-14 17:32:41,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:41,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:41,658 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 21 states. [2018-11-14 17:32:41,659 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 21 states. [2018-11-14 17:32:41,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:41,661 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-11-14 17:32:41,662 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-14 17:32:41,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:41,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:41,663 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:32:41,663 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:32:41,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 17:32:41,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-11-14 17:32:41,665 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 11 [2018-11-14 17:32:41,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:32:41,665 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-11-14 17:32:41,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:32:41,666 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-14 17:32:41,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 17:32:41,667 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:32:41,667 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:32:41,667 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:32:41,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:32:41,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1261609818, now seen corresponding path program 1 times [2018-11-14 17:32:41,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:32:41,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:32:41,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:41,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:32:41,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:41,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:42,062 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-11-14 17:32:42,276 INFO L256 TraceCheckUtils]: 0: Hoare triple {250#true} call ULTIMATE.init(); {250#true} is VALID [2018-11-14 17:32:42,276 INFO L273 TraceCheckUtils]: 1: Hoare triple {250#true} assume true; {250#true} is VALID [2018-11-14 17:32:42,276 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {250#true} {250#true} #36#return; {250#true} is VALID [2018-11-14 17:32:42,277 INFO L256 TraceCheckUtils]: 3: Hoare triple {250#true} call #t~ret1 := main(); {250#true} is VALID [2018-11-14 17:32:42,290 INFO L273 TraceCheckUtils]: 4: Hoare triple {250#true} ~x~0 := 0; {252#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:42,303 INFO L273 TraceCheckUtils]: 5: Hoare triple {252#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {252#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:42,316 INFO L273 TraceCheckUtils]: 6: Hoare triple {252#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {252#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:42,316 INFO L256 TraceCheckUtils]: 7: Hoare triple {252#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {250#true} is VALID [2018-11-14 17:32:42,324 INFO L273 TraceCheckUtils]: 8: Hoare triple {250#true} ~z := #in~z;#res := ~z + 2; {253#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:42,326 INFO L273 TraceCheckUtils]: 9: Hoare triple {253#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {253#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:42,335 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {253#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {252#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #40#return; {254#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-14 17:32:42,337 INFO L273 TraceCheckUtils]: 11: Hoare triple {254#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {255#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:32:42,342 INFO L273 TraceCheckUtils]: 12: Hoare triple {255#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {255#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:32:42,343 INFO L273 TraceCheckUtils]: 13: Hoare triple {255#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {251#false} is VALID [2018-11-14 17:32:42,344 INFO L256 TraceCheckUtils]: 14: Hoare triple {251#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {251#false} is VALID [2018-11-14 17:32:42,344 INFO L273 TraceCheckUtils]: 15: Hoare triple {251#false} ~cond := #in~cond; {251#false} is VALID [2018-11-14 17:32:42,344 INFO L273 TraceCheckUtils]: 16: Hoare triple {251#false} assume ~cond == 0; {251#false} is VALID [2018-11-14 17:32:42,345 INFO L273 TraceCheckUtils]: 17: Hoare triple {251#false} assume !false; {251#false} is VALID [2018-11-14 17:32:42,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:42,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:32:42,350 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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-14 17:32:42,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:32:42,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:42,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:42,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:32:42,666 INFO L256 TraceCheckUtils]: 0: Hoare triple {250#true} call ULTIMATE.init(); {250#true} is VALID [2018-11-14 17:32:42,666 INFO L273 TraceCheckUtils]: 1: Hoare triple {250#true} assume true; {250#true} is VALID [2018-11-14 17:32:42,667 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {250#true} {250#true} #36#return; {250#true} is VALID [2018-11-14 17:32:42,667 INFO L256 TraceCheckUtils]: 3: Hoare triple {250#true} call #t~ret1 := main(); {250#true} is VALID [2018-11-14 17:32:42,667 INFO L273 TraceCheckUtils]: 4: Hoare triple {250#true} ~x~0 := 0; {252#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:42,687 INFO L273 TraceCheckUtils]: 5: Hoare triple {252#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {252#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:42,696 INFO L273 TraceCheckUtils]: 6: Hoare triple {252#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {252#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:42,697 INFO L256 TraceCheckUtils]: 7: Hoare triple {252#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {250#true} is VALID [2018-11-14 17:32:42,704 INFO L273 TraceCheckUtils]: 8: Hoare triple {250#true} ~z := #in~z;#res := ~z + 2; {253#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:42,706 INFO L273 TraceCheckUtils]: 9: Hoare triple {253#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {253#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:42,707 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {253#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {252#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #40#return; {254#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-14 17:32:42,711 INFO L273 TraceCheckUtils]: 11: Hoare triple {254#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {292#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:42,716 INFO L273 TraceCheckUtils]: 12: Hoare triple {292#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {292#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:42,717 INFO L273 TraceCheckUtils]: 13: Hoare triple {292#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 268435455); {251#false} is VALID [2018-11-14 17:32:42,717 INFO L256 TraceCheckUtils]: 14: Hoare triple {251#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {251#false} is VALID [2018-11-14 17:32:42,717 INFO L273 TraceCheckUtils]: 15: Hoare triple {251#false} ~cond := #in~cond; {251#false} is VALID [2018-11-14 17:32:42,717 INFO L273 TraceCheckUtils]: 16: Hoare triple {251#false} assume ~cond == 0; {251#false} is VALID [2018-11-14 17:32:42,718 INFO L273 TraceCheckUtils]: 17: Hoare triple {251#false} assume !false; {251#false} is VALID [2018-11-14 17:32:42,719 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:42,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:32:42,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-14 17:32:42,740 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-11-14 17:32:42,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:32:42,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 17:32:42,859 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:42,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 17:32:42,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 17:32:42,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:32:42,861 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 7 states. [2018-11-14 17:32:43,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:43,331 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2018-11-14 17:32:43,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:32:43,331 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-11-14 17:32:43,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:32:43,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:32:43,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2018-11-14 17:32:43,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:32:43,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2018-11-14 17:32:43,338 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 32 transitions. [2018-11-14 17:32:43,454 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:43,456 INFO L225 Difference]: With dead ends: 30 [2018-11-14 17:32:43,456 INFO L226 Difference]: Without dead ends: 25 [2018-11-14 17:32:43,457 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:32:43,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-14 17:32:43,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-11-14 17:32:43,484 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:32:43,484 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 23 states. [2018-11-14 17:32:43,485 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 23 states. [2018-11-14 17:32:43,485 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 23 states. [2018-11-14 17:32:43,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:43,488 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-11-14 17:32:43,488 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-14 17:32:43,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:43,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:43,489 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 25 states. [2018-11-14 17:32:43,489 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 25 states. [2018-11-14 17:32:43,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:43,493 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-11-14 17:32:43,493 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-14 17:32:43,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:43,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:43,494 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:32:43,494 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:32:43,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 17:32:43,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-11-14 17:32:43,496 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 18 [2018-11-14 17:32:43,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:32:43,497 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-14 17:32:43,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 17:32:43,497 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-11-14 17:32:43,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 17:32:43,498 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:32:43,498 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:32:43,499 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:32:43,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:32:43,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1235124260, now seen corresponding path program 2 times [2018-11-14 17:32:43,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:32:43,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:32:43,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:43,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:32:43,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:43,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:44,029 INFO L256 TraceCheckUtils]: 0: Hoare triple {442#true} call ULTIMATE.init(); {442#true} is VALID [2018-11-14 17:32:44,030 INFO L273 TraceCheckUtils]: 1: Hoare triple {442#true} assume true; {442#true} is VALID [2018-11-14 17:32:44,030 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {442#true} {442#true} #36#return; {442#true} is VALID [2018-11-14 17:32:44,031 INFO L256 TraceCheckUtils]: 3: Hoare triple {442#true} call #t~ret1 := main(); {442#true} is VALID [2018-11-14 17:32:44,032 INFO L273 TraceCheckUtils]: 4: Hoare triple {442#true} ~x~0 := 0; {444#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:44,034 INFO L273 TraceCheckUtils]: 5: Hoare triple {444#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {444#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:44,035 INFO L273 TraceCheckUtils]: 6: Hoare triple {444#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {444#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:44,036 INFO L256 TraceCheckUtils]: 7: Hoare triple {444#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {442#true} is VALID [2018-11-14 17:32:44,036 INFO L273 TraceCheckUtils]: 8: Hoare triple {442#true} ~z := #in~z;#res := ~z + 2; {445#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:44,037 INFO L273 TraceCheckUtils]: 9: Hoare triple {445#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {445#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:44,038 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {445#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {444#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #40#return; {446#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-14 17:32:44,039 INFO L273 TraceCheckUtils]: 11: Hoare triple {446#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {447#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:44,040 INFO L273 TraceCheckUtils]: 12: Hoare triple {447#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {447#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:44,041 INFO L273 TraceCheckUtils]: 13: Hoare triple {447#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {447#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:44,041 INFO L256 TraceCheckUtils]: 14: Hoare triple {447#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {442#true} is VALID [2018-11-14 17:32:44,043 INFO L273 TraceCheckUtils]: 15: Hoare triple {442#true} ~z := #in~z;#res := ~z + 2; {445#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:44,044 INFO L273 TraceCheckUtils]: 16: Hoare triple {445#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {445#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:44,045 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {445#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {447#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #40#return; {448#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-14 17:32:44,046 INFO L273 TraceCheckUtils]: 18: Hoare triple {448#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {449#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:32:44,047 INFO L273 TraceCheckUtils]: 19: Hoare triple {449#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {449#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:32:44,048 INFO L273 TraceCheckUtils]: 20: Hoare triple {449#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {443#false} is VALID [2018-11-14 17:32:44,048 INFO L256 TraceCheckUtils]: 21: Hoare triple {443#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {443#false} is VALID [2018-11-14 17:32:44,049 INFO L273 TraceCheckUtils]: 22: Hoare triple {443#false} ~cond := #in~cond; {443#false} is VALID [2018-11-14 17:32:44,049 INFO L273 TraceCheckUtils]: 23: Hoare triple {443#false} assume ~cond == 0; {443#false} is VALID [2018-11-14 17:32:44,049 INFO L273 TraceCheckUtils]: 24: Hoare triple {443#false} assume !false; {443#false} is VALID [2018-11-14 17:32:44,052 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-14 17:32:44,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:32:44,053 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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-14 17:32:44,069 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:32:44,097 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:32:44,097 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:32:44,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:44,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:32:44,324 INFO L256 TraceCheckUtils]: 0: Hoare triple {442#true} call ULTIMATE.init(); {442#true} is VALID [2018-11-14 17:32:44,325 INFO L273 TraceCheckUtils]: 1: Hoare triple {442#true} assume true; {442#true} is VALID [2018-11-14 17:32:44,325 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {442#true} {442#true} #36#return; {442#true} is VALID [2018-11-14 17:32:44,325 INFO L256 TraceCheckUtils]: 3: Hoare triple {442#true} call #t~ret1 := main(); {442#true} is VALID [2018-11-14 17:32:44,326 INFO L273 TraceCheckUtils]: 4: Hoare triple {442#true} ~x~0 := 0; {444#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:44,330 INFO L273 TraceCheckUtils]: 5: Hoare triple {444#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {444#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:44,330 INFO L273 TraceCheckUtils]: 6: Hoare triple {444#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {444#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:44,331 INFO L256 TraceCheckUtils]: 7: Hoare triple {444#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {442#true} is VALID [2018-11-14 17:32:44,331 INFO L273 TraceCheckUtils]: 8: Hoare triple {442#true} ~z := #in~z;#res := ~z + 2; {445#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:44,332 INFO L273 TraceCheckUtils]: 9: Hoare triple {445#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {445#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:44,333 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {445#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {444#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #40#return; {446#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-14 17:32:44,334 INFO L273 TraceCheckUtils]: 11: Hoare triple {446#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {447#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:44,335 INFO L273 TraceCheckUtils]: 12: Hoare triple {447#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {447#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:44,336 INFO L273 TraceCheckUtils]: 13: Hoare triple {447#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {447#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:44,337 INFO L256 TraceCheckUtils]: 14: Hoare triple {447#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {442#true} is VALID [2018-11-14 17:32:44,344 INFO L273 TraceCheckUtils]: 15: Hoare triple {442#true} ~z := #in~z;#res := ~z + 2; {445#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:44,345 INFO L273 TraceCheckUtils]: 16: Hoare triple {445#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {445#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:44,346 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {445#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {447#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #40#return; {448#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-14 17:32:44,358 INFO L273 TraceCheckUtils]: 18: Hoare triple {448#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {507#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:32:44,359 INFO L273 TraceCheckUtils]: 19: Hoare triple {507#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {507#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:32:44,360 INFO L273 TraceCheckUtils]: 20: Hoare triple {507#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(~x~0 % 4294967296 < 268435455); {443#false} is VALID [2018-11-14 17:32:44,360 INFO L256 TraceCheckUtils]: 21: Hoare triple {443#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {443#false} is VALID [2018-11-14 17:32:44,361 INFO L273 TraceCheckUtils]: 22: Hoare triple {443#false} ~cond := #in~cond; {443#false} is VALID [2018-11-14 17:32:44,361 INFO L273 TraceCheckUtils]: 23: Hoare triple {443#false} assume ~cond == 0; {443#false} is VALID [2018-11-14 17:32:44,361 INFO L273 TraceCheckUtils]: 24: Hoare triple {443#false} assume !false; {443#false} is VALID [2018-11-14 17:32:44,363 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-14 17:32:44,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:32:44,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-14 17:32:44,387 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-11-14 17:32:44,388 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:32:44,388 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 17:32:44,418 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:44,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 17:32:44,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 17:32:44,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-14 17:32:44,419 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 9 states. [2018-11-14 17:32:44,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:44,854 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-14 17:32:44,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 17:32:44,854 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-11-14 17:32:44,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:32:44,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 17:32:44,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2018-11-14 17:32:44,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 17:32:44,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2018-11-14 17:32:44,861 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 37 transitions. [2018-11-14 17:32:44,910 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:44,912 INFO L225 Difference]: With dead ends: 34 [2018-11-14 17:32:44,913 INFO L226 Difference]: Without dead ends: 29 [2018-11-14 17:32:44,913 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-11-14 17:32:44,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-14 17:32:44,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-11-14 17:32:44,939 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:32:44,940 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 27 states. [2018-11-14 17:32:44,940 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 27 states. [2018-11-14 17:32:44,940 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 27 states. [2018-11-14 17:32:44,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:44,944 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-14 17:32:44,944 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-14 17:32:44,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:44,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:44,945 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 29 states. [2018-11-14 17:32:44,945 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 29 states. [2018-11-14 17:32:44,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:44,948 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-14 17:32:44,949 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-14 17:32:44,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:44,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:44,950 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:32:44,950 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:32:44,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 17:32:44,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-11-14 17:32:44,953 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 25 [2018-11-14 17:32:44,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:32:44,953 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-11-14 17:32:44,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 17:32:44,954 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-14 17:32:44,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-14 17:32:44,955 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:32:44,955 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:32:44,955 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:32:44,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:32:44,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1046211866, now seen corresponding path program 3 times [2018-11-14 17:32:44,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:32:44,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:32:44,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:44,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:32:44,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:44,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:45,494 INFO L256 TraceCheckUtils]: 0: Hoare triple {679#true} call ULTIMATE.init(); {679#true} is VALID [2018-11-14 17:32:45,494 INFO L273 TraceCheckUtils]: 1: Hoare triple {679#true} assume true; {679#true} is VALID [2018-11-14 17:32:45,495 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {679#true} {679#true} #36#return; {679#true} is VALID [2018-11-14 17:32:45,495 INFO L256 TraceCheckUtils]: 3: Hoare triple {679#true} call #t~ret1 := main(); {679#true} is VALID [2018-11-14 17:32:45,497 INFO L273 TraceCheckUtils]: 4: Hoare triple {679#true} ~x~0 := 0; {681#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:45,498 INFO L273 TraceCheckUtils]: 5: Hoare triple {681#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {681#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:45,500 INFO L273 TraceCheckUtils]: 6: Hoare triple {681#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {681#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:45,500 INFO L256 TraceCheckUtils]: 7: Hoare triple {681#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {679#true} is VALID [2018-11-14 17:32:45,501 INFO L273 TraceCheckUtils]: 8: Hoare triple {679#true} ~z := #in~z;#res := ~z + 2; {682#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:45,501 INFO L273 TraceCheckUtils]: 9: Hoare triple {682#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {682#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:45,502 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {682#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {681#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #40#return; {683#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-14 17:32:45,503 INFO L273 TraceCheckUtils]: 11: Hoare triple {683#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {684#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:45,504 INFO L273 TraceCheckUtils]: 12: Hoare triple {684#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {684#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:45,519 INFO L273 TraceCheckUtils]: 13: Hoare triple {684#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {684#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:45,519 INFO L256 TraceCheckUtils]: 14: Hoare triple {684#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {679#true} is VALID [2018-11-14 17:32:45,534 INFO L273 TraceCheckUtils]: 15: Hoare triple {679#true} ~z := #in~z;#res := ~z + 2; {682#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:45,535 INFO L273 TraceCheckUtils]: 16: Hoare triple {682#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {682#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:45,537 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {682#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {684#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #40#return; {685#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-14 17:32:45,537 INFO L273 TraceCheckUtils]: 18: Hoare triple {685#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {686#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:32:45,538 INFO L273 TraceCheckUtils]: 19: Hoare triple {686#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {686#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:32:45,539 INFO L273 TraceCheckUtils]: 20: Hoare triple {686#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {686#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:32:45,540 INFO L256 TraceCheckUtils]: 21: Hoare triple {686#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {679#true} is VALID [2018-11-14 17:32:45,544 INFO L273 TraceCheckUtils]: 22: Hoare triple {679#true} ~z := #in~z;#res := ~z + 2; {682#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:45,545 INFO L273 TraceCheckUtils]: 23: Hoare triple {682#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {682#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:45,546 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {682#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {686#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #40#return; {687#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-14 17:32:45,547 INFO L273 TraceCheckUtils]: 25: Hoare triple {687#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {688#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:32:45,548 INFO L273 TraceCheckUtils]: 26: Hoare triple {688#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {688#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:32:45,549 INFO L273 TraceCheckUtils]: 27: Hoare triple {688#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {680#false} is VALID [2018-11-14 17:32:45,549 INFO L256 TraceCheckUtils]: 28: Hoare triple {680#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {680#false} is VALID [2018-11-14 17:32:45,549 INFO L273 TraceCheckUtils]: 29: Hoare triple {680#false} ~cond := #in~cond; {680#false} is VALID [2018-11-14 17:32:45,549 INFO L273 TraceCheckUtils]: 30: Hoare triple {680#false} assume ~cond == 0; {680#false} is VALID [2018-11-14 17:32:45,550 INFO L273 TraceCheckUtils]: 31: Hoare triple {680#false} assume !false; {680#false} is VALID [2018-11-14 17:32:45,554 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-14 17:32:45,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:32:45,554 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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-14 17:32:45,565 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:32:45,584 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-14 17:32:45,585 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:32:45,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:45,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:32:45,957 INFO L256 TraceCheckUtils]: 0: Hoare triple {679#true} call ULTIMATE.init(); {679#true} is VALID [2018-11-14 17:32:45,957 INFO L273 TraceCheckUtils]: 1: Hoare triple {679#true} assume true; {679#true} is VALID [2018-11-14 17:32:45,958 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {679#true} {679#true} #36#return; {679#true} is VALID [2018-11-14 17:32:45,958 INFO L256 TraceCheckUtils]: 3: Hoare triple {679#true} call #t~ret1 := main(); {679#true} is VALID [2018-11-14 17:32:45,958 INFO L273 TraceCheckUtils]: 4: Hoare triple {679#true} ~x~0 := 0; {681#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:45,959 INFO L273 TraceCheckUtils]: 5: Hoare triple {681#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {681#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:45,959 INFO L273 TraceCheckUtils]: 6: Hoare triple {681#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {681#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:45,960 INFO L256 TraceCheckUtils]: 7: Hoare triple {681#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {679#true} is VALID [2018-11-14 17:32:45,960 INFO L273 TraceCheckUtils]: 8: Hoare triple {679#true} ~z := #in~z;#res := ~z + 2; {682#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:45,961 INFO L273 TraceCheckUtils]: 9: Hoare triple {682#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {682#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:45,962 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {682#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {681#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #40#return; {683#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-14 17:32:45,964 INFO L273 TraceCheckUtils]: 11: Hoare triple {683#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {684#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:45,964 INFO L273 TraceCheckUtils]: 12: Hoare triple {684#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {684#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:45,965 INFO L273 TraceCheckUtils]: 13: Hoare triple {684#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {684#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:45,966 INFO L256 TraceCheckUtils]: 14: Hoare triple {684#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {679#true} is VALID [2018-11-14 17:32:45,967 INFO L273 TraceCheckUtils]: 15: Hoare triple {679#true} ~z := #in~z;#res := ~z + 2; {682#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:45,968 INFO L273 TraceCheckUtils]: 16: Hoare triple {682#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {682#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:45,975 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {682#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {684#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #40#return; {685#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-14 17:32:45,985 INFO L273 TraceCheckUtils]: 18: Hoare triple {685#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {686#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:32:45,988 INFO L273 TraceCheckUtils]: 19: Hoare triple {686#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {686#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:32:45,989 INFO L273 TraceCheckUtils]: 20: Hoare triple {686#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {686#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:32:45,989 INFO L256 TraceCheckUtils]: 21: Hoare triple {686#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {679#true} is VALID [2018-11-14 17:32:45,990 INFO L273 TraceCheckUtils]: 22: Hoare triple {679#true} ~z := #in~z;#res := ~z + 2; {682#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:45,991 INFO L273 TraceCheckUtils]: 23: Hoare triple {682#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {682#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:45,992 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {682#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {686#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #40#return; {687#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-14 17:32:45,993 INFO L273 TraceCheckUtils]: 25: Hoare triple {687#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {767#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:32:45,994 INFO L273 TraceCheckUtils]: 26: Hoare triple {767#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {767#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:32:45,995 INFO L273 TraceCheckUtils]: 27: Hoare triple {767#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {680#false} is VALID [2018-11-14 17:32:45,995 INFO L256 TraceCheckUtils]: 28: Hoare triple {680#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {680#false} is VALID [2018-11-14 17:32:45,996 INFO L273 TraceCheckUtils]: 29: Hoare triple {680#false} ~cond := #in~cond; {680#false} is VALID [2018-11-14 17:32:45,996 INFO L273 TraceCheckUtils]: 30: Hoare triple {680#false} assume ~cond == 0; {680#false} is VALID [2018-11-14 17:32:45,997 INFO L273 TraceCheckUtils]: 31: Hoare triple {680#false} assume !false; {680#false} is VALID [2018-11-14 17:32:46,000 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-14 17:32:46,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:32:46,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-14 17:32:46,022 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-11-14 17:32:46,024 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:32:46,024 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 17:32:46,063 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:46,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 17:32:46,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 17:32:46,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-14 17:32:46,064 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 11 states. [2018-11-14 17:32:46,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:46,698 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2018-11-14 17:32:46,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 17:32:46,698 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-11-14 17:32:46,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:32:46,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 17:32:46,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2018-11-14 17:32:46,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 17:32:46,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2018-11-14 17:32:46,705 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 42 transitions. [2018-11-14 17:32:46,765 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:46,767 INFO L225 Difference]: With dead ends: 38 [2018-11-14 17:32:46,767 INFO L226 Difference]: Without dead ends: 33 [2018-11-14 17:32:46,768 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-11-14 17:32:46,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-14 17:32:46,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-11-14 17:32:46,791 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:32:46,792 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 31 states. [2018-11-14 17:32:46,792 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 31 states. [2018-11-14 17:32:46,792 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 31 states. [2018-11-14 17:32:46,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:46,796 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-14 17:32:46,796 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-14 17:32:46,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:46,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:46,797 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 33 states. [2018-11-14 17:32:46,797 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 33 states. [2018-11-14 17:32:46,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:46,800 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-14 17:32:46,800 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-14 17:32:46,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:46,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:46,802 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:32:46,802 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:32:46,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 17:32:46,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-11-14 17:32:46,804 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 32 [2018-11-14 17:32:46,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:32:46,805 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-11-14 17:32:46,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 17:32:46,805 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-11-14 17:32:46,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-14 17:32:46,806 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:32:46,807 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:32:46,807 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:32:46,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:32:46,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1312440804, now seen corresponding path program 4 times [2018-11-14 17:32:46,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:32:46,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:32:46,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:46,809 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:32:46,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:46,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:47,417 INFO L256 TraceCheckUtils]: 0: Hoare triple {961#true} call ULTIMATE.init(); {961#true} is VALID [2018-11-14 17:32:47,417 INFO L273 TraceCheckUtils]: 1: Hoare triple {961#true} assume true; {961#true} is VALID [2018-11-14 17:32:47,417 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {961#true} {961#true} #36#return; {961#true} is VALID [2018-11-14 17:32:47,418 INFO L256 TraceCheckUtils]: 3: Hoare triple {961#true} call #t~ret1 := main(); {961#true} is VALID [2018-11-14 17:32:47,418 INFO L273 TraceCheckUtils]: 4: Hoare triple {961#true} ~x~0 := 0; {963#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:47,419 INFO L273 TraceCheckUtils]: 5: Hoare triple {963#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {963#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:47,419 INFO L273 TraceCheckUtils]: 6: Hoare triple {963#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {963#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:47,419 INFO L256 TraceCheckUtils]: 7: Hoare triple {963#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {961#true} is VALID [2018-11-14 17:32:47,420 INFO L273 TraceCheckUtils]: 8: Hoare triple {961#true} ~z := #in~z;#res := ~z + 2; {964#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:47,421 INFO L273 TraceCheckUtils]: 9: Hoare triple {964#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {964#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:47,423 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {964#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {963#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #40#return; {965#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-14 17:32:47,424 INFO L273 TraceCheckUtils]: 11: Hoare triple {965#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {966#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:47,425 INFO L273 TraceCheckUtils]: 12: Hoare triple {966#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {966#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:47,426 INFO L273 TraceCheckUtils]: 13: Hoare triple {966#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {966#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:47,426 INFO L256 TraceCheckUtils]: 14: Hoare triple {966#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {961#true} is VALID [2018-11-14 17:32:47,427 INFO L273 TraceCheckUtils]: 15: Hoare triple {961#true} ~z := #in~z;#res := ~z + 2; {964#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:47,428 INFO L273 TraceCheckUtils]: 16: Hoare triple {964#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {964#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:47,430 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {964#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {966#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #40#return; {967#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-14 17:32:47,431 INFO L273 TraceCheckUtils]: 18: Hoare triple {967#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {968#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:32:47,432 INFO L273 TraceCheckUtils]: 19: Hoare triple {968#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {968#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:32:47,432 INFO L273 TraceCheckUtils]: 20: Hoare triple {968#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {968#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:32:47,433 INFO L256 TraceCheckUtils]: 21: Hoare triple {968#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {961#true} is VALID [2018-11-14 17:32:47,435 INFO L273 TraceCheckUtils]: 22: Hoare triple {961#true} ~z := #in~z;#res := ~z + 2; {964#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:47,435 INFO L273 TraceCheckUtils]: 23: Hoare triple {964#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {964#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:47,437 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {964#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {968#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #40#return; {969#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-14 17:32:47,438 INFO L273 TraceCheckUtils]: 25: Hoare triple {969#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {970#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:32:47,439 INFO L273 TraceCheckUtils]: 26: Hoare triple {970#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {970#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:32:47,440 INFO L273 TraceCheckUtils]: 27: Hoare triple {970#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {970#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:32:47,440 INFO L256 TraceCheckUtils]: 28: Hoare triple {970#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call #t~ret0 := f(~x~0); {961#true} is VALID [2018-11-14 17:32:47,441 INFO L273 TraceCheckUtils]: 29: Hoare triple {961#true} ~z := #in~z;#res := ~z + 2; {964#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:47,442 INFO L273 TraceCheckUtils]: 30: Hoare triple {964#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {964#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:47,443 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {964#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {970#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #40#return; {971#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} is VALID [2018-11-14 17:32:47,445 INFO L273 TraceCheckUtils]: 32: Hoare triple {971#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {972#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:32:47,446 INFO L273 TraceCheckUtils]: 33: Hoare triple {972#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {972#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:32:47,468 INFO L273 TraceCheckUtils]: 34: Hoare triple {972#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {962#false} is VALID [2018-11-14 17:32:47,468 INFO L256 TraceCheckUtils]: 35: Hoare triple {962#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {962#false} is VALID [2018-11-14 17:32:47,468 INFO L273 TraceCheckUtils]: 36: Hoare triple {962#false} ~cond := #in~cond; {962#false} is VALID [2018-11-14 17:32:47,469 INFO L273 TraceCheckUtils]: 37: Hoare triple {962#false} assume ~cond == 0; {962#false} is VALID [2018-11-14 17:32:47,469 INFO L273 TraceCheckUtils]: 38: Hoare triple {962#false} assume !false; {962#false} is VALID [2018-11-14 17:32:47,472 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-14 17:32:47,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:32:47,472 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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-14 17:32:47,485 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:32:47,502 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:32:47,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:32:47,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:47,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:32:47,872 INFO L256 TraceCheckUtils]: 0: Hoare triple {961#true} call ULTIMATE.init(); {961#true} is VALID [2018-11-14 17:32:47,872 INFO L273 TraceCheckUtils]: 1: Hoare triple {961#true} assume true; {961#true} is VALID [2018-11-14 17:32:47,873 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {961#true} {961#true} #36#return; {961#true} is VALID [2018-11-14 17:32:47,873 INFO L256 TraceCheckUtils]: 3: Hoare triple {961#true} call #t~ret1 := main(); {961#true} is VALID [2018-11-14 17:32:47,877 INFO L273 TraceCheckUtils]: 4: Hoare triple {961#true} ~x~0 := 0; {963#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:47,877 INFO L273 TraceCheckUtils]: 5: Hoare triple {963#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {963#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:47,879 INFO L273 TraceCheckUtils]: 6: Hoare triple {963#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {963#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:47,879 INFO L256 TraceCheckUtils]: 7: Hoare triple {963#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {961#true} is VALID [2018-11-14 17:32:47,881 INFO L273 TraceCheckUtils]: 8: Hoare triple {961#true} ~z := #in~z;#res := ~z + 2; {964#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:47,883 INFO L273 TraceCheckUtils]: 9: Hoare triple {964#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {964#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:47,888 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {964#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {963#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #40#return; {965#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-14 17:32:47,889 INFO L273 TraceCheckUtils]: 11: Hoare triple {965#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {966#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:47,889 INFO L273 TraceCheckUtils]: 12: Hoare triple {966#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {966#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:47,890 INFO L273 TraceCheckUtils]: 13: Hoare triple {966#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {966#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:47,890 INFO L256 TraceCheckUtils]: 14: Hoare triple {966#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {961#true} is VALID [2018-11-14 17:32:47,891 INFO L273 TraceCheckUtils]: 15: Hoare triple {961#true} ~z := #in~z;#res := ~z + 2; {964#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:47,893 INFO L273 TraceCheckUtils]: 16: Hoare triple {964#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {964#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:47,898 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {964#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {966#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #40#return; {967#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-14 17:32:47,899 INFO L273 TraceCheckUtils]: 18: Hoare triple {967#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {968#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:32:47,899 INFO L273 TraceCheckUtils]: 19: Hoare triple {968#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {968#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:32:47,900 INFO L273 TraceCheckUtils]: 20: Hoare triple {968#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {968#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:32:47,900 INFO L256 TraceCheckUtils]: 21: Hoare triple {968#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {961#true} is VALID [2018-11-14 17:32:47,903 INFO L273 TraceCheckUtils]: 22: Hoare triple {961#true} ~z := #in~z;#res := ~z + 2; {964#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:47,903 INFO L273 TraceCheckUtils]: 23: Hoare triple {964#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {964#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:47,905 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {964#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {968#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #40#return; {969#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-14 17:32:47,906 INFO L273 TraceCheckUtils]: 25: Hoare triple {969#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {970#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:32:47,908 INFO L273 TraceCheckUtils]: 26: Hoare triple {970#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {970#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:32:47,909 INFO L273 TraceCheckUtils]: 27: Hoare triple {970#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {970#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:32:47,909 INFO L256 TraceCheckUtils]: 28: Hoare triple {970#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call #t~ret0 := f(~x~0); {961#true} is VALID [2018-11-14 17:32:47,914 INFO L273 TraceCheckUtils]: 29: Hoare triple {961#true} ~z := #in~z;#res := ~z + 2; {964#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:47,916 INFO L273 TraceCheckUtils]: 30: Hoare triple {964#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {964#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:47,917 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {964#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {970#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #40#return; {971#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} is VALID [2018-11-14 17:32:47,918 INFO L273 TraceCheckUtils]: 32: Hoare triple {971#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1072#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:32:47,919 INFO L273 TraceCheckUtils]: 33: Hoare triple {1072#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {1072#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:32:47,920 INFO L273 TraceCheckUtils]: 34: Hoare triple {1072#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(~x~0 % 4294967296 < 268435455); {962#false} is VALID [2018-11-14 17:32:47,920 INFO L256 TraceCheckUtils]: 35: Hoare triple {962#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {962#false} is VALID [2018-11-14 17:32:47,921 INFO L273 TraceCheckUtils]: 36: Hoare triple {962#false} ~cond := #in~cond; {962#false} is VALID [2018-11-14 17:32:47,921 INFO L273 TraceCheckUtils]: 37: Hoare triple {962#false} assume ~cond == 0; {962#false} is VALID [2018-11-14 17:32:47,921 INFO L273 TraceCheckUtils]: 38: Hoare triple {962#false} assume !false; {962#false} is VALID [2018-11-14 17:32:47,926 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-14 17:32:47,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:32:47,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-14 17:32:47,956 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2018-11-14 17:32:47,956 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:32:47,957 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-14 17:32:48,048 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:48,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-14 17:32:48,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-14 17:32:48,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-11-14 17:32:48,050 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 13 states. [2018-11-14 17:32:49,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:49,157 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-11-14 17:32:49,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 17:32:49,157 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2018-11-14 17:32:49,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:32:49,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 17:32:49,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 47 transitions. [2018-11-14 17:32:49,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 17:32:49,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 47 transitions. [2018-11-14 17:32:49,172 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 47 transitions. [2018-11-14 17:32:49,229 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:49,231 INFO L225 Difference]: With dead ends: 42 [2018-11-14 17:32:49,231 INFO L226 Difference]: Without dead ends: 37 [2018-11-14 17:32:49,232 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-11-14 17:32:49,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-14 17:32:49,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-11-14 17:32:49,274 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:32:49,274 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 35 states. [2018-11-14 17:32:49,274 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 35 states. [2018-11-14 17:32:49,274 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 35 states. [2018-11-14 17:32:49,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:49,277 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-11-14 17:32:49,277 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-11-14 17:32:49,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:49,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:49,278 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 37 states. [2018-11-14 17:32:49,278 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 37 states. [2018-11-14 17:32:49,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:49,281 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-11-14 17:32:49,281 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-11-14 17:32:49,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:49,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:49,282 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:32:49,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:32:49,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 17:32:49,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-11-14 17:32:49,284 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 39 [2018-11-14 17:32:49,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:32:49,285 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-11-14 17:32:49,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-14 17:32:49,285 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-14 17:32:49,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-14 17:32:49,286 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:32:49,287 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:32:49,287 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:32:49,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:32:49,287 INFO L82 PathProgramCache]: Analyzing trace with hash -341760294, now seen corresponding path program 5 times [2018-11-14 17:32:49,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:32:49,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:32:49,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:49,289 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:32:49,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:49,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:49,988 INFO L256 TraceCheckUtils]: 0: Hoare triple {1288#true} call ULTIMATE.init(); {1288#true} is VALID [2018-11-14 17:32:49,989 INFO L273 TraceCheckUtils]: 1: Hoare triple {1288#true} assume true; {1288#true} is VALID [2018-11-14 17:32:49,989 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1288#true} {1288#true} #36#return; {1288#true} is VALID [2018-11-14 17:32:49,990 INFO L256 TraceCheckUtils]: 3: Hoare triple {1288#true} call #t~ret1 := main(); {1288#true} is VALID [2018-11-14 17:32:49,992 INFO L273 TraceCheckUtils]: 4: Hoare triple {1288#true} ~x~0 := 0; {1290#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:49,995 INFO L273 TraceCheckUtils]: 5: Hoare triple {1290#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {1290#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:49,998 INFO L273 TraceCheckUtils]: 6: Hoare triple {1290#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1290#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:49,998 INFO L256 TraceCheckUtils]: 7: Hoare triple {1290#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {1288#true} is VALID [2018-11-14 17:32:50,000 INFO L273 TraceCheckUtils]: 8: Hoare triple {1288#true} ~z := #in~z;#res := ~z + 2; {1291#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:50,000 INFO L273 TraceCheckUtils]: 9: Hoare triple {1291#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1291#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:50,002 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {1291#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1290#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #40#return; {1292#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-14 17:32:50,002 INFO L273 TraceCheckUtils]: 11: Hoare triple {1292#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {1293#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:50,003 INFO L273 TraceCheckUtils]: 12: Hoare triple {1293#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {1293#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:50,003 INFO L273 TraceCheckUtils]: 13: Hoare triple {1293#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {1293#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:50,003 INFO L256 TraceCheckUtils]: 14: Hoare triple {1293#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {1288#true} is VALID [2018-11-14 17:32:50,004 INFO L273 TraceCheckUtils]: 15: Hoare triple {1288#true} ~z := #in~z;#res := ~z + 2; {1291#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:50,005 INFO L273 TraceCheckUtils]: 16: Hoare triple {1291#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1291#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:50,006 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {1291#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1293#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #40#return; {1294#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-14 17:32:50,007 INFO L273 TraceCheckUtils]: 18: Hoare triple {1294#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1295#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:32:50,008 INFO L273 TraceCheckUtils]: 19: Hoare triple {1295#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {1295#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:32:50,009 INFO L273 TraceCheckUtils]: 20: Hoare triple {1295#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {1295#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:32:50,009 INFO L256 TraceCheckUtils]: 21: Hoare triple {1295#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {1288#true} is VALID [2018-11-14 17:32:50,010 INFO L273 TraceCheckUtils]: 22: Hoare triple {1288#true} ~z := #in~z;#res := ~z + 2; {1291#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:50,011 INFO L273 TraceCheckUtils]: 23: Hoare triple {1291#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1291#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:50,012 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1291#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1295#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #40#return; {1296#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-14 17:32:50,013 INFO L273 TraceCheckUtils]: 25: Hoare triple {1296#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1297#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:32:50,014 INFO L273 TraceCheckUtils]: 26: Hoare triple {1297#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {1297#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:32:50,015 INFO L273 TraceCheckUtils]: 27: Hoare triple {1297#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1297#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:32:50,015 INFO L256 TraceCheckUtils]: 28: Hoare triple {1297#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call #t~ret0 := f(~x~0); {1288#true} is VALID [2018-11-14 17:32:50,016 INFO L273 TraceCheckUtils]: 29: Hoare triple {1288#true} ~z := #in~z;#res := ~z + 2; {1291#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:50,017 INFO L273 TraceCheckUtils]: 30: Hoare triple {1291#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1291#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:50,018 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {1291#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1297#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #40#return; {1298#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} is VALID [2018-11-14 17:32:50,020 INFO L273 TraceCheckUtils]: 32: Hoare triple {1298#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1299#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:32:50,021 INFO L273 TraceCheckUtils]: 33: Hoare triple {1299#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {1299#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:32:50,022 INFO L273 TraceCheckUtils]: 34: Hoare triple {1299#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {1299#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:32:50,022 INFO L256 TraceCheckUtils]: 35: Hoare triple {1299#(and (<= 8 main_~x~0) (<= main_~x~0 8))} call #t~ret0 := f(~x~0); {1288#true} is VALID [2018-11-14 17:32:50,023 INFO L273 TraceCheckUtils]: 36: Hoare triple {1288#true} ~z := #in~z;#res := ~z + 2; {1291#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:50,023 INFO L273 TraceCheckUtils]: 37: Hoare triple {1291#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1291#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:50,024 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {1291#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1299#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #40#return; {1300#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} is VALID [2018-11-14 17:32:50,025 INFO L273 TraceCheckUtils]: 39: Hoare triple {1300#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1301#(and (<= main_~x~0 10) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:32:50,026 INFO L273 TraceCheckUtils]: 40: Hoare triple {1301#(and (<= main_~x~0 10) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {1301#(and (<= main_~x~0 10) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:32:50,027 INFO L273 TraceCheckUtils]: 41: Hoare triple {1301#(and (<= main_~x~0 10) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {1289#false} is VALID [2018-11-14 17:32:50,027 INFO L256 TraceCheckUtils]: 42: Hoare triple {1289#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {1289#false} is VALID [2018-11-14 17:32:50,028 INFO L273 TraceCheckUtils]: 43: Hoare triple {1289#false} ~cond := #in~cond; {1289#false} is VALID [2018-11-14 17:32:50,028 INFO L273 TraceCheckUtils]: 44: Hoare triple {1289#false} assume ~cond == 0; {1289#false} is VALID [2018-11-14 17:32:50,028 INFO L273 TraceCheckUtils]: 45: Hoare triple {1289#false} assume !false; {1289#false} is VALID [2018-11-14 17:32:50,033 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-14 17:32:50,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:32:50,033 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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-14 17:32:50,041 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 17:32:50,908 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-14 17:32:50,908 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:32:50,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:50,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:32:51,209 INFO L256 TraceCheckUtils]: 0: Hoare triple {1288#true} call ULTIMATE.init(); {1288#true} is VALID [2018-11-14 17:32:51,209 INFO L273 TraceCheckUtils]: 1: Hoare triple {1288#true} assume true; {1288#true} is VALID [2018-11-14 17:32:51,210 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1288#true} {1288#true} #36#return; {1288#true} is VALID [2018-11-14 17:32:51,210 INFO L256 TraceCheckUtils]: 3: Hoare triple {1288#true} call #t~ret1 := main(); {1288#true} is VALID [2018-11-14 17:32:51,210 INFO L273 TraceCheckUtils]: 4: Hoare triple {1288#true} ~x~0 := 0; {1290#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:51,211 INFO L273 TraceCheckUtils]: 5: Hoare triple {1290#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {1290#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:51,211 INFO L273 TraceCheckUtils]: 6: Hoare triple {1290#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1290#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:51,211 INFO L256 TraceCheckUtils]: 7: Hoare triple {1290#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {1288#true} is VALID [2018-11-14 17:32:51,212 INFO L273 TraceCheckUtils]: 8: Hoare triple {1288#true} ~z := #in~z;#res := ~z + 2; {1291#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:51,212 INFO L273 TraceCheckUtils]: 9: Hoare triple {1291#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1291#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:51,213 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {1291#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1290#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #40#return; {1292#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-14 17:32:51,216 INFO L273 TraceCheckUtils]: 11: Hoare triple {1292#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {1293#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:51,217 INFO L273 TraceCheckUtils]: 12: Hoare triple {1293#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {1293#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:51,217 INFO L273 TraceCheckUtils]: 13: Hoare triple {1293#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {1293#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:51,217 INFO L256 TraceCheckUtils]: 14: Hoare triple {1293#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {1288#true} is VALID [2018-11-14 17:32:51,218 INFO L273 TraceCheckUtils]: 15: Hoare triple {1288#true} ~z := #in~z;#res := ~z + 2; {1291#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:51,219 INFO L273 TraceCheckUtils]: 16: Hoare triple {1291#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1291#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:51,220 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {1291#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1293#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #40#return; {1294#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-14 17:32:51,220 INFO L273 TraceCheckUtils]: 18: Hoare triple {1294#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1295#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:32:51,228 INFO L273 TraceCheckUtils]: 19: Hoare triple {1295#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {1295#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:32:51,228 INFO L273 TraceCheckUtils]: 20: Hoare triple {1295#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {1295#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:32:51,229 INFO L256 TraceCheckUtils]: 21: Hoare triple {1295#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {1288#true} is VALID [2018-11-14 17:32:51,229 INFO L273 TraceCheckUtils]: 22: Hoare triple {1288#true} ~z := #in~z;#res := ~z + 2; {1291#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:51,230 INFO L273 TraceCheckUtils]: 23: Hoare triple {1291#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1291#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:51,231 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1291#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1295#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #40#return; {1296#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-14 17:32:51,231 INFO L273 TraceCheckUtils]: 25: Hoare triple {1296#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1297#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:32:51,232 INFO L273 TraceCheckUtils]: 26: Hoare triple {1297#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {1297#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:32:51,232 INFO L273 TraceCheckUtils]: 27: Hoare triple {1297#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1297#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:32:51,232 INFO L256 TraceCheckUtils]: 28: Hoare triple {1297#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call #t~ret0 := f(~x~0); {1288#true} is VALID [2018-11-14 17:32:51,233 INFO L273 TraceCheckUtils]: 29: Hoare triple {1288#true} ~z := #in~z;#res := ~z + 2; {1291#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:51,234 INFO L273 TraceCheckUtils]: 30: Hoare triple {1291#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1291#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:51,236 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {1291#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1297#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #40#return; {1298#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} is VALID [2018-11-14 17:32:51,236 INFO L273 TraceCheckUtils]: 32: Hoare triple {1298#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1299#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:32:51,237 INFO L273 TraceCheckUtils]: 33: Hoare triple {1299#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {1299#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:32:51,238 INFO L273 TraceCheckUtils]: 34: Hoare triple {1299#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {1299#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:32:51,238 INFO L256 TraceCheckUtils]: 35: Hoare triple {1299#(and (<= 8 main_~x~0) (<= main_~x~0 8))} call #t~ret0 := f(~x~0); {1288#true} is VALID [2018-11-14 17:32:51,239 INFO L273 TraceCheckUtils]: 36: Hoare triple {1288#true} ~z := #in~z;#res := ~z + 2; {1291#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:51,240 INFO L273 TraceCheckUtils]: 37: Hoare triple {1291#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1291#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:51,241 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {1291#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1299#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #40#return; {1300#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} is VALID [2018-11-14 17:32:51,242 INFO L273 TraceCheckUtils]: 39: Hoare triple {1300#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1422#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:32:51,243 INFO L273 TraceCheckUtils]: 40: Hoare triple {1422#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {1422#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:32:51,244 INFO L273 TraceCheckUtils]: 41: Hoare triple {1422#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {1289#false} is VALID [2018-11-14 17:32:51,244 INFO L256 TraceCheckUtils]: 42: Hoare triple {1289#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {1289#false} is VALID [2018-11-14 17:32:51,244 INFO L273 TraceCheckUtils]: 43: Hoare triple {1289#false} ~cond := #in~cond; {1289#false} is VALID [2018-11-14 17:32:51,245 INFO L273 TraceCheckUtils]: 44: Hoare triple {1289#false} assume ~cond == 0; {1289#false} is VALID [2018-11-14 17:32:51,245 INFO L273 TraceCheckUtils]: 45: Hoare triple {1289#false} assume !false; {1289#false} is VALID [2018-11-14 17:32:51,249 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-14 17:32:51,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:32:51,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-14 17:32:51,271 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 46 [2018-11-14 17:32:51,271 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:32:51,271 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-14 17:32:51,314 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:51,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-14 17:32:51,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-14 17:32:51,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-11-14 17:32:51,316 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 15 states. [2018-11-14 17:32:52,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:52,527 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2018-11-14 17:32:52,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-14 17:32:52,527 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 46 [2018-11-14 17:32:52,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:32:52,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 17:32:52,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 52 transitions. [2018-11-14 17:32:52,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 17:32:52,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 52 transitions. [2018-11-14 17:32:52,533 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 52 transitions. [2018-11-14 17:32:52,588 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:52,589 INFO L225 Difference]: With dead ends: 46 [2018-11-14 17:32:52,590 INFO L226 Difference]: Without dead ends: 41 [2018-11-14 17:32:52,590 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 44 SyntacticMatches, 7 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2018-11-14 17:32:52,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-14 17:32:52,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2018-11-14 17:32:52,617 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:32:52,617 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 39 states. [2018-11-14 17:32:52,617 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 39 states. [2018-11-14 17:32:52,617 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 39 states. [2018-11-14 17:32:52,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:52,620 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2018-11-14 17:32:52,621 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-11-14 17:32:52,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:52,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:52,622 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 41 states. [2018-11-14 17:32:52,622 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 41 states. [2018-11-14 17:32:52,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:52,625 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2018-11-14 17:32:52,625 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-11-14 17:32:52,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:52,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:52,626 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:32:52,626 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:32:52,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-14 17:32:52,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-11-14 17:32:52,628 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 46 [2018-11-14 17:32:52,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:32:52,630 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-11-14 17:32:52,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-14 17:32:52,631 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-11-14 17:32:52,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-14 17:32:52,635 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:32:52,635 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:32:52,636 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:32:52,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:32:52,636 INFO L82 PathProgramCache]: Analyzing trace with hash -2000679844, now seen corresponding path program 6 times [2018-11-14 17:32:52,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:32:52,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:32:52,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:52,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:32:52,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:52,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:53,095 INFO L256 TraceCheckUtils]: 0: Hoare triple {1660#true} call ULTIMATE.init(); {1660#true} is VALID [2018-11-14 17:32:53,095 INFO L273 TraceCheckUtils]: 1: Hoare triple {1660#true} assume true; {1660#true} is VALID [2018-11-14 17:32:53,096 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1660#true} {1660#true} #36#return; {1660#true} is VALID [2018-11-14 17:32:53,096 INFO L256 TraceCheckUtils]: 3: Hoare triple {1660#true} call #t~ret1 := main(); {1660#true} is VALID [2018-11-14 17:32:53,096 INFO L273 TraceCheckUtils]: 4: Hoare triple {1660#true} ~x~0 := 0; {1662#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:53,097 INFO L273 TraceCheckUtils]: 5: Hoare triple {1662#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {1662#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:53,097 INFO L273 TraceCheckUtils]: 6: Hoare triple {1662#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1662#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:53,097 INFO L256 TraceCheckUtils]: 7: Hoare triple {1662#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {1660#true} is VALID [2018-11-14 17:32:53,103 INFO L273 TraceCheckUtils]: 8: Hoare triple {1660#true} ~z := #in~z;#res := ~z + 2; {1663#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:53,104 INFO L273 TraceCheckUtils]: 9: Hoare triple {1663#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1663#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:53,105 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {1663#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1662#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #40#return; {1664#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-14 17:32:53,106 INFO L273 TraceCheckUtils]: 11: Hoare triple {1664#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {1665#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:53,106 INFO L273 TraceCheckUtils]: 12: Hoare triple {1665#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {1665#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:53,107 INFO L273 TraceCheckUtils]: 13: Hoare triple {1665#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {1665#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:53,107 INFO L256 TraceCheckUtils]: 14: Hoare triple {1665#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {1660#true} is VALID [2018-11-14 17:32:53,108 INFO L273 TraceCheckUtils]: 15: Hoare triple {1660#true} ~z := #in~z;#res := ~z + 2; {1663#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:53,109 INFO L273 TraceCheckUtils]: 16: Hoare triple {1663#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1663#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:53,111 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {1663#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1665#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #40#return; {1666#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-14 17:32:53,112 INFO L273 TraceCheckUtils]: 18: Hoare triple {1666#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1667#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:32:53,112 INFO L273 TraceCheckUtils]: 19: Hoare triple {1667#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {1667#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:32:53,113 INFO L273 TraceCheckUtils]: 20: Hoare triple {1667#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {1667#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:32:53,113 INFO L256 TraceCheckUtils]: 21: Hoare triple {1667#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {1660#true} is VALID [2018-11-14 17:32:53,114 INFO L273 TraceCheckUtils]: 22: Hoare triple {1660#true} ~z := #in~z;#res := ~z + 2; {1663#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:53,115 INFO L273 TraceCheckUtils]: 23: Hoare triple {1663#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1663#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:53,117 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1663#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1667#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #40#return; {1668#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-14 17:32:53,118 INFO L273 TraceCheckUtils]: 25: Hoare triple {1668#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1669#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:32:53,118 INFO L273 TraceCheckUtils]: 26: Hoare triple {1669#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {1669#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:32:53,119 INFO L273 TraceCheckUtils]: 27: Hoare triple {1669#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1669#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:32:53,119 INFO L256 TraceCheckUtils]: 28: Hoare triple {1669#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call #t~ret0 := f(~x~0); {1660#true} is VALID [2018-11-14 17:32:53,120 INFO L273 TraceCheckUtils]: 29: Hoare triple {1660#true} ~z := #in~z;#res := ~z + 2; {1663#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:53,121 INFO L273 TraceCheckUtils]: 30: Hoare triple {1663#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1663#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:53,123 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {1663#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1669#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #40#return; {1670#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} is VALID [2018-11-14 17:32:53,124 INFO L273 TraceCheckUtils]: 32: Hoare triple {1670#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1671#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:32:53,124 INFO L273 TraceCheckUtils]: 33: Hoare triple {1671#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {1671#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:32:53,127 INFO L273 TraceCheckUtils]: 34: Hoare triple {1671#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {1671#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:32:53,127 INFO L256 TraceCheckUtils]: 35: Hoare triple {1671#(and (<= 8 main_~x~0) (<= main_~x~0 8))} call #t~ret0 := f(~x~0); {1660#true} is VALID [2018-11-14 17:32:53,128 INFO L273 TraceCheckUtils]: 36: Hoare triple {1660#true} ~z := #in~z;#res := ~z + 2; {1663#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:53,129 INFO L273 TraceCheckUtils]: 37: Hoare triple {1663#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1663#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:53,131 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {1663#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1671#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #40#return; {1672#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} is VALID [2018-11-14 17:32:53,131 INFO L273 TraceCheckUtils]: 39: Hoare triple {1672#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1673#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:32:53,132 INFO L273 TraceCheckUtils]: 40: Hoare triple {1673#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {1673#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:32:53,132 INFO L273 TraceCheckUtils]: 41: Hoare triple {1673#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1673#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:32:53,133 INFO L256 TraceCheckUtils]: 42: Hoare triple {1673#(and (<= main_~x~0 10) (<= 10 main_~x~0))} call #t~ret0 := f(~x~0); {1660#true} is VALID [2018-11-14 17:32:53,140 INFO L273 TraceCheckUtils]: 43: Hoare triple {1660#true} ~z := #in~z;#res := ~z + 2; {1663#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:53,141 INFO L273 TraceCheckUtils]: 44: Hoare triple {1663#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1663#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:53,142 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {1663#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1673#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #40#return; {1674#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} is VALID [2018-11-14 17:32:53,143 INFO L273 TraceCheckUtils]: 46: Hoare triple {1674#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1675#(and (<= main_~x~0 12) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:32:53,143 INFO L273 TraceCheckUtils]: 47: Hoare triple {1675#(and (<= main_~x~0 12) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {1675#(and (<= main_~x~0 12) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:32:53,144 INFO L273 TraceCheckUtils]: 48: Hoare triple {1675#(and (<= main_~x~0 12) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {1661#false} is VALID [2018-11-14 17:32:53,144 INFO L256 TraceCheckUtils]: 49: Hoare triple {1661#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {1661#false} is VALID [2018-11-14 17:32:53,144 INFO L273 TraceCheckUtils]: 50: Hoare triple {1661#false} ~cond := #in~cond; {1661#false} is VALID [2018-11-14 17:32:53,145 INFO L273 TraceCheckUtils]: 51: Hoare triple {1661#false} assume ~cond == 0; {1661#false} is VALID [2018-11-14 17:32:53,145 INFO L273 TraceCheckUtils]: 52: Hoare triple {1661#false} assume !false; {1661#false} is VALID [2018-11-14 17:32:53,149 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-14 17:32:53,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:32:53,149 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:32:53,161 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 17:32:53,204 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-14 17:32:53,205 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:32:53,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:53,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:32:53,678 INFO L256 TraceCheckUtils]: 0: Hoare triple {1660#true} call ULTIMATE.init(); {1660#true} is VALID [2018-11-14 17:32:53,678 INFO L273 TraceCheckUtils]: 1: Hoare triple {1660#true} assume true; {1660#true} is VALID [2018-11-14 17:32:53,678 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1660#true} {1660#true} #36#return; {1660#true} is VALID [2018-11-14 17:32:53,679 INFO L256 TraceCheckUtils]: 3: Hoare triple {1660#true} call #t~ret1 := main(); {1660#true} is VALID [2018-11-14 17:32:53,679 INFO L273 TraceCheckUtils]: 4: Hoare triple {1660#true} ~x~0 := 0; {1662#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:53,680 INFO L273 TraceCheckUtils]: 5: Hoare triple {1662#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {1662#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:53,680 INFO L273 TraceCheckUtils]: 6: Hoare triple {1662#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1662#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:53,680 INFO L256 TraceCheckUtils]: 7: Hoare triple {1662#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {1660#true} is VALID [2018-11-14 17:32:53,681 INFO L273 TraceCheckUtils]: 8: Hoare triple {1660#true} ~z := #in~z;#res := ~z + 2; {1663#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:53,681 INFO L273 TraceCheckUtils]: 9: Hoare triple {1663#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1663#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:53,683 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {1663#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1662#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #40#return; {1664#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-14 17:32:53,683 INFO L273 TraceCheckUtils]: 11: Hoare triple {1664#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {1665#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:53,684 INFO L273 TraceCheckUtils]: 12: Hoare triple {1665#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {1665#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:53,685 INFO L273 TraceCheckUtils]: 13: Hoare triple {1665#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {1665#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:53,685 INFO L256 TraceCheckUtils]: 14: Hoare triple {1665#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {1660#true} is VALID [2018-11-14 17:32:53,686 INFO L273 TraceCheckUtils]: 15: Hoare triple {1660#true} ~z := #in~z;#res := ~z + 2; {1663#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:53,687 INFO L273 TraceCheckUtils]: 16: Hoare triple {1663#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1663#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:53,688 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {1663#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1665#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #40#return; {1666#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-14 17:32:53,689 INFO L273 TraceCheckUtils]: 18: Hoare triple {1666#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1667#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:32:53,690 INFO L273 TraceCheckUtils]: 19: Hoare triple {1667#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {1667#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:32:53,690 INFO L273 TraceCheckUtils]: 20: Hoare triple {1667#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {1667#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:32:53,691 INFO L256 TraceCheckUtils]: 21: Hoare triple {1667#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {1660#true} is VALID [2018-11-14 17:32:53,691 INFO L273 TraceCheckUtils]: 22: Hoare triple {1660#true} ~z := #in~z;#res := ~z + 2; {1663#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:53,692 INFO L273 TraceCheckUtils]: 23: Hoare triple {1663#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1663#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:53,694 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1663#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1667#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #40#return; {1668#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-14 17:32:53,695 INFO L273 TraceCheckUtils]: 25: Hoare triple {1668#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1669#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:32:53,695 INFO L273 TraceCheckUtils]: 26: Hoare triple {1669#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {1669#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:32:53,696 INFO L273 TraceCheckUtils]: 27: Hoare triple {1669#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1669#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:32:53,696 INFO L256 TraceCheckUtils]: 28: Hoare triple {1669#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call #t~ret0 := f(~x~0); {1660#true} is VALID [2018-11-14 17:32:53,697 INFO L273 TraceCheckUtils]: 29: Hoare triple {1660#true} ~z := #in~z;#res := ~z + 2; {1663#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:53,698 INFO L273 TraceCheckUtils]: 30: Hoare triple {1663#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1663#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:53,699 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {1663#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1669#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #40#return; {1670#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} is VALID [2018-11-14 17:32:53,700 INFO L273 TraceCheckUtils]: 32: Hoare triple {1670#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1671#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:32:53,701 INFO L273 TraceCheckUtils]: 33: Hoare triple {1671#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {1671#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:32:53,702 INFO L273 TraceCheckUtils]: 34: Hoare triple {1671#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {1671#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:32:53,702 INFO L256 TraceCheckUtils]: 35: Hoare triple {1671#(and (<= 8 main_~x~0) (<= main_~x~0 8))} call #t~ret0 := f(~x~0); {1660#true} is VALID [2018-11-14 17:32:53,703 INFO L273 TraceCheckUtils]: 36: Hoare triple {1660#true} ~z := #in~z;#res := ~z + 2; {1663#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:53,725 INFO L273 TraceCheckUtils]: 37: Hoare triple {1663#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1663#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:53,741 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {1663#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1671#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #40#return; {1672#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} is VALID [2018-11-14 17:32:53,756 INFO L273 TraceCheckUtils]: 39: Hoare triple {1672#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1673#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:32:53,765 INFO L273 TraceCheckUtils]: 40: Hoare triple {1673#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {1673#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:32:53,767 INFO L273 TraceCheckUtils]: 41: Hoare triple {1673#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1673#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:32:53,767 INFO L256 TraceCheckUtils]: 42: Hoare triple {1673#(and (<= main_~x~0 10) (<= 10 main_~x~0))} call #t~ret0 := f(~x~0); {1660#true} is VALID [2018-11-14 17:32:53,769 INFO L273 TraceCheckUtils]: 43: Hoare triple {1660#true} ~z := #in~z;#res := ~z + 2; {1663#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:53,769 INFO L273 TraceCheckUtils]: 44: Hoare triple {1663#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1663#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:53,770 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {1663#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1673#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #40#return; {1674#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} is VALID [2018-11-14 17:32:53,771 INFO L273 TraceCheckUtils]: 46: Hoare triple {1674#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1817#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 17:32:53,772 INFO L273 TraceCheckUtils]: 47: Hoare triple {1817#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {1817#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 17:32:53,773 INFO L273 TraceCheckUtils]: 48: Hoare triple {1817#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {1661#false} is VALID [2018-11-14 17:32:53,773 INFO L256 TraceCheckUtils]: 49: Hoare triple {1661#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {1661#false} is VALID [2018-11-14 17:32:53,774 INFO L273 TraceCheckUtils]: 50: Hoare triple {1661#false} ~cond := #in~cond; {1661#false} is VALID [2018-11-14 17:32:53,774 INFO L273 TraceCheckUtils]: 51: Hoare triple {1661#false} assume ~cond == 0; {1661#false} is VALID [2018-11-14 17:32:53,774 INFO L273 TraceCheckUtils]: 52: Hoare triple {1661#false} assume !false; {1661#false} is VALID [2018-11-14 17:32:53,780 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-14 17:32:53,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:32:53,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-14 17:32:53,800 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 53 [2018-11-14 17:32:53,801 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:32:53,801 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-14 17:32:53,845 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:53,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-14 17:32:53,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-14 17:32:53,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-11-14 17:32:53,846 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 17 states. [2018-11-14 17:32:55,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:55,231 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2018-11-14 17:32:55,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-14 17:32:55,232 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 53 [2018-11-14 17:32:55,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:32:55,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 17:32:55,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 57 transitions. [2018-11-14 17:32:55,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 17:32:55,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 57 transitions. [2018-11-14 17:32:55,238 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 57 transitions. [2018-11-14 17:32:55,387 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:55,389 INFO L225 Difference]: With dead ends: 50 [2018-11-14 17:32:55,389 INFO L226 Difference]: Without dead ends: 45 [2018-11-14 17:32:55,390 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 51 SyntacticMatches, 8 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2018-11-14 17:32:55,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-14 17:32:55,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-11-14 17:32:55,521 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:32:55,521 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 43 states. [2018-11-14 17:32:55,521 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 43 states. [2018-11-14 17:32:55,521 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 43 states. [2018-11-14 17:32:55,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:55,525 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2018-11-14 17:32:55,525 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2018-11-14 17:32:55,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:55,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:55,526 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 45 states. [2018-11-14 17:32:55,526 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 45 states. [2018-11-14 17:32:55,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:55,529 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2018-11-14 17:32:55,529 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2018-11-14 17:32:55,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:55,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:55,530 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:32:55,530 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:32:55,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-14 17:32:55,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2018-11-14 17:32:55,533 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 53 [2018-11-14 17:32:55,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:32:55,533 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2018-11-14 17:32:55,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-14 17:32:55,534 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-11-14 17:32:55,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-14 17:32:55,534 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:32:55,535 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:32:55,535 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:32:55,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:32:55,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1151446886, now seen corresponding path program 7 times [2018-11-14 17:32:55,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:32:55,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:32:55,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:55,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:32:55,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:55,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:56,074 INFO L256 TraceCheckUtils]: 0: Hoare triple {2077#true} call ULTIMATE.init(); {2077#true} is VALID [2018-11-14 17:32:56,074 INFO L273 TraceCheckUtils]: 1: Hoare triple {2077#true} assume true; {2077#true} is VALID [2018-11-14 17:32:56,075 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2077#true} {2077#true} #36#return; {2077#true} is VALID [2018-11-14 17:32:56,075 INFO L256 TraceCheckUtils]: 3: Hoare triple {2077#true} call #t~ret1 := main(); {2077#true} is VALID [2018-11-14 17:32:56,076 INFO L273 TraceCheckUtils]: 4: Hoare triple {2077#true} ~x~0 := 0; {2079#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:56,077 INFO L273 TraceCheckUtils]: 5: Hoare triple {2079#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {2079#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:56,078 INFO L273 TraceCheckUtils]: 6: Hoare triple {2079#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2079#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:56,078 INFO L256 TraceCheckUtils]: 7: Hoare triple {2079#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {2077#true} is VALID [2018-11-14 17:32:56,079 INFO L273 TraceCheckUtils]: 8: Hoare triple {2077#true} ~z := #in~z;#res := ~z + 2; {2080#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:56,080 INFO L273 TraceCheckUtils]: 9: Hoare triple {2080#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2080#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:56,082 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {2080#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2079#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #40#return; {2081#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-14 17:32:56,083 INFO L273 TraceCheckUtils]: 11: Hoare triple {2081#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {2082#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:56,084 INFO L273 TraceCheckUtils]: 12: Hoare triple {2082#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {2082#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:56,085 INFO L273 TraceCheckUtils]: 13: Hoare triple {2082#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {2082#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:56,085 INFO L256 TraceCheckUtils]: 14: Hoare triple {2082#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {2077#true} is VALID [2018-11-14 17:32:56,086 INFO L273 TraceCheckUtils]: 15: Hoare triple {2077#true} ~z := #in~z;#res := ~z + 2; {2080#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:56,087 INFO L273 TraceCheckUtils]: 16: Hoare triple {2080#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2080#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:56,089 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {2080#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2082#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #40#return; {2083#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-14 17:32:56,090 INFO L273 TraceCheckUtils]: 18: Hoare triple {2083#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2084#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:32:56,091 INFO L273 TraceCheckUtils]: 19: Hoare triple {2084#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {2084#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:32:56,092 INFO L273 TraceCheckUtils]: 20: Hoare triple {2084#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {2084#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:32:56,092 INFO L256 TraceCheckUtils]: 21: Hoare triple {2084#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {2077#true} is VALID [2018-11-14 17:32:56,093 INFO L273 TraceCheckUtils]: 22: Hoare triple {2077#true} ~z := #in~z;#res := ~z + 2; {2080#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:56,094 INFO L273 TraceCheckUtils]: 23: Hoare triple {2080#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2080#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:56,096 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {2080#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2084#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #40#return; {2085#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-14 17:32:56,097 INFO L273 TraceCheckUtils]: 25: Hoare triple {2085#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2086#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:32:56,098 INFO L273 TraceCheckUtils]: 26: Hoare triple {2086#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {2086#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:32:56,117 INFO L273 TraceCheckUtils]: 27: Hoare triple {2086#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2086#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:32:56,118 INFO L256 TraceCheckUtils]: 28: Hoare triple {2086#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call #t~ret0 := f(~x~0); {2077#true} is VALID [2018-11-14 17:32:56,127 INFO L273 TraceCheckUtils]: 29: Hoare triple {2077#true} ~z := #in~z;#res := ~z + 2; {2080#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:56,130 INFO L273 TraceCheckUtils]: 30: Hoare triple {2080#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2080#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:56,135 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {2080#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2086#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #40#return; {2087#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} is VALID [2018-11-14 17:32:56,135 INFO L273 TraceCheckUtils]: 32: Hoare triple {2087#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2088#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:32:56,137 INFO L273 TraceCheckUtils]: 33: Hoare triple {2088#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {2088#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:32:56,137 INFO L273 TraceCheckUtils]: 34: Hoare triple {2088#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {2088#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:32:56,137 INFO L256 TraceCheckUtils]: 35: Hoare triple {2088#(and (<= 8 main_~x~0) (<= main_~x~0 8))} call #t~ret0 := f(~x~0); {2077#true} is VALID [2018-11-14 17:32:56,141 INFO L273 TraceCheckUtils]: 36: Hoare triple {2077#true} ~z := #in~z;#res := ~z + 2; {2080#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:56,141 INFO L273 TraceCheckUtils]: 37: Hoare triple {2080#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2080#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:56,142 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {2080#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2088#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #40#return; {2089#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} is VALID [2018-11-14 17:32:56,143 INFO L273 TraceCheckUtils]: 39: Hoare triple {2089#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2090#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:32:56,143 INFO L273 TraceCheckUtils]: 40: Hoare triple {2090#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {2090#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:32:56,143 INFO L273 TraceCheckUtils]: 41: Hoare triple {2090#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2090#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:32:56,144 INFO L256 TraceCheckUtils]: 42: Hoare triple {2090#(and (<= main_~x~0 10) (<= 10 main_~x~0))} call #t~ret0 := f(~x~0); {2077#true} is VALID [2018-11-14 17:32:56,144 INFO L273 TraceCheckUtils]: 43: Hoare triple {2077#true} ~z := #in~z;#res := ~z + 2; {2080#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:56,145 INFO L273 TraceCheckUtils]: 44: Hoare triple {2080#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2080#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:56,145 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {2080#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2090#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #40#return; {2091#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} is VALID [2018-11-14 17:32:56,146 INFO L273 TraceCheckUtils]: 46: Hoare triple {2091#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2092#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 17:32:56,146 INFO L273 TraceCheckUtils]: 47: Hoare triple {2092#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {2092#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 17:32:56,147 INFO L273 TraceCheckUtils]: 48: Hoare triple {2092#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2092#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 17:32:56,147 INFO L256 TraceCheckUtils]: 49: Hoare triple {2092#(and (<= main_~x~0 12) (<= 12 main_~x~0))} call #t~ret0 := f(~x~0); {2077#true} is VALID [2018-11-14 17:32:56,148 INFO L273 TraceCheckUtils]: 50: Hoare triple {2077#true} ~z := #in~z;#res := ~z + 2; {2080#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:56,149 INFO L273 TraceCheckUtils]: 51: Hoare triple {2080#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2080#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:56,150 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {2080#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2092#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #40#return; {2093#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} is VALID [2018-11-14 17:32:56,151 INFO L273 TraceCheckUtils]: 53: Hoare triple {2093#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2094#(and (<= main_~x~0 14) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:32:56,151 INFO L273 TraceCheckUtils]: 54: Hoare triple {2094#(and (<= main_~x~0 14) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {2094#(and (<= main_~x~0 14) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:32:56,152 INFO L273 TraceCheckUtils]: 55: Hoare triple {2094#(and (<= main_~x~0 14) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {2078#false} is VALID [2018-11-14 17:32:56,153 INFO L256 TraceCheckUtils]: 56: Hoare triple {2078#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {2078#false} is VALID [2018-11-14 17:32:56,153 INFO L273 TraceCheckUtils]: 57: Hoare triple {2078#false} ~cond := #in~cond; {2078#false} is VALID [2018-11-14 17:32:56,153 INFO L273 TraceCheckUtils]: 58: Hoare triple {2078#false} assume ~cond == 0; {2078#false} is VALID [2018-11-14 17:32:56,153 INFO L273 TraceCheckUtils]: 59: Hoare triple {2078#false} assume !false; {2078#false} is VALID [2018-11-14 17:32:56,159 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-11-14 17:32:56,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:32:56,159 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:32:56,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:32:56,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:56,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:56,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:32:56,622 INFO L256 TraceCheckUtils]: 0: Hoare triple {2077#true} call ULTIMATE.init(); {2077#true} is VALID [2018-11-14 17:32:56,623 INFO L273 TraceCheckUtils]: 1: Hoare triple {2077#true} assume true; {2077#true} is VALID [2018-11-14 17:32:56,623 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2077#true} {2077#true} #36#return; {2077#true} is VALID [2018-11-14 17:32:56,623 INFO L256 TraceCheckUtils]: 3: Hoare triple {2077#true} call #t~ret1 := main(); {2077#true} is VALID [2018-11-14 17:32:56,624 INFO L273 TraceCheckUtils]: 4: Hoare triple {2077#true} ~x~0 := 0; {2079#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:56,639 INFO L273 TraceCheckUtils]: 5: Hoare triple {2079#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {2079#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:56,640 INFO L273 TraceCheckUtils]: 6: Hoare triple {2079#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2079#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:56,640 INFO L256 TraceCheckUtils]: 7: Hoare triple {2079#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {2077#true} is VALID [2018-11-14 17:32:56,641 INFO L273 TraceCheckUtils]: 8: Hoare triple {2077#true} ~z := #in~z;#res := ~z + 2; {2080#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:56,641 INFO L273 TraceCheckUtils]: 9: Hoare triple {2080#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2080#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:56,642 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {2080#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2079#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #40#return; {2081#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-14 17:32:56,642 INFO L273 TraceCheckUtils]: 11: Hoare triple {2081#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {2082#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:56,643 INFO L273 TraceCheckUtils]: 12: Hoare triple {2082#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {2082#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:56,643 INFO L273 TraceCheckUtils]: 13: Hoare triple {2082#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {2082#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:56,644 INFO L256 TraceCheckUtils]: 14: Hoare triple {2082#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {2077#true} is VALID [2018-11-14 17:32:56,644 INFO L273 TraceCheckUtils]: 15: Hoare triple {2077#true} ~z := #in~z;#res := ~z + 2; {2080#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:56,645 INFO L273 TraceCheckUtils]: 16: Hoare triple {2080#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2080#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:56,646 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {2080#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2082#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #40#return; {2083#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-14 17:32:56,647 INFO L273 TraceCheckUtils]: 18: Hoare triple {2083#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2084#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:32:56,648 INFO L273 TraceCheckUtils]: 19: Hoare triple {2084#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {2084#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:32:56,648 INFO L273 TraceCheckUtils]: 20: Hoare triple {2084#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {2084#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:32:56,649 INFO L256 TraceCheckUtils]: 21: Hoare triple {2084#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {2077#true} is VALID [2018-11-14 17:32:56,650 INFO L273 TraceCheckUtils]: 22: Hoare triple {2077#true} ~z := #in~z;#res := ~z + 2; {2080#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:56,650 INFO L273 TraceCheckUtils]: 23: Hoare triple {2080#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2080#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:56,651 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {2080#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2084#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #40#return; {2085#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-14 17:32:56,652 INFO L273 TraceCheckUtils]: 25: Hoare triple {2085#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2086#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:32:56,653 INFO L273 TraceCheckUtils]: 26: Hoare triple {2086#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {2086#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:32:56,654 INFO L273 TraceCheckUtils]: 27: Hoare triple {2086#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2086#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:32:56,654 INFO L256 TraceCheckUtils]: 28: Hoare triple {2086#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call #t~ret0 := f(~x~0); {2077#true} is VALID [2018-11-14 17:32:56,655 INFO L273 TraceCheckUtils]: 29: Hoare triple {2077#true} ~z := #in~z;#res := ~z + 2; {2080#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:56,655 INFO L273 TraceCheckUtils]: 30: Hoare triple {2080#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2080#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:56,657 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {2080#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2086#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #40#return; {2087#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} is VALID [2018-11-14 17:32:56,657 INFO L273 TraceCheckUtils]: 32: Hoare triple {2087#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2088#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:32:56,658 INFO L273 TraceCheckUtils]: 33: Hoare triple {2088#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {2088#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:32:56,659 INFO L273 TraceCheckUtils]: 34: Hoare triple {2088#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {2088#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:32:56,659 INFO L256 TraceCheckUtils]: 35: Hoare triple {2088#(and (<= 8 main_~x~0) (<= main_~x~0 8))} call #t~ret0 := f(~x~0); {2077#true} is VALID [2018-11-14 17:32:56,660 INFO L273 TraceCheckUtils]: 36: Hoare triple {2077#true} ~z := #in~z;#res := ~z + 2; {2080#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:56,660 INFO L273 TraceCheckUtils]: 37: Hoare triple {2080#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2080#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:56,662 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {2080#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2088#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #40#return; {2089#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} is VALID [2018-11-14 17:32:56,662 INFO L273 TraceCheckUtils]: 39: Hoare triple {2089#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2090#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:32:56,663 INFO L273 TraceCheckUtils]: 40: Hoare triple {2090#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {2090#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:32:56,664 INFO L273 TraceCheckUtils]: 41: Hoare triple {2090#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2090#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:32:56,664 INFO L256 TraceCheckUtils]: 42: Hoare triple {2090#(and (<= main_~x~0 10) (<= 10 main_~x~0))} call #t~ret0 := f(~x~0); {2077#true} is VALID [2018-11-14 17:32:56,665 INFO L273 TraceCheckUtils]: 43: Hoare triple {2077#true} ~z := #in~z;#res := ~z + 2; {2080#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:56,665 INFO L273 TraceCheckUtils]: 44: Hoare triple {2080#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2080#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:56,667 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {2080#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2090#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #40#return; {2091#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} is VALID [2018-11-14 17:32:56,667 INFO L273 TraceCheckUtils]: 46: Hoare triple {2091#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2092#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 17:32:56,668 INFO L273 TraceCheckUtils]: 47: Hoare triple {2092#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {2092#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 17:32:56,669 INFO L273 TraceCheckUtils]: 48: Hoare triple {2092#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2092#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 17:32:56,669 INFO L256 TraceCheckUtils]: 49: Hoare triple {2092#(and (<= main_~x~0 12) (<= 12 main_~x~0))} call #t~ret0 := f(~x~0); {2077#true} is VALID [2018-11-14 17:32:56,670 INFO L273 TraceCheckUtils]: 50: Hoare triple {2077#true} ~z := #in~z;#res := ~z + 2; {2080#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:56,670 INFO L273 TraceCheckUtils]: 51: Hoare triple {2080#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2080#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:56,672 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {2080#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2092#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #40#return; {2093#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} is VALID [2018-11-14 17:32:56,672 INFO L273 TraceCheckUtils]: 53: Hoare triple {2093#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2257#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 17:32:56,673 INFO L273 TraceCheckUtils]: 54: Hoare triple {2257#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {2257#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 17:32:56,674 INFO L273 TraceCheckUtils]: 55: Hoare triple {2257#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {2078#false} is VALID [2018-11-14 17:32:56,674 INFO L256 TraceCheckUtils]: 56: Hoare triple {2078#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {2078#false} is VALID [2018-11-14 17:32:56,674 INFO L273 TraceCheckUtils]: 57: Hoare triple {2078#false} ~cond := #in~cond; {2078#false} is VALID [2018-11-14 17:32:56,675 INFO L273 TraceCheckUtils]: 58: Hoare triple {2078#false} assume ~cond == 0; {2078#false} is VALID [2018-11-14 17:32:56,675 INFO L273 TraceCheckUtils]: 59: Hoare triple {2078#false} assume !false; {2078#false} is VALID [2018-11-14 17:32:56,680 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-11-14 17:32:56,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:32:56,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-14 17:32:56,700 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2018-11-14 17:32:56,701 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:32:56,701 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-14 17:32:56,747 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:56,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-14 17:32:56,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-14 17:32:56,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-11-14 17:32:56,749 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 19 states. [2018-11-14 17:32:58,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:58,385 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2018-11-14 17:32:58,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-14 17:32:58,385 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2018-11-14 17:32:58,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:32:58,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 17:32:58,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 62 transitions. [2018-11-14 17:32:58,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 17:32:58,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 62 transitions. [2018-11-14 17:32:58,391 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 62 transitions. [2018-11-14 17:32:58,452 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:58,454 INFO L225 Difference]: With dead ends: 54 [2018-11-14 17:32:58,455 INFO L226 Difference]: Without dead ends: 49 [2018-11-14 17:32:58,456 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 58 SyntacticMatches, 9 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2018-11-14 17:32:58,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-14 17:32:58,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-11-14 17:32:58,488 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:32:58,488 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 47 states. [2018-11-14 17:32:58,489 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 47 states. [2018-11-14 17:32:58,489 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 47 states. [2018-11-14 17:32:58,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:58,492 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2018-11-14 17:32:58,492 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2018-11-14 17:32:58,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:58,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:58,493 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 49 states. [2018-11-14 17:32:58,493 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 49 states. [2018-11-14 17:32:58,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:58,495 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2018-11-14 17:32:58,495 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2018-11-14 17:32:58,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:58,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:58,496 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:32:58,496 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:32:58,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-14 17:32:58,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2018-11-14 17:32:58,498 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 60 [2018-11-14 17:32:58,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:32:58,499 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2018-11-14 17:32:58,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-14 17:32:58,499 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2018-11-14 17:32:58,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-14 17:32:58,500 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:32:58,500 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:32:58,500 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:32:58,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:32:58,501 INFO L82 PathProgramCache]: Analyzing trace with hash -210474340, now seen corresponding path program 8 times [2018-11-14 17:32:58,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:32:58,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:32:58,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:58,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:32:58,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:58,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:58,982 INFO L256 TraceCheckUtils]: 0: Hoare triple {2539#true} call ULTIMATE.init(); {2539#true} is VALID [2018-11-14 17:32:58,982 INFO L273 TraceCheckUtils]: 1: Hoare triple {2539#true} assume true; {2539#true} is VALID [2018-11-14 17:32:58,983 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2539#true} {2539#true} #36#return; {2539#true} is VALID [2018-11-14 17:32:58,983 INFO L256 TraceCheckUtils]: 3: Hoare triple {2539#true} call #t~ret1 := main(); {2539#true} is VALID [2018-11-14 17:32:58,983 INFO L273 TraceCheckUtils]: 4: Hoare triple {2539#true} ~x~0 := 0; {2541#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:58,984 INFO L273 TraceCheckUtils]: 5: Hoare triple {2541#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {2541#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:58,985 INFO L273 TraceCheckUtils]: 6: Hoare triple {2541#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2541#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:58,985 INFO L256 TraceCheckUtils]: 7: Hoare triple {2541#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {2539#true} is VALID [2018-11-14 17:32:58,985 INFO L273 TraceCheckUtils]: 8: Hoare triple {2539#true} ~z := #in~z;#res := ~z + 2; {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:58,986 INFO L273 TraceCheckUtils]: 9: Hoare triple {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:58,987 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2541#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #40#return; {2543#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-14 17:32:58,988 INFO L273 TraceCheckUtils]: 11: Hoare triple {2543#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {2544#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:58,989 INFO L273 TraceCheckUtils]: 12: Hoare triple {2544#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {2544#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:58,989 INFO L273 TraceCheckUtils]: 13: Hoare triple {2544#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {2544#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:58,990 INFO L256 TraceCheckUtils]: 14: Hoare triple {2544#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {2539#true} is VALID [2018-11-14 17:32:58,990 INFO L273 TraceCheckUtils]: 15: Hoare triple {2539#true} ~z := #in~z;#res := ~z + 2; {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:58,991 INFO L273 TraceCheckUtils]: 16: Hoare triple {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:58,993 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2544#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #40#return; {2545#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-14 17:32:58,993 INFO L273 TraceCheckUtils]: 18: Hoare triple {2545#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2546#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:32:58,994 INFO L273 TraceCheckUtils]: 19: Hoare triple {2546#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {2546#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:32:58,995 INFO L273 TraceCheckUtils]: 20: Hoare triple {2546#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {2546#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:32:58,995 INFO L256 TraceCheckUtils]: 21: Hoare triple {2546#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {2539#true} is VALID [2018-11-14 17:32:58,996 INFO L273 TraceCheckUtils]: 22: Hoare triple {2539#true} ~z := #in~z;#res := ~z + 2; {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:58,996 INFO L273 TraceCheckUtils]: 23: Hoare triple {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:58,998 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2546#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #40#return; {2547#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-14 17:32:58,999 INFO L273 TraceCheckUtils]: 25: Hoare triple {2547#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2548#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:32:58,999 INFO L273 TraceCheckUtils]: 26: Hoare triple {2548#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {2548#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:32:59,000 INFO L273 TraceCheckUtils]: 27: Hoare triple {2548#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2548#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:32:59,000 INFO L256 TraceCheckUtils]: 28: Hoare triple {2548#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call #t~ret0 := f(~x~0); {2539#true} is VALID [2018-11-14 17:32:59,001 INFO L273 TraceCheckUtils]: 29: Hoare triple {2539#true} ~z := #in~z;#res := ~z + 2; {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:59,002 INFO L273 TraceCheckUtils]: 30: Hoare triple {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:59,003 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2548#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #40#return; {2549#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} is VALID [2018-11-14 17:32:59,004 INFO L273 TraceCheckUtils]: 32: Hoare triple {2549#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2550#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:32:59,005 INFO L273 TraceCheckUtils]: 33: Hoare triple {2550#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {2550#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:32:59,006 INFO L273 TraceCheckUtils]: 34: Hoare triple {2550#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {2550#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:32:59,006 INFO L256 TraceCheckUtils]: 35: Hoare triple {2550#(and (<= 8 main_~x~0) (<= main_~x~0 8))} call #t~ret0 := f(~x~0); {2539#true} is VALID [2018-11-14 17:32:59,007 INFO L273 TraceCheckUtils]: 36: Hoare triple {2539#true} ~z := #in~z;#res := ~z + 2; {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:59,007 INFO L273 TraceCheckUtils]: 37: Hoare triple {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:59,009 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2550#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #40#return; {2551#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} is VALID [2018-11-14 17:32:59,009 INFO L273 TraceCheckUtils]: 39: Hoare triple {2551#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2552#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:32:59,010 INFO L273 TraceCheckUtils]: 40: Hoare triple {2552#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {2552#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:32:59,011 INFO L273 TraceCheckUtils]: 41: Hoare triple {2552#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2552#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:32:59,011 INFO L256 TraceCheckUtils]: 42: Hoare triple {2552#(and (<= main_~x~0 10) (<= 10 main_~x~0))} call #t~ret0 := f(~x~0); {2539#true} is VALID [2018-11-14 17:32:59,012 INFO L273 TraceCheckUtils]: 43: Hoare triple {2539#true} ~z := #in~z;#res := ~z + 2; {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:59,013 INFO L273 TraceCheckUtils]: 44: Hoare triple {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:59,014 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2552#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #40#return; {2553#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} is VALID [2018-11-14 17:32:59,015 INFO L273 TraceCheckUtils]: 46: Hoare triple {2553#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2554#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 17:32:59,015 INFO L273 TraceCheckUtils]: 47: Hoare triple {2554#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {2554#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 17:32:59,016 INFO L273 TraceCheckUtils]: 48: Hoare triple {2554#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2554#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 17:32:59,016 INFO L256 TraceCheckUtils]: 49: Hoare triple {2554#(and (<= main_~x~0 12) (<= 12 main_~x~0))} call #t~ret0 := f(~x~0); {2539#true} is VALID [2018-11-14 17:32:59,017 INFO L273 TraceCheckUtils]: 50: Hoare triple {2539#true} ~z := #in~z;#res := ~z + 2; {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:59,018 INFO L273 TraceCheckUtils]: 51: Hoare triple {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:59,019 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2554#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #40#return; {2555#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} is VALID [2018-11-14 17:32:59,020 INFO L273 TraceCheckUtils]: 53: Hoare triple {2555#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2556#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 17:32:59,021 INFO L273 TraceCheckUtils]: 54: Hoare triple {2556#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {2556#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 17:32:59,022 INFO L273 TraceCheckUtils]: 55: Hoare triple {2556#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2556#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 17:32:59,022 INFO L256 TraceCheckUtils]: 56: Hoare triple {2556#(and (<= main_~x~0 14) (<= 14 main_~x~0))} call #t~ret0 := f(~x~0); {2539#true} is VALID [2018-11-14 17:32:59,023 INFO L273 TraceCheckUtils]: 57: Hoare triple {2539#true} ~z := #in~z;#res := ~z + 2; {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:59,023 INFO L273 TraceCheckUtils]: 58: Hoare triple {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:59,025 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2556#(and (<= main_~x~0 14) (<= 14 main_~x~0))} #40#return; {2557#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} is VALID [2018-11-14 17:32:59,026 INFO L273 TraceCheckUtils]: 60: Hoare triple {2557#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} ~x~0 := #t~ret0;havoc #t~ret0; {2558#(and (<= main_~x~0 16) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:32:59,026 INFO L273 TraceCheckUtils]: 61: Hoare triple {2558#(and (<= main_~x~0 16) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {2558#(and (<= main_~x~0 16) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:32:59,027 INFO L273 TraceCheckUtils]: 62: Hoare triple {2558#(and (<= main_~x~0 16) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {2540#false} is VALID [2018-11-14 17:32:59,028 INFO L256 TraceCheckUtils]: 63: Hoare triple {2540#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {2540#false} is VALID [2018-11-14 17:32:59,028 INFO L273 TraceCheckUtils]: 64: Hoare triple {2540#false} ~cond := #in~cond; {2540#false} is VALID [2018-11-14 17:32:59,028 INFO L273 TraceCheckUtils]: 65: Hoare triple {2540#false} assume ~cond == 0; {2540#false} is VALID [2018-11-14 17:32:59,028 INFO L273 TraceCheckUtils]: 66: Hoare triple {2540#false} assume !false; {2540#false} is VALID [2018-11-14 17:32:59,035 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-14 17:32:59,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:32:59,035 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:32:59,050 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:32:59,070 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:32:59,071 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:32:59,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:59,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:32:59,554 INFO L256 TraceCheckUtils]: 0: Hoare triple {2539#true} call ULTIMATE.init(); {2539#true} is VALID [2018-11-14 17:32:59,554 INFO L273 TraceCheckUtils]: 1: Hoare triple {2539#true} assume true; {2539#true} is VALID [2018-11-14 17:32:59,555 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2539#true} {2539#true} #36#return; {2539#true} is VALID [2018-11-14 17:32:59,555 INFO L256 TraceCheckUtils]: 3: Hoare triple {2539#true} call #t~ret1 := main(); {2539#true} is VALID [2018-11-14 17:32:59,556 INFO L273 TraceCheckUtils]: 4: Hoare triple {2539#true} ~x~0 := 0; {2541#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:59,556 INFO L273 TraceCheckUtils]: 5: Hoare triple {2541#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {2541#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:59,556 INFO L273 TraceCheckUtils]: 6: Hoare triple {2541#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2541#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:59,557 INFO L256 TraceCheckUtils]: 7: Hoare triple {2541#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {2539#true} is VALID [2018-11-14 17:32:59,557 INFO L273 TraceCheckUtils]: 8: Hoare triple {2539#true} ~z := #in~z;#res := ~z + 2; {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:59,557 INFO L273 TraceCheckUtils]: 9: Hoare triple {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:59,559 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2541#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #40#return; {2543#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-14 17:32:59,560 INFO L273 TraceCheckUtils]: 11: Hoare triple {2543#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {2544#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:59,560 INFO L273 TraceCheckUtils]: 12: Hoare triple {2544#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {2544#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:59,561 INFO L273 TraceCheckUtils]: 13: Hoare triple {2544#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {2544#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:59,561 INFO L256 TraceCheckUtils]: 14: Hoare triple {2544#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {2539#true} is VALID [2018-11-14 17:32:59,581 INFO L273 TraceCheckUtils]: 15: Hoare triple {2539#true} ~z := #in~z;#res := ~z + 2; {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:59,585 INFO L273 TraceCheckUtils]: 16: Hoare triple {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:59,586 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2544#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #40#return; {2545#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-14 17:32:59,587 INFO L273 TraceCheckUtils]: 18: Hoare triple {2545#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2546#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:32:59,587 INFO L273 TraceCheckUtils]: 19: Hoare triple {2546#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {2546#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:32:59,588 INFO L273 TraceCheckUtils]: 20: Hoare triple {2546#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {2546#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:32:59,588 INFO L256 TraceCheckUtils]: 21: Hoare triple {2546#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {2539#true} is VALID [2018-11-14 17:32:59,588 INFO L273 TraceCheckUtils]: 22: Hoare triple {2539#true} ~z := #in~z;#res := ~z + 2; {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:59,589 INFO L273 TraceCheckUtils]: 23: Hoare triple {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:59,591 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2546#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #40#return; {2547#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-14 17:32:59,592 INFO L273 TraceCheckUtils]: 25: Hoare triple {2547#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2548#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:32:59,592 INFO L273 TraceCheckUtils]: 26: Hoare triple {2548#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {2548#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:32:59,593 INFO L273 TraceCheckUtils]: 27: Hoare triple {2548#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2548#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:32:59,593 INFO L256 TraceCheckUtils]: 28: Hoare triple {2548#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call #t~ret0 := f(~x~0); {2539#true} is VALID [2018-11-14 17:32:59,594 INFO L273 TraceCheckUtils]: 29: Hoare triple {2539#true} ~z := #in~z;#res := ~z + 2; {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:59,595 INFO L273 TraceCheckUtils]: 30: Hoare triple {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:59,596 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2548#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #40#return; {2549#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} is VALID [2018-11-14 17:32:59,597 INFO L273 TraceCheckUtils]: 32: Hoare triple {2549#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2550#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:32:59,598 INFO L273 TraceCheckUtils]: 33: Hoare triple {2550#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {2550#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:32:59,598 INFO L273 TraceCheckUtils]: 34: Hoare triple {2550#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {2550#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:32:59,599 INFO L256 TraceCheckUtils]: 35: Hoare triple {2550#(and (<= 8 main_~x~0) (<= main_~x~0 8))} call #t~ret0 := f(~x~0); {2539#true} is VALID [2018-11-14 17:32:59,600 INFO L273 TraceCheckUtils]: 36: Hoare triple {2539#true} ~z := #in~z;#res := ~z + 2; {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:59,600 INFO L273 TraceCheckUtils]: 37: Hoare triple {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:59,602 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2550#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #40#return; {2551#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} is VALID [2018-11-14 17:32:59,603 INFO L273 TraceCheckUtils]: 39: Hoare triple {2551#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2552#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:32:59,603 INFO L273 TraceCheckUtils]: 40: Hoare triple {2552#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {2552#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:32:59,604 INFO L273 TraceCheckUtils]: 41: Hoare triple {2552#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2552#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:32:59,604 INFO L256 TraceCheckUtils]: 42: Hoare triple {2552#(and (<= main_~x~0 10) (<= 10 main_~x~0))} call #t~ret0 := f(~x~0); {2539#true} is VALID [2018-11-14 17:32:59,605 INFO L273 TraceCheckUtils]: 43: Hoare triple {2539#true} ~z := #in~z;#res := ~z + 2; {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:59,606 INFO L273 TraceCheckUtils]: 44: Hoare triple {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:59,607 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2552#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #40#return; {2553#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} is VALID [2018-11-14 17:32:59,608 INFO L273 TraceCheckUtils]: 46: Hoare triple {2553#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2554#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 17:32:59,609 INFO L273 TraceCheckUtils]: 47: Hoare triple {2554#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {2554#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 17:32:59,609 INFO L273 TraceCheckUtils]: 48: Hoare triple {2554#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2554#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 17:32:59,610 INFO L256 TraceCheckUtils]: 49: Hoare triple {2554#(and (<= main_~x~0 12) (<= 12 main_~x~0))} call #t~ret0 := f(~x~0); {2539#true} is VALID [2018-11-14 17:32:59,610 INFO L273 TraceCheckUtils]: 50: Hoare triple {2539#true} ~z := #in~z;#res := ~z + 2; {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:59,611 INFO L273 TraceCheckUtils]: 51: Hoare triple {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:59,613 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2554#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #40#return; {2555#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} is VALID [2018-11-14 17:32:59,614 INFO L273 TraceCheckUtils]: 53: Hoare triple {2555#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2556#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 17:32:59,614 INFO L273 TraceCheckUtils]: 54: Hoare triple {2556#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {2556#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 17:32:59,615 INFO L273 TraceCheckUtils]: 55: Hoare triple {2556#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2556#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 17:32:59,615 INFO L256 TraceCheckUtils]: 56: Hoare triple {2556#(and (<= main_~x~0 14) (<= 14 main_~x~0))} call #t~ret0 := f(~x~0); {2539#true} is VALID [2018-11-14 17:32:59,616 INFO L273 TraceCheckUtils]: 57: Hoare triple {2539#true} ~z := #in~z;#res := ~z + 2; {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:59,617 INFO L273 TraceCheckUtils]: 58: Hoare triple {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:32:59,618 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {2542#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2556#(and (<= main_~x~0 14) (<= 14 main_~x~0))} #40#return; {2557#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} is VALID [2018-11-14 17:32:59,619 INFO L273 TraceCheckUtils]: 60: Hoare triple {2557#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} ~x~0 := #t~ret0;havoc #t~ret0; {2742#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 17:32:59,620 INFO L273 TraceCheckUtils]: 61: Hoare triple {2742#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {2742#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 17:32:59,621 INFO L273 TraceCheckUtils]: 62: Hoare triple {2742#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {2540#false} is VALID [2018-11-14 17:32:59,621 INFO L256 TraceCheckUtils]: 63: Hoare triple {2540#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {2540#false} is VALID [2018-11-14 17:32:59,621 INFO L273 TraceCheckUtils]: 64: Hoare triple {2540#false} ~cond := #in~cond; {2540#false} is VALID [2018-11-14 17:32:59,621 INFO L273 TraceCheckUtils]: 65: Hoare triple {2540#false} assume ~cond == 0; {2540#false} is VALID [2018-11-14 17:32:59,622 INFO L273 TraceCheckUtils]: 66: Hoare triple {2540#false} assume !false; {2540#false} is VALID [2018-11-14 17:32:59,630 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-14 17:32:59,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:32:59,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-14 17:32:59,651 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 67 [2018-11-14 17:32:59,652 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:32:59,652 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-14 17:32:59,706 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:59,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-14 17:32:59,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-14 17:32:59,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-11-14 17:32:59,707 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand 21 states. [2018-11-14 17:33:01,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:01,955 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2018-11-14 17:33:01,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-14 17:33:01,956 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 67 [2018-11-14 17:33:01,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:33:01,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 17:33:01,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 67 transitions. [2018-11-14 17:33:01,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 17:33:01,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 67 transitions. [2018-11-14 17:33:01,962 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 67 transitions. [2018-11-14 17:33:02,072 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:33:02,074 INFO L225 Difference]: With dead ends: 58 [2018-11-14 17:33:02,074 INFO L226 Difference]: Without dead ends: 53 [2018-11-14 17:33:02,075 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 65 SyntacticMatches, 10 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=88, Invalid=724, Unknown=0, NotChecked=0, Total=812 [2018-11-14 17:33:02,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-14 17:33:02,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2018-11-14 17:33:02,128 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:33:02,128 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 51 states. [2018-11-14 17:33:02,128 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 51 states. [2018-11-14 17:33:02,129 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 51 states. [2018-11-14 17:33:02,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:02,131 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2018-11-14 17:33:02,131 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2018-11-14 17:33:02,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:33:02,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:33:02,132 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 53 states. [2018-11-14 17:33:02,132 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 53 states. [2018-11-14 17:33:02,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:02,134 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2018-11-14 17:33:02,134 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2018-11-14 17:33:02,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:33:02,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:33:02,135 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:33:02,135 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:33:02,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-14 17:33:02,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2018-11-14 17:33:02,137 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 67 [2018-11-14 17:33:02,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:33:02,137 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2018-11-14 17:33:02,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-14 17:33:02,138 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2018-11-14 17:33:02,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-14 17:33:02,139 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:33:02,139 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:33:02,139 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:33:02,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:33:02,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1156541018, now seen corresponding path program 9 times [2018-11-14 17:33:02,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:33:02,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:33:02,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:33:02,141 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:33:02,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:33:02,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:33:03,044 INFO L256 TraceCheckUtils]: 0: Hoare triple {3046#true} call ULTIMATE.init(); {3046#true} is VALID [2018-11-14 17:33:03,045 INFO L273 TraceCheckUtils]: 1: Hoare triple {3046#true} assume true; {3046#true} is VALID [2018-11-14 17:33:03,045 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3046#true} {3046#true} #36#return; {3046#true} is VALID [2018-11-14 17:33:03,045 INFO L256 TraceCheckUtils]: 3: Hoare triple {3046#true} call #t~ret1 := main(); {3046#true} is VALID [2018-11-14 17:33:03,045 INFO L273 TraceCheckUtils]: 4: Hoare triple {3046#true} ~x~0 := 0; {3048#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:33:03,046 INFO L273 TraceCheckUtils]: 5: Hoare triple {3048#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {3048#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:33:03,046 INFO L273 TraceCheckUtils]: 6: Hoare triple {3048#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3048#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:33:03,046 INFO L256 TraceCheckUtils]: 7: Hoare triple {3048#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {3046#true} is VALID [2018-11-14 17:33:03,047 INFO L273 TraceCheckUtils]: 8: Hoare triple {3046#true} ~z := #in~z;#res := ~z + 2; {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:33:03,048 INFO L273 TraceCheckUtils]: 9: Hoare triple {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:33:03,049 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3048#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #40#return; {3050#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-14 17:33:03,050 INFO L273 TraceCheckUtils]: 11: Hoare triple {3050#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {3051#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:33:03,050 INFO L273 TraceCheckUtils]: 12: Hoare triple {3051#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {3051#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:33:03,051 INFO L273 TraceCheckUtils]: 13: Hoare triple {3051#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {3051#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:33:03,051 INFO L256 TraceCheckUtils]: 14: Hoare triple {3051#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {3046#true} is VALID [2018-11-14 17:33:03,052 INFO L273 TraceCheckUtils]: 15: Hoare triple {3046#true} ~z := #in~z;#res := ~z + 2; {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:33:03,053 INFO L273 TraceCheckUtils]: 16: Hoare triple {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:33:03,054 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3051#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #40#return; {3052#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-14 17:33:03,055 INFO L273 TraceCheckUtils]: 18: Hoare triple {3052#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3053#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:33:03,055 INFO L273 TraceCheckUtils]: 19: Hoare triple {3053#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {3053#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:33:03,056 INFO L273 TraceCheckUtils]: 20: Hoare triple {3053#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {3053#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:33:03,056 INFO L256 TraceCheckUtils]: 21: Hoare triple {3053#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {3046#true} is VALID [2018-11-14 17:33:03,057 INFO L273 TraceCheckUtils]: 22: Hoare triple {3046#true} ~z := #in~z;#res := ~z + 2; {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:33:03,058 INFO L273 TraceCheckUtils]: 23: Hoare triple {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:33:03,059 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3053#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #40#return; {3054#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-14 17:33:03,060 INFO L273 TraceCheckUtils]: 25: Hoare triple {3054#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3055#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:33:03,061 INFO L273 TraceCheckUtils]: 26: Hoare triple {3055#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {3055#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:33:03,080 INFO L273 TraceCheckUtils]: 27: Hoare triple {3055#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3055#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:33:03,080 INFO L256 TraceCheckUtils]: 28: Hoare triple {3055#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call #t~ret0 := f(~x~0); {3046#true} is VALID [2018-11-14 17:33:03,095 INFO L273 TraceCheckUtils]: 29: Hoare triple {3046#true} ~z := #in~z;#res := ~z + 2; {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:33:03,098 INFO L273 TraceCheckUtils]: 30: Hoare triple {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:33:03,099 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3055#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #40#return; {3056#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} is VALID [2018-11-14 17:33:03,099 INFO L273 TraceCheckUtils]: 32: Hoare triple {3056#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3057#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:33:03,100 INFO L273 TraceCheckUtils]: 33: Hoare triple {3057#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {3057#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:33:03,100 INFO L273 TraceCheckUtils]: 34: Hoare triple {3057#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {3057#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:33:03,100 INFO L256 TraceCheckUtils]: 35: Hoare triple {3057#(and (<= 8 main_~x~0) (<= main_~x~0 8))} call #t~ret0 := f(~x~0); {3046#true} is VALID [2018-11-14 17:33:03,101 INFO L273 TraceCheckUtils]: 36: Hoare triple {3046#true} ~z := #in~z;#res := ~z + 2; {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:33:03,102 INFO L273 TraceCheckUtils]: 37: Hoare triple {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:33:03,103 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3057#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #40#return; {3058#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} is VALID [2018-11-14 17:33:03,104 INFO L273 TraceCheckUtils]: 39: Hoare triple {3058#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3059#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:33:03,105 INFO L273 TraceCheckUtils]: 40: Hoare triple {3059#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {3059#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:33:03,105 INFO L273 TraceCheckUtils]: 41: Hoare triple {3059#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3059#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:33:03,105 INFO L256 TraceCheckUtils]: 42: Hoare triple {3059#(and (<= main_~x~0 10) (<= 10 main_~x~0))} call #t~ret0 := f(~x~0); {3046#true} is VALID [2018-11-14 17:33:03,106 INFO L273 TraceCheckUtils]: 43: Hoare triple {3046#true} ~z := #in~z;#res := ~z + 2; {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:33:03,107 INFO L273 TraceCheckUtils]: 44: Hoare triple {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:33:03,108 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3059#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #40#return; {3060#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} is VALID [2018-11-14 17:33:03,109 INFO L273 TraceCheckUtils]: 46: Hoare triple {3060#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3061#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 17:33:03,110 INFO L273 TraceCheckUtils]: 47: Hoare triple {3061#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {3061#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 17:33:03,110 INFO L273 TraceCheckUtils]: 48: Hoare triple {3061#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3061#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 17:33:03,111 INFO L256 TraceCheckUtils]: 49: Hoare triple {3061#(and (<= main_~x~0 12) (<= 12 main_~x~0))} call #t~ret0 := f(~x~0); {3046#true} is VALID [2018-11-14 17:33:03,112 INFO L273 TraceCheckUtils]: 50: Hoare triple {3046#true} ~z := #in~z;#res := ~z + 2; {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:33:03,112 INFO L273 TraceCheckUtils]: 51: Hoare triple {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:33:03,113 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3061#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #40#return; {3062#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} is VALID [2018-11-14 17:33:03,114 INFO L273 TraceCheckUtils]: 53: Hoare triple {3062#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3063#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 17:33:03,115 INFO L273 TraceCheckUtils]: 54: Hoare triple {3063#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {3063#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 17:33:03,116 INFO L273 TraceCheckUtils]: 55: Hoare triple {3063#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3063#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 17:33:03,116 INFO L256 TraceCheckUtils]: 56: Hoare triple {3063#(and (<= main_~x~0 14) (<= 14 main_~x~0))} call #t~ret0 := f(~x~0); {3046#true} is VALID [2018-11-14 17:33:03,117 INFO L273 TraceCheckUtils]: 57: Hoare triple {3046#true} ~z := #in~z;#res := ~z + 2; {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:33:03,117 INFO L273 TraceCheckUtils]: 58: Hoare triple {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:33:03,119 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3063#(and (<= main_~x~0 14) (<= 14 main_~x~0))} #40#return; {3064#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} is VALID [2018-11-14 17:33:03,119 INFO L273 TraceCheckUtils]: 60: Hoare triple {3064#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} ~x~0 := #t~ret0;havoc #t~ret0; {3065#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 17:33:03,120 INFO L273 TraceCheckUtils]: 61: Hoare triple {3065#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {3065#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 17:33:03,121 INFO L273 TraceCheckUtils]: 62: Hoare triple {3065#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3065#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 17:33:03,121 INFO L256 TraceCheckUtils]: 63: Hoare triple {3065#(and (<= main_~x~0 16) (<= 16 main_~x~0))} call #t~ret0 := f(~x~0); {3046#true} is VALID [2018-11-14 17:33:03,141 INFO L273 TraceCheckUtils]: 64: Hoare triple {3046#true} ~z := #in~z;#res := ~z + 2; {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:33:03,150 INFO L273 TraceCheckUtils]: 65: Hoare triple {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:33:03,158 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3065#(and (<= main_~x~0 16) (<= 16 main_~x~0))} #40#return; {3066#(and (<= 18 |main_#t~ret0|) (<= |main_#t~ret0| 18))} is VALID [2018-11-14 17:33:03,159 INFO L273 TraceCheckUtils]: 67: Hoare triple {3066#(and (<= 18 |main_#t~ret0|) (<= |main_#t~ret0| 18))} ~x~0 := #t~ret0;havoc #t~ret0; {3067#(and (<= main_~x~0 18) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:33:03,159 INFO L273 TraceCheckUtils]: 68: Hoare triple {3067#(and (<= main_~x~0 18) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {3067#(and (<= main_~x~0 18) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:33:03,160 INFO L273 TraceCheckUtils]: 69: Hoare triple {3067#(and (<= main_~x~0 18) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {3047#false} is VALID [2018-11-14 17:33:03,160 INFO L256 TraceCheckUtils]: 70: Hoare triple {3047#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {3047#false} is VALID [2018-11-14 17:33:03,160 INFO L273 TraceCheckUtils]: 71: Hoare triple {3047#false} ~cond := #in~cond; {3047#false} is VALID [2018-11-14 17:33:03,160 INFO L273 TraceCheckUtils]: 72: Hoare triple {3047#false} assume ~cond == 0; {3047#false} is VALID [2018-11-14 17:33:03,160 INFO L273 TraceCheckUtils]: 73: Hoare triple {3047#false} assume !false; {3047#false} is VALID [2018-11-14 17:33:03,169 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-11-14 17:33:03,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:33:03,169 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:33:03,181 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:34:11,923 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-14 17:34:11,923 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:34:12,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:12,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:34:12,906 INFO L256 TraceCheckUtils]: 0: Hoare triple {3046#true} call ULTIMATE.init(); {3046#true} is VALID [2018-11-14 17:34:12,906 INFO L273 TraceCheckUtils]: 1: Hoare triple {3046#true} assume true; {3046#true} is VALID [2018-11-14 17:34:12,907 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3046#true} {3046#true} #36#return; {3046#true} is VALID [2018-11-14 17:34:12,907 INFO L256 TraceCheckUtils]: 3: Hoare triple {3046#true} call #t~ret1 := main(); {3046#true} is VALID [2018-11-14 17:34:12,926 INFO L273 TraceCheckUtils]: 4: Hoare triple {3046#true} ~x~0 := 0; {3048#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:34:12,941 INFO L273 TraceCheckUtils]: 5: Hoare triple {3048#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {3048#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:34:12,950 INFO L273 TraceCheckUtils]: 6: Hoare triple {3048#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3048#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:34:12,950 INFO L256 TraceCheckUtils]: 7: Hoare triple {3048#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {3046#true} is VALID [2018-11-14 17:34:12,964 INFO L273 TraceCheckUtils]: 8: Hoare triple {3046#true} ~z := #in~z;#res := ~z + 2; {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:12,972 INFO L273 TraceCheckUtils]: 9: Hoare triple {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:12,978 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3048#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #40#return; {3050#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-14 17:34:12,979 INFO L273 TraceCheckUtils]: 11: Hoare triple {3050#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {3051#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:34:12,979 INFO L273 TraceCheckUtils]: 12: Hoare triple {3051#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {3051#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:34:12,980 INFO L273 TraceCheckUtils]: 13: Hoare triple {3051#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {3051#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:34:12,980 INFO L256 TraceCheckUtils]: 14: Hoare triple {3051#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {3046#true} is VALID [2018-11-14 17:34:12,980 INFO L273 TraceCheckUtils]: 15: Hoare triple {3046#true} ~z := #in~z;#res := ~z + 2; {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:12,981 INFO L273 TraceCheckUtils]: 16: Hoare triple {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:12,982 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3051#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #40#return; {3052#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-14 17:34:12,982 INFO L273 TraceCheckUtils]: 18: Hoare triple {3052#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3053#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:34:12,983 INFO L273 TraceCheckUtils]: 19: Hoare triple {3053#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {3053#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:34:12,983 INFO L273 TraceCheckUtils]: 20: Hoare triple {3053#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {3053#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:34:12,984 INFO L256 TraceCheckUtils]: 21: Hoare triple {3053#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {3046#true} is VALID [2018-11-14 17:34:12,984 INFO L273 TraceCheckUtils]: 22: Hoare triple {3046#true} ~z := #in~z;#res := ~z + 2; {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:12,985 INFO L273 TraceCheckUtils]: 23: Hoare triple {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:12,986 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3053#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #40#return; {3054#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-14 17:34:12,987 INFO L273 TraceCheckUtils]: 25: Hoare triple {3054#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3055#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:34:12,988 INFO L273 TraceCheckUtils]: 26: Hoare triple {3055#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {3055#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:34:12,988 INFO L273 TraceCheckUtils]: 27: Hoare triple {3055#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3055#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:34:12,989 INFO L256 TraceCheckUtils]: 28: Hoare triple {3055#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call #t~ret0 := f(~x~0); {3046#true} is VALID [2018-11-14 17:34:12,989 INFO L273 TraceCheckUtils]: 29: Hoare triple {3046#true} ~z := #in~z;#res := ~z + 2; {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:12,990 INFO L273 TraceCheckUtils]: 30: Hoare triple {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:12,991 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3055#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #40#return; {3056#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} is VALID [2018-11-14 17:34:12,992 INFO L273 TraceCheckUtils]: 32: Hoare triple {3056#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3057#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:34:12,993 INFO L273 TraceCheckUtils]: 33: Hoare triple {3057#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {3057#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:34:12,993 INFO L273 TraceCheckUtils]: 34: Hoare triple {3057#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {3057#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:34:12,994 INFO L256 TraceCheckUtils]: 35: Hoare triple {3057#(and (<= 8 main_~x~0) (<= main_~x~0 8))} call #t~ret0 := f(~x~0); {3046#true} is VALID [2018-11-14 17:34:12,994 INFO L273 TraceCheckUtils]: 36: Hoare triple {3046#true} ~z := #in~z;#res := ~z + 2; {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:12,995 INFO L273 TraceCheckUtils]: 37: Hoare triple {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:12,996 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3057#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #40#return; {3058#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} is VALID [2018-11-14 17:34:12,997 INFO L273 TraceCheckUtils]: 39: Hoare triple {3058#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3059#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:34:12,998 INFO L273 TraceCheckUtils]: 40: Hoare triple {3059#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {3059#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:34:12,998 INFO L273 TraceCheckUtils]: 41: Hoare triple {3059#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3059#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:34:12,998 INFO L256 TraceCheckUtils]: 42: Hoare triple {3059#(and (<= main_~x~0 10) (<= 10 main_~x~0))} call #t~ret0 := f(~x~0); {3046#true} is VALID [2018-11-14 17:34:12,999 INFO L273 TraceCheckUtils]: 43: Hoare triple {3046#true} ~z := #in~z;#res := ~z + 2; {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:13,000 INFO L273 TraceCheckUtils]: 44: Hoare triple {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:13,001 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3059#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #40#return; {3060#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} is VALID [2018-11-14 17:34:13,002 INFO L273 TraceCheckUtils]: 46: Hoare triple {3060#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3061#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 17:34:13,003 INFO L273 TraceCheckUtils]: 47: Hoare triple {3061#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {3061#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 17:34:13,003 INFO L273 TraceCheckUtils]: 48: Hoare triple {3061#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3061#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 17:34:13,003 INFO L256 TraceCheckUtils]: 49: Hoare triple {3061#(and (<= main_~x~0 12) (<= 12 main_~x~0))} call #t~ret0 := f(~x~0); {3046#true} is VALID [2018-11-14 17:34:13,004 INFO L273 TraceCheckUtils]: 50: Hoare triple {3046#true} ~z := #in~z;#res := ~z + 2; {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:13,005 INFO L273 TraceCheckUtils]: 51: Hoare triple {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:13,006 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3061#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #40#return; {3062#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} is VALID [2018-11-14 17:34:13,007 INFO L273 TraceCheckUtils]: 53: Hoare triple {3062#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3063#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 17:34:13,008 INFO L273 TraceCheckUtils]: 54: Hoare triple {3063#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {3063#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 17:34:13,008 INFO L273 TraceCheckUtils]: 55: Hoare triple {3063#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3063#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 17:34:13,008 INFO L256 TraceCheckUtils]: 56: Hoare triple {3063#(and (<= main_~x~0 14) (<= 14 main_~x~0))} call #t~ret0 := f(~x~0); {3046#true} is VALID [2018-11-14 17:34:13,009 INFO L273 TraceCheckUtils]: 57: Hoare triple {3046#true} ~z := #in~z;#res := ~z + 2; {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:13,010 INFO L273 TraceCheckUtils]: 58: Hoare triple {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:13,011 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3063#(and (<= main_~x~0 14) (<= 14 main_~x~0))} #40#return; {3064#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} is VALID [2018-11-14 17:34:13,012 INFO L273 TraceCheckUtils]: 60: Hoare triple {3064#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} ~x~0 := #t~ret0;havoc #t~ret0; {3065#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 17:34:13,013 INFO L273 TraceCheckUtils]: 61: Hoare triple {3065#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {3065#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 17:34:13,013 INFO L273 TraceCheckUtils]: 62: Hoare triple {3065#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3065#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 17:34:13,013 INFO L256 TraceCheckUtils]: 63: Hoare triple {3065#(and (<= main_~x~0 16) (<= 16 main_~x~0))} call #t~ret0 := f(~x~0); {3046#true} is VALID [2018-11-14 17:34:13,014 INFO L273 TraceCheckUtils]: 64: Hoare triple {3046#true} ~z := #in~z;#res := ~z + 2; {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:13,015 INFO L273 TraceCheckUtils]: 65: Hoare triple {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:13,016 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {3049#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3065#(and (<= main_~x~0 16) (<= 16 main_~x~0))} #40#return; {3066#(and (<= 18 |main_#t~ret0|) (<= |main_#t~ret0| 18))} is VALID [2018-11-14 17:34:13,017 INFO L273 TraceCheckUtils]: 67: Hoare triple {3066#(and (<= 18 |main_#t~ret0|) (<= |main_#t~ret0| 18))} ~x~0 := #t~ret0;havoc #t~ret0; {3272#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 17:34:13,018 INFO L273 TraceCheckUtils]: 68: Hoare triple {3272#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {3272#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 17:34:13,018 INFO L273 TraceCheckUtils]: 69: Hoare triple {3272#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {3047#false} is VALID [2018-11-14 17:34:13,019 INFO L256 TraceCheckUtils]: 70: Hoare triple {3047#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {3047#false} is VALID [2018-11-14 17:34:13,019 INFO L273 TraceCheckUtils]: 71: Hoare triple {3047#false} ~cond := #in~cond; {3047#false} is VALID [2018-11-14 17:34:13,019 INFO L273 TraceCheckUtils]: 72: Hoare triple {3047#false} assume ~cond == 0; {3047#false} is VALID [2018-11-14 17:34:13,019 INFO L273 TraceCheckUtils]: 73: Hoare triple {3047#false} assume !false; {3047#false} is VALID [2018-11-14 17:34:13,028 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-11-14 17:34:13,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:34:13,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-14 17:34:13,050 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 74 [2018-11-14 17:34:13,050 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:13,050 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-14 17:34:13,106 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:13,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-14 17:34:13,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-14 17:34:13,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=453, Unknown=0, NotChecked=0, Total=506 [2018-11-14 17:34:13,107 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand 23 states. [2018-11-14 17:34:15,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:15,632 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2018-11-14 17:34:15,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-14 17:34:15,632 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 74 [2018-11-14 17:34:15,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:15,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 17:34:15,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 72 transitions. [2018-11-14 17:34:15,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 17:34:15,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 72 transitions. [2018-11-14 17:34:15,639 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 72 transitions. [2018-11-14 17:34:15,721 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:15,724 INFO L225 Difference]: With dead ends: 62 [2018-11-14 17:34:15,724 INFO L226 Difference]: Without dead ends: 57 [2018-11-14 17:34:15,724 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 72 SyntacticMatches, 11 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=98, Invalid=894, Unknown=0, NotChecked=0, Total=992 [2018-11-14 17:34:15,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-14 17:34:15,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-11-14 17:34:15,813 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:15,813 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 55 states. [2018-11-14 17:34:15,814 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 55 states. [2018-11-14 17:34:15,814 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 55 states. [2018-11-14 17:34:15,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:15,816 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2018-11-14 17:34:15,816 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2018-11-14 17:34:15,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:15,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:15,816 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 57 states. [2018-11-14 17:34:15,817 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 57 states. [2018-11-14 17:34:15,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:15,819 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2018-11-14 17:34:15,819 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2018-11-14 17:34:15,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:15,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:15,820 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:15,820 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:15,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-14 17:34:15,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2018-11-14 17:34:15,822 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 74 [2018-11-14 17:34:15,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:15,822 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2018-11-14 17:34:15,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-14 17:34:15,823 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2018-11-14 17:34:15,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-14 17:34:15,824 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:15,824 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:34:15,824 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:15,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:15,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1694050084, now seen corresponding path program 10 times [2018-11-14 17:34:15,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:15,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:15,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:15,826 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:34:15,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:15,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:16,729 INFO L256 TraceCheckUtils]: 0: Hoare triple {3598#true} call ULTIMATE.init(); {3598#true} is VALID [2018-11-14 17:34:16,730 INFO L273 TraceCheckUtils]: 1: Hoare triple {3598#true} assume true; {3598#true} is VALID [2018-11-14 17:34:16,730 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3598#true} {3598#true} #36#return; {3598#true} is VALID [2018-11-14 17:34:16,730 INFO L256 TraceCheckUtils]: 3: Hoare triple {3598#true} call #t~ret1 := main(); {3598#true} is VALID [2018-11-14 17:34:16,730 INFO L273 TraceCheckUtils]: 4: Hoare triple {3598#true} ~x~0 := 0; {3600#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:34:16,731 INFO L273 TraceCheckUtils]: 5: Hoare triple {3600#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {3600#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:34:16,731 INFO L273 TraceCheckUtils]: 6: Hoare triple {3600#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3600#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:34:16,731 INFO L256 TraceCheckUtils]: 7: Hoare triple {3600#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {3598#true} is VALID [2018-11-14 17:34:16,732 INFO L273 TraceCheckUtils]: 8: Hoare triple {3598#true} ~z := #in~z;#res := ~z + 2; {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:16,733 INFO L273 TraceCheckUtils]: 9: Hoare triple {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:16,735 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3600#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #40#return; {3602#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-14 17:34:16,736 INFO L273 TraceCheckUtils]: 11: Hoare triple {3602#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {3603#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:34:16,736 INFO L273 TraceCheckUtils]: 12: Hoare triple {3603#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {3603#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:34:16,737 INFO L273 TraceCheckUtils]: 13: Hoare triple {3603#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {3603#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:34:16,737 INFO L256 TraceCheckUtils]: 14: Hoare triple {3603#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {3598#true} is VALID [2018-11-14 17:34:16,738 INFO L273 TraceCheckUtils]: 15: Hoare triple {3598#true} ~z := #in~z;#res := ~z + 2; {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:16,739 INFO L273 TraceCheckUtils]: 16: Hoare triple {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:16,741 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3603#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #40#return; {3604#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-14 17:34:16,742 INFO L273 TraceCheckUtils]: 18: Hoare triple {3604#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3605#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:34:16,742 INFO L273 TraceCheckUtils]: 19: Hoare triple {3605#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {3605#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:34:16,743 INFO L273 TraceCheckUtils]: 20: Hoare triple {3605#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {3605#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:34:16,743 INFO L256 TraceCheckUtils]: 21: Hoare triple {3605#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {3598#true} is VALID [2018-11-14 17:34:16,744 INFO L273 TraceCheckUtils]: 22: Hoare triple {3598#true} ~z := #in~z;#res := ~z + 2; {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:16,745 INFO L273 TraceCheckUtils]: 23: Hoare triple {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:16,747 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3605#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #40#return; {3606#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-14 17:34:16,748 INFO L273 TraceCheckUtils]: 25: Hoare triple {3606#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3607#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:34:16,748 INFO L273 TraceCheckUtils]: 26: Hoare triple {3607#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {3607#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:34:16,749 INFO L273 TraceCheckUtils]: 27: Hoare triple {3607#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3607#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:34:16,749 INFO L256 TraceCheckUtils]: 28: Hoare triple {3607#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call #t~ret0 := f(~x~0); {3598#true} is VALID [2018-11-14 17:34:16,749 INFO L273 TraceCheckUtils]: 29: Hoare triple {3598#true} ~z := #in~z;#res := ~z + 2; {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:16,750 INFO L273 TraceCheckUtils]: 30: Hoare triple {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:16,751 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3607#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #40#return; {3608#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} is VALID [2018-11-14 17:34:16,752 INFO L273 TraceCheckUtils]: 32: Hoare triple {3608#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3609#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:34:16,753 INFO L273 TraceCheckUtils]: 33: Hoare triple {3609#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {3609#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:34:16,754 INFO L273 TraceCheckUtils]: 34: Hoare triple {3609#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {3609#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:34:16,754 INFO L256 TraceCheckUtils]: 35: Hoare triple {3609#(and (<= 8 main_~x~0) (<= main_~x~0 8))} call #t~ret0 := f(~x~0); {3598#true} is VALID [2018-11-14 17:34:16,755 INFO L273 TraceCheckUtils]: 36: Hoare triple {3598#true} ~z := #in~z;#res := ~z + 2; {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:16,755 INFO L273 TraceCheckUtils]: 37: Hoare triple {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:16,757 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3609#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #40#return; {3610#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} is VALID [2018-11-14 17:34:16,758 INFO L273 TraceCheckUtils]: 39: Hoare triple {3610#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3611#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:34:16,759 INFO L273 TraceCheckUtils]: 40: Hoare triple {3611#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {3611#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:34:16,759 INFO L273 TraceCheckUtils]: 41: Hoare triple {3611#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3611#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:34:16,759 INFO L256 TraceCheckUtils]: 42: Hoare triple {3611#(and (<= main_~x~0 10) (<= 10 main_~x~0))} call #t~ret0 := f(~x~0); {3598#true} is VALID [2018-11-14 17:34:16,760 INFO L273 TraceCheckUtils]: 43: Hoare triple {3598#true} ~z := #in~z;#res := ~z + 2; {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:16,760 INFO L273 TraceCheckUtils]: 44: Hoare triple {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:16,761 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3611#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #40#return; {3612#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} is VALID [2018-11-14 17:34:16,762 INFO L273 TraceCheckUtils]: 46: Hoare triple {3612#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3613#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 17:34:16,763 INFO L273 TraceCheckUtils]: 47: Hoare triple {3613#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {3613#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 17:34:16,764 INFO L273 TraceCheckUtils]: 48: Hoare triple {3613#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3613#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 17:34:16,764 INFO L256 TraceCheckUtils]: 49: Hoare triple {3613#(and (<= main_~x~0 12) (<= 12 main_~x~0))} call #t~ret0 := f(~x~0); {3598#true} is VALID [2018-11-14 17:34:16,765 INFO L273 TraceCheckUtils]: 50: Hoare triple {3598#true} ~z := #in~z;#res := ~z + 2; {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:16,765 INFO L273 TraceCheckUtils]: 51: Hoare triple {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:16,767 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3613#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #40#return; {3614#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} is VALID [2018-11-14 17:34:16,768 INFO L273 TraceCheckUtils]: 53: Hoare triple {3614#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3615#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 17:34:16,769 INFO L273 TraceCheckUtils]: 54: Hoare triple {3615#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {3615#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 17:34:16,770 INFO L273 TraceCheckUtils]: 55: Hoare triple {3615#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3615#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 17:34:16,770 INFO L256 TraceCheckUtils]: 56: Hoare triple {3615#(and (<= main_~x~0 14) (<= 14 main_~x~0))} call #t~ret0 := f(~x~0); {3598#true} is VALID [2018-11-14 17:34:16,771 INFO L273 TraceCheckUtils]: 57: Hoare triple {3598#true} ~z := #in~z;#res := ~z + 2; {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:16,771 INFO L273 TraceCheckUtils]: 58: Hoare triple {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:16,773 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3615#(and (<= main_~x~0 14) (<= 14 main_~x~0))} #40#return; {3616#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} is VALID [2018-11-14 17:34:16,774 INFO L273 TraceCheckUtils]: 60: Hoare triple {3616#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} ~x~0 := #t~ret0;havoc #t~ret0; {3617#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 17:34:16,775 INFO L273 TraceCheckUtils]: 61: Hoare triple {3617#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {3617#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 17:34:16,776 INFO L273 TraceCheckUtils]: 62: Hoare triple {3617#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3617#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 17:34:16,776 INFO L256 TraceCheckUtils]: 63: Hoare triple {3617#(and (<= main_~x~0 16) (<= 16 main_~x~0))} call #t~ret0 := f(~x~0); {3598#true} is VALID [2018-11-14 17:34:16,777 INFO L273 TraceCheckUtils]: 64: Hoare triple {3598#true} ~z := #in~z;#res := ~z + 2; {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:16,777 INFO L273 TraceCheckUtils]: 65: Hoare triple {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:16,779 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3617#(and (<= main_~x~0 16) (<= 16 main_~x~0))} #40#return; {3618#(and (<= 18 |main_#t~ret0|) (<= |main_#t~ret0| 18))} is VALID [2018-11-14 17:34:16,780 INFO L273 TraceCheckUtils]: 67: Hoare triple {3618#(and (<= 18 |main_#t~ret0|) (<= |main_#t~ret0| 18))} ~x~0 := #t~ret0;havoc #t~ret0; {3619#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 17:34:16,781 INFO L273 TraceCheckUtils]: 68: Hoare triple {3619#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {3619#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 17:34:16,781 INFO L273 TraceCheckUtils]: 69: Hoare triple {3619#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3619#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 17:34:16,782 INFO L256 TraceCheckUtils]: 70: Hoare triple {3619#(and (<= main_~x~0 18) (<= 18 main_~x~0))} call #t~ret0 := f(~x~0); {3598#true} is VALID [2018-11-14 17:34:16,783 INFO L273 TraceCheckUtils]: 71: Hoare triple {3598#true} ~z := #in~z;#res := ~z + 2; {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:16,783 INFO L273 TraceCheckUtils]: 72: Hoare triple {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:16,785 INFO L268 TraceCheckUtils]: 73: Hoare quadruple {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3619#(and (<= main_~x~0 18) (<= 18 main_~x~0))} #40#return; {3620#(and (<= 20 |main_#t~ret0|) (<= |main_#t~ret0| 20))} is VALID [2018-11-14 17:34:16,786 INFO L273 TraceCheckUtils]: 74: Hoare triple {3620#(and (<= 20 |main_#t~ret0|) (<= |main_#t~ret0| 20))} ~x~0 := #t~ret0;havoc #t~ret0; {3621#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 20))} is VALID [2018-11-14 17:34:16,787 INFO L273 TraceCheckUtils]: 75: Hoare triple {3621#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 20))} assume true; {3621#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 20))} is VALID [2018-11-14 17:34:16,788 INFO L273 TraceCheckUtils]: 76: Hoare triple {3621#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 20))} assume !(~x~0 % 4294967296 < 268435455); {3599#false} is VALID [2018-11-14 17:34:16,788 INFO L256 TraceCheckUtils]: 77: Hoare triple {3599#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {3599#false} is VALID [2018-11-14 17:34:16,788 INFO L273 TraceCheckUtils]: 78: Hoare triple {3599#false} ~cond := #in~cond; {3599#false} is VALID [2018-11-14 17:34:16,789 INFO L273 TraceCheckUtils]: 79: Hoare triple {3599#false} assume ~cond == 0; {3599#false} is VALID [2018-11-14 17:34:16,789 INFO L273 TraceCheckUtils]: 80: Hoare triple {3599#false} assume !false; {3599#false} is VALID [2018-11-14 17:34:16,798 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2018-11-14 17:34:16,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:34:16,798 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:34:16,811 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:34:16,836 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:34:16,836 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:34:16,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:16,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:34:17,415 INFO L256 TraceCheckUtils]: 0: Hoare triple {3598#true} call ULTIMATE.init(); {3598#true} is VALID [2018-11-14 17:34:17,415 INFO L273 TraceCheckUtils]: 1: Hoare triple {3598#true} assume true; {3598#true} is VALID [2018-11-14 17:34:17,415 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3598#true} {3598#true} #36#return; {3598#true} is VALID [2018-11-14 17:34:17,415 INFO L256 TraceCheckUtils]: 3: Hoare triple {3598#true} call #t~ret1 := main(); {3598#true} is VALID [2018-11-14 17:34:17,417 INFO L273 TraceCheckUtils]: 4: Hoare triple {3598#true} ~x~0 := 0; {3600#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:34:17,417 INFO L273 TraceCheckUtils]: 5: Hoare triple {3600#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {3600#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:34:17,419 INFO L273 TraceCheckUtils]: 6: Hoare triple {3600#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3600#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:34:17,419 INFO L256 TraceCheckUtils]: 7: Hoare triple {3600#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {3598#true} is VALID [2018-11-14 17:34:17,420 INFO L273 TraceCheckUtils]: 8: Hoare triple {3598#true} ~z := #in~z;#res := ~z + 2; {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:17,421 INFO L273 TraceCheckUtils]: 9: Hoare triple {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:17,422 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3600#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #40#return; {3602#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-14 17:34:17,424 INFO L273 TraceCheckUtils]: 11: Hoare triple {3602#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {3603#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:34:17,424 INFO L273 TraceCheckUtils]: 12: Hoare triple {3603#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {3603#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:34:17,426 INFO L273 TraceCheckUtils]: 13: Hoare triple {3603#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {3603#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:34:17,426 INFO L256 TraceCheckUtils]: 14: Hoare triple {3603#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {3598#true} is VALID [2018-11-14 17:34:17,426 INFO L273 TraceCheckUtils]: 15: Hoare triple {3598#true} ~z := #in~z;#res := ~z + 2; {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:17,428 INFO L273 TraceCheckUtils]: 16: Hoare triple {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:17,429 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3603#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #40#return; {3604#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-14 17:34:17,430 INFO L273 TraceCheckUtils]: 18: Hoare triple {3604#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3605#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:34:17,430 INFO L273 TraceCheckUtils]: 19: Hoare triple {3605#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {3605#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:34:17,432 INFO L273 TraceCheckUtils]: 20: Hoare triple {3605#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {3605#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:34:17,432 INFO L256 TraceCheckUtils]: 21: Hoare triple {3605#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {3598#true} is VALID [2018-11-14 17:34:17,433 INFO L273 TraceCheckUtils]: 22: Hoare triple {3598#true} ~z := #in~z;#res := ~z + 2; {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:17,434 INFO L273 TraceCheckUtils]: 23: Hoare triple {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:17,435 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3605#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #40#return; {3606#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-14 17:34:17,437 INFO L273 TraceCheckUtils]: 25: Hoare triple {3606#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3607#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:34:17,437 INFO L273 TraceCheckUtils]: 26: Hoare triple {3607#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {3607#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:34:17,439 INFO L273 TraceCheckUtils]: 27: Hoare triple {3607#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3607#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:34:17,439 INFO L256 TraceCheckUtils]: 28: Hoare triple {3607#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call #t~ret0 := f(~x~0); {3598#true} is VALID [2018-11-14 17:34:17,440 INFO L273 TraceCheckUtils]: 29: Hoare triple {3598#true} ~z := #in~z;#res := ~z + 2; {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:17,441 INFO L273 TraceCheckUtils]: 30: Hoare triple {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:17,445 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3607#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #40#return; {3608#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} is VALID [2018-11-14 17:34:17,446 INFO L273 TraceCheckUtils]: 32: Hoare triple {3608#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3609#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:34:17,447 INFO L273 TraceCheckUtils]: 33: Hoare triple {3609#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {3609#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:34:17,449 INFO L273 TraceCheckUtils]: 34: Hoare triple {3609#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {3609#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:34:17,449 INFO L256 TraceCheckUtils]: 35: Hoare triple {3609#(and (<= 8 main_~x~0) (<= main_~x~0 8))} call #t~ret0 := f(~x~0); {3598#true} is VALID [2018-11-14 17:34:17,451 INFO L273 TraceCheckUtils]: 36: Hoare triple {3598#true} ~z := #in~z;#res := ~z + 2; {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:17,451 INFO L273 TraceCheckUtils]: 37: Hoare triple {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:17,453 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3609#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #40#return; {3610#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} is VALID [2018-11-14 17:34:17,453 INFO L273 TraceCheckUtils]: 39: Hoare triple {3610#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3611#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:34:17,455 INFO L273 TraceCheckUtils]: 40: Hoare triple {3611#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {3611#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:34:17,455 INFO L273 TraceCheckUtils]: 41: Hoare triple {3611#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3611#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:34:17,456 INFO L256 TraceCheckUtils]: 42: Hoare triple {3611#(and (<= main_~x~0 10) (<= 10 main_~x~0))} call #t~ret0 := f(~x~0); {3598#true} is VALID [2018-11-14 17:34:17,457 INFO L273 TraceCheckUtils]: 43: Hoare triple {3598#true} ~z := #in~z;#res := ~z + 2; {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:17,457 INFO L273 TraceCheckUtils]: 44: Hoare triple {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:17,458 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3611#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #40#return; {3612#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} is VALID [2018-11-14 17:34:17,460 INFO L273 TraceCheckUtils]: 46: Hoare triple {3612#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3613#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 17:34:17,460 INFO L273 TraceCheckUtils]: 47: Hoare triple {3613#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {3613#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 17:34:17,462 INFO L273 TraceCheckUtils]: 48: Hoare triple {3613#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3613#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 17:34:17,462 INFO L256 TraceCheckUtils]: 49: Hoare triple {3613#(and (<= main_~x~0 12) (<= 12 main_~x~0))} call #t~ret0 := f(~x~0); {3598#true} is VALID [2018-11-14 17:34:17,463 INFO L273 TraceCheckUtils]: 50: Hoare triple {3598#true} ~z := #in~z;#res := ~z + 2; {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:17,464 INFO L273 TraceCheckUtils]: 51: Hoare triple {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:17,466 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3613#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #40#return; {3614#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} is VALID [2018-11-14 17:34:17,467 INFO L273 TraceCheckUtils]: 53: Hoare triple {3614#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3615#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 17:34:17,468 INFO L273 TraceCheckUtils]: 54: Hoare triple {3615#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {3615#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 17:34:17,468 INFO L273 TraceCheckUtils]: 55: Hoare triple {3615#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3615#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 17:34:17,469 INFO L256 TraceCheckUtils]: 56: Hoare triple {3615#(and (<= main_~x~0 14) (<= 14 main_~x~0))} call #t~ret0 := f(~x~0); {3598#true} is VALID [2018-11-14 17:34:17,470 INFO L273 TraceCheckUtils]: 57: Hoare triple {3598#true} ~z := #in~z;#res := ~z + 2; {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:17,470 INFO L273 TraceCheckUtils]: 58: Hoare triple {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:17,476 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3615#(and (<= main_~x~0 14) (<= 14 main_~x~0))} #40#return; {3616#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} is VALID [2018-11-14 17:34:17,478 INFO L273 TraceCheckUtils]: 60: Hoare triple {3616#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} ~x~0 := #t~ret0;havoc #t~ret0; {3617#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 17:34:17,478 INFO L273 TraceCheckUtils]: 61: Hoare triple {3617#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {3617#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 17:34:17,480 INFO L273 TraceCheckUtils]: 62: Hoare triple {3617#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3617#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 17:34:17,480 INFO L256 TraceCheckUtils]: 63: Hoare triple {3617#(and (<= main_~x~0 16) (<= 16 main_~x~0))} call #t~ret0 := f(~x~0); {3598#true} is VALID [2018-11-14 17:34:17,480 INFO L273 TraceCheckUtils]: 64: Hoare triple {3598#true} ~z := #in~z;#res := ~z + 2; {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:17,482 INFO L273 TraceCheckUtils]: 65: Hoare triple {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:17,483 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3617#(and (<= main_~x~0 16) (<= 16 main_~x~0))} #40#return; {3618#(and (<= 18 |main_#t~ret0|) (<= |main_#t~ret0| 18))} is VALID [2018-11-14 17:34:17,484 INFO L273 TraceCheckUtils]: 67: Hoare triple {3618#(and (<= 18 |main_#t~ret0|) (<= |main_#t~ret0| 18))} ~x~0 := #t~ret0;havoc #t~ret0; {3619#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 17:34:17,484 INFO L273 TraceCheckUtils]: 68: Hoare triple {3619#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {3619#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 17:34:17,486 INFO L273 TraceCheckUtils]: 69: Hoare triple {3619#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3619#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 17:34:17,486 INFO L256 TraceCheckUtils]: 70: Hoare triple {3619#(and (<= main_~x~0 18) (<= 18 main_~x~0))} call #t~ret0 := f(~x~0); {3598#true} is VALID [2018-11-14 17:34:17,487 INFO L273 TraceCheckUtils]: 71: Hoare triple {3598#true} ~z := #in~z;#res := ~z + 2; {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:17,488 INFO L273 TraceCheckUtils]: 72: Hoare triple {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:17,489 INFO L268 TraceCheckUtils]: 73: Hoare quadruple {3601#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3619#(and (<= main_~x~0 18) (<= 18 main_~x~0))} #40#return; {3620#(and (<= 20 |main_#t~ret0|) (<= |main_#t~ret0| 20))} is VALID [2018-11-14 17:34:17,491 INFO L273 TraceCheckUtils]: 74: Hoare triple {3620#(and (<= 20 |main_#t~ret0|) (<= |main_#t~ret0| 20))} ~x~0 := #t~ret0;havoc #t~ret0; {3847#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-14 17:34:17,491 INFO L273 TraceCheckUtils]: 75: Hoare triple {3847#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {3847#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-14 17:34:17,493 INFO L273 TraceCheckUtils]: 76: Hoare triple {3847#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(~x~0 % 4294967296 < 268435455); {3599#false} is VALID [2018-11-14 17:34:17,493 INFO L256 TraceCheckUtils]: 77: Hoare triple {3599#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {3599#false} is VALID [2018-11-14 17:34:17,493 INFO L273 TraceCheckUtils]: 78: Hoare triple {3599#false} ~cond := #in~cond; {3599#false} is VALID [2018-11-14 17:34:17,493 INFO L273 TraceCheckUtils]: 79: Hoare triple {3599#false} assume ~cond == 0; {3599#false} is VALID [2018-11-14 17:34:17,494 INFO L273 TraceCheckUtils]: 80: Hoare triple {3599#false} assume !false; {3599#false} is VALID [2018-11-14 17:34:17,503 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2018-11-14 17:34:17,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:34:17,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-11-14 17:34:17,524 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 81 [2018-11-14 17:34:17,524 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:17,524 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-14 17:34:17,597 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:17,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-14 17:34:17,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-14 17:34:17,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=542, Unknown=0, NotChecked=0, Total=600 [2018-11-14 17:34:17,598 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand 25 states. [2018-11-14 17:34:20,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:20,556 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2018-11-14 17:34:20,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-14 17:34:20,556 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 81 [2018-11-14 17:34:20,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:20,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 17:34:20,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 77 transitions. [2018-11-14 17:34:20,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 17:34:20,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 77 transitions. [2018-11-14 17:34:20,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 77 transitions. [2018-11-14 17:34:20,655 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:20,657 INFO L225 Difference]: With dead ends: 66 [2018-11-14 17:34:20,657 INFO L226 Difference]: Without dead ends: 61 [2018-11-14 17:34:20,658 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 79 SyntacticMatches, 12 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=108, Invalid=1082, Unknown=0, NotChecked=0, Total=1190 [2018-11-14 17:34:20,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-14 17:34:20,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-11-14 17:34:20,703 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:20,703 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 59 states. [2018-11-14 17:34:20,704 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 59 states. [2018-11-14 17:34:20,704 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 59 states. [2018-11-14 17:34:20,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:20,707 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2018-11-14 17:34:20,707 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2018-11-14 17:34:20,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:20,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:20,707 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 61 states. [2018-11-14 17:34:20,707 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 61 states. [2018-11-14 17:34:20,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:20,709 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2018-11-14 17:34:20,709 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2018-11-14 17:34:20,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:20,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:20,710 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:20,710 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:20,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-14 17:34:20,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2018-11-14 17:34:20,712 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 81 [2018-11-14 17:34:20,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:20,712 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2018-11-14 17:34:20,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-14 17:34:20,712 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2018-11-14 17:34:20,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-14 17:34:20,713 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:20,713 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:34:20,714 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:20,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:20,714 INFO L82 PathProgramCache]: Analyzing trace with hash 246445082, now seen corresponding path program 11 times [2018-11-14 17:34:20,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:20,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:20,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:20,715 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:34:20,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:20,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:21,403 INFO L256 TraceCheckUtils]: 0: Hoare triple {4195#true} call ULTIMATE.init(); {4195#true} is VALID [2018-11-14 17:34:21,404 INFO L273 TraceCheckUtils]: 1: Hoare triple {4195#true} assume true; {4195#true} is VALID [2018-11-14 17:34:21,404 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4195#true} {4195#true} #36#return; {4195#true} is VALID [2018-11-14 17:34:21,404 INFO L256 TraceCheckUtils]: 3: Hoare triple {4195#true} call #t~ret1 := main(); {4195#true} is VALID [2018-11-14 17:34:21,405 INFO L273 TraceCheckUtils]: 4: Hoare triple {4195#true} ~x~0 := 0; {4197#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:34:21,405 INFO L273 TraceCheckUtils]: 5: Hoare triple {4197#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {4197#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:34:21,406 INFO L273 TraceCheckUtils]: 6: Hoare triple {4197#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4197#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:34:21,406 INFO L256 TraceCheckUtils]: 7: Hoare triple {4197#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {4195#true} is VALID [2018-11-14 17:34:21,407 INFO L273 TraceCheckUtils]: 8: Hoare triple {4195#true} ~z := #in~z;#res := ~z + 2; {4198#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:21,408 INFO L273 TraceCheckUtils]: 9: Hoare triple {4198#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4198#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:21,409 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {4198#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4197#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #40#return; {4199#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-14 17:34:21,410 INFO L273 TraceCheckUtils]: 11: Hoare triple {4199#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {4200#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:34:21,411 INFO L273 TraceCheckUtils]: 12: Hoare triple {4200#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {4200#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:34:21,412 INFO L273 TraceCheckUtils]: 13: Hoare triple {4200#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {4200#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:34:21,412 INFO L256 TraceCheckUtils]: 14: Hoare triple {4200#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {4195#true} is VALID [2018-11-14 17:34:21,413 INFO L273 TraceCheckUtils]: 15: Hoare triple {4195#true} ~z := #in~z;#res := ~z + 2; {4198#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:21,413 INFO L273 TraceCheckUtils]: 16: Hoare triple {4198#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4198#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:21,415 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {4198#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4200#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #40#return; {4201#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-14 17:34:21,416 INFO L273 TraceCheckUtils]: 18: Hoare triple {4201#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {4202#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:34:21,416 INFO L273 TraceCheckUtils]: 19: Hoare triple {4202#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {4202#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:34:21,417 INFO L273 TraceCheckUtils]: 20: Hoare triple {4202#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {4202#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:34:21,417 INFO L256 TraceCheckUtils]: 21: Hoare triple {4202#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {4195#true} is VALID [2018-11-14 17:34:21,418 INFO L273 TraceCheckUtils]: 22: Hoare triple {4195#true} ~z := #in~z;#res := ~z + 2; {4198#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:21,419 INFO L273 TraceCheckUtils]: 23: Hoare triple {4198#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4198#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-14 17:34:21,420 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {4198#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4202#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #40#return; {4203#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-14 17:34:21,421 INFO L273 TraceCheckUtils]: 25: Hoare triple {4203#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {4204#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:34:21,422 INFO L273 TraceCheckUtils]: 26: Hoare triple {4204#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {4204#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:34:21,422 INFO L273 TraceCheckUtils]: 27: Hoare triple {4204#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4204#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:34:21,423 INFO L256 TraceCheckUtils]: 28: Hoare triple {4204#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call #t~ret0 := f(~x~0); {4195#true} is VALID [2018-11-14 17:34:21,423 INFO L273 TraceCheckUtils]: 29: Hoare triple {4195#true} ~z := #in~z;#res := ~z + 2; {4198#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID