java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf -i ../../../trunk/examples/svcomp/loop-acceleration/underapprox_false-unreach-call1_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 19:18:54,825 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 19:18:54,828 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 19:18:54,839 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 19:18:54,840 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 19:18:54,841 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 19:18:54,842 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 19:18:54,844 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 19:18:54,845 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 19:18:54,846 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 19:18:54,847 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 19:18:54,847 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 19:18:54,848 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 19:18:54,849 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 19:18:54,850 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 19:18:54,851 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 19:18:54,852 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 19:18:54,856 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 19:18:54,861 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 19:18:54,865 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 19:18:54,866 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 19:18:54,867 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 19:18:54,873 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 19:18:54,873 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 19:18:54,876 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 19:18:54,877 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 19:18:54,879 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 19:18:54,880 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 19:18:54,883 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 19:18:54,884 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 19:18:54,884 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 19:18:54,885 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 19:18:54,885 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 19:18:54,885 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 19:18:54,887 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 19:18:54,888 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 19:18:54,888 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf [2018-11-14 19:18:54,910 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 19:18:54,910 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 19:18:54,911 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 19:18:54,911 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 19:18:54,912 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 19:18:54,912 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 19:18:54,912 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 19:18:54,912 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 19:18:54,912 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 19:18:54,913 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 19:18:54,913 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 19:18:54,913 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 19:18:54,913 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 19:18:54,913 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 19:18:54,913 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 19:18:54,914 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 19:18:54,914 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 19:18:54,914 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 19:18:54,914 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 19:18:54,914 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 19:18:54,915 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 19:18:54,915 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 19:18:54,915 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 19:18:54,915 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 19:18:54,915 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 19:18:54,916 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 19:18:54,916 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 19:18:54,916 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 19:18:54,916 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 19:18:54,916 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 19:18:54,917 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 19:18:54,961 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 19:18:54,977 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 19:18:54,981 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 19:18:54,983 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 19:18:54,983 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 19:18:54,984 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/underapprox_false-unreach-call1_true-termination.i [2018-11-14 19:18:55,055 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e3654af8/b0c06ef41f434ff19d76eaa25f091a64/FLAG6dd431b21 [2018-11-14 19:18:55,439 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 19:18:55,440 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/underapprox_false-unreach-call1_true-termination.i [2018-11-14 19:18:55,447 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e3654af8/b0c06ef41f434ff19d76eaa25f091a64/FLAG6dd431b21 [2018-11-14 19:18:55,467 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e3654af8/b0c06ef41f434ff19d76eaa25f091a64 [2018-11-14 19:18:55,479 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 19:18:55,481 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 19:18:55,482 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 19:18:55,482 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 19:18:55,486 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 19:18:55,488 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:18:55" (1/1) ... [2018-11-14 19:18:55,491 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@102ece and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:18:55, skipping insertion in model container [2018-11-14 19:18:55,491 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:18:55" (1/1) ... [2018-11-14 19:18:55,502 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 19:18:55,523 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 19:18:55,753 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:18:55,761 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 19:18:55,781 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:18:55,799 INFO L195 MainTranslator]: Completed translation [2018-11-14 19:18:55,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:18:55 WrapperNode [2018-11-14 19:18:55,800 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 19:18:55,801 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 19:18:55,801 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 19:18:55,801 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 19:18:55,819 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:18:55" (1/1) ... [2018-11-14 19:18:55,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:18:55" (1/1) ... [2018-11-14 19:18:55,824 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:18:55" (1/1) ... [2018-11-14 19:18:55,825 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:18:55" (1/1) ... [2018-11-14 19:18:55,830 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:18:55" (1/1) ... [2018-11-14 19:18:55,836 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:18:55" (1/1) ... [2018-11-14 19:18:55,837 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:18:55" (1/1) ... [2018-11-14 19:18:55,838 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 19:18:55,839 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 19:18:55,839 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 19:18:55,839 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 19:18:55,840 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:18: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-14 19:18:55,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 19:18:55,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 19:18:55,973 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 19:18:55,973 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 19:18:55,974 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 19:18:55,974 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 19:18:55,974 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 19:18:55,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 19:18:55,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 19:18:56,394 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 19:18:56,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:18:56 BoogieIcfgContainer [2018-11-14 19:18:56,397 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 19:18:56,398 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 19:18:56,398 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 19:18:56,401 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 19:18:56,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 07:18:55" (1/3) ... [2018-11-14 19:18:56,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33a6d419 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:18:56, skipping insertion in model container [2018-11-14 19:18:56,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:18:55" (2/3) ... [2018-11-14 19:18:56,403 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33a6d419 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:18:56, skipping insertion in model container [2018-11-14 19:18:56,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:18:56" (3/3) ... [2018-11-14 19:18:56,405 INFO L112 eAbstractionObserver]: Analyzing ICFG underapprox_false-unreach-call1_true-termination.i [2018-11-14 19:18:56,413 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 19:18:56,421 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 19:18:56,439 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 19:18:56,473 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 19:18:56,474 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 19:18:56,475 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 19:18:56,475 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 19:18:56,475 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 19:18:56,475 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 19:18:56,475 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 19:18:56,475 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 19:18:56,476 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 19:18:56,496 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-11-14 19:18:56,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-14 19:18:56,502 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:18:56,504 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:18:56,506 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:18:56,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:18:56,513 INFO L82 PathProgramCache]: Analyzing trace with hash -10373566, now seen corresponding path program 1 times [2018-11-14 19:18:56,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:18:56,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:18:56,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:56,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:18:56,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:56,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:56,701 INFO L256 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {21#true} is VALID [2018-11-14 19:18:56,705 INFO L273 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2018-11-14 19:18:56,705 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #32#return; {21#true} is VALID [2018-11-14 19:18:56,705 INFO L256 TraceCheckUtils]: 3: Hoare triple {21#true} call #t~ret1 := main(); {21#true} is VALID [2018-11-14 19:18:56,706 INFO L273 TraceCheckUtils]: 4: Hoare triple {21#true} ~x~0 := 0;~y~0 := 1; {21#true} is VALID [2018-11-14 19:18:56,710 INFO L273 TraceCheckUtils]: 5: Hoare triple {21#true} assume !true; {22#false} is VALID [2018-11-14 19:18:56,710 INFO L256 TraceCheckUtils]: 6: Hoare triple {22#false} call __VERIFIER_assert((if ~y~0 % 4294967296 != 64 then 1 else 0)); {22#false} is VALID [2018-11-14 19:18:56,711 INFO L273 TraceCheckUtils]: 7: Hoare triple {22#false} ~cond := #in~cond; {22#false} is VALID [2018-11-14 19:18:56,711 INFO L273 TraceCheckUtils]: 8: Hoare triple {22#false} assume ~cond == 0; {22#false} is VALID [2018-11-14 19:18:56,711 INFO L273 TraceCheckUtils]: 9: Hoare triple {22#false} assume !false; {22#false} is VALID [2018-11-14 19:18:56,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:18:56,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:18:56,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 19:18:56,725 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-14 19:18:56,733 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:18:56,739 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 19:18:56,803 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:56,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 19:18:56,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 19:18:56,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 19:18:56,817 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-11-14 19:18:56,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:56,921 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-14 19:18:56,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 19:18:56,921 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-14 19:18:56,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:18:56,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 19:18:56,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 32 transitions. [2018-11-14 19:18:56,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 19:18:56,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 32 transitions. [2018-11-14 19:18:56,936 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 32 transitions. [2018-11-14 19:18:57,120 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:57,131 INFO L225 Difference]: With dead ends: 29 [2018-11-14 19:18:57,132 INFO L226 Difference]: Without dead ends: 12 [2018-11-14 19:18:57,135 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 19:18:57,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-14 19:18:57,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-14 19:18:57,257 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:18:57,258 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2018-11-14 19:18:57,258 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-14 19:18:57,259 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-14 19:18:57,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:57,262 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-14 19:18:57,262 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-14 19:18:57,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:57,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:57,263 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-14 19:18:57,263 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-14 19:18:57,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:57,266 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-14 19:18:57,267 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-14 19:18:57,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:57,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:57,272 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:18:57,272 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:18:57,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 19:18:57,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-14 19:18:57,277 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-14 19:18:57,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:18:57,278 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-14 19:18:57,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 19:18:57,278 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-14 19:18:57,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-14 19:18:57,279 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:18:57,280 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:18:57,280 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:18:57,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:18:57,281 INFO L82 PathProgramCache]: Analyzing trace with hash -571410792, now seen corresponding path program 1 times [2018-11-14 19:18:57,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:18:57,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:18:57,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:57,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:18:57,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:57,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:57,524 INFO L256 TraceCheckUtils]: 0: Hoare triple {106#true} call ULTIMATE.init(); {106#true} is VALID [2018-11-14 19:18:57,525 INFO L273 TraceCheckUtils]: 1: Hoare triple {106#true} assume true; {106#true} is VALID [2018-11-14 19:18:57,525 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {106#true} {106#true} #32#return; {106#true} is VALID [2018-11-14 19:18:57,526 INFO L256 TraceCheckUtils]: 3: Hoare triple {106#true} call #t~ret1 := main(); {106#true} is VALID [2018-11-14 19:18:57,532 INFO L273 TraceCheckUtils]: 4: Hoare triple {106#true} ~x~0 := 0;~y~0 := 1; {108#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:18:57,533 INFO L273 TraceCheckUtils]: 5: Hoare triple {108#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {108#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:18:57,534 INFO L273 TraceCheckUtils]: 6: Hoare triple {108#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(~x~0 % 4294967296 < 6); {107#false} is VALID [2018-11-14 19:18:57,534 INFO L256 TraceCheckUtils]: 7: Hoare triple {107#false} call __VERIFIER_assert((if ~y~0 % 4294967296 != 64 then 1 else 0)); {107#false} is VALID [2018-11-14 19:18:57,534 INFO L273 TraceCheckUtils]: 8: Hoare triple {107#false} ~cond := #in~cond; {107#false} is VALID [2018-11-14 19:18:57,535 INFO L273 TraceCheckUtils]: 9: Hoare triple {107#false} assume ~cond == 0; {107#false} is VALID [2018-11-14 19:18:57,535 INFO L273 TraceCheckUtils]: 10: Hoare triple {107#false} assume !false; {107#false} is VALID [2018-11-14 19:18:57,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:18:57,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:18:57,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 19:18:57,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-14 19:18:57,542 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:18:57,542 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 19:18:57,590 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:57,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 19:18:57,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 19:18:57,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 19:18:57,591 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 3 states. [2018-11-14 19:18:57,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:57,700 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-14 19:18:57,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 19:18:57,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-14 19:18:57,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:18:57,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 19:18:57,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2018-11-14 19:18:57,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 19:18:57,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2018-11-14 19:18:57,706 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 19 transitions. [2018-11-14 19:18:57,755 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:57,756 INFO L225 Difference]: With dead ends: 19 [2018-11-14 19:18:57,756 INFO L226 Difference]: Without dead ends: 14 [2018-11-14 19:18:57,757 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 19:18:57,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-14 19:18:57,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-14 19:18:57,770 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:18:57,770 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-14 19:18:57,771 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-14 19:18:57,771 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-14 19:18:57,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:57,772 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-14 19:18:57,772 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-14 19:18:57,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:57,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:57,773 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-14 19:18:57,773 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-14 19:18:57,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:57,775 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-14 19:18:57,775 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-14 19:18:57,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:57,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:57,776 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:18:57,776 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:18:57,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 19:18:57,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-14 19:18:57,778 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-11-14 19:18:57,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:18:57,778 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-14 19:18:57,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 19:18:57,779 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-14 19:18:57,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-14 19:18:57,779 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:18:57,780 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:18:57,780 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:18:57,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:18:57,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1625028318, now seen corresponding path program 1 times [2018-11-14 19:18:57,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:18:57,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:18:57,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:57,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:18:57,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:57,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:57,998 INFO L256 TraceCheckUtils]: 0: Hoare triple {190#true} call ULTIMATE.init(); {190#true} is VALID [2018-11-14 19:18:57,999 INFO L273 TraceCheckUtils]: 1: Hoare triple {190#true} assume true; {190#true} is VALID [2018-11-14 19:18:57,999 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {190#true} {190#true} #32#return; {190#true} is VALID [2018-11-14 19:18:57,999 INFO L256 TraceCheckUtils]: 3: Hoare triple {190#true} call #t~ret1 := main(); {190#true} is VALID [2018-11-14 19:18:58,000 INFO L273 TraceCheckUtils]: 4: Hoare triple {190#true} ~x~0 := 0;~y~0 := 1; {192#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:18:58,001 INFO L273 TraceCheckUtils]: 5: Hoare triple {192#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {192#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:18:58,002 INFO L273 TraceCheckUtils]: 6: Hoare triple {192#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {193#(and (<= main_~x~0 1) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 19:18:58,011 INFO L273 TraceCheckUtils]: 7: Hoare triple {193#(and (<= main_~x~0 1) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {193#(and (<= main_~x~0 1) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 19:18:58,013 INFO L273 TraceCheckUtils]: 8: Hoare triple {193#(and (<= main_~x~0 1) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 6); {191#false} is VALID [2018-11-14 19:18:58,013 INFO L256 TraceCheckUtils]: 9: Hoare triple {191#false} call __VERIFIER_assert((if ~y~0 % 4294967296 != 64 then 1 else 0)); {191#false} is VALID [2018-11-14 19:18:58,013 INFO L273 TraceCheckUtils]: 10: Hoare triple {191#false} ~cond := #in~cond; {191#false} is VALID [2018-11-14 19:18:58,013 INFO L273 TraceCheckUtils]: 11: Hoare triple {191#false} assume ~cond == 0; {191#false} is VALID [2018-11-14 19:18:58,014 INFO L273 TraceCheckUtils]: 12: Hoare triple {191#false} assume !false; {191#false} is VALID [2018-11-14 19:18:58,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:18:58,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:18:58,016 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 19:18:58,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:18:58,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:58,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:58,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:18:58,156 INFO L256 TraceCheckUtils]: 0: Hoare triple {190#true} call ULTIMATE.init(); {190#true} is VALID [2018-11-14 19:18:58,157 INFO L273 TraceCheckUtils]: 1: Hoare triple {190#true} assume true; {190#true} is VALID [2018-11-14 19:18:58,157 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {190#true} {190#true} #32#return; {190#true} is VALID [2018-11-14 19:18:58,158 INFO L256 TraceCheckUtils]: 3: Hoare triple {190#true} call #t~ret1 := main(); {190#true} is VALID [2018-11-14 19:18:58,159 INFO L273 TraceCheckUtils]: 4: Hoare triple {190#true} ~x~0 := 0;~y~0 := 1; {192#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:18:58,161 INFO L273 TraceCheckUtils]: 5: Hoare triple {192#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {192#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:18:58,172 INFO L273 TraceCheckUtils]: 6: Hoare triple {192#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {215#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:18:58,174 INFO L273 TraceCheckUtils]: 7: Hoare triple {215#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {215#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:18:58,175 INFO L273 TraceCheckUtils]: 8: Hoare triple {215#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !(~x~0 % 4294967296 < 6); {191#false} is VALID [2018-11-14 19:18:58,175 INFO L256 TraceCheckUtils]: 9: Hoare triple {191#false} call __VERIFIER_assert((if ~y~0 % 4294967296 != 64 then 1 else 0)); {191#false} is VALID [2018-11-14 19:18:58,175 INFO L273 TraceCheckUtils]: 10: Hoare triple {191#false} ~cond := #in~cond; {191#false} is VALID [2018-11-14 19:18:58,175 INFO L273 TraceCheckUtils]: 11: Hoare triple {191#false} assume ~cond == 0; {191#false} is VALID [2018-11-14 19:18:58,176 INFO L273 TraceCheckUtils]: 12: Hoare triple {191#false} assume !false; {191#false} is VALID [2018-11-14 19:18:58,177 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:18:58,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:18:58,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-14 19:18:58,199 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-14 19:18:58,199 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:18:58,199 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 19:18:58,268 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:58,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 19:18:58,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 19:18:58,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 19:18:58,270 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 5 states. [2018-11-14 19:18:58,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:58,741 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-14 19:18:58,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 19:18:58,742 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-14 19:18:58,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:18:58,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:18:58,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2018-11-14 19:18:58,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:18:58,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2018-11-14 19:18:58,746 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 21 transitions. [2018-11-14 19:18:58,824 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:58,825 INFO L225 Difference]: With dead ends: 21 [2018-11-14 19:18:58,825 INFO L226 Difference]: Without dead ends: 16 [2018-11-14 19:18:58,826 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 19:18:58,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-14 19:18:58,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-14 19:18:58,843 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:18:58,844 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2018-11-14 19:18:58,844 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-14 19:18:58,844 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-14 19:18:58,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:58,846 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-14 19:18:58,846 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-14 19:18:58,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:58,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:58,847 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-14 19:18:58,847 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-14 19:18:58,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:58,849 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-14 19:18:58,849 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-14 19:18:58,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:58,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:58,850 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:18:58,850 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:18:58,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 19:18:58,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-11-14 19:18:58,852 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2018-11-14 19:18:58,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:18:58,852 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-11-14 19:18:58,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 19:18:58,852 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-14 19:18:58,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 19:18:58,853 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:18:58,853 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:18:58,854 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:18:58,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:18:58,857 INFO L82 PathProgramCache]: Analyzing trace with hash -720896604, now seen corresponding path program 2 times [2018-11-14 19:18:58,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:18:58,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:18:58,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:58,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:18:58,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:58,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:59,167 INFO L256 TraceCheckUtils]: 0: Hoare triple {322#true} call ULTIMATE.init(); {322#true} is VALID [2018-11-14 19:18:59,167 INFO L273 TraceCheckUtils]: 1: Hoare triple {322#true} assume true; {322#true} is VALID [2018-11-14 19:18:59,168 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {322#true} {322#true} #32#return; {322#true} is VALID [2018-11-14 19:18:59,168 INFO L256 TraceCheckUtils]: 3: Hoare triple {322#true} call #t~ret1 := main(); {322#true} is VALID [2018-11-14 19:18:59,172 INFO L273 TraceCheckUtils]: 4: Hoare triple {322#true} ~x~0 := 0;~y~0 := 1; {324#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:18:59,190 INFO L273 TraceCheckUtils]: 5: Hoare triple {324#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {324#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:18:59,204 INFO L273 TraceCheckUtils]: 6: Hoare triple {324#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {325#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:18:59,212 INFO L273 TraceCheckUtils]: 7: Hoare triple {325#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {325#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:18:59,213 INFO L273 TraceCheckUtils]: 8: Hoare triple {325#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {326#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 19:18:59,214 INFO L273 TraceCheckUtils]: 9: Hoare triple {326#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {326#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 19:18:59,215 INFO L273 TraceCheckUtils]: 10: Hoare triple {326#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 6); {323#false} is VALID [2018-11-14 19:18:59,215 INFO L256 TraceCheckUtils]: 11: Hoare triple {323#false} call __VERIFIER_assert((if ~y~0 % 4294967296 != 64 then 1 else 0)); {323#false} is VALID [2018-11-14 19:18:59,215 INFO L273 TraceCheckUtils]: 12: Hoare triple {323#false} ~cond := #in~cond; {323#false} is VALID [2018-11-14 19:18:59,216 INFO L273 TraceCheckUtils]: 13: Hoare triple {323#false} assume ~cond == 0; {323#false} is VALID [2018-11-14 19:18:59,216 INFO L273 TraceCheckUtils]: 14: Hoare triple {323#false} assume !false; {323#false} is VALID [2018-11-14 19:18:59,218 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:18:59,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:18:59,218 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 19:18:59,228 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 19:18:59,237 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 19:18:59,238 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:18:59,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:59,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:18:59,442 INFO L256 TraceCheckUtils]: 0: Hoare triple {322#true} call ULTIMATE.init(); {322#true} is VALID [2018-11-14 19:18:59,442 INFO L273 TraceCheckUtils]: 1: Hoare triple {322#true} assume true; {322#true} is VALID [2018-11-14 19:18:59,443 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {322#true} {322#true} #32#return; {322#true} is VALID [2018-11-14 19:18:59,443 INFO L256 TraceCheckUtils]: 3: Hoare triple {322#true} call #t~ret1 := main(); {322#true} is VALID [2018-11-14 19:18:59,444 INFO L273 TraceCheckUtils]: 4: Hoare triple {322#true} ~x~0 := 0;~y~0 := 1; {324#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:18:59,444 INFO L273 TraceCheckUtils]: 5: Hoare triple {324#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {324#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:18:59,446 INFO L273 TraceCheckUtils]: 6: Hoare triple {324#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {325#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:18:59,446 INFO L273 TraceCheckUtils]: 7: Hoare triple {325#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {325#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:18:59,448 INFO L273 TraceCheckUtils]: 8: Hoare triple {325#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {354#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:18:59,457 INFO L273 TraceCheckUtils]: 9: Hoare triple {354#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {354#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:18:59,460 INFO L273 TraceCheckUtils]: 10: Hoare triple {354#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 6); {323#false} is VALID [2018-11-14 19:18:59,460 INFO L256 TraceCheckUtils]: 11: Hoare triple {323#false} call __VERIFIER_assert((if ~y~0 % 4294967296 != 64 then 1 else 0)); {323#false} is VALID [2018-11-14 19:18:59,460 INFO L273 TraceCheckUtils]: 12: Hoare triple {323#false} ~cond := #in~cond; {323#false} is VALID [2018-11-14 19:18:59,461 INFO L273 TraceCheckUtils]: 13: Hoare triple {323#false} assume ~cond == 0; {323#false} is VALID [2018-11-14 19:18:59,461 INFO L273 TraceCheckUtils]: 14: Hoare triple {323#false} assume !false; {323#false} is VALID [2018-11-14 19:18:59,462 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:18:59,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:18:59,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-14 19:18:59,486 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-14 19:18:59,487 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:18:59,487 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 19:18:59,513 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-14 19:18:59,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 19:18:59,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 19:18:59,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-14 19:18:59,515 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 6 states. [2018-11-14 19:18:59,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:59,710 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-14 19:18:59,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 19:18:59,711 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-14 19:18:59,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:18:59,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:18:59,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2018-11-14 19:18:59,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:18:59,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2018-11-14 19:18:59,715 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 23 transitions. [2018-11-14 19:18:59,772 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:59,773 INFO L225 Difference]: With dead ends: 23 [2018-11-14 19:18:59,773 INFO L226 Difference]: Without dead ends: 18 [2018-11-14 19:18:59,774 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-14 19:18:59,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-14 19:18:59,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-14 19:18:59,835 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:18:59,836 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-11-14 19:18:59,836 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-14 19:18:59,836 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-14 19:18:59,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:59,838 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-14 19:18:59,838 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-14 19:18:59,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:59,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:59,839 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-14 19:18:59,839 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-14 19:18:59,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:59,841 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-14 19:18:59,841 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-14 19:18:59,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:59,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:59,842 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:18:59,842 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:18:59,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 19:18:59,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-11-14 19:18:59,844 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2018-11-14 19:18:59,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:18:59,844 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-11-14 19:18:59,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 19:18:59,844 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-14 19:18:59,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-14 19:18:59,845 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:18:59,845 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:18:59,845 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:18:59,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:18:59,846 INFO L82 PathProgramCache]: Analyzing trace with hash -296916246, now seen corresponding path program 3 times [2018-11-14 19:18:59,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:18:59,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:18:59,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:59,847 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:18:59,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:59,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:19:00,019 INFO L256 TraceCheckUtils]: 0: Hoare triple {471#true} call ULTIMATE.init(); {471#true} is VALID [2018-11-14 19:19:00,020 INFO L273 TraceCheckUtils]: 1: Hoare triple {471#true} assume true; {471#true} is VALID [2018-11-14 19:19:00,020 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {471#true} {471#true} #32#return; {471#true} is VALID [2018-11-14 19:19:00,020 INFO L256 TraceCheckUtils]: 3: Hoare triple {471#true} call #t~ret1 := main(); {471#true} is VALID [2018-11-14 19:19:00,021 INFO L273 TraceCheckUtils]: 4: Hoare triple {471#true} ~x~0 := 0;~y~0 := 1; {473#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:19:00,022 INFO L273 TraceCheckUtils]: 5: Hoare triple {473#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {473#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:19:00,023 INFO L273 TraceCheckUtils]: 6: Hoare triple {473#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {474#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:19:00,023 INFO L273 TraceCheckUtils]: 7: Hoare triple {474#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {474#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:19:00,024 INFO L273 TraceCheckUtils]: 8: Hoare triple {474#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {475#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:19:00,033 INFO L273 TraceCheckUtils]: 9: Hoare triple {475#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {475#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:19:00,035 INFO L273 TraceCheckUtils]: 10: Hoare triple {475#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {476#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 19:19:00,036 INFO L273 TraceCheckUtils]: 11: Hoare triple {476#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {476#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 19:19:00,037 INFO L273 TraceCheckUtils]: 12: Hoare triple {476#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 6); {472#false} is VALID [2018-11-14 19:19:00,037 INFO L256 TraceCheckUtils]: 13: Hoare triple {472#false} call __VERIFIER_assert((if ~y~0 % 4294967296 != 64 then 1 else 0)); {472#false} is VALID [2018-11-14 19:19:00,038 INFO L273 TraceCheckUtils]: 14: Hoare triple {472#false} ~cond := #in~cond; {472#false} is VALID [2018-11-14 19:19:00,038 INFO L273 TraceCheckUtils]: 15: Hoare triple {472#false} assume ~cond == 0; {472#false} is VALID [2018-11-14 19:19:00,039 INFO L273 TraceCheckUtils]: 16: Hoare triple {472#false} assume !false; {472#false} is VALID [2018-11-14 19:19:00,041 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:19:00,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:19:00,042 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 19:19:00,051 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 19:19:00,061 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-14 19:19:00,061 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:19:00,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:19:00,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:19:00,166 INFO L256 TraceCheckUtils]: 0: Hoare triple {471#true} call ULTIMATE.init(); {471#true} is VALID [2018-11-14 19:19:00,166 INFO L273 TraceCheckUtils]: 1: Hoare triple {471#true} assume true; {471#true} is VALID [2018-11-14 19:19:00,166 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {471#true} {471#true} #32#return; {471#true} is VALID [2018-11-14 19:19:00,166 INFO L256 TraceCheckUtils]: 3: Hoare triple {471#true} call #t~ret1 := main(); {471#true} is VALID [2018-11-14 19:19:00,170 INFO L273 TraceCheckUtils]: 4: Hoare triple {471#true} ~x~0 := 0;~y~0 := 1; {473#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:19:00,170 INFO L273 TraceCheckUtils]: 5: Hoare triple {473#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {473#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:19:00,171 INFO L273 TraceCheckUtils]: 6: Hoare triple {473#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {474#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:19:00,172 INFO L273 TraceCheckUtils]: 7: Hoare triple {474#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {474#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:19:00,172 INFO L273 TraceCheckUtils]: 8: Hoare triple {474#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {475#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:19:00,173 INFO L273 TraceCheckUtils]: 9: Hoare triple {475#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {475#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:19:00,175 INFO L273 TraceCheckUtils]: 10: Hoare triple {475#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {510#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:19:00,182 INFO L273 TraceCheckUtils]: 11: Hoare triple {510#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {510#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:19:00,183 INFO L273 TraceCheckUtils]: 12: Hoare triple {510#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 < 6); {472#false} is VALID [2018-11-14 19:19:00,184 INFO L256 TraceCheckUtils]: 13: Hoare triple {472#false} call __VERIFIER_assert((if ~y~0 % 4294967296 != 64 then 1 else 0)); {472#false} is VALID [2018-11-14 19:19:00,184 INFO L273 TraceCheckUtils]: 14: Hoare triple {472#false} ~cond := #in~cond; {472#false} is VALID [2018-11-14 19:19:00,184 INFO L273 TraceCheckUtils]: 15: Hoare triple {472#false} assume ~cond == 0; {472#false} is VALID [2018-11-14 19:19:00,184 INFO L273 TraceCheckUtils]: 16: Hoare triple {472#false} assume !false; {472#false} is VALID [2018-11-14 19:19:00,185 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:19:00,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:19:00,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-14 19:19:00,206 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-11-14 19:19:00,206 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:19:00,207 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 19:19:00,255 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:19:00,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 19:19:00,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 19:19:00,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-14 19:19:00,257 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 7 states. [2018-11-14 19:19:00,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:19:00,423 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-11-14 19:19:00,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 19:19:00,423 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-11-14 19:19:00,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:19:00,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 19:19:00,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 25 transitions. [2018-11-14 19:19:00,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 19:19:00,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 25 transitions. [2018-11-14 19:19:00,427 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 25 transitions. [2018-11-14 19:19:00,469 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-14 19:19:00,470 INFO L225 Difference]: With dead ends: 25 [2018-11-14 19:19:00,471 INFO L226 Difference]: Without dead ends: 20 [2018-11-14 19:19:00,471 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-14 19:19:00,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-14 19:19:00,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-14 19:19:00,500 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:19:00,500 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-14 19:19:00,500 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-14 19:19:00,501 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-14 19:19:00,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:19:00,503 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-14 19:19:00,504 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-14 19:19:00,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:19:00,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:19:00,504 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-14 19:19:00,505 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-14 19:19:00,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:19:00,506 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-14 19:19:00,506 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-14 19:19:00,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:19:00,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:19:00,507 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:19:00,507 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:19:00,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 19:19:00,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-11-14 19:19:00,509 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2018-11-14 19:19:00,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:19:00,509 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-11-14 19:19:00,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 19:19:00,510 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-14 19:19:00,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 19:19:00,510 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:19:00,510 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:19:00,511 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:19:00,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:19:00,511 INFO L82 PathProgramCache]: Analyzing trace with hash -873685328, now seen corresponding path program 4 times [2018-11-14 19:19:00,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:19:00,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:19:00,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:19:00,513 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:19:00,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:19:00,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:19:00,963 INFO L256 TraceCheckUtils]: 0: Hoare triple {637#true} call ULTIMATE.init(); {637#true} is VALID [2018-11-14 19:19:00,963 INFO L273 TraceCheckUtils]: 1: Hoare triple {637#true} assume true; {637#true} is VALID [2018-11-14 19:19:00,963 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {637#true} {637#true} #32#return; {637#true} is VALID [2018-11-14 19:19:00,964 INFO L256 TraceCheckUtils]: 3: Hoare triple {637#true} call #t~ret1 := main(); {637#true} is VALID [2018-11-14 19:19:00,964 INFO L273 TraceCheckUtils]: 4: Hoare triple {637#true} ~x~0 := 0;~y~0 := 1; {639#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:19:00,965 INFO L273 TraceCheckUtils]: 5: Hoare triple {639#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {639#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:19:00,966 INFO L273 TraceCheckUtils]: 6: Hoare triple {639#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {640#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:19:00,970 INFO L273 TraceCheckUtils]: 7: Hoare triple {640#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {640#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:19:00,972 INFO L273 TraceCheckUtils]: 8: Hoare triple {640#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {641#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:19:00,972 INFO L273 TraceCheckUtils]: 9: Hoare triple {641#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {641#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:19:00,986 INFO L273 TraceCheckUtils]: 10: Hoare triple {641#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {642#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:19:00,987 INFO L273 TraceCheckUtils]: 11: Hoare triple {642#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {642#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:19:00,989 INFO L273 TraceCheckUtils]: 12: Hoare triple {642#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {643#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 19:19:00,990 INFO L273 TraceCheckUtils]: 13: Hoare triple {643#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {643#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 19:19:00,991 INFO L273 TraceCheckUtils]: 14: Hoare triple {643#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 6); {638#false} is VALID [2018-11-14 19:19:00,991 INFO L256 TraceCheckUtils]: 15: Hoare triple {638#false} call __VERIFIER_assert((if ~y~0 % 4294967296 != 64 then 1 else 0)); {638#false} is VALID [2018-11-14 19:19:00,992 INFO L273 TraceCheckUtils]: 16: Hoare triple {638#false} ~cond := #in~cond; {638#false} is VALID [2018-11-14 19:19:00,992 INFO L273 TraceCheckUtils]: 17: Hoare triple {638#false} assume ~cond == 0; {638#false} is VALID [2018-11-14 19:19:00,993 INFO L273 TraceCheckUtils]: 18: Hoare triple {638#false} assume !false; {638#false} is VALID [2018-11-14 19:19:00,994 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:19:00,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:19:00,995 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 19:19:01,011 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 19:19:01,028 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 19:19:01,028 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:19:01,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:19:01,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:19:01,225 INFO L256 TraceCheckUtils]: 0: Hoare triple {637#true} call ULTIMATE.init(); {637#true} is VALID [2018-11-14 19:19:01,225 INFO L273 TraceCheckUtils]: 1: Hoare triple {637#true} assume true; {637#true} is VALID [2018-11-14 19:19:01,226 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {637#true} {637#true} #32#return; {637#true} is VALID [2018-11-14 19:19:01,226 INFO L256 TraceCheckUtils]: 3: Hoare triple {637#true} call #t~ret1 := main(); {637#true} is VALID [2018-11-14 19:19:01,230 INFO L273 TraceCheckUtils]: 4: Hoare triple {637#true} ~x~0 := 0;~y~0 := 1; {639#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:19:01,231 INFO L273 TraceCheckUtils]: 5: Hoare triple {639#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {639#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:19:01,232 INFO L273 TraceCheckUtils]: 6: Hoare triple {639#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {640#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:19:01,232 INFO L273 TraceCheckUtils]: 7: Hoare triple {640#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {640#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:19:01,233 INFO L273 TraceCheckUtils]: 8: Hoare triple {640#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {641#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:19:01,234 INFO L273 TraceCheckUtils]: 9: Hoare triple {641#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {641#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:19:01,235 INFO L273 TraceCheckUtils]: 10: Hoare triple {641#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {642#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:19:01,236 INFO L273 TraceCheckUtils]: 11: Hoare triple {642#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {642#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:19:01,237 INFO L273 TraceCheckUtils]: 12: Hoare triple {642#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {683#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:19:01,238 INFO L273 TraceCheckUtils]: 13: Hoare triple {683#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {683#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:19:01,239 INFO L273 TraceCheckUtils]: 14: Hoare triple {683#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(~x~0 % 4294967296 < 6); {638#false} is VALID [2018-11-14 19:19:01,240 INFO L256 TraceCheckUtils]: 15: Hoare triple {638#false} call __VERIFIER_assert((if ~y~0 % 4294967296 != 64 then 1 else 0)); {638#false} is VALID [2018-11-14 19:19:01,240 INFO L273 TraceCheckUtils]: 16: Hoare triple {638#false} ~cond := #in~cond; {638#false} is VALID [2018-11-14 19:19:01,240 INFO L273 TraceCheckUtils]: 17: Hoare triple {638#false} assume ~cond == 0; {638#false} is VALID [2018-11-14 19:19:01,241 INFO L273 TraceCheckUtils]: 18: Hoare triple {638#false} assume !false; {638#false} is VALID [2018-11-14 19:19:01,242 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:19:01,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:19:01,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-14 19:19:01,266 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-11-14 19:19:01,267 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:19:01,267 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 19:19:01,297 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-14 19:19:01,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 19:19:01,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 19:19:01,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-14 19:19:01,299 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 8 states. [2018-11-14 19:19:01,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:19:01,480 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-14 19:19:01,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 19:19:01,481 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-11-14 19:19:01,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:19:01,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 19:19:01,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2018-11-14 19:19:01,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 19:19:01,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2018-11-14 19:19:01,485 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 27 transitions. [2018-11-14 19:19:01,572 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:19:01,574 INFO L225 Difference]: With dead ends: 27 [2018-11-14 19:19:01,574 INFO L226 Difference]: Without dead ends: 22 [2018-11-14 19:19:01,575 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-14 19:19:01,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-14 19:19:01,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-14 19:19:01,609 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:19:01,609 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-14 19:19:01,609 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-14 19:19:01,609 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-14 19:19:01,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:19:01,611 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-14 19:19:01,611 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-14 19:19:01,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:19:01,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:19:01,612 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-14 19:19:01,612 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-14 19:19:01,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:19:01,614 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-14 19:19:01,614 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-14 19:19:01,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:19:01,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:19:01,614 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:19:01,615 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:19:01,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 19:19:01,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-11-14 19:19:01,616 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2018-11-14 19:19:01,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:19:01,617 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-11-14 19:19:01,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 19:19:01,617 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-14 19:19:01,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 19:19:01,618 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:19:01,618 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:19:01,618 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:19:01,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:19:01,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1097991946, now seen corresponding path program 5 times [2018-11-14 19:19:01,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:19:01,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:19:01,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:19:01,620 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:19:01,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:19:01,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:19:02,385 INFO L256 TraceCheckUtils]: 0: Hoare triple {820#true} call ULTIMATE.init(); {820#true} is VALID [2018-11-14 19:19:02,386 INFO L273 TraceCheckUtils]: 1: Hoare triple {820#true} assume true; {820#true} is VALID [2018-11-14 19:19:02,386 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {820#true} {820#true} #32#return; {820#true} is VALID [2018-11-14 19:19:02,387 INFO L256 TraceCheckUtils]: 3: Hoare triple {820#true} call #t~ret1 := main(); {820#true} is VALID [2018-11-14 19:19:02,388 INFO L273 TraceCheckUtils]: 4: Hoare triple {820#true} ~x~0 := 0;~y~0 := 1; {822#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:19:02,388 INFO L273 TraceCheckUtils]: 5: Hoare triple {822#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {822#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:19:02,389 INFO L273 TraceCheckUtils]: 6: Hoare triple {822#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {823#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:19:02,389 INFO L273 TraceCheckUtils]: 7: Hoare triple {823#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {823#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:19:02,390 INFO L273 TraceCheckUtils]: 8: Hoare triple {823#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {824#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:19:02,391 INFO L273 TraceCheckUtils]: 9: Hoare triple {824#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {824#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:19:02,392 INFO L273 TraceCheckUtils]: 10: Hoare triple {824#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {825#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:19:02,393 INFO L273 TraceCheckUtils]: 11: Hoare triple {825#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {825#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:19:02,394 INFO L273 TraceCheckUtils]: 12: Hoare triple {825#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {826#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:19:02,395 INFO L273 TraceCheckUtils]: 13: Hoare triple {826#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {826#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:19:02,397 INFO L273 TraceCheckUtils]: 14: Hoare triple {826#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {827#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 5))} is VALID [2018-11-14 19:19:02,398 INFO L273 TraceCheckUtils]: 15: Hoare triple {827#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 5))} assume true; {827#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 5))} is VALID [2018-11-14 19:19:02,399 INFO L273 TraceCheckUtils]: 16: Hoare triple {827#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 < 6); {821#false} is VALID [2018-11-14 19:19:02,399 INFO L256 TraceCheckUtils]: 17: Hoare triple {821#false} call __VERIFIER_assert((if ~y~0 % 4294967296 != 64 then 1 else 0)); {821#false} is VALID [2018-11-14 19:19:02,399 INFO L273 TraceCheckUtils]: 18: Hoare triple {821#false} ~cond := #in~cond; {821#false} is VALID [2018-11-14 19:19:02,400 INFO L273 TraceCheckUtils]: 19: Hoare triple {821#false} assume ~cond == 0; {821#false} is VALID [2018-11-14 19:19:02,400 INFO L273 TraceCheckUtils]: 20: Hoare triple {821#false} assume !false; {821#false} is VALID [2018-11-14 19:19:02,402 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:19:02,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:19:02,402 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 19:19:02,411 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 19:19:02,430 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-14 19:19:02,430 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:19:02,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:19:02,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:19:02,532 INFO L256 TraceCheckUtils]: 0: Hoare triple {820#true} call ULTIMATE.init(); {820#true} is VALID [2018-11-14 19:19:02,532 INFO L273 TraceCheckUtils]: 1: Hoare triple {820#true} assume true; {820#true} is VALID [2018-11-14 19:19:02,532 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {820#true} {820#true} #32#return; {820#true} is VALID [2018-11-14 19:19:02,533 INFO L256 TraceCheckUtils]: 3: Hoare triple {820#true} call #t~ret1 := main(); {820#true} is VALID [2018-11-14 19:19:02,533 INFO L273 TraceCheckUtils]: 4: Hoare triple {820#true} ~x~0 := 0;~y~0 := 1; {822#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:19:02,534 INFO L273 TraceCheckUtils]: 5: Hoare triple {822#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {822#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:19:02,534 INFO L273 TraceCheckUtils]: 6: Hoare triple {822#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {823#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:19:02,535 INFO L273 TraceCheckUtils]: 7: Hoare triple {823#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {823#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:19:02,537 INFO L273 TraceCheckUtils]: 8: Hoare triple {823#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {824#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:19:02,538 INFO L273 TraceCheckUtils]: 9: Hoare triple {824#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {824#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:19:02,539 INFO L273 TraceCheckUtils]: 10: Hoare triple {824#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {825#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:19:02,540 INFO L273 TraceCheckUtils]: 11: Hoare triple {825#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {825#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:19:02,541 INFO L273 TraceCheckUtils]: 12: Hoare triple {825#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {826#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:19:02,542 INFO L273 TraceCheckUtils]: 13: Hoare triple {826#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {826#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:19:02,543 INFO L273 TraceCheckUtils]: 14: Hoare triple {826#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {873#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:19:02,551 INFO L273 TraceCheckUtils]: 15: Hoare triple {873#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {873#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:19:02,552 INFO L273 TraceCheckUtils]: 16: Hoare triple {873#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 < 6); {821#false} is VALID [2018-11-14 19:19:02,552 INFO L256 TraceCheckUtils]: 17: Hoare triple {821#false} call __VERIFIER_assert((if ~y~0 % 4294967296 != 64 then 1 else 0)); {821#false} is VALID [2018-11-14 19:19:02,552 INFO L273 TraceCheckUtils]: 18: Hoare triple {821#false} ~cond := #in~cond; {821#false} is VALID [2018-11-14 19:19:02,552 INFO L273 TraceCheckUtils]: 19: Hoare triple {821#false} assume ~cond == 0; {821#false} is VALID [2018-11-14 19:19:02,553 INFO L273 TraceCheckUtils]: 20: Hoare triple {821#false} assume !false; {821#false} is VALID [2018-11-14 19:19:02,554 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:19:02,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:19:02,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-14 19:19:02,576 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-11-14 19:19:02,576 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:19:02,577 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 19:19:02,612 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:19:02,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 19:19:02,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 19:19:02,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-14 19:19:02,613 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 9 states. [2018-11-14 19:19:02,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:19:02,900 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-14 19:19:02,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 19:19:02,900 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-11-14 19:19:02,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:19:02,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 19:19:02,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2018-11-14 19:19:02,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 19:19:02,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2018-11-14 19:19:02,905 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 29 transitions. [2018-11-14 19:19:02,939 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-14 19:19:02,941 INFO L225 Difference]: With dead ends: 29 [2018-11-14 19:19:02,941 INFO L226 Difference]: Without dead ends: 24 [2018-11-14 19:19:02,941 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-14 19:19:02,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-14 19:19:02,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-14 19:19:02,960 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:19:02,961 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-14 19:19:02,961 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-14 19:19:02,961 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-14 19:19:02,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:19:02,963 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-14 19:19:02,963 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-14 19:19:02,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:19:02,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:19:02,964 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-14 19:19:02,964 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-14 19:19:02,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:19:02,966 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-14 19:19:02,966 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-14 19:19:02,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:19:02,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:19:02,967 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:19:02,967 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:19:02,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 19:19:02,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-11-14 19:19:02,969 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2018-11-14 19:19:02,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:19:02,969 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-11-14 19:19:02,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 19:19:02,970 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-14 19:19:02,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 19:19:02,970 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:19:02,971 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:19:02,971 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:19:02,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:19:02,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1908287044, now seen corresponding path program 6 times [2018-11-14 19:19:02,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:19:02,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:19:02,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:19:02,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:19:02,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:19:02,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-14 19:19:03,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-14 19:19:03,027 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-14 19:19:03,057 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 19:19:03,057 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-14 19:19:03,057 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-14 19:19:03,057 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-14 19:19:03,057 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2018-11-14 19:19:03,057 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 19:19:03,058 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-14 19:19:03,058 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-14 19:19:03,058 WARN L170 areAnnotationChecker]: L11-3 has no Hoare annotation [2018-11-14 19:19:03,058 WARN L170 areAnnotationChecker]: L11-3 has no Hoare annotation [2018-11-14 19:19:03,058 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-14 19:19:03,058 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-14 19:19:03,058 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 19:19:03,058 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2018-11-14 19:19:03,059 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2018-11-14 19:19:03,059 WARN L170 areAnnotationChecker]: L11-4 has no Hoare annotation [2018-11-14 19:19:03,059 WARN L170 areAnnotationChecker]: L11-4 has no Hoare annotation [2018-11-14 19:19:03,059 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 19:19:03,059 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 19:19:03,059 WARN L170 areAnnotationChecker]: L3-2 has no Hoare annotation [2018-11-14 19:19:03,059 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 19:19:03,060 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-14 19:19:03,060 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 19:19:03,060 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-14 19:19:03,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 07:19:03 BoogieIcfgContainer [2018-11-14 19:19:03,064 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 19:19:03,065 INFO L168 Benchmark]: Toolchain (without parser) took 7585.67 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.1 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -336.0 MB). Peak memory consumption was 401.1 MB. Max. memory is 7.1 GB. [2018-11-14 19:19:03,068 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 19:19:03,070 INFO L168 Benchmark]: CACSL2BoogieTranslator took 318.70 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-14 19:19:03,070 INFO L168 Benchmark]: Boogie Preprocessor took 37.29 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 19:19:03,072 INFO L168 Benchmark]: RCFGBuilder took 558.35 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -773.9 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2018-11-14 19:19:03,073 INFO L168 Benchmark]: TraceAbstraction took 6666.22 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 427.3 MB). Peak memory consumption was 427.3 MB. Max. memory is 7.1 GB. [2018-11-14 19:19:03,079 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 318.70 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.29 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 558.35 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -773.9 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6666.22 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 427.3 MB). Peak memory consumption was 427.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L9] unsigned int x = 0; [L10] unsigned int y = 1; VAL [x=0, y=1] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=1, y=2] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=2, y=4] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=3, y=8] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=4, y=16] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=5, y=32] [L11] COND TRUE x < 6 [L12] x++ [L13] y *= 2 VAL [x=6, y=64] [L11] COND FALSE !(x < 6) VAL [x=6, y=64] [L15] CALL __VERIFIER_assert(y != 64) VAL [\old(cond)=0] [L3] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L4] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 18 locations, 1 error locations. UNSAFE Result, 6.5s OverallTime, 8 OverallIterations, 7 TraceHistogramMax, 2.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 99 SDtfs, 0 SDslu, 252 SDs, 0 SdLazy, 135 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 84 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 214 NumberOfCodeBlocks, 214 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 179 ConstructedInterpolants, 0 QuantifiedInterpolants, 11741 SizeOfPredicates, 5 NumberOfNonLiveVariables, 215 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 0/140 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...