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/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-acceleration/functions_false-unreach-call1_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:04:54,369 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:04:54,371 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:04:54,383 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:04:54,384 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:04:54,385 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:04:54,386 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:04:54,388 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:04:54,390 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:04:54,391 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:04:54,392 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:04:54,392 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:04:54,393 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:04:54,394 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:04:54,395 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:04:54,396 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:04:54,397 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:04:54,399 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:04:54,401 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:04:54,402 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:04:54,404 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:04:54,405 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:04:54,411 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:04:54,411 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:04:54,411 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:04:54,412 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:04:54,417 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:04:54,417 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:04:54,418 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:04:54,422 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:04:54,422 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:04:54,423 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:04:54,423 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:04:54,423 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:04:54,426 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:04:54,427 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:04:54,427 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-23 13:04:54,454 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:04:54,455 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:04:54,455 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:04:54,456 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:04:54,456 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:04:54,457 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:04:54,458 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:04:54,458 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:04:54,458 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:04:54,458 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:04:54,459 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:04:54,459 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:04:54,459 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:04:54,459 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:04:54,460 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:04:54,460 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:04:54,460 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:04:54,460 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:04:54,460 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:04:54,461 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:04:54,462 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:04:54,462 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:04:54,462 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:04:54,462 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:04:54,462 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:04:54,463 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:04:54,463 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:04:54,463 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:04:54,463 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:04:54,463 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:04:54,464 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:04:54,521 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:04:54,537 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:04:54,542 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:04:54,544 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:04:54,544 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:04:54,545 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/functions_false-unreach-call1_true-termination.i [2018-11-23 13:04:54,607 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/170d30787/0462433ba6074c9299efda3ec0e2741e/FLAGde68fdb2d [2018-11-23 13:04:55,066 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:04:55,066 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/functions_false-unreach-call1_true-termination.i [2018-11-23 13:04:55,073 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/170d30787/0462433ba6074c9299efda3ec0e2741e/FLAGde68fdb2d [2018-11-23 13:04:55,429 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/170d30787/0462433ba6074c9299efda3ec0e2741e [2018-11-23 13:04:55,439 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:04:55,440 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:04:55,442 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:04:55,442 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:04:55,446 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:04:55,447 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:04:55" (1/1) ... [2018-11-23 13:04:55,451 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ef9e7d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:55, skipping insertion in model container [2018-11-23 13:04:55,451 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:04:55" (1/1) ... [2018-11-23 13:04:55,462 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:04:55,485 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:04:55,690 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:04:55,696 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:04:55,717 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:04:55,735 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:04:55,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:55 WrapperNode [2018-11-23 13:04:55,736 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:04:55,737 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:04:55,737 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:04:55,737 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:04:55,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:55" (1/1) ... [2018-11-23 13:04:55,754 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:55" (1/1) ... [2018-11-23 13:04:55,762 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:04:55,762 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:04:55,762 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:04:55,762 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:04:55,773 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:55" (1/1) ... [2018-11-23 13:04:55,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:55" (1/1) ... [2018-11-23 13:04:55,774 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:55" (1/1) ... [2018-11-23 13:04:55,775 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:55" (1/1) ... [2018-11-23 13:04:55,780 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:55" (1/1) ... [2018-11-23 13:04:55,786 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:55" (1/1) ... [2018-11-23 13:04:55,787 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:55" (1/1) ... [2018-11-23 13:04:55,788 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:04:55,789 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:04:55,789 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:04:55,789 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:04:55,790 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:55" (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-23 13:04:55,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:04:55,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:04:55,957 INFO L130 BoogieDeclarations]: Found specification of procedure f [2018-11-23 13:04:55,957 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2018-11-23 13:04:55,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:04:55,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:04:55,957 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:04:55,957 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:04:55,958 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:04:55,958 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:04:56,443 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:04:56,443 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:04:56,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:04:56 BoogieIcfgContainer [2018-11-23 13:04:56,444 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:04:56,445 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:04:56,445 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:04:56,451 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:04:56,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:04:55" (1/3) ... [2018-11-23 13:04:56,452 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c992d26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:04:56, skipping insertion in model container [2018-11-23 13:04:56,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:55" (2/3) ... [2018-11-23 13:04:56,453 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c992d26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:04:56, skipping insertion in model container [2018-11-23 13:04:56,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:04:56" (3/3) ... [2018-11-23 13:04:56,456 INFO L112 eAbstractionObserver]: Analyzing ICFG functions_false-unreach-call1_true-termination.i [2018-11-23 13:04:56,467 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:04:56,474 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:04:56,489 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:04:56,522 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:04:56,522 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:04:56,523 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:04:56,523 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:04:56,523 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:04:56,523 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:04:56,523 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:04:56,523 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:04:56,524 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:04:56,544 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-11-23 13:04:56,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 13:04:56,551 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:56,552 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:56,555 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:56,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:56,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1238725826, now seen corresponding path program 1 times [2018-11-23 13:04:56,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:56,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:56,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:56,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:56,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:56,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:56,737 INFO L256 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {25#true} is VALID [2018-11-23 13:04:56,740 INFO L273 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2018-11-23 13:04:56,741 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #35#return; {25#true} is VALID [2018-11-23 13:04:56,741 INFO L256 TraceCheckUtils]: 3: Hoare triple {25#true} call #t~ret1 := main(); {25#true} is VALID [2018-11-23 13:04:56,742 INFO L273 TraceCheckUtils]: 4: Hoare triple {25#true} ~x~0 := 0; {25#true} is VALID [2018-11-23 13:04:56,749 INFO L273 TraceCheckUtils]: 5: Hoare triple {25#true} assume !true; {26#false} is VALID [2018-11-23 13:04:56,750 INFO L256 TraceCheckUtils]: 6: Hoare triple {26#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {26#false} is VALID [2018-11-23 13:04:56,751 INFO L273 TraceCheckUtils]: 7: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2018-11-23 13:04:56,751 INFO L273 TraceCheckUtils]: 8: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2018-11-23 13:04:56,752 INFO L273 TraceCheckUtils]: 9: Hoare triple {26#false} assume !false; {26#false} is VALID [2018-11-23 13:04:56,757 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-23 13:04:56,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:04:56,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:04:56,767 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 13:04:56,773 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:56,777 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:04:56,825 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-23 13:04:56,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:04:56,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:04:56,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:04:56,839 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2018-11-23 13:04:56,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:56,922 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-11-23 13:04:56,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:04:56,922 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 13:04:56,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:56,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:04:56,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 36 transitions. [2018-11-23 13:04:56,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:04:56,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 36 transitions. [2018-11-23 13:04:56,942 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 36 transitions. [2018-11-23 13:04:57,326 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-23 13:04:57,336 INFO L225 Difference]: With dead ends: 33 [2018-11-23 13:04:57,337 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 13:04:57,340 INFO L631 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-23 13:04:57,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 13:04:57,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-23 13:04:57,377 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:57,378 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2018-11-23 13:04:57,378 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-23 13:04:57,379 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-23 13:04:57,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:57,382 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-23 13:04:57,383 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 13:04:57,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:57,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:57,384 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-23 13:04:57,384 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-23 13:04:57,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:57,387 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-23 13:04:57,387 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 13:04:57,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:57,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:57,388 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:57,388 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:57,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:04:57,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-11-23 13:04:57,392 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 10 [2018-11-23 13:04:57,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:57,393 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-11-23 13:04:57,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:04:57,393 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 13:04:57,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 13:04:57,394 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:57,394 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:57,394 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:57,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:57,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1244266952, now seen corresponding path program 1 times [2018-11-23 13:04:57,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:57,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:57,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:57,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:57,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:57,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:57,670 INFO L256 TraceCheckUtils]: 0: Hoare triple {130#true} call ULTIMATE.init(); {130#true} is VALID [2018-11-23 13:04:57,670 INFO L273 TraceCheckUtils]: 1: Hoare triple {130#true} assume true; {130#true} is VALID [2018-11-23 13:04:57,671 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {130#true} {130#true} #35#return; {130#true} is VALID [2018-11-23 13:04:57,671 INFO L256 TraceCheckUtils]: 3: Hoare triple {130#true} call #t~ret1 := main(); {130#true} is VALID [2018-11-23 13:04:57,673 INFO L273 TraceCheckUtils]: 4: Hoare triple {130#true} ~x~0 := 0; {132#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:04:57,674 INFO L273 TraceCheckUtils]: 5: Hoare triple {132#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {131#false} is VALID [2018-11-23 13:04:57,675 INFO L256 TraceCheckUtils]: 6: Hoare triple {131#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {131#false} is VALID [2018-11-23 13:04:57,675 INFO L273 TraceCheckUtils]: 7: Hoare triple {131#false} ~cond := #in~cond; {131#false} is VALID [2018-11-23 13:04:57,675 INFO L273 TraceCheckUtils]: 8: Hoare triple {131#false} assume 0 == ~cond; {131#false} is VALID [2018-11-23 13:04:57,676 INFO L273 TraceCheckUtils]: 9: Hoare triple {131#false} assume !false; {131#false} is VALID [2018-11-23 13:04:57,677 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-23 13:04:57,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:04:57,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:04:57,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 13:04:57,679 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:57,680 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:04:57,754 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-23 13:04:57,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:04:57,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:04:57,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:04:57,755 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 3 states. [2018-11-23 13:04:57,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:57,937 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-11-23 13:04:57,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:04:57,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 13:04:57,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:57,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:04:57,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2018-11-23 13:04:57,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:04:57,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2018-11-23 13:04:57,948 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 25 transitions. [2018-11-23 13:04:58,007 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:58,009 INFO L225 Difference]: With dead ends: 24 [2018-11-23 13:04:58,009 INFO L226 Difference]: Without dead ends: 19 [2018-11-23 13:04:58,010 INFO L631 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-23 13:04:58,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-23 13:04:58,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-11-23 13:04:58,027 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:58,027 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 17 states. [2018-11-23 13:04:58,027 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 17 states. [2018-11-23 13:04:58,027 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 17 states. [2018-11-23 13:04:58,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:58,031 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-23 13:04:58,031 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 13:04:58,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:58,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:58,032 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 19 states. [2018-11-23 13:04:58,032 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 19 states. [2018-11-23 13:04:58,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:58,035 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-23 13:04:58,035 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 13:04:58,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:58,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:58,036 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:58,036 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:58,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:04:58,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-11-23 13:04:58,038 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 10 [2018-11-23 13:04:58,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:58,039 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-11-23 13:04:58,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:04:58,039 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-23 13:04:58,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 13:04:58,040 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:58,040 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:58,040 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:58,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:58,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1831198934, now seen corresponding path program 1 times [2018-11-23 13:04:58,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:58,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:58,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:58,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:58,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:58,419 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-11-23 13:04:58,627 INFO L256 TraceCheckUtils]: 0: Hoare triple {237#true} call ULTIMATE.init(); {237#true} is VALID [2018-11-23 13:04:58,628 INFO L273 TraceCheckUtils]: 1: Hoare triple {237#true} assume true; {237#true} is VALID [2018-11-23 13:04:58,628 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {237#true} {237#true} #35#return; {237#true} is VALID [2018-11-23 13:04:58,629 INFO L256 TraceCheckUtils]: 3: Hoare triple {237#true} call #t~ret1 := main(); {237#true} is VALID [2018-11-23 13:04:58,639 INFO L273 TraceCheckUtils]: 4: Hoare triple {237#true} ~x~0 := 0; {239#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:04:58,645 INFO L273 TraceCheckUtils]: 5: Hoare triple {239#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {239#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:04:58,645 INFO L256 TraceCheckUtils]: 6: Hoare triple {239#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {237#true} is VALID [2018-11-23 13:04:58,646 INFO L273 TraceCheckUtils]: 7: Hoare triple {237#true} ~z := #in~z;#res := 2 + ~z; {240#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:04:58,653 INFO L273 TraceCheckUtils]: 8: Hoare triple {240#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {240#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:04:58,655 INFO L268 TraceCheckUtils]: 9: Hoare quadruple {240#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {239#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #39#return; {241#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-23 13:04:58,656 INFO L273 TraceCheckUtils]: 10: Hoare triple {241#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {242#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:04:58,657 INFO L273 TraceCheckUtils]: 11: Hoare triple {242#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {238#false} is VALID [2018-11-23 13:04:58,657 INFO L256 TraceCheckUtils]: 12: Hoare triple {238#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {238#false} is VALID [2018-11-23 13:04:58,657 INFO L273 TraceCheckUtils]: 13: Hoare triple {238#false} ~cond := #in~cond; {238#false} is VALID [2018-11-23 13:04:58,658 INFO L273 TraceCheckUtils]: 14: Hoare triple {238#false} assume 0 == ~cond; {238#false} is VALID [2018-11-23 13:04:58,658 INFO L273 TraceCheckUtils]: 15: Hoare triple {238#false} assume !false; {238#false} is VALID [2018-11-23 13:04:58,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:58,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:04:58,662 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-23 13:04:58,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:58,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:58,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:58,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:59,042 INFO L256 TraceCheckUtils]: 0: Hoare triple {237#true} call ULTIMATE.init(); {237#true} is VALID [2018-11-23 13:04:59,042 INFO L273 TraceCheckUtils]: 1: Hoare triple {237#true} assume true; {237#true} is VALID [2018-11-23 13:04:59,043 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {237#true} {237#true} #35#return; {237#true} is VALID [2018-11-23 13:04:59,043 INFO L256 TraceCheckUtils]: 3: Hoare triple {237#true} call #t~ret1 := main(); {237#true} is VALID [2018-11-23 13:04:59,044 INFO L273 TraceCheckUtils]: 4: Hoare triple {237#true} ~x~0 := 0; {239#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:04:59,044 INFO L273 TraceCheckUtils]: 5: Hoare triple {239#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {239#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:04:59,045 INFO L256 TraceCheckUtils]: 6: Hoare triple {239#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {237#true} is VALID [2018-11-23 13:04:59,046 INFO L273 TraceCheckUtils]: 7: Hoare triple {237#true} ~z := #in~z;#res := 2 + ~z; {240#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:04:59,046 INFO L273 TraceCheckUtils]: 8: Hoare triple {240#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {240#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:04:59,049 INFO L268 TraceCheckUtils]: 9: Hoare quadruple {240#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {239#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #39#return; {241#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-23 13:04:59,067 INFO L273 TraceCheckUtils]: 10: Hoare triple {241#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {276#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:04:59,083 INFO L273 TraceCheckUtils]: 11: Hoare triple {276#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 268435455); {238#false} is VALID [2018-11-23 13:04:59,083 INFO L256 TraceCheckUtils]: 12: Hoare triple {238#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {238#false} is VALID [2018-11-23 13:04:59,084 INFO L273 TraceCheckUtils]: 13: Hoare triple {238#false} ~cond := #in~cond; {238#false} is VALID [2018-11-23 13:04:59,084 INFO L273 TraceCheckUtils]: 14: Hoare triple {238#false} assume 0 == ~cond; {238#false} is VALID [2018-11-23 13:04:59,084 INFO L273 TraceCheckUtils]: 15: Hoare triple {238#false} assume !false; {238#false} is VALID [2018-11-23 13:04:59,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:59,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:04:59,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 13:04:59,106 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-11-23 13:04:59,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:59,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 13:04:59,216 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:59,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:04:59,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:04:59,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:04:59,218 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 7 states. [2018-11-23 13:04:59,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:59,513 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-11-23 13:04:59,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:04:59,513 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-11-23 13:04:59,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:59,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:04:59,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2018-11-23 13:04:59,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:04:59,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2018-11-23 13:04:59,519 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 29 transitions. [2018-11-23 13:04:59,568 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:59,570 INFO L225 Difference]: With dead ends: 27 [2018-11-23 13:04:59,570 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 13:04:59,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 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-23 13:04:59,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 13:04:59,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-11-23 13:04:59,611 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:59,611 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 20 states. [2018-11-23 13:04:59,611 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 20 states. [2018-11-23 13:04:59,611 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 20 states. [2018-11-23 13:04:59,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:59,614 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-23 13:04:59,614 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 13:04:59,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:59,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:59,615 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 22 states. [2018-11-23 13:04:59,616 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 22 states. [2018-11-23 13:04:59,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:59,619 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-23 13:04:59,619 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 13:04:59,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:59,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:59,620 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:59,620 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:59,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:04:59,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-23 13:04:59,623 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 16 [2018-11-23 13:04:59,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:59,623 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-23 13:04:59,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:04:59,623 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 13:04:59,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 13:04:59,624 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:59,625 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:59,625 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:59,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:59,626 INFO L82 PathProgramCache]: Analyzing trace with hash 329045236, now seen corresponding path program 2 times [2018-11-23 13:04:59,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:59,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:59,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:59,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:59,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:59,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:00,128 INFO L256 TraceCheckUtils]: 0: Hoare triple {411#true} call ULTIMATE.init(); {411#true} is VALID [2018-11-23 13:05:00,128 INFO L273 TraceCheckUtils]: 1: Hoare triple {411#true} assume true; {411#true} is VALID [2018-11-23 13:05:00,129 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {411#true} {411#true} #35#return; {411#true} is VALID [2018-11-23 13:05:00,129 INFO L256 TraceCheckUtils]: 3: Hoare triple {411#true} call #t~ret1 := main(); {411#true} is VALID [2018-11-23 13:05:00,130 INFO L273 TraceCheckUtils]: 4: Hoare triple {411#true} ~x~0 := 0; {413#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:00,131 INFO L273 TraceCheckUtils]: 5: Hoare triple {413#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {413#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:00,131 INFO L256 TraceCheckUtils]: 6: Hoare triple {413#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {411#true} is VALID [2018-11-23 13:05:00,132 INFO L273 TraceCheckUtils]: 7: Hoare triple {411#true} ~z := #in~z;#res := 2 + ~z; {414#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:00,132 INFO L273 TraceCheckUtils]: 8: Hoare triple {414#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {414#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:00,134 INFO L268 TraceCheckUtils]: 9: Hoare quadruple {414#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {413#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #39#return; {415#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-23 13:05:00,137 INFO L273 TraceCheckUtils]: 10: Hoare triple {415#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {416#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:00,138 INFO L273 TraceCheckUtils]: 11: Hoare triple {416#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {416#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:00,139 INFO L256 TraceCheckUtils]: 12: Hoare triple {416#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {411#true} is VALID [2018-11-23 13:05:00,139 INFO L273 TraceCheckUtils]: 13: Hoare triple {411#true} ~z := #in~z;#res := 2 + ~z; {414#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:00,140 INFO L273 TraceCheckUtils]: 14: Hoare triple {414#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {414#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:00,141 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {414#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {416#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #39#return; {417#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-23 13:05:00,142 INFO L273 TraceCheckUtils]: 16: Hoare triple {417#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {418#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:05:00,144 INFO L273 TraceCheckUtils]: 17: Hoare triple {418#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {412#false} is VALID [2018-11-23 13:05:00,144 INFO L256 TraceCheckUtils]: 18: Hoare triple {412#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {412#false} is VALID [2018-11-23 13:05:00,145 INFO L273 TraceCheckUtils]: 19: Hoare triple {412#false} ~cond := #in~cond; {412#false} is VALID [2018-11-23 13:05:00,145 INFO L273 TraceCheckUtils]: 20: Hoare triple {412#false} assume 0 == ~cond; {412#false} is VALID [2018-11-23 13:05:00,145 INFO L273 TraceCheckUtils]: 21: Hoare triple {412#false} assume !false; {412#false} is VALID [2018-11-23 13:05:00,148 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 13:05:00,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:00,148 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-23 13:05:00,158 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:05:00,170 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:05:00,171 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:00,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:00,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:00,370 INFO L256 TraceCheckUtils]: 0: Hoare triple {411#true} call ULTIMATE.init(); {411#true} is VALID [2018-11-23 13:05:00,370 INFO L273 TraceCheckUtils]: 1: Hoare triple {411#true} assume true; {411#true} is VALID [2018-11-23 13:05:00,371 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {411#true} {411#true} #35#return; {411#true} is VALID [2018-11-23 13:05:00,371 INFO L256 TraceCheckUtils]: 3: Hoare triple {411#true} call #t~ret1 := main(); {411#true} is VALID [2018-11-23 13:05:00,372 INFO L273 TraceCheckUtils]: 4: Hoare triple {411#true} ~x~0 := 0; {413#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:00,372 INFO L273 TraceCheckUtils]: 5: Hoare triple {413#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {413#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:00,372 INFO L256 TraceCheckUtils]: 6: Hoare triple {413#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {411#true} is VALID [2018-11-23 13:05:00,373 INFO L273 TraceCheckUtils]: 7: Hoare triple {411#true} ~z := #in~z;#res := 2 + ~z; {414#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:00,374 INFO L273 TraceCheckUtils]: 8: Hoare triple {414#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {414#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:00,376 INFO L268 TraceCheckUtils]: 9: Hoare quadruple {414#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {413#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #39#return; {415#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-23 13:05:00,377 INFO L273 TraceCheckUtils]: 10: Hoare triple {415#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {416#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:00,378 INFO L273 TraceCheckUtils]: 11: Hoare triple {416#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {416#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:00,378 INFO L256 TraceCheckUtils]: 12: Hoare triple {416#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {411#true} is VALID [2018-11-23 13:05:00,379 INFO L273 TraceCheckUtils]: 13: Hoare triple {411#true} ~z := #in~z;#res := 2 + ~z; {414#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:00,380 INFO L273 TraceCheckUtils]: 14: Hoare triple {414#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {414#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:00,381 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {414#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {416#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #39#return; {417#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-23 13:05:00,381 INFO L273 TraceCheckUtils]: 16: Hoare triple {417#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {470#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:00,383 INFO L273 TraceCheckUtils]: 17: Hoare triple {470#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(~x~0 % 4294967296 < 268435455); {412#false} is VALID [2018-11-23 13:05:00,383 INFO L256 TraceCheckUtils]: 18: Hoare triple {412#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {412#false} is VALID [2018-11-23 13:05:00,383 INFO L273 TraceCheckUtils]: 19: Hoare triple {412#false} ~cond := #in~cond; {412#false} is VALID [2018-11-23 13:05:00,384 INFO L273 TraceCheckUtils]: 20: Hoare triple {412#false} assume 0 == ~cond; {412#false} is VALID [2018-11-23 13:05:00,384 INFO L273 TraceCheckUtils]: 21: Hoare triple {412#false} assume !false; {412#false} is VALID [2018-11-23 13:05:00,387 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 13:05:00,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:00,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 13:05:00,411 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-11-23 13:05:00,411 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:00,411 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 13:05:00,437 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:00,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 13:05:00,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:05:00,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:05:00,438 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 9 states. [2018-11-23 13:05:01,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:01,024 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-23 13:05:01,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:05:01,025 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-11-23 13:05:01,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:01,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:05:01,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 33 transitions. [2018-11-23 13:05:01,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:05:01,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 33 transitions. [2018-11-23 13:05:01,032 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 33 transitions. [2018-11-23 13:05:01,081 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:01,083 INFO L225 Difference]: With dead ends: 30 [2018-11-23 13:05:01,084 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 13:05:01,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 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-23 13:05:01,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 13:05:01,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-11-23 13:05:01,116 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:01,116 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 23 states. [2018-11-23 13:05:01,116 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 23 states. [2018-11-23 13:05:01,116 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 23 states. [2018-11-23 13:05:01,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:01,122 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-11-23 13:05:01,122 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 13:05:01,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:01,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:01,123 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 25 states. [2018-11-23 13:05:01,123 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 25 states. [2018-11-23 13:05:01,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:01,126 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-11-23 13:05:01,126 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 13:05:01,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:01,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:01,127 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:01,127 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:01,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:05:01,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-11-23 13:05:01,130 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 22 [2018-11-23 13:05:01,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:01,130 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-23 13:05:01,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 13:05:01,131 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-23 13:05:01,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 13:05:01,132 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:01,132 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:01,132 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:01,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:01,133 INFO L82 PathProgramCache]: Analyzing trace with hash 755481234, now seen corresponding path program 3 times [2018-11-23 13:05:01,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:01,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:01,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:01,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:01,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:01,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:01,603 INFO L256 TraceCheckUtils]: 0: Hoare triple {623#true} call ULTIMATE.init(); {623#true} is VALID [2018-11-23 13:05:01,604 INFO L273 TraceCheckUtils]: 1: Hoare triple {623#true} assume true; {623#true} is VALID [2018-11-23 13:05:01,604 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {623#true} {623#true} #35#return; {623#true} is VALID [2018-11-23 13:05:01,605 INFO L256 TraceCheckUtils]: 3: Hoare triple {623#true} call #t~ret1 := main(); {623#true} is VALID [2018-11-23 13:05:01,606 INFO L273 TraceCheckUtils]: 4: Hoare triple {623#true} ~x~0 := 0; {625#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:01,607 INFO L273 TraceCheckUtils]: 5: Hoare triple {625#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {625#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:01,607 INFO L256 TraceCheckUtils]: 6: Hoare triple {625#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {623#true} is VALID [2018-11-23 13:05:01,608 INFO L273 TraceCheckUtils]: 7: Hoare triple {623#true} ~z := #in~z;#res := 2 + ~z; {626#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:01,612 INFO L273 TraceCheckUtils]: 8: Hoare triple {626#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {626#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:01,614 INFO L268 TraceCheckUtils]: 9: Hoare quadruple {626#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {625#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #39#return; {627#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-23 13:05:01,614 INFO L273 TraceCheckUtils]: 10: Hoare triple {627#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {628#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:01,615 INFO L273 TraceCheckUtils]: 11: Hoare triple {628#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {628#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:01,615 INFO L256 TraceCheckUtils]: 12: Hoare triple {628#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {623#true} is VALID [2018-11-23 13:05:01,616 INFO L273 TraceCheckUtils]: 13: Hoare triple {623#true} ~z := #in~z;#res := 2 + ~z; {626#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:01,617 INFO L273 TraceCheckUtils]: 14: Hoare triple {626#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {626#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:01,620 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {626#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {628#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #39#return; {629#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-23 13:05:01,621 INFO L273 TraceCheckUtils]: 16: Hoare triple {629#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {630#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:01,632 INFO L273 TraceCheckUtils]: 17: Hoare triple {630#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {630#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:01,633 INFO L256 TraceCheckUtils]: 18: Hoare triple {630#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {623#true} is VALID [2018-11-23 13:05:01,634 INFO L273 TraceCheckUtils]: 19: Hoare triple {623#true} ~z := #in~z;#res := 2 + ~z; {626#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:01,634 INFO L273 TraceCheckUtils]: 20: Hoare triple {626#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {626#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:01,635 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {626#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {630#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #39#return; {631#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-23 13:05:01,636 INFO L273 TraceCheckUtils]: 22: Hoare triple {631#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {632#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:05:01,638 INFO L273 TraceCheckUtils]: 23: Hoare triple {632#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {624#false} is VALID [2018-11-23 13:05:01,638 INFO L256 TraceCheckUtils]: 24: Hoare triple {624#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {624#false} is VALID [2018-11-23 13:05:01,639 INFO L273 TraceCheckUtils]: 25: Hoare triple {624#false} ~cond := #in~cond; {624#false} is VALID [2018-11-23 13:05:01,639 INFO L273 TraceCheckUtils]: 26: Hoare triple {624#false} assume 0 == ~cond; {624#false} is VALID [2018-11-23 13:05:01,640 INFO L273 TraceCheckUtils]: 27: Hoare triple {624#false} assume !false; {624#false} is VALID [2018-11-23 13:05:01,643 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 13:05:01,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:01,643 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-23 13:05:01,668 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:05:01,714 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 13:05:01,714 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:01,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:01,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:02,065 INFO L256 TraceCheckUtils]: 0: Hoare triple {623#true} call ULTIMATE.init(); {623#true} is VALID [2018-11-23 13:05:02,066 INFO L273 TraceCheckUtils]: 1: Hoare triple {623#true} assume true; {623#true} is VALID [2018-11-23 13:05:02,066 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {623#true} {623#true} #35#return; {623#true} is VALID [2018-11-23 13:05:02,067 INFO L256 TraceCheckUtils]: 3: Hoare triple {623#true} call #t~ret1 := main(); {623#true} is VALID [2018-11-23 13:05:02,071 INFO L273 TraceCheckUtils]: 4: Hoare triple {623#true} ~x~0 := 0; {625#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:02,071 INFO L273 TraceCheckUtils]: 5: Hoare triple {625#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {625#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:02,072 INFO L256 TraceCheckUtils]: 6: Hoare triple {625#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {623#true} is VALID [2018-11-23 13:05:02,073 INFO L273 TraceCheckUtils]: 7: Hoare triple {623#true} ~z := #in~z;#res := 2 + ~z; {626#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:02,074 INFO L273 TraceCheckUtils]: 8: Hoare triple {626#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {626#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:02,076 INFO L268 TraceCheckUtils]: 9: Hoare quadruple {626#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {625#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #39#return; {627#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-23 13:05:02,077 INFO L273 TraceCheckUtils]: 10: Hoare triple {627#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {628#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:02,078 INFO L273 TraceCheckUtils]: 11: Hoare triple {628#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {628#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:02,078 INFO L256 TraceCheckUtils]: 12: Hoare triple {628#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {623#true} is VALID [2018-11-23 13:05:02,079 INFO L273 TraceCheckUtils]: 13: Hoare triple {623#true} ~z := #in~z;#res := 2 + ~z; {626#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:02,080 INFO L273 TraceCheckUtils]: 14: Hoare triple {626#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {626#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:02,082 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {626#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {628#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #39#return; {629#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-23 13:05:02,104 INFO L273 TraceCheckUtils]: 16: Hoare triple {629#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {630#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:02,118 INFO L273 TraceCheckUtils]: 17: Hoare triple {630#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {630#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:02,118 INFO L256 TraceCheckUtils]: 18: Hoare triple {630#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {623#true} is VALID [2018-11-23 13:05:02,132 INFO L273 TraceCheckUtils]: 19: Hoare triple {623#true} ~z := #in~z;#res := 2 + ~z; {626#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:02,148 INFO L273 TraceCheckUtils]: 20: Hoare triple {626#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {626#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:02,158 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {626#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {630#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #39#return; {631#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-23 13:05:02,171 INFO L273 TraceCheckUtils]: 22: Hoare triple {631#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {702#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:02,185 INFO L273 TraceCheckUtils]: 23: Hoare triple {702#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {624#false} is VALID [2018-11-23 13:05:02,185 INFO L256 TraceCheckUtils]: 24: Hoare triple {624#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {624#false} is VALID [2018-11-23 13:05:02,186 INFO L273 TraceCheckUtils]: 25: Hoare triple {624#false} ~cond := #in~cond; {624#false} is VALID [2018-11-23 13:05:02,186 INFO L273 TraceCheckUtils]: 26: Hoare triple {624#false} assume 0 == ~cond; {624#false} is VALID [2018-11-23 13:05:02,186 INFO L273 TraceCheckUtils]: 27: Hoare triple {624#false} assume !false; {624#false} is VALID [2018-11-23 13:05:02,189 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 13:05:02,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:02,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 13:05:02,217 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2018-11-23 13:05:02,217 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:02,217 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 13:05:02,254 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-23 13:05:02,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 13:05:02,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 13:05:02,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:05:02,255 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 11 states. [2018-11-23 13:05:02,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:02,924 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-23 13:05:02,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 13:05:02,924 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2018-11-23 13:05:02,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:02,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:05:02,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 37 transitions. [2018-11-23 13:05:02,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:05:02,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 37 transitions. [2018-11-23 13:05:02,931 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 37 transitions. [2018-11-23 13:05:02,981 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-23 13:05:02,983 INFO L225 Difference]: With dead ends: 33 [2018-11-23 13:05:02,983 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 13:05:02,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 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-23 13:05:02,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 13:05:03,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2018-11-23 13:05:03,011 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:03,011 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 26 states. [2018-11-23 13:05:03,012 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 26 states. [2018-11-23 13:05:03,012 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 26 states. [2018-11-23 13:05:03,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:03,015 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-23 13:05:03,015 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 13:05:03,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:03,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:03,016 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 28 states. [2018-11-23 13:05:03,017 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 28 states. [2018-11-23 13:05:03,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:03,019 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-23 13:05:03,020 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 13:05:03,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:03,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:03,021 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:03,021 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:03,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 13:05:03,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-11-23 13:05:03,023 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 28 [2018-11-23 13:05:03,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:03,024 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-11-23 13:05:03,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 13:05:03,024 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-23 13:05:03,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 13:05:03,025 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:03,025 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:03,026 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:03,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:03,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1475645008, now seen corresponding path program 4 times [2018-11-23 13:05:03,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:03,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:03,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:03,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:03,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:03,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:03,562 INFO L256 TraceCheckUtils]: 0: Hoare triple {873#true} call ULTIMATE.init(); {873#true} is VALID [2018-11-23 13:05:03,562 INFO L273 TraceCheckUtils]: 1: Hoare triple {873#true} assume true; {873#true} is VALID [2018-11-23 13:05:03,563 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {873#true} {873#true} #35#return; {873#true} is VALID [2018-11-23 13:05:03,563 INFO L256 TraceCheckUtils]: 3: Hoare triple {873#true} call #t~ret1 := main(); {873#true} is VALID [2018-11-23 13:05:03,564 INFO L273 TraceCheckUtils]: 4: Hoare triple {873#true} ~x~0 := 0; {875#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:03,565 INFO L273 TraceCheckUtils]: 5: Hoare triple {875#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {875#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:03,565 INFO L256 TraceCheckUtils]: 6: Hoare triple {875#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {873#true} is VALID [2018-11-23 13:05:03,568 INFO L273 TraceCheckUtils]: 7: Hoare triple {873#true} ~z := #in~z;#res := 2 + ~z; {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:03,569 INFO L273 TraceCheckUtils]: 8: Hoare triple {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:03,571 INFO L268 TraceCheckUtils]: 9: Hoare quadruple {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {875#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #39#return; {877#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-23 13:05:03,571 INFO L273 TraceCheckUtils]: 10: Hoare triple {877#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {878#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:03,572 INFO L273 TraceCheckUtils]: 11: Hoare triple {878#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {878#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:03,572 INFO L256 TraceCheckUtils]: 12: Hoare triple {878#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {873#true} is VALID [2018-11-23 13:05:03,573 INFO L273 TraceCheckUtils]: 13: Hoare triple {873#true} ~z := #in~z;#res := 2 + ~z; {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:03,574 INFO L273 TraceCheckUtils]: 14: Hoare triple {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:03,576 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {878#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #39#return; {879#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-23 13:05:03,577 INFO L273 TraceCheckUtils]: 16: Hoare triple {879#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {880#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:03,578 INFO L273 TraceCheckUtils]: 17: Hoare triple {880#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {880#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:03,578 INFO L256 TraceCheckUtils]: 18: Hoare triple {880#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {873#true} is VALID [2018-11-23 13:05:03,579 INFO L273 TraceCheckUtils]: 19: Hoare triple {873#true} ~z := #in~z;#res := 2 + ~z; {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:03,580 INFO L273 TraceCheckUtils]: 20: Hoare triple {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:03,582 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {880#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #39#return; {881#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-23 13:05:03,583 INFO L273 TraceCheckUtils]: 22: Hoare triple {881#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {882#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:03,584 INFO L273 TraceCheckUtils]: 23: Hoare triple {882#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {882#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:03,584 INFO L256 TraceCheckUtils]: 24: Hoare triple {882#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call #t~ret0 := f(~x~0); {873#true} is VALID [2018-11-23 13:05:03,602 INFO L273 TraceCheckUtils]: 25: Hoare triple {873#true} ~z := #in~z;#res := 2 + ~z; {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:03,603 INFO L273 TraceCheckUtils]: 26: Hoare triple {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:03,604 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {882#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #39#return; {883#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} is VALID [2018-11-23 13:05:03,605 INFO L273 TraceCheckUtils]: 28: Hoare triple {883#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {884#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:05:03,606 INFO L273 TraceCheckUtils]: 29: Hoare triple {884#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {874#false} is VALID [2018-11-23 13:05:03,606 INFO L256 TraceCheckUtils]: 30: Hoare triple {874#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {874#false} is VALID [2018-11-23 13:05:03,607 INFO L273 TraceCheckUtils]: 31: Hoare triple {874#false} ~cond := #in~cond; {874#false} is VALID [2018-11-23 13:05:03,607 INFO L273 TraceCheckUtils]: 32: Hoare triple {874#false} assume 0 == ~cond; {874#false} is VALID [2018-11-23 13:05:03,607 INFO L273 TraceCheckUtils]: 33: Hoare triple {874#false} assume !false; {874#false} is VALID [2018-11-23 13:05:03,611 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 13:05:03,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:03,612 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-23 13:05:03,621 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:05:03,636 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:05:03,637 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:03,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:03,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:03,930 INFO L256 TraceCheckUtils]: 0: Hoare triple {873#true} call ULTIMATE.init(); {873#true} is VALID [2018-11-23 13:05:03,931 INFO L273 TraceCheckUtils]: 1: Hoare triple {873#true} assume true; {873#true} is VALID [2018-11-23 13:05:03,931 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {873#true} {873#true} #35#return; {873#true} is VALID [2018-11-23 13:05:03,932 INFO L256 TraceCheckUtils]: 3: Hoare triple {873#true} call #t~ret1 := main(); {873#true} is VALID [2018-11-23 13:05:03,932 INFO L273 TraceCheckUtils]: 4: Hoare triple {873#true} ~x~0 := 0; {875#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:03,933 INFO L273 TraceCheckUtils]: 5: Hoare triple {875#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {875#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:03,933 INFO L256 TraceCheckUtils]: 6: Hoare triple {875#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {873#true} is VALID [2018-11-23 13:05:03,934 INFO L273 TraceCheckUtils]: 7: Hoare triple {873#true} ~z := #in~z;#res := 2 + ~z; {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:03,954 INFO L273 TraceCheckUtils]: 8: Hoare triple {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:03,970 INFO L268 TraceCheckUtils]: 9: Hoare quadruple {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {875#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #39#return; {877#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-23 13:05:03,974 INFO L273 TraceCheckUtils]: 10: Hoare triple {877#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {878#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:03,975 INFO L273 TraceCheckUtils]: 11: Hoare triple {878#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {878#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:03,975 INFO L256 TraceCheckUtils]: 12: Hoare triple {878#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {873#true} is VALID [2018-11-23 13:05:03,977 INFO L273 TraceCheckUtils]: 13: Hoare triple {873#true} ~z := #in~z;#res := 2 + ~z; {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:03,977 INFO L273 TraceCheckUtils]: 14: Hoare triple {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:03,979 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {878#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #39#return; {879#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-23 13:05:03,981 INFO L273 TraceCheckUtils]: 16: Hoare triple {879#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {880#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:03,981 INFO L273 TraceCheckUtils]: 17: Hoare triple {880#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {880#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:03,982 INFO L256 TraceCheckUtils]: 18: Hoare triple {880#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {873#true} is VALID [2018-11-23 13:05:03,983 INFO L273 TraceCheckUtils]: 19: Hoare triple {873#true} ~z := #in~z;#res := 2 + ~z; {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:03,984 INFO L273 TraceCheckUtils]: 20: Hoare triple {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:03,986 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {880#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #39#return; {881#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-23 13:05:03,987 INFO L273 TraceCheckUtils]: 22: Hoare triple {881#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {882#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:03,988 INFO L273 TraceCheckUtils]: 23: Hoare triple {882#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {882#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:03,988 INFO L256 TraceCheckUtils]: 24: Hoare triple {882#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call #t~ret0 := f(~x~0); {873#true} is VALID [2018-11-23 13:05:03,997 INFO L273 TraceCheckUtils]: 25: Hoare triple {873#true} ~z := #in~z;#res := 2 + ~z; {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:03,998 INFO L273 TraceCheckUtils]: 26: Hoare triple {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:04,000 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {876#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {882#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #39#return; {883#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} is VALID [2018-11-23 13:05:04,003 INFO L273 TraceCheckUtils]: 28: Hoare triple {883#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {972#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:04,004 INFO L273 TraceCheckUtils]: 29: Hoare triple {972#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(~x~0 % 4294967296 < 268435455); {874#false} is VALID [2018-11-23 13:05:04,004 INFO L256 TraceCheckUtils]: 30: Hoare triple {874#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {874#false} is VALID [2018-11-23 13:05:04,004 INFO L273 TraceCheckUtils]: 31: Hoare triple {874#false} ~cond := #in~cond; {874#false} is VALID [2018-11-23 13:05:04,005 INFO L273 TraceCheckUtils]: 32: Hoare triple {874#false} assume 0 == ~cond; {874#false} is VALID [2018-11-23 13:05:04,005 INFO L273 TraceCheckUtils]: 33: Hoare triple {874#false} assume !false; {874#false} is VALID [2018-11-23 13:05:04,008 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 13:05:04,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:04,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-23 13:05:04,027 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2018-11-23 13:05:04,027 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:04,028 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 13:05:04,086 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:04,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 13:05:04,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 13:05:04,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:05:04,087 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 13 states. [2018-11-23 13:05:05,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:05,119 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2018-11-23 13:05:05,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 13:05:05,119 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2018-11-23 13:05:05,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:05,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:05:05,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 41 transitions. [2018-11-23 13:05:05,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:05:05,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 41 transitions. [2018-11-23 13:05:05,126 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 41 transitions. [2018-11-23 13:05:05,318 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-23 13:05:05,320 INFO L225 Difference]: With dead ends: 36 [2018-11-23 13:05:05,320 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 13:05:05,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:05:05,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 13:05:05,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-11-23 13:05:05,355 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:05,355 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 29 states. [2018-11-23 13:05:05,355 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 29 states. [2018-11-23 13:05:05,355 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 29 states. [2018-11-23 13:05:05,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:05,358 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-23 13:05:05,358 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-23 13:05:05,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:05,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:05,359 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 31 states. [2018-11-23 13:05:05,359 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 31 states. [2018-11-23 13:05:05,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:05,362 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-23 13:05:05,362 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-23 13:05:05,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:05,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:05,363 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:05,363 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:05,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 13:05:05,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-11-23 13:05:05,368 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 34 [2018-11-23 13:05:05,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:05,368 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-23 13:05:05,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 13:05:05,368 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 13:05:05,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 13:05:05,369 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:05,369 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:05,370 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:05,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:05,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1545919054, now seen corresponding path program 5 times [2018-11-23 13:05:05,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:05,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:05,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:05,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:05,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:05,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:06,136 INFO L256 TraceCheckUtils]: 0: Hoare triple {1161#true} call ULTIMATE.init(); {1161#true} is VALID [2018-11-23 13:05:06,136 INFO L273 TraceCheckUtils]: 1: Hoare triple {1161#true} assume true; {1161#true} is VALID [2018-11-23 13:05:06,136 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1161#true} {1161#true} #35#return; {1161#true} is VALID [2018-11-23 13:05:06,137 INFO L256 TraceCheckUtils]: 3: Hoare triple {1161#true} call #t~ret1 := main(); {1161#true} is VALID [2018-11-23 13:05:06,138 INFO L273 TraceCheckUtils]: 4: Hoare triple {1161#true} ~x~0 := 0; {1163#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:06,141 INFO L273 TraceCheckUtils]: 5: Hoare triple {1163#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1163#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:06,142 INFO L256 TraceCheckUtils]: 6: Hoare triple {1163#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {1161#true} is VALID [2018-11-23 13:05:06,145 INFO L273 TraceCheckUtils]: 7: Hoare triple {1161#true} ~z := #in~z;#res := 2 + ~z; {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:06,146 INFO L273 TraceCheckUtils]: 8: Hoare triple {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:06,147 INFO L268 TraceCheckUtils]: 9: Hoare quadruple {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1163#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #39#return; {1165#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-23 13:05:06,147 INFO L273 TraceCheckUtils]: 10: Hoare triple {1165#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {1166#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:06,148 INFO L273 TraceCheckUtils]: 11: Hoare triple {1166#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {1166#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:06,149 INFO L256 TraceCheckUtils]: 12: Hoare triple {1166#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {1161#true} is VALID [2018-11-23 13:05:06,149 INFO L273 TraceCheckUtils]: 13: Hoare triple {1161#true} ~z := #in~z;#res := 2 + ~z; {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:06,150 INFO L273 TraceCheckUtils]: 14: Hoare triple {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:06,152 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1166#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #39#return; {1167#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-23 13:05:06,152 INFO L273 TraceCheckUtils]: 16: Hoare triple {1167#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1168#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:06,153 INFO L273 TraceCheckUtils]: 17: Hoare triple {1168#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {1168#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:06,154 INFO L256 TraceCheckUtils]: 18: Hoare triple {1168#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {1161#true} is VALID [2018-11-23 13:05:06,154 INFO L273 TraceCheckUtils]: 19: Hoare triple {1161#true} ~z := #in~z;#res := 2 + ~z; {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:06,155 INFO L273 TraceCheckUtils]: 20: Hoare triple {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:06,157 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1168#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #39#return; {1169#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-23 13:05:06,157 INFO L273 TraceCheckUtils]: 22: Hoare triple {1169#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1170#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:06,158 INFO L273 TraceCheckUtils]: 23: Hoare triple {1170#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1170#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:06,159 INFO L256 TraceCheckUtils]: 24: Hoare triple {1170#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call #t~ret0 := f(~x~0); {1161#true} is VALID [2018-11-23 13:05:06,159 INFO L273 TraceCheckUtils]: 25: Hoare triple {1161#true} ~z := #in~z;#res := 2 + ~z; {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:06,160 INFO L273 TraceCheckUtils]: 26: Hoare triple {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:06,162 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1170#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #39#return; {1171#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} is VALID [2018-11-23 13:05:06,163 INFO L273 TraceCheckUtils]: 28: Hoare triple {1171#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1172#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:06,164 INFO L273 TraceCheckUtils]: 29: Hoare triple {1172#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {1172#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:06,164 INFO L256 TraceCheckUtils]: 30: Hoare triple {1172#(and (<= 8 main_~x~0) (<= main_~x~0 8))} call #t~ret0 := f(~x~0); {1161#true} is VALID [2018-11-23 13:05:06,165 INFO L273 TraceCheckUtils]: 31: Hoare triple {1161#true} ~z := #in~z;#res := 2 + ~z; {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:06,168 INFO L273 TraceCheckUtils]: 32: Hoare triple {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:06,169 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1172#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #39#return; {1173#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} is VALID [2018-11-23 13:05:06,172 INFO L273 TraceCheckUtils]: 34: Hoare triple {1173#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1174#(and (<= main_~x~0 10) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:05:06,176 INFO L273 TraceCheckUtils]: 35: Hoare triple {1174#(and (<= main_~x~0 10) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {1162#false} is VALID [2018-11-23 13:05:06,176 INFO L256 TraceCheckUtils]: 36: Hoare triple {1162#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1162#false} is VALID [2018-11-23 13:05:06,177 INFO L273 TraceCheckUtils]: 37: Hoare triple {1162#false} ~cond := #in~cond; {1162#false} is VALID [2018-11-23 13:05:06,177 INFO L273 TraceCheckUtils]: 38: Hoare triple {1162#false} assume 0 == ~cond; {1162#false} is VALID [2018-11-23 13:05:06,177 INFO L273 TraceCheckUtils]: 39: Hoare triple {1162#false} assume !false; {1162#false} is VALID [2018-11-23 13:05:06,180 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-23 13:05:06,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:06,181 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-23 13:05:06,198 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:05:06,228 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 13:05:06,228 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:06,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:06,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:06,460 INFO L256 TraceCheckUtils]: 0: Hoare triple {1161#true} call ULTIMATE.init(); {1161#true} is VALID [2018-11-23 13:05:06,460 INFO L273 TraceCheckUtils]: 1: Hoare triple {1161#true} assume true; {1161#true} is VALID [2018-11-23 13:05:06,460 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1161#true} {1161#true} #35#return; {1161#true} is VALID [2018-11-23 13:05:06,461 INFO L256 TraceCheckUtils]: 3: Hoare triple {1161#true} call #t~ret1 := main(); {1161#true} is VALID [2018-11-23 13:05:06,462 INFO L273 TraceCheckUtils]: 4: Hoare triple {1161#true} ~x~0 := 0; {1163#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:06,462 INFO L273 TraceCheckUtils]: 5: Hoare triple {1163#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1163#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:06,462 INFO L256 TraceCheckUtils]: 6: Hoare triple {1163#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {1161#true} is VALID [2018-11-23 13:05:06,463 INFO L273 TraceCheckUtils]: 7: Hoare triple {1161#true} ~z := #in~z;#res := 2 + ~z; {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:06,463 INFO L273 TraceCheckUtils]: 8: Hoare triple {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:06,464 INFO L268 TraceCheckUtils]: 9: Hoare quadruple {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1163#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #39#return; {1165#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-23 13:05:06,465 INFO L273 TraceCheckUtils]: 10: Hoare triple {1165#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {1166#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:06,466 INFO L273 TraceCheckUtils]: 11: Hoare triple {1166#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {1166#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:06,466 INFO L256 TraceCheckUtils]: 12: Hoare triple {1166#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {1161#true} is VALID [2018-11-23 13:05:06,467 INFO L273 TraceCheckUtils]: 13: Hoare triple {1161#true} ~z := #in~z;#res := 2 + ~z; {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:06,468 INFO L273 TraceCheckUtils]: 14: Hoare triple {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:06,469 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1166#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #39#return; {1167#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-23 13:05:06,470 INFO L273 TraceCheckUtils]: 16: Hoare triple {1167#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1168#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:06,471 INFO L273 TraceCheckUtils]: 17: Hoare triple {1168#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {1168#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:06,471 INFO L256 TraceCheckUtils]: 18: Hoare triple {1168#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {1161#true} is VALID [2018-11-23 13:05:06,472 INFO L273 TraceCheckUtils]: 19: Hoare triple {1161#true} ~z := #in~z;#res := 2 + ~z; {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:06,473 INFO L273 TraceCheckUtils]: 20: Hoare triple {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:06,474 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1168#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #39#return; {1169#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-23 13:05:06,475 INFO L273 TraceCheckUtils]: 22: Hoare triple {1169#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1170#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:06,476 INFO L273 TraceCheckUtils]: 23: Hoare triple {1170#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1170#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:06,476 INFO L256 TraceCheckUtils]: 24: Hoare triple {1170#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call #t~ret0 := f(~x~0); {1161#true} is VALID [2018-11-23 13:05:06,477 INFO L273 TraceCheckUtils]: 25: Hoare triple {1161#true} ~z := #in~z;#res := 2 + ~z; {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:06,478 INFO L273 TraceCheckUtils]: 26: Hoare triple {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:06,479 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1170#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #39#return; {1171#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} is VALID [2018-11-23 13:05:06,480 INFO L273 TraceCheckUtils]: 28: Hoare triple {1171#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1172#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:06,481 INFO L273 TraceCheckUtils]: 29: Hoare triple {1172#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {1172#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:06,481 INFO L256 TraceCheckUtils]: 30: Hoare triple {1172#(and (<= 8 main_~x~0) (<= main_~x~0 8))} call #t~ret0 := f(~x~0); {1161#true} is VALID [2018-11-23 13:05:06,482 INFO L273 TraceCheckUtils]: 31: Hoare triple {1161#true} ~z := #in~z;#res := 2 + ~z; {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:06,484 INFO L273 TraceCheckUtils]: 32: Hoare triple {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:06,485 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {1164#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1172#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #39#return; {1173#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} is VALID [2018-11-23 13:05:06,486 INFO L273 TraceCheckUtils]: 34: Hoare triple {1173#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1280#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:06,487 INFO L273 TraceCheckUtils]: 35: Hoare triple {1280#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {1162#false} is VALID [2018-11-23 13:05:06,487 INFO L256 TraceCheckUtils]: 36: Hoare triple {1162#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1162#false} is VALID [2018-11-23 13:05:06,487 INFO L273 TraceCheckUtils]: 37: Hoare triple {1162#false} ~cond := #in~cond; {1162#false} is VALID [2018-11-23 13:05:06,488 INFO L273 TraceCheckUtils]: 38: Hoare triple {1162#false} assume 0 == ~cond; {1162#false} is VALID [2018-11-23 13:05:06,488 INFO L273 TraceCheckUtils]: 39: Hoare triple {1162#false} assume !false; {1162#false} is VALID [2018-11-23 13:05:06,491 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-23 13:05:06,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:06,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-23 13:05:06,512 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2018-11-23 13:05:06,512 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:06,512 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 13:05:06,553 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:06,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 13:05:06,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 13:05:06,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-11-23 13:05:06,555 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 15 states. [2018-11-23 13:05:07,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:07,767 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2018-11-23 13:05:07,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 13:05:07,768 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2018-11-23 13:05:07,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:07,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:05:07,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 45 transitions. [2018-11-23 13:05:07,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:05:07,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 45 transitions. [2018-11-23 13:05:07,774 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 45 transitions. [2018-11-23 13:05:07,897 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:07,899 INFO L225 Difference]: With dead ends: 39 [2018-11-23 13:05:07,899 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 13:05:07,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 38 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-23 13:05:07,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 13:05:07,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-11-23 13:05:07,922 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:07,922 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 32 states. [2018-11-23 13:05:07,922 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 32 states. [2018-11-23 13:05:07,923 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 32 states. [2018-11-23 13:05:07,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:07,926 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2018-11-23 13:05:07,926 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2018-11-23 13:05:07,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:07,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:07,927 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 34 states. [2018-11-23 13:05:07,927 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 34 states. [2018-11-23 13:05:07,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:07,930 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2018-11-23 13:05:07,930 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2018-11-23 13:05:07,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:07,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:07,931 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:07,931 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:07,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 13:05:07,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-11-23 13:05:07,933 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 40 [2018-11-23 13:05:07,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:07,934 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-11-23 13:05:07,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 13:05:07,934 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-11-23 13:05:07,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 13:05:07,935 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:07,935 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:07,936 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:07,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:07,936 INFO L82 PathProgramCache]: Analyzing trace with hash 128504940, now seen corresponding path program 6 times [2018-11-23 13:05:07,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:07,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:07,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:07,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:07,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:07,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:08,356 INFO L256 TraceCheckUtils]: 0: Hoare triple {1487#true} call ULTIMATE.init(); {1487#true} is VALID [2018-11-23 13:05:08,357 INFO L273 TraceCheckUtils]: 1: Hoare triple {1487#true} assume true; {1487#true} is VALID [2018-11-23 13:05:08,357 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1487#true} {1487#true} #35#return; {1487#true} is VALID [2018-11-23 13:05:08,357 INFO L256 TraceCheckUtils]: 3: Hoare triple {1487#true} call #t~ret1 := main(); {1487#true} is VALID [2018-11-23 13:05:08,358 INFO L273 TraceCheckUtils]: 4: Hoare triple {1487#true} ~x~0 := 0; {1489#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:08,359 INFO L273 TraceCheckUtils]: 5: Hoare triple {1489#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1489#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:08,359 INFO L256 TraceCheckUtils]: 6: Hoare triple {1489#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {1487#true} is VALID [2018-11-23 13:05:08,360 INFO L273 TraceCheckUtils]: 7: Hoare triple {1487#true} ~z := #in~z;#res := 2 + ~z; {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:08,363 INFO L273 TraceCheckUtils]: 8: Hoare triple {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:08,364 INFO L268 TraceCheckUtils]: 9: Hoare quadruple {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1489#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #39#return; {1491#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-23 13:05:08,365 INFO L273 TraceCheckUtils]: 10: Hoare triple {1491#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {1492#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:08,365 INFO L273 TraceCheckUtils]: 11: Hoare triple {1492#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {1492#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:08,366 INFO L256 TraceCheckUtils]: 12: Hoare triple {1492#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {1487#true} is VALID [2018-11-23 13:05:08,367 INFO L273 TraceCheckUtils]: 13: Hoare triple {1487#true} ~z := #in~z;#res := 2 + ~z; {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:08,367 INFO L273 TraceCheckUtils]: 14: Hoare triple {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:08,369 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1492#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #39#return; {1493#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-23 13:05:08,369 INFO L273 TraceCheckUtils]: 16: Hoare triple {1493#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1494#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:08,370 INFO L273 TraceCheckUtils]: 17: Hoare triple {1494#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {1494#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:08,371 INFO L256 TraceCheckUtils]: 18: Hoare triple {1494#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {1487#true} is VALID [2018-11-23 13:05:08,371 INFO L273 TraceCheckUtils]: 19: Hoare triple {1487#true} ~z := #in~z;#res := 2 + ~z; {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:08,372 INFO L273 TraceCheckUtils]: 20: Hoare triple {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:08,373 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1494#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #39#return; {1495#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-23 13:05:08,374 INFO L273 TraceCheckUtils]: 22: Hoare triple {1495#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1496#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:08,375 INFO L273 TraceCheckUtils]: 23: Hoare triple {1496#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1496#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:08,375 INFO L256 TraceCheckUtils]: 24: Hoare triple {1496#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call #t~ret0 := f(~x~0); {1487#true} is VALID [2018-11-23 13:05:08,376 INFO L273 TraceCheckUtils]: 25: Hoare triple {1487#true} ~z := #in~z;#res := 2 + ~z; {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:08,377 INFO L273 TraceCheckUtils]: 26: Hoare triple {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:08,378 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1496#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #39#return; {1497#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} is VALID [2018-11-23 13:05:08,379 INFO L273 TraceCheckUtils]: 28: Hoare triple {1497#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1498#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:08,380 INFO L273 TraceCheckUtils]: 29: Hoare triple {1498#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {1498#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:08,380 INFO L256 TraceCheckUtils]: 30: Hoare triple {1498#(and (<= 8 main_~x~0) (<= main_~x~0 8))} call #t~ret0 := f(~x~0); {1487#true} is VALID [2018-11-23 13:05:08,381 INFO L273 TraceCheckUtils]: 31: Hoare triple {1487#true} ~z := #in~z;#res := 2 + ~z; {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:08,381 INFO L273 TraceCheckUtils]: 32: Hoare triple {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:08,383 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1498#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #39#return; {1499#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} is VALID [2018-11-23 13:05:08,384 INFO L273 TraceCheckUtils]: 34: Hoare triple {1499#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1500#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:08,384 INFO L273 TraceCheckUtils]: 35: Hoare triple {1500#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1500#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:08,385 INFO L256 TraceCheckUtils]: 36: Hoare triple {1500#(and (<= main_~x~0 10) (<= 10 main_~x~0))} call #t~ret0 := f(~x~0); {1487#true} is VALID [2018-11-23 13:05:08,385 INFO L273 TraceCheckUtils]: 37: Hoare triple {1487#true} ~z := #in~z;#res := 2 + ~z; {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:08,386 INFO L273 TraceCheckUtils]: 38: Hoare triple {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:08,387 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1500#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #39#return; {1501#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} is VALID [2018-11-23 13:05:08,388 INFO L273 TraceCheckUtils]: 40: Hoare triple {1501#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1502#(and (<= main_~x~0 12) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:05:08,389 INFO L273 TraceCheckUtils]: 41: Hoare triple {1502#(and (<= main_~x~0 12) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {1488#false} is VALID [2018-11-23 13:05:08,390 INFO L256 TraceCheckUtils]: 42: Hoare triple {1488#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1488#false} is VALID [2018-11-23 13:05:08,390 INFO L273 TraceCheckUtils]: 43: Hoare triple {1488#false} ~cond := #in~cond; {1488#false} is VALID [2018-11-23 13:05:08,390 INFO L273 TraceCheckUtils]: 44: Hoare triple {1488#false} assume 0 == ~cond; {1488#false} is VALID [2018-11-23 13:05:08,390 INFO L273 TraceCheckUtils]: 45: Hoare triple {1488#false} assume !false; {1488#false} is VALID [2018-11-23 13:05:08,395 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-23 13:05:08,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:08,395 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-23 13:05:08,405 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:05:08,515 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 13:05:08,515 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:08,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:08,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:08,879 INFO L256 TraceCheckUtils]: 0: Hoare triple {1487#true} call ULTIMATE.init(); {1487#true} is VALID [2018-11-23 13:05:08,880 INFO L273 TraceCheckUtils]: 1: Hoare triple {1487#true} assume true; {1487#true} is VALID [2018-11-23 13:05:08,880 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1487#true} {1487#true} #35#return; {1487#true} is VALID [2018-11-23 13:05:08,880 INFO L256 TraceCheckUtils]: 3: Hoare triple {1487#true} call #t~ret1 := main(); {1487#true} is VALID [2018-11-23 13:05:08,886 INFO L273 TraceCheckUtils]: 4: Hoare triple {1487#true} ~x~0 := 0; {1489#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:08,887 INFO L273 TraceCheckUtils]: 5: Hoare triple {1489#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1489#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:08,887 INFO L256 TraceCheckUtils]: 6: Hoare triple {1489#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {1487#true} is VALID [2018-11-23 13:05:08,888 INFO L273 TraceCheckUtils]: 7: Hoare triple {1487#true} ~z := #in~z;#res := 2 + ~z; {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:08,888 INFO L273 TraceCheckUtils]: 8: Hoare triple {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:08,890 INFO L268 TraceCheckUtils]: 9: Hoare quadruple {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1489#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #39#return; {1491#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-23 13:05:08,890 INFO L273 TraceCheckUtils]: 10: Hoare triple {1491#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {1492#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:08,891 INFO L273 TraceCheckUtils]: 11: Hoare triple {1492#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {1492#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:08,892 INFO L256 TraceCheckUtils]: 12: Hoare triple {1492#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {1487#true} is VALID [2018-11-23 13:05:08,892 INFO L273 TraceCheckUtils]: 13: Hoare triple {1487#true} ~z := #in~z;#res := 2 + ~z; {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:08,893 INFO L273 TraceCheckUtils]: 14: Hoare triple {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:08,895 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1492#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #39#return; {1493#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-23 13:05:08,896 INFO L273 TraceCheckUtils]: 16: Hoare triple {1493#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1494#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:08,912 INFO L273 TraceCheckUtils]: 17: Hoare triple {1494#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {1494#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:08,912 INFO L256 TraceCheckUtils]: 18: Hoare triple {1494#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {1487#true} is VALID [2018-11-23 13:05:08,913 INFO L273 TraceCheckUtils]: 19: Hoare triple {1487#true} ~z := #in~z;#res := 2 + ~z; {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:08,914 INFO L273 TraceCheckUtils]: 20: Hoare triple {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:08,915 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1494#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #39#return; {1495#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-23 13:05:08,915 INFO L273 TraceCheckUtils]: 22: Hoare triple {1495#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1496#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:08,916 INFO L273 TraceCheckUtils]: 23: Hoare triple {1496#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1496#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:08,916 INFO L256 TraceCheckUtils]: 24: Hoare triple {1496#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call #t~ret0 := f(~x~0); {1487#true} is VALID [2018-11-23 13:05:08,917 INFO L273 TraceCheckUtils]: 25: Hoare triple {1487#true} ~z := #in~z;#res := 2 + ~z; {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:08,918 INFO L273 TraceCheckUtils]: 26: Hoare triple {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:08,920 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1496#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #39#return; {1497#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} is VALID [2018-11-23 13:05:08,921 INFO L273 TraceCheckUtils]: 28: Hoare triple {1497#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1498#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:08,921 INFO L273 TraceCheckUtils]: 29: Hoare triple {1498#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {1498#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:08,922 INFO L256 TraceCheckUtils]: 30: Hoare triple {1498#(and (<= 8 main_~x~0) (<= main_~x~0 8))} call #t~ret0 := f(~x~0); {1487#true} is VALID [2018-11-23 13:05:08,923 INFO L273 TraceCheckUtils]: 31: Hoare triple {1487#true} ~z := #in~z;#res := 2 + ~z; {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:08,923 INFO L273 TraceCheckUtils]: 32: Hoare triple {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:08,925 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1498#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #39#return; {1499#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} is VALID [2018-11-23 13:05:08,928 INFO L273 TraceCheckUtils]: 34: Hoare triple {1499#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1500#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:08,929 INFO L273 TraceCheckUtils]: 35: Hoare triple {1500#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1500#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:08,929 INFO L256 TraceCheckUtils]: 36: Hoare triple {1500#(and (<= main_~x~0 10) (<= 10 main_~x~0))} call #t~ret0 := f(~x~0); {1487#true} is VALID [2018-11-23 13:05:08,930 INFO L273 TraceCheckUtils]: 37: Hoare triple {1487#true} ~z := #in~z;#res := 2 + ~z; {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:08,938 INFO L273 TraceCheckUtils]: 38: Hoare triple {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:08,939 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {1490#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1500#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #39#return; {1501#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} is VALID [2018-11-23 13:05:08,940 INFO L273 TraceCheckUtils]: 40: Hoare triple {1501#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1626#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:05:08,941 INFO L273 TraceCheckUtils]: 41: Hoare triple {1626#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {1488#false} is VALID [2018-11-23 13:05:08,941 INFO L256 TraceCheckUtils]: 42: Hoare triple {1488#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1488#false} is VALID [2018-11-23 13:05:08,941 INFO L273 TraceCheckUtils]: 43: Hoare triple {1488#false} ~cond := #in~cond; {1488#false} is VALID [2018-11-23 13:05:08,941 INFO L273 TraceCheckUtils]: 44: Hoare triple {1488#false} assume 0 == ~cond; {1488#false} is VALID [2018-11-23 13:05:08,941 INFO L273 TraceCheckUtils]: 45: Hoare triple {1488#false} assume !false; {1488#false} is VALID [2018-11-23 13:05:08,945 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-23 13:05:08,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:08,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 13:05:08,964 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 46 [2018-11-23 13:05:08,964 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:08,965 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 13:05:09,000 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:09,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 13:05:09,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 13:05:09,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:05:09,001 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 17 states. [2018-11-23 13:05:10,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:10,324 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2018-11-23 13:05:10,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 13:05:10,324 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 46 [2018-11-23 13:05:10,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:10,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:05:10,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 49 transitions. [2018-11-23 13:05:10,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:05:10,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 49 transitions. [2018-11-23 13:05:10,330 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 49 transitions. [2018-11-23 13:05:10,404 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:10,405 INFO L225 Difference]: With dead ends: 42 [2018-11-23 13:05:10,406 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 13:05:10,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 44 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-23 13:05:10,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 13:05:10,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-11-23 13:05:10,440 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:10,440 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 35 states. [2018-11-23 13:05:10,440 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 35 states. [2018-11-23 13:05:10,440 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 35 states. [2018-11-23 13:05:10,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:10,443 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2018-11-23 13:05:10,443 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2018-11-23 13:05:10,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:10,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:10,443 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 37 states. [2018-11-23 13:05:10,444 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 37 states. [2018-11-23 13:05:10,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:10,446 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2018-11-23 13:05:10,446 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2018-11-23 13:05:10,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:10,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:10,447 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:10,447 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:10,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 13:05:10,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2018-11-23 13:05:10,449 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 46 [2018-11-23 13:05:10,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:10,449 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-11-23 13:05:10,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 13:05:10,450 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2018-11-23 13:05:10,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 13:05:10,451 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:10,451 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:10,451 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:10,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:10,452 INFO L82 PathProgramCache]: Analyzing trace with hash -842776566, now seen corresponding path program 7 times [2018-11-23 13:05:10,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:10,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:10,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:10,453 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:10,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:10,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:11,396 INFO L256 TraceCheckUtils]: 0: Hoare triple {1851#true} call ULTIMATE.init(); {1851#true} is VALID [2018-11-23 13:05:11,397 INFO L273 TraceCheckUtils]: 1: Hoare triple {1851#true} assume true; {1851#true} is VALID [2018-11-23 13:05:11,397 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1851#true} {1851#true} #35#return; {1851#true} is VALID [2018-11-23 13:05:11,397 INFO L256 TraceCheckUtils]: 3: Hoare triple {1851#true} call #t~ret1 := main(); {1851#true} is VALID [2018-11-23 13:05:11,406 INFO L273 TraceCheckUtils]: 4: Hoare triple {1851#true} ~x~0 := 0; {1853#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:11,407 INFO L273 TraceCheckUtils]: 5: Hoare triple {1853#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1853#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:11,408 INFO L256 TraceCheckUtils]: 6: Hoare triple {1853#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {1851#true} is VALID [2018-11-23 13:05:11,408 INFO L273 TraceCheckUtils]: 7: Hoare triple {1851#true} ~z := #in~z;#res := 2 + ~z; {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:11,410 INFO L273 TraceCheckUtils]: 8: Hoare triple {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:11,412 INFO L268 TraceCheckUtils]: 9: Hoare quadruple {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1853#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #39#return; {1855#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-23 13:05:11,412 INFO L273 TraceCheckUtils]: 10: Hoare triple {1855#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {1856#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:11,413 INFO L273 TraceCheckUtils]: 11: Hoare triple {1856#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {1856#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:11,413 INFO L256 TraceCheckUtils]: 12: Hoare triple {1856#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {1851#true} is VALID [2018-11-23 13:05:11,414 INFO L273 TraceCheckUtils]: 13: Hoare triple {1851#true} ~z := #in~z;#res := 2 + ~z; {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:11,414 INFO L273 TraceCheckUtils]: 14: Hoare triple {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:11,416 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1856#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #39#return; {1857#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-23 13:05:11,417 INFO L273 TraceCheckUtils]: 16: Hoare triple {1857#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1858#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:11,418 INFO L273 TraceCheckUtils]: 17: Hoare triple {1858#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {1858#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:11,418 INFO L256 TraceCheckUtils]: 18: Hoare triple {1858#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {1851#true} is VALID [2018-11-23 13:05:11,419 INFO L273 TraceCheckUtils]: 19: Hoare triple {1851#true} ~z := #in~z;#res := 2 + ~z; {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:11,420 INFO L273 TraceCheckUtils]: 20: Hoare triple {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:11,422 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1858#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #39#return; {1859#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-23 13:05:11,423 INFO L273 TraceCheckUtils]: 22: Hoare triple {1859#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1860#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:11,425 INFO L273 TraceCheckUtils]: 23: Hoare triple {1860#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1860#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:11,425 INFO L256 TraceCheckUtils]: 24: Hoare triple {1860#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call #t~ret0 := f(~x~0); {1851#true} is VALID [2018-11-23 13:05:11,426 INFO L273 TraceCheckUtils]: 25: Hoare triple {1851#true} ~z := #in~z;#res := 2 + ~z; {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:11,427 INFO L273 TraceCheckUtils]: 26: Hoare triple {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:11,429 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1860#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #39#return; {1861#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} is VALID [2018-11-23 13:05:11,430 INFO L273 TraceCheckUtils]: 28: Hoare triple {1861#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1862#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:11,431 INFO L273 TraceCheckUtils]: 29: Hoare triple {1862#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {1862#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:11,432 INFO L256 TraceCheckUtils]: 30: Hoare triple {1862#(and (<= 8 main_~x~0) (<= main_~x~0 8))} call #t~ret0 := f(~x~0); {1851#true} is VALID [2018-11-23 13:05:11,433 INFO L273 TraceCheckUtils]: 31: Hoare triple {1851#true} ~z := #in~z;#res := 2 + ~z; {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:11,433 INFO L273 TraceCheckUtils]: 32: Hoare triple {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:11,436 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1862#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #39#return; {1863#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} is VALID [2018-11-23 13:05:11,437 INFO L273 TraceCheckUtils]: 34: Hoare triple {1863#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1864#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:11,437 INFO L273 TraceCheckUtils]: 35: Hoare triple {1864#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1864#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:11,438 INFO L256 TraceCheckUtils]: 36: Hoare triple {1864#(and (<= main_~x~0 10) (<= 10 main_~x~0))} call #t~ret0 := f(~x~0); {1851#true} is VALID [2018-11-23 13:05:11,439 INFO L273 TraceCheckUtils]: 37: Hoare triple {1851#true} ~z := #in~z;#res := 2 + ~z; {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:11,440 INFO L273 TraceCheckUtils]: 38: Hoare triple {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:11,442 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1864#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #39#return; {1865#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} is VALID [2018-11-23 13:05:11,443 INFO L273 TraceCheckUtils]: 40: Hoare triple {1865#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1866#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:05:11,444 INFO L273 TraceCheckUtils]: 41: Hoare triple {1866#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1866#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:05:11,444 INFO L256 TraceCheckUtils]: 42: Hoare triple {1866#(and (<= main_~x~0 12) (<= 12 main_~x~0))} call #t~ret0 := f(~x~0); {1851#true} is VALID [2018-11-23 13:05:11,445 INFO L273 TraceCheckUtils]: 43: Hoare triple {1851#true} ~z := #in~z;#res := 2 + ~z; {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:11,446 INFO L273 TraceCheckUtils]: 44: Hoare triple {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:11,448 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1866#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #39#return; {1867#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} is VALID [2018-11-23 13:05:11,449 INFO L273 TraceCheckUtils]: 46: Hoare triple {1867#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1868#(and (<= main_~x~0 14) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:05:11,450 INFO L273 TraceCheckUtils]: 47: Hoare triple {1868#(and (<= main_~x~0 14) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {1852#false} is VALID [2018-11-23 13:05:11,450 INFO L256 TraceCheckUtils]: 48: Hoare triple {1852#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1852#false} is VALID [2018-11-23 13:05:11,450 INFO L273 TraceCheckUtils]: 49: Hoare triple {1852#false} ~cond := #in~cond; {1852#false} is VALID [2018-11-23 13:05:11,451 INFO L273 TraceCheckUtils]: 50: Hoare triple {1852#false} assume 0 == ~cond; {1852#false} is VALID [2018-11-23 13:05:11,451 INFO L273 TraceCheckUtils]: 51: Hoare triple {1852#false} assume !false; {1852#false} is VALID [2018-11-23 13:05:11,457 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-11-23 13:05:11,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:11,458 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-23 13:05:11,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:05:11,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:11,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:11,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:11,906 INFO L256 TraceCheckUtils]: 0: Hoare triple {1851#true} call ULTIMATE.init(); {1851#true} is VALID [2018-11-23 13:05:11,906 INFO L273 TraceCheckUtils]: 1: Hoare triple {1851#true} assume true; {1851#true} is VALID [2018-11-23 13:05:11,907 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1851#true} {1851#true} #35#return; {1851#true} is VALID [2018-11-23 13:05:11,907 INFO L256 TraceCheckUtils]: 3: Hoare triple {1851#true} call #t~ret1 := main(); {1851#true} is VALID [2018-11-23 13:05:11,907 INFO L273 TraceCheckUtils]: 4: Hoare triple {1851#true} ~x~0 := 0; {1853#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:11,908 INFO L273 TraceCheckUtils]: 5: Hoare triple {1853#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1853#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:11,908 INFO L256 TraceCheckUtils]: 6: Hoare triple {1853#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {1851#true} is VALID [2018-11-23 13:05:11,909 INFO L273 TraceCheckUtils]: 7: Hoare triple {1851#true} ~z := #in~z;#res := 2 + ~z; {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:11,911 INFO L273 TraceCheckUtils]: 8: Hoare triple {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:11,913 INFO L268 TraceCheckUtils]: 9: Hoare quadruple {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1853#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #39#return; {1855#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-23 13:05:11,913 INFO L273 TraceCheckUtils]: 10: Hoare triple {1855#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {1856#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:11,914 INFO L273 TraceCheckUtils]: 11: Hoare triple {1856#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {1856#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:11,914 INFO L256 TraceCheckUtils]: 12: Hoare triple {1856#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {1851#true} is VALID [2018-11-23 13:05:11,915 INFO L273 TraceCheckUtils]: 13: Hoare triple {1851#true} ~z := #in~z;#res := 2 + ~z; {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:11,916 INFO L273 TraceCheckUtils]: 14: Hoare triple {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:11,918 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1856#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #39#return; {1857#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-23 13:05:11,919 INFO L273 TraceCheckUtils]: 16: Hoare triple {1857#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1858#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:11,919 INFO L273 TraceCheckUtils]: 17: Hoare triple {1858#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {1858#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:11,920 INFO L256 TraceCheckUtils]: 18: Hoare triple {1858#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {1851#true} is VALID [2018-11-23 13:05:11,927 INFO L273 TraceCheckUtils]: 19: Hoare triple {1851#true} ~z := #in~z;#res := 2 + ~z; {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:11,927 INFO L273 TraceCheckUtils]: 20: Hoare triple {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:11,929 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1858#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #39#return; {1859#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-23 13:05:11,930 INFO L273 TraceCheckUtils]: 22: Hoare triple {1859#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1860#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:11,930 INFO L273 TraceCheckUtils]: 23: Hoare triple {1860#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1860#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:11,930 INFO L256 TraceCheckUtils]: 24: Hoare triple {1860#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call #t~ret0 := f(~x~0); {1851#true} is VALID [2018-11-23 13:05:11,931 INFO L273 TraceCheckUtils]: 25: Hoare triple {1851#true} ~z := #in~z;#res := 2 + ~z; {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:11,932 INFO L273 TraceCheckUtils]: 26: Hoare triple {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:11,934 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1860#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #39#return; {1861#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} is VALID [2018-11-23 13:05:11,934 INFO L273 TraceCheckUtils]: 28: Hoare triple {1861#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1862#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:11,935 INFO L273 TraceCheckUtils]: 29: Hoare triple {1862#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {1862#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:11,936 INFO L256 TraceCheckUtils]: 30: Hoare triple {1862#(and (<= 8 main_~x~0) (<= main_~x~0 8))} call #t~ret0 := f(~x~0); {1851#true} is VALID [2018-11-23 13:05:11,957 INFO L273 TraceCheckUtils]: 31: Hoare triple {1851#true} ~z := #in~z;#res := 2 + ~z; {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:11,958 INFO L273 TraceCheckUtils]: 32: Hoare triple {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:11,959 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1862#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #39#return; {1863#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} is VALID [2018-11-23 13:05:11,965 INFO L273 TraceCheckUtils]: 34: Hoare triple {1863#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1864#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:11,965 INFO L273 TraceCheckUtils]: 35: Hoare triple {1864#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1864#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:11,965 INFO L256 TraceCheckUtils]: 36: Hoare triple {1864#(and (<= main_~x~0 10) (<= 10 main_~x~0))} call #t~ret0 := f(~x~0); {1851#true} is VALID [2018-11-23 13:05:11,966 INFO L273 TraceCheckUtils]: 37: Hoare triple {1851#true} ~z := #in~z;#res := 2 + ~z; {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:11,967 INFO L273 TraceCheckUtils]: 38: Hoare triple {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:11,968 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1864#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #39#return; {1865#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} is VALID [2018-11-23 13:05:11,969 INFO L273 TraceCheckUtils]: 40: Hoare triple {1865#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {1866#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:05:11,969 INFO L273 TraceCheckUtils]: 41: Hoare triple {1866#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {1866#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:05:11,970 INFO L256 TraceCheckUtils]: 42: Hoare triple {1866#(and (<= main_~x~0 12) (<= 12 main_~x~0))} call #t~ret0 := f(~x~0); {1851#true} is VALID [2018-11-23 13:05:11,970 INFO L273 TraceCheckUtils]: 43: Hoare triple {1851#true} ~z := #in~z;#res := 2 + ~z; {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:11,975 INFO L273 TraceCheckUtils]: 44: Hoare triple {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:11,978 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {1854#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {1866#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #39#return; {1867#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} is VALID [2018-11-23 13:05:11,979 INFO L273 TraceCheckUtils]: 46: Hoare triple {1867#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2010#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:05:11,983 INFO L273 TraceCheckUtils]: 47: Hoare triple {2010#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {1852#false} is VALID [2018-11-23 13:05:11,983 INFO L256 TraceCheckUtils]: 48: Hoare triple {1852#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1852#false} is VALID [2018-11-23 13:05:11,984 INFO L273 TraceCheckUtils]: 49: Hoare triple {1852#false} ~cond := #in~cond; {1852#false} is VALID [2018-11-23 13:05:11,984 INFO L273 TraceCheckUtils]: 50: Hoare triple {1852#false} assume 0 == ~cond; {1852#false} is VALID [2018-11-23 13:05:11,984 INFO L273 TraceCheckUtils]: 51: Hoare triple {1852#false} assume !false; {1852#false} is VALID [2018-11-23 13:05:11,989 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-11-23 13:05:12,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:12,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-23 13:05:12,010 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 52 [2018-11-23 13:05:12,010 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:12,010 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 13:05:12,054 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-23 13:05:12,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 13:05:12,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 13:05:12,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-11-23 13:05:12,055 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 19 states. [2018-11-23 13:05:13,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:13,590 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2018-11-23 13:05:13,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 13:05:13,590 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 52 [2018-11-23 13:05:13,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:13,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 13:05:13,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 53 transitions. [2018-11-23 13:05:13,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 13:05:13,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 53 transitions. [2018-11-23 13:05:13,596 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 53 transitions. [2018-11-23 13:05:13,677 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:13,679 INFO L225 Difference]: With dead ends: 45 [2018-11-23 13:05:13,679 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 13:05:13,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 50 SyntacticMatches, 9 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2018-11-23 13:05:13,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 13:05:13,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-11-23 13:05:13,707 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:13,707 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 38 states. [2018-11-23 13:05:13,707 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 38 states. [2018-11-23 13:05:13,707 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 38 states. [2018-11-23 13:05:13,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:13,710 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2018-11-23 13:05:13,710 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-23 13:05:13,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:13,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:13,711 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 40 states. [2018-11-23 13:05:13,711 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 40 states. [2018-11-23 13:05:13,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:13,714 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2018-11-23 13:05:13,714 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-23 13:05:13,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:13,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:13,715 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:13,715 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:13,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 13:05:13,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2018-11-23 13:05:13,717 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 52 [2018-11-23 13:05:13,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:13,717 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-11-23 13:05:13,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 13:05:13,717 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-11-23 13:05:13,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-23 13:05:13,718 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:13,718 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:13,719 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:13,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:13,719 INFO L82 PathProgramCache]: Analyzing trace with hash 880540968, now seen corresponding path program 8 times [2018-11-23 13:05:13,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:13,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:13,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:13,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:05:13,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:13,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:14,224 INFO L256 TraceCheckUtils]: 0: Hoare triple {2253#true} call ULTIMATE.init(); {2253#true} is VALID [2018-11-23 13:05:14,225 INFO L273 TraceCheckUtils]: 1: Hoare triple {2253#true} assume true; {2253#true} is VALID [2018-11-23 13:05:14,225 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2253#true} {2253#true} #35#return; {2253#true} is VALID [2018-11-23 13:05:14,226 INFO L256 TraceCheckUtils]: 3: Hoare triple {2253#true} call #t~ret1 := main(); {2253#true} is VALID [2018-11-23 13:05:14,226 INFO L273 TraceCheckUtils]: 4: Hoare triple {2253#true} ~x~0 := 0; {2255#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:14,227 INFO L273 TraceCheckUtils]: 5: Hoare triple {2255#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2255#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:14,227 INFO L256 TraceCheckUtils]: 6: Hoare triple {2255#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {2253#true} is VALID [2018-11-23 13:05:14,227 INFO L273 TraceCheckUtils]: 7: Hoare triple {2253#true} ~z := #in~z;#res := 2 + ~z; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:14,228 INFO L273 TraceCheckUtils]: 8: Hoare triple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:14,229 INFO L268 TraceCheckUtils]: 9: Hoare quadruple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2255#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #39#return; {2257#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-23 13:05:14,230 INFO L273 TraceCheckUtils]: 10: Hoare triple {2257#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {2258#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:14,231 INFO L273 TraceCheckUtils]: 11: Hoare triple {2258#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {2258#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:14,231 INFO L256 TraceCheckUtils]: 12: Hoare triple {2258#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {2253#true} is VALID [2018-11-23 13:05:14,232 INFO L273 TraceCheckUtils]: 13: Hoare triple {2253#true} ~z := #in~z;#res := 2 + ~z; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:14,233 INFO L273 TraceCheckUtils]: 14: Hoare triple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:14,234 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2258#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #39#return; {2259#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-23 13:05:14,251 INFO L273 TraceCheckUtils]: 16: Hoare triple {2259#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2260#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:14,252 INFO L273 TraceCheckUtils]: 17: Hoare triple {2260#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {2260#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:14,252 INFO L256 TraceCheckUtils]: 18: Hoare triple {2260#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {2253#true} is VALID [2018-11-23 13:05:14,253 INFO L273 TraceCheckUtils]: 19: Hoare triple {2253#true} ~z := #in~z;#res := 2 + ~z; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:14,253 INFO L273 TraceCheckUtils]: 20: Hoare triple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:14,255 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2260#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #39#return; {2261#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-23 13:05:14,255 INFO L273 TraceCheckUtils]: 22: Hoare triple {2261#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2262#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:14,256 INFO L273 TraceCheckUtils]: 23: Hoare triple {2262#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2262#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:14,256 INFO L256 TraceCheckUtils]: 24: Hoare triple {2262#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call #t~ret0 := f(~x~0); {2253#true} is VALID [2018-11-23 13:05:14,256 INFO L273 TraceCheckUtils]: 25: Hoare triple {2253#true} ~z := #in~z;#res := 2 + ~z; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:14,257 INFO L273 TraceCheckUtils]: 26: Hoare triple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:14,258 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2262#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #39#return; {2263#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} is VALID [2018-11-23 13:05:14,259 INFO L273 TraceCheckUtils]: 28: Hoare triple {2263#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2264#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:14,260 INFO L273 TraceCheckUtils]: 29: Hoare triple {2264#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {2264#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:14,260 INFO L256 TraceCheckUtils]: 30: Hoare triple {2264#(and (<= 8 main_~x~0) (<= main_~x~0 8))} call #t~ret0 := f(~x~0); {2253#true} is VALID [2018-11-23 13:05:14,261 INFO L273 TraceCheckUtils]: 31: Hoare triple {2253#true} ~z := #in~z;#res := 2 + ~z; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:14,261 INFO L273 TraceCheckUtils]: 32: Hoare triple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:14,263 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2264#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #39#return; {2265#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} is VALID [2018-11-23 13:05:14,264 INFO L273 TraceCheckUtils]: 34: Hoare triple {2265#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2266#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:14,265 INFO L273 TraceCheckUtils]: 35: Hoare triple {2266#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2266#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:14,265 INFO L256 TraceCheckUtils]: 36: Hoare triple {2266#(and (<= main_~x~0 10) (<= 10 main_~x~0))} call #t~ret0 := f(~x~0); {2253#true} is VALID [2018-11-23 13:05:14,266 INFO L273 TraceCheckUtils]: 37: Hoare triple {2253#true} ~z := #in~z;#res := 2 + ~z; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:14,266 INFO L273 TraceCheckUtils]: 38: Hoare triple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:14,268 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2266#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #39#return; {2267#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} is VALID [2018-11-23 13:05:14,269 INFO L273 TraceCheckUtils]: 40: Hoare triple {2267#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2268#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:05:14,270 INFO L273 TraceCheckUtils]: 41: Hoare triple {2268#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2268#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:05:14,270 INFO L256 TraceCheckUtils]: 42: Hoare triple {2268#(and (<= main_~x~0 12) (<= 12 main_~x~0))} call #t~ret0 := f(~x~0); {2253#true} is VALID [2018-11-23 13:05:14,271 INFO L273 TraceCheckUtils]: 43: Hoare triple {2253#true} ~z := #in~z;#res := 2 + ~z; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:14,272 INFO L273 TraceCheckUtils]: 44: Hoare triple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:14,273 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2268#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #39#return; {2269#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} is VALID [2018-11-23 13:05:14,274 INFO L273 TraceCheckUtils]: 46: Hoare triple {2269#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2270#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:05:14,275 INFO L273 TraceCheckUtils]: 47: Hoare triple {2270#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2270#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:05:14,275 INFO L256 TraceCheckUtils]: 48: Hoare triple {2270#(and (<= main_~x~0 14) (<= 14 main_~x~0))} call #t~ret0 := f(~x~0); {2253#true} is VALID [2018-11-23 13:05:14,276 INFO L273 TraceCheckUtils]: 49: Hoare triple {2253#true} ~z := #in~z;#res := 2 + ~z; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:14,277 INFO L273 TraceCheckUtils]: 50: Hoare triple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:14,278 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2270#(and (<= main_~x~0 14) (<= 14 main_~x~0))} #39#return; {2271#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} is VALID [2018-11-23 13:05:14,279 INFO L273 TraceCheckUtils]: 52: Hoare triple {2271#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} ~x~0 := #t~ret0;havoc #t~ret0; {2272#(and (<= main_~x~0 16) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:05:14,280 INFO L273 TraceCheckUtils]: 53: Hoare triple {2272#(and (<= main_~x~0 16) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {2254#false} is VALID [2018-11-23 13:05:14,280 INFO L256 TraceCheckUtils]: 54: Hoare triple {2254#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {2254#false} is VALID [2018-11-23 13:05:14,281 INFO L273 TraceCheckUtils]: 55: Hoare triple {2254#false} ~cond := #in~cond; {2254#false} is VALID [2018-11-23 13:05:14,281 INFO L273 TraceCheckUtils]: 56: Hoare triple {2254#false} assume 0 == ~cond; {2254#false} is VALID [2018-11-23 13:05:14,281 INFO L273 TraceCheckUtils]: 57: Hoare triple {2254#false} assume !false; {2254#false} is VALID [2018-11-23 13:05:14,287 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-23 13:05:14,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:14,287 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-23 13:05:14,298 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:05:14,316 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:05:14,317 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:14,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:14,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:14,750 INFO L256 TraceCheckUtils]: 0: Hoare triple {2253#true} call ULTIMATE.init(); {2253#true} is VALID [2018-11-23 13:05:14,750 INFO L273 TraceCheckUtils]: 1: Hoare triple {2253#true} assume true; {2253#true} is VALID [2018-11-23 13:05:14,750 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2253#true} {2253#true} #35#return; {2253#true} is VALID [2018-11-23 13:05:14,750 INFO L256 TraceCheckUtils]: 3: Hoare triple {2253#true} call #t~ret1 := main(); {2253#true} is VALID [2018-11-23 13:05:14,751 INFO L273 TraceCheckUtils]: 4: Hoare triple {2253#true} ~x~0 := 0; {2255#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:14,751 INFO L273 TraceCheckUtils]: 5: Hoare triple {2255#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2255#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:14,751 INFO L256 TraceCheckUtils]: 6: Hoare triple {2255#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {2253#true} is VALID [2018-11-23 13:05:14,752 INFO L273 TraceCheckUtils]: 7: Hoare triple {2253#true} ~z := #in~z;#res := 2 + ~z; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:14,752 INFO L273 TraceCheckUtils]: 8: Hoare triple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:14,753 INFO L268 TraceCheckUtils]: 9: Hoare quadruple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2255#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #39#return; {2257#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-23 13:05:14,754 INFO L273 TraceCheckUtils]: 10: Hoare triple {2257#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {2258#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:14,754 INFO L273 TraceCheckUtils]: 11: Hoare triple {2258#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {2258#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:14,754 INFO L256 TraceCheckUtils]: 12: Hoare triple {2258#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {2253#true} is VALID [2018-11-23 13:05:14,755 INFO L273 TraceCheckUtils]: 13: Hoare triple {2253#true} ~z := #in~z;#res := 2 + ~z; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:14,755 INFO L273 TraceCheckUtils]: 14: Hoare triple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:14,757 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2258#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #39#return; {2259#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-23 13:05:14,758 INFO L273 TraceCheckUtils]: 16: Hoare triple {2259#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2260#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:14,758 INFO L273 TraceCheckUtils]: 17: Hoare triple {2260#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {2260#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:14,759 INFO L256 TraceCheckUtils]: 18: Hoare triple {2260#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {2253#true} is VALID [2018-11-23 13:05:14,759 INFO L273 TraceCheckUtils]: 19: Hoare triple {2253#true} ~z := #in~z;#res := 2 + ~z; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:14,760 INFO L273 TraceCheckUtils]: 20: Hoare triple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:14,762 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2260#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #39#return; {2261#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-23 13:05:14,763 INFO L273 TraceCheckUtils]: 22: Hoare triple {2261#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2262#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:14,763 INFO L273 TraceCheckUtils]: 23: Hoare triple {2262#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2262#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:14,764 INFO L256 TraceCheckUtils]: 24: Hoare triple {2262#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call #t~ret0 := f(~x~0); {2253#true} is VALID [2018-11-23 13:05:14,764 INFO L273 TraceCheckUtils]: 25: Hoare triple {2253#true} ~z := #in~z;#res := 2 + ~z; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:14,765 INFO L273 TraceCheckUtils]: 26: Hoare triple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:14,767 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2262#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #39#return; {2263#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} is VALID [2018-11-23 13:05:14,768 INFO L273 TraceCheckUtils]: 28: Hoare triple {2263#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2264#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:14,768 INFO L273 TraceCheckUtils]: 29: Hoare triple {2264#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {2264#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:14,769 INFO L256 TraceCheckUtils]: 30: Hoare triple {2264#(and (<= 8 main_~x~0) (<= main_~x~0 8))} call #t~ret0 := f(~x~0); {2253#true} is VALID [2018-11-23 13:05:14,769 INFO L273 TraceCheckUtils]: 31: Hoare triple {2253#true} ~z := #in~z;#res := 2 + ~z; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:14,770 INFO L273 TraceCheckUtils]: 32: Hoare triple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:14,772 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2264#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #39#return; {2265#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} is VALID [2018-11-23 13:05:14,772 INFO L273 TraceCheckUtils]: 34: Hoare triple {2265#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2266#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:14,773 INFO L273 TraceCheckUtils]: 35: Hoare triple {2266#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2266#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:14,773 INFO L256 TraceCheckUtils]: 36: Hoare triple {2266#(and (<= main_~x~0 10) (<= 10 main_~x~0))} call #t~ret0 := f(~x~0); {2253#true} is VALID [2018-11-23 13:05:14,774 INFO L273 TraceCheckUtils]: 37: Hoare triple {2253#true} ~z := #in~z;#res := 2 + ~z; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:14,775 INFO L273 TraceCheckUtils]: 38: Hoare triple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:14,776 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2266#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #39#return; {2267#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} is VALID [2018-11-23 13:05:14,777 INFO L273 TraceCheckUtils]: 40: Hoare triple {2267#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2268#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:05:14,778 INFO L273 TraceCheckUtils]: 41: Hoare triple {2268#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2268#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:05:14,778 INFO L256 TraceCheckUtils]: 42: Hoare triple {2268#(and (<= main_~x~0 12) (<= 12 main_~x~0))} call #t~ret0 := f(~x~0); {2253#true} is VALID [2018-11-23 13:05:14,779 INFO L273 TraceCheckUtils]: 43: Hoare triple {2253#true} ~z := #in~z;#res := 2 + ~z; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:14,780 INFO L273 TraceCheckUtils]: 44: Hoare triple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:14,781 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2268#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #39#return; {2269#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} is VALID [2018-11-23 13:05:14,782 INFO L273 TraceCheckUtils]: 46: Hoare triple {2269#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2270#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:05:14,783 INFO L273 TraceCheckUtils]: 47: Hoare triple {2270#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2270#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:05:14,783 INFO L256 TraceCheckUtils]: 48: Hoare triple {2270#(and (<= main_~x~0 14) (<= 14 main_~x~0))} call #t~ret0 := f(~x~0); {2253#true} is VALID [2018-11-23 13:05:14,784 INFO L273 TraceCheckUtils]: 49: Hoare triple {2253#true} ~z := #in~z;#res := 2 + ~z; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:14,785 INFO L273 TraceCheckUtils]: 50: Hoare triple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:14,786 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {2256#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2270#(and (<= main_~x~0 14) (<= 14 main_~x~0))} #39#return; {2271#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} is VALID [2018-11-23 13:05:14,787 INFO L273 TraceCheckUtils]: 52: Hoare triple {2271#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} ~x~0 := #t~ret0;havoc #t~ret0; {2432#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:05:14,788 INFO L273 TraceCheckUtils]: 53: Hoare triple {2432#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {2254#false} is VALID [2018-11-23 13:05:14,788 INFO L256 TraceCheckUtils]: 54: Hoare triple {2254#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {2254#false} is VALID [2018-11-23 13:05:14,788 INFO L273 TraceCheckUtils]: 55: Hoare triple {2254#false} ~cond := #in~cond; {2254#false} is VALID [2018-11-23 13:05:14,789 INFO L273 TraceCheckUtils]: 56: Hoare triple {2254#false} assume 0 == ~cond; {2254#false} is VALID [2018-11-23 13:05:14,789 INFO L273 TraceCheckUtils]: 57: Hoare triple {2254#false} assume !false; {2254#false} is VALID [2018-11-23 13:05:14,794 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-23 13:05:14,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:14,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-23 13:05:14,816 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 58 [2018-11-23 13:05:14,817 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:14,817 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 13:05:14,859 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-23 13:05:14,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 13:05:14,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 13:05:14,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-11-23 13:05:14,861 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 21 states. [2018-11-23 13:05:16,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:16,885 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2018-11-23 13:05:16,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 13:05:16,885 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 58 [2018-11-23 13:05:16,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:16,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 13:05:16,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 57 transitions. [2018-11-23 13:05:16,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 13:05:16,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 57 transitions. [2018-11-23 13:05:16,891 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 57 transitions. [2018-11-23 13:05:16,954 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-23 13:05:16,956 INFO L225 Difference]: With dead ends: 48 [2018-11-23 13:05:16,957 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 13:05:16,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 56 SyntacticMatches, 10 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=88, Invalid=724, Unknown=0, NotChecked=0, Total=812 [2018-11-23 13:05:16,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 13:05:17,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2018-11-23 13:05:17,018 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:17,018 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 41 states. [2018-11-23 13:05:17,018 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 41 states. [2018-11-23 13:05:17,018 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 41 states. [2018-11-23 13:05:17,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:17,020 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2018-11-23 13:05:17,020 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2018-11-23 13:05:17,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:17,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:17,021 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 43 states. [2018-11-23 13:05:17,021 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 43 states. [2018-11-23 13:05:17,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:17,023 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2018-11-23 13:05:17,024 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2018-11-23 13:05:17,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:17,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:17,024 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:17,024 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:17,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 13:05:17,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2018-11-23 13:05:17,026 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 58 [2018-11-23 13:05:17,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:17,027 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2018-11-23 13:05:17,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 13:05:17,027 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2018-11-23 13:05:17,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-23 13:05:17,028 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:17,028 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:17,028 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:17,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:17,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1565725754, now seen corresponding path program 9 times [2018-11-23 13:05:17,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:17,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:17,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:17,030 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:17,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:17,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:17,583 INFO L256 TraceCheckUtils]: 0: Hoare triple {2693#true} call ULTIMATE.init(); {2693#true} is VALID [2018-11-23 13:05:17,583 INFO L273 TraceCheckUtils]: 1: Hoare triple {2693#true} assume true; {2693#true} is VALID [2018-11-23 13:05:17,584 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2693#true} {2693#true} #35#return; {2693#true} is VALID [2018-11-23 13:05:17,584 INFO L256 TraceCheckUtils]: 3: Hoare triple {2693#true} call #t~ret1 := main(); {2693#true} is VALID [2018-11-23 13:05:17,584 INFO L273 TraceCheckUtils]: 4: Hoare triple {2693#true} ~x~0 := 0; {2695#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:17,585 INFO L273 TraceCheckUtils]: 5: Hoare triple {2695#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2695#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:17,585 INFO L256 TraceCheckUtils]: 6: Hoare triple {2695#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {2693#true} is VALID [2018-11-23 13:05:17,586 INFO L273 TraceCheckUtils]: 7: Hoare triple {2693#true} ~z := #in~z;#res := 2 + ~z; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:17,587 INFO L273 TraceCheckUtils]: 8: Hoare triple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:17,589 INFO L268 TraceCheckUtils]: 9: Hoare quadruple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2695#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #39#return; {2697#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-23 13:05:17,590 INFO L273 TraceCheckUtils]: 10: Hoare triple {2697#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {2698#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:17,591 INFO L273 TraceCheckUtils]: 11: Hoare triple {2698#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {2698#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:17,591 INFO L256 TraceCheckUtils]: 12: Hoare triple {2698#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {2693#true} is VALID [2018-11-23 13:05:17,591 INFO L273 TraceCheckUtils]: 13: Hoare triple {2693#true} ~z := #in~z;#res := 2 + ~z; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:17,592 INFO L273 TraceCheckUtils]: 14: Hoare triple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:17,594 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2698#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #39#return; {2699#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-23 13:05:17,594 INFO L273 TraceCheckUtils]: 16: Hoare triple {2699#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2700#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:17,595 INFO L273 TraceCheckUtils]: 17: Hoare triple {2700#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {2700#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:17,595 INFO L256 TraceCheckUtils]: 18: Hoare triple {2700#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {2693#true} is VALID [2018-11-23 13:05:17,596 INFO L273 TraceCheckUtils]: 19: Hoare triple {2693#true} ~z := #in~z;#res := 2 + ~z; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:17,597 INFO L273 TraceCheckUtils]: 20: Hoare triple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:17,599 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2700#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #39#return; {2701#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-23 13:05:17,600 INFO L273 TraceCheckUtils]: 22: Hoare triple {2701#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2702#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:17,600 INFO L273 TraceCheckUtils]: 23: Hoare triple {2702#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2702#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:17,600 INFO L256 TraceCheckUtils]: 24: Hoare triple {2702#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call #t~ret0 := f(~x~0); {2693#true} is VALID [2018-11-23 13:05:17,601 INFO L273 TraceCheckUtils]: 25: Hoare triple {2693#true} ~z := #in~z;#res := 2 + ~z; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:17,601 INFO L273 TraceCheckUtils]: 26: Hoare triple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:17,603 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2702#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #39#return; {2703#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} is VALID [2018-11-23 13:05:17,604 INFO L273 TraceCheckUtils]: 28: Hoare triple {2703#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2704#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:17,604 INFO L273 TraceCheckUtils]: 29: Hoare triple {2704#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {2704#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:17,604 INFO L256 TraceCheckUtils]: 30: Hoare triple {2704#(and (<= 8 main_~x~0) (<= main_~x~0 8))} call #t~ret0 := f(~x~0); {2693#true} is VALID [2018-11-23 13:05:17,605 INFO L273 TraceCheckUtils]: 31: Hoare triple {2693#true} ~z := #in~z;#res := 2 + ~z; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:17,606 INFO L273 TraceCheckUtils]: 32: Hoare triple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:17,608 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2704#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #39#return; {2705#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} is VALID [2018-11-23 13:05:17,609 INFO L273 TraceCheckUtils]: 34: Hoare triple {2705#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2706#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:17,609 INFO L273 TraceCheckUtils]: 35: Hoare triple {2706#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2706#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:17,609 INFO L256 TraceCheckUtils]: 36: Hoare triple {2706#(and (<= main_~x~0 10) (<= 10 main_~x~0))} call #t~ret0 := f(~x~0); {2693#true} is VALID [2018-11-23 13:05:17,629 INFO L273 TraceCheckUtils]: 37: Hoare triple {2693#true} ~z := #in~z;#res := 2 + ~z; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:17,633 INFO L273 TraceCheckUtils]: 38: Hoare triple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:17,635 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2706#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #39#return; {2707#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} is VALID [2018-11-23 13:05:17,636 INFO L273 TraceCheckUtils]: 40: Hoare triple {2707#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2708#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:05:17,636 INFO L273 TraceCheckUtils]: 41: Hoare triple {2708#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2708#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:05:17,636 INFO L256 TraceCheckUtils]: 42: Hoare triple {2708#(and (<= main_~x~0 12) (<= 12 main_~x~0))} call #t~ret0 := f(~x~0); {2693#true} is VALID [2018-11-23 13:05:17,637 INFO L273 TraceCheckUtils]: 43: Hoare triple {2693#true} ~z := #in~z;#res := 2 + ~z; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:17,638 INFO L273 TraceCheckUtils]: 44: Hoare triple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:17,640 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2708#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #39#return; {2709#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} is VALID [2018-11-23 13:05:17,641 INFO L273 TraceCheckUtils]: 46: Hoare triple {2709#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2710#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:05:17,641 INFO L273 TraceCheckUtils]: 47: Hoare triple {2710#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2710#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:05:17,642 INFO L256 TraceCheckUtils]: 48: Hoare triple {2710#(and (<= main_~x~0 14) (<= 14 main_~x~0))} call #t~ret0 := f(~x~0); {2693#true} is VALID [2018-11-23 13:05:17,642 INFO L273 TraceCheckUtils]: 49: Hoare triple {2693#true} ~z := #in~z;#res := 2 + ~z; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:17,643 INFO L273 TraceCheckUtils]: 50: Hoare triple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:17,645 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2710#(and (<= main_~x~0 14) (<= 14 main_~x~0))} #39#return; {2711#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} is VALID [2018-11-23 13:05:17,646 INFO L273 TraceCheckUtils]: 52: Hoare triple {2711#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} ~x~0 := #t~ret0;havoc #t~ret0; {2712#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:05:17,646 INFO L273 TraceCheckUtils]: 53: Hoare triple {2712#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2712#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:05:17,647 INFO L256 TraceCheckUtils]: 54: Hoare triple {2712#(and (<= main_~x~0 16) (<= 16 main_~x~0))} call #t~ret0 := f(~x~0); {2693#true} is VALID [2018-11-23 13:05:17,648 INFO L273 TraceCheckUtils]: 55: Hoare triple {2693#true} ~z := #in~z;#res := 2 + ~z; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:17,648 INFO L273 TraceCheckUtils]: 56: Hoare triple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:17,650 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2712#(and (<= main_~x~0 16) (<= 16 main_~x~0))} #39#return; {2713#(and (<= 18 |main_#t~ret0|) (<= |main_#t~ret0| 18))} is VALID [2018-11-23 13:05:17,651 INFO L273 TraceCheckUtils]: 58: Hoare triple {2713#(and (<= 18 |main_#t~ret0|) (<= |main_#t~ret0| 18))} ~x~0 := #t~ret0;havoc #t~ret0; {2714#(and (<= main_~x~0 18) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:05:17,652 INFO L273 TraceCheckUtils]: 59: Hoare triple {2714#(and (<= main_~x~0 18) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {2694#false} is VALID [2018-11-23 13:05:17,652 INFO L256 TraceCheckUtils]: 60: Hoare triple {2694#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {2694#false} is VALID [2018-11-23 13:05:17,652 INFO L273 TraceCheckUtils]: 61: Hoare triple {2694#false} ~cond := #in~cond; {2694#false} is VALID [2018-11-23 13:05:17,653 INFO L273 TraceCheckUtils]: 62: Hoare triple {2694#false} assume 0 == ~cond; {2694#false} is VALID [2018-11-23 13:05:17,653 INFO L273 TraceCheckUtils]: 63: Hoare triple {2694#false} assume !false; {2694#false} is VALID [2018-11-23 13:05:17,659 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-11-23 13:05:17,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:17,660 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-23 13:05:17,669 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:05:23,815 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-23 13:05:23,816 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:24,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:24,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:24,569 INFO L256 TraceCheckUtils]: 0: Hoare triple {2693#true} call ULTIMATE.init(); {2693#true} is VALID [2018-11-23 13:05:24,570 INFO L273 TraceCheckUtils]: 1: Hoare triple {2693#true} assume true; {2693#true} is VALID [2018-11-23 13:05:24,570 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2693#true} {2693#true} #35#return; {2693#true} is VALID [2018-11-23 13:05:24,570 INFO L256 TraceCheckUtils]: 3: Hoare triple {2693#true} call #t~ret1 := main(); {2693#true} is VALID [2018-11-23 13:05:24,571 INFO L273 TraceCheckUtils]: 4: Hoare triple {2693#true} ~x~0 := 0; {2695#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:24,572 INFO L273 TraceCheckUtils]: 5: Hoare triple {2695#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2695#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:24,572 INFO L256 TraceCheckUtils]: 6: Hoare triple {2695#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {2693#true} is VALID [2018-11-23 13:05:24,572 INFO L273 TraceCheckUtils]: 7: Hoare triple {2693#true} ~z := #in~z;#res := 2 + ~z; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:24,573 INFO L273 TraceCheckUtils]: 8: Hoare triple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:24,575 INFO L268 TraceCheckUtils]: 9: Hoare quadruple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2695#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #39#return; {2697#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-23 13:05:24,576 INFO L273 TraceCheckUtils]: 10: Hoare triple {2697#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {2698#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:24,577 INFO L273 TraceCheckUtils]: 11: Hoare triple {2698#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {2698#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:24,577 INFO L256 TraceCheckUtils]: 12: Hoare triple {2698#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {2693#true} is VALID [2018-11-23 13:05:24,578 INFO L273 TraceCheckUtils]: 13: Hoare triple {2693#true} ~z := #in~z;#res := 2 + ~z; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:24,579 INFO L273 TraceCheckUtils]: 14: Hoare triple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:24,581 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2698#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #39#return; {2699#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-23 13:05:24,582 INFO L273 TraceCheckUtils]: 16: Hoare triple {2699#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2700#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:24,583 INFO L273 TraceCheckUtils]: 17: Hoare triple {2700#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {2700#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:24,583 INFO L256 TraceCheckUtils]: 18: Hoare triple {2700#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {2693#true} is VALID [2018-11-23 13:05:24,584 INFO L273 TraceCheckUtils]: 19: Hoare triple {2693#true} ~z := #in~z;#res := 2 + ~z; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:24,584 INFO L273 TraceCheckUtils]: 20: Hoare triple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:24,587 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2700#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #39#return; {2701#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-23 13:05:24,588 INFO L273 TraceCheckUtils]: 22: Hoare triple {2701#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2702#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:24,588 INFO L273 TraceCheckUtils]: 23: Hoare triple {2702#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2702#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:24,589 INFO L256 TraceCheckUtils]: 24: Hoare triple {2702#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call #t~ret0 := f(~x~0); {2693#true} is VALID [2018-11-23 13:05:24,590 INFO L273 TraceCheckUtils]: 25: Hoare triple {2693#true} ~z := #in~z;#res := 2 + ~z; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:24,590 INFO L273 TraceCheckUtils]: 26: Hoare triple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:24,593 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2702#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #39#return; {2703#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} is VALID [2018-11-23 13:05:24,594 INFO L273 TraceCheckUtils]: 28: Hoare triple {2703#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2704#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:24,595 INFO L273 TraceCheckUtils]: 29: Hoare triple {2704#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {2704#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:24,595 INFO L256 TraceCheckUtils]: 30: Hoare triple {2704#(and (<= 8 main_~x~0) (<= main_~x~0 8))} call #t~ret0 := f(~x~0); {2693#true} is VALID [2018-11-23 13:05:24,595 INFO L273 TraceCheckUtils]: 31: Hoare triple {2693#true} ~z := #in~z;#res := 2 + ~z; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:24,596 INFO L273 TraceCheckUtils]: 32: Hoare triple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:24,598 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2704#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #39#return; {2705#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} is VALID [2018-11-23 13:05:24,599 INFO L273 TraceCheckUtils]: 34: Hoare triple {2705#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2706#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:24,599 INFO L273 TraceCheckUtils]: 35: Hoare triple {2706#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2706#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:24,600 INFO L256 TraceCheckUtils]: 36: Hoare triple {2706#(and (<= main_~x~0 10) (<= 10 main_~x~0))} call #t~ret0 := f(~x~0); {2693#true} is VALID [2018-11-23 13:05:24,600 INFO L273 TraceCheckUtils]: 37: Hoare triple {2693#true} ~z := #in~z;#res := 2 + ~z; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:24,601 INFO L273 TraceCheckUtils]: 38: Hoare triple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:24,603 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2706#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #39#return; {2707#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} is VALID [2018-11-23 13:05:24,604 INFO L273 TraceCheckUtils]: 40: Hoare triple {2707#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2708#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:05:24,605 INFO L273 TraceCheckUtils]: 41: Hoare triple {2708#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2708#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:05:24,605 INFO L256 TraceCheckUtils]: 42: Hoare triple {2708#(and (<= main_~x~0 12) (<= 12 main_~x~0))} call #t~ret0 := f(~x~0); {2693#true} is VALID [2018-11-23 13:05:24,606 INFO L273 TraceCheckUtils]: 43: Hoare triple {2693#true} ~z := #in~z;#res := 2 + ~z; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:24,607 INFO L273 TraceCheckUtils]: 44: Hoare triple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:24,609 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2708#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #39#return; {2709#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} is VALID [2018-11-23 13:05:24,610 INFO L273 TraceCheckUtils]: 46: Hoare triple {2709#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {2710#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:05:24,611 INFO L273 TraceCheckUtils]: 47: Hoare triple {2710#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2710#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:05:24,611 INFO L256 TraceCheckUtils]: 48: Hoare triple {2710#(and (<= main_~x~0 14) (<= 14 main_~x~0))} call #t~ret0 := f(~x~0); {2693#true} is VALID [2018-11-23 13:05:24,612 INFO L273 TraceCheckUtils]: 49: Hoare triple {2693#true} ~z := #in~z;#res := 2 + ~z; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:24,613 INFO L273 TraceCheckUtils]: 50: Hoare triple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:24,616 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2710#(and (<= main_~x~0 14) (<= 14 main_~x~0))} #39#return; {2711#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} is VALID [2018-11-23 13:05:24,617 INFO L273 TraceCheckUtils]: 52: Hoare triple {2711#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} ~x~0 := #t~ret0;havoc #t~ret0; {2712#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:05:24,617 INFO L273 TraceCheckUtils]: 53: Hoare triple {2712#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {2712#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:05:24,618 INFO L256 TraceCheckUtils]: 54: Hoare triple {2712#(and (<= main_~x~0 16) (<= 16 main_~x~0))} call #t~ret0 := f(~x~0); {2693#true} is VALID [2018-11-23 13:05:24,618 INFO L273 TraceCheckUtils]: 55: Hoare triple {2693#true} ~z := #in~z;#res := 2 + ~z; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:24,619 INFO L273 TraceCheckUtils]: 56: Hoare triple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:24,620 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {2696#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {2712#(and (<= main_~x~0 16) (<= 16 main_~x~0))} #39#return; {2713#(and (<= 18 |main_#t~ret0|) (<= |main_#t~ret0| 18))} is VALID [2018-11-23 13:05:24,621 INFO L273 TraceCheckUtils]: 58: Hoare triple {2713#(and (<= 18 |main_#t~ret0|) (<= |main_#t~ret0| 18))} ~x~0 := #t~ret0;havoc #t~ret0; {2892#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:05:24,622 INFO L273 TraceCheckUtils]: 59: Hoare triple {2892#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {2694#false} is VALID [2018-11-23 13:05:24,622 INFO L256 TraceCheckUtils]: 60: Hoare triple {2694#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {2694#false} is VALID [2018-11-23 13:05:24,623 INFO L273 TraceCheckUtils]: 61: Hoare triple {2694#false} ~cond := #in~cond; {2694#false} is VALID [2018-11-23 13:05:24,623 INFO L273 TraceCheckUtils]: 62: Hoare triple {2694#false} assume 0 == ~cond; {2694#false} is VALID [2018-11-23 13:05:24,623 INFO L273 TraceCheckUtils]: 63: Hoare triple {2694#false} assume !false; {2694#false} is VALID [2018-11-23 13:05:24,632 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-11-23 13:05:24,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:24,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-23 13:05:24,652 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 64 [2018-11-23 13:05:24,653 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:24,653 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 13:05:24,704 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:24,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 13:05:24,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 13:05:24,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=453, Unknown=0, NotChecked=0, Total=506 [2018-11-23 13:05:24,706 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 23 states. [2018-11-23 13:05:27,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:27,052 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2018-11-23 13:05:27,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 13:05:27,052 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 64 [2018-11-23 13:05:27,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:27,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:05:27,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 61 transitions. [2018-11-23 13:05:27,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:05:27,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 61 transitions. [2018-11-23 13:05:27,058 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 61 transitions. [2018-11-23 13:05:27,127 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-23 13:05:27,129 INFO L225 Difference]: With dead ends: 51 [2018-11-23 13:05:27,129 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 13:05:27,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 62 SyntacticMatches, 11 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=98, Invalid=894, Unknown=0, NotChecked=0, Total=992 [2018-11-23 13:05:27,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 13:05:27,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2018-11-23 13:05:27,204 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:27,204 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 44 states. [2018-11-23 13:05:27,204 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 44 states. [2018-11-23 13:05:27,204 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 44 states. [2018-11-23 13:05:27,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:27,207 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2018-11-23 13:05:27,207 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2018-11-23 13:05:27,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:27,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:27,207 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 46 states. [2018-11-23 13:05:27,208 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 46 states. [2018-11-23 13:05:27,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:27,210 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2018-11-23 13:05:27,210 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2018-11-23 13:05:27,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:27,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:27,211 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:27,211 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:27,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 13:05:27,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2018-11-23 13:05:27,212 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 64 [2018-11-23 13:05:27,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:27,213 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2018-11-23 13:05:27,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 13:05:27,213 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2018-11-23 13:05:27,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 13:05:27,214 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:27,214 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:27,214 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:27,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:27,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1577839588, now seen corresponding path program 10 times [2018-11-23 13:05:27,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:27,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:27,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:27,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:27,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:27,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:27,828 INFO L256 TraceCheckUtils]: 0: Hoare triple {3171#true} call ULTIMATE.init(); {3171#true} is VALID [2018-11-23 13:05:27,828 INFO L273 TraceCheckUtils]: 1: Hoare triple {3171#true} assume true; {3171#true} is VALID [2018-11-23 13:05:27,829 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3171#true} {3171#true} #35#return; {3171#true} is VALID [2018-11-23 13:05:27,829 INFO L256 TraceCheckUtils]: 3: Hoare triple {3171#true} call #t~ret1 := main(); {3171#true} is VALID [2018-11-23 13:05:27,830 INFO L273 TraceCheckUtils]: 4: Hoare triple {3171#true} ~x~0 := 0; {3173#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:27,830 INFO L273 TraceCheckUtils]: 5: Hoare triple {3173#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3173#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:27,830 INFO L256 TraceCheckUtils]: 6: Hoare triple {3173#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {3171#true} is VALID [2018-11-23 13:05:27,831 INFO L273 TraceCheckUtils]: 7: Hoare triple {3171#true} ~z := #in~z;#res := 2 + ~z; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:27,832 INFO L273 TraceCheckUtils]: 8: Hoare triple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:27,834 INFO L268 TraceCheckUtils]: 9: Hoare quadruple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3173#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #39#return; {3175#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-23 13:05:27,835 INFO L273 TraceCheckUtils]: 10: Hoare triple {3175#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {3176#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:27,836 INFO L273 TraceCheckUtils]: 11: Hoare triple {3176#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {3176#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:27,836 INFO L256 TraceCheckUtils]: 12: Hoare triple {3176#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {3171#true} is VALID [2018-11-23 13:05:27,837 INFO L273 TraceCheckUtils]: 13: Hoare triple {3171#true} ~z := #in~z;#res := 2 + ~z; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:27,838 INFO L273 TraceCheckUtils]: 14: Hoare triple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:27,839 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3176#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #39#return; {3177#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-23 13:05:27,840 INFO L273 TraceCheckUtils]: 16: Hoare triple {3177#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3178#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:27,841 INFO L273 TraceCheckUtils]: 17: Hoare triple {3178#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {3178#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:27,841 INFO L256 TraceCheckUtils]: 18: Hoare triple {3178#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {3171#true} is VALID [2018-11-23 13:05:27,842 INFO L273 TraceCheckUtils]: 19: Hoare triple {3171#true} ~z := #in~z;#res := 2 + ~z; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:27,863 INFO L273 TraceCheckUtils]: 20: Hoare triple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:27,877 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3178#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #39#return; {3179#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-23 13:05:27,879 INFO L273 TraceCheckUtils]: 22: Hoare triple {3179#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3180#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:27,879 INFO L273 TraceCheckUtils]: 23: Hoare triple {3180#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3180#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:27,879 INFO L256 TraceCheckUtils]: 24: Hoare triple {3180#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call #t~ret0 := f(~x~0); {3171#true} is VALID [2018-11-23 13:05:27,880 INFO L273 TraceCheckUtils]: 25: Hoare triple {3171#true} ~z := #in~z;#res := 2 + ~z; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:27,880 INFO L273 TraceCheckUtils]: 26: Hoare triple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:27,882 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3180#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #39#return; {3181#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} is VALID [2018-11-23 13:05:27,882 INFO L273 TraceCheckUtils]: 28: Hoare triple {3181#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3182#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:27,883 INFO L273 TraceCheckUtils]: 29: Hoare triple {3182#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {3182#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:27,883 INFO L256 TraceCheckUtils]: 30: Hoare triple {3182#(and (<= 8 main_~x~0) (<= main_~x~0 8))} call #t~ret0 := f(~x~0); {3171#true} is VALID [2018-11-23 13:05:27,883 INFO L273 TraceCheckUtils]: 31: Hoare triple {3171#true} ~z := #in~z;#res := 2 + ~z; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:27,884 INFO L273 TraceCheckUtils]: 32: Hoare triple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:27,885 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3182#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #39#return; {3183#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} is VALID [2018-11-23 13:05:27,886 INFO L273 TraceCheckUtils]: 34: Hoare triple {3183#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3184#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:27,887 INFO L273 TraceCheckUtils]: 35: Hoare triple {3184#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3184#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:27,887 INFO L256 TraceCheckUtils]: 36: Hoare triple {3184#(and (<= main_~x~0 10) (<= 10 main_~x~0))} call #t~ret0 := f(~x~0); {3171#true} is VALID [2018-11-23 13:05:27,888 INFO L273 TraceCheckUtils]: 37: Hoare triple {3171#true} ~z := #in~z;#res := 2 + ~z; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:27,888 INFO L273 TraceCheckUtils]: 38: Hoare triple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:27,890 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3184#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #39#return; {3185#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} is VALID [2018-11-23 13:05:27,909 INFO L273 TraceCheckUtils]: 40: Hoare triple {3185#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3186#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:05:27,918 INFO L273 TraceCheckUtils]: 41: Hoare triple {3186#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3186#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:05:27,918 INFO L256 TraceCheckUtils]: 42: Hoare triple {3186#(and (<= main_~x~0 12) (<= 12 main_~x~0))} call #t~ret0 := f(~x~0); {3171#true} is VALID [2018-11-23 13:05:27,931 INFO L273 TraceCheckUtils]: 43: Hoare triple {3171#true} ~z := #in~z;#res := 2 + ~z; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:27,940 INFO L273 TraceCheckUtils]: 44: Hoare triple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:27,954 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3186#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #39#return; {3187#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} is VALID [2018-11-23 13:05:27,963 INFO L273 TraceCheckUtils]: 46: Hoare triple {3187#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3188#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:05:27,964 INFO L273 TraceCheckUtils]: 47: Hoare triple {3188#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3188#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:05:27,964 INFO L256 TraceCheckUtils]: 48: Hoare triple {3188#(and (<= main_~x~0 14) (<= 14 main_~x~0))} call #t~ret0 := f(~x~0); {3171#true} is VALID [2018-11-23 13:05:27,965 INFO L273 TraceCheckUtils]: 49: Hoare triple {3171#true} ~z := #in~z;#res := 2 + ~z; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:27,966 INFO L273 TraceCheckUtils]: 50: Hoare triple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:27,967 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3188#(and (<= main_~x~0 14) (<= 14 main_~x~0))} #39#return; {3189#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} is VALID [2018-11-23 13:05:27,968 INFO L273 TraceCheckUtils]: 52: Hoare triple {3189#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} ~x~0 := #t~ret0;havoc #t~ret0; {3190#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:05:27,968 INFO L273 TraceCheckUtils]: 53: Hoare triple {3190#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3190#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:05:27,969 INFO L256 TraceCheckUtils]: 54: Hoare triple {3190#(and (<= main_~x~0 16) (<= 16 main_~x~0))} call #t~ret0 := f(~x~0); {3171#true} is VALID [2018-11-23 13:05:27,970 INFO L273 TraceCheckUtils]: 55: Hoare triple {3171#true} ~z := #in~z;#res := 2 + ~z; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:27,970 INFO L273 TraceCheckUtils]: 56: Hoare triple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:27,976 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3190#(and (<= main_~x~0 16) (<= 16 main_~x~0))} #39#return; {3191#(and (<= 18 |main_#t~ret0|) (<= |main_#t~ret0| 18))} is VALID [2018-11-23 13:05:27,976 INFO L273 TraceCheckUtils]: 58: Hoare triple {3191#(and (<= 18 |main_#t~ret0|) (<= |main_#t~ret0| 18))} ~x~0 := #t~ret0;havoc #t~ret0; {3192#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:05:27,977 INFO L273 TraceCheckUtils]: 59: Hoare triple {3192#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3192#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:05:27,977 INFO L256 TraceCheckUtils]: 60: Hoare triple {3192#(and (<= main_~x~0 18) (<= 18 main_~x~0))} call #t~ret0 := f(~x~0); {3171#true} is VALID [2018-11-23 13:05:27,988 INFO L273 TraceCheckUtils]: 61: Hoare triple {3171#true} ~z := #in~z;#res := 2 + ~z; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:27,989 INFO L273 TraceCheckUtils]: 62: Hoare triple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:27,990 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3192#(and (<= main_~x~0 18) (<= 18 main_~x~0))} #39#return; {3193#(and (<= 20 |main_#t~ret0|) (<= |main_#t~ret0| 20))} is VALID [2018-11-23 13:05:27,991 INFO L273 TraceCheckUtils]: 64: Hoare triple {3193#(and (<= 20 |main_#t~ret0|) (<= |main_#t~ret0| 20))} ~x~0 := #t~ret0;havoc #t~ret0; {3194#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 20))} is VALID [2018-11-23 13:05:27,994 INFO L273 TraceCheckUtils]: 65: Hoare triple {3194#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 20))} assume !(~x~0 % 4294967296 < 268435455); {3172#false} is VALID [2018-11-23 13:05:27,994 INFO L256 TraceCheckUtils]: 66: Hoare triple {3172#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {3172#false} is VALID [2018-11-23 13:05:27,994 INFO L273 TraceCheckUtils]: 67: Hoare triple {3172#false} ~cond := #in~cond; {3172#false} is VALID [2018-11-23 13:05:27,994 INFO L273 TraceCheckUtils]: 68: Hoare triple {3172#false} assume 0 == ~cond; {3172#false} is VALID [2018-11-23 13:05:27,995 INFO L273 TraceCheckUtils]: 69: Hoare triple {3172#false} assume !false; {3172#false} is VALID [2018-11-23 13:05:28,001 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2018-11-23 13:05:28,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:28,002 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-23 13:05:28,016 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:05:28,063 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:05:28,063 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:28,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:28,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:28,612 INFO L256 TraceCheckUtils]: 0: Hoare triple {3171#true} call ULTIMATE.init(); {3171#true} is VALID [2018-11-23 13:05:28,613 INFO L273 TraceCheckUtils]: 1: Hoare triple {3171#true} assume true; {3171#true} is VALID [2018-11-23 13:05:28,613 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3171#true} {3171#true} #35#return; {3171#true} is VALID [2018-11-23 13:05:28,613 INFO L256 TraceCheckUtils]: 3: Hoare triple {3171#true} call #t~ret1 := main(); {3171#true} is VALID [2018-11-23 13:05:28,614 INFO L273 TraceCheckUtils]: 4: Hoare triple {3171#true} ~x~0 := 0; {3173#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:28,614 INFO L273 TraceCheckUtils]: 5: Hoare triple {3173#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3173#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:28,614 INFO L256 TraceCheckUtils]: 6: Hoare triple {3173#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {3171#true} is VALID [2018-11-23 13:05:28,615 INFO L273 TraceCheckUtils]: 7: Hoare triple {3171#true} ~z := #in~z;#res := 2 + ~z; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:28,616 INFO L273 TraceCheckUtils]: 8: Hoare triple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:28,617 INFO L268 TraceCheckUtils]: 9: Hoare quadruple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3173#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #39#return; {3175#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-23 13:05:28,618 INFO L273 TraceCheckUtils]: 10: Hoare triple {3175#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {3176#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:28,619 INFO L273 TraceCheckUtils]: 11: Hoare triple {3176#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {3176#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:28,619 INFO L256 TraceCheckUtils]: 12: Hoare triple {3176#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {3171#true} is VALID [2018-11-23 13:05:28,620 INFO L273 TraceCheckUtils]: 13: Hoare triple {3171#true} ~z := #in~z;#res := 2 + ~z; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:28,620 INFO L273 TraceCheckUtils]: 14: Hoare triple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:28,622 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3176#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #39#return; {3177#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-23 13:05:28,623 INFO L273 TraceCheckUtils]: 16: Hoare triple {3177#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3178#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:28,624 INFO L273 TraceCheckUtils]: 17: Hoare triple {3178#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {3178#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:28,624 INFO L256 TraceCheckUtils]: 18: Hoare triple {3178#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {3171#true} is VALID [2018-11-23 13:05:28,624 INFO L273 TraceCheckUtils]: 19: Hoare triple {3171#true} ~z := #in~z;#res := 2 + ~z; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:28,625 INFO L273 TraceCheckUtils]: 20: Hoare triple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:28,645 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3178#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #39#return; {3179#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-23 13:05:28,660 INFO L273 TraceCheckUtils]: 22: Hoare triple {3179#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3180#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:28,669 INFO L273 TraceCheckUtils]: 23: Hoare triple {3180#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3180#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:28,669 INFO L256 TraceCheckUtils]: 24: Hoare triple {3180#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call #t~ret0 := f(~x~0); {3171#true} is VALID [2018-11-23 13:05:28,685 INFO L273 TraceCheckUtils]: 25: Hoare triple {3171#true} ~z := #in~z;#res := 2 + ~z; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:28,694 INFO L273 TraceCheckUtils]: 26: Hoare triple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:28,708 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3180#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #39#return; {3181#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} is VALID [2018-11-23 13:05:28,717 INFO L273 TraceCheckUtils]: 28: Hoare triple {3181#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3182#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:28,726 INFO L273 TraceCheckUtils]: 29: Hoare triple {3182#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {3182#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:28,726 INFO L256 TraceCheckUtils]: 30: Hoare triple {3182#(and (<= 8 main_~x~0) (<= main_~x~0 8))} call #t~ret0 := f(~x~0); {3171#true} is VALID [2018-11-23 13:05:28,741 INFO L273 TraceCheckUtils]: 31: Hoare triple {3171#true} ~z := #in~z;#res := 2 + ~z; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:28,750 INFO L273 TraceCheckUtils]: 32: Hoare triple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:28,766 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3182#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #39#return; {3183#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} is VALID [2018-11-23 13:05:28,775 INFO L273 TraceCheckUtils]: 34: Hoare triple {3183#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3184#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:28,788 INFO L273 TraceCheckUtils]: 35: Hoare triple {3184#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3184#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:28,788 INFO L256 TraceCheckUtils]: 36: Hoare triple {3184#(and (<= main_~x~0 10) (<= 10 main_~x~0))} call #t~ret0 := f(~x~0); {3171#true} is VALID [2018-11-23 13:05:28,803 INFO L273 TraceCheckUtils]: 37: Hoare triple {3171#true} ~z := #in~z;#res := 2 + ~z; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:28,812 INFO L273 TraceCheckUtils]: 38: Hoare triple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:28,825 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3184#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #39#return; {3185#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} is VALID [2018-11-23 13:05:28,838 INFO L273 TraceCheckUtils]: 40: Hoare triple {3185#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3186#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:05:28,851 INFO L273 TraceCheckUtils]: 41: Hoare triple {3186#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3186#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:05:28,851 INFO L256 TraceCheckUtils]: 42: Hoare triple {3186#(and (<= main_~x~0 12) (<= 12 main_~x~0))} call #t~ret0 := f(~x~0); {3171#true} is VALID [2018-11-23 13:05:28,864 INFO L273 TraceCheckUtils]: 43: Hoare triple {3171#true} ~z := #in~z;#res := 2 + ~z; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:28,877 INFO L273 TraceCheckUtils]: 44: Hoare triple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:28,890 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3186#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #39#return; {3187#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} is VALID [2018-11-23 13:05:28,903 INFO L273 TraceCheckUtils]: 46: Hoare triple {3187#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3188#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:05:28,911 INFO L273 TraceCheckUtils]: 47: Hoare triple {3188#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3188#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:05:28,911 INFO L256 TraceCheckUtils]: 48: Hoare triple {3188#(and (<= main_~x~0 14) (<= 14 main_~x~0))} call #t~ret0 := f(~x~0); {3171#true} is VALID [2018-11-23 13:05:28,912 INFO L273 TraceCheckUtils]: 49: Hoare triple {3171#true} ~z := #in~z;#res := 2 + ~z; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:28,913 INFO L273 TraceCheckUtils]: 50: Hoare triple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:28,914 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3188#(and (<= main_~x~0 14) (<= 14 main_~x~0))} #39#return; {3189#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} is VALID [2018-11-23 13:05:28,919 INFO L273 TraceCheckUtils]: 52: Hoare triple {3189#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} ~x~0 := #t~ret0;havoc #t~ret0; {3190#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:05:28,919 INFO L273 TraceCheckUtils]: 53: Hoare triple {3190#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3190#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:05:28,919 INFO L256 TraceCheckUtils]: 54: Hoare triple {3190#(and (<= main_~x~0 16) (<= 16 main_~x~0))} call #t~ret0 := f(~x~0); {3171#true} is VALID [2018-11-23 13:05:28,920 INFO L273 TraceCheckUtils]: 55: Hoare triple {3171#true} ~z := #in~z;#res := 2 + ~z; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:28,920 INFO L273 TraceCheckUtils]: 56: Hoare triple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:28,922 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3190#(and (<= main_~x~0 16) (<= 16 main_~x~0))} #39#return; {3191#(and (<= 18 |main_#t~ret0|) (<= |main_#t~ret0| 18))} is VALID [2018-11-23 13:05:28,922 INFO L273 TraceCheckUtils]: 58: Hoare triple {3191#(and (<= 18 |main_#t~ret0|) (<= |main_#t~ret0| 18))} ~x~0 := #t~ret0;havoc #t~ret0; {3192#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:05:28,923 INFO L273 TraceCheckUtils]: 59: Hoare triple {3192#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3192#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:05:28,923 INFO L256 TraceCheckUtils]: 60: Hoare triple {3192#(and (<= main_~x~0 18) (<= 18 main_~x~0))} call #t~ret0 := f(~x~0); {3171#true} is VALID [2018-11-23 13:05:28,924 INFO L273 TraceCheckUtils]: 61: Hoare triple {3171#true} ~z := #in~z;#res := 2 + ~z; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:28,925 INFO L273 TraceCheckUtils]: 62: Hoare triple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:28,927 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {3174#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3192#(and (<= main_~x~0 18) (<= 18 main_~x~0))} #39#return; {3193#(and (<= 20 |main_#t~ret0|) (<= |main_#t~ret0| 20))} is VALID [2018-11-23 13:05:28,928 INFO L273 TraceCheckUtils]: 64: Hoare triple {3193#(and (<= 20 |main_#t~ret0|) (<= |main_#t~ret0| 20))} ~x~0 := #t~ret0;havoc #t~ret0; {3390#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:05:28,928 INFO L273 TraceCheckUtils]: 65: Hoare triple {3390#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(~x~0 % 4294967296 < 268435455); {3172#false} is VALID [2018-11-23 13:05:28,929 INFO L256 TraceCheckUtils]: 66: Hoare triple {3172#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {3172#false} is VALID [2018-11-23 13:05:28,929 INFO L273 TraceCheckUtils]: 67: Hoare triple {3172#false} ~cond := #in~cond; {3172#false} is VALID [2018-11-23 13:05:28,929 INFO L273 TraceCheckUtils]: 68: Hoare triple {3172#false} assume 0 == ~cond; {3172#false} is VALID [2018-11-23 13:05:28,929 INFO L273 TraceCheckUtils]: 69: Hoare triple {3172#false} assume !false; {3172#false} is VALID [2018-11-23 13:05:28,936 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2018-11-23 13:05:28,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:28,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-11-23 13:05:28,957 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 70 [2018-11-23 13:05:28,957 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:28,957 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 13:05:29,007 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:29,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 13:05:29,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 13:05:29,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=542, Unknown=0, NotChecked=0, Total=600 [2018-11-23 13:05:29,009 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 25 states. [2018-11-23 13:05:32,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:32,401 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2018-11-23 13:05:32,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 13:05:32,402 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 70 [2018-11-23 13:05:32,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:32,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:05:32,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 65 transitions. [2018-11-23 13:05:32,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:05:32,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 65 transitions. [2018-11-23 13:05:32,408 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 65 transitions. [2018-11-23 13:05:32,532 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:32,533 INFO L225 Difference]: With dead ends: 54 [2018-11-23 13:05:32,533 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 13:05:32,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 68 SyntacticMatches, 12 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=108, Invalid=1082, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 13:05:32,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 13:05:32,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-11-23 13:05:32,635 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:32,635 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 47 states. [2018-11-23 13:05:32,635 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 47 states. [2018-11-23 13:05:32,635 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 47 states. [2018-11-23 13:05:32,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:32,637 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2018-11-23 13:05:32,638 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2018-11-23 13:05:32,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:32,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:32,638 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 49 states. [2018-11-23 13:05:32,639 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 49 states. [2018-11-23 13:05:32,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:32,641 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2018-11-23 13:05:32,641 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2018-11-23 13:05:32,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:32,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:32,641 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:32,641 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:32,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 13:05:32,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2018-11-23 13:05:32,643 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 70 [2018-11-23 13:05:32,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:32,643 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2018-11-23 13:05:32,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 13:05:32,644 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2018-11-23 13:05:32,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-23 13:05:32,644 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:32,645 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:32,645 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:32,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:32,645 INFO L82 PathProgramCache]: Analyzing trace with hash 153476482, now seen corresponding path program 11 times [2018-11-23 13:05:32,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:32,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:32,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:32,646 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:32,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:32,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:33,385 INFO L256 TraceCheckUtils]: 0: Hoare triple {3687#true} call ULTIMATE.init(); {3687#true} is VALID [2018-11-23 13:05:33,386 INFO L273 TraceCheckUtils]: 1: Hoare triple {3687#true} assume true; {3687#true} is VALID [2018-11-23 13:05:33,386 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3687#true} {3687#true} #35#return; {3687#true} is VALID [2018-11-23 13:05:33,386 INFO L256 TraceCheckUtils]: 3: Hoare triple {3687#true} call #t~ret1 := main(); {3687#true} is VALID [2018-11-23 13:05:33,387 INFO L273 TraceCheckUtils]: 4: Hoare triple {3687#true} ~x~0 := 0; {3689#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:33,387 INFO L273 TraceCheckUtils]: 5: Hoare triple {3689#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3689#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:33,388 INFO L256 TraceCheckUtils]: 6: Hoare triple {3689#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {3687#true} is VALID [2018-11-23 13:05:33,388 INFO L273 TraceCheckUtils]: 7: Hoare triple {3687#true} ~z := #in~z;#res := 2 + ~z; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:33,389 INFO L273 TraceCheckUtils]: 8: Hoare triple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:33,390 INFO L268 TraceCheckUtils]: 9: Hoare quadruple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3689#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #39#return; {3691#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-23 13:05:33,391 INFO L273 TraceCheckUtils]: 10: Hoare triple {3691#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {3692#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:33,392 INFO L273 TraceCheckUtils]: 11: Hoare triple {3692#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {3692#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:33,392 INFO L256 TraceCheckUtils]: 12: Hoare triple {3692#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {3687#true} is VALID [2018-11-23 13:05:33,393 INFO L273 TraceCheckUtils]: 13: Hoare triple {3687#true} ~z := #in~z;#res := 2 + ~z; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:33,393 INFO L273 TraceCheckUtils]: 14: Hoare triple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:33,394 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3692#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #39#return; {3693#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-23 13:05:33,395 INFO L273 TraceCheckUtils]: 16: Hoare triple {3693#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3694#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:33,396 INFO L273 TraceCheckUtils]: 17: Hoare triple {3694#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {3694#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:33,396 INFO L256 TraceCheckUtils]: 18: Hoare triple {3694#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {3687#true} is VALID [2018-11-23 13:05:33,397 INFO L273 TraceCheckUtils]: 19: Hoare triple {3687#true} ~z := #in~z;#res := 2 + ~z; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:33,397 INFO L273 TraceCheckUtils]: 20: Hoare triple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:33,398 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3694#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #39#return; {3695#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-23 13:05:33,399 INFO L273 TraceCheckUtils]: 22: Hoare triple {3695#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3696#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:33,400 INFO L273 TraceCheckUtils]: 23: Hoare triple {3696#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3696#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:33,400 INFO L256 TraceCheckUtils]: 24: Hoare triple {3696#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call #t~ret0 := f(~x~0); {3687#true} is VALID [2018-11-23 13:05:33,401 INFO L273 TraceCheckUtils]: 25: Hoare triple {3687#true} ~z := #in~z;#res := 2 + ~z; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:33,402 INFO L273 TraceCheckUtils]: 26: Hoare triple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:33,403 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3696#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #39#return; {3697#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} is VALID [2018-11-23 13:05:33,403 INFO L273 TraceCheckUtils]: 28: Hoare triple {3697#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3698#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:33,404 INFO L273 TraceCheckUtils]: 29: Hoare triple {3698#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {3698#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:33,404 INFO L256 TraceCheckUtils]: 30: Hoare triple {3698#(and (<= 8 main_~x~0) (<= main_~x~0 8))} call #t~ret0 := f(~x~0); {3687#true} is VALID [2018-11-23 13:05:33,405 INFO L273 TraceCheckUtils]: 31: Hoare triple {3687#true} ~z := #in~z;#res := 2 + ~z; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:33,406 INFO L273 TraceCheckUtils]: 32: Hoare triple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:33,407 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3698#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #39#return; {3699#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} is VALID [2018-11-23 13:05:33,408 INFO L273 TraceCheckUtils]: 34: Hoare triple {3699#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3700#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:33,408 INFO L273 TraceCheckUtils]: 35: Hoare triple {3700#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3700#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:33,409 INFO L256 TraceCheckUtils]: 36: Hoare triple {3700#(and (<= main_~x~0 10) (<= 10 main_~x~0))} call #t~ret0 := f(~x~0); {3687#true} is VALID [2018-11-23 13:05:33,409 INFO L273 TraceCheckUtils]: 37: Hoare triple {3687#true} ~z := #in~z;#res := 2 + ~z; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:33,410 INFO L273 TraceCheckUtils]: 38: Hoare triple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:33,411 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3700#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #39#return; {3701#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} is VALID [2018-11-23 13:05:33,412 INFO L273 TraceCheckUtils]: 40: Hoare triple {3701#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3702#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:05:33,412 INFO L273 TraceCheckUtils]: 41: Hoare triple {3702#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3702#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:05:33,413 INFO L256 TraceCheckUtils]: 42: Hoare triple {3702#(and (<= main_~x~0 12) (<= 12 main_~x~0))} call #t~ret0 := f(~x~0); {3687#true} is VALID [2018-11-23 13:05:33,413 INFO L273 TraceCheckUtils]: 43: Hoare triple {3687#true} ~z := #in~z;#res := 2 + ~z; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:33,414 INFO L273 TraceCheckUtils]: 44: Hoare triple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:33,415 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3702#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #39#return; {3703#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} is VALID [2018-11-23 13:05:33,416 INFO L273 TraceCheckUtils]: 46: Hoare triple {3703#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3704#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:05:33,417 INFO L273 TraceCheckUtils]: 47: Hoare triple {3704#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3704#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:05:33,417 INFO L256 TraceCheckUtils]: 48: Hoare triple {3704#(and (<= main_~x~0 14) (<= 14 main_~x~0))} call #t~ret0 := f(~x~0); {3687#true} is VALID [2018-11-23 13:05:33,418 INFO L273 TraceCheckUtils]: 49: Hoare triple {3687#true} ~z := #in~z;#res := 2 + ~z; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:33,418 INFO L273 TraceCheckUtils]: 50: Hoare triple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:33,419 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3704#(and (<= main_~x~0 14) (<= 14 main_~x~0))} #39#return; {3705#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} is VALID [2018-11-23 13:05:33,420 INFO L273 TraceCheckUtils]: 52: Hoare triple {3705#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} ~x~0 := #t~ret0;havoc #t~ret0; {3706#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:05:33,421 INFO L273 TraceCheckUtils]: 53: Hoare triple {3706#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3706#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:05:33,421 INFO L256 TraceCheckUtils]: 54: Hoare triple {3706#(and (<= main_~x~0 16) (<= 16 main_~x~0))} call #t~ret0 := f(~x~0); {3687#true} is VALID [2018-11-23 13:05:33,422 INFO L273 TraceCheckUtils]: 55: Hoare triple {3687#true} ~z := #in~z;#res := 2 + ~z; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:33,422 INFO L273 TraceCheckUtils]: 56: Hoare triple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:33,423 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3706#(and (<= main_~x~0 16) (<= 16 main_~x~0))} #39#return; {3707#(and (<= 18 |main_#t~ret0|) (<= |main_#t~ret0| 18))} is VALID [2018-11-23 13:05:33,424 INFO L273 TraceCheckUtils]: 58: Hoare triple {3707#(and (<= 18 |main_#t~ret0|) (<= |main_#t~ret0| 18))} ~x~0 := #t~ret0;havoc #t~ret0; {3708#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:05:33,425 INFO L273 TraceCheckUtils]: 59: Hoare triple {3708#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3708#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:05:33,425 INFO L256 TraceCheckUtils]: 60: Hoare triple {3708#(and (<= main_~x~0 18) (<= 18 main_~x~0))} call #t~ret0 := f(~x~0); {3687#true} is VALID [2018-11-23 13:05:33,426 INFO L273 TraceCheckUtils]: 61: Hoare triple {3687#true} ~z := #in~z;#res := 2 + ~z; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:33,426 INFO L273 TraceCheckUtils]: 62: Hoare triple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:33,427 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3708#(and (<= main_~x~0 18) (<= 18 main_~x~0))} #39#return; {3709#(and (<= 20 |main_#t~ret0|) (<= |main_#t~ret0| 20))} is VALID [2018-11-23 13:05:33,428 INFO L273 TraceCheckUtils]: 64: Hoare triple {3709#(and (<= 20 |main_#t~ret0|) (<= |main_#t~ret0| 20))} ~x~0 := #t~ret0;havoc #t~ret0; {3710#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:05:33,429 INFO L273 TraceCheckUtils]: 65: Hoare triple {3710#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455); {3710#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:05:33,429 INFO L256 TraceCheckUtils]: 66: Hoare triple {3710#(and (<= 20 main_~x~0) (<= main_~x~0 20))} call #t~ret0 := f(~x~0); {3687#true} is VALID [2018-11-23 13:05:33,430 INFO L273 TraceCheckUtils]: 67: Hoare triple {3687#true} ~z := #in~z;#res := 2 + ~z; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:33,430 INFO L273 TraceCheckUtils]: 68: Hoare triple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:05:33,431 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3710#(and (<= 20 main_~x~0) (<= main_~x~0 20))} #39#return; {3711#(and (<= 22 |main_#t~ret0|) (<= |main_#t~ret0| 22))} is VALID [2018-11-23 13:05:33,432 INFO L273 TraceCheckUtils]: 70: Hoare triple {3711#(and (<= 22 |main_#t~ret0|) (<= |main_#t~ret0| 22))} ~x~0 := #t~ret0;havoc #t~ret0; {3712#(and (<= main_~x~0 22) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:05:33,433 INFO L273 TraceCheckUtils]: 71: Hoare triple {3712#(and (<= main_~x~0 22) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {3688#false} is VALID [2018-11-23 13:05:33,433 INFO L256 TraceCheckUtils]: 72: Hoare triple {3688#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {3688#false} is VALID [2018-11-23 13:05:33,434 INFO L273 TraceCheckUtils]: 73: Hoare triple {3688#false} ~cond := #in~cond; {3688#false} is VALID [2018-11-23 13:05:33,434 INFO L273 TraceCheckUtils]: 74: Hoare triple {3688#false} assume 0 == ~cond; {3688#false} is VALID [2018-11-23 13:05:33,434 INFO L273 TraceCheckUtils]: 75: Hoare triple {3688#false} assume !false; {3688#false} is VALID [2018-11-23 13:05:33,442 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-11-23 13:05:33,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:33,442 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:33,452 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:06:31,843 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-23 13:06:31,843 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:06:31,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:31,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:32,319 INFO L256 TraceCheckUtils]: 0: Hoare triple {3687#true} call ULTIMATE.init(); {3687#true} is VALID [2018-11-23 13:06:32,320 INFO L273 TraceCheckUtils]: 1: Hoare triple {3687#true} assume true; {3687#true} is VALID [2018-11-23 13:06:32,320 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3687#true} {3687#true} #35#return; {3687#true} is VALID [2018-11-23 13:06:32,320 INFO L256 TraceCheckUtils]: 3: Hoare triple {3687#true} call #t~ret1 := main(); {3687#true} is VALID [2018-11-23 13:06:32,321 INFO L273 TraceCheckUtils]: 4: Hoare triple {3687#true} ~x~0 := 0; {3689#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:32,321 INFO L273 TraceCheckUtils]: 5: Hoare triple {3689#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3689#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:32,322 INFO L256 TraceCheckUtils]: 6: Hoare triple {3689#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {3687#true} is VALID [2018-11-23 13:06:32,322 INFO L273 TraceCheckUtils]: 7: Hoare triple {3687#true} ~z := #in~z;#res := 2 + ~z; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:32,322 INFO L273 TraceCheckUtils]: 8: Hoare triple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:32,323 INFO L268 TraceCheckUtils]: 9: Hoare quadruple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3689#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #39#return; {3691#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-23 13:06:32,324 INFO L273 TraceCheckUtils]: 10: Hoare triple {3691#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {3692#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:32,324 INFO L273 TraceCheckUtils]: 11: Hoare triple {3692#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {3692#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:32,324 INFO L256 TraceCheckUtils]: 12: Hoare triple {3692#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {3687#true} is VALID [2018-11-23 13:06:32,325 INFO L273 TraceCheckUtils]: 13: Hoare triple {3687#true} ~z := #in~z;#res := 2 + ~z; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:32,326 INFO L273 TraceCheckUtils]: 14: Hoare triple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:32,327 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3692#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #39#return; {3693#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-23 13:06:32,327 INFO L273 TraceCheckUtils]: 16: Hoare triple {3693#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3694#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:06:32,328 INFO L273 TraceCheckUtils]: 17: Hoare triple {3694#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {3694#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:06:32,328 INFO L256 TraceCheckUtils]: 18: Hoare triple {3694#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {3687#true} is VALID [2018-11-23 13:06:32,329 INFO L273 TraceCheckUtils]: 19: Hoare triple {3687#true} ~z := #in~z;#res := 2 + ~z; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:32,330 INFO L273 TraceCheckUtils]: 20: Hoare triple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:32,331 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3694#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #39#return; {3695#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-23 13:06:32,332 INFO L273 TraceCheckUtils]: 22: Hoare triple {3695#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3696#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:06:32,333 INFO L273 TraceCheckUtils]: 23: Hoare triple {3696#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3696#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:06:32,333 INFO L256 TraceCheckUtils]: 24: Hoare triple {3696#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call #t~ret0 := f(~x~0); {3687#true} is VALID [2018-11-23 13:06:32,334 INFO L273 TraceCheckUtils]: 25: Hoare triple {3687#true} ~z := #in~z;#res := 2 + ~z; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:32,334 INFO L273 TraceCheckUtils]: 26: Hoare triple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:32,335 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3696#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #39#return; {3697#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} is VALID [2018-11-23 13:06:32,336 INFO L273 TraceCheckUtils]: 28: Hoare triple {3697#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3698#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:06:32,337 INFO L273 TraceCheckUtils]: 29: Hoare triple {3698#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {3698#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:06:32,337 INFO L256 TraceCheckUtils]: 30: Hoare triple {3698#(and (<= 8 main_~x~0) (<= main_~x~0 8))} call #t~ret0 := f(~x~0); {3687#true} is VALID [2018-11-23 13:06:32,338 INFO L273 TraceCheckUtils]: 31: Hoare triple {3687#true} ~z := #in~z;#res := 2 + ~z; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:32,339 INFO L273 TraceCheckUtils]: 32: Hoare triple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:32,340 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3698#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #39#return; {3699#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} is VALID [2018-11-23 13:06:32,340 INFO L273 TraceCheckUtils]: 34: Hoare triple {3699#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3700#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:06:32,341 INFO L273 TraceCheckUtils]: 35: Hoare triple {3700#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3700#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:06:32,341 INFO L256 TraceCheckUtils]: 36: Hoare triple {3700#(and (<= main_~x~0 10) (<= 10 main_~x~0))} call #t~ret0 := f(~x~0); {3687#true} is VALID [2018-11-23 13:06:32,342 INFO L273 TraceCheckUtils]: 37: Hoare triple {3687#true} ~z := #in~z;#res := 2 + ~z; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:32,343 INFO L273 TraceCheckUtils]: 38: Hoare triple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:32,344 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3700#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #39#return; {3701#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} is VALID [2018-11-23 13:06:32,345 INFO L273 TraceCheckUtils]: 40: Hoare triple {3701#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3702#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:06:32,345 INFO L273 TraceCheckUtils]: 41: Hoare triple {3702#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3702#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:06:32,346 INFO L256 TraceCheckUtils]: 42: Hoare triple {3702#(and (<= main_~x~0 12) (<= 12 main_~x~0))} call #t~ret0 := f(~x~0); {3687#true} is VALID [2018-11-23 13:06:32,346 INFO L273 TraceCheckUtils]: 43: Hoare triple {3687#true} ~z := #in~z;#res := 2 + ~z; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:32,347 INFO L273 TraceCheckUtils]: 44: Hoare triple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:32,348 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3702#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #39#return; {3703#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} is VALID [2018-11-23 13:06:32,349 INFO L273 TraceCheckUtils]: 46: Hoare triple {3703#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {3704#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:06:32,350 INFO L273 TraceCheckUtils]: 47: Hoare triple {3704#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3704#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:06:32,350 INFO L256 TraceCheckUtils]: 48: Hoare triple {3704#(and (<= main_~x~0 14) (<= 14 main_~x~0))} call #t~ret0 := f(~x~0); {3687#true} is VALID [2018-11-23 13:06:32,351 INFO L273 TraceCheckUtils]: 49: Hoare triple {3687#true} ~z := #in~z;#res := 2 + ~z; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:32,352 INFO L273 TraceCheckUtils]: 50: Hoare triple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:32,353 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3704#(and (<= main_~x~0 14) (<= 14 main_~x~0))} #39#return; {3705#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} is VALID [2018-11-23 13:06:32,353 INFO L273 TraceCheckUtils]: 52: Hoare triple {3705#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} ~x~0 := #t~ret0;havoc #t~ret0; {3706#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:06:32,354 INFO L273 TraceCheckUtils]: 53: Hoare triple {3706#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3706#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:06:32,354 INFO L256 TraceCheckUtils]: 54: Hoare triple {3706#(and (<= main_~x~0 16) (<= 16 main_~x~0))} call #t~ret0 := f(~x~0); {3687#true} is VALID [2018-11-23 13:06:32,355 INFO L273 TraceCheckUtils]: 55: Hoare triple {3687#true} ~z := #in~z;#res := 2 + ~z; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:32,356 INFO L273 TraceCheckUtils]: 56: Hoare triple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:32,357 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3706#(and (<= main_~x~0 16) (<= 16 main_~x~0))} #39#return; {3707#(and (<= 18 |main_#t~ret0|) (<= |main_#t~ret0| 18))} is VALID [2018-11-23 13:06:32,358 INFO L273 TraceCheckUtils]: 58: Hoare triple {3707#(and (<= 18 |main_#t~ret0|) (<= |main_#t~ret0| 18))} ~x~0 := #t~ret0;havoc #t~ret0; {3708#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:06:32,359 INFO L273 TraceCheckUtils]: 59: Hoare triple {3708#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {3708#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:06:32,359 INFO L256 TraceCheckUtils]: 60: Hoare triple {3708#(and (<= main_~x~0 18) (<= 18 main_~x~0))} call #t~ret0 := f(~x~0); {3687#true} is VALID [2018-11-23 13:06:32,360 INFO L273 TraceCheckUtils]: 61: Hoare triple {3687#true} ~z := #in~z;#res := 2 + ~z; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:32,360 INFO L273 TraceCheckUtils]: 62: Hoare triple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:32,361 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3708#(and (<= main_~x~0 18) (<= 18 main_~x~0))} #39#return; {3709#(and (<= 20 |main_#t~ret0|) (<= |main_#t~ret0| 20))} is VALID [2018-11-23 13:06:32,362 INFO L273 TraceCheckUtils]: 64: Hoare triple {3709#(and (<= 20 |main_#t~ret0|) (<= |main_#t~ret0| 20))} ~x~0 := #t~ret0;havoc #t~ret0; {3710#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:06:32,363 INFO L273 TraceCheckUtils]: 65: Hoare triple {3710#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455); {3710#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:06:32,363 INFO L256 TraceCheckUtils]: 66: Hoare triple {3710#(and (<= 20 main_~x~0) (<= main_~x~0 20))} call #t~ret0 := f(~x~0); {3687#true} is VALID [2018-11-23 13:06:32,364 INFO L273 TraceCheckUtils]: 67: Hoare triple {3687#true} ~z := #in~z;#res := 2 + ~z; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:32,365 INFO L273 TraceCheckUtils]: 68: Hoare triple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:32,366 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {3690#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {3710#(and (<= 20 main_~x~0) (<= main_~x~0 20))} #39#return; {3711#(and (<= 22 |main_#t~ret0|) (<= |main_#t~ret0| 22))} is VALID [2018-11-23 13:06:32,367 INFO L273 TraceCheckUtils]: 70: Hoare triple {3711#(and (<= 22 |main_#t~ret0|) (<= |main_#t~ret0| 22))} ~x~0 := #t~ret0;havoc #t~ret0; {3926#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:06:32,367 INFO L273 TraceCheckUtils]: 71: Hoare triple {3926#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {3688#false} is VALID [2018-11-23 13:06:32,368 INFO L256 TraceCheckUtils]: 72: Hoare triple {3688#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {3688#false} is VALID [2018-11-23 13:06:32,368 INFO L273 TraceCheckUtils]: 73: Hoare triple {3688#false} ~cond := #in~cond; {3688#false} is VALID [2018-11-23 13:06:32,368 INFO L273 TraceCheckUtils]: 74: Hoare triple {3688#false} assume 0 == ~cond; {3688#false} is VALID [2018-11-23 13:06:32,368 INFO L273 TraceCheckUtils]: 75: Hoare triple {3688#false} assume !false; {3688#false} is VALID [2018-11-23 13:06:32,377 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-11-23 13:06:32,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:32,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2018-11-23 13:06:32,397 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 76 [2018-11-23 13:06:32,398 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:32,398 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-23 13:06:32,450 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:32,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-23 13:06:32,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 13:06:32,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=639, Unknown=0, NotChecked=0, Total=702 [2018-11-23 13:06:32,452 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. Second operand 27 states. [2018-11-23 13:06:35,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:35,274 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2018-11-23 13:06:35,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 13:06:35,275 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 76 [2018-11-23 13:06:35,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:35,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 13:06:35,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 69 transitions. [2018-11-23 13:06:35,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 13:06:35,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 69 transitions. [2018-11-23 13:06:35,281 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 69 transitions. [2018-11-23 13:06:35,500 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:35,502 INFO L225 Difference]: With dead ends: 57 [2018-11-23 13:06:35,502 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 13:06:35,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 74 SyntacticMatches, 13 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=118, Invalid=1288, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 13:06:35,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 13:06:35,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2018-11-23 13:06:35,555 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:35,555 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 50 states. [2018-11-23 13:06:35,555 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 50 states. [2018-11-23 13:06:35,556 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 50 states. [2018-11-23 13:06:35,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:35,558 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2018-11-23 13:06:35,558 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2018-11-23 13:06:35,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:35,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:35,559 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 52 states. [2018-11-23 13:06:35,559 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 52 states. [2018-11-23 13:06:35,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:35,561 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2018-11-23 13:06:35,561 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2018-11-23 13:06:35,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:35,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:35,562 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:35,562 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:35,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 13:06:35,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2018-11-23 13:06:35,564 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 76 [2018-11-23 13:06:35,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:35,564 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2018-11-23 13:06:35,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-23 13:06:35,565 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2018-11-23 13:06:35,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-23 13:06:35,565 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:35,566 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:35,566 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:35,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:35,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1587568480, now seen corresponding path program 12 times [2018-11-23 13:06:35,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:35,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:35,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:35,567 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:35,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:35,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:36,421 INFO L256 TraceCheckUtils]: 0: Hoare triple {4241#true} call ULTIMATE.init(); {4241#true} is VALID [2018-11-23 13:06:36,422 INFO L273 TraceCheckUtils]: 1: Hoare triple {4241#true} assume true; {4241#true} is VALID [2018-11-23 13:06:36,422 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4241#true} {4241#true} #35#return; {4241#true} is VALID [2018-11-23 13:06:36,422 INFO L256 TraceCheckUtils]: 3: Hoare triple {4241#true} call #t~ret1 := main(); {4241#true} is VALID [2018-11-23 13:06:36,423 INFO L273 TraceCheckUtils]: 4: Hoare triple {4241#true} ~x~0 := 0; {4243#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:36,423 INFO L273 TraceCheckUtils]: 5: Hoare triple {4243#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4243#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:36,424 INFO L256 TraceCheckUtils]: 6: Hoare triple {4243#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {4241#true} is VALID [2018-11-23 13:06:36,424 INFO L273 TraceCheckUtils]: 7: Hoare triple {4241#true} ~z := #in~z;#res := 2 + ~z; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:36,425 INFO L273 TraceCheckUtils]: 8: Hoare triple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:36,427 INFO L268 TraceCheckUtils]: 9: Hoare quadruple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4243#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #39#return; {4245#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-23 13:06:36,428 INFO L273 TraceCheckUtils]: 10: Hoare triple {4245#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {4246#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:36,429 INFO L273 TraceCheckUtils]: 11: Hoare triple {4246#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {4246#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:36,429 INFO L256 TraceCheckUtils]: 12: Hoare triple {4246#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {4241#true} is VALID [2018-11-23 13:06:36,430 INFO L273 TraceCheckUtils]: 13: Hoare triple {4241#true} ~z := #in~z;#res := 2 + ~z; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:36,431 INFO L273 TraceCheckUtils]: 14: Hoare triple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:36,433 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4246#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #39#return; {4247#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-23 13:06:36,434 INFO L273 TraceCheckUtils]: 16: Hoare triple {4247#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {4248#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:06:36,434 INFO L273 TraceCheckUtils]: 17: Hoare triple {4248#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {4248#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:06:36,435 INFO L256 TraceCheckUtils]: 18: Hoare triple {4248#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {4241#true} is VALID [2018-11-23 13:06:36,435 INFO L273 TraceCheckUtils]: 19: Hoare triple {4241#true} ~z := #in~z;#res := 2 + ~z; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:36,436 INFO L273 TraceCheckUtils]: 20: Hoare triple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:36,438 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4248#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #39#return; {4249#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-23 13:06:36,439 INFO L273 TraceCheckUtils]: 22: Hoare triple {4249#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {4250#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:06:36,440 INFO L273 TraceCheckUtils]: 23: Hoare triple {4250#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4250#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:06:36,440 INFO L256 TraceCheckUtils]: 24: Hoare triple {4250#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call #t~ret0 := f(~x~0); {4241#true} is VALID [2018-11-23 13:06:36,441 INFO L273 TraceCheckUtils]: 25: Hoare triple {4241#true} ~z := #in~z;#res := 2 + ~z; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:36,441 INFO L273 TraceCheckUtils]: 26: Hoare triple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:36,443 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4250#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #39#return; {4251#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} is VALID [2018-11-23 13:06:36,444 INFO L273 TraceCheckUtils]: 28: Hoare triple {4251#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {4252#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:06:36,445 INFO L273 TraceCheckUtils]: 29: Hoare triple {4252#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {4252#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:06:36,445 INFO L256 TraceCheckUtils]: 30: Hoare triple {4252#(and (<= 8 main_~x~0) (<= main_~x~0 8))} call #t~ret0 := f(~x~0); {4241#true} is VALID [2018-11-23 13:06:36,446 INFO L273 TraceCheckUtils]: 31: Hoare triple {4241#true} ~z := #in~z;#res := 2 + ~z; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:36,447 INFO L273 TraceCheckUtils]: 32: Hoare triple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:36,448 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4252#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #39#return; {4253#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} is VALID [2018-11-23 13:06:36,449 INFO L273 TraceCheckUtils]: 34: Hoare triple {4253#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {4254#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:06:36,450 INFO L273 TraceCheckUtils]: 35: Hoare triple {4254#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4254#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:06:36,450 INFO L256 TraceCheckUtils]: 36: Hoare triple {4254#(and (<= main_~x~0 10) (<= 10 main_~x~0))} call #t~ret0 := f(~x~0); {4241#true} is VALID [2018-11-23 13:06:36,451 INFO L273 TraceCheckUtils]: 37: Hoare triple {4241#true} ~z := #in~z;#res := 2 + ~z; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:36,451 INFO L273 TraceCheckUtils]: 38: Hoare triple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:36,454 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4254#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #39#return; {4255#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} is VALID [2018-11-23 13:06:36,454 INFO L273 TraceCheckUtils]: 40: Hoare triple {4255#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {4256#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:06:36,455 INFO L273 TraceCheckUtils]: 41: Hoare triple {4256#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4256#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:06:36,455 INFO L256 TraceCheckUtils]: 42: Hoare triple {4256#(and (<= main_~x~0 12) (<= 12 main_~x~0))} call #t~ret0 := f(~x~0); {4241#true} is VALID [2018-11-23 13:06:36,456 INFO L273 TraceCheckUtils]: 43: Hoare triple {4241#true} ~z := #in~z;#res := 2 + ~z; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:36,456 INFO L273 TraceCheckUtils]: 44: Hoare triple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:36,458 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4256#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #39#return; {4257#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} is VALID [2018-11-23 13:06:36,458 INFO L273 TraceCheckUtils]: 46: Hoare triple {4257#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {4258#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:06:36,459 INFO L273 TraceCheckUtils]: 47: Hoare triple {4258#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4258#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:06:36,459 INFO L256 TraceCheckUtils]: 48: Hoare triple {4258#(and (<= main_~x~0 14) (<= 14 main_~x~0))} call #t~ret0 := f(~x~0); {4241#true} is VALID [2018-11-23 13:06:36,460 INFO L273 TraceCheckUtils]: 49: Hoare triple {4241#true} ~z := #in~z;#res := 2 + ~z; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:36,460 INFO L273 TraceCheckUtils]: 50: Hoare triple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:36,463 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4258#(and (<= main_~x~0 14) (<= 14 main_~x~0))} #39#return; {4259#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} is VALID [2018-11-23 13:06:36,463 INFO L273 TraceCheckUtils]: 52: Hoare triple {4259#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} ~x~0 := #t~ret0;havoc #t~ret0; {4260#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:06:36,464 INFO L273 TraceCheckUtils]: 53: Hoare triple {4260#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4260#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:06:36,464 INFO L256 TraceCheckUtils]: 54: Hoare triple {4260#(and (<= main_~x~0 16) (<= 16 main_~x~0))} call #t~ret0 := f(~x~0); {4241#true} is VALID [2018-11-23 13:06:36,465 INFO L273 TraceCheckUtils]: 55: Hoare triple {4241#true} ~z := #in~z;#res := 2 + ~z; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:36,466 INFO L273 TraceCheckUtils]: 56: Hoare triple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:36,468 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4260#(and (<= main_~x~0 16) (<= 16 main_~x~0))} #39#return; {4261#(and (<= 18 |main_#t~ret0|) (<= |main_#t~ret0| 18))} is VALID [2018-11-23 13:06:36,468 INFO L273 TraceCheckUtils]: 58: Hoare triple {4261#(and (<= 18 |main_#t~ret0|) (<= |main_#t~ret0| 18))} ~x~0 := #t~ret0;havoc #t~ret0; {4262#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:06:36,469 INFO L273 TraceCheckUtils]: 59: Hoare triple {4262#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4262#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:06:36,469 INFO L256 TraceCheckUtils]: 60: Hoare triple {4262#(and (<= main_~x~0 18) (<= 18 main_~x~0))} call #t~ret0 := f(~x~0); {4241#true} is VALID [2018-11-23 13:06:36,470 INFO L273 TraceCheckUtils]: 61: Hoare triple {4241#true} ~z := #in~z;#res := 2 + ~z; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:36,471 INFO L273 TraceCheckUtils]: 62: Hoare triple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:36,473 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4262#(and (<= main_~x~0 18) (<= 18 main_~x~0))} #39#return; {4263#(and (<= 20 |main_#t~ret0|) (<= |main_#t~ret0| 20))} is VALID [2018-11-23 13:06:36,474 INFO L273 TraceCheckUtils]: 64: Hoare triple {4263#(and (<= 20 |main_#t~ret0|) (<= |main_#t~ret0| 20))} ~x~0 := #t~ret0;havoc #t~ret0; {4264#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:06:36,474 INFO L273 TraceCheckUtils]: 65: Hoare triple {4264#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455); {4264#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:06:36,475 INFO L256 TraceCheckUtils]: 66: Hoare triple {4264#(and (<= 20 main_~x~0) (<= main_~x~0 20))} call #t~ret0 := f(~x~0); {4241#true} is VALID [2018-11-23 13:06:36,475 INFO L273 TraceCheckUtils]: 67: Hoare triple {4241#true} ~z := #in~z;#res := 2 + ~z; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:36,476 INFO L273 TraceCheckUtils]: 68: Hoare triple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:36,478 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4264#(and (<= 20 main_~x~0) (<= main_~x~0 20))} #39#return; {4265#(and (<= 22 |main_#t~ret0|) (<= |main_#t~ret0| 22))} is VALID [2018-11-23 13:06:36,479 INFO L273 TraceCheckUtils]: 70: Hoare triple {4265#(and (<= 22 |main_#t~ret0|) (<= |main_#t~ret0| 22))} ~x~0 := #t~ret0;havoc #t~ret0; {4266#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:06:36,480 INFO L273 TraceCheckUtils]: 71: Hoare triple {4266#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4266#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:06:36,480 INFO L256 TraceCheckUtils]: 72: Hoare triple {4266#(and (<= main_~x~0 22) (<= 22 main_~x~0))} call #t~ret0 := f(~x~0); {4241#true} is VALID [2018-11-23 13:06:36,481 INFO L273 TraceCheckUtils]: 73: Hoare triple {4241#true} ~z := #in~z;#res := 2 + ~z; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:36,482 INFO L273 TraceCheckUtils]: 74: Hoare triple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:36,484 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4266#(and (<= main_~x~0 22) (<= 22 main_~x~0))} #39#return; {4267#(and (<= |main_#t~ret0| 24) (<= 24 |main_#t~ret0|))} is VALID [2018-11-23 13:06:36,485 INFO L273 TraceCheckUtils]: 76: Hoare triple {4267#(and (<= |main_#t~ret0| 24) (<= 24 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {4268#(and (<= main_~x~0 24) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:06:36,486 INFO L273 TraceCheckUtils]: 77: Hoare triple {4268#(and (<= main_~x~0 24) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {4242#false} is VALID [2018-11-23 13:06:36,486 INFO L256 TraceCheckUtils]: 78: Hoare triple {4242#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {4242#false} is VALID [2018-11-23 13:06:36,486 INFO L273 TraceCheckUtils]: 79: Hoare triple {4242#false} ~cond := #in~cond; {4242#false} is VALID [2018-11-23 13:06:36,486 INFO L273 TraceCheckUtils]: 80: Hoare triple {4242#false} assume 0 == ~cond; {4242#false} is VALID [2018-11-23 13:06:36,486 INFO L273 TraceCheckUtils]: 81: Hoare triple {4242#false} assume !false; {4242#false} is VALID [2018-11-23 13:06:36,497 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2018-11-23 13:06:36,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:36,497 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:06:36,513 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:06:52,501 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-23 13:06:52,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:06:52,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:52,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:53,040 INFO L256 TraceCheckUtils]: 0: Hoare triple {4241#true} call ULTIMATE.init(); {4241#true} is VALID [2018-11-23 13:06:53,040 INFO L273 TraceCheckUtils]: 1: Hoare triple {4241#true} assume true; {4241#true} is VALID [2018-11-23 13:06:53,041 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4241#true} {4241#true} #35#return; {4241#true} is VALID [2018-11-23 13:06:53,041 INFO L256 TraceCheckUtils]: 3: Hoare triple {4241#true} call #t~ret1 := main(); {4241#true} is VALID [2018-11-23 13:06:53,042 INFO L273 TraceCheckUtils]: 4: Hoare triple {4241#true} ~x~0 := 0; {4243#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:53,042 INFO L273 TraceCheckUtils]: 5: Hoare triple {4243#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4243#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:53,043 INFO L256 TraceCheckUtils]: 6: Hoare triple {4243#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {4241#true} is VALID [2018-11-23 13:06:53,043 INFO L273 TraceCheckUtils]: 7: Hoare triple {4241#true} ~z := #in~z;#res := 2 + ~z; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:53,044 INFO L273 TraceCheckUtils]: 8: Hoare triple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:53,046 INFO L268 TraceCheckUtils]: 9: Hoare quadruple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4243#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #39#return; {4245#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-23 13:06:53,046 INFO L273 TraceCheckUtils]: 10: Hoare triple {4245#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {4246#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:53,047 INFO L273 TraceCheckUtils]: 11: Hoare triple {4246#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {4246#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:53,047 INFO L256 TraceCheckUtils]: 12: Hoare triple {4246#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {4241#true} is VALID [2018-11-23 13:06:53,048 INFO L273 TraceCheckUtils]: 13: Hoare triple {4241#true} ~z := #in~z;#res := 2 + ~z; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:53,049 INFO L273 TraceCheckUtils]: 14: Hoare triple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:53,051 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4246#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #39#return; {4247#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-23 13:06:53,052 INFO L273 TraceCheckUtils]: 16: Hoare triple {4247#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {4248#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:06:53,052 INFO L273 TraceCheckUtils]: 17: Hoare triple {4248#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {4248#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:06:53,053 INFO L256 TraceCheckUtils]: 18: Hoare triple {4248#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {4241#true} is VALID [2018-11-23 13:06:53,053 INFO L273 TraceCheckUtils]: 19: Hoare triple {4241#true} ~z := #in~z;#res := 2 + ~z; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:53,054 INFO L273 TraceCheckUtils]: 20: Hoare triple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:53,056 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4248#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #39#return; {4249#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-23 13:06:53,057 INFO L273 TraceCheckUtils]: 22: Hoare triple {4249#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {4250#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:06:53,058 INFO L273 TraceCheckUtils]: 23: Hoare triple {4250#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4250#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:06:53,058 INFO L256 TraceCheckUtils]: 24: Hoare triple {4250#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call #t~ret0 := f(~x~0); {4241#true} is VALID [2018-11-23 13:06:53,059 INFO L273 TraceCheckUtils]: 25: Hoare triple {4241#true} ~z := #in~z;#res := 2 + ~z; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:53,060 INFO L273 TraceCheckUtils]: 26: Hoare triple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:53,061 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4250#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #39#return; {4251#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} is VALID [2018-11-23 13:06:53,062 INFO L273 TraceCheckUtils]: 28: Hoare triple {4251#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {4252#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:06:53,063 INFO L273 TraceCheckUtils]: 29: Hoare triple {4252#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {4252#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:06:53,063 INFO L256 TraceCheckUtils]: 30: Hoare triple {4252#(and (<= 8 main_~x~0) (<= main_~x~0 8))} call #t~ret0 := f(~x~0); {4241#true} is VALID [2018-11-23 13:06:53,064 INFO L273 TraceCheckUtils]: 31: Hoare triple {4241#true} ~z := #in~z;#res := 2 + ~z; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:53,065 INFO L273 TraceCheckUtils]: 32: Hoare triple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:53,067 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4252#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #39#return; {4253#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} is VALID [2018-11-23 13:06:53,068 INFO L273 TraceCheckUtils]: 34: Hoare triple {4253#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {4254#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:06:53,068 INFO L273 TraceCheckUtils]: 35: Hoare triple {4254#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4254#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:06:53,069 INFO L256 TraceCheckUtils]: 36: Hoare triple {4254#(and (<= main_~x~0 10) (<= 10 main_~x~0))} call #t~ret0 := f(~x~0); {4241#true} is VALID [2018-11-23 13:06:53,069 INFO L273 TraceCheckUtils]: 37: Hoare triple {4241#true} ~z := #in~z;#res := 2 + ~z; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:53,070 INFO L273 TraceCheckUtils]: 38: Hoare triple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:53,072 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4254#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #39#return; {4255#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} is VALID [2018-11-23 13:06:53,073 INFO L273 TraceCheckUtils]: 40: Hoare triple {4255#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {4256#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:06:53,074 INFO L273 TraceCheckUtils]: 41: Hoare triple {4256#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4256#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:06:53,074 INFO L256 TraceCheckUtils]: 42: Hoare triple {4256#(and (<= main_~x~0 12) (<= 12 main_~x~0))} call #t~ret0 := f(~x~0); {4241#true} is VALID [2018-11-23 13:06:53,075 INFO L273 TraceCheckUtils]: 43: Hoare triple {4241#true} ~z := #in~z;#res := 2 + ~z; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:53,076 INFO L273 TraceCheckUtils]: 44: Hoare triple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:53,077 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4256#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #39#return; {4257#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} is VALID [2018-11-23 13:06:53,078 INFO L273 TraceCheckUtils]: 46: Hoare triple {4257#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {4258#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:06:53,079 INFO L273 TraceCheckUtils]: 47: Hoare triple {4258#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4258#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:06:53,079 INFO L256 TraceCheckUtils]: 48: Hoare triple {4258#(and (<= main_~x~0 14) (<= 14 main_~x~0))} call #t~ret0 := f(~x~0); {4241#true} is VALID [2018-11-23 13:06:53,080 INFO L273 TraceCheckUtils]: 49: Hoare triple {4241#true} ~z := #in~z;#res := 2 + ~z; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:53,081 INFO L273 TraceCheckUtils]: 50: Hoare triple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:53,083 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4258#(and (<= main_~x~0 14) (<= 14 main_~x~0))} #39#return; {4259#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} is VALID [2018-11-23 13:06:53,084 INFO L273 TraceCheckUtils]: 52: Hoare triple {4259#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} ~x~0 := #t~ret0;havoc #t~ret0; {4260#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:06:53,084 INFO L273 TraceCheckUtils]: 53: Hoare triple {4260#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4260#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:06:53,085 INFO L256 TraceCheckUtils]: 54: Hoare triple {4260#(and (<= main_~x~0 16) (<= 16 main_~x~0))} call #t~ret0 := f(~x~0); {4241#true} is VALID [2018-11-23 13:06:53,086 INFO L273 TraceCheckUtils]: 55: Hoare triple {4241#true} ~z := #in~z;#res := 2 + ~z; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:53,086 INFO L273 TraceCheckUtils]: 56: Hoare triple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:53,088 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4260#(and (<= main_~x~0 16) (<= 16 main_~x~0))} #39#return; {4261#(and (<= 18 |main_#t~ret0|) (<= |main_#t~ret0| 18))} is VALID [2018-11-23 13:06:53,089 INFO L273 TraceCheckUtils]: 58: Hoare triple {4261#(and (<= 18 |main_#t~ret0|) (<= |main_#t~ret0| 18))} ~x~0 := #t~ret0;havoc #t~ret0; {4262#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:06:53,090 INFO L273 TraceCheckUtils]: 59: Hoare triple {4262#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4262#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:06:53,090 INFO L256 TraceCheckUtils]: 60: Hoare triple {4262#(and (<= main_~x~0 18) (<= 18 main_~x~0))} call #t~ret0 := f(~x~0); {4241#true} is VALID [2018-11-23 13:06:53,091 INFO L273 TraceCheckUtils]: 61: Hoare triple {4241#true} ~z := #in~z;#res := 2 + ~z; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:53,091 INFO L273 TraceCheckUtils]: 62: Hoare triple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:53,092 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4262#(and (<= main_~x~0 18) (<= 18 main_~x~0))} #39#return; {4263#(and (<= 20 |main_#t~ret0|) (<= |main_#t~ret0| 20))} is VALID [2018-11-23 13:06:53,093 INFO L273 TraceCheckUtils]: 64: Hoare triple {4263#(and (<= 20 |main_#t~ret0|) (<= |main_#t~ret0| 20))} ~x~0 := #t~ret0;havoc #t~ret0; {4264#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:06:53,094 INFO L273 TraceCheckUtils]: 65: Hoare triple {4264#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455); {4264#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:06:53,094 INFO L256 TraceCheckUtils]: 66: Hoare triple {4264#(and (<= 20 main_~x~0) (<= main_~x~0 20))} call #t~ret0 := f(~x~0); {4241#true} is VALID [2018-11-23 13:06:53,095 INFO L273 TraceCheckUtils]: 67: Hoare triple {4241#true} ~z := #in~z;#res := 2 + ~z; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:53,096 INFO L273 TraceCheckUtils]: 68: Hoare triple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:53,098 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4264#(and (<= 20 main_~x~0) (<= main_~x~0 20))} #39#return; {4265#(and (<= 22 |main_#t~ret0|) (<= |main_#t~ret0| 22))} is VALID [2018-11-23 13:06:53,098 INFO L273 TraceCheckUtils]: 70: Hoare triple {4265#(and (<= 22 |main_#t~ret0|) (<= |main_#t~ret0| 22))} ~x~0 := #t~ret0;havoc #t~ret0; {4266#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:06:53,099 INFO L273 TraceCheckUtils]: 71: Hoare triple {4266#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4266#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:06:53,099 INFO L256 TraceCheckUtils]: 72: Hoare triple {4266#(and (<= main_~x~0 22) (<= 22 main_~x~0))} call #t~ret0 := f(~x~0); {4241#true} is VALID [2018-11-23 13:06:53,100 INFO L273 TraceCheckUtils]: 73: Hoare triple {4241#true} ~z := #in~z;#res := 2 + ~z; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:53,101 INFO L273 TraceCheckUtils]: 74: Hoare triple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:06:53,103 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {4244#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4266#(and (<= main_~x~0 22) (<= 22 main_~x~0))} #39#return; {4267#(and (<= |main_#t~ret0| 24) (<= 24 |main_#t~ret0|))} is VALID [2018-11-23 13:06:53,104 INFO L273 TraceCheckUtils]: 76: Hoare triple {4267#(and (<= |main_#t~ret0| 24) (<= 24 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {4500#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:06:53,105 INFO L273 TraceCheckUtils]: 77: Hoare triple {4500#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {4242#false} is VALID [2018-11-23 13:06:53,105 INFO L256 TraceCheckUtils]: 78: Hoare triple {4242#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {4242#false} is VALID [2018-11-23 13:06:53,105 INFO L273 TraceCheckUtils]: 79: Hoare triple {4242#false} ~cond := #in~cond; {4242#false} is VALID [2018-11-23 13:06:53,105 INFO L273 TraceCheckUtils]: 80: Hoare triple {4242#false} assume 0 == ~cond; {4242#false} is VALID [2018-11-23 13:06:53,106 INFO L273 TraceCheckUtils]: 81: Hoare triple {4242#false} assume !false; {4242#false} is VALID [2018-11-23 13:06:53,119 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2018-11-23 13:06:53,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:53,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-11-23 13:06:53,139 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 82 [2018-11-23 13:06:53,139 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:53,140 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-23 13:06:53,246 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-23 13:06:53,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 13:06:53,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 13:06:53,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=744, Unknown=0, NotChecked=0, Total=812 [2018-11-23 13:06:53,248 INFO L87 Difference]: Start difference. First operand 50 states and 61 transitions. Second operand 29 states. [2018-11-23 13:06:56,085 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-23 13:07:00,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:00,740 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2018-11-23 13:07:00,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 13:07:00,740 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 82 [2018-11-23 13:07:00,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:00,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 13:07:00,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 73 transitions. [2018-11-23 13:07:00,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 13:07:00,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 73 transitions. [2018-11-23 13:07:00,746 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 73 transitions. [2018-11-23 13:07:01,350 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:01,351 INFO L225 Difference]: With dead ends: 60 [2018-11-23 13:07:01,352 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 13:07:01,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 79 SyntacticMatches, 15 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=128, Invalid=1512, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 13:07:01,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 13:07:01,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2018-11-23 13:07:01,395 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:01,396 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 53 states. [2018-11-23 13:07:01,396 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 53 states. [2018-11-23 13:07:01,396 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 53 states. [2018-11-23 13:07:01,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:01,398 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2018-11-23 13:07:01,398 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2018-11-23 13:07:01,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:01,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:01,399 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 55 states. [2018-11-23 13:07:01,399 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 55 states. [2018-11-23 13:07:01,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:01,401 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2018-11-23 13:07:01,401 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2018-11-23 13:07:01,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:01,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:01,402 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:01,402 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:01,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 13:07:01,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2018-11-23 13:07:01,405 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 82 [2018-11-23 13:07:01,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:01,405 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2018-11-23 13:07:01,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 13:07:01,405 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2018-11-23 13:07:01,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-23 13:07:01,406 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:01,407 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:01,407 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:01,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:01,407 INFO L82 PathProgramCache]: Analyzing trace with hash -50981570, now seen corresponding path program 13 times [2018-11-23 13:07:01,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:01,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:01,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:01,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:07:01,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:01,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:02,194 INFO L256 TraceCheckUtils]: 0: Hoare triple {4833#true} call ULTIMATE.init(); {4833#true} is VALID [2018-11-23 13:07:02,194 INFO L273 TraceCheckUtils]: 1: Hoare triple {4833#true} assume true; {4833#true} is VALID [2018-11-23 13:07:02,194 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4833#true} {4833#true} #35#return; {4833#true} is VALID [2018-11-23 13:07:02,194 INFO L256 TraceCheckUtils]: 3: Hoare triple {4833#true} call #t~ret1 := main(); {4833#true} is VALID [2018-11-23 13:07:02,195 INFO L273 TraceCheckUtils]: 4: Hoare triple {4833#true} ~x~0 := 0; {4835#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:02,196 INFO L273 TraceCheckUtils]: 5: Hoare triple {4835#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4835#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:02,196 INFO L256 TraceCheckUtils]: 6: Hoare triple {4835#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {4833#true} is VALID [2018-11-23 13:07:02,196 INFO L273 TraceCheckUtils]: 7: Hoare triple {4833#true} ~z := #in~z;#res := 2 + ~z; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:02,197 INFO L273 TraceCheckUtils]: 8: Hoare triple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:02,199 INFO L268 TraceCheckUtils]: 9: Hoare quadruple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4835#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #39#return; {4837#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-23 13:07:02,200 INFO L273 TraceCheckUtils]: 10: Hoare triple {4837#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {4838#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:02,201 INFO L273 TraceCheckUtils]: 11: Hoare triple {4838#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {4838#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:02,201 INFO L256 TraceCheckUtils]: 12: Hoare triple {4838#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {4833#true} is VALID [2018-11-23 13:07:02,202 INFO L273 TraceCheckUtils]: 13: Hoare triple {4833#true} ~z := #in~z;#res := 2 + ~z; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:02,202 INFO L273 TraceCheckUtils]: 14: Hoare triple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:02,205 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4838#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #39#return; {4839#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-23 13:07:02,206 INFO L273 TraceCheckUtils]: 16: Hoare triple {4839#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {4840#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:02,206 INFO L273 TraceCheckUtils]: 17: Hoare triple {4840#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {4840#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:02,207 INFO L256 TraceCheckUtils]: 18: Hoare triple {4840#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {4833#true} is VALID [2018-11-23 13:07:02,207 INFO L273 TraceCheckUtils]: 19: Hoare triple {4833#true} ~z := #in~z;#res := 2 + ~z; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:02,208 INFO L273 TraceCheckUtils]: 20: Hoare triple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:02,209 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4840#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #39#return; {4841#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-23 13:07:02,210 INFO L273 TraceCheckUtils]: 22: Hoare triple {4841#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {4842#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:02,210 INFO L273 TraceCheckUtils]: 23: Hoare triple {4842#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4842#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:02,211 INFO L256 TraceCheckUtils]: 24: Hoare triple {4842#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call #t~ret0 := f(~x~0); {4833#true} is VALID [2018-11-23 13:07:02,211 INFO L273 TraceCheckUtils]: 25: Hoare triple {4833#true} ~z := #in~z;#res := 2 + ~z; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:02,212 INFO L273 TraceCheckUtils]: 26: Hoare triple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:02,214 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4842#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #39#return; {4843#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} is VALID [2018-11-23 13:07:02,215 INFO L273 TraceCheckUtils]: 28: Hoare triple {4843#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {4844#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:02,216 INFO L273 TraceCheckUtils]: 29: Hoare triple {4844#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {4844#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:02,216 INFO L256 TraceCheckUtils]: 30: Hoare triple {4844#(and (<= 8 main_~x~0) (<= main_~x~0 8))} call #t~ret0 := f(~x~0); {4833#true} is VALID [2018-11-23 13:07:02,217 INFO L273 TraceCheckUtils]: 31: Hoare triple {4833#true} ~z := #in~z;#res := 2 + ~z; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:02,217 INFO L273 TraceCheckUtils]: 32: Hoare triple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:02,219 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4844#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #39#return; {4845#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} is VALID [2018-11-23 13:07:02,220 INFO L273 TraceCheckUtils]: 34: Hoare triple {4845#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {4846#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:02,221 INFO L273 TraceCheckUtils]: 35: Hoare triple {4846#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4846#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:02,221 INFO L256 TraceCheckUtils]: 36: Hoare triple {4846#(and (<= main_~x~0 10) (<= 10 main_~x~0))} call #t~ret0 := f(~x~0); {4833#true} is VALID [2018-11-23 13:07:02,222 INFO L273 TraceCheckUtils]: 37: Hoare triple {4833#true} ~z := #in~z;#res := 2 + ~z; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:02,223 INFO L273 TraceCheckUtils]: 38: Hoare triple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:02,225 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4846#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #39#return; {4847#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} is VALID [2018-11-23 13:07:02,226 INFO L273 TraceCheckUtils]: 40: Hoare triple {4847#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {4848#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:02,226 INFO L273 TraceCheckUtils]: 41: Hoare triple {4848#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4848#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:02,226 INFO L256 TraceCheckUtils]: 42: Hoare triple {4848#(and (<= main_~x~0 12) (<= 12 main_~x~0))} call #t~ret0 := f(~x~0); {4833#true} is VALID [2018-11-23 13:07:02,227 INFO L273 TraceCheckUtils]: 43: Hoare triple {4833#true} ~z := #in~z;#res := 2 + ~z; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:02,227 INFO L273 TraceCheckUtils]: 44: Hoare triple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:02,229 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4848#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #39#return; {4849#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} is VALID [2018-11-23 13:07:02,230 INFO L273 TraceCheckUtils]: 46: Hoare triple {4849#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {4850#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:02,230 INFO L273 TraceCheckUtils]: 47: Hoare triple {4850#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4850#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:02,231 INFO L256 TraceCheckUtils]: 48: Hoare triple {4850#(and (<= main_~x~0 14) (<= 14 main_~x~0))} call #t~ret0 := f(~x~0); {4833#true} is VALID [2018-11-23 13:07:02,231 INFO L273 TraceCheckUtils]: 49: Hoare triple {4833#true} ~z := #in~z;#res := 2 + ~z; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:02,232 INFO L273 TraceCheckUtils]: 50: Hoare triple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:02,234 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4850#(and (<= main_~x~0 14) (<= 14 main_~x~0))} #39#return; {4851#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} is VALID [2018-11-23 13:07:02,235 INFO L273 TraceCheckUtils]: 52: Hoare triple {4851#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} ~x~0 := #t~ret0;havoc #t~ret0; {4852#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:02,236 INFO L273 TraceCheckUtils]: 53: Hoare triple {4852#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4852#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:02,236 INFO L256 TraceCheckUtils]: 54: Hoare triple {4852#(and (<= main_~x~0 16) (<= 16 main_~x~0))} call #t~ret0 := f(~x~0); {4833#true} is VALID [2018-11-23 13:07:02,237 INFO L273 TraceCheckUtils]: 55: Hoare triple {4833#true} ~z := #in~z;#res := 2 + ~z; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:02,237 INFO L273 TraceCheckUtils]: 56: Hoare triple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:02,240 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4852#(and (<= main_~x~0 16) (<= 16 main_~x~0))} #39#return; {4853#(and (<= 18 |main_#t~ret0|) (<= |main_#t~ret0| 18))} is VALID [2018-11-23 13:07:02,241 INFO L273 TraceCheckUtils]: 58: Hoare triple {4853#(and (<= 18 |main_#t~ret0|) (<= |main_#t~ret0| 18))} ~x~0 := #t~ret0;havoc #t~ret0; {4854#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:02,241 INFO L273 TraceCheckUtils]: 59: Hoare triple {4854#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4854#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:02,242 INFO L256 TraceCheckUtils]: 60: Hoare triple {4854#(and (<= main_~x~0 18) (<= 18 main_~x~0))} call #t~ret0 := f(~x~0); {4833#true} is VALID [2018-11-23 13:07:02,242 INFO L273 TraceCheckUtils]: 61: Hoare triple {4833#true} ~z := #in~z;#res := 2 + ~z; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:02,243 INFO L273 TraceCheckUtils]: 62: Hoare triple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:02,246 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4854#(and (<= main_~x~0 18) (<= 18 main_~x~0))} #39#return; {4855#(and (<= 20 |main_#t~ret0|) (<= |main_#t~ret0| 20))} is VALID [2018-11-23 13:07:02,246 INFO L273 TraceCheckUtils]: 64: Hoare triple {4855#(and (<= 20 |main_#t~ret0|) (<= |main_#t~ret0| 20))} ~x~0 := #t~ret0;havoc #t~ret0; {4856#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:02,247 INFO L273 TraceCheckUtils]: 65: Hoare triple {4856#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455); {4856#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:02,247 INFO L256 TraceCheckUtils]: 66: Hoare triple {4856#(and (<= 20 main_~x~0) (<= main_~x~0 20))} call #t~ret0 := f(~x~0); {4833#true} is VALID [2018-11-23 13:07:02,248 INFO L273 TraceCheckUtils]: 67: Hoare triple {4833#true} ~z := #in~z;#res := 2 + ~z; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:02,249 INFO L273 TraceCheckUtils]: 68: Hoare triple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:02,251 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4856#(and (<= 20 main_~x~0) (<= main_~x~0 20))} #39#return; {4857#(and (<= 22 |main_#t~ret0|) (<= |main_#t~ret0| 22))} is VALID [2018-11-23 13:07:02,252 INFO L273 TraceCheckUtils]: 70: Hoare triple {4857#(and (<= 22 |main_#t~ret0|) (<= |main_#t~ret0| 22))} ~x~0 := #t~ret0;havoc #t~ret0; {4858#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:07:02,253 INFO L273 TraceCheckUtils]: 71: Hoare triple {4858#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4858#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:07:02,253 INFO L256 TraceCheckUtils]: 72: Hoare triple {4858#(and (<= main_~x~0 22) (<= 22 main_~x~0))} call #t~ret0 := f(~x~0); {4833#true} is VALID [2018-11-23 13:07:02,254 INFO L273 TraceCheckUtils]: 73: Hoare triple {4833#true} ~z := #in~z;#res := 2 + ~z; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:02,255 INFO L273 TraceCheckUtils]: 74: Hoare triple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:02,257 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4858#(and (<= main_~x~0 22) (<= 22 main_~x~0))} #39#return; {4859#(and (<= |main_#t~ret0| 24) (<= 24 |main_#t~ret0|))} is VALID [2018-11-23 13:07:02,258 INFO L273 TraceCheckUtils]: 76: Hoare triple {4859#(and (<= |main_#t~ret0| 24) (<= 24 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {4860#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:07:02,259 INFO L273 TraceCheckUtils]: 77: Hoare triple {4860#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4860#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:07:02,259 INFO L256 TraceCheckUtils]: 78: Hoare triple {4860#(and (<= main_~x~0 24) (<= 24 main_~x~0))} call #t~ret0 := f(~x~0); {4833#true} is VALID [2018-11-23 13:07:02,259 INFO L273 TraceCheckUtils]: 79: Hoare triple {4833#true} ~z := #in~z;#res := 2 + ~z; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:02,260 INFO L273 TraceCheckUtils]: 80: Hoare triple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:02,262 INFO L268 TraceCheckUtils]: 81: Hoare quadruple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4860#(and (<= main_~x~0 24) (<= 24 main_~x~0))} #39#return; {4861#(and (<= 26 |main_#t~ret0|) (<= |main_#t~ret0| 26))} is VALID [2018-11-23 13:07:02,262 INFO L273 TraceCheckUtils]: 82: Hoare triple {4861#(and (<= 26 |main_#t~ret0|) (<= |main_#t~ret0| 26))} ~x~0 := #t~ret0;havoc #t~ret0; {4862#(and (<= main_~x~0 26) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:07:02,263 INFO L273 TraceCheckUtils]: 83: Hoare triple {4862#(and (<= main_~x~0 26) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {4834#false} is VALID [2018-11-23 13:07:02,263 INFO L256 TraceCheckUtils]: 84: Hoare triple {4834#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {4834#false} is VALID [2018-11-23 13:07:02,264 INFO L273 TraceCheckUtils]: 85: Hoare triple {4834#false} ~cond := #in~cond; {4834#false} is VALID [2018-11-23 13:07:02,264 INFO L273 TraceCheckUtils]: 86: Hoare triple {4834#false} assume 0 == ~cond; {4834#false} is VALID [2018-11-23 13:07:02,264 INFO L273 TraceCheckUtils]: 87: Hoare triple {4834#false} assume !false; {4834#false} is VALID [2018-11-23 13:07:02,280 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-11-23 13:07:02,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:02,280 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:07:02,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:07:02,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:02,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:02,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:02,820 INFO L256 TraceCheckUtils]: 0: Hoare triple {4833#true} call ULTIMATE.init(); {4833#true} is VALID [2018-11-23 13:07:02,820 INFO L273 TraceCheckUtils]: 1: Hoare triple {4833#true} assume true; {4833#true} is VALID [2018-11-23 13:07:02,820 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4833#true} {4833#true} #35#return; {4833#true} is VALID [2018-11-23 13:07:02,820 INFO L256 TraceCheckUtils]: 3: Hoare triple {4833#true} call #t~ret1 := main(); {4833#true} is VALID [2018-11-23 13:07:02,821 INFO L273 TraceCheckUtils]: 4: Hoare triple {4833#true} ~x~0 := 0; {4835#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:02,821 INFO L273 TraceCheckUtils]: 5: Hoare triple {4835#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4835#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:02,822 INFO L256 TraceCheckUtils]: 6: Hoare triple {4835#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {4833#true} is VALID [2018-11-23 13:07:02,822 INFO L273 TraceCheckUtils]: 7: Hoare triple {4833#true} ~z := #in~z;#res := 2 + ~z; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:02,823 INFO L273 TraceCheckUtils]: 8: Hoare triple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:02,825 INFO L268 TraceCheckUtils]: 9: Hoare quadruple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4835#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #39#return; {4837#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-23 13:07:02,825 INFO L273 TraceCheckUtils]: 10: Hoare triple {4837#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {4838#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:02,826 INFO L273 TraceCheckUtils]: 11: Hoare triple {4838#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {4838#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:02,826 INFO L256 TraceCheckUtils]: 12: Hoare triple {4838#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {4833#true} is VALID [2018-11-23 13:07:02,827 INFO L273 TraceCheckUtils]: 13: Hoare triple {4833#true} ~z := #in~z;#res := 2 + ~z; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:02,827 INFO L273 TraceCheckUtils]: 14: Hoare triple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:02,830 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4838#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #39#return; {4839#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-23 13:07:02,831 INFO L273 TraceCheckUtils]: 16: Hoare triple {4839#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {4840#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:02,831 INFO L273 TraceCheckUtils]: 17: Hoare triple {4840#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {4840#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:02,832 INFO L256 TraceCheckUtils]: 18: Hoare triple {4840#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {4833#true} is VALID [2018-11-23 13:07:02,832 INFO L273 TraceCheckUtils]: 19: Hoare triple {4833#true} ~z := #in~z;#res := 2 + ~z; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:02,833 INFO L273 TraceCheckUtils]: 20: Hoare triple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:02,835 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4840#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #39#return; {4841#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-23 13:07:02,836 INFO L273 TraceCheckUtils]: 22: Hoare triple {4841#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {4842#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:02,837 INFO L273 TraceCheckUtils]: 23: Hoare triple {4842#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4842#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:02,837 INFO L256 TraceCheckUtils]: 24: Hoare triple {4842#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call #t~ret0 := f(~x~0); {4833#true} is VALID [2018-11-23 13:07:02,839 INFO L273 TraceCheckUtils]: 25: Hoare triple {4833#true} ~z := #in~z;#res := 2 + ~z; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:02,840 INFO L273 TraceCheckUtils]: 26: Hoare triple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:02,842 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4842#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #39#return; {4843#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} is VALID [2018-11-23 13:07:02,843 INFO L273 TraceCheckUtils]: 28: Hoare triple {4843#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {4844#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:02,844 INFO L273 TraceCheckUtils]: 29: Hoare triple {4844#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {4844#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:02,844 INFO L256 TraceCheckUtils]: 30: Hoare triple {4844#(and (<= 8 main_~x~0) (<= main_~x~0 8))} call #t~ret0 := f(~x~0); {4833#true} is VALID [2018-11-23 13:07:02,845 INFO L273 TraceCheckUtils]: 31: Hoare triple {4833#true} ~z := #in~z;#res := 2 + ~z; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:02,846 INFO L273 TraceCheckUtils]: 32: Hoare triple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:02,848 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4844#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #39#return; {4845#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} is VALID [2018-11-23 13:07:02,849 INFO L273 TraceCheckUtils]: 34: Hoare triple {4845#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {4846#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:02,849 INFO L273 TraceCheckUtils]: 35: Hoare triple {4846#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4846#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:02,850 INFO L256 TraceCheckUtils]: 36: Hoare triple {4846#(and (<= main_~x~0 10) (<= 10 main_~x~0))} call #t~ret0 := f(~x~0); {4833#true} is VALID [2018-11-23 13:07:02,850 INFO L273 TraceCheckUtils]: 37: Hoare triple {4833#true} ~z := #in~z;#res := 2 + ~z; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:02,851 INFO L273 TraceCheckUtils]: 38: Hoare triple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:02,853 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4846#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #39#return; {4847#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} is VALID [2018-11-23 13:07:02,854 INFO L273 TraceCheckUtils]: 40: Hoare triple {4847#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {4848#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:02,855 INFO L273 TraceCheckUtils]: 41: Hoare triple {4848#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4848#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:02,855 INFO L256 TraceCheckUtils]: 42: Hoare triple {4848#(and (<= main_~x~0 12) (<= 12 main_~x~0))} call #t~ret0 := f(~x~0); {4833#true} is VALID [2018-11-23 13:07:02,856 INFO L273 TraceCheckUtils]: 43: Hoare triple {4833#true} ~z := #in~z;#res := 2 + ~z; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:02,857 INFO L273 TraceCheckUtils]: 44: Hoare triple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:02,859 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4848#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #39#return; {4849#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} is VALID [2018-11-23 13:07:02,860 INFO L273 TraceCheckUtils]: 46: Hoare triple {4849#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {4850#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:02,861 INFO L273 TraceCheckUtils]: 47: Hoare triple {4850#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4850#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:02,861 INFO L256 TraceCheckUtils]: 48: Hoare triple {4850#(and (<= main_~x~0 14) (<= 14 main_~x~0))} call #t~ret0 := f(~x~0); {4833#true} is VALID [2018-11-23 13:07:02,861 INFO L273 TraceCheckUtils]: 49: Hoare triple {4833#true} ~z := #in~z;#res := 2 + ~z; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:02,862 INFO L273 TraceCheckUtils]: 50: Hoare triple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:02,863 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4850#(and (<= main_~x~0 14) (<= 14 main_~x~0))} #39#return; {4851#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} is VALID [2018-11-23 13:07:02,864 INFO L273 TraceCheckUtils]: 52: Hoare triple {4851#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} ~x~0 := #t~ret0;havoc #t~ret0; {4852#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:02,865 INFO L273 TraceCheckUtils]: 53: Hoare triple {4852#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4852#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:02,865 INFO L256 TraceCheckUtils]: 54: Hoare triple {4852#(and (<= main_~x~0 16) (<= 16 main_~x~0))} call #t~ret0 := f(~x~0); {4833#true} is VALID [2018-11-23 13:07:02,866 INFO L273 TraceCheckUtils]: 55: Hoare triple {4833#true} ~z := #in~z;#res := 2 + ~z; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:02,866 INFO L273 TraceCheckUtils]: 56: Hoare triple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:02,869 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4852#(and (<= main_~x~0 16) (<= 16 main_~x~0))} #39#return; {4853#(and (<= 18 |main_#t~ret0|) (<= |main_#t~ret0| 18))} is VALID [2018-11-23 13:07:02,887 INFO L273 TraceCheckUtils]: 58: Hoare triple {4853#(and (<= 18 |main_#t~ret0|) (<= |main_#t~ret0| 18))} ~x~0 := #t~ret0;havoc #t~ret0; {4854#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:02,888 INFO L273 TraceCheckUtils]: 59: Hoare triple {4854#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4854#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:02,888 INFO L256 TraceCheckUtils]: 60: Hoare triple {4854#(and (<= main_~x~0 18) (<= 18 main_~x~0))} call #t~ret0 := f(~x~0); {4833#true} is VALID [2018-11-23 13:07:02,888 INFO L273 TraceCheckUtils]: 61: Hoare triple {4833#true} ~z := #in~z;#res := 2 + ~z; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:02,889 INFO L273 TraceCheckUtils]: 62: Hoare triple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:02,891 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4854#(and (<= main_~x~0 18) (<= 18 main_~x~0))} #39#return; {4855#(and (<= 20 |main_#t~ret0|) (<= |main_#t~ret0| 20))} is VALID [2018-11-23 13:07:02,891 INFO L273 TraceCheckUtils]: 64: Hoare triple {4855#(and (<= 20 |main_#t~ret0|) (<= |main_#t~ret0| 20))} ~x~0 := #t~ret0;havoc #t~ret0; {4856#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:02,892 INFO L273 TraceCheckUtils]: 65: Hoare triple {4856#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455); {4856#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:02,892 INFO L256 TraceCheckUtils]: 66: Hoare triple {4856#(and (<= 20 main_~x~0) (<= main_~x~0 20))} call #t~ret0 := f(~x~0); {4833#true} is VALID [2018-11-23 13:07:02,892 INFO L273 TraceCheckUtils]: 67: Hoare triple {4833#true} ~z := #in~z;#res := 2 + ~z; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:02,893 INFO L273 TraceCheckUtils]: 68: Hoare triple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:02,895 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4856#(and (<= 20 main_~x~0) (<= main_~x~0 20))} #39#return; {4857#(and (<= 22 |main_#t~ret0|) (<= |main_#t~ret0| 22))} is VALID [2018-11-23 13:07:02,896 INFO L273 TraceCheckUtils]: 70: Hoare triple {4857#(and (<= 22 |main_#t~ret0|) (<= |main_#t~ret0| 22))} ~x~0 := #t~ret0;havoc #t~ret0; {4858#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:07:02,897 INFO L273 TraceCheckUtils]: 71: Hoare triple {4858#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4858#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:07:02,897 INFO L256 TraceCheckUtils]: 72: Hoare triple {4858#(and (<= main_~x~0 22) (<= 22 main_~x~0))} call #t~ret0 := f(~x~0); {4833#true} is VALID [2018-11-23 13:07:02,897 INFO L273 TraceCheckUtils]: 73: Hoare triple {4833#true} ~z := #in~z;#res := 2 + ~z; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:02,898 INFO L273 TraceCheckUtils]: 74: Hoare triple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:02,900 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4858#(and (<= main_~x~0 22) (<= 22 main_~x~0))} #39#return; {4859#(and (<= |main_#t~ret0| 24) (<= 24 |main_#t~ret0|))} is VALID [2018-11-23 13:07:02,900 INFO L273 TraceCheckUtils]: 76: Hoare triple {4859#(and (<= |main_#t~ret0| 24) (<= 24 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {4860#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:07:02,903 INFO L273 TraceCheckUtils]: 77: Hoare triple {4860#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {4860#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:07:02,903 INFO L256 TraceCheckUtils]: 78: Hoare triple {4860#(and (<= main_~x~0 24) (<= 24 main_~x~0))} call #t~ret0 := f(~x~0); {4833#true} is VALID [2018-11-23 13:07:02,904 INFO L273 TraceCheckUtils]: 79: Hoare triple {4833#true} ~z := #in~z;#res := 2 + ~z; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:02,904 INFO L273 TraceCheckUtils]: 80: Hoare triple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:02,907 INFO L268 TraceCheckUtils]: 81: Hoare quadruple {4836#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {4860#(and (<= main_~x~0 24) (<= 24 main_~x~0))} #39#return; {4861#(and (<= 26 |main_#t~ret0|) (<= |main_#t~ret0| 26))} is VALID [2018-11-23 13:07:02,908 INFO L273 TraceCheckUtils]: 82: Hoare triple {4861#(and (<= 26 |main_#t~ret0|) (<= |main_#t~ret0| 26))} ~x~0 := #t~ret0;havoc #t~ret0; {5112#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:07:02,909 INFO L273 TraceCheckUtils]: 83: Hoare triple {5112#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {4834#false} is VALID [2018-11-23 13:07:02,909 INFO L256 TraceCheckUtils]: 84: Hoare triple {4834#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {4834#false} is VALID [2018-11-23 13:07:02,909 INFO L273 TraceCheckUtils]: 85: Hoare triple {4834#false} ~cond := #in~cond; {4834#false} is VALID [2018-11-23 13:07:02,909 INFO L273 TraceCheckUtils]: 86: Hoare triple {4834#false} assume 0 == ~cond; {4834#false} is VALID [2018-11-23 13:07:02,910 INFO L273 TraceCheckUtils]: 87: Hoare triple {4834#false} assume !false; {4834#false} is VALID [2018-11-23 13:07:02,920 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-11-23 13:07:02,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:02,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2018-11-23 13:07:02,940 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 88 [2018-11-23 13:07:02,940 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:02,940 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-23 13:07:03,003 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-23 13:07:03,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-23 13:07:03,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 13:07:03,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=857, Unknown=0, NotChecked=0, Total=930 [2018-11-23 13:07:03,005 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. Second operand 31 states. [2018-11-23 13:07:07,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:07,394 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2018-11-23 13:07:07,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 13:07:07,394 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 88 [2018-11-23 13:07:07,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:07,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 13:07:07,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 77 transitions. [2018-11-23 13:07:07,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 13:07:07,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 77 transitions. [2018-11-23 13:07:07,400 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 77 transitions. [2018-11-23 13:07:08,370 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-23 13:07:08,371 INFO L225 Difference]: With dead ends: 63 [2018-11-23 13:07:08,371 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 13:07:08,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 86 SyntacticMatches, 15 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=138, Invalid=1754, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 13:07:08,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 13:07:08,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-11-23 13:07:08,639 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:08,639 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 56 states. [2018-11-23 13:07:08,639 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 56 states. [2018-11-23 13:07:08,640 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 56 states. [2018-11-23 13:07:08,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:08,642 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2018-11-23 13:07:08,642 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2018-11-23 13:07:08,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:08,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:08,643 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 58 states. [2018-11-23 13:07:08,643 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 58 states. [2018-11-23 13:07:08,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:08,645 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2018-11-23 13:07:08,646 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2018-11-23 13:07:08,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:08,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:08,646 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:08,646 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:08,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 13:07:08,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 69 transitions. [2018-11-23 13:07:08,649 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 69 transitions. Word has length 88 [2018-11-23 13:07:08,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:08,649 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 69 transitions. [2018-11-23 13:07:08,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-23 13:07:08,649 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 69 transitions. [2018-11-23 13:07:08,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-23 13:07:08,650 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:08,650 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:08,651 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:08,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:08,651 INFO L82 PathProgramCache]: Analyzing trace with hash -922870948, now seen corresponding path program 14 times [2018-11-23 13:07:08,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:08,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:08,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:08,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:07:08,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:08,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:10,245 INFO L256 TraceCheckUtils]: 0: Hoare triple {5463#true} call ULTIMATE.init(); {5463#true} is VALID [2018-11-23 13:07:10,245 INFO L273 TraceCheckUtils]: 1: Hoare triple {5463#true} assume true; {5463#true} is VALID [2018-11-23 13:07:10,246 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5463#true} {5463#true} #35#return; {5463#true} is VALID [2018-11-23 13:07:10,246 INFO L256 TraceCheckUtils]: 3: Hoare triple {5463#true} call #t~ret1 := main(); {5463#true} is VALID [2018-11-23 13:07:10,246 INFO L273 TraceCheckUtils]: 4: Hoare triple {5463#true} ~x~0 := 0; {5465#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:10,247 INFO L273 TraceCheckUtils]: 5: Hoare triple {5465#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5465#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:10,247 INFO L256 TraceCheckUtils]: 6: Hoare triple {5465#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {5463#true} is VALID [2018-11-23 13:07:10,248 INFO L273 TraceCheckUtils]: 7: Hoare triple {5463#true} ~z := #in~z;#res := 2 + ~z; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:10,249 INFO L273 TraceCheckUtils]: 8: Hoare triple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:10,251 INFO L268 TraceCheckUtils]: 9: Hoare quadruple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {5465#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #39#return; {5467#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-23 13:07:10,252 INFO L273 TraceCheckUtils]: 10: Hoare triple {5467#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {5468#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:10,252 INFO L273 TraceCheckUtils]: 11: Hoare triple {5468#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {5468#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:10,253 INFO L256 TraceCheckUtils]: 12: Hoare triple {5468#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {5463#true} is VALID [2018-11-23 13:07:10,253 INFO L273 TraceCheckUtils]: 13: Hoare triple {5463#true} ~z := #in~z;#res := 2 + ~z; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:10,254 INFO L273 TraceCheckUtils]: 14: Hoare triple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:10,256 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {5468#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #39#return; {5469#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-23 13:07:10,257 INFO L273 TraceCheckUtils]: 16: Hoare triple {5469#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {5470#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:10,258 INFO L273 TraceCheckUtils]: 17: Hoare triple {5470#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {5470#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:10,258 INFO L256 TraceCheckUtils]: 18: Hoare triple {5470#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {5463#true} is VALID [2018-11-23 13:07:10,259 INFO L273 TraceCheckUtils]: 19: Hoare triple {5463#true} ~z := #in~z;#res := 2 + ~z; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:10,259 INFO L273 TraceCheckUtils]: 20: Hoare triple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:10,261 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {5470#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #39#return; {5471#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-23 13:07:10,262 INFO L273 TraceCheckUtils]: 22: Hoare triple {5471#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {5472#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:10,263 INFO L273 TraceCheckUtils]: 23: Hoare triple {5472#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5472#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:10,263 INFO L256 TraceCheckUtils]: 24: Hoare triple {5472#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call #t~ret0 := f(~x~0); {5463#true} is VALID [2018-11-23 13:07:10,264 INFO L273 TraceCheckUtils]: 25: Hoare triple {5463#true} ~z := #in~z;#res := 2 + ~z; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:10,264 INFO L273 TraceCheckUtils]: 26: Hoare triple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:10,266 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {5472#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #39#return; {5473#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} is VALID [2018-11-23 13:07:10,267 INFO L273 TraceCheckUtils]: 28: Hoare triple {5473#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {5474#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:10,268 INFO L273 TraceCheckUtils]: 29: Hoare triple {5474#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {5474#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:10,268 INFO L256 TraceCheckUtils]: 30: Hoare triple {5474#(and (<= 8 main_~x~0) (<= main_~x~0 8))} call #t~ret0 := f(~x~0); {5463#true} is VALID [2018-11-23 13:07:10,269 INFO L273 TraceCheckUtils]: 31: Hoare triple {5463#true} ~z := #in~z;#res := 2 + ~z; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:10,270 INFO L273 TraceCheckUtils]: 32: Hoare triple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:10,272 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {5474#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #39#return; {5475#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} is VALID [2018-11-23 13:07:10,272 INFO L273 TraceCheckUtils]: 34: Hoare triple {5475#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {5476#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:10,273 INFO L273 TraceCheckUtils]: 35: Hoare triple {5476#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5476#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:10,273 INFO L256 TraceCheckUtils]: 36: Hoare triple {5476#(and (<= main_~x~0 10) (<= 10 main_~x~0))} call #t~ret0 := f(~x~0); {5463#true} is VALID [2018-11-23 13:07:10,274 INFO L273 TraceCheckUtils]: 37: Hoare triple {5463#true} ~z := #in~z;#res := 2 + ~z; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:10,275 INFO L273 TraceCheckUtils]: 38: Hoare triple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:10,277 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {5476#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #39#return; {5477#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} is VALID [2018-11-23 13:07:10,278 INFO L273 TraceCheckUtils]: 40: Hoare triple {5477#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {5478#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:10,278 INFO L273 TraceCheckUtils]: 41: Hoare triple {5478#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5478#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:10,279 INFO L256 TraceCheckUtils]: 42: Hoare triple {5478#(and (<= main_~x~0 12) (<= 12 main_~x~0))} call #t~ret0 := f(~x~0); {5463#true} is VALID [2018-11-23 13:07:10,279 INFO L273 TraceCheckUtils]: 43: Hoare triple {5463#true} ~z := #in~z;#res := 2 + ~z; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:10,280 INFO L273 TraceCheckUtils]: 44: Hoare triple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:10,282 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {5478#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #39#return; {5479#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} is VALID [2018-11-23 13:07:10,283 INFO L273 TraceCheckUtils]: 46: Hoare triple {5479#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {5480#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:10,284 INFO L273 TraceCheckUtils]: 47: Hoare triple {5480#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5480#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:10,284 INFO L256 TraceCheckUtils]: 48: Hoare triple {5480#(and (<= main_~x~0 14) (<= 14 main_~x~0))} call #t~ret0 := f(~x~0); {5463#true} is VALID [2018-11-23 13:07:10,285 INFO L273 TraceCheckUtils]: 49: Hoare triple {5463#true} ~z := #in~z;#res := 2 + ~z; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:10,285 INFO L273 TraceCheckUtils]: 50: Hoare triple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:10,287 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {5480#(and (<= main_~x~0 14) (<= 14 main_~x~0))} #39#return; {5481#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} is VALID [2018-11-23 13:07:10,288 INFO L273 TraceCheckUtils]: 52: Hoare triple {5481#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} ~x~0 := #t~ret0;havoc #t~ret0; {5482#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:10,289 INFO L273 TraceCheckUtils]: 53: Hoare triple {5482#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5482#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:10,289 INFO L256 TraceCheckUtils]: 54: Hoare triple {5482#(and (<= main_~x~0 16) (<= 16 main_~x~0))} call #t~ret0 := f(~x~0); {5463#true} is VALID [2018-11-23 13:07:10,290 INFO L273 TraceCheckUtils]: 55: Hoare triple {5463#true} ~z := #in~z;#res := 2 + ~z; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:10,290 INFO L273 TraceCheckUtils]: 56: Hoare triple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:10,292 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {5482#(and (<= main_~x~0 16) (<= 16 main_~x~0))} #39#return; {5483#(and (<= 18 |main_#t~ret0|) (<= |main_#t~ret0| 18))} is VALID [2018-11-23 13:07:10,293 INFO L273 TraceCheckUtils]: 58: Hoare triple {5483#(and (<= 18 |main_#t~ret0|) (<= |main_#t~ret0| 18))} ~x~0 := #t~ret0;havoc #t~ret0; {5484#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:10,294 INFO L273 TraceCheckUtils]: 59: Hoare triple {5484#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5484#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:10,294 INFO L256 TraceCheckUtils]: 60: Hoare triple {5484#(and (<= main_~x~0 18) (<= 18 main_~x~0))} call #t~ret0 := f(~x~0); {5463#true} is VALID [2018-11-23 13:07:10,295 INFO L273 TraceCheckUtils]: 61: Hoare triple {5463#true} ~z := #in~z;#res := 2 + ~z; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:10,296 INFO L273 TraceCheckUtils]: 62: Hoare triple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:10,298 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {5484#(and (<= main_~x~0 18) (<= 18 main_~x~0))} #39#return; {5485#(and (<= 20 |main_#t~ret0|) (<= |main_#t~ret0| 20))} is VALID [2018-11-23 13:07:10,298 INFO L273 TraceCheckUtils]: 64: Hoare triple {5485#(and (<= 20 |main_#t~ret0|) (<= |main_#t~ret0| 20))} ~x~0 := #t~ret0;havoc #t~ret0; {5486#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:10,299 INFO L273 TraceCheckUtils]: 65: Hoare triple {5486#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455); {5486#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:10,299 INFO L256 TraceCheckUtils]: 66: Hoare triple {5486#(and (<= 20 main_~x~0) (<= main_~x~0 20))} call #t~ret0 := f(~x~0); {5463#true} is VALID [2018-11-23 13:07:10,300 INFO L273 TraceCheckUtils]: 67: Hoare triple {5463#true} ~z := #in~z;#res := 2 + ~z; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:10,301 INFO L273 TraceCheckUtils]: 68: Hoare triple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:10,328 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {5486#(and (<= 20 main_~x~0) (<= main_~x~0 20))} #39#return; {5487#(and (<= 22 |main_#t~ret0|) (<= |main_#t~ret0| 22))} is VALID [2018-11-23 13:07:10,333 INFO L273 TraceCheckUtils]: 70: Hoare triple {5487#(and (<= 22 |main_#t~ret0|) (<= |main_#t~ret0| 22))} ~x~0 := #t~ret0;havoc #t~ret0; {5488#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:07:10,333 INFO L273 TraceCheckUtils]: 71: Hoare triple {5488#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5488#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:07:10,333 INFO L256 TraceCheckUtils]: 72: Hoare triple {5488#(and (<= main_~x~0 22) (<= 22 main_~x~0))} call #t~ret0 := f(~x~0); {5463#true} is VALID [2018-11-23 13:07:10,335 INFO L273 TraceCheckUtils]: 73: Hoare triple {5463#true} ~z := #in~z;#res := 2 + ~z; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:10,335 INFO L273 TraceCheckUtils]: 74: Hoare triple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:10,337 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {5488#(and (<= main_~x~0 22) (<= 22 main_~x~0))} #39#return; {5489#(and (<= |main_#t~ret0| 24) (<= 24 |main_#t~ret0|))} is VALID [2018-11-23 13:07:10,337 INFO L273 TraceCheckUtils]: 76: Hoare triple {5489#(and (<= |main_#t~ret0| 24) (<= 24 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {5490#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:07:10,338 INFO L273 TraceCheckUtils]: 77: Hoare triple {5490#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5490#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:07:10,338 INFO L256 TraceCheckUtils]: 78: Hoare triple {5490#(and (<= main_~x~0 24) (<= 24 main_~x~0))} call #t~ret0 := f(~x~0); {5463#true} is VALID [2018-11-23 13:07:10,339 INFO L273 TraceCheckUtils]: 79: Hoare triple {5463#true} ~z := #in~z;#res := 2 + ~z; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:10,339 INFO L273 TraceCheckUtils]: 80: Hoare triple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:10,341 INFO L268 TraceCheckUtils]: 81: Hoare quadruple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {5490#(and (<= main_~x~0 24) (<= 24 main_~x~0))} #39#return; {5491#(and (<= 26 |main_#t~ret0|) (<= |main_#t~ret0| 26))} is VALID [2018-11-23 13:07:10,342 INFO L273 TraceCheckUtils]: 82: Hoare triple {5491#(and (<= 26 |main_#t~ret0|) (<= |main_#t~ret0| 26))} ~x~0 := #t~ret0;havoc #t~ret0; {5492#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:07:10,343 INFO L273 TraceCheckUtils]: 83: Hoare triple {5492#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5492#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:07:10,343 INFO L256 TraceCheckUtils]: 84: Hoare triple {5492#(and (<= main_~x~0 26) (<= 26 main_~x~0))} call #t~ret0 := f(~x~0); {5463#true} is VALID [2018-11-23 13:07:10,344 INFO L273 TraceCheckUtils]: 85: Hoare triple {5463#true} ~z := #in~z;#res := 2 + ~z; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:10,344 INFO L273 TraceCheckUtils]: 86: Hoare triple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:10,346 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {5492#(and (<= main_~x~0 26) (<= 26 main_~x~0))} #39#return; {5493#(and (<= 28 |main_#t~ret0|) (<= |main_#t~ret0| 28))} is VALID [2018-11-23 13:07:10,347 INFO L273 TraceCheckUtils]: 88: Hoare triple {5493#(and (<= 28 |main_#t~ret0|) (<= |main_#t~ret0| 28))} ~x~0 := #t~ret0;havoc #t~ret0; {5494#(and (<= main_~x~0 28) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:07:10,348 INFO L273 TraceCheckUtils]: 89: Hoare triple {5494#(and (<= main_~x~0 28) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {5464#false} is VALID [2018-11-23 13:07:10,349 INFO L256 TraceCheckUtils]: 90: Hoare triple {5464#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {5464#false} is VALID [2018-11-23 13:07:10,349 INFO L273 TraceCheckUtils]: 91: Hoare triple {5464#false} ~cond := #in~cond; {5464#false} is VALID [2018-11-23 13:07:10,349 INFO L273 TraceCheckUtils]: 92: Hoare triple {5464#false} assume 0 == ~cond; {5464#false} is VALID [2018-11-23 13:07:10,349 INFO L273 TraceCheckUtils]: 93: Hoare triple {5464#false} assume !false; {5464#false} is VALID [2018-11-23 13:07:10,360 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2018-11-23 13:07:10,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:10,361 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:07:10,370 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:07:10,404 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:07:10,404 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:07:10,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:10,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:11,133 INFO L256 TraceCheckUtils]: 0: Hoare triple {5463#true} call ULTIMATE.init(); {5463#true} is VALID [2018-11-23 13:07:11,133 INFO L273 TraceCheckUtils]: 1: Hoare triple {5463#true} assume true; {5463#true} is VALID [2018-11-23 13:07:11,133 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5463#true} {5463#true} #35#return; {5463#true} is VALID [2018-11-23 13:07:11,133 INFO L256 TraceCheckUtils]: 3: Hoare triple {5463#true} call #t~ret1 := main(); {5463#true} is VALID [2018-11-23 13:07:11,134 INFO L273 TraceCheckUtils]: 4: Hoare triple {5463#true} ~x~0 := 0; {5465#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:11,134 INFO L273 TraceCheckUtils]: 5: Hoare triple {5465#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5465#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:11,134 INFO L256 TraceCheckUtils]: 6: Hoare triple {5465#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {5463#true} is VALID [2018-11-23 13:07:11,135 INFO L273 TraceCheckUtils]: 7: Hoare triple {5463#true} ~z := #in~z;#res := 2 + ~z; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:11,135 INFO L273 TraceCheckUtils]: 8: Hoare triple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:11,137 INFO L268 TraceCheckUtils]: 9: Hoare quadruple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {5465#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #39#return; {5467#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-23 13:07:11,138 INFO L273 TraceCheckUtils]: 10: Hoare triple {5467#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {5468#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:11,139 INFO L273 TraceCheckUtils]: 11: Hoare triple {5468#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {5468#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:11,139 INFO L256 TraceCheckUtils]: 12: Hoare triple {5468#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {5463#true} is VALID [2018-11-23 13:07:11,139 INFO L273 TraceCheckUtils]: 13: Hoare triple {5463#true} ~z := #in~z;#res := 2 + ~z; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:11,140 INFO L273 TraceCheckUtils]: 14: Hoare triple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:11,141 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {5468#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #39#return; {5469#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-23 13:07:11,142 INFO L273 TraceCheckUtils]: 16: Hoare triple {5469#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {5470#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:11,143 INFO L273 TraceCheckUtils]: 17: Hoare triple {5470#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {5470#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:11,143 INFO L256 TraceCheckUtils]: 18: Hoare triple {5470#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {5463#true} is VALID [2018-11-23 13:07:11,144 INFO L273 TraceCheckUtils]: 19: Hoare triple {5463#true} ~z := #in~z;#res := 2 + ~z; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:11,144 INFO L273 TraceCheckUtils]: 20: Hoare triple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:11,146 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {5470#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #39#return; {5471#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-23 13:07:11,147 INFO L273 TraceCheckUtils]: 22: Hoare triple {5471#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {5472#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:11,148 INFO L273 TraceCheckUtils]: 23: Hoare triple {5472#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5472#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:11,148 INFO L256 TraceCheckUtils]: 24: Hoare triple {5472#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call #t~ret0 := f(~x~0); {5463#true} is VALID [2018-11-23 13:07:11,149 INFO L273 TraceCheckUtils]: 25: Hoare triple {5463#true} ~z := #in~z;#res := 2 + ~z; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:11,150 INFO L273 TraceCheckUtils]: 26: Hoare triple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:11,152 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {5472#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #39#return; {5473#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} is VALID [2018-11-23 13:07:11,153 INFO L273 TraceCheckUtils]: 28: Hoare triple {5473#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {5474#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:11,153 INFO L273 TraceCheckUtils]: 29: Hoare triple {5474#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {5474#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:11,154 INFO L256 TraceCheckUtils]: 30: Hoare triple {5474#(and (<= 8 main_~x~0) (<= main_~x~0 8))} call #t~ret0 := f(~x~0); {5463#true} is VALID [2018-11-23 13:07:11,154 INFO L273 TraceCheckUtils]: 31: Hoare triple {5463#true} ~z := #in~z;#res := 2 + ~z; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:11,155 INFO L273 TraceCheckUtils]: 32: Hoare triple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:11,157 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {5474#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #39#return; {5475#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} is VALID [2018-11-23 13:07:11,158 INFO L273 TraceCheckUtils]: 34: Hoare triple {5475#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {5476#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:11,159 INFO L273 TraceCheckUtils]: 35: Hoare triple {5476#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5476#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:11,159 INFO L256 TraceCheckUtils]: 36: Hoare triple {5476#(and (<= main_~x~0 10) (<= 10 main_~x~0))} call #t~ret0 := f(~x~0); {5463#true} is VALID [2018-11-23 13:07:11,160 INFO L273 TraceCheckUtils]: 37: Hoare triple {5463#true} ~z := #in~z;#res := 2 + ~z; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:11,160 INFO L273 TraceCheckUtils]: 38: Hoare triple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:11,162 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {5476#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #39#return; {5477#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} is VALID [2018-11-23 13:07:11,163 INFO L273 TraceCheckUtils]: 40: Hoare triple {5477#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {5478#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:11,164 INFO L273 TraceCheckUtils]: 41: Hoare triple {5478#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5478#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:11,164 INFO L256 TraceCheckUtils]: 42: Hoare triple {5478#(and (<= main_~x~0 12) (<= 12 main_~x~0))} call #t~ret0 := f(~x~0); {5463#true} is VALID [2018-11-23 13:07:11,165 INFO L273 TraceCheckUtils]: 43: Hoare triple {5463#true} ~z := #in~z;#res := 2 + ~z; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:11,166 INFO L273 TraceCheckUtils]: 44: Hoare triple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:11,168 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {5478#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #39#return; {5479#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} is VALID [2018-11-23 13:07:11,169 INFO L273 TraceCheckUtils]: 46: Hoare triple {5479#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {5480#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:11,169 INFO L273 TraceCheckUtils]: 47: Hoare triple {5480#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5480#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:11,170 INFO L256 TraceCheckUtils]: 48: Hoare triple {5480#(and (<= main_~x~0 14) (<= 14 main_~x~0))} call #t~ret0 := f(~x~0); {5463#true} is VALID [2018-11-23 13:07:11,170 INFO L273 TraceCheckUtils]: 49: Hoare triple {5463#true} ~z := #in~z;#res := 2 + ~z; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:11,170 INFO L273 TraceCheckUtils]: 50: Hoare triple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:11,172 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {5480#(and (<= main_~x~0 14) (<= 14 main_~x~0))} #39#return; {5481#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} is VALID [2018-11-23 13:07:11,173 INFO L273 TraceCheckUtils]: 52: Hoare triple {5481#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} ~x~0 := #t~ret0;havoc #t~ret0; {5482#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:11,174 INFO L273 TraceCheckUtils]: 53: Hoare triple {5482#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5482#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:11,174 INFO L256 TraceCheckUtils]: 54: Hoare triple {5482#(and (<= main_~x~0 16) (<= 16 main_~x~0))} call #t~ret0 := f(~x~0); {5463#true} is VALID [2018-11-23 13:07:11,175 INFO L273 TraceCheckUtils]: 55: Hoare triple {5463#true} ~z := #in~z;#res := 2 + ~z; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:11,175 INFO L273 TraceCheckUtils]: 56: Hoare triple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:11,178 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {5482#(and (<= main_~x~0 16) (<= 16 main_~x~0))} #39#return; {5483#(and (<= 18 |main_#t~ret0|) (<= |main_#t~ret0| 18))} is VALID [2018-11-23 13:07:11,178 INFO L273 TraceCheckUtils]: 58: Hoare triple {5483#(and (<= 18 |main_#t~ret0|) (<= |main_#t~ret0| 18))} ~x~0 := #t~ret0;havoc #t~ret0; {5484#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:11,179 INFO L273 TraceCheckUtils]: 59: Hoare triple {5484#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5484#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:11,179 INFO L256 TraceCheckUtils]: 60: Hoare triple {5484#(and (<= main_~x~0 18) (<= 18 main_~x~0))} call #t~ret0 := f(~x~0); {5463#true} is VALID [2018-11-23 13:07:11,180 INFO L273 TraceCheckUtils]: 61: Hoare triple {5463#true} ~z := #in~z;#res := 2 + ~z; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:11,181 INFO L273 TraceCheckUtils]: 62: Hoare triple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:11,183 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {5484#(and (<= main_~x~0 18) (<= 18 main_~x~0))} #39#return; {5485#(and (<= 20 |main_#t~ret0|) (<= |main_#t~ret0| 20))} is VALID [2018-11-23 13:07:11,184 INFO L273 TraceCheckUtils]: 64: Hoare triple {5485#(and (<= 20 |main_#t~ret0|) (<= |main_#t~ret0| 20))} ~x~0 := #t~ret0;havoc #t~ret0; {5486#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:11,185 INFO L273 TraceCheckUtils]: 65: Hoare triple {5486#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455); {5486#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:11,185 INFO L256 TraceCheckUtils]: 66: Hoare triple {5486#(and (<= 20 main_~x~0) (<= main_~x~0 20))} call #t~ret0 := f(~x~0); {5463#true} is VALID [2018-11-23 13:07:11,186 INFO L273 TraceCheckUtils]: 67: Hoare triple {5463#true} ~z := #in~z;#res := 2 + ~z; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:11,186 INFO L273 TraceCheckUtils]: 68: Hoare triple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:11,188 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {5486#(and (<= 20 main_~x~0) (<= main_~x~0 20))} #39#return; {5487#(and (<= 22 |main_#t~ret0|) (<= |main_#t~ret0| 22))} is VALID [2018-11-23 13:07:11,189 INFO L273 TraceCheckUtils]: 70: Hoare triple {5487#(and (<= 22 |main_#t~ret0|) (<= |main_#t~ret0| 22))} ~x~0 := #t~ret0;havoc #t~ret0; {5488#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:07:11,190 INFO L273 TraceCheckUtils]: 71: Hoare triple {5488#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5488#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:07:11,190 INFO L256 TraceCheckUtils]: 72: Hoare triple {5488#(and (<= main_~x~0 22) (<= 22 main_~x~0))} call #t~ret0 := f(~x~0); {5463#true} is VALID [2018-11-23 13:07:11,191 INFO L273 TraceCheckUtils]: 73: Hoare triple {5463#true} ~z := #in~z;#res := 2 + ~z; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:11,192 INFO L273 TraceCheckUtils]: 74: Hoare triple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:11,194 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {5488#(and (<= main_~x~0 22) (<= 22 main_~x~0))} #39#return; {5489#(and (<= |main_#t~ret0| 24) (<= 24 |main_#t~ret0|))} is VALID [2018-11-23 13:07:11,195 INFO L273 TraceCheckUtils]: 76: Hoare triple {5489#(and (<= |main_#t~ret0| 24) (<= 24 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {5490#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:07:11,195 INFO L273 TraceCheckUtils]: 77: Hoare triple {5490#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5490#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:07:11,196 INFO L256 TraceCheckUtils]: 78: Hoare triple {5490#(and (<= main_~x~0 24) (<= 24 main_~x~0))} call #t~ret0 := f(~x~0); {5463#true} is VALID [2018-11-23 13:07:11,196 INFO L273 TraceCheckUtils]: 79: Hoare triple {5463#true} ~z := #in~z;#res := 2 + ~z; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:11,197 INFO L273 TraceCheckUtils]: 80: Hoare triple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:11,199 INFO L268 TraceCheckUtils]: 81: Hoare quadruple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {5490#(and (<= main_~x~0 24) (<= 24 main_~x~0))} #39#return; {5491#(and (<= 26 |main_#t~ret0|) (<= |main_#t~ret0| 26))} is VALID [2018-11-23 13:07:11,200 INFO L273 TraceCheckUtils]: 82: Hoare triple {5491#(and (<= 26 |main_#t~ret0|) (<= |main_#t~ret0| 26))} ~x~0 := #t~ret0;havoc #t~ret0; {5492#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:07:11,201 INFO L273 TraceCheckUtils]: 83: Hoare triple {5492#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {5492#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:07:11,201 INFO L256 TraceCheckUtils]: 84: Hoare triple {5492#(and (<= main_~x~0 26) (<= 26 main_~x~0))} call #t~ret0 := f(~x~0); {5463#true} is VALID [2018-11-23 13:07:11,201 INFO L273 TraceCheckUtils]: 85: Hoare triple {5463#true} ~z := #in~z;#res := 2 + ~z; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:11,202 INFO L273 TraceCheckUtils]: 86: Hoare triple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:11,203 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {5466#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {5492#(and (<= main_~x~0 26) (<= 26 main_~x~0))} #39#return; {5493#(and (<= 28 |main_#t~ret0|) (<= |main_#t~ret0| 28))} is VALID [2018-11-23 13:07:11,204 INFO L273 TraceCheckUtils]: 88: Hoare triple {5493#(and (<= 28 |main_#t~ret0|) (<= |main_#t~ret0| 28))} ~x~0 := #t~ret0;havoc #t~ret0; {5762#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:07:11,205 INFO L273 TraceCheckUtils]: 89: Hoare triple {5762#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {5464#false} is VALID [2018-11-23 13:07:11,205 INFO L256 TraceCheckUtils]: 90: Hoare triple {5464#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {5464#false} is VALID [2018-11-23 13:07:11,205 INFO L273 TraceCheckUtils]: 91: Hoare triple {5464#false} ~cond := #in~cond; {5464#false} is VALID [2018-11-23 13:07:11,206 INFO L273 TraceCheckUtils]: 92: Hoare triple {5464#false} assume 0 == ~cond; {5464#false} is VALID [2018-11-23 13:07:11,206 INFO L273 TraceCheckUtils]: 93: Hoare triple {5464#false} assume !false; {5464#false} is VALID [2018-11-23 13:07:11,217 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2018-11-23 13:07:11,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:11,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2018-11-23 13:07:11,237 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 94 [2018-11-23 13:07:11,237 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:11,237 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-23 13:07:11,304 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:11,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-23 13:07:11,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-23 13:07:11,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=978, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 13:07:11,306 INFO L87 Difference]: Start difference. First operand 56 states and 69 transitions. Second operand 33 states. [2018-11-23 13:07:16,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:16,306 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2018-11-23 13:07:16,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-23 13:07:16,306 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 94 [2018-11-23 13:07:16,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:16,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 13:07:16,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 81 transitions. [2018-11-23 13:07:16,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 13:07:16,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 81 transitions. [2018-11-23 13:07:16,313 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 81 transitions. [2018-11-23 13:07:16,953 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:16,956 INFO L225 Difference]: With dead ends: 66 [2018-11-23 13:07:16,956 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 13:07:16,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 92 SyntacticMatches, 16 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=148, Invalid=2014, Unknown=0, NotChecked=0, Total=2162 [2018-11-23 13:07:16,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 13:07:17,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-11-23 13:07:17,003 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:17,003 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 59 states. [2018-11-23 13:07:17,003 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 59 states. [2018-11-23 13:07:17,003 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 59 states. [2018-11-23 13:07:17,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:17,005 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2018-11-23 13:07:17,006 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2018-11-23 13:07:17,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:17,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:17,006 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 61 states. [2018-11-23 13:07:17,006 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 61 states. [2018-11-23 13:07:17,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:17,009 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2018-11-23 13:07:17,009 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2018-11-23 13:07:17,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:17,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:17,010 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:17,010 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:17,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 13:07:17,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2018-11-23 13:07:17,012 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 73 transitions. Word has length 94 [2018-11-23 13:07:17,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:17,012 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 73 transitions. [2018-11-23 13:07:17,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-23 13:07:17,013 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2018-11-23 13:07:17,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-23 13:07:17,014 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:17,014 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:17,014 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:17,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:17,014 INFO L82 PathProgramCache]: Analyzing trace with hash 124031738, now seen corresponding path program 15 times [2018-11-23 13:07:17,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:17,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:17,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:17,016 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:07:17,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:17,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:18,285 INFO L256 TraceCheckUtils]: 0: Hoare triple {6131#true} call ULTIMATE.init(); {6131#true} is VALID [2018-11-23 13:07:18,285 INFO L273 TraceCheckUtils]: 1: Hoare triple {6131#true} assume true; {6131#true} is VALID [2018-11-23 13:07:18,285 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6131#true} {6131#true} #35#return; {6131#true} is VALID [2018-11-23 13:07:18,286 INFO L256 TraceCheckUtils]: 3: Hoare triple {6131#true} call #t~ret1 := main(); {6131#true} is VALID [2018-11-23 13:07:18,286 INFO L273 TraceCheckUtils]: 4: Hoare triple {6131#true} ~x~0 := 0; {6133#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:18,287 INFO L273 TraceCheckUtils]: 5: Hoare triple {6133#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6133#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:18,287 INFO L256 TraceCheckUtils]: 6: Hoare triple {6133#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call #t~ret0 := f(~x~0); {6131#true} is VALID [2018-11-23 13:07:18,288 INFO L273 TraceCheckUtils]: 7: Hoare triple {6131#true} ~z := #in~z;#res := 2 + ~z; {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:18,289 INFO L273 TraceCheckUtils]: 8: Hoare triple {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:18,291 INFO L268 TraceCheckUtils]: 9: Hoare quadruple {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {6133#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #39#return; {6135#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} is VALID [2018-11-23 13:07:18,292 INFO L273 TraceCheckUtils]: 10: Hoare triple {6135#(and (<= 2 |main_#t~ret0|) (<= |main_#t~ret0| 2))} ~x~0 := #t~ret0;havoc #t~ret0; {6136#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:18,293 INFO L273 TraceCheckUtils]: 11: Hoare triple {6136#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455); {6136#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:18,293 INFO L256 TraceCheckUtils]: 12: Hoare triple {6136#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call #t~ret0 := f(~x~0); {6131#true} is VALID [2018-11-23 13:07:18,294 INFO L273 TraceCheckUtils]: 13: Hoare triple {6131#true} ~z := #in~z;#res := 2 + ~z; {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:18,294 INFO L273 TraceCheckUtils]: 14: Hoare triple {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:18,296 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {6136#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #39#return; {6137#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} is VALID [2018-11-23 13:07:18,297 INFO L273 TraceCheckUtils]: 16: Hoare triple {6137#(and (<= |main_#t~ret0| 4) (<= 4 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {6138#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:18,298 INFO L273 TraceCheckUtils]: 17: Hoare triple {6138#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455); {6138#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:18,298 INFO L256 TraceCheckUtils]: 18: Hoare triple {6138#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call #t~ret0 := f(~x~0); {6131#true} is VALID [2018-11-23 13:07:18,299 INFO L273 TraceCheckUtils]: 19: Hoare triple {6131#true} ~z := #in~z;#res := 2 + ~z; {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:18,300 INFO L273 TraceCheckUtils]: 20: Hoare triple {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:18,302 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {6138#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #39#return; {6139#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} is VALID [2018-11-23 13:07:18,303 INFO L273 TraceCheckUtils]: 22: Hoare triple {6139#(and (<= |main_#t~ret0| 6) (<= 6 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {6140#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:18,303 INFO L273 TraceCheckUtils]: 23: Hoare triple {6140#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6140#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:18,304 INFO L256 TraceCheckUtils]: 24: Hoare triple {6140#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call #t~ret0 := f(~x~0); {6131#true} is VALID [2018-11-23 13:07:18,305 INFO L273 TraceCheckUtils]: 25: Hoare triple {6131#true} ~z := #in~z;#res := 2 + ~z; {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:18,305 INFO L273 TraceCheckUtils]: 26: Hoare triple {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:18,308 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {6140#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #39#return; {6141#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} is VALID [2018-11-23 13:07:18,308 INFO L273 TraceCheckUtils]: 28: Hoare triple {6141#(and (<= |main_#t~ret0| 8) (<= 8 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {6142#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:18,309 INFO L273 TraceCheckUtils]: 29: Hoare triple {6142#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455); {6142#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:18,309 INFO L256 TraceCheckUtils]: 30: Hoare triple {6142#(and (<= 8 main_~x~0) (<= main_~x~0 8))} call #t~ret0 := f(~x~0); {6131#true} is VALID [2018-11-23 13:07:18,310 INFO L273 TraceCheckUtils]: 31: Hoare triple {6131#true} ~z := #in~z;#res := 2 + ~z; {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:18,311 INFO L273 TraceCheckUtils]: 32: Hoare triple {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:18,313 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {6142#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #39#return; {6143#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} is VALID [2018-11-23 13:07:18,314 INFO L273 TraceCheckUtils]: 34: Hoare triple {6143#(and (<= |main_#t~ret0| 10) (<= 10 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {6144#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:18,314 INFO L273 TraceCheckUtils]: 35: Hoare triple {6144#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6144#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:18,315 INFO L256 TraceCheckUtils]: 36: Hoare triple {6144#(and (<= main_~x~0 10) (<= 10 main_~x~0))} call #t~ret0 := f(~x~0); {6131#true} is VALID [2018-11-23 13:07:18,316 INFO L273 TraceCheckUtils]: 37: Hoare triple {6131#true} ~z := #in~z;#res := 2 + ~z; {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:18,316 INFO L273 TraceCheckUtils]: 38: Hoare triple {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:18,318 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {6144#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #39#return; {6145#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} is VALID [2018-11-23 13:07:18,319 INFO L273 TraceCheckUtils]: 40: Hoare triple {6145#(and (<= |main_#t~ret0| 12) (<= 12 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {6146#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:18,320 INFO L273 TraceCheckUtils]: 41: Hoare triple {6146#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6146#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:18,320 INFO L256 TraceCheckUtils]: 42: Hoare triple {6146#(and (<= main_~x~0 12) (<= 12 main_~x~0))} call #t~ret0 := f(~x~0); {6131#true} is VALID [2018-11-23 13:07:18,321 INFO L273 TraceCheckUtils]: 43: Hoare triple {6131#true} ~z := #in~z;#res := 2 + ~z; {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:18,322 INFO L273 TraceCheckUtils]: 44: Hoare triple {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:18,324 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {6146#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #39#return; {6147#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} is VALID [2018-11-23 13:07:18,325 INFO L273 TraceCheckUtils]: 46: Hoare triple {6147#(and (<= |main_#t~ret0| 14) (<= 14 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {6148#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:18,325 INFO L273 TraceCheckUtils]: 47: Hoare triple {6148#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6148#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:18,326 INFO L256 TraceCheckUtils]: 48: Hoare triple {6148#(and (<= main_~x~0 14) (<= 14 main_~x~0))} call #t~ret0 := f(~x~0); {6131#true} is VALID [2018-11-23 13:07:18,326 INFO L273 TraceCheckUtils]: 49: Hoare triple {6131#true} ~z := #in~z;#res := 2 + ~z; {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:18,327 INFO L273 TraceCheckUtils]: 50: Hoare triple {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:18,329 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {6148#(and (<= main_~x~0 14) (<= 14 main_~x~0))} #39#return; {6149#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} is VALID [2018-11-23 13:07:18,330 INFO L273 TraceCheckUtils]: 52: Hoare triple {6149#(and (<= 16 |main_#t~ret0|) (<= |main_#t~ret0| 16))} ~x~0 := #t~ret0;havoc #t~ret0; {6150#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:18,331 INFO L273 TraceCheckUtils]: 53: Hoare triple {6150#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6150#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:18,331 INFO L256 TraceCheckUtils]: 54: Hoare triple {6150#(and (<= main_~x~0 16) (<= 16 main_~x~0))} call #t~ret0 := f(~x~0); {6131#true} is VALID [2018-11-23 13:07:18,332 INFO L273 TraceCheckUtils]: 55: Hoare triple {6131#true} ~z := #in~z;#res := 2 + ~z; {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:18,333 INFO L273 TraceCheckUtils]: 56: Hoare triple {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:18,335 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {6150#(and (<= main_~x~0 16) (<= 16 main_~x~0))} #39#return; {6151#(and (<= 18 |main_#t~ret0|) (<= |main_#t~ret0| 18))} is VALID [2018-11-23 13:07:18,336 INFO L273 TraceCheckUtils]: 58: Hoare triple {6151#(and (<= 18 |main_#t~ret0|) (<= |main_#t~ret0| 18))} ~x~0 := #t~ret0;havoc #t~ret0; {6152#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:18,336 INFO L273 TraceCheckUtils]: 59: Hoare triple {6152#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6152#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:18,337 INFO L256 TraceCheckUtils]: 60: Hoare triple {6152#(and (<= main_~x~0 18) (<= 18 main_~x~0))} call #t~ret0 := f(~x~0); {6131#true} is VALID [2018-11-23 13:07:18,338 INFO L273 TraceCheckUtils]: 61: Hoare triple {6131#true} ~z := #in~z;#res := 2 + ~z; {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:18,338 INFO L273 TraceCheckUtils]: 62: Hoare triple {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:18,340 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {6152#(and (<= main_~x~0 18) (<= 18 main_~x~0))} #39#return; {6153#(and (<= 20 |main_#t~ret0|) (<= |main_#t~ret0| 20))} is VALID [2018-11-23 13:07:18,341 INFO L273 TraceCheckUtils]: 64: Hoare triple {6153#(and (<= 20 |main_#t~ret0|) (<= |main_#t~ret0| 20))} ~x~0 := #t~ret0;havoc #t~ret0; {6154#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:18,342 INFO L273 TraceCheckUtils]: 65: Hoare triple {6154#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455); {6154#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:18,342 INFO L256 TraceCheckUtils]: 66: Hoare triple {6154#(and (<= 20 main_~x~0) (<= main_~x~0 20))} call #t~ret0 := f(~x~0); {6131#true} is VALID [2018-11-23 13:07:18,342 INFO L273 TraceCheckUtils]: 67: Hoare triple {6131#true} ~z := #in~z;#res := 2 + ~z; {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:18,343 INFO L273 TraceCheckUtils]: 68: Hoare triple {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:18,344 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {6154#(and (<= 20 main_~x~0) (<= main_~x~0 20))} #39#return; {6155#(and (<= 22 |main_#t~ret0|) (<= |main_#t~ret0| 22))} is VALID [2018-11-23 13:07:18,345 INFO L273 TraceCheckUtils]: 70: Hoare triple {6155#(and (<= 22 |main_#t~ret0|) (<= |main_#t~ret0| 22))} ~x~0 := #t~ret0;havoc #t~ret0; {6156#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:07:18,346 INFO L273 TraceCheckUtils]: 71: Hoare triple {6156#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6156#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:07:18,346 INFO L256 TraceCheckUtils]: 72: Hoare triple {6156#(and (<= main_~x~0 22) (<= 22 main_~x~0))} call #t~ret0 := f(~x~0); {6131#true} is VALID [2018-11-23 13:07:18,347 INFO L273 TraceCheckUtils]: 73: Hoare triple {6131#true} ~z := #in~z;#res := 2 + ~z; {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:18,348 INFO L273 TraceCheckUtils]: 74: Hoare triple {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:18,350 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {6156#(and (<= main_~x~0 22) (<= 22 main_~x~0))} #39#return; {6157#(and (<= |main_#t~ret0| 24) (<= 24 |main_#t~ret0|))} is VALID [2018-11-23 13:07:18,351 INFO L273 TraceCheckUtils]: 76: Hoare triple {6157#(and (<= |main_#t~ret0| 24) (<= 24 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {6158#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:07:18,351 INFO L273 TraceCheckUtils]: 77: Hoare triple {6158#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6158#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:07:18,351 INFO L256 TraceCheckUtils]: 78: Hoare triple {6158#(and (<= main_~x~0 24) (<= 24 main_~x~0))} call #t~ret0 := f(~x~0); {6131#true} is VALID [2018-11-23 13:07:18,352 INFO L273 TraceCheckUtils]: 79: Hoare triple {6131#true} ~z := #in~z;#res := 2 + ~z; {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:18,352 INFO L273 TraceCheckUtils]: 80: Hoare triple {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:18,354 INFO L268 TraceCheckUtils]: 81: Hoare quadruple {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {6158#(and (<= main_~x~0 24) (<= 24 main_~x~0))} #39#return; {6159#(and (<= 26 |main_#t~ret0|) (<= |main_#t~ret0| 26))} is VALID [2018-11-23 13:07:18,355 INFO L273 TraceCheckUtils]: 82: Hoare triple {6159#(and (<= 26 |main_#t~ret0|) (<= |main_#t~ret0| 26))} ~x~0 := #t~ret0;havoc #t~ret0; {6160#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:07:18,356 INFO L273 TraceCheckUtils]: 83: Hoare triple {6160#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6160#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:07:18,356 INFO L256 TraceCheckUtils]: 84: Hoare triple {6160#(and (<= main_~x~0 26) (<= 26 main_~x~0))} call #t~ret0 := f(~x~0); {6131#true} is VALID [2018-11-23 13:07:18,357 INFO L273 TraceCheckUtils]: 85: Hoare triple {6131#true} ~z := #in~z;#res := 2 + ~z; {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:18,357 INFO L273 TraceCheckUtils]: 86: Hoare triple {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:18,360 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {6160#(and (<= main_~x~0 26) (<= 26 main_~x~0))} #39#return; {6161#(and (<= 28 |main_#t~ret0|) (<= |main_#t~ret0| 28))} is VALID [2018-11-23 13:07:18,360 INFO L273 TraceCheckUtils]: 88: Hoare triple {6161#(and (<= 28 |main_#t~ret0|) (<= |main_#t~ret0| 28))} ~x~0 := #t~ret0;havoc #t~ret0; {6162#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:07:18,361 INFO L273 TraceCheckUtils]: 89: Hoare triple {6162#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455); {6162#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:07:18,361 INFO L256 TraceCheckUtils]: 90: Hoare triple {6162#(and (<= main_~x~0 28) (<= 28 main_~x~0))} call #t~ret0 := f(~x~0); {6131#true} is VALID [2018-11-23 13:07:18,362 INFO L273 TraceCheckUtils]: 91: Hoare triple {6131#true} ~z := #in~z;#res := 2 + ~z; {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:18,363 INFO L273 TraceCheckUtils]: 92: Hoare triple {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2018-11-23 13:07:18,365 INFO L268 TraceCheckUtils]: 93: Hoare quadruple {6134#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {6162#(and (<= main_~x~0 28) (<= 28 main_~x~0))} #39#return; {6163#(and (<= |main_#t~ret0| 30) (<= 30 |main_#t~ret0|))} is VALID [2018-11-23 13:07:18,367 INFO L273 TraceCheckUtils]: 94: Hoare triple {6163#(and (<= |main_#t~ret0| 30) (<= 30 |main_#t~ret0|))} ~x~0 := #t~ret0;havoc #t~ret0; {6164#(and (<= main_~x~0 30) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:07:18,368 INFO L273 TraceCheckUtils]: 95: Hoare triple {6164#(and (<= main_~x~0 30) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {6132#false} is VALID [2018-11-23 13:07:18,368 INFO L256 TraceCheckUtils]: 96: Hoare triple {6132#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {6132#false} is VALID [2018-11-23 13:07:18,368 INFO L273 TraceCheckUtils]: 97: Hoare triple {6132#false} ~cond := #in~cond; {6132#false} is VALID [2018-11-23 13:07:18,368 INFO L273 TraceCheckUtils]: 98: Hoare triple {6132#false} assume 0 == ~cond; {6132#false} is VALID [2018-11-23 13:07:18,368 INFO L273 TraceCheckUtils]: 99: Hoare triple {6132#false} assume !false; {6132#false} is VALID [2018-11-23 13:07:18,380 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2018-11-23 13:07:18,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:18,381 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:07:18,393 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2