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/phases_true-unreach-call2_false-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 19:20:12,409 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 19:20:12,411 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 19:20:12,423 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 19:20:12,424 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 19:20:12,425 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 19:20:12,426 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 19:20:12,428 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 19:20:12,429 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 19:20:12,430 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 19:20:12,431 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 19:20:12,432 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 19:20:12,432 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 19:20:12,434 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 19:20:12,435 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 19:20:12,436 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 19:20:12,437 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 19:20:12,439 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 19:20:12,441 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 19:20:12,442 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 19:20:12,443 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 19:20:12,444 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 19:20:12,447 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 19:20:12,447 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 19:20:12,448 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 19:20:12,449 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 19:20:12,450 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 19:20:12,451 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 19:20:12,451 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 19:20:12,453 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 19:20:12,453 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 19:20:12,454 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 19:20:12,454 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 19:20:12,454 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 19:20:12,455 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 19:20:12,456 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 19:20:12,456 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:20:12,482 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 19:20:12,483 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 19:20:12,486 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 19:20:12,487 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 19:20:12,488 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 19:20:12,488 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 19:20:12,488 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 19:20:12,488 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 19:20:12,488 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 19:20:12,490 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 19:20:12,490 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 19:20:12,490 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 19:20:12,490 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 19:20:12,490 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 19:20:12,491 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 19:20:12,491 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 19:20:12,491 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 19:20:12,491 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 19:20:12,491 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 19:20:12,492 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 19:20:12,492 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 19:20:12,492 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 19:20:12,492 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 19:20:12,492 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 19:20:12,493 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 19:20:12,493 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 19:20:12,493 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 19:20:12,493 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 19:20:12,493 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 19:20:12,493 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 19:20:12,495 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 19:20:12,541 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 19:20:12,556 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 19:20:12,560 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 19:20:12,562 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 19:20:12,562 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 19:20:12,563 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/phases_true-unreach-call2_false-termination.i [2018-11-14 19:20:12,622 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80a8d0364/850526d7cfc544b88105c21e9c5143c1/FLAGcd9b80b6c [2018-11-14 19:20:13,061 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 19:20:13,061 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/phases_true-unreach-call2_false-termination.i [2018-11-14 19:20:13,067 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80a8d0364/850526d7cfc544b88105c21e9c5143c1/FLAGcd9b80b6c [2018-11-14 19:20:13,082 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80a8d0364/850526d7cfc544b88105c21e9c5143c1 [2018-11-14 19:20:13,092 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 19:20:13,093 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 19:20:13,094 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 19:20:13,094 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 19:20:13,099 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 19:20:13,101 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:20:13" (1/1) ... [2018-11-14 19:20:13,104 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b9ae0cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:20:13, skipping insertion in model container [2018-11-14 19:20:13,104 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:20:13" (1/1) ... [2018-11-14 19:20:13,115 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 19:20:13,140 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 19:20:13,394 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:20:13,400 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 19:20:13,419 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:20:13,433 INFO L195 MainTranslator]: Completed translation [2018-11-14 19:20:13,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:20:13 WrapperNode [2018-11-14 19:20:13,434 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 19:20:13,435 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 19:20:13,435 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 19:20:13,435 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 19:20:13,446 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:20:13" (1/1) ... [2018-11-14 19:20:13,446 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:20:13" (1/1) ... [2018-11-14 19:20:13,452 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:20:13" (1/1) ... [2018-11-14 19:20:13,453 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:20:13" (1/1) ... [2018-11-14 19:20:13,458 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:20:13" (1/1) ... [2018-11-14 19:20:13,463 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:20:13" (1/1) ... [2018-11-14 19:20:13,464 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:20:13" (1/1) ... [2018-11-14 19:20:13,465 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 19:20:13,466 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 19:20:13,466 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 19:20:13,466 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 19:20:13,467 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:20:13" (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:20:13,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 19:20:13,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 19:20:13,600 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 19:20:13,600 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 19:20:13,600 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 19:20:13,600 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-14 19:20:13,601 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2018-11-14 19:20:13,601 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 19:20:13,601 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 19:20:13,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 19:20:13,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 19:20:14,034 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 19:20:14,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:20:14 BoogieIcfgContainer [2018-11-14 19:20:14,035 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 19:20:14,036 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 19:20:14,036 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 19:20:14,040 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 19:20:14,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 07:20:13" (1/3) ... [2018-11-14 19:20:14,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@315e6c83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:20:14, skipping insertion in model container [2018-11-14 19:20:14,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:20:13" (2/3) ... [2018-11-14 19:20:14,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@315e6c83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:20:14, skipping insertion in model container [2018-11-14 19:20:14,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:20:14" (3/3) ... [2018-11-14 19:20:14,045 INFO L112 eAbstractionObserver]: Analyzing ICFG phases_true-unreach-call2_false-termination.i [2018-11-14 19:20:14,055 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 19:20:14,062 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 19:20:14,076 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 19:20:14,106 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 19:20:14,107 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 19:20:14,107 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 19:20:14,108 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 19:20:14,108 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 19:20:14,108 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 19:20:14,108 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 19:20:14,108 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 19:20:14,108 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 19:20:14,128 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-14 19:20:14,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-14 19:20:14,134 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:20:14,136 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:20:14,138 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:20:14,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:20:14,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1994259344, now seen corresponding path program 1 times [2018-11-14 19:20:14,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:20:14,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:20:14,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:14,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:20:14,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:14,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:14,283 INFO L256 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {23#true} is VALID [2018-11-14 19:20:14,287 INFO L273 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2018-11-14 19:20:14,287 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #42#return; {23#true} is VALID [2018-11-14 19:20:14,287 INFO L256 TraceCheckUtils]: 3: Hoare triple {23#true} call #t~ret3 := main(); {23#true} is VALID [2018-11-14 19:20:14,288 INFO L273 TraceCheckUtils]: 4: Hoare triple {23#true} ~x~0 := 1;~y~0 := #t~nondet1;havoc #t~nondet1; {23#true} is VALID [2018-11-14 19:20:14,288 INFO L273 TraceCheckUtils]: 5: Hoare triple {23#true} assume !!(~y~0 % 4294967296 > 0); {23#true} is VALID [2018-11-14 19:20:14,289 INFO L273 TraceCheckUtils]: 6: Hoare triple {23#true} assume !true; {24#false} is VALID [2018-11-14 19:20:14,290 INFO L256 TraceCheckUtils]: 7: Hoare triple {24#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~y~0 % 4294967296 then 1 else 0)); {24#false} is VALID [2018-11-14 19:20:14,290 INFO L273 TraceCheckUtils]: 8: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2018-11-14 19:20:14,290 INFO L273 TraceCheckUtils]: 9: Hoare triple {24#false} assume ~cond == 0; {24#false} is VALID [2018-11-14 19:20:14,291 INFO L273 TraceCheckUtils]: 10: Hoare triple {24#false} assume !false; {24#false} is VALID [2018-11-14 19:20:14,294 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:20:14,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:20:14,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 19:20:14,302 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-14 19:20:14,305 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:20:14,314 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 19:20:14,378 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:20:14,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 19:20:14,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 19:20:14,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 19:20:14,390 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2018-11-14 19:20:14,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:14,533 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-14 19:20:14,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 19:20:14,534 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-14 19:20:14,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:20:14,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 19:20:14,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 36 transitions. [2018-11-14 19:20:14,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 19:20:14,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 36 transitions. [2018-11-14 19:20:14,551 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 36 transitions. [2018-11-14 19:20:14,882 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:20:14,892 INFO L225 Difference]: With dead ends: 31 [2018-11-14 19:20:14,892 INFO L226 Difference]: Without dead ends: 14 [2018-11-14 19:20:14,895 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:20:14,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-14 19:20:15,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-14 19:20:15,025 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:20:15,026 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-14 19:20:15,027 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-14 19:20:15,027 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-14 19:20:15,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:15,031 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2018-11-14 19:20:15,031 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-14 19:20:15,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:15,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:15,032 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-14 19:20:15,033 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-14 19:20:15,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:15,036 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2018-11-14 19:20:15,036 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-14 19:20:15,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:15,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:15,037 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:20:15,037 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:20:15,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 19:20:15,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-11-14 19:20:15,041 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2018-11-14 19:20:15,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:20:15,041 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-11-14 19:20:15,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 19:20:15,042 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-14 19:20:15,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-14 19:20:15,043 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:20:15,043 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:20:15,043 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:20:15,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:20:15,044 INFO L82 PathProgramCache]: Analyzing trace with hash -2119643788, now seen corresponding path program 1 times [2018-11-14 19:20:15,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:20:15,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:20:15,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:15,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:20:15,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:15,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:15,828 INFO L256 TraceCheckUtils]: 0: Hoare triple {116#true} call ULTIMATE.init(); {116#true} is VALID [2018-11-14 19:20:15,829 INFO L273 TraceCheckUtils]: 1: Hoare triple {116#true} assume true; {116#true} is VALID [2018-11-14 19:20:15,829 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {116#true} {116#true} #42#return; {116#true} is VALID [2018-11-14 19:20:15,830 INFO L256 TraceCheckUtils]: 3: Hoare triple {116#true} call #t~ret3 := main(); {116#true} is VALID [2018-11-14 19:20:15,832 INFO L273 TraceCheckUtils]: 4: Hoare triple {116#true} ~x~0 := 1;~y~0 := #t~nondet1;havoc #t~nondet1; {118#(and (or (<= main_~x~0 1) (<= (+ (* 4294967296 (div main_~y~0 4294967296)) main_~x~0) (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 19:20:15,833 INFO L273 TraceCheckUtils]: 5: Hoare triple {118#(and (or (<= main_~x~0 1) (<= (+ (* 4294967296 (div main_~y~0 4294967296)) main_~x~0) (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !!(~y~0 % 4294967296 > 0); {119#(and (<= (+ (* 4294967296 (div main_~y~0 4294967296)) main_~x~0) (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 19:20:15,840 INFO L273 TraceCheckUtils]: 6: Hoare triple {119#(and (<= (+ (* 4294967296 (div main_~y~0 4294967296)) main_~x~0) (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {119#(and (<= (+ (* 4294967296 (div main_~y~0 4294967296)) main_~x~0) (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 19:20:15,841 INFO L273 TraceCheckUtils]: 7: Hoare triple {119#(and (<= (+ (* 4294967296 (div main_~y~0 4294967296)) main_~x~0) (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {120#(and (<= (+ (* 4294967296 (div main_~y~0 4294967296)) main_~x~0) (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) (+ (* 4294967296 (div main_~y~0 4294967296)) main_~x~0)) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 19:20:15,843 INFO L256 TraceCheckUtils]: 8: Hoare triple {120#(and (<= (+ (* 4294967296 (div main_~y~0 4294967296)) main_~x~0) (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) (+ (* 4294967296 (div main_~y~0 4294967296)) main_~x~0)) (< 0 (+ (div main_~x~0 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~y~0 % 4294967296 then 1 else 0)); {121#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 19:20:15,860 INFO L273 TraceCheckUtils]: 9: Hoare triple {121#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {122#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-14 19:20:15,870 INFO L273 TraceCheckUtils]: 10: Hoare triple {122#(= __VERIFIER_assert_~cond 1)} assume ~cond == 0; {117#false} is VALID [2018-11-14 19:20:15,870 INFO L273 TraceCheckUtils]: 11: Hoare triple {117#false} assume !false; {117#false} is VALID [2018-11-14 19:20:15,873 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:20:15,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:20:15,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-14 19:20:15,876 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-11-14 19:20:15,876 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:20:15,876 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 19:20:15,941 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:20:15,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 19:20:15,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 19:20:15,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-14 19:20:15,943 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 7 states. [2018-11-14 19:20:20,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:20,370 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-14 19:20:20,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 19:20:20,371 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-11-14 19:20:20,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:20:20,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 19:20:20,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2018-11-14 19:20:20,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 19:20:20,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2018-11-14 19:20:20,376 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 24 transitions. [2018-11-14 19:20:20,422 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:20:20,424 INFO L225 Difference]: With dead ends: 22 [2018-11-14 19:20:20,424 INFO L226 Difference]: Without dead ends: 17 [2018-11-14 19:20:20,425 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-14 19:20:20,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-14 19:20:20,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-11-14 19:20:20,437 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:20:20,438 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 16 states. [2018-11-14 19:20:20,438 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 16 states. [2018-11-14 19:20:20,438 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 16 states. [2018-11-14 19:20:20,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:20,441 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2018-11-14 19:20:20,441 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2018-11-14 19:20:20,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:20,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:20,442 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 17 states. [2018-11-14 19:20:20,443 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 17 states. [2018-11-14 19:20:20,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:20,445 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2018-11-14 19:20:20,445 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2018-11-14 19:20:20,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:20,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:20,446 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:20:20,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:20:20,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 19:20:20,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-11-14 19:20:20,448 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 12 [2018-11-14 19:20:20,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:20:20,448 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-11-14 19:20:20,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 19:20:20,448 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-11-14 19:20:20,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 19:20:20,450 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:20:20,450 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:20:20,450 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:20:20,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:20:20,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1430769513, now seen corresponding path program 1 times [2018-11-14 19:20:20,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:20:20,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:20:20,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:20,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:20:20,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:20,461 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 19:20:20,461 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 19:20:20,461 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 19:20:20,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:20:20,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:20,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:20,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:20:20,618 INFO L256 TraceCheckUtils]: 0: Hoare triple {217#true} call ULTIMATE.init(); {217#true} is VALID [2018-11-14 19:20:20,619 INFO L273 TraceCheckUtils]: 1: Hoare triple {217#true} assume true; {217#true} is VALID [2018-11-14 19:20:20,619 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {217#true} {217#true} #42#return; {217#true} is VALID [2018-11-14 19:20:20,619 INFO L256 TraceCheckUtils]: 3: Hoare triple {217#true} call #t~ret3 := main(); {217#true} is VALID [2018-11-14 19:20:20,620 INFO L273 TraceCheckUtils]: 4: Hoare triple {217#true} ~x~0 := 1;~y~0 := #t~nondet1;havoc #t~nondet1; {234#(= main_~x~0 1)} is VALID [2018-11-14 19:20:20,621 INFO L273 TraceCheckUtils]: 5: Hoare triple {234#(= main_~x~0 1)} assume !!(~y~0 % 4294967296 > 0); {234#(= main_~x~0 1)} is VALID [2018-11-14 19:20:20,621 INFO L273 TraceCheckUtils]: 6: Hoare triple {234#(= main_~x~0 1)} assume true; {234#(= main_~x~0 1)} is VALID [2018-11-14 19:20:20,623 INFO L273 TraceCheckUtils]: 7: Hoare triple {234#(= main_~x~0 1)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {244#(and (= main_~x~0 1) (< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2018-11-14 19:20:20,624 INFO L273 TraceCheckUtils]: 8: Hoare triple {244#(and (= main_~x~0 1) (< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296)))} assume ~x~0 % 4294967296 < (if ~y~0 % 4294967296 < 0 && ~y~0 % 4294967296 % (~x~0 % 4294967296) != 0 then (if ~x~0 % 4294967296 < 0 then ~y~0 % 4294967296 / (~x~0 % 4294967296) - 1 else ~y~0 % 4294967296 / (~x~0 % 4294967296) + 1) else ~y~0 % 4294967296 / (~x~0 % 4294967296)) % 4294967296;~x~0 := ~x~0 * ~x~0; {244#(and (= main_~x~0 1) (< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2018-11-14 19:20:20,625 INFO L273 TraceCheckUtils]: 9: Hoare triple {244#(and (= main_~x~0 1) (< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296)))} assume true; {244#(and (= main_~x~0 1) (< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2018-11-14 19:20:20,625 INFO L273 TraceCheckUtils]: 10: Hoare triple {244#(and (= main_~x~0 1) (< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {218#false} is VALID [2018-11-14 19:20:20,625 INFO L256 TraceCheckUtils]: 11: Hoare triple {218#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~y~0 % 4294967296 then 1 else 0)); {218#false} is VALID [2018-11-14 19:20:20,626 INFO L273 TraceCheckUtils]: 12: Hoare triple {218#false} ~cond := #in~cond; {218#false} is VALID [2018-11-14 19:20:20,626 INFO L273 TraceCheckUtils]: 13: Hoare triple {218#false} assume ~cond == 0; {218#false} is VALID [2018-11-14 19:20:20,626 INFO L273 TraceCheckUtils]: 14: Hoare triple {218#false} assume !false; {218#false} is VALID [2018-11-14 19:20:20,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:20:20,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:20:20,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 19:20:20,649 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-14 19:20:20,650 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:20:20,650 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 19:20:20,670 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:20:20,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 19:20:20,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 19:20:20,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 19:20:20,672 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 4 states. [2018-11-14 19:20:24,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:24,754 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-11-14 19:20:24,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 19:20:24,755 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-14 19:20:24,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:20:24,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 19:20:24,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2018-11-14 19:20:24,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 19:20:24,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2018-11-14 19:20:24,759 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 26 transitions. [2018-11-14 19:20:24,856 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:20:24,857 INFO L225 Difference]: With dead ends: 24 [2018-11-14 19:20:24,857 INFO L226 Difference]: Without dead ends: 19 [2018-11-14 19:20:24,858 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 19:20:24,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-14 19:20:24,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-11-14 19:20:24,872 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:20:24,872 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 17 states. [2018-11-14 19:20:24,872 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 17 states. [2018-11-14 19:20:24,873 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 17 states. [2018-11-14 19:20:24,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:24,875 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-11-14 19:20:24,875 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-14 19:20:24,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:24,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:24,876 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 19 states. [2018-11-14 19:20:24,876 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 19 states. [2018-11-14 19:20:24,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:24,878 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-11-14 19:20:24,878 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-14 19:20:24,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:24,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:24,879 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:20:24,879 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:20:24,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 19:20:24,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-11-14 19:20:24,881 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 15 [2018-11-14 19:20:24,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:20:24,881 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-14 19:20:24,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 19:20:24,882 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2018-11-14 19:20:24,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 19:20:24,883 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:20:24,883 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:20:24,883 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:20:24,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:20:24,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1089190421, now seen corresponding path program 1 times [2018-11-14 19:20:24,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:20:24,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:20:24,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:24,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:20:24,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:24,891 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 19:20:24,891 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 19:20:24,891 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 19:20:24,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:20:24,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:24,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:24,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:20:25,192 INFO L256 TraceCheckUtils]: 0: Hoare triple {363#true} call ULTIMATE.init(); {363#true} is VALID [2018-11-14 19:20:25,193 INFO L273 TraceCheckUtils]: 1: Hoare triple {363#true} assume true; {363#true} is VALID [2018-11-14 19:20:25,193 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {363#true} {363#true} #42#return; {363#true} is VALID [2018-11-14 19:20:25,193 INFO L256 TraceCheckUtils]: 3: Hoare triple {363#true} call #t~ret3 := main(); {363#true} is VALID [2018-11-14 19:20:25,195 INFO L273 TraceCheckUtils]: 4: Hoare triple {363#true} ~x~0 := 1;~y~0 := #t~nondet1;havoc #t~nondet1; {380#(= main_~x~0 1)} is VALID [2018-11-14 19:20:25,196 INFO L273 TraceCheckUtils]: 5: Hoare triple {380#(= main_~x~0 1)} assume !!(~y~0 % 4294967296 > 0); {380#(= main_~x~0 1)} is VALID [2018-11-14 19:20:25,196 INFO L273 TraceCheckUtils]: 6: Hoare triple {380#(= main_~x~0 1)} assume true; {380#(= main_~x~0 1)} is VALID [2018-11-14 19:20:25,197 INFO L273 TraceCheckUtils]: 7: Hoare triple {380#(= main_~x~0 1)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {390#(and (= main_~x~0 1) (< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2018-11-14 19:20:25,199 INFO L273 TraceCheckUtils]: 8: Hoare triple {390#(and (= main_~x~0 1) (< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 < (if ~y~0 % 4294967296 < 0 && ~y~0 % 4294967296 % (~x~0 % 4294967296) != 0 then (if ~x~0 % 4294967296 < 0 then ~y~0 % 4294967296 / (~x~0 % 4294967296) - 1 else ~y~0 % 4294967296 / (~x~0 % 4294967296) + 1) else ~y~0 % 4294967296 / (~x~0 % 4294967296)) % 4294967296);#t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {394#(and (= main_~x~0 2) (< 1 (mod main_~y~0 4294967296)))} is VALID [2018-11-14 19:20:25,201 INFO L273 TraceCheckUtils]: 9: Hoare triple {394#(and (= main_~x~0 2) (< 1 (mod main_~y~0 4294967296)))} assume true; {394#(and (= main_~x~0 2) (< 1 (mod main_~y~0 4294967296)))} is VALID [2018-11-14 19:20:25,202 INFO L273 TraceCheckUtils]: 10: Hoare triple {394#(and (= main_~x~0 2) (< 1 (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {401#(and (= main_~x~0 2) (<= (mod main_~y~0 4294967296) (mod main_~x~0 4294967296)) (< 1 (mod main_~y~0 4294967296)))} is VALID [2018-11-14 19:20:25,204 INFO L256 TraceCheckUtils]: 11: Hoare triple {401#(and (= main_~x~0 2) (<= (mod main_~y~0 4294967296) (mod main_~x~0 4294967296)) (< 1 (mod main_~y~0 4294967296)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~y~0 % 4294967296 then 1 else 0)); {405#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 19:20:25,206 INFO L273 TraceCheckUtils]: 12: Hoare triple {405#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {409#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 19:20:25,211 INFO L273 TraceCheckUtils]: 13: Hoare triple {409#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {364#false} is VALID [2018-11-14 19:20:25,212 INFO L273 TraceCheckUtils]: 14: Hoare triple {364#false} assume !false; {364#false} is VALID [2018-11-14 19:20:25,213 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:20:25,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 19:20:25,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-11-14 19:20:25,234 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-11-14 19:20:25,234 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:20:25,235 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 19:20:25,263 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:20:25,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 19:20:25,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 19:20:25,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-14 19:20:25,264 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 8 states. [2018-11-14 19:20:31,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:31,776 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-14 19:20:31,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 19:20:31,776 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-11-14 19:20:31,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:20:31,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 19:20:31,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2018-11-14 19:20:31,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 19:20:31,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2018-11-14 19:20:31,782 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 30 transitions. [2018-11-14 19:20:33,882 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 29 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-14 19:20:33,883 INFO L225 Difference]: With dead ends: 27 [2018-11-14 19:20:33,883 INFO L226 Difference]: Without dead ends: 22 [2018-11-14 19:20:33,884 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-14 19:20:33,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-14 19:20:33,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2018-11-14 19:20:33,905 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:20:33,905 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 19 states. [2018-11-14 19:20:33,905 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 19 states. [2018-11-14 19:20:33,905 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 19 states. [2018-11-14 19:20:33,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:33,907 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2018-11-14 19:20:33,908 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-11-14 19:20:33,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:33,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:33,908 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 22 states. [2018-11-14 19:20:33,909 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 22 states. [2018-11-14 19:20:33,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:33,911 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2018-11-14 19:20:33,911 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-11-14 19:20:33,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:33,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:33,912 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:20:33,912 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:20:33,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 19:20:33,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-11-14 19:20:33,914 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2018-11-14 19:20:33,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:20:33,914 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-11-14 19:20:33,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 19:20:33,914 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-14 19:20:33,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 19:20:33,915 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:20:33,915 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:20:33,915 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:20:33,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:20:33,915 INFO L82 PathProgramCache]: Analyzing trace with hash -759205998, now seen corresponding path program 1 times [2018-11-14 19:20:33,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:20:33,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:20:33,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:33,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:20:33,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:33,922 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 19:20:33,922 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 19:20:33,922 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 19:20:33,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:20:33,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:33,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:33,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:20:34,068 INFO L256 TraceCheckUtils]: 0: Hoare triple {528#true} call ULTIMATE.init(); {528#true} is VALID [2018-11-14 19:20:34,068 INFO L273 TraceCheckUtils]: 1: Hoare triple {528#true} assume true; {528#true} is VALID [2018-11-14 19:20:34,069 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {528#true} {528#true} #42#return; {528#true} is VALID [2018-11-14 19:20:34,069 INFO L256 TraceCheckUtils]: 3: Hoare triple {528#true} call #t~ret3 := main(); {528#true} is VALID [2018-11-14 19:20:34,069 INFO L273 TraceCheckUtils]: 4: Hoare triple {528#true} ~x~0 := 1;~y~0 := #t~nondet1;havoc #t~nondet1; {545#(= main_~x~0 1)} is VALID [2018-11-14 19:20:34,071 INFO L273 TraceCheckUtils]: 5: Hoare triple {545#(= main_~x~0 1)} assume !!(~y~0 % 4294967296 > 0); {545#(= main_~x~0 1)} is VALID [2018-11-14 19:20:34,071 INFO L273 TraceCheckUtils]: 6: Hoare triple {545#(= main_~x~0 1)} assume true; {545#(= main_~x~0 1)} is VALID [2018-11-14 19:20:34,073 INFO L273 TraceCheckUtils]: 7: Hoare triple {545#(= main_~x~0 1)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {545#(= main_~x~0 1)} is VALID [2018-11-14 19:20:34,073 INFO L273 TraceCheckUtils]: 8: Hoare triple {545#(= main_~x~0 1)} assume !(~x~0 % 4294967296 < (if ~y~0 % 4294967296 < 0 && ~y~0 % 4294967296 % (~x~0 % 4294967296) != 0 then (if ~x~0 % 4294967296 < 0 then ~y~0 % 4294967296 / (~x~0 % 4294967296) - 1 else ~y~0 % 4294967296 / (~x~0 % 4294967296) + 1) else ~y~0 % 4294967296 / (~x~0 % 4294967296)) % 4294967296);#t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {558#(and (= main_~x~0 2) (<= (mod (div (mod main_~y~0 4294967296) 1) 4294967296) 1))} is VALID [2018-11-14 19:20:34,076 INFO L273 TraceCheckUtils]: 9: Hoare triple {558#(and (= main_~x~0 2) (<= (mod (div (mod main_~y~0 4294967296) 1) 4294967296) 1))} assume true; {558#(and (= main_~x~0 2) (<= (mod (div (mod main_~y~0 4294967296) 1) 4294967296) 1))} is VALID [2018-11-14 19:20:34,078 INFO L273 TraceCheckUtils]: 10: Hoare triple {558#(and (= main_~x~0 2) (<= (mod (div (mod main_~y~0 4294967296) 1) 4294967296) 1))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {529#false} is VALID [2018-11-14 19:20:34,078 INFO L273 TraceCheckUtils]: 11: Hoare triple {529#false} assume ~x~0 % 4294967296 < (if ~y~0 % 4294967296 < 0 && ~y~0 % 4294967296 % (~x~0 % 4294967296) != 0 then (if ~x~0 % 4294967296 < 0 then ~y~0 % 4294967296 / (~x~0 % 4294967296) - 1 else ~y~0 % 4294967296 / (~x~0 % 4294967296) + 1) else ~y~0 % 4294967296 / (~x~0 % 4294967296)) % 4294967296;~x~0 := ~x~0 * ~x~0; {529#false} is VALID [2018-11-14 19:20:34,078 INFO L273 TraceCheckUtils]: 12: Hoare triple {529#false} assume true; {529#false} is VALID [2018-11-14 19:20:34,078 INFO L273 TraceCheckUtils]: 13: Hoare triple {529#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {529#false} is VALID [2018-11-14 19:20:34,079 INFO L256 TraceCheckUtils]: 14: Hoare triple {529#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~y~0 % 4294967296 then 1 else 0)); {529#false} is VALID [2018-11-14 19:20:34,079 INFO L273 TraceCheckUtils]: 15: Hoare triple {529#false} ~cond := #in~cond; {529#false} is VALID [2018-11-14 19:20:34,079 INFO L273 TraceCheckUtils]: 16: Hoare triple {529#false} assume ~cond == 0; {529#false} is VALID [2018-11-14 19:20:34,079 INFO L273 TraceCheckUtils]: 17: Hoare triple {529#false} assume !false; {529#false} is VALID [2018-11-14 19:20:34,080 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:20:34,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 19:20:34,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-11-14 19:20:34,102 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-14 19:20:34,102 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:20:34,102 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 19:20:34,125 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:20:34,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 19:20:34,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 19:20:34,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 19:20:34,126 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 4 states. [2018-11-14 19:20:34,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:34,352 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-11-14 19:20:34,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 19:20:34,352 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-14 19:20:34,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:20:34,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 19:20:34,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2018-11-14 19:20:34,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 19:20:34,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2018-11-14 19:20:34,356 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 21 transitions. [2018-11-14 19:20:34,390 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:20:34,390 INFO L225 Difference]: With dead ends: 19 [2018-11-14 19:20:34,391 INFO L226 Difference]: Without dead ends: 0 [2018-11-14 19:20:34,392 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 19:20:34,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-14 19:20:34,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-14 19:20:34,392 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:20:34,393 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-14 19:20:34,393 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 19:20:34,393 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 19:20:34,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:34,393 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 19:20:34,393 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 19:20:34,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:34,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:34,394 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 19:20:34,394 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 19:20:34,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:34,394 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 19:20:34,394 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 19:20:34,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:34,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:34,395 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:20:34,395 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:20:34,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-14 19:20:34,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-14 19:20:34,396 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2018-11-14 19:20:34,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:20:34,396 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-14 19:20:34,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 19:20:34,396 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 19:20:34,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:34,400 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-14 19:20:34,521 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-14 19:20:34,521 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-14 19:20:34,521 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-14 19:20:34,521 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-14 19:20:34,521 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-14 19:20:34,521 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-14 19:20:34,522 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 22) the Hoare annotation is: true [2018-11-14 19:20:34,522 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 22) no Hoare annotation was computed. [2018-11-14 19:20:34,522 INFO L425 ceAbstractionStarter]: For program point L15(lines 15 19) no Hoare annotation was computed. [2018-11-14 19:20:34,522 INFO L425 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2018-11-14 19:20:34,522 INFO L425 ceAbstractionStarter]: For program point L14-1(lines 14 20) no Hoare annotation was computed. [2018-11-14 19:20:34,522 INFO L421 ceAbstractionStarter]: At program point L15-2(lines 14 20) the Hoare annotation is: (and (= main_~x~0 1) (<= (+ (* 4294967296 (div main_~y~0 4294967296)) main_~x~0) (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))) [2018-11-14 19:20:34,522 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 22) no Hoare annotation was computed. [2018-11-14 19:20:34,523 INFO L421 ceAbstractionStarter]: At program point L14-3(lines 14 20) the Hoare annotation is: (let ((.cse2 (div main_~x~0 4294967296))) (let ((.cse1 (+ main_~y~0 (* 4294967296 .cse2))) (.cse0 (+ (* 4294967296 (div main_~y~0 4294967296)) main_~x~0))) (and (<= .cse0 .cse1) (<= .cse1 .cse0) (< 0 (+ .cse2 1))))) [2018-11-14 19:20:34,523 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 4 9) the Hoare annotation is: true [2018-11-14 19:20:34,523 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 4 9) no Hoare annotation was computed. [2018-11-14 19:20:34,523 INFO L425 ceAbstractionStarter]: For program point L6(line 6) no Hoare annotation was computed. [2018-11-14 19:20:34,523 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2018-11-14 19:20:34,523 INFO L425 ceAbstractionStarter]: For program point L5(lines 5 7) no Hoare annotation was computed. [2018-11-14 19:20:34,523 INFO L425 ceAbstractionStarter]: For program point L5-2(lines 4 9) no Hoare annotation was computed. [2018-11-14 19:20:34,525 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 19:20:34,525 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2018-11-14 19:20:34,525 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-14 19:20:34,525 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 19:20:34,525 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 19:20:34,525 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2018-11-14 19:20:34,525 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2018-11-14 19:20:34,526 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-14 19:20:34,526 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-14 19:20:34,526 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 19:20:34,526 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 19:20:34,526 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2018-11-14 19:20:34,526 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2018-11-14 19:20:34,527 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2018-11-14 19:20:34,527 WARN L170 areAnnotationChecker]: L5-2 has no Hoare annotation [2018-11-14 19:20:34,527 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 19:20:34,527 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2018-11-14 19:20:34,527 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2018-11-14 19:20:34,527 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 19:20:34,527 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-14 19:20:34,527 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-14 19:20:34,527 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-14 19:20:34,528 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-14 19:20:34,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 07:20:34 BoogieIcfgContainer [2018-11-14 19:20:34,536 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 19:20:34,537 INFO L168 Benchmark]: Toolchain (without parser) took 21444.94 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 735.1 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -506.0 MB). Peak memory consumption was 229.0 MB. Max. memory is 7.1 GB. [2018-11-14 19:20:34,539 INFO L168 Benchmark]: CDTParser took 0.20 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:20:34,540 INFO L168 Benchmark]: CACSL2BoogieTranslator took 340.33 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:20:34,541 INFO L168 Benchmark]: Boogie Preprocessor took 30.89 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:20:34,542 INFO L168 Benchmark]: RCFGBuilder took 569.57 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 735.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -784.5 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2018-11-14 19:20:34,543 INFO L168 Benchmark]: TraceAbstraction took 20499.64 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 267.9 MB). Peak memory consumption was 267.9 MB. Max. memory is 7.1 GB. [2018-11-14 19:20:34,547 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.20 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 340.33 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 30.89 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 569.57 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 735.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -784.5 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20499.64 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 267.9 MB). Peak memory consumption was 267.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: x == 1 && 4294967296 * (y / 4294967296) + x <= y + 4294967296 * (x / 4294967296) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. SAFE Result, 20.4s OverallTime, 5 OverallIterations, 3 TraceHistogramMax, 18.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 64 SDtfs, 13 SDslu, 111 SDs, 0 SdLazy, 98 SolverSat, 3 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 8.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, 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.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 6 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 11 PreInvPairs, 15 NumberOfFragments, 62 HoareAnnotationTreeSize, 11 FomulaSimplifications, 58 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 54 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 71 NumberOfCodeBlocks, 71 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 66 ConstructedInterpolants, 0 QuantifiedInterpolants, 3885 SizeOfPredicates, 2 NumberOfNonLiveVariables, 98 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 7/11 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...