java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-acceleration/diamond_true-unreach-call1_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:06:49,954 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:06:49,956 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:06:49,975 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:06:49,975 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:06:49,976 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:06:49,978 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:06:49,980 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:06:49,983 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:06:49,991 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:06:49,992 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:06:49,992 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:06:49,995 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:06:49,995 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:06:49,996 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:06:49,997 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:06:49,999 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:06:50,001 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:06:50,005 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:06:50,007 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:06:50,008 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:06:50,011 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:06:50,017 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:06:50,017 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:06:50,018 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:06:50,019 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:06:50,020 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:06:50,021 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:06:50,021 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:06:50,025 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:06:50,025 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:06:50,026 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:06:50,026 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:06:50,028 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:06:50,029 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:06:50,031 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:06:50,031 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:06:50,060 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:06:50,061 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:06:50,062 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:06:50,062 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:06:50,062 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:06:50,063 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:06:50,064 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:06:50,064 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:06:50,064 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:06:50,064 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:06:50,065 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:06:50,065 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:06:50,065 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:06:50,065 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:06:50,065 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:06:50,066 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:06:50,066 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:06:50,066 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:06:50,066 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:06:50,066 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:06:50,066 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:06:50,067 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:06:50,067 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:06:50,067 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:06:50,067 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:06:50,067 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:06:50,068 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:06:50,068 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:06:50,068 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:06:50,068 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:06:50,068 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:06:50,110 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:06:50,128 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:06:50,133 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:06:50,135 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:06:50,135 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:06:50,136 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/diamond_true-unreach-call1_true-termination.i [2018-11-23 13:06:50,198 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f27e8aaf3/f31547fe7dc545049780e18a0aa4e279/FLAGb2d12d094 [2018-11-23 13:06:50,656 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:06:50,656 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_true-unreach-call1_true-termination.i [2018-11-23 13:06:50,662 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f27e8aaf3/f31547fe7dc545049780e18a0aa4e279/FLAGb2d12d094 [2018-11-23 13:06:51,003 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f27e8aaf3/f31547fe7dc545049780e18a0aa4e279 [2018-11-23 13:06:51,012 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:06:51,013 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:06:51,014 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:06:51,015 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:06:51,018 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:06:51,020 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:06:51" (1/1) ... [2018-11-23 13:06:51,023 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62849221 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:51, skipping insertion in model container [2018-11-23 13:06:51,023 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:06:51" (1/1) ... [2018-11-23 13:06:51,032 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:06:51,056 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:06:51,268 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:06:51,275 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:06:51,296 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:06:51,314 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:06:51,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:51 WrapperNode [2018-11-23 13:06:51,315 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:06:51,316 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:06:51,316 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:06:51,316 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:06:51,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:51" (1/1) ... [2018-11-23 13:06:51,330 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:51" (1/1) ... [2018-11-23 13:06:51,337 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:06:51,337 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:06:51,337 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:06:51,337 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:06:51,346 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:51" (1/1) ... [2018-11-23 13:06:51,346 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:51" (1/1) ... [2018-11-23 13:06:51,347 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:51" (1/1) ... [2018-11-23 13:06:51,347 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:51" (1/1) ... [2018-11-23 13:06:51,352 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:51" (1/1) ... [2018-11-23 13:06:51,358 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:51" (1/1) ... [2018-11-23 13:06:51,359 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:51" (1/1) ... [2018-11-23 13:06:51,360 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:06:51,360 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:06:51,361 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:06:51,361 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:06:51,362 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:06:51,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:06:51,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:06:51,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:06:51,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:06:51,479 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:06:51,479 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:06:51,480 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:06:51,480 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:06:51,919 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:06:51,919 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:06:51,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:06:51 BoogieIcfgContainer [2018-11-23 13:06:51,920 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:06:51,923 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:06:51,923 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:06:51,929 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:06:51,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:06:51" (1/3) ... [2018-11-23 13:06:51,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38483da4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:06:51, skipping insertion in model container [2018-11-23 13:06:51,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:51" (2/3) ... [2018-11-23 13:06:51,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38483da4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:06:51, skipping insertion in model container [2018-11-23 13:06:51,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:06:51" (3/3) ... [2018-11-23 13:06:51,933 INFO L112 eAbstractionObserver]: Analyzing ICFG diamond_true-unreach-call1_true-termination.i [2018-11-23 13:06:51,941 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:06:51,948 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:06:51,963 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:06:51,997 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:06:51,998 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:06:51,998 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:06:51,998 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:06:51,998 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:06:51,999 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:06:51,999 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:06:51,999 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:06:51,999 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:06:52,018 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-11-23 13:06:52,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 13:06:52,024 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:52,025 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:52,027 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:52,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:52,033 INFO L82 PathProgramCache]: Analyzing trace with hash -721501374, now seen corresponding path program 1 times [2018-11-23 13:06:52,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:52,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:52,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:52,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:52,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:52,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:52,148 INFO L256 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {21#true} is VALID [2018-11-23 13:06:52,153 INFO L273 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2018-11-23 13:06:52,154 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #37#return; {21#true} is VALID [2018-11-23 13:06:52,154 INFO L256 TraceCheckUtils]: 3: Hoare triple {21#true} call #t~ret2 := main(); {21#true} is VALID [2018-11-23 13:06:52,155 INFO L273 TraceCheckUtils]: 4: Hoare triple {21#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {21#true} is VALID [2018-11-23 13:06:52,168 INFO L273 TraceCheckUtils]: 5: Hoare triple {21#true} assume !true; {22#false} is VALID [2018-11-23 13:06:52,169 INFO L256 TraceCheckUtils]: 6: Hoare triple {22#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {22#false} is VALID [2018-11-23 13:06:52,169 INFO L273 TraceCheckUtils]: 7: Hoare triple {22#false} ~cond := #in~cond; {22#false} is VALID [2018-11-23 13:06:52,170 INFO L273 TraceCheckUtils]: 8: Hoare triple {22#false} assume 0 == ~cond; {22#false} is VALID [2018-11-23 13:06:52,170 INFO L273 TraceCheckUtils]: 9: Hoare triple {22#false} assume !false; {22#false} is VALID [2018-11-23 13:06:52,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:52,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:06:52,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:06:52,182 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 13:06:52,185 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:52,189 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:06:52,251 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:52,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:06:52,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:06:52,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:06:52,266 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-11-23 13:06:52,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:52,369 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-23 13:06:52,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:06:52,370 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 13:06:52,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:52,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:06:52,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 33 transitions. [2018-11-23 13:06:52,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:06:52,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 33 transitions. [2018-11-23 13:06:52,387 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 33 transitions. [2018-11-23 13:06:52,638 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:52,649 INFO L225 Difference]: With dead ends: 29 [2018-11-23 13:06:52,650 INFO L226 Difference]: Without dead ends: 12 [2018-11-23 13:06:52,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:06:52,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-23 13:06:52,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-23 13:06:52,782 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:52,783 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2018-11-23 13:06:52,784 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 13:06:52,784 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 13:06:52,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:52,788 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2018-11-23 13:06:52,788 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2018-11-23 13:06:52,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:52,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:52,792 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 13:06:52,792 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 13:06:52,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:52,797 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2018-11-23 13:06:52,797 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2018-11-23 13:06:52,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:52,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:52,798 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:52,798 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:52,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:06:52,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2018-11-23 13:06:52,807 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2018-11-23 13:06:52,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:52,807 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-11-23 13:06:52,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:06:52,808 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2018-11-23 13:06:52,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 13:06:52,808 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:52,810 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:52,810 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:52,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:52,811 INFO L82 PathProgramCache]: Analyzing trace with hash -730736584, now seen corresponding path program 1 times [2018-11-23 13:06:52,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:52,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:52,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:52,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:52,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:52,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:53,054 INFO L256 TraceCheckUtils]: 0: Hoare triple {106#true} call ULTIMATE.init(); {106#true} is VALID [2018-11-23 13:06:53,054 INFO L273 TraceCheckUtils]: 1: Hoare triple {106#true} assume true; {106#true} is VALID [2018-11-23 13:06:53,055 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {106#true} {106#true} #37#return; {106#true} is VALID [2018-11-23 13:06:53,055 INFO L256 TraceCheckUtils]: 3: Hoare triple {106#true} call #t~ret2 := main(); {106#true} is VALID [2018-11-23 13:06:53,059 INFO L273 TraceCheckUtils]: 4: Hoare triple {106#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {108#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:53,060 INFO L273 TraceCheckUtils]: 5: Hoare triple {108#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {107#false} is VALID [2018-11-23 13:06:53,060 INFO L256 TraceCheckUtils]: 6: Hoare triple {107#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {107#false} is VALID [2018-11-23 13:06:53,060 INFO L273 TraceCheckUtils]: 7: Hoare triple {107#false} ~cond := #in~cond; {107#false} is VALID [2018-11-23 13:06:53,061 INFO L273 TraceCheckUtils]: 8: Hoare triple {107#false} assume 0 == ~cond; {107#false} is VALID [2018-11-23 13:06:53,061 INFO L273 TraceCheckUtils]: 9: Hoare triple {107#false} assume !false; {107#false} is VALID [2018-11-23 13:06:53,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:53,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:06:53,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:06:53,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 13:06:53,065 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:53,065 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:06:53,124 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:53,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:06:53,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:06:53,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:06:53,125 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 3 states. [2018-11-23 13:06:53,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:53,269 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-11-23 13:06:53,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:06:53,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 13:06:53,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:53,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:06:53,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2018-11-23 13:06:53,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:06:53,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2018-11-23 13:06:53,275 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 21 transitions. [2018-11-23 13:06:53,415 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-23 13:06:53,417 INFO L225 Difference]: With dead ends: 19 [2018-11-23 13:06:53,417 INFO L226 Difference]: Without dead ends: 14 [2018-11-23 13:06:53,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:06:53,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-23 13:06:53,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-11-23 13:06:53,430 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:53,430 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 13 states. [2018-11-23 13:06:53,430 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 13 states. [2018-11-23 13:06:53,431 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 13 states. [2018-11-23 13:06:53,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:53,433 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2018-11-23 13:06:53,433 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2018-11-23 13:06:53,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:53,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:53,434 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 14 states. [2018-11-23 13:06:53,434 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 14 states. [2018-11-23 13:06:53,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:53,436 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2018-11-23 13:06:53,436 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2018-11-23 13:06:53,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:53,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:53,437 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:53,437 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:53,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:06:53,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-11-23 13:06:53,439 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-11-23 13:06:53,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:53,439 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-23 13:06:53,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:06:53,440 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-23 13:06:53,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 13:06:53,440 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:53,440 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:53,441 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:53,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:53,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1082855947, now seen corresponding path program 1 times [2018-11-23 13:06:53,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:53,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:53,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:53,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:53,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:53,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:53,708 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-11-23 13:06:53,721 INFO L256 TraceCheckUtils]: 0: Hoare triple {189#true} call ULTIMATE.init(); {189#true} is VALID [2018-11-23 13:06:53,722 INFO L273 TraceCheckUtils]: 1: Hoare triple {189#true} assume true; {189#true} is VALID [2018-11-23 13:06:53,722 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {189#true} {189#true} #37#return; {189#true} is VALID [2018-11-23 13:06:53,722 INFO L256 TraceCheckUtils]: 3: Hoare triple {189#true} call #t~ret2 := main(); {189#true} is VALID [2018-11-23 13:06:53,729 INFO L273 TraceCheckUtils]: 4: Hoare triple {189#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {191#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:53,730 INFO L273 TraceCheckUtils]: 5: Hoare triple {191#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {191#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:53,731 INFO L273 TraceCheckUtils]: 6: Hoare triple {191#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {192#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:06:53,732 INFO L273 TraceCheckUtils]: 7: Hoare triple {192#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {190#false} is VALID [2018-11-23 13:06:53,733 INFO L256 TraceCheckUtils]: 8: Hoare triple {190#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {190#false} is VALID [2018-11-23 13:06:53,733 INFO L273 TraceCheckUtils]: 9: Hoare triple {190#false} ~cond := #in~cond; {190#false} is VALID [2018-11-23 13:06:53,734 INFO L273 TraceCheckUtils]: 10: Hoare triple {190#false} assume 0 == ~cond; {190#false} is VALID [2018-11-23 13:06:53,734 INFO L273 TraceCheckUtils]: 11: Hoare triple {190#false} assume !false; {190#false} is VALID [2018-11-23 13:06:53,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:53,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:53,737 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:06:53,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:53,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:53,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:53,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:54,083 INFO L256 TraceCheckUtils]: 0: Hoare triple {189#true} call ULTIMATE.init(); {189#true} is VALID [2018-11-23 13:06:54,084 INFO L273 TraceCheckUtils]: 1: Hoare triple {189#true} assume true; {189#true} is VALID [2018-11-23 13:06:54,084 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {189#true} {189#true} #37#return; {189#true} is VALID [2018-11-23 13:06:54,084 INFO L256 TraceCheckUtils]: 3: Hoare triple {189#true} call #t~ret2 := main(); {189#true} is VALID [2018-11-23 13:06:54,094 INFO L273 TraceCheckUtils]: 4: Hoare triple {189#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {191#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:54,107 INFO L273 TraceCheckUtils]: 5: Hoare triple {191#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {191#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:54,117 INFO L273 TraceCheckUtils]: 6: Hoare triple {191#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {214#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:54,127 INFO L273 TraceCheckUtils]: 7: Hoare triple {214#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 99); {190#false} is VALID [2018-11-23 13:06:54,128 INFO L256 TraceCheckUtils]: 8: Hoare triple {190#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {190#false} is VALID [2018-11-23 13:06:54,128 INFO L273 TraceCheckUtils]: 9: Hoare triple {190#false} ~cond := #in~cond; {190#false} is VALID [2018-11-23 13:06:54,129 INFO L273 TraceCheckUtils]: 10: Hoare triple {190#false} assume 0 == ~cond; {190#false} is VALID [2018-11-23 13:06:54,129 INFO L273 TraceCheckUtils]: 11: Hoare triple {190#false} assume !false; {190#false} is VALID [2018-11-23 13:06:54,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:54,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:54,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 13:06:54,163 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-23 13:06:54,164 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:54,164 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:06:54,255 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:54,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:06:54,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:06:54,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:06:54,256 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 5 states. [2018-11-23 13:06:54,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:54,489 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2018-11-23 13:06:54,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:06:54,490 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-23 13:06:54,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:54,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:06:54,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2018-11-23 13:06:54,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:06:54,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2018-11-23 13:06:54,495 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 28 transitions. [2018-11-23 13:06:54,540 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:54,542 INFO L225 Difference]: With dead ends: 23 [2018-11-23 13:06:54,543 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 13:06:54,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:06:54,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 13:06:54,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2018-11-23 13:06:54,563 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:54,563 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 15 states. [2018-11-23 13:06:54,564 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 15 states. [2018-11-23 13:06:54,564 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 15 states. [2018-11-23 13:06:54,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:54,566 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2018-11-23 13:06:54,566 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2018-11-23 13:06:54,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:54,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:54,567 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 18 states. [2018-11-23 13:06:54,568 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 18 states. [2018-11-23 13:06:54,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:54,570 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2018-11-23 13:06:54,570 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2018-11-23 13:06:54,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:54,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:54,571 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:54,571 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:54,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:06:54,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2018-11-23 13:06:54,573 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 12 [2018-11-23 13:06:54,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:54,573 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-11-23 13:06:54,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:06:54,573 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2018-11-23 13:06:54,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 13:06:54,574 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:54,574 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:54,575 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:54,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:54,575 INFO L82 PathProgramCache]: Analyzing trace with hash -167147406, now seen corresponding path program 2 times [2018-11-23 13:06:54,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:54,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:54,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:54,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:54,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:54,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:54,790 INFO L256 TraceCheckUtils]: 0: Hoare triple {324#true} call ULTIMATE.init(); {324#true} is VALID [2018-11-23 13:06:54,791 INFO L273 TraceCheckUtils]: 1: Hoare triple {324#true} assume true; {324#true} is VALID [2018-11-23 13:06:54,791 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {324#true} {324#true} #37#return; {324#true} is VALID [2018-11-23 13:06:54,792 INFO L256 TraceCheckUtils]: 3: Hoare triple {324#true} call #t~ret2 := main(); {324#true} is VALID [2018-11-23 13:06:54,793 INFO L273 TraceCheckUtils]: 4: Hoare triple {324#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {326#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:54,794 INFO L273 TraceCheckUtils]: 5: Hoare triple {326#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {326#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:54,795 INFO L273 TraceCheckUtils]: 6: Hoare triple {326#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {327#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:54,800 INFO L273 TraceCheckUtils]: 7: Hoare triple {327#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {327#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:54,816 INFO L273 TraceCheckUtils]: 8: Hoare triple {327#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {328#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:06:54,818 INFO L273 TraceCheckUtils]: 9: Hoare triple {328#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {325#false} is VALID [2018-11-23 13:06:54,818 INFO L256 TraceCheckUtils]: 10: Hoare triple {325#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {325#false} is VALID [2018-11-23 13:06:54,818 INFO L273 TraceCheckUtils]: 11: Hoare triple {325#false} ~cond := #in~cond; {325#false} is VALID [2018-11-23 13:06:54,819 INFO L273 TraceCheckUtils]: 12: Hoare triple {325#false} assume 0 == ~cond; {325#false} is VALID [2018-11-23 13:06:54,819 INFO L273 TraceCheckUtils]: 13: Hoare triple {325#false} assume !false; {325#false} is VALID [2018-11-23 13:06:54,820 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:54,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:54,820 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:06:54,830 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:06:54,841 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:06:54,841 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:06:54,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:54,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:54,997 INFO L256 TraceCheckUtils]: 0: Hoare triple {324#true} call ULTIMATE.init(); {324#true} is VALID [2018-11-23 13:06:54,998 INFO L273 TraceCheckUtils]: 1: Hoare triple {324#true} assume true; {324#true} is VALID [2018-11-23 13:06:54,999 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {324#true} {324#true} #37#return; {324#true} is VALID [2018-11-23 13:06:54,999 INFO L256 TraceCheckUtils]: 3: Hoare triple {324#true} call #t~ret2 := main(); {324#true} is VALID [2018-11-23 13:06:55,007 INFO L273 TraceCheckUtils]: 4: Hoare triple {324#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {326#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:55,008 INFO L273 TraceCheckUtils]: 5: Hoare triple {326#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {326#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:55,010 INFO L273 TraceCheckUtils]: 6: Hoare triple {326#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {327#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:55,011 INFO L273 TraceCheckUtils]: 7: Hoare triple {327#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {327#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:55,012 INFO L273 TraceCheckUtils]: 8: Hoare triple {327#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {356#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:06:55,013 INFO L273 TraceCheckUtils]: 9: Hoare triple {356#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(~x~0 % 4294967296 < 99); {325#false} is VALID [2018-11-23 13:06:55,013 INFO L256 TraceCheckUtils]: 10: Hoare triple {325#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {325#false} is VALID [2018-11-23 13:06:55,013 INFO L273 TraceCheckUtils]: 11: Hoare triple {325#false} ~cond := #in~cond; {325#false} is VALID [2018-11-23 13:06:55,014 INFO L273 TraceCheckUtils]: 12: Hoare triple {325#false} assume 0 == ~cond; {325#false} is VALID [2018-11-23 13:06:55,014 INFO L273 TraceCheckUtils]: 13: Hoare triple {325#false} assume !false; {325#false} is VALID [2018-11-23 13:06:55,014 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:55,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:55,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 13:06:55,035 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-23 13:06:55,035 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:55,035 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:06:55,056 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-23 13:06:55,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:06:55,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:06:55,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:06:55,057 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 6 states. [2018-11-23 13:06:55,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:55,398 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2018-11-23 13:06:55,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:06:55,399 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-23 13:06:55,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:55,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:06:55,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2018-11-23 13:06:55,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:06:55,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2018-11-23 13:06:55,403 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 31 transitions. [2018-11-23 13:06:55,495 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:55,497 INFO L225 Difference]: With dead ends: 26 [2018-11-23 13:06:55,497 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 13:06:55,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:06:55,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 13:06:55,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2018-11-23 13:06:55,519 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:55,519 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 17 states. [2018-11-23 13:06:55,519 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 17 states. [2018-11-23 13:06:55,519 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 17 states. [2018-11-23 13:06:55,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:55,522 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2018-11-23 13:06:55,522 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2018-11-23 13:06:55,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:55,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:55,523 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 21 states. [2018-11-23 13:06:55,523 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 21 states. [2018-11-23 13:06:55,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:55,525 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2018-11-23 13:06:55,525 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2018-11-23 13:06:55,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:55,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:55,526 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:55,527 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:55,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:06:55,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2018-11-23 13:06:55,529 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 14 [2018-11-23 13:06:55,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:55,529 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-23 13:06:55,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:06:55,529 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2018-11-23 13:06:55,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 13:06:55,530 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:55,530 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:55,530 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:55,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:55,530 INFO L82 PathProgramCache]: Analyzing trace with hash -976494032, now seen corresponding path program 1 times [2018-11-23 13:06:55,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:55,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:55,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:55,532 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:55,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:55,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:55,741 INFO L256 TraceCheckUtils]: 0: Hoare triple {480#true} call ULTIMATE.init(); {480#true} is VALID [2018-11-23 13:06:55,742 INFO L273 TraceCheckUtils]: 1: Hoare triple {480#true} assume true; {480#true} is VALID [2018-11-23 13:06:55,742 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {480#true} {480#true} #37#return; {480#true} is VALID [2018-11-23 13:06:55,743 INFO L256 TraceCheckUtils]: 3: Hoare triple {480#true} call #t~ret2 := main(); {480#true} is VALID [2018-11-23 13:06:55,744 INFO L273 TraceCheckUtils]: 4: Hoare triple {480#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {482#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:55,745 INFO L273 TraceCheckUtils]: 5: Hoare triple {482#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {482#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:55,746 INFO L273 TraceCheckUtils]: 6: Hoare triple {482#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {483#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:06:55,755 INFO L273 TraceCheckUtils]: 7: Hoare triple {483#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {483#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:06:55,756 INFO L273 TraceCheckUtils]: 8: Hoare triple {483#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {484#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:06:55,757 INFO L273 TraceCheckUtils]: 9: Hoare triple {484#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {481#false} is VALID [2018-11-23 13:06:55,757 INFO L256 TraceCheckUtils]: 10: Hoare triple {481#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {481#false} is VALID [2018-11-23 13:06:55,758 INFO L273 TraceCheckUtils]: 11: Hoare triple {481#false} ~cond := #in~cond; {481#false} is VALID [2018-11-23 13:06:55,758 INFO L273 TraceCheckUtils]: 12: Hoare triple {481#false} assume 0 == ~cond; {481#false} is VALID [2018-11-23 13:06:55,758 INFO L273 TraceCheckUtils]: 13: Hoare triple {481#false} assume !false; {481#false} is VALID [2018-11-23 13:06:55,759 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:55,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:55,759 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:06:55,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:55,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:55,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:55,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:55,868 INFO L256 TraceCheckUtils]: 0: Hoare triple {480#true} call ULTIMATE.init(); {480#true} is VALID [2018-11-23 13:06:55,868 INFO L273 TraceCheckUtils]: 1: Hoare triple {480#true} assume true; {480#true} is VALID [2018-11-23 13:06:55,869 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {480#true} {480#true} #37#return; {480#true} is VALID [2018-11-23 13:06:55,869 INFO L256 TraceCheckUtils]: 3: Hoare triple {480#true} call #t~ret2 := main(); {480#true} is VALID [2018-11-23 13:06:55,869 INFO L273 TraceCheckUtils]: 4: Hoare triple {480#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {480#true} is VALID [2018-11-23 13:06:55,870 INFO L273 TraceCheckUtils]: 5: Hoare triple {480#true} assume !!(~x~0 % 4294967296 < 99); {480#true} is VALID [2018-11-23 13:06:55,870 INFO L273 TraceCheckUtils]: 6: Hoare triple {480#true} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {506#(not (= (mod main_~y~0 2) 0))} is VALID [2018-11-23 13:06:55,874 INFO L273 TraceCheckUtils]: 7: Hoare triple {506#(not (= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {506#(not (= (mod main_~y~0 2) 0))} is VALID [2018-11-23 13:06:55,875 INFO L273 TraceCheckUtils]: 8: Hoare triple {506#(not (= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {481#false} is VALID [2018-11-23 13:06:55,875 INFO L273 TraceCheckUtils]: 9: Hoare triple {481#false} assume !(~x~0 % 4294967296 < 99); {481#false} is VALID [2018-11-23 13:06:55,875 INFO L256 TraceCheckUtils]: 10: Hoare triple {481#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {481#false} is VALID [2018-11-23 13:06:55,875 INFO L273 TraceCheckUtils]: 11: Hoare triple {481#false} ~cond := #in~cond; {481#false} is VALID [2018-11-23 13:06:55,876 INFO L273 TraceCheckUtils]: 12: Hoare triple {481#false} assume 0 == ~cond; {481#false} is VALID [2018-11-23 13:06:55,876 INFO L273 TraceCheckUtils]: 13: Hoare triple {481#false} assume !false; {481#false} is VALID [2018-11-23 13:06:55,876 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:55,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:06:55,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-11-23 13:06:55,896 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-23 13:06:55,896 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:55,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:06:55,983 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-23 13:06:55,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:06:55,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:06:55,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:06:55,984 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 6 states. [2018-11-23 13:06:56,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:56,374 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2018-11-23 13:06:56,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:06:56,375 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-23 13:06:56,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:56,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:06:56,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2018-11-23 13:06:56,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:06:56,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2018-11-23 13:06:56,380 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 39 transitions. [2018-11-23 13:06:56,443 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:56,446 INFO L225 Difference]: With dead ends: 32 [2018-11-23 13:06:56,446 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 13:06:56,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:06:56,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 13:06:56,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2018-11-23 13:06:56,481 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:56,482 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 22 states. [2018-11-23 13:06:56,482 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 22 states. [2018-11-23 13:06:56,482 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 22 states. [2018-11-23 13:06:56,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:56,485 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2018-11-23 13:06:56,485 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2018-11-23 13:06:56,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:56,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:56,486 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 25 states. [2018-11-23 13:06:56,486 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 25 states. [2018-11-23 13:06:56,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:56,488 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2018-11-23 13:06:56,488 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2018-11-23 13:06:56,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:56,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:56,489 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:56,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:56,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:06:56,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2018-11-23 13:06:56,491 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 14 [2018-11-23 13:06:56,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:56,492 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-11-23 13:06:56,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:06:56,492 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2018-11-23 13:06:56,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 13:06:56,493 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:56,493 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:56,493 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:56,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:56,493 INFO L82 PathProgramCache]: Analyzing trace with hash -639535185, now seen corresponding path program 3 times [2018-11-23 13:06:56,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:56,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:56,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:56,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:56,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:56,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:56,775 INFO L256 TraceCheckUtils]: 0: Hoare triple {668#true} call ULTIMATE.init(); {668#true} is VALID [2018-11-23 13:06:56,776 INFO L273 TraceCheckUtils]: 1: Hoare triple {668#true} assume true; {668#true} is VALID [2018-11-23 13:06:56,776 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {668#true} {668#true} #37#return; {668#true} is VALID [2018-11-23 13:06:56,776 INFO L256 TraceCheckUtils]: 3: Hoare triple {668#true} call #t~ret2 := main(); {668#true} is VALID [2018-11-23 13:06:56,777 INFO L273 TraceCheckUtils]: 4: Hoare triple {668#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {670#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:56,782 INFO L273 TraceCheckUtils]: 5: Hoare triple {670#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {670#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:56,783 INFO L273 TraceCheckUtils]: 6: Hoare triple {670#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {671#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:56,783 INFO L273 TraceCheckUtils]: 7: Hoare triple {671#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {671#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:56,784 INFO L273 TraceCheckUtils]: 8: Hoare triple {671#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {672#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:06:56,786 INFO L273 TraceCheckUtils]: 9: Hoare triple {672#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {672#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:06:56,788 INFO L273 TraceCheckUtils]: 10: Hoare triple {672#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {673#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:06:56,789 INFO L273 TraceCheckUtils]: 11: Hoare triple {673#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {669#false} is VALID [2018-11-23 13:06:56,789 INFO L256 TraceCheckUtils]: 12: Hoare triple {669#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {669#false} is VALID [2018-11-23 13:06:56,790 INFO L273 TraceCheckUtils]: 13: Hoare triple {669#false} ~cond := #in~cond; {669#false} is VALID [2018-11-23 13:06:56,790 INFO L273 TraceCheckUtils]: 14: Hoare triple {669#false} assume 0 == ~cond; {669#false} is VALID [2018-11-23 13:06:56,790 INFO L273 TraceCheckUtils]: 15: Hoare triple {669#false} assume !false; {669#false} is VALID [2018-11-23 13:06:56,791 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:56,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:56,792 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:06:56,802 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:06:56,813 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 13:06:56,813 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:06:56,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:56,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:56,991 INFO L256 TraceCheckUtils]: 0: Hoare triple {668#true} call ULTIMATE.init(); {668#true} is VALID [2018-11-23 13:06:56,991 INFO L273 TraceCheckUtils]: 1: Hoare triple {668#true} assume true; {668#true} is VALID [2018-11-23 13:06:56,992 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {668#true} {668#true} #37#return; {668#true} is VALID [2018-11-23 13:06:56,992 INFO L256 TraceCheckUtils]: 3: Hoare triple {668#true} call #t~ret2 := main(); {668#true} is VALID [2018-11-23 13:06:56,993 INFO L273 TraceCheckUtils]: 4: Hoare triple {668#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {670#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:57,008 INFO L273 TraceCheckUtils]: 5: Hoare triple {670#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {670#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:57,009 INFO L273 TraceCheckUtils]: 6: Hoare triple {670#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {671#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:57,011 INFO L273 TraceCheckUtils]: 7: Hoare triple {671#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {671#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:57,012 INFO L273 TraceCheckUtils]: 8: Hoare triple {671#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {672#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:06:57,013 INFO L273 TraceCheckUtils]: 9: Hoare triple {672#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {672#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:06:57,014 INFO L273 TraceCheckUtils]: 10: Hoare triple {672#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {707#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:06:57,015 INFO L273 TraceCheckUtils]: 11: Hoare triple {707#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {669#false} is VALID [2018-11-23 13:06:57,015 INFO L256 TraceCheckUtils]: 12: Hoare triple {669#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {669#false} is VALID [2018-11-23 13:06:57,016 INFO L273 TraceCheckUtils]: 13: Hoare triple {669#false} ~cond := #in~cond; {669#false} is VALID [2018-11-23 13:06:57,016 INFO L273 TraceCheckUtils]: 14: Hoare triple {669#false} assume 0 == ~cond; {669#false} is VALID [2018-11-23 13:06:57,016 INFO L273 TraceCheckUtils]: 15: Hoare triple {669#false} assume !false; {669#false} is VALID [2018-11-23 13:06:57,017 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:57,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:57,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 13:06:57,037 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-11-23 13:06:57,037 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:57,037 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 13:06:57,115 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:57,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:06:57,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:06:57,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:06:57,116 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 7 states. [2018-11-23 13:06:57,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:57,365 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2018-11-23 13:06:57,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:06:57,365 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-11-23 13:06:57,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:57,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:06:57,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2018-11-23 13:06:57,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:06:57,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2018-11-23 13:06:57,370 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 33 transitions. [2018-11-23 13:06:57,465 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:57,467 INFO L225 Difference]: With dead ends: 33 [2018-11-23 13:06:57,467 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 13:06:57,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:06:57,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 13:06:57,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2018-11-23 13:06:57,505 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:57,505 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 24 states. [2018-11-23 13:06:57,506 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 24 states. [2018-11-23 13:06:57,506 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 24 states. [2018-11-23 13:06:57,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:57,508 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2018-11-23 13:06:57,508 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2018-11-23 13:06:57,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:57,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:57,509 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 28 states. [2018-11-23 13:06:57,509 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 28 states. [2018-11-23 13:06:57,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:57,512 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2018-11-23 13:06:57,512 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2018-11-23 13:06:57,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:57,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:57,513 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:57,513 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:57,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 13:06:57,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2018-11-23 13:06:57,515 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 16 [2018-11-23 13:06:57,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:57,515 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2018-11-23 13:06:57,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:06:57,515 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2018-11-23 13:06:57,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 13:06:57,516 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:57,516 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:57,517 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:57,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:57,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1391623509, now seen corresponding path program 2 times [2018-11-23 13:06:57,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:57,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:57,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:57,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:57,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:57,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:57,728 INFO L256 TraceCheckUtils]: 0: Hoare triple {867#true} call ULTIMATE.init(); {867#true} is VALID [2018-11-23 13:06:57,729 INFO L273 TraceCheckUtils]: 1: Hoare triple {867#true} assume true; {867#true} is VALID [2018-11-23 13:06:57,729 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {867#true} {867#true} #37#return; {867#true} is VALID [2018-11-23 13:06:57,729 INFO L256 TraceCheckUtils]: 3: Hoare triple {867#true} call #t~ret2 := main(); {867#true} is VALID [2018-11-23 13:06:57,730 INFO L273 TraceCheckUtils]: 4: Hoare triple {867#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {869#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:57,731 INFO L273 TraceCheckUtils]: 5: Hoare triple {869#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {869#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:57,733 INFO L273 TraceCheckUtils]: 6: Hoare triple {869#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {870#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:57,734 INFO L273 TraceCheckUtils]: 7: Hoare triple {870#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {870#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:57,735 INFO L273 TraceCheckUtils]: 8: Hoare triple {870#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {871#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:06:57,736 INFO L273 TraceCheckUtils]: 9: Hoare triple {871#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {871#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:06:57,738 INFO L273 TraceCheckUtils]: 10: Hoare triple {871#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {872#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:06:57,759 INFO L273 TraceCheckUtils]: 11: Hoare triple {872#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {868#false} is VALID [2018-11-23 13:06:57,759 INFO L256 TraceCheckUtils]: 12: Hoare triple {868#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {868#false} is VALID [2018-11-23 13:06:57,760 INFO L273 TraceCheckUtils]: 13: Hoare triple {868#false} ~cond := #in~cond; {868#false} is VALID [2018-11-23 13:06:57,760 INFO L273 TraceCheckUtils]: 14: Hoare triple {868#false} assume 0 == ~cond; {868#false} is VALID [2018-11-23 13:06:57,760 INFO L273 TraceCheckUtils]: 15: Hoare triple {868#false} assume !false; {868#false} is VALID [2018-11-23 13:06:57,761 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:57,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:57,761 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:06:57,776 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:06:57,812 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:06:57,812 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:06:57,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:57,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:57,914 INFO L256 TraceCheckUtils]: 0: Hoare triple {867#true} call ULTIMATE.init(); {867#true} is VALID [2018-11-23 13:06:57,915 INFO L273 TraceCheckUtils]: 1: Hoare triple {867#true} assume true; {867#true} is VALID [2018-11-23 13:06:57,915 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {867#true} {867#true} #37#return; {867#true} is VALID [2018-11-23 13:06:57,915 INFO L256 TraceCheckUtils]: 3: Hoare triple {867#true} call #t~ret2 := main(); {867#true} is VALID [2018-11-23 13:06:57,916 INFO L273 TraceCheckUtils]: 4: Hoare triple {867#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {867#true} is VALID [2018-11-23 13:06:57,916 INFO L273 TraceCheckUtils]: 5: Hoare triple {867#true} assume !!(~x~0 % 4294967296 < 99); {867#true} is VALID [2018-11-23 13:06:57,918 INFO L273 TraceCheckUtils]: 6: Hoare triple {867#true} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {894#(<= (mod main_~y~0 2) 0)} is VALID [2018-11-23 13:06:57,919 INFO L273 TraceCheckUtils]: 7: Hoare triple {894#(<= (mod main_~y~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {894#(<= (mod main_~y~0 2) 0)} is VALID [2018-11-23 13:06:57,920 INFO L273 TraceCheckUtils]: 8: Hoare triple {894#(<= (mod main_~y~0 2) 0)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {868#false} is VALID [2018-11-23 13:06:57,921 INFO L273 TraceCheckUtils]: 9: Hoare triple {868#false} assume !!(~x~0 % 4294967296 < 99); {868#false} is VALID [2018-11-23 13:06:57,921 INFO L273 TraceCheckUtils]: 10: Hoare triple {868#false} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {868#false} is VALID [2018-11-23 13:06:57,921 INFO L273 TraceCheckUtils]: 11: Hoare triple {868#false} assume !(~x~0 % 4294967296 < 99); {868#false} is VALID [2018-11-23 13:06:57,922 INFO L256 TraceCheckUtils]: 12: Hoare triple {868#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {868#false} is VALID [2018-11-23 13:06:57,922 INFO L273 TraceCheckUtils]: 13: Hoare triple {868#false} ~cond := #in~cond; {868#false} is VALID [2018-11-23 13:06:57,922 INFO L273 TraceCheckUtils]: 14: Hoare triple {868#false} assume 0 == ~cond; {868#false} is VALID [2018-11-23 13:06:57,923 INFO L273 TraceCheckUtils]: 15: Hoare triple {868#false} assume !false; {868#false} is VALID [2018-11-23 13:06:57,924 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:06:57,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:06:57,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2018-11-23 13:06:57,945 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-11-23 13:06:57,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:57,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 13:06:57,994 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-23 13:06:57,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:06:57,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:06:57,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:06:57,996 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand 7 states. [2018-11-23 13:06:58,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:58,271 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2018-11-23 13:06:58,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:06:58,271 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-11-23 13:06:58,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:58,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:06:58,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2018-11-23 13:06:58,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:06:58,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2018-11-23 13:06:58,275 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 35 transitions. [2018-11-23 13:06:58,342 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:58,343 INFO L225 Difference]: With dead ends: 33 [2018-11-23 13:06:58,344 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 13:06:58,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:06:58,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 13:06:58,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-11-23 13:06:58,410 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:58,410 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 24 states. [2018-11-23 13:06:58,410 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 24 states. [2018-11-23 13:06:58,410 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 24 states. [2018-11-23 13:06:58,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:58,412 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-11-23 13:06:58,413 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-23 13:06:58,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:58,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:58,413 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 25 states. [2018-11-23 13:06:58,413 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 25 states. [2018-11-23 13:06:58,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:58,415 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-11-23 13:06:58,415 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-23 13:06:58,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:58,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:58,416 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:58,416 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:58,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 13:06:58,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-11-23 13:06:58,418 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 16 [2018-11-23 13:06:58,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:58,418 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-11-23 13:06:58,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:06:58,419 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-23 13:06:58,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 13:06:58,419 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:58,419 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:58,420 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:58,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:58,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1784650519, now seen corresponding path program 1 times [2018-11-23 13:06:58,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:58,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:58,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:58,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:58,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:58,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:59,319 INFO L256 TraceCheckUtils]: 0: Hoare triple {1067#true} call ULTIMATE.init(); {1067#true} is VALID [2018-11-23 13:06:59,320 INFO L273 TraceCheckUtils]: 1: Hoare triple {1067#true} assume true; {1067#true} is VALID [2018-11-23 13:06:59,320 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1067#true} {1067#true} #37#return; {1067#true} is VALID [2018-11-23 13:06:59,320 INFO L256 TraceCheckUtils]: 3: Hoare triple {1067#true} call #t~ret2 := main(); {1067#true} is VALID [2018-11-23 13:06:59,321 INFO L273 TraceCheckUtils]: 4: Hoare triple {1067#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {1069#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:59,322 INFO L273 TraceCheckUtils]: 5: Hoare triple {1069#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1069#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:59,323 INFO L273 TraceCheckUtils]: 6: Hoare triple {1069#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1070#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:06:59,323 INFO L273 TraceCheckUtils]: 7: Hoare triple {1070#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1070#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:06:59,325 INFO L273 TraceCheckUtils]: 8: Hoare triple {1070#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1071#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:59,326 INFO L273 TraceCheckUtils]: 9: Hoare triple {1071#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {1071#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:59,327 INFO L273 TraceCheckUtils]: 10: Hoare triple {1071#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1072#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:06:59,328 INFO L273 TraceCheckUtils]: 11: Hoare triple {1072#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {1068#false} is VALID [2018-11-23 13:06:59,329 INFO L256 TraceCheckUtils]: 12: Hoare triple {1068#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1068#false} is VALID [2018-11-23 13:06:59,329 INFO L273 TraceCheckUtils]: 13: Hoare triple {1068#false} ~cond := #in~cond; {1068#false} is VALID [2018-11-23 13:06:59,330 INFO L273 TraceCheckUtils]: 14: Hoare triple {1068#false} assume 0 == ~cond; {1068#false} is VALID [2018-11-23 13:06:59,330 INFO L273 TraceCheckUtils]: 15: Hoare triple {1068#false} assume !false; {1068#false} is VALID [2018-11-23 13:06:59,331 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:59,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:59,332 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:06:59,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:59,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:59,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:59,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:59,410 INFO L256 TraceCheckUtils]: 0: Hoare triple {1067#true} call ULTIMATE.init(); {1067#true} is VALID [2018-11-23 13:06:59,411 INFO L273 TraceCheckUtils]: 1: Hoare triple {1067#true} assume true; {1067#true} is VALID [2018-11-23 13:06:59,411 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1067#true} {1067#true} #37#return; {1067#true} is VALID [2018-11-23 13:06:59,411 INFO L256 TraceCheckUtils]: 3: Hoare triple {1067#true} call #t~ret2 := main(); {1067#true} is VALID [2018-11-23 13:06:59,412 INFO L273 TraceCheckUtils]: 4: Hoare triple {1067#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {1069#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:59,413 INFO L273 TraceCheckUtils]: 5: Hoare triple {1069#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1069#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:59,414 INFO L273 TraceCheckUtils]: 6: Hoare triple {1069#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1070#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:06:59,414 INFO L273 TraceCheckUtils]: 7: Hoare triple {1070#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1070#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:06:59,415 INFO L273 TraceCheckUtils]: 8: Hoare triple {1070#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1071#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:59,416 INFO L273 TraceCheckUtils]: 9: Hoare triple {1071#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {1071#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:59,417 INFO L273 TraceCheckUtils]: 10: Hoare triple {1071#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1106#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:06:59,418 INFO L273 TraceCheckUtils]: 11: Hoare triple {1106#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {1068#false} is VALID [2018-11-23 13:06:59,419 INFO L256 TraceCheckUtils]: 12: Hoare triple {1068#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1068#false} is VALID [2018-11-23 13:06:59,419 INFO L273 TraceCheckUtils]: 13: Hoare triple {1068#false} ~cond := #in~cond; {1068#false} is VALID [2018-11-23 13:06:59,419 INFO L273 TraceCheckUtils]: 14: Hoare triple {1068#false} assume 0 == ~cond; {1068#false} is VALID [2018-11-23 13:06:59,420 INFO L273 TraceCheckUtils]: 15: Hoare triple {1068#false} assume !false; {1068#false} is VALID [2018-11-23 13:06:59,421 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:59,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:59,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 13:06:59,445 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-11-23 13:06:59,445 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:59,445 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 13:06:59,469 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:59,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:06:59,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:06:59,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:06:59,470 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 7 states. [2018-11-23 13:06:59,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:59,686 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-11-23 13:06:59,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:06:59,686 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-11-23 13:06:59,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:59,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:06:59,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2018-11-23 13:06:59,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:06:59,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2018-11-23 13:06:59,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 28 transitions. [2018-11-23 13:06:59,729 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:59,731 INFO L225 Difference]: With dead ends: 32 [2018-11-23 13:06:59,731 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 13:06:59,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:06:59,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 13:06:59,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-11-23 13:06:59,806 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:59,806 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 26 states. [2018-11-23 13:06:59,806 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 26 states. [2018-11-23 13:06:59,807 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 26 states. [2018-11-23 13:06:59,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:59,811 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-11-23 13:06:59,811 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-23 13:06:59,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:59,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:59,812 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 27 states. [2018-11-23 13:06:59,812 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 27 states. [2018-11-23 13:06:59,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:59,814 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-11-23 13:06:59,814 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-23 13:06:59,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:59,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:59,814 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:59,815 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:59,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 13:06:59,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-11-23 13:06:59,819 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 16 [2018-11-23 13:06:59,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:59,819 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-23 13:06:59,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:06:59,819 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-23 13:06:59,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 13:06:59,820 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:59,820 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:59,820 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:59,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:59,821 INFO L82 PathProgramCache]: Analyzing trace with hash 662342572, now seen corresponding path program 4 times [2018-11-23 13:06:59,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:59,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:59,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:59,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:59,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:59,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:00,125 INFO L256 TraceCheckUtils]: 0: Hoare triple {1265#true} call ULTIMATE.init(); {1265#true} is VALID [2018-11-23 13:07:00,126 INFO L273 TraceCheckUtils]: 1: Hoare triple {1265#true} assume true; {1265#true} is VALID [2018-11-23 13:07:00,126 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1265#true} {1265#true} #37#return; {1265#true} is VALID [2018-11-23 13:07:00,126 INFO L256 TraceCheckUtils]: 3: Hoare triple {1265#true} call #t~ret2 := main(); {1265#true} is VALID [2018-11-23 13:07:00,127 INFO L273 TraceCheckUtils]: 4: Hoare triple {1265#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {1267#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:00,127 INFO L273 TraceCheckUtils]: 5: Hoare triple {1267#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1267#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:00,136 INFO L273 TraceCheckUtils]: 6: Hoare triple {1267#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1268#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:00,137 INFO L273 TraceCheckUtils]: 7: Hoare triple {1268#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {1268#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:00,138 INFO L273 TraceCheckUtils]: 8: Hoare triple {1268#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1269#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:00,138 INFO L273 TraceCheckUtils]: 9: Hoare triple {1269#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {1269#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:00,139 INFO L273 TraceCheckUtils]: 10: Hoare triple {1269#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1270#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:00,140 INFO L273 TraceCheckUtils]: 11: Hoare triple {1270#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1270#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:00,142 INFO L273 TraceCheckUtils]: 12: Hoare triple {1270#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1271#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:07:00,143 INFO L273 TraceCheckUtils]: 13: Hoare triple {1271#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {1266#false} is VALID [2018-11-23 13:07:00,143 INFO L256 TraceCheckUtils]: 14: Hoare triple {1266#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1266#false} is VALID [2018-11-23 13:07:00,143 INFO L273 TraceCheckUtils]: 15: Hoare triple {1266#false} ~cond := #in~cond; {1266#false} is VALID [2018-11-23 13:07:00,144 INFO L273 TraceCheckUtils]: 16: Hoare triple {1266#false} assume 0 == ~cond; {1266#false} is VALID [2018-11-23 13:07:00,144 INFO L273 TraceCheckUtils]: 17: Hoare triple {1266#false} assume !false; {1266#false} is VALID [2018-11-23 13:07:00,146 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:00,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:00,147 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:07:00,163 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:07:00,171 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:07:00,171 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:07:00,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:00,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:00,297 INFO L256 TraceCheckUtils]: 0: Hoare triple {1265#true} call ULTIMATE.init(); {1265#true} is VALID [2018-11-23 13:07:00,298 INFO L273 TraceCheckUtils]: 1: Hoare triple {1265#true} assume true; {1265#true} is VALID [2018-11-23 13:07:00,298 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1265#true} {1265#true} #37#return; {1265#true} is VALID [2018-11-23 13:07:00,299 INFO L256 TraceCheckUtils]: 3: Hoare triple {1265#true} call #t~ret2 := main(); {1265#true} is VALID [2018-11-23 13:07:00,303 INFO L273 TraceCheckUtils]: 4: Hoare triple {1265#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {1267#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:00,303 INFO L273 TraceCheckUtils]: 5: Hoare triple {1267#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1267#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:00,304 INFO L273 TraceCheckUtils]: 6: Hoare triple {1267#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1268#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:00,305 INFO L273 TraceCheckUtils]: 7: Hoare triple {1268#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {1268#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:00,306 INFO L273 TraceCheckUtils]: 8: Hoare triple {1268#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1269#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:00,306 INFO L273 TraceCheckUtils]: 9: Hoare triple {1269#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {1269#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:00,307 INFO L273 TraceCheckUtils]: 10: Hoare triple {1269#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1270#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:00,308 INFO L273 TraceCheckUtils]: 11: Hoare triple {1270#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1270#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:00,309 INFO L273 TraceCheckUtils]: 12: Hoare triple {1270#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1311#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:00,310 INFO L273 TraceCheckUtils]: 13: Hoare triple {1311#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(~x~0 % 4294967296 < 99); {1266#false} is VALID [2018-11-23 13:07:00,311 INFO L256 TraceCheckUtils]: 14: Hoare triple {1266#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1266#false} is VALID [2018-11-23 13:07:00,311 INFO L273 TraceCheckUtils]: 15: Hoare triple {1266#false} ~cond := #in~cond; {1266#false} is VALID [2018-11-23 13:07:00,311 INFO L273 TraceCheckUtils]: 16: Hoare triple {1266#false} assume 0 == ~cond; {1266#false} is VALID [2018-11-23 13:07:00,312 INFO L273 TraceCheckUtils]: 17: Hoare triple {1266#false} assume !false; {1266#false} is VALID [2018-11-23 13:07:00,313 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:00,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:00,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 13:07:00,332 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-23 13:07:00,333 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:00,333 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 13:07:00,359 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-23 13:07:00,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 13:07:00,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:07:00,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:07:00,360 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 8 states. [2018-11-23 13:07:00,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:00,727 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-11-23 13:07:00,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:07:00,727 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-23 13:07:00,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:00,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:07:00,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2018-11-23 13:07:00,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:07:00,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2018-11-23 13:07:00,730 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 31 transitions. [2018-11-23 13:07:00,785 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:00,786 INFO L225 Difference]: With dead ends: 34 [2018-11-23 13:07:00,787 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 13:07:00,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:07:00,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 13:07:00,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-11-23 13:07:00,991 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:00,991 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 28 states. [2018-11-23 13:07:00,991 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 28 states. [2018-11-23 13:07:00,991 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 28 states. [2018-11-23 13:07:00,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:00,993 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-11-23 13:07:00,993 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-11-23 13:07:00,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:00,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:00,994 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 29 states. [2018-11-23 13:07:00,994 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 29 states. [2018-11-23 13:07:00,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:00,995 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-11-23 13:07:00,996 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-11-23 13:07:00,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:00,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:00,996 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:00,996 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:00,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 13:07:00,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-11-23 13:07:00,998 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 18 [2018-11-23 13:07:00,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:00,998 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-11-23 13:07:00,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 13:07:00,998 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-23 13:07:00,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 13:07:00,999 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:00,999 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:00,999 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:00,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:01,000 INFO L82 PathProgramCache]: Analyzing trace with hash -224607324, now seen corresponding path program 2 times [2018-11-23 13:07:01,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:01,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:01,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:01,001 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:07:01,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:01,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:01,212 INFO L256 TraceCheckUtils]: 0: Hoare triple {1480#true} call ULTIMATE.init(); {1480#true} is VALID [2018-11-23 13:07:01,213 INFO L273 TraceCheckUtils]: 1: Hoare triple {1480#true} assume true; {1480#true} is VALID [2018-11-23 13:07:01,213 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1480#true} {1480#true} #37#return; {1480#true} is VALID [2018-11-23 13:07:01,213 INFO L256 TraceCheckUtils]: 3: Hoare triple {1480#true} call #t~ret2 := main(); {1480#true} is VALID [2018-11-23 13:07:01,214 INFO L273 TraceCheckUtils]: 4: Hoare triple {1480#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {1482#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:01,215 INFO L273 TraceCheckUtils]: 5: Hoare triple {1482#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1482#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:01,216 INFO L273 TraceCheckUtils]: 6: Hoare triple {1482#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1483#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:07:01,216 INFO L273 TraceCheckUtils]: 7: Hoare triple {1483#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1483#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:07:01,217 INFO L273 TraceCheckUtils]: 8: Hoare triple {1483#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1484#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:01,218 INFO L273 TraceCheckUtils]: 9: Hoare triple {1484#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {1484#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:01,219 INFO L273 TraceCheckUtils]: 10: Hoare triple {1484#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1485#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:07:01,220 INFO L273 TraceCheckUtils]: 11: Hoare triple {1485#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1485#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:07:01,221 INFO L273 TraceCheckUtils]: 12: Hoare triple {1485#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1486#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:07:01,222 INFO L273 TraceCheckUtils]: 13: Hoare triple {1486#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {1481#false} is VALID [2018-11-23 13:07:01,223 INFO L256 TraceCheckUtils]: 14: Hoare triple {1481#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1481#false} is VALID [2018-11-23 13:07:01,223 INFO L273 TraceCheckUtils]: 15: Hoare triple {1481#false} ~cond := #in~cond; {1481#false} is VALID [2018-11-23 13:07:01,223 INFO L273 TraceCheckUtils]: 16: Hoare triple {1481#false} assume 0 == ~cond; {1481#false} is VALID [2018-11-23 13:07:01,223 INFO L273 TraceCheckUtils]: 17: Hoare triple {1481#false} assume !false; {1481#false} is VALID [2018-11-23 13:07:01,225 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:01,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:01,225 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:07:01,238 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:07:01,265 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:07:01,265 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:07:01,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:01,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:01,525 INFO L256 TraceCheckUtils]: 0: Hoare triple {1480#true} call ULTIMATE.init(); {1480#true} is VALID [2018-11-23 13:07:01,526 INFO L273 TraceCheckUtils]: 1: Hoare triple {1480#true} assume true; {1480#true} is VALID [2018-11-23 13:07:01,526 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1480#true} {1480#true} #37#return; {1480#true} is VALID [2018-11-23 13:07:01,526 INFO L256 TraceCheckUtils]: 3: Hoare triple {1480#true} call #t~ret2 := main(); {1480#true} is VALID [2018-11-23 13:07:01,528 INFO L273 TraceCheckUtils]: 4: Hoare triple {1480#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {1482#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:01,531 INFO L273 TraceCheckUtils]: 5: Hoare triple {1482#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1482#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:01,533 INFO L273 TraceCheckUtils]: 6: Hoare triple {1482#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1483#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:07:01,534 INFO L273 TraceCheckUtils]: 7: Hoare triple {1483#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1483#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:07:01,535 INFO L273 TraceCheckUtils]: 8: Hoare triple {1483#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1484#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:01,535 INFO L273 TraceCheckUtils]: 9: Hoare triple {1484#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {1484#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:01,536 INFO L273 TraceCheckUtils]: 10: Hoare triple {1484#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1485#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:07:01,537 INFO L273 TraceCheckUtils]: 11: Hoare triple {1485#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1485#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:07:01,538 INFO L273 TraceCheckUtils]: 12: Hoare triple {1485#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1526#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:01,539 INFO L273 TraceCheckUtils]: 13: Hoare triple {1526#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(~x~0 % 4294967296 < 99); {1481#false} is VALID [2018-11-23 13:07:01,540 INFO L256 TraceCheckUtils]: 14: Hoare triple {1481#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1481#false} is VALID [2018-11-23 13:07:01,540 INFO L273 TraceCheckUtils]: 15: Hoare triple {1481#false} ~cond := #in~cond; {1481#false} is VALID [2018-11-23 13:07:01,540 INFO L273 TraceCheckUtils]: 16: Hoare triple {1481#false} assume 0 == ~cond; {1481#false} is VALID [2018-11-23 13:07:01,541 INFO L273 TraceCheckUtils]: 17: Hoare triple {1481#false} assume !false; {1481#false} is VALID [2018-11-23 13:07:01,542 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:01,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:01,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 13:07:01,565 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-23 13:07:01,565 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:01,565 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 13:07:01,690 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-23 13:07:01,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 13:07:01,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:07:01,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:07:01,691 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 8 states. [2018-11-23 13:07:01,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:01,981 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-11-23 13:07:01,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:07:01,981 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-23 13:07:01,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:01,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:07:01,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2018-11-23 13:07:01,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:07:01,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2018-11-23 13:07:01,984 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 31 transitions. [2018-11-23 13:07:02,094 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:02,095 INFO L225 Difference]: With dead ends: 36 [2018-11-23 13:07:02,096 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 13:07:02,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:07:02,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 13:07:02,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-11-23 13:07:02,233 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:02,233 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 30 states. [2018-11-23 13:07:02,233 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 30 states. [2018-11-23 13:07:02,233 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 30 states. [2018-11-23 13:07:02,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:02,236 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-11-23 13:07:02,236 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-23 13:07:02,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:02,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:02,237 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 31 states. [2018-11-23 13:07:02,237 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 31 states. [2018-11-23 13:07:02,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:02,238 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-11-23 13:07:02,238 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-23 13:07:02,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:02,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:02,239 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:02,239 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:02,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 13:07:02,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-11-23 13:07:02,240 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 18 [2018-11-23 13:07:02,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:02,240 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-11-23 13:07:02,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 13:07:02,241 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-11-23 13:07:02,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 13:07:02,241 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:02,242 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:02,242 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:02,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:02,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1931383913, now seen corresponding path program 5 times [2018-11-23 13:07:02,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:02,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:02,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:02,244 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:07:02,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:02,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:02,463 INFO L256 TraceCheckUtils]: 0: Hoare triple {1705#true} call ULTIMATE.init(); {1705#true} is VALID [2018-11-23 13:07:02,463 INFO L273 TraceCheckUtils]: 1: Hoare triple {1705#true} assume true; {1705#true} is VALID [2018-11-23 13:07:02,463 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1705#true} {1705#true} #37#return; {1705#true} is VALID [2018-11-23 13:07:02,464 INFO L256 TraceCheckUtils]: 3: Hoare triple {1705#true} call #t~ret2 := main(); {1705#true} is VALID [2018-11-23 13:07:02,464 INFO L273 TraceCheckUtils]: 4: Hoare triple {1705#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {1707#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:02,475 INFO L273 TraceCheckUtils]: 5: Hoare triple {1707#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1707#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:02,476 INFO L273 TraceCheckUtils]: 6: Hoare triple {1707#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1708#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:02,476 INFO L273 TraceCheckUtils]: 7: Hoare triple {1708#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {1708#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:02,477 INFO L273 TraceCheckUtils]: 8: Hoare triple {1708#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1709#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:02,478 INFO L273 TraceCheckUtils]: 9: Hoare triple {1709#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {1709#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:02,479 INFO L273 TraceCheckUtils]: 10: Hoare triple {1709#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1710#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:02,480 INFO L273 TraceCheckUtils]: 11: Hoare triple {1710#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1710#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:02,481 INFO L273 TraceCheckUtils]: 12: Hoare triple {1710#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1711#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:02,482 INFO L273 TraceCheckUtils]: 13: Hoare triple {1711#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {1711#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:02,483 INFO L273 TraceCheckUtils]: 14: Hoare triple {1711#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1712#(and (<= main_~x~0 10) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:07:02,483 INFO L273 TraceCheckUtils]: 15: Hoare triple {1712#(and (<= main_~x~0 10) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {1706#false} is VALID [2018-11-23 13:07:02,483 INFO L256 TraceCheckUtils]: 16: Hoare triple {1706#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1706#false} is VALID [2018-11-23 13:07:02,484 INFO L273 TraceCheckUtils]: 17: Hoare triple {1706#false} ~cond := #in~cond; {1706#false} is VALID [2018-11-23 13:07:02,484 INFO L273 TraceCheckUtils]: 18: Hoare triple {1706#false} assume 0 == ~cond; {1706#false} is VALID [2018-11-23 13:07:02,484 INFO L273 TraceCheckUtils]: 19: Hoare triple {1706#false} assume !false; {1706#false} is VALID [2018-11-23 13:07:02,485 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:02,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:02,485 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:07:02,496 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:07:02,532 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 13:07:02,532 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:07:02,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:02,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:02,607 INFO L256 TraceCheckUtils]: 0: Hoare triple {1705#true} call ULTIMATE.init(); {1705#true} is VALID [2018-11-23 13:07:02,607 INFO L273 TraceCheckUtils]: 1: Hoare triple {1705#true} assume true; {1705#true} is VALID [2018-11-23 13:07:02,607 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1705#true} {1705#true} #37#return; {1705#true} is VALID [2018-11-23 13:07:02,608 INFO L256 TraceCheckUtils]: 3: Hoare triple {1705#true} call #t~ret2 := main(); {1705#true} is VALID [2018-11-23 13:07:02,608 INFO L273 TraceCheckUtils]: 4: Hoare triple {1705#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {1707#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:02,609 INFO L273 TraceCheckUtils]: 5: Hoare triple {1707#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1707#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:02,609 INFO L273 TraceCheckUtils]: 6: Hoare triple {1707#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1708#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:02,610 INFO L273 TraceCheckUtils]: 7: Hoare triple {1708#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {1708#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:02,611 INFO L273 TraceCheckUtils]: 8: Hoare triple {1708#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1709#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:02,611 INFO L273 TraceCheckUtils]: 9: Hoare triple {1709#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {1709#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:02,612 INFO L273 TraceCheckUtils]: 10: Hoare triple {1709#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1710#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:02,613 INFO L273 TraceCheckUtils]: 11: Hoare triple {1710#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1710#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:02,614 INFO L273 TraceCheckUtils]: 12: Hoare triple {1710#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1711#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:02,615 INFO L273 TraceCheckUtils]: 13: Hoare triple {1711#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {1711#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:02,617 INFO L273 TraceCheckUtils]: 14: Hoare triple {1711#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {1758#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:02,618 INFO L273 TraceCheckUtils]: 15: Hoare triple {1758#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {1706#false} is VALID [2018-11-23 13:07:02,618 INFO L256 TraceCheckUtils]: 16: Hoare triple {1706#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1706#false} is VALID [2018-11-23 13:07:02,618 INFO L273 TraceCheckUtils]: 17: Hoare triple {1706#false} ~cond := #in~cond; {1706#false} is VALID [2018-11-23 13:07:02,619 INFO L273 TraceCheckUtils]: 18: Hoare triple {1706#false} assume 0 == ~cond; {1706#false} is VALID [2018-11-23 13:07:02,619 INFO L273 TraceCheckUtils]: 19: Hoare triple {1706#false} assume !false; {1706#false} is VALID [2018-11-23 13:07:02,621 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:02,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:02,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 13:07:02,641 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-11-23 13:07:02,641 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:02,641 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 13:07:02,664 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:02,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 13:07:02,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:07:02,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:07:02,665 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 9 states. [2018-11-23 13:07:02,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:02,949 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2018-11-23 13:07:02,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:07:02,949 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-11-23 13:07:02,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:02,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:07:02,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 33 transitions. [2018-11-23 13:07:02,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:07:02,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 33 transitions. [2018-11-23 13:07:02,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 33 transitions. [2018-11-23 13:07:02,988 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:02,989 INFO L225 Difference]: With dead ends: 38 [2018-11-23 13:07:02,989 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 13:07:02,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:07:02,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 13:07:03,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-11-23 13:07:03,025 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:03,025 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 32 states. [2018-11-23 13:07:03,025 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 32 states. [2018-11-23 13:07:03,025 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 32 states. [2018-11-23 13:07:03,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:03,027 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-11-23 13:07:03,027 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-11-23 13:07:03,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:03,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:03,027 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 33 states. [2018-11-23 13:07:03,028 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 33 states. [2018-11-23 13:07:03,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:03,029 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-11-23 13:07:03,029 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-11-23 13:07:03,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:03,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:03,029 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:03,029 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:03,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 13:07:03,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-11-23 13:07:03,030 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 20 [2018-11-23 13:07:03,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:03,031 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-11-23 13:07:03,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 13:07:03,031 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-11-23 13:07:03,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 13:07:03,032 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:03,032 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:03,032 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:03,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:03,032 INFO L82 PathProgramCache]: Analyzing trace with hash 33316767, now seen corresponding path program 3 times [2018-11-23 13:07:03,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:03,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:03,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:03,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:07:03,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:03,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:03,222 INFO L256 TraceCheckUtils]: 0: Hoare triple {1947#true} call ULTIMATE.init(); {1947#true} is VALID [2018-11-23 13:07:03,222 INFO L273 TraceCheckUtils]: 1: Hoare triple {1947#true} assume true; {1947#true} is VALID [2018-11-23 13:07:03,222 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1947#true} {1947#true} #37#return; {1947#true} is VALID [2018-11-23 13:07:03,223 INFO L256 TraceCheckUtils]: 3: Hoare triple {1947#true} call #t~ret2 := main(); {1947#true} is VALID [2018-11-23 13:07:03,232 INFO L273 TraceCheckUtils]: 4: Hoare triple {1947#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {1949#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:03,233 INFO L273 TraceCheckUtils]: 5: Hoare triple {1949#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1949#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:03,234 INFO L273 TraceCheckUtils]: 6: Hoare triple {1949#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1950#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:07:03,234 INFO L273 TraceCheckUtils]: 7: Hoare triple {1950#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1950#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:07:03,235 INFO L273 TraceCheckUtils]: 8: Hoare triple {1950#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1951#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:03,236 INFO L273 TraceCheckUtils]: 9: Hoare triple {1951#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {1951#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:03,237 INFO L273 TraceCheckUtils]: 10: Hoare triple {1951#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1952#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:07:03,238 INFO L273 TraceCheckUtils]: 11: Hoare triple {1952#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1952#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:07:03,239 INFO L273 TraceCheckUtils]: 12: Hoare triple {1952#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1953#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:03,240 INFO L273 TraceCheckUtils]: 13: Hoare triple {1953#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {1953#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:03,241 INFO L273 TraceCheckUtils]: 14: Hoare triple {1953#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1954#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 5))} is VALID [2018-11-23 13:07:03,242 INFO L273 TraceCheckUtils]: 15: Hoare triple {1954#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 < 99); {1948#false} is VALID [2018-11-23 13:07:03,242 INFO L256 TraceCheckUtils]: 16: Hoare triple {1948#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1948#false} is VALID [2018-11-23 13:07:03,243 INFO L273 TraceCheckUtils]: 17: Hoare triple {1948#false} ~cond := #in~cond; {1948#false} is VALID [2018-11-23 13:07:03,243 INFO L273 TraceCheckUtils]: 18: Hoare triple {1948#false} assume 0 == ~cond; {1948#false} is VALID [2018-11-23 13:07:03,243 INFO L273 TraceCheckUtils]: 19: Hoare triple {1948#false} assume !false; {1948#false} is VALID [2018-11-23 13:07:03,244 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:03,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:03,245 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:07:03,254 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:07:03,296 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 13:07:03,296 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:07:03,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:03,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:04,108 INFO L256 TraceCheckUtils]: 0: Hoare triple {1947#true} call ULTIMATE.init(); {1947#true} is VALID [2018-11-23 13:07:04,108 INFO L273 TraceCheckUtils]: 1: Hoare triple {1947#true} assume true; {1947#true} is VALID [2018-11-23 13:07:04,109 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1947#true} {1947#true} #37#return; {1947#true} is VALID [2018-11-23 13:07:04,109 INFO L256 TraceCheckUtils]: 3: Hoare triple {1947#true} call #t~ret2 := main(); {1947#true} is VALID [2018-11-23 13:07:04,109 INFO L273 TraceCheckUtils]: 4: Hoare triple {1947#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {1947#true} is VALID [2018-11-23 13:07:04,110 INFO L273 TraceCheckUtils]: 5: Hoare triple {1947#true} assume !!(~x~0 % 4294967296 < 99); {1947#true} is VALID [2018-11-23 13:07:04,110 INFO L273 TraceCheckUtils]: 6: Hoare triple {1947#true} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1947#true} is VALID [2018-11-23 13:07:04,110 INFO L273 TraceCheckUtils]: 7: Hoare triple {1947#true} assume !!(~x~0 % 4294967296 < 99); {1947#true} is VALID [2018-11-23 13:07:04,110 INFO L273 TraceCheckUtils]: 8: Hoare triple {1947#true} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1947#true} is VALID [2018-11-23 13:07:04,111 INFO L273 TraceCheckUtils]: 9: Hoare triple {1947#true} assume !!(~x~0 % 4294967296 < 99); {1947#true} is VALID [2018-11-23 13:07:04,111 INFO L273 TraceCheckUtils]: 10: Hoare triple {1947#true} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1947#true} is VALID [2018-11-23 13:07:04,111 INFO L273 TraceCheckUtils]: 11: Hoare triple {1947#true} assume !!(~x~0 % 4294967296 < 99); {1947#true} is VALID [2018-11-23 13:07:04,111 INFO L273 TraceCheckUtils]: 12: Hoare triple {1947#true} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1947#true} is VALID [2018-11-23 13:07:04,115 INFO L273 TraceCheckUtils]: 13: Hoare triple {1947#true} assume !!(~x~0 % 4294967296 < 99); {1997#(< (mod main_~x~0 4294967296) 99)} is VALID [2018-11-23 13:07:04,134 INFO L273 TraceCheckUtils]: 14: Hoare triple {1997#(< (mod main_~x~0 4294967296) 99)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2001#(and (< (mod (+ main_~x~0 4294967295) 4294967296) 99) (not (= (mod main_~y~0 2) 0)))} is VALID [2018-11-23 13:07:04,151 INFO L273 TraceCheckUtils]: 15: Hoare triple {2001#(and (< (mod (+ main_~x~0 4294967295) 4294967296) 99) (not (= (mod main_~y~0 2) 0)))} assume !(~x~0 % 4294967296 < 99); {2005#(and (< (mod (+ main_~x~0 4294967295) 4294967296) 99) (<= 99 (mod main_~x~0 4294967296)) (not (= (mod main_~y~0 2) 0)))} is VALID [2018-11-23 13:07:04,184 INFO L256 TraceCheckUtils]: 16: Hoare triple {2005#(and (< (mod (+ main_~x~0 4294967295) 4294967296) 99) (<= 99 (mod main_~x~0 4294967296)) (not (= (mod main_~y~0 2) 0)))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2009#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:07:04,185 INFO L273 TraceCheckUtils]: 17: Hoare triple {2009#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {2013#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:07:04,185 INFO L273 TraceCheckUtils]: 18: Hoare triple {2013#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1948#false} is VALID [2018-11-23 13:07:04,186 INFO L273 TraceCheckUtils]: 19: Hoare triple {1948#false} assume !false; {1948#false} is VALID [2018-11-23 13:07:04,186 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 13:07:04,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:07:04,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2018-11-23 13:07:04,206 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-11-23 13:07:04,206 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:04,206 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 13:07:06,242 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 28 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:06,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 13:07:06,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 13:07:06,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:07:06,243 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 13 states. [2018-11-23 13:07:11,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:11,243 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-11-23 13:07:11,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 13:07:11,243 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-11-23 13:07:11,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:11,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:07:11,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 43 transitions. [2018-11-23 13:07:11,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:07:11,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 43 transitions. [2018-11-23 13:07:11,246 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 43 transitions. [2018-11-23 13:07:11,315 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:11,316 INFO L225 Difference]: With dead ends: 44 [2018-11-23 13:07:11,316 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 13:07:11,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2018-11-23 13:07:11,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 13:07:11,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-23 13:07:11,353 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:11,353 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2018-11-23 13:07:11,353 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-23 13:07:11,353 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-23 13:07:11,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:11,354 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-23 13:07:11,355 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-23 13:07:11,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:11,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:11,355 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-23 13:07:11,356 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-23 13:07:11,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:11,356 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-23 13:07:11,357 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-23 13:07:11,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:11,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:11,357 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:11,357 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:11,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:07:11,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-11-23 13:07:11,358 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2018-11-23 13:07:11,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:11,358 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-11-23 13:07:11,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 13:07:11,359 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-23 13:07:11,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 13:07:11,359 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:11,359 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:11,359 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:11,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:11,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1709400550, now seen corresponding path program 6 times [2018-11-23 13:07:11,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:11,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:11,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:11,361 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:07:11,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:11,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:11,978 INFO L256 TraceCheckUtils]: 0: Hoare triple {2183#true} call ULTIMATE.init(); {2183#true} is VALID [2018-11-23 13:07:11,979 INFO L273 TraceCheckUtils]: 1: Hoare triple {2183#true} assume true; {2183#true} is VALID [2018-11-23 13:07:11,979 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2183#true} {2183#true} #37#return; {2183#true} is VALID [2018-11-23 13:07:11,979 INFO L256 TraceCheckUtils]: 3: Hoare triple {2183#true} call #t~ret2 := main(); {2183#true} is VALID [2018-11-23 13:07:11,979 INFO L273 TraceCheckUtils]: 4: Hoare triple {2183#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {2185#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:11,980 INFO L273 TraceCheckUtils]: 5: Hoare triple {2185#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2185#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:11,981 INFO L273 TraceCheckUtils]: 6: Hoare triple {2185#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2186#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:11,981 INFO L273 TraceCheckUtils]: 7: Hoare triple {2186#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {2186#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:11,983 INFO L273 TraceCheckUtils]: 8: Hoare triple {2186#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2187#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:11,983 INFO L273 TraceCheckUtils]: 9: Hoare triple {2187#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {2187#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:11,984 INFO L273 TraceCheckUtils]: 10: Hoare triple {2187#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2188#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:11,985 INFO L273 TraceCheckUtils]: 11: Hoare triple {2188#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2188#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:11,986 INFO L273 TraceCheckUtils]: 12: Hoare triple {2188#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2189#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:11,987 INFO L273 TraceCheckUtils]: 13: Hoare triple {2189#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {2189#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:11,988 INFO L273 TraceCheckUtils]: 14: Hoare triple {2189#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2190#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:11,989 INFO L273 TraceCheckUtils]: 15: Hoare triple {2190#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2190#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:11,990 INFO L273 TraceCheckUtils]: 16: Hoare triple {2190#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2191#(and (<= main_~x~0 12) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:07:11,991 INFO L273 TraceCheckUtils]: 17: Hoare triple {2191#(and (<= main_~x~0 12) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {2184#false} is VALID [2018-11-23 13:07:11,991 INFO L256 TraceCheckUtils]: 18: Hoare triple {2184#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2184#false} is VALID [2018-11-23 13:07:11,991 INFO L273 TraceCheckUtils]: 19: Hoare triple {2184#false} ~cond := #in~cond; {2184#false} is VALID [2018-11-23 13:07:11,991 INFO L273 TraceCheckUtils]: 20: Hoare triple {2184#false} assume 0 == ~cond; {2184#false} is VALID [2018-11-23 13:07:11,992 INFO L273 TraceCheckUtils]: 21: Hoare triple {2184#false} assume !false; {2184#false} is VALID [2018-11-23 13:07:11,993 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:11,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:11,993 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:07:12,002 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:07:12,023 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 13:07:12,023 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:07:12,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:12,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:12,425 INFO L256 TraceCheckUtils]: 0: Hoare triple {2183#true} call ULTIMATE.init(); {2183#true} is VALID [2018-11-23 13:07:12,426 INFO L273 TraceCheckUtils]: 1: Hoare triple {2183#true} assume true; {2183#true} is VALID [2018-11-23 13:07:12,426 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2183#true} {2183#true} #37#return; {2183#true} is VALID [2018-11-23 13:07:12,426 INFO L256 TraceCheckUtils]: 3: Hoare triple {2183#true} call #t~ret2 := main(); {2183#true} is VALID [2018-11-23 13:07:12,427 INFO L273 TraceCheckUtils]: 4: Hoare triple {2183#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {2185#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:12,429 INFO L273 TraceCheckUtils]: 5: Hoare triple {2185#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2185#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:12,430 INFO L273 TraceCheckUtils]: 6: Hoare triple {2185#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2186#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:12,432 INFO L273 TraceCheckUtils]: 7: Hoare triple {2186#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {2186#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:12,432 INFO L273 TraceCheckUtils]: 8: Hoare triple {2186#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2187#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:12,433 INFO L273 TraceCheckUtils]: 9: Hoare triple {2187#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {2187#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:12,434 INFO L273 TraceCheckUtils]: 10: Hoare triple {2187#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2188#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:12,434 INFO L273 TraceCheckUtils]: 11: Hoare triple {2188#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2188#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:12,436 INFO L273 TraceCheckUtils]: 12: Hoare triple {2188#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2189#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:12,437 INFO L273 TraceCheckUtils]: 13: Hoare triple {2189#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {2189#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:12,440 INFO L273 TraceCheckUtils]: 14: Hoare triple {2189#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2190#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:12,440 INFO L273 TraceCheckUtils]: 15: Hoare triple {2190#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2190#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:12,441 INFO L273 TraceCheckUtils]: 16: Hoare triple {2190#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2243#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:12,441 INFO L273 TraceCheckUtils]: 17: Hoare triple {2243#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {2184#false} is VALID [2018-11-23 13:07:12,442 INFO L256 TraceCheckUtils]: 18: Hoare triple {2184#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2184#false} is VALID [2018-11-23 13:07:12,442 INFO L273 TraceCheckUtils]: 19: Hoare triple {2184#false} ~cond := #in~cond; {2184#false} is VALID [2018-11-23 13:07:12,442 INFO L273 TraceCheckUtils]: 20: Hoare triple {2184#false} assume 0 == ~cond; {2184#false} is VALID [2018-11-23 13:07:12,442 INFO L273 TraceCheckUtils]: 21: Hoare triple {2184#false} assume !false; {2184#false} is VALID [2018-11-23 13:07:12,443 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:12,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:12,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 13:07:12,470 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-11-23 13:07:12,471 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:12,471 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 13:07:12,502 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-23 13:07:12,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 13:07:12,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 13:07:12,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:07:12,503 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 10 states. [2018-11-23 13:07:13,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:13,073 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-23 13:07:13,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:07:13,074 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-11-23 13:07:13,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:13,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:07:13,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 31 transitions. [2018-11-23 13:07:13,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:07:13,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 31 transitions. [2018-11-23 13:07:13,076 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 31 transitions. [2018-11-23 13:07:13,224 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:13,225 INFO L225 Difference]: With dead ends: 31 [2018-11-23 13:07:13,225 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 13:07:13,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:07:13,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 13:07:13,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-11-23 13:07:13,262 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:13,262 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 25 states. [2018-11-23 13:07:13,262 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 25 states. [2018-11-23 13:07:13,263 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 25 states. [2018-11-23 13:07:13,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:13,264 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-23 13:07:13,264 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-23 13:07:13,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:13,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:13,265 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 26 states. [2018-11-23 13:07:13,265 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 26 states. [2018-11-23 13:07:13,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:13,266 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-23 13:07:13,266 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-23 13:07:13,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:13,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:13,267 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:13,267 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:13,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:07:13,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-11-23 13:07:13,267 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2018-11-23 13:07:13,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:13,268 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-11-23 13:07:13,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 13:07:13,268 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-11-23 13:07:13,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 13:07:13,268 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:13,269 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:13,269 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:13,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:13,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1163213789, now seen corresponding path program 7 times [2018-11-23 13:07:13,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:13,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:13,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:13,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:07:13,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:13,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:13,528 INFO L256 TraceCheckUtils]: 0: Hoare triple {2396#true} call ULTIMATE.init(); {2396#true} is VALID [2018-11-23 13:07:13,528 INFO L273 TraceCheckUtils]: 1: Hoare triple {2396#true} assume true; {2396#true} is VALID [2018-11-23 13:07:13,528 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2396#true} {2396#true} #37#return; {2396#true} is VALID [2018-11-23 13:07:13,528 INFO L256 TraceCheckUtils]: 3: Hoare triple {2396#true} call #t~ret2 := main(); {2396#true} is VALID [2018-11-23 13:07:13,529 INFO L273 TraceCheckUtils]: 4: Hoare triple {2396#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {2398#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:13,529 INFO L273 TraceCheckUtils]: 5: Hoare triple {2398#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2398#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:13,530 INFO L273 TraceCheckUtils]: 6: Hoare triple {2398#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2399#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:13,530 INFO L273 TraceCheckUtils]: 7: Hoare triple {2399#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {2399#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:13,531 INFO L273 TraceCheckUtils]: 8: Hoare triple {2399#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2400#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:13,532 INFO L273 TraceCheckUtils]: 9: Hoare triple {2400#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {2400#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:13,533 INFO L273 TraceCheckUtils]: 10: Hoare triple {2400#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2401#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:13,534 INFO L273 TraceCheckUtils]: 11: Hoare triple {2401#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2401#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:13,535 INFO L273 TraceCheckUtils]: 12: Hoare triple {2401#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2402#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:13,536 INFO L273 TraceCheckUtils]: 13: Hoare triple {2402#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {2402#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:13,537 INFO L273 TraceCheckUtils]: 14: Hoare triple {2402#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2403#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:13,538 INFO L273 TraceCheckUtils]: 15: Hoare triple {2403#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2403#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:13,539 INFO L273 TraceCheckUtils]: 16: Hoare triple {2403#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2404#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:13,540 INFO L273 TraceCheckUtils]: 17: Hoare triple {2404#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2404#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:13,541 INFO L273 TraceCheckUtils]: 18: Hoare triple {2404#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2405#(and (<= main_~x~0 14) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:07:13,542 INFO L273 TraceCheckUtils]: 19: Hoare triple {2405#(and (<= main_~x~0 14) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {2397#false} is VALID [2018-11-23 13:07:13,543 INFO L256 TraceCheckUtils]: 20: Hoare triple {2397#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2397#false} is VALID [2018-11-23 13:07:13,543 INFO L273 TraceCheckUtils]: 21: Hoare triple {2397#false} ~cond := #in~cond; {2397#false} is VALID [2018-11-23 13:07:13,543 INFO L273 TraceCheckUtils]: 22: Hoare triple {2397#false} assume 0 == ~cond; {2397#false} is VALID [2018-11-23 13:07:13,543 INFO L273 TraceCheckUtils]: 23: Hoare triple {2397#false} assume !false; {2397#false} is VALID [2018-11-23 13:07:13,545 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:13,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:13,545 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:07:13,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:07:13,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:13,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:13,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:13,876 INFO L256 TraceCheckUtils]: 0: Hoare triple {2396#true} call ULTIMATE.init(); {2396#true} is VALID [2018-11-23 13:07:13,876 INFO L273 TraceCheckUtils]: 1: Hoare triple {2396#true} assume true; {2396#true} is VALID [2018-11-23 13:07:13,877 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2396#true} {2396#true} #37#return; {2396#true} is VALID [2018-11-23 13:07:13,877 INFO L256 TraceCheckUtils]: 3: Hoare triple {2396#true} call #t~ret2 := main(); {2396#true} is VALID [2018-11-23 13:07:13,877 INFO L273 TraceCheckUtils]: 4: Hoare triple {2396#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {2398#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:13,878 INFO L273 TraceCheckUtils]: 5: Hoare triple {2398#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2398#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:13,878 INFO L273 TraceCheckUtils]: 6: Hoare triple {2398#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2399#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:13,879 INFO L273 TraceCheckUtils]: 7: Hoare triple {2399#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {2399#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:13,879 INFO L273 TraceCheckUtils]: 8: Hoare triple {2399#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2400#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:13,880 INFO L273 TraceCheckUtils]: 9: Hoare triple {2400#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {2400#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:13,881 INFO L273 TraceCheckUtils]: 10: Hoare triple {2400#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2401#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:13,882 INFO L273 TraceCheckUtils]: 11: Hoare triple {2401#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2401#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:13,883 INFO L273 TraceCheckUtils]: 12: Hoare triple {2401#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2402#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:13,884 INFO L273 TraceCheckUtils]: 13: Hoare triple {2402#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {2402#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:13,885 INFO L273 TraceCheckUtils]: 14: Hoare triple {2402#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2403#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:13,885 INFO L273 TraceCheckUtils]: 15: Hoare triple {2403#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2403#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:13,887 INFO L273 TraceCheckUtils]: 16: Hoare triple {2403#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2404#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:13,887 INFO L273 TraceCheckUtils]: 17: Hoare triple {2404#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2404#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:13,888 INFO L273 TraceCheckUtils]: 18: Hoare triple {2404#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2463#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:13,889 INFO L273 TraceCheckUtils]: 19: Hoare triple {2463#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {2397#false} is VALID [2018-11-23 13:07:13,889 INFO L256 TraceCheckUtils]: 20: Hoare triple {2397#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2397#false} is VALID [2018-11-23 13:07:13,890 INFO L273 TraceCheckUtils]: 21: Hoare triple {2397#false} ~cond := #in~cond; {2397#false} is VALID [2018-11-23 13:07:13,890 INFO L273 TraceCheckUtils]: 22: Hoare triple {2397#false} assume 0 == ~cond; {2397#false} is VALID [2018-11-23 13:07:13,890 INFO L273 TraceCheckUtils]: 23: Hoare triple {2397#false} assume !false; {2397#false} is VALID [2018-11-23 13:07:13,892 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:13,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:13,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 13:07:13,913 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2018-11-23 13:07:13,913 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:13,913 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 13:07:13,951 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:13,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 13:07:13,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 13:07:13,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:07:13,952 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 11 states. [2018-11-23 13:07:14,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:14,509 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-23 13:07:14,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 13:07:14,509 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2018-11-23 13:07:14,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:14,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:07:14,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 33 transitions. [2018-11-23 13:07:14,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:07:14,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 33 transitions. [2018-11-23 13:07:14,513 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 33 transitions. [2018-11-23 13:07:14,552 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:14,553 INFO L225 Difference]: With dead ends: 33 [2018-11-23 13:07:14,553 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 13:07:14,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:07:14,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 13:07:14,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-11-23 13:07:14,582 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:14,582 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 27 states. [2018-11-23 13:07:14,582 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 27 states. [2018-11-23 13:07:14,583 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 27 states. [2018-11-23 13:07:14,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:14,584 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-11-23 13:07:14,585 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-23 13:07:14,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:14,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:14,585 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 28 states. [2018-11-23 13:07:14,585 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 28 states. [2018-11-23 13:07:14,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:14,586 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-11-23 13:07:14,586 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-23 13:07:14,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:14,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:14,587 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:14,587 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:14,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 13:07:14,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-11-23 13:07:14,588 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2018-11-23 13:07:14,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:14,589 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-11-23 13:07:14,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 13:07:14,589 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-23 13:07:14,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 13:07:14,590 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:14,590 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:14,590 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:14,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:14,590 INFO L82 PathProgramCache]: Analyzing trace with hash -81622240, now seen corresponding path program 8 times [2018-11-23 13:07:14,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:14,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:14,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:14,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:07:14,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:14,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:14,847 INFO L256 TraceCheckUtils]: 0: Hoare triple {2626#true} call ULTIMATE.init(); {2626#true} is VALID [2018-11-23 13:07:14,848 INFO L273 TraceCheckUtils]: 1: Hoare triple {2626#true} assume true; {2626#true} is VALID [2018-11-23 13:07:14,848 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2626#true} {2626#true} #37#return; {2626#true} is VALID [2018-11-23 13:07:14,849 INFO L256 TraceCheckUtils]: 3: Hoare triple {2626#true} call #t~ret2 := main(); {2626#true} is VALID [2018-11-23 13:07:14,849 INFO L273 TraceCheckUtils]: 4: Hoare triple {2626#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {2628#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:14,850 INFO L273 TraceCheckUtils]: 5: Hoare triple {2628#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2628#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:14,852 INFO L273 TraceCheckUtils]: 6: Hoare triple {2628#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2629#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:14,852 INFO L273 TraceCheckUtils]: 7: Hoare triple {2629#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {2629#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:14,854 INFO L273 TraceCheckUtils]: 8: Hoare triple {2629#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2630#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:14,855 INFO L273 TraceCheckUtils]: 9: Hoare triple {2630#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {2630#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:14,856 INFO L273 TraceCheckUtils]: 10: Hoare triple {2630#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2631#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:14,857 INFO L273 TraceCheckUtils]: 11: Hoare triple {2631#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2631#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:14,858 INFO L273 TraceCheckUtils]: 12: Hoare triple {2631#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2632#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:14,859 INFO L273 TraceCheckUtils]: 13: Hoare triple {2632#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {2632#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:14,861 INFO L273 TraceCheckUtils]: 14: Hoare triple {2632#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2633#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:14,861 INFO L273 TraceCheckUtils]: 15: Hoare triple {2633#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2633#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:14,863 INFO L273 TraceCheckUtils]: 16: Hoare triple {2633#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2634#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:14,864 INFO L273 TraceCheckUtils]: 17: Hoare triple {2634#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2634#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:14,865 INFO L273 TraceCheckUtils]: 18: Hoare triple {2634#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2635#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:14,866 INFO L273 TraceCheckUtils]: 19: Hoare triple {2635#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2635#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:14,867 INFO L273 TraceCheckUtils]: 20: Hoare triple {2635#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2636#(and (<= main_~x~0 16) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:07:14,868 INFO L273 TraceCheckUtils]: 21: Hoare triple {2636#(and (<= main_~x~0 16) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {2627#false} is VALID [2018-11-23 13:07:14,869 INFO L256 TraceCheckUtils]: 22: Hoare triple {2627#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2627#false} is VALID [2018-11-23 13:07:14,869 INFO L273 TraceCheckUtils]: 23: Hoare triple {2627#false} ~cond := #in~cond; {2627#false} is VALID [2018-11-23 13:07:14,869 INFO L273 TraceCheckUtils]: 24: Hoare triple {2627#false} assume 0 == ~cond; {2627#false} is VALID [2018-11-23 13:07:14,869 INFO L273 TraceCheckUtils]: 25: Hoare triple {2627#false} assume !false; {2627#false} is VALID [2018-11-23 13:07:14,872 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:14,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:14,872 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:07:14,881 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:07:14,892 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:07:14,892 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:07:14,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:14,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:15,019 INFO L256 TraceCheckUtils]: 0: Hoare triple {2626#true} call ULTIMATE.init(); {2626#true} is VALID [2018-11-23 13:07:15,020 INFO L273 TraceCheckUtils]: 1: Hoare triple {2626#true} assume true; {2626#true} is VALID [2018-11-23 13:07:15,020 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2626#true} {2626#true} #37#return; {2626#true} is VALID [2018-11-23 13:07:15,020 INFO L256 TraceCheckUtils]: 3: Hoare triple {2626#true} call #t~ret2 := main(); {2626#true} is VALID [2018-11-23 13:07:15,021 INFO L273 TraceCheckUtils]: 4: Hoare triple {2626#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {2628#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:15,021 INFO L273 TraceCheckUtils]: 5: Hoare triple {2628#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2628#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:15,022 INFO L273 TraceCheckUtils]: 6: Hoare triple {2628#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2629#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:15,022 INFO L273 TraceCheckUtils]: 7: Hoare triple {2629#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {2629#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:15,023 INFO L273 TraceCheckUtils]: 8: Hoare triple {2629#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2630#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:15,024 INFO L273 TraceCheckUtils]: 9: Hoare triple {2630#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {2630#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:15,025 INFO L273 TraceCheckUtils]: 10: Hoare triple {2630#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2631#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:15,026 INFO L273 TraceCheckUtils]: 11: Hoare triple {2631#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2631#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:15,027 INFO L273 TraceCheckUtils]: 12: Hoare triple {2631#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2632#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:15,028 INFO L273 TraceCheckUtils]: 13: Hoare triple {2632#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {2632#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:15,029 INFO L273 TraceCheckUtils]: 14: Hoare triple {2632#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2633#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:15,030 INFO L273 TraceCheckUtils]: 15: Hoare triple {2633#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2633#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:15,031 INFO L273 TraceCheckUtils]: 16: Hoare triple {2633#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2634#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:15,032 INFO L273 TraceCheckUtils]: 17: Hoare triple {2634#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2634#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:15,033 INFO L273 TraceCheckUtils]: 18: Hoare triple {2634#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2635#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:15,034 INFO L273 TraceCheckUtils]: 19: Hoare triple {2635#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2635#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:15,036 INFO L273 TraceCheckUtils]: 20: Hoare triple {2635#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2700#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:15,037 INFO L273 TraceCheckUtils]: 21: Hoare triple {2700#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {2627#false} is VALID [2018-11-23 13:07:15,037 INFO L256 TraceCheckUtils]: 22: Hoare triple {2627#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2627#false} is VALID [2018-11-23 13:07:15,037 INFO L273 TraceCheckUtils]: 23: Hoare triple {2627#false} ~cond := #in~cond; {2627#false} is VALID [2018-11-23 13:07:15,038 INFO L273 TraceCheckUtils]: 24: Hoare triple {2627#false} assume 0 == ~cond; {2627#false} is VALID [2018-11-23 13:07:15,038 INFO L273 TraceCheckUtils]: 25: Hoare triple {2627#false} assume !false; {2627#false} is VALID [2018-11-23 13:07:15,040 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:15,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:15,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 13:07:15,059 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-11-23 13:07:15,059 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:15,059 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 13:07:15,093 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:15,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 13:07:15,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 13:07:15,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:07:15,094 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 12 states. [2018-11-23 13:07:15,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:15,711 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-11-23 13:07:15,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 13:07:15,711 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-11-23 13:07:15,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:15,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:07:15,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 35 transitions. [2018-11-23 13:07:15,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:07:15,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 35 transitions. [2018-11-23 13:07:15,714 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 35 transitions. [2018-11-23 13:07:15,802 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:15,803 INFO L225 Difference]: With dead ends: 35 [2018-11-23 13:07:15,803 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 13:07:15,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:07:15,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 13:07:15,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-23 13:07:15,961 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:15,961 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 29 states. [2018-11-23 13:07:15,961 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 29 states. [2018-11-23 13:07:15,961 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 29 states. [2018-11-23 13:07:15,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:15,963 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-23 13:07:15,963 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-23 13:07:15,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:15,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:15,964 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 30 states. [2018-11-23 13:07:15,964 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 30 states. [2018-11-23 13:07:15,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:15,964 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-23 13:07:15,964 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-23 13:07:15,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:15,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:15,965 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:15,965 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:15,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 13:07:15,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-11-23 13:07:15,966 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2018-11-23 13:07:15,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:15,966 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-11-23 13:07:15,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 13:07:15,966 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-11-23 13:07:15,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 13:07:15,967 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:15,967 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:15,967 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:15,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:15,967 INFO L82 PathProgramCache]: Analyzing trace with hash -54229283, now seen corresponding path program 9 times [2018-11-23 13:07:15,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:15,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:15,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:15,969 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:07:15,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:15,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:16,259 INFO L256 TraceCheckUtils]: 0: Hoare triple {2873#true} call ULTIMATE.init(); {2873#true} is VALID [2018-11-23 13:07:16,259 INFO L273 TraceCheckUtils]: 1: Hoare triple {2873#true} assume true; {2873#true} is VALID [2018-11-23 13:07:16,259 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2873#true} {2873#true} #37#return; {2873#true} is VALID [2018-11-23 13:07:16,259 INFO L256 TraceCheckUtils]: 3: Hoare triple {2873#true} call #t~ret2 := main(); {2873#true} is VALID [2018-11-23 13:07:16,260 INFO L273 TraceCheckUtils]: 4: Hoare triple {2873#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {2875#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:16,260 INFO L273 TraceCheckUtils]: 5: Hoare triple {2875#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2875#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:16,261 INFO L273 TraceCheckUtils]: 6: Hoare triple {2875#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2876#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:16,261 INFO L273 TraceCheckUtils]: 7: Hoare triple {2876#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {2876#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:16,262 INFO L273 TraceCheckUtils]: 8: Hoare triple {2876#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2877#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:16,263 INFO L273 TraceCheckUtils]: 9: Hoare triple {2877#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {2877#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:16,263 INFO L273 TraceCheckUtils]: 10: Hoare triple {2877#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2878#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:16,264 INFO L273 TraceCheckUtils]: 11: Hoare triple {2878#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2878#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:16,264 INFO L273 TraceCheckUtils]: 12: Hoare triple {2878#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2879#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:16,265 INFO L273 TraceCheckUtils]: 13: Hoare triple {2879#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {2879#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:16,266 INFO L273 TraceCheckUtils]: 14: Hoare triple {2879#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2880#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:16,267 INFO L273 TraceCheckUtils]: 15: Hoare triple {2880#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2880#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:16,268 INFO L273 TraceCheckUtils]: 16: Hoare triple {2880#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2881#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:16,269 INFO L273 TraceCheckUtils]: 17: Hoare triple {2881#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2881#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:16,270 INFO L273 TraceCheckUtils]: 18: Hoare triple {2881#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2882#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:16,271 INFO L273 TraceCheckUtils]: 19: Hoare triple {2882#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2882#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:16,287 INFO L273 TraceCheckUtils]: 20: Hoare triple {2882#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2883#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:16,288 INFO L273 TraceCheckUtils]: 21: Hoare triple {2883#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2883#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:16,289 INFO L273 TraceCheckUtils]: 22: Hoare triple {2883#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2884#(and (<= main_~x~0 18) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:07:16,289 INFO L273 TraceCheckUtils]: 23: Hoare triple {2884#(and (<= main_~x~0 18) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {2874#false} is VALID [2018-11-23 13:07:16,290 INFO L256 TraceCheckUtils]: 24: Hoare triple {2874#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2874#false} is VALID [2018-11-23 13:07:16,290 INFO L273 TraceCheckUtils]: 25: Hoare triple {2874#false} ~cond := #in~cond; {2874#false} is VALID [2018-11-23 13:07:16,290 INFO L273 TraceCheckUtils]: 26: Hoare triple {2874#false} assume 0 == ~cond; {2874#false} is VALID [2018-11-23 13:07:16,290 INFO L273 TraceCheckUtils]: 27: Hoare triple {2874#false} assume !false; {2874#false} is VALID [2018-11-23 13:07:16,291 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:16,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:16,291 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:07:16,300 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:07:16,348 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-23 13:07:16,348 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:07:16,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:16,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:16,567 INFO L256 TraceCheckUtils]: 0: Hoare triple {2873#true} call ULTIMATE.init(); {2873#true} is VALID [2018-11-23 13:07:16,567 INFO L273 TraceCheckUtils]: 1: Hoare triple {2873#true} assume true; {2873#true} is VALID [2018-11-23 13:07:16,567 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2873#true} {2873#true} #37#return; {2873#true} is VALID [2018-11-23 13:07:16,567 INFO L256 TraceCheckUtils]: 3: Hoare triple {2873#true} call #t~ret2 := main(); {2873#true} is VALID [2018-11-23 13:07:16,568 INFO L273 TraceCheckUtils]: 4: Hoare triple {2873#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {2875#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:16,568 INFO L273 TraceCheckUtils]: 5: Hoare triple {2875#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2875#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:16,570 INFO L273 TraceCheckUtils]: 6: Hoare triple {2875#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2876#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:16,570 INFO L273 TraceCheckUtils]: 7: Hoare triple {2876#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {2876#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:16,571 INFO L273 TraceCheckUtils]: 8: Hoare triple {2876#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2877#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:16,572 INFO L273 TraceCheckUtils]: 9: Hoare triple {2877#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {2877#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:16,573 INFO L273 TraceCheckUtils]: 10: Hoare triple {2877#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2878#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:16,574 INFO L273 TraceCheckUtils]: 11: Hoare triple {2878#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2878#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:16,575 INFO L273 TraceCheckUtils]: 12: Hoare triple {2878#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2879#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:16,576 INFO L273 TraceCheckUtils]: 13: Hoare triple {2879#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {2879#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:16,577 INFO L273 TraceCheckUtils]: 14: Hoare triple {2879#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2880#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:16,577 INFO L273 TraceCheckUtils]: 15: Hoare triple {2880#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2880#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:16,578 INFO L273 TraceCheckUtils]: 16: Hoare triple {2880#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2881#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:16,579 INFO L273 TraceCheckUtils]: 17: Hoare triple {2881#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2881#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:16,580 INFO L273 TraceCheckUtils]: 18: Hoare triple {2881#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2882#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:16,581 INFO L273 TraceCheckUtils]: 19: Hoare triple {2882#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2882#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:16,582 INFO L273 TraceCheckUtils]: 20: Hoare triple {2882#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2883#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:16,583 INFO L273 TraceCheckUtils]: 21: Hoare triple {2883#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2883#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:16,584 INFO L273 TraceCheckUtils]: 22: Hoare triple {2883#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {2954#(and (<= main_~x~0 18) (<= (mod main_~y~0 2) 0) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:16,585 INFO L273 TraceCheckUtils]: 23: Hoare triple {2954#(and (<= main_~x~0 18) (<= (mod main_~y~0 2) 0) (<= 18 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {2954#(and (<= main_~x~0 18) (<= (mod main_~y~0 2) 0) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:16,587 INFO L256 TraceCheckUtils]: 24: Hoare triple {2954#(and (<= main_~x~0 18) (<= (mod main_~y~0 2) 0) (<= 18 main_~x~0))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2961#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:07:16,587 INFO L273 TraceCheckUtils]: 25: Hoare triple {2961#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {2965#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:07:16,588 INFO L273 TraceCheckUtils]: 26: Hoare triple {2965#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2874#false} is VALID [2018-11-23 13:07:16,588 INFO L273 TraceCheckUtils]: 27: Hoare triple {2874#false} assume !false; {2874#false} is VALID [2018-11-23 13:07:16,590 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:16,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:16,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 15 [2018-11-23 13:07:16,609 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-11-23 13:07:16,609 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:16,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 13:07:16,645 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:16,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 13:07:16,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 13:07:16,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-11-23 13:07:16,646 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 15 states. [2018-11-23 13:07:17,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:17,421 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-11-23 13:07:17,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 13:07:17,421 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-11-23 13:07:17,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:17,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:07:17,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 37 transitions. [2018-11-23 13:07:17,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:07:17,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 37 transitions. [2018-11-23 13:07:17,424 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 37 transitions. [2018-11-23 13:07:17,460 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:17,461 INFO L225 Difference]: With dead ends: 37 [2018-11-23 13:07:17,462 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 13:07:17,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-11-23 13:07:17,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 13:07:17,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-23 13:07:17,489 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:17,489 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 31 states. [2018-11-23 13:07:17,489 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 31 states. [2018-11-23 13:07:17,490 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 31 states. [2018-11-23 13:07:17,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:17,491 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-11-23 13:07:17,491 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-23 13:07:17,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:17,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:17,492 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 32 states. [2018-11-23 13:07:17,492 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 32 states. [2018-11-23 13:07:17,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:17,493 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-11-23 13:07:17,493 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-23 13:07:17,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:17,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:17,494 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:17,494 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:17,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 13:07:17,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-11-23 13:07:17,495 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2018-11-23 13:07:17,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:17,495 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-11-23 13:07:17,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 13:07:17,495 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-11-23 13:07:17,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 13:07:17,496 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:17,496 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:17,496 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:17,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:17,496 INFO L82 PathProgramCache]: Analyzing trace with hash 500598618, now seen corresponding path program 10 times [2018-11-23 13:07:17,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:17,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:17,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:17,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:07:17,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:17,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:17,817 INFO L256 TraceCheckUtils]: 0: Hoare triple {3139#true} call ULTIMATE.init(); {3139#true} is VALID [2018-11-23 13:07:17,818 INFO L273 TraceCheckUtils]: 1: Hoare triple {3139#true} assume true; {3139#true} is VALID [2018-11-23 13:07:17,818 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3139#true} {3139#true} #37#return; {3139#true} is VALID [2018-11-23 13:07:17,818 INFO L256 TraceCheckUtils]: 3: Hoare triple {3139#true} call #t~ret2 := main(); {3139#true} is VALID [2018-11-23 13:07:17,819 INFO L273 TraceCheckUtils]: 4: Hoare triple {3139#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {3141#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:17,820 INFO L273 TraceCheckUtils]: 5: Hoare triple {3141#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3141#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:17,821 INFO L273 TraceCheckUtils]: 6: Hoare triple {3141#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3142#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:17,821 INFO L273 TraceCheckUtils]: 7: Hoare triple {3142#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {3142#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:17,823 INFO L273 TraceCheckUtils]: 8: Hoare triple {3142#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3143#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:17,823 INFO L273 TraceCheckUtils]: 9: Hoare triple {3143#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {3143#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:17,825 INFO L273 TraceCheckUtils]: 10: Hoare triple {3143#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3144#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:17,825 INFO L273 TraceCheckUtils]: 11: Hoare triple {3144#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3144#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:17,826 INFO L273 TraceCheckUtils]: 12: Hoare triple {3144#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3145#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:17,827 INFO L273 TraceCheckUtils]: 13: Hoare triple {3145#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {3145#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:17,828 INFO L273 TraceCheckUtils]: 14: Hoare triple {3145#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3146#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:17,829 INFO L273 TraceCheckUtils]: 15: Hoare triple {3146#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3146#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:17,830 INFO L273 TraceCheckUtils]: 16: Hoare triple {3146#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3147#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:17,831 INFO L273 TraceCheckUtils]: 17: Hoare triple {3147#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3147#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:17,832 INFO L273 TraceCheckUtils]: 18: Hoare triple {3147#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3148#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:17,833 INFO L273 TraceCheckUtils]: 19: Hoare triple {3148#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3148#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:17,834 INFO L273 TraceCheckUtils]: 20: Hoare triple {3148#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3149#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:17,835 INFO L273 TraceCheckUtils]: 21: Hoare triple {3149#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3149#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:17,836 INFO L273 TraceCheckUtils]: 22: Hoare triple {3149#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3150#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:17,837 INFO L273 TraceCheckUtils]: 23: Hoare triple {3150#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3150#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:17,838 INFO L273 TraceCheckUtils]: 24: Hoare triple {3150#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3151#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:17,839 INFO L273 TraceCheckUtils]: 25: Hoare triple {3151#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 20))} assume !(~x~0 % 4294967296 < 99); {3140#false} is VALID [2018-11-23 13:07:17,839 INFO L256 TraceCheckUtils]: 26: Hoare triple {3140#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3140#false} is VALID [2018-11-23 13:07:17,839 INFO L273 TraceCheckUtils]: 27: Hoare triple {3140#false} ~cond := #in~cond; {3140#false} is VALID [2018-11-23 13:07:17,840 INFO L273 TraceCheckUtils]: 28: Hoare triple {3140#false} assume 0 == ~cond; {3140#false} is VALID [2018-11-23 13:07:17,840 INFO L273 TraceCheckUtils]: 29: Hoare triple {3140#false} assume !false; {3140#false} is VALID [2018-11-23 13:07:17,842 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:17,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:17,842 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:07:17,851 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:07:17,862 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:07:17,862 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:07:17,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:17,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:17,972 INFO L256 TraceCheckUtils]: 0: Hoare triple {3139#true} call ULTIMATE.init(); {3139#true} is VALID [2018-11-23 13:07:17,973 INFO L273 TraceCheckUtils]: 1: Hoare triple {3139#true} assume true; {3139#true} is VALID [2018-11-23 13:07:17,973 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3139#true} {3139#true} #37#return; {3139#true} is VALID [2018-11-23 13:07:17,973 INFO L256 TraceCheckUtils]: 3: Hoare triple {3139#true} call #t~ret2 := main(); {3139#true} is VALID [2018-11-23 13:07:17,975 INFO L273 TraceCheckUtils]: 4: Hoare triple {3139#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {3141#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:17,975 INFO L273 TraceCheckUtils]: 5: Hoare triple {3141#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3141#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:17,977 INFO L273 TraceCheckUtils]: 6: Hoare triple {3141#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3142#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:17,977 INFO L273 TraceCheckUtils]: 7: Hoare triple {3142#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {3142#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:17,978 INFO L273 TraceCheckUtils]: 8: Hoare triple {3142#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3143#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:17,978 INFO L273 TraceCheckUtils]: 9: Hoare triple {3143#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {3143#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:17,979 INFO L273 TraceCheckUtils]: 10: Hoare triple {3143#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3144#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:17,979 INFO L273 TraceCheckUtils]: 11: Hoare triple {3144#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3144#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:17,980 INFO L273 TraceCheckUtils]: 12: Hoare triple {3144#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3145#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:17,981 INFO L273 TraceCheckUtils]: 13: Hoare triple {3145#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {3145#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:17,982 INFO L273 TraceCheckUtils]: 14: Hoare triple {3145#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3146#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:17,983 INFO L273 TraceCheckUtils]: 15: Hoare triple {3146#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3146#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:17,984 INFO L273 TraceCheckUtils]: 16: Hoare triple {3146#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3147#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:17,985 INFO L273 TraceCheckUtils]: 17: Hoare triple {3147#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3147#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:17,986 INFO L273 TraceCheckUtils]: 18: Hoare triple {3147#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3148#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:17,987 INFO L273 TraceCheckUtils]: 19: Hoare triple {3148#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3148#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:17,988 INFO L273 TraceCheckUtils]: 20: Hoare triple {3148#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3149#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:17,989 INFO L273 TraceCheckUtils]: 21: Hoare triple {3149#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3149#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:17,990 INFO L273 TraceCheckUtils]: 22: Hoare triple {3149#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3150#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:17,991 INFO L273 TraceCheckUtils]: 23: Hoare triple {3150#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3150#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:17,992 INFO L273 TraceCheckUtils]: 24: Hoare triple {3150#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3227#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:17,993 INFO L273 TraceCheckUtils]: 25: Hoare triple {3227#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(~x~0 % 4294967296 < 99); {3140#false} is VALID [2018-11-23 13:07:17,993 INFO L256 TraceCheckUtils]: 26: Hoare triple {3140#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3140#false} is VALID [2018-11-23 13:07:17,993 INFO L273 TraceCheckUtils]: 27: Hoare triple {3140#false} ~cond := #in~cond; {3140#false} is VALID [2018-11-23 13:07:17,994 INFO L273 TraceCheckUtils]: 28: Hoare triple {3140#false} assume 0 == ~cond; {3140#false} is VALID [2018-11-23 13:07:17,994 INFO L273 TraceCheckUtils]: 29: Hoare triple {3140#false} assume !false; {3140#false} is VALID [2018-11-23 13:07:17,996 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:18,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:18,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-23 13:07:18,015 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2018-11-23 13:07:18,015 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:18,016 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 13:07:18,050 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-23 13:07:18,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 13:07:18,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 13:07:18,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:07:18,051 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 14 states. [2018-11-23 13:07:18,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:18,950 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-11-23 13:07:18,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 13:07:18,951 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2018-11-23 13:07:18,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:18,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:07:18,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 39 transitions. [2018-11-23 13:07:18,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:07:18,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 39 transitions. [2018-11-23 13:07:18,956 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 39 transitions. [2018-11-23 13:07:19,015 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:19,016 INFO L225 Difference]: With dead ends: 39 [2018-11-23 13:07:19,016 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 13:07:19,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:07:19,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 13:07:19,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-23 13:07:19,090 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:19,090 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2018-11-23 13:07:19,090 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2018-11-23 13:07:19,090 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2018-11-23 13:07:19,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:19,092 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-11-23 13:07:19,092 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-11-23 13:07:19,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:19,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:19,092 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2018-11-23 13:07:19,093 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2018-11-23 13:07:19,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:19,093 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-11-23 13:07:19,093 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-11-23 13:07:19,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:19,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:19,094 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:19,094 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:19,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 13:07:19,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-11-23 13:07:19,095 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2018-11-23 13:07:19,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:19,095 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-11-23 13:07:19,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 13:07:19,095 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-23 13:07:19,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 13:07:19,096 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:19,096 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:19,096 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:19,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:19,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1114266775, now seen corresponding path program 11 times [2018-11-23 13:07:19,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:19,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:19,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:19,097 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:07:19,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:19,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:19,792 INFO L256 TraceCheckUtils]: 0: Hoare triple {3420#true} call ULTIMATE.init(); {3420#true} is VALID [2018-11-23 13:07:19,792 INFO L273 TraceCheckUtils]: 1: Hoare triple {3420#true} assume true; {3420#true} is VALID [2018-11-23 13:07:19,792 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3420#true} {3420#true} #37#return; {3420#true} is VALID [2018-11-23 13:07:19,793 INFO L256 TraceCheckUtils]: 3: Hoare triple {3420#true} call #t~ret2 := main(); {3420#true} is VALID [2018-11-23 13:07:19,793 INFO L273 TraceCheckUtils]: 4: Hoare triple {3420#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {3422#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:19,794 INFO L273 TraceCheckUtils]: 5: Hoare triple {3422#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3422#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:19,795 INFO L273 TraceCheckUtils]: 6: Hoare triple {3422#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3423#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:19,796 INFO L273 TraceCheckUtils]: 7: Hoare triple {3423#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {3423#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:19,797 INFO L273 TraceCheckUtils]: 8: Hoare triple {3423#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3424#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:19,798 INFO L273 TraceCheckUtils]: 9: Hoare triple {3424#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {3424#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:19,799 INFO L273 TraceCheckUtils]: 10: Hoare triple {3424#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3425#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:19,799 INFO L273 TraceCheckUtils]: 11: Hoare triple {3425#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3425#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:19,801 INFO L273 TraceCheckUtils]: 12: Hoare triple {3425#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3426#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:19,801 INFO L273 TraceCheckUtils]: 13: Hoare triple {3426#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {3426#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:19,802 INFO L273 TraceCheckUtils]: 14: Hoare triple {3426#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3427#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:19,803 INFO L273 TraceCheckUtils]: 15: Hoare triple {3427#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3427#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:19,804 INFO L273 TraceCheckUtils]: 16: Hoare triple {3427#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3428#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:19,805 INFO L273 TraceCheckUtils]: 17: Hoare triple {3428#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3428#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:19,806 INFO L273 TraceCheckUtils]: 18: Hoare triple {3428#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3429#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:19,807 INFO L273 TraceCheckUtils]: 19: Hoare triple {3429#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3429#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:19,808 INFO L273 TraceCheckUtils]: 20: Hoare triple {3429#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3430#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:19,809 INFO L273 TraceCheckUtils]: 21: Hoare triple {3430#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3430#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:19,810 INFO L273 TraceCheckUtils]: 22: Hoare triple {3430#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3431#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:19,811 INFO L273 TraceCheckUtils]: 23: Hoare triple {3431#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3431#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:19,812 INFO L273 TraceCheckUtils]: 24: Hoare triple {3431#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3432#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:19,813 INFO L273 TraceCheckUtils]: 25: Hoare triple {3432#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {3432#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:19,814 INFO L273 TraceCheckUtils]: 26: Hoare triple {3432#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3433#(and (<= main_~x~0 22) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:07:19,815 INFO L273 TraceCheckUtils]: 27: Hoare triple {3433#(and (<= main_~x~0 22) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {3421#false} is VALID [2018-11-23 13:07:19,815 INFO L256 TraceCheckUtils]: 28: Hoare triple {3421#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3421#false} is VALID [2018-11-23 13:07:19,815 INFO L273 TraceCheckUtils]: 29: Hoare triple {3421#false} ~cond := #in~cond; {3421#false} is VALID [2018-11-23 13:07:19,816 INFO L273 TraceCheckUtils]: 30: Hoare triple {3421#false} assume 0 == ~cond; {3421#false} is VALID [2018-11-23 13:07:19,816 INFO L273 TraceCheckUtils]: 31: Hoare triple {3421#false} assume !false; {3421#false} is VALID [2018-11-23 13:07:19,818 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:19,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:19,818 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:07:19,829 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:07:25,998 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-23 13:07:25,999 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:07:26,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:26,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:26,142 INFO L256 TraceCheckUtils]: 0: Hoare triple {3420#true} call ULTIMATE.init(); {3420#true} is VALID [2018-11-23 13:07:26,142 INFO L273 TraceCheckUtils]: 1: Hoare triple {3420#true} assume true; {3420#true} is VALID [2018-11-23 13:07:26,142 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3420#true} {3420#true} #37#return; {3420#true} is VALID [2018-11-23 13:07:26,143 INFO L256 TraceCheckUtils]: 3: Hoare triple {3420#true} call #t~ret2 := main(); {3420#true} is VALID [2018-11-23 13:07:26,143 INFO L273 TraceCheckUtils]: 4: Hoare triple {3420#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {3422#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:26,143 INFO L273 TraceCheckUtils]: 5: Hoare triple {3422#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3422#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:26,144 INFO L273 TraceCheckUtils]: 6: Hoare triple {3422#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3423#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:26,144 INFO L273 TraceCheckUtils]: 7: Hoare triple {3423#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {3423#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:26,145 INFO L273 TraceCheckUtils]: 8: Hoare triple {3423#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3424#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:26,146 INFO L273 TraceCheckUtils]: 9: Hoare triple {3424#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {3424#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:26,147 INFO L273 TraceCheckUtils]: 10: Hoare triple {3424#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3425#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:26,148 INFO L273 TraceCheckUtils]: 11: Hoare triple {3425#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3425#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:26,149 INFO L273 TraceCheckUtils]: 12: Hoare triple {3425#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3426#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:26,154 INFO L273 TraceCheckUtils]: 13: Hoare triple {3426#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {3426#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:26,155 INFO L273 TraceCheckUtils]: 14: Hoare triple {3426#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3427#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:26,156 INFO L273 TraceCheckUtils]: 15: Hoare triple {3427#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3427#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:26,156 INFO L273 TraceCheckUtils]: 16: Hoare triple {3427#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3428#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:26,157 INFO L273 TraceCheckUtils]: 17: Hoare triple {3428#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3428#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:26,158 INFO L273 TraceCheckUtils]: 18: Hoare triple {3428#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3429#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:26,158 INFO L273 TraceCheckUtils]: 19: Hoare triple {3429#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3429#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:26,176 INFO L273 TraceCheckUtils]: 20: Hoare triple {3429#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3430#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:26,182 INFO L273 TraceCheckUtils]: 21: Hoare triple {3430#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3430#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:26,183 INFO L273 TraceCheckUtils]: 22: Hoare triple {3430#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3431#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:26,183 INFO L273 TraceCheckUtils]: 23: Hoare triple {3431#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3431#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:26,201 INFO L273 TraceCheckUtils]: 24: Hoare triple {3431#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3432#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:26,206 INFO L273 TraceCheckUtils]: 25: Hoare triple {3432#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {3432#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:26,207 INFO L273 TraceCheckUtils]: 26: Hoare triple {3432#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3515#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:07:26,207 INFO L273 TraceCheckUtils]: 27: Hoare triple {3515#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {3421#false} is VALID [2018-11-23 13:07:26,207 INFO L256 TraceCheckUtils]: 28: Hoare triple {3421#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3421#false} is VALID [2018-11-23 13:07:26,208 INFO L273 TraceCheckUtils]: 29: Hoare triple {3421#false} ~cond := #in~cond; {3421#false} is VALID [2018-11-23 13:07:26,208 INFO L273 TraceCheckUtils]: 30: Hoare triple {3421#false} assume 0 == ~cond; {3421#false} is VALID [2018-11-23 13:07:26,208 INFO L273 TraceCheckUtils]: 31: Hoare triple {3421#false} assume !false; {3421#false} is VALID [2018-11-23 13:07:26,211 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:26,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:26,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-23 13:07:26,231 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 32 [2018-11-23 13:07:26,231 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:26,231 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 13:07:26,269 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:26,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 13:07:26,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 13:07:26,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-11-23 13:07:26,270 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 15 states. [2018-11-23 13:07:27,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:27,102 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-11-23 13:07:27,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 13:07:27,103 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 32 [2018-11-23 13:07:27,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:27,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:07:27,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 41 transitions. [2018-11-23 13:07:27,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:07:27,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 41 transitions. [2018-11-23 13:07:27,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 41 transitions. [2018-11-23 13:07:27,161 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:27,162 INFO L225 Difference]: With dead ends: 41 [2018-11-23 13:07:27,162 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 13:07:27,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-11-23 13:07:27,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 13:07:27,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-11-23 13:07:27,191 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:27,191 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 35 states. [2018-11-23 13:07:27,191 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 35 states. [2018-11-23 13:07:27,192 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 35 states. [2018-11-23 13:07:27,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:27,193 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-11-23 13:07:27,193 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-23 13:07:27,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:27,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:27,194 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 36 states. [2018-11-23 13:07:27,194 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 36 states. [2018-11-23 13:07:27,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:27,195 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-11-23 13:07:27,195 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-23 13:07:27,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:27,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:27,196 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:27,196 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:27,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 13:07:27,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-11-23 13:07:27,197 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-11-23 13:07:27,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:27,198 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-11-23 13:07:27,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 13:07:27,198 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-11-23 13:07:27,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 13:07:27,198 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:27,199 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:27,199 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:27,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:27,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1856121196, now seen corresponding path program 12 times [2018-11-23 13:07:27,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:27,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:27,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:27,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:07:27,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:27,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:27,515 INFO L256 TraceCheckUtils]: 0: Hoare triple {3718#true} call ULTIMATE.init(); {3718#true} is VALID [2018-11-23 13:07:27,515 INFO L273 TraceCheckUtils]: 1: Hoare triple {3718#true} assume true; {3718#true} is VALID [2018-11-23 13:07:27,515 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3718#true} {3718#true} #37#return; {3718#true} is VALID [2018-11-23 13:07:27,516 INFO L256 TraceCheckUtils]: 3: Hoare triple {3718#true} call #t~ret2 := main(); {3718#true} is VALID [2018-11-23 13:07:27,516 INFO L273 TraceCheckUtils]: 4: Hoare triple {3718#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {3720#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:27,517 INFO L273 TraceCheckUtils]: 5: Hoare triple {3720#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3720#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:27,518 INFO L273 TraceCheckUtils]: 6: Hoare triple {3720#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3721#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:27,518 INFO L273 TraceCheckUtils]: 7: Hoare triple {3721#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {3721#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:27,519 INFO L273 TraceCheckUtils]: 8: Hoare triple {3721#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3722#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:27,520 INFO L273 TraceCheckUtils]: 9: Hoare triple {3722#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {3722#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:27,522 INFO L273 TraceCheckUtils]: 10: Hoare triple {3722#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3723#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:27,522 INFO L273 TraceCheckUtils]: 11: Hoare triple {3723#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3723#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:27,524 INFO L273 TraceCheckUtils]: 12: Hoare triple {3723#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3724#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:27,525 INFO L273 TraceCheckUtils]: 13: Hoare triple {3724#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {3724#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:27,526 INFO L273 TraceCheckUtils]: 14: Hoare triple {3724#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3725#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:27,527 INFO L273 TraceCheckUtils]: 15: Hoare triple {3725#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3725#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:27,528 INFO L273 TraceCheckUtils]: 16: Hoare triple {3725#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3726#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:27,529 INFO L273 TraceCheckUtils]: 17: Hoare triple {3726#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3726#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:27,530 INFO L273 TraceCheckUtils]: 18: Hoare triple {3726#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3727#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:27,531 INFO L273 TraceCheckUtils]: 19: Hoare triple {3727#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3727#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:27,532 INFO L273 TraceCheckUtils]: 20: Hoare triple {3727#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3728#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:27,533 INFO L273 TraceCheckUtils]: 21: Hoare triple {3728#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3728#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:27,534 INFO L273 TraceCheckUtils]: 22: Hoare triple {3728#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3729#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:27,535 INFO L273 TraceCheckUtils]: 23: Hoare triple {3729#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3729#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:27,536 INFO L273 TraceCheckUtils]: 24: Hoare triple {3729#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3730#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:27,537 INFO L273 TraceCheckUtils]: 25: Hoare triple {3730#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {3730#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:27,538 INFO L273 TraceCheckUtils]: 26: Hoare triple {3730#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3731#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:07:27,539 INFO L273 TraceCheckUtils]: 27: Hoare triple {3731#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3731#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:07:27,541 INFO L273 TraceCheckUtils]: 28: Hoare triple {3731#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3732#(and (<= main_~x~0 24) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:07:27,542 INFO L273 TraceCheckUtils]: 29: Hoare triple {3732#(and (<= main_~x~0 24) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {3719#false} is VALID [2018-11-23 13:07:27,542 INFO L256 TraceCheckUtils]: 30: Hoare triple {3719#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3719#false} is VALID [2018-11-23 13:07:27,542 INFO L273 TraceCheckUtils]: 31: Hoare triple {3719#false} ~cond := #in~cond; {3719#false} is VALID [2018-11-23 13:07:27,543 INFO L273 TraceCheckUtils]: 32: Hoare triple {3719#false} assume 0 == ~cond; {3719#false} is VALID [2018-11-23 13:07:27,543 INFO L273 TraceCheckUtils]: 33: Hoare triple {3719#false} assume !false; {3719#false} is VALID [2018-11-23 13:07:27,547 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:27,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:27,547 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:07:27,556 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:07:40,538 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-23 13:07:40,538 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:07:40,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:40,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:40,691 INFO L256 TraceCheckUtils]: 0: Hoare triple {3718#true} call ULTIMATE.init(); {3718#true} is VALID [2018-11-23 13:07:40,692 INFO L273 TraceCheckUtils]: 1: Hoare triple {3718#true} assume true; {3718#true} is VALID [2018-11-23 13:07:40,692 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3718#true} {3718#true} #37#return; {3718#true} is VALID [2018-11-23 13:07:40,692 INFO L256 TraceCheckUtils]: 3: Hoare triple {3718#true} call #t~ret2 := main(); {3718#true} is VALID [2018-11-23 13:07:40,693 INFO L273 TraceCheckUtils]: 4: Hoare triple {3718#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {3720#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:40,694 INFO L273 TraceCheckUtils]: 5: Hoare triple {3720#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3720#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:40,695 INFO L273 TraceCheckUtils]: 6: Hoare triple {3720#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3721#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:40,696 INFO L273 TraceCheckUtils]: 7: Hoare triple {3721#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {3721#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:40,697 INFO L273 TraceCheckUtils]: 8: Hoare triple {3721#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3722#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:40,698 INFO L273 TraceCheckUtils]: 9: Hoare triple {3722#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {3722#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:40,699 INFO L273 TraceCheckUtils]: 10: Hoare triple {3722#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3723#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:40,700 INFO L273 TraceCheckUtils]: 11: Hoare triple {3723#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3723#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:40,701 INFO L273 TraceCheckUtils]: 12: Hoare triple {3723#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3724#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:40,702 INFO L273 TraceCheckUtils]: 13: Hoare triple {3724#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {3724#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:40,703 INFO L273 TraceCheckUtils]: 14: Hoare triple {3724#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3725#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:40,704 INFO L273 TraceCheckUtils]: 15: Hoare triple {3725#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3725#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:40,706 INFO L273 TraceCheckUtils]: 16: Hoare triple {3725#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3726#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:40,706 INFO L273 TraceCheckUtils]: 17: Hoare triple {3726#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3726#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:40,708 INFO L273 TraceCheckUtils]: 18: Hoare triple {3726#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3727#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:40,708 INFO L273 TraceCheckUtils]: 19: Hoare triple {3727#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3727#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:40,710 INFO L273 TraceCheckUtils]: 20: Hoare triple {3727#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3728#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:40,711 INFO L273 TraceCheckUtils]: 21: Hoare triple {3728#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3728#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:40,712 INFO L273 TraceCheckUtils]: 22: Hoare triple {3728#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3729#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:40,713 INFO L273 TraceCheckUtils]: 23: Hoare triple {3729#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3729#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:40,714 INFO L273 TraceCheckUtils]: 24: Hoare triple {3729#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3730#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:40,715 INFO L273 TraceCheckUtils]: 25: Hoare triple {3730#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {3730#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:40,716 INFO L273 TraceCheckUtils]: 26: Hoare triple {3730#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3731#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:07:40,717 INFO L273 TraceCheckUtils]: 27: Hoare triple {3731#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3731#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:07:40,718 INFO L273 TraceCheckUtils]: 28: Hoare triple {3731#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {3820#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:07:40,719 INFO L273 TraceCheckUtils]: 29: Hoare triple {3820#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {3719#false} is VALID [2018-11-23 13:07:40,719 INFO L256 TraceCheckUtils]: 30: Hoare triple {3719#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3719#false} is VALID [2018-11-23 13:07:40,720 INFO L273 TraceCheckUtils]: 31: Hoare triple {3719#false} ~cond := #in~cond; {3719#false} is VALID [2018-11-23 13:07:40,720 INFO L273 TraceCheckUtils]: 32: Hoare triple {3719#false} assume 0 == ~cond; {3719#false} is VALID [2018-11-23 13:07:40,720 INFO L273 TraceCheckUtils]: 33: Hoare triple {3719#false} assume !false; {3719#false} is VALID [2018-11-23 13:07:40,723 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:40,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:40,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-11-23 13:07:40,743 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2018-11-23 13:07:40,743 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:40,743 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 13:07:40,788 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:40,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 13:07:40,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 13:07:40,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:07:40,790 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 16 states. [2018-11-23 13:07:41,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:41,896 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-11-23 13:07:41,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 13:07:41,897 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2018-11-23 13:07:41,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:41,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:07:41,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 43 transitions. [2018-11-23 13:07:41,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:07:41,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 43 transitions. [2018-11-23 13:07:41,899 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 43 transitions. [2018-11-23 13:07:42,377 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:42,378 INFO L225 Difference]: With dead ends: 43 [2018-11-23 13:07:42,378 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 13:07:42,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:07:42,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 13:07:42,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-11-23 13:07:42,463 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:42,463 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 37 states. [2018-11-23 13:07:42,463 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 37 states. [2018-11-23 13:07:42,463 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 37 states. [2018-11-23 13:07:42,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:42,465 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-11-23 13:07:42,465 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-11-23 13:07:42,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:42,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:42,465 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 38 states. [2018-11-23 13:07:42,465 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 38 states. [2018-11-23 13:07:42,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:42,466 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-11-23 13:07:42,466 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-11-23 13:07:42,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:42,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:42,467 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:42,467 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:42,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 13:07:42,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-11-23 13:07:42,468 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2018-11-23 13:07:42,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:42,469 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-11-23 13:07:42,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 13:07:42,469 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-11-23 13:07:42,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 13:07:42,469 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:42,469 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:42,469 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:42,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:42,470 INFO L82 PathProgramCache]: Analyzing trace with hash -245709487, now seen corresponding path program 13 times [2018-11-23 13:07:42,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:42,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:42,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:42,471 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:07:42,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:42,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:42,883 INFO L256 TraceCheckUtils]: 0: Hoare triple {4033#true} call ULTIMATE.init(); {4033#true} is VALID [2018-11-23 13:07:42,883 INFO L273 TraceCheckUtils]: 1: Hoare triple {4033#true} assume true; {4033#true} is VALID [2018-11-23 13:07:42,883 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4033#true} {4033#true} #37#return; {4033#true} is VALID [2018-11-23 13:07:42,883 INFO L256 TraceCheckUtils]: 3: Hoare triple {4033#true} call #t~ret2 := main(); {4033#true} is VALID [2018-11-23 13:07:42,884 INFO L273 TraceCheckUtils]: 4: Hoare triple {4033#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {4035#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:42,885 INFO L273 TraceCheckUtils]: 5: Hoare triple {4035#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4035#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:42,886 INFO L273 TraceCheckUtils]: 6: Hoare triple {4035#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4036#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:42,887 INFO L273 TraceCheckUtils]: 7: Hoare triple {4036#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {4036#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:42,888 INFO L273 TraceCheckUtils]: 8: Hoare triple {4036#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4037#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:42,889 INFO L273 TraceCheckUtils]: 9: Hoare triple {4037#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {4037#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:42,890 INFO L273 TraceCheckUtils]: 10: Hoare triple {4037#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4038#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:42,891 INFO L273 TraceCheckUtils]: 11: Hoare triple {4038#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4038#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:42,892 INFO L273 TraceCheckUtils]: 12: Hoare triple {4038#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4039#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:42,892 INFO L273 TraceCheckUtils]: 13: Hoare triple {4039#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {4039#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:42,894 INFO L273 TraceCheckUtils]: 14: Hoare triple {4039#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4040#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:42,894 INFO L273 TraceCheckUtils]: 15: Hoare triple {4040#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4040#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:42,896 INFO L273 TraceCheckUtils]: 16: Hoare triple {4040#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4041#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:42,896 INFO L273 TraceCheckUtils]: 17: Hoare triple {4041#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4041#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:42,897 INFO L273 TraceCheckUtils]: 18: Hoare triple {4041#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4042#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:42,898 INFO L273 TraceCheckUtils]: 19: Hoare triple {4042#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4042#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:42,899 INFO L273 TraceCheckUtils]: 20: Hoare triple {4042#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4043#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:42,900 INFO L273 TraceCheckUtils]: 21: Hoare triple {4043#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4043#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:42,901 INFO L273 TraceCheckUtils]: 22: Hoare triple {4043#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4044#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:42,902 INFO L273 TraceCheckUtils]: 23: Hoare triple {4044#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4044#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:42,903 INFO L273 TraceCheckUtils]: 24: Hoare triple {4044#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4045#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:42,904 INFO L273 TraceCheckUtils]: 25: Hoare triple {4045#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {4045#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:42,905 INFO L273 TraceCheckUtils]: 26: Hoare triple {4045#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4046#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:07:42,906 INFO L273 TraceCheckUtils]: 27: Hoare triple {4046#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4046#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:07:42,907 INFO L273 TraceCheckUtils]: 28: Hoare triple {4046#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4047#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:07:42,907 INFO L273 TraceCheckUtils]: 29: Hoare triple {4047#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4047#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:07:42,909 INFO L273 TraceCheckUtils]: 30: Hoare triple {4047#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4048#(and (<= main_~x~0 26) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:07:42,910 INFO L273 TraceCheckUtils]: 31: Hoare triple {4048#(and (<= main_~x~0 26) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {4034#false} is VALID [2018-11-23 13:07:42,910 INFO L256 TraceCheckUtils]: 32: Hoare triple {4034#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4034#false} is VALID [2018-11-23 13:07:42,910 INFO L273 TraceCheckUtils]: 33: Hoare triple {4034#false} ~cond := #in~cond; {4034#false} is VALID [2018-11-23 13:07:42,910 INFO L273 TraceCheckUtils]: 34: Hoare triple {4034#false} assume 0 == ~cond; {4034#false} is VALID [2018-11-23 13:07:42,911 INFO L273 TraceCheckUtils]: 35: Hoare triple {4034#false} assume !false; {4034#false} is VALID [2018-11-23 13:07:42,914 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:42,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:42,914 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:07:42,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:07:42,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:42,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:42,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:43,079 INFO L256 TraceCheckUtils]: 0: Hoare triple {4033#true} call ULTIMATE.init(); {4033#true} is VALID [2018-11-23 13:07:43,079 INFO L273 TraceCheckUtils]: 1: Hoare triple {4033#true} assume true; {4033#true} is VALID [2018-11-23 13:07:43,079 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4033#true} {4033#true} #37#return; {4033#true} is VALID [2018-11-23 13:07:43,079 INFO L256 TraceCheckUtils]: 3: Hoare triple {4033#true} call #t~ret2 := main(); {4033#true} is VALID [2018-11-23 13:07:43,101 INFO L273 TraceCheckUtils]: 4: Hoare triple {4033#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {4035#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:43,116 INFO L273 TraceCheckUtils]: 5: Hoare triple {4035#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4035#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:43,131 INFO L273 TraceCheckUtils]: 6: Hoare triple {4035#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4036#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:43,145 INFO L273 TraceCheckUtils]: 7: Hoare triple {4036#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {4036#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:43,160 INFO L273 TraceCheckUtils]: 8: Hoare triple {4036#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4037#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:43,174 INFO L273 TraceCheckUtils]: 9: Hoare triple {4037#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {4037#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:43,183 INFO L273 TraceCheckUtils]: 10: Hoare triple {4037#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4038#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:43,187 INFO L273 TraceCheckUtils]: 11: Hoare triple {4038#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4038#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:43,188 INFO L273 TraceCheckUtils]: 12: Hoare triple {4038#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4039#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:43,188 INFO L273 TraceCheckUtils]: 13: Hoare triple {4039#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {4039#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:43,190 INFO L273 TraceCheckUtils]: 14: Hoare triple {4039#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4040#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:43,190 INFO L273 TraceCheckUtils]: 15: Hoare triple {4040#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4040#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:43,192 INFO L273 TraceCheckUtils]: 16: Hoare triple {4040#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4041#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:43,192 INFO L273 TraceCheckUtils]: 17: Hoare triple {4041#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4041#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:43,193 INFO L273 TraceCheckUtils]: 18: Hoare triple {4041#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4042#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:43,194 INFO L273 TraceCheckUtils]: 19: Hoare triple {4042#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4042#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:43,195 INFO L273 TraceCheckUtils]: 20: Hoare triple {4042#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4043#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:43,195 INFO L273 TraceCheckUtils]: 21: Hoare triple {4043#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4043#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:43,196 INFO L273 TraceCheckUtils]: 22: Hoare triple {4043#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4044#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:43,196 INFO L273 TraceCheckUtils]: 23: Hoare triple {4044#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4044#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:43,197 INFO L273 TraceCheckUtils]: 24: Hoare triple {4044#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4045#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:43,198 INFO L273 TraceCheckUtils]: 25: Hoare triple {4045#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {4045#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:43,199 INFO L273 TraceCheckUtils]: 26: Hoare triple {4045#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4046#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:07:43,200 INFO L273 TraceCheckUtils]: 27: Hoare triple {4046#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4046#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:07:43,201 INFO L273 TraceCheckUtils]: 28: Hoare triple {4046#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4047#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:07:43,202 INFO L273 TraceCheckUtils]: 29: Hoare triple {4047#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4047#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:07:43,203 INFO L273 TraceCheckUtils]: 30: Hoare triple {4047#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4142#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:07:43,204 INFO L273 TraceCheckUtils]: 31: Hoare triple {4142#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {4034#false} is VALID [2018-11-23 13:07:43,204 INFO L256 TraceCheckUtils]: 32: Hoare triple {4034#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4034#false} is VALID [2018-11-23 13:07:43,204 INFO L273 TraceCheckUtils]: 33: Hoare triple {4034#false} ~cond := #in~cond; {4034#false} is VALID [2018-11-23 13:07:43,204 INFO L273 TraceCheckUtils]: 34: Hoare triple {4034#false} assume 0 == ~cond; {4034#false} is VALID [2018-11-23 13:07:43,205 INFO L273 TraceCheckUtils]: 35: Hoare triple {4034#false} assume !false; {4034#false} is VALID [2018-11-23 13:07:43,207 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:43,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:43,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 13:07:43,230 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2018-11-23 13:07:43,230 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:43,230 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 13:07:43,274 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:43,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 13:07:43,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 13:07:43,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:07:43,276 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 17 states. [2018-11-23 13:07:44,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:44,446 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-11-23 13:07:44,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 13:07:44,446 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2018-11-23 13:07:44,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:44,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:07:44,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 45 transitions. [2018-11-23 13:07:44,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:07:44,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 45 transitions. [2018-11-23 13:07:44,448 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 45 transitions. [2018-11-23 13:07:44,947 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:44,948 INFO L225 Difference]: With dead ends: 45 [2018-11-23 13:07:44,948 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 13:07:44,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:07:44,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 13:07:44,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-11-23 13:07:44,995 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:44,995 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 39 states. [2018-11-23 13:07:44,995 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 39 states. [2018-11-23 13:07:44,995 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 39 states. [2018-11-23 13:07:44,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:44,996 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-11-23 13:07:44,997 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-11-23 13:07:44,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:44,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:44,997 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 40 states. [2018-11-23 13:07:44,997 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 40 states. [2018-11-23 13:07:44,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:44,998 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-11-23 13:07:44,998 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-11-23 13:07:44,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:44,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:44,998 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:44,998 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:44,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 13:07:44,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-11-23 13:07:44,999 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2018-11-23 13:07:44,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:44,999 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-11-23 13:07:44,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 13:07:45,000 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-11-23 13:07:45,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 13:07:45,000 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:45,000 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:45,000 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:45,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:45,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1171716302, now seen corresponding path program 14 times [2018-11-23 13:07:45,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:45,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:45,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:45,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:07:45,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:45,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:45,420 INFO L256 TraceCheckUtils]: 0: Hoare triple {4365#true} call ULTIMATE.init(); {4365#true} is VALID [2018-11-23 13:07:45,420 INFO L273 TraceCheckUtils]: 1: Hoare triple {4365#true} assume true; {4365#true} is VALID [2018-11-23 13:07:45,420 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4365#true} {4365#true} #37#return; {4365#true} is VALID [2018-11-23 13:07:45,420 INFO L256 TraceCheckUtils]: 3: Hoare triple {4365#true} call #t~ret2 := main(); {4365#true} is VALID [2018-11-23 13:07:45,421 INFO L273 TraceCheckUtils]: 4: Hoare triple {4365#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {4367#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:45,421 INFO L273 TraceCheckUtils]: 5: Hoare triple {4367#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4367#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:45,422 INFO L273 TraceCheckUtils]: 6: Hoare triple {4367#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4368#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:45,423 INFO L273 TraceCheckUtils]: 7: Hoare triple {4368#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {4368#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:45,424 INFO L273 TraceCheckUtils]: 8: Hoare triple {4368#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4369#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:45,425 INFO L273 TraceCheckUtils]: 9: Hoare triple {4369#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {4369#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:45,426 INFO L273 TraceCheckUtils]: 10: Hoare triple {4369#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4370#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:45,427 INFO L273 TraceCheckUtils]: 11: Hoare triple {4370#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4370#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:45,428 INFO L273 TraceCheckUtils]: 12: Hoare triple {4370#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4371#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:45,429 INFO L273 TraceCheckUtils]: 13: Hoare triple {4371#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {4371#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:45,430 INFO L273 TraceCheckUtils]: 14: Hoare triple {4371#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4372#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:45,431 INFO L273 TraceCheckUtils]: 15: Hoare triple {4372#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4372#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:45,432 INFO L273 TraceCheckUtils]: 16: Hoare triple {4372#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4373#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:45,432 INFO L273 TraceCheckUtils]: 17: Hoare triple {4373#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4373#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:45,433 INFO L273 TraceCheckUtils]: 18: Hoare triple {4373#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4374#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:45,434 INFO L273 TraceCheckUtils]: 19: Hoare triple {4374#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4374#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:45,435 INFO L273 TraceCheckUtils]: 20: Hoare triple {4374#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4375#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:45,436 INFO L273 TraceCheckUtils]: 21: Hoare triple {4375#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4375#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:45,437 INFO L273 TraceCheckUtils]: 22: Hoare triple {4375#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4376#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:45,438 INFO L273 TraceCheckUtils]: 23: Hoare triple {4376#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4376#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:45,439 INFO L273 TraceCheckUtils]: 24: Hoare triple {4376#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4377#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:45,440 INFO L273 TraceCheckUtils]: 25: Hoare triple {4377#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {4377#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:45,441 INFO L273 TraceCheckUtils]: 26: Hoare triple {4377#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4378#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:07:45,442 INFO L273 TraceCheckUtils]: 27: Hoare triple {4378#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4378#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:07:45,443 INFO L273 TraceCheckUtils]: 28: Hoare triple {4378#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4379#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:07:45,443 INFO L273 TraceCheckUtils]: 29: Hoare triple {4379#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4379#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:07:45,444 INFO L273 TraceCheckUtils]: 30: Hoare triple {4379#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4380#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:07:45,445 INFO L273 TraceCheckUtils]: 31: Hoare triple {4380#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4380#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:07:45,446 INFO L273 TraceCheckUtils]: 32: Hoare triple {4380#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4381#(and (<= main_~x~0 28) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:07:45,447 INFO L273 TraceCheckUtils]: 33: Hoare triple {4381#(and (<= main_~x~0 28) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {4366#false} is VALID [2018-11-23 13:07:45,448 INFO L256 TraceCheckUtils]: 34: Hoare triple {4366#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4366#false} is VALID [2018-11-23 13:07:45,448 INFO L273 TraceCheckUtils]: 35: Hoare triple {4366#false} ~cond := #in~cond; {4366#false} is VALID [2018-11-23 13:07:45,448 INFO L273 TraceCheckUtils]: 36: Hoare triple {4366#false} assume 0 == ~cond; {4366#false} is VALID [2018-11-23 13:07:45,448 INFO L273 TraceCheckUtils]: 37: Hoare triple {4366#false} assume !false; {4366#false} is VALID [2018-11-23 13:07:45,452 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:45,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:45,452 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:07:45,461 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:07:45,476 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:07:45,476 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:07:45,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:45,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:45,612 INFO L256 TraceCheckUtils]: 0: Hoare triple {4365#true} call ULTIMATE.init(); {4365#true} is VALID [2018-11-23 13:07:45,612 INFO L273 TraceCheckUtils]: 1: Hoare triple {4365#true} assume true; {4365#true} is VALID [2018-11-23 13:07:45,613 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4365#true} {4365#true} #37#return; {4365#true} is VALID [2018-11-23 13:07:45,613 INFO L256 TraceCheckUtils]: 3: Hoare triple {4365#true} call #t~ret2 := main(); {4365#true} is VALID [2018-11-23 13:07:45,613 INFO L273 TraceCheckUtils]: 4: Hoare triple {4365#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {4367#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:45,614 INFO L273 TraceCheckUtils]: 5: Hoare triple {4367#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4367#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:45,614 INFO L273 TraceCheckUtils]: 6: Hoare triple {4367#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4368#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:45,615 INFO L273 TraceCheckUtils]: 7: Hoare triple {4368#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {4368#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:45,615 INFO L273 TraceCheckUtils]: 8: Hoare triple {4368#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4369#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:45,616 INFO L273 TraceCheckUtils]: 9: Hoare triple {4369#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {4369#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:45,617 INFO L273 TraceCheckUtils]: 10: Hoare triple {4369#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4370#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:45,618 INFO L273 TraceCheckUtils]: 11: Hoare triple {4370#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4370#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:45,619 INFO L273 TraceCheckUtils]: 12: Hoare triple {4370#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4371#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:45,619 INFO L273 TraceCheckUtils]: 13: Hoare triple {4371#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {4371#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:45,621 INFO L273 TraceCheckUtils]: 14: Hoare triple {4371#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4372#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:45,621 INFO L273 TraceCheckUtils]: 15: Hoare triple {4372#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4372#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:45,622 INFO L273 TraceCheckUtils]: 16: Hoare triple {4372#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4373#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:45,623 INFO L273 TraceCheckUtils]: 17: Hoare triple {4373#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4373#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:45,624 INFO L273 TraceCheckUtils]: 18: Hoare triple {4373#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4374#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:45,625 INFO L273 TraceCheckUtils]: 19: Hoare triple {4374#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4374#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:45,626 INFO L273 TraceCheckUtils]: 20: Hoare triple {4374#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4375#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:45,627 INFO L273 TraceCheckUtils]: 21: Hoare triple {4375#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4375#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:45,628 INFO L273 TraceCheckUtils]: 22: Hoare triple {4375#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4376#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:45,629 INFO L273 TraceCheckUtils]: 23: Hoare triple {4376#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4376#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:45,630 INFO L273 TraceCheckUtils]: 24: Hoare triple {4376#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4377#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:45,630 INFO L273 TraceCheckUtils]: 25: Hoare triple {4377#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {4377#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:45,632 INFO L273 TraceCheckUtils]: 26: Hoare triple {4377#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4378#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:07:45,632 INFO L273 TraceCheckUtils]: 27: Hoare triple {4378#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4378#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:07:45,633 INFO L273 TraceCheckUtils]: 28: Hoare triple {4378#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4379#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:07:45,634 INFO L273 TraceCheckUtils]: 29: Hoare triple {4379#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4379#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:07:45,635 INFO L273 TraceCheckUtils]: 30: Hoare triple {4379#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4380#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:07:45,636 INFO L273 TraceCheckUtils]: 31: Hoare triple {4380#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4380#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:07:45,637 INFO L273 TraceCheckUtils]: 32: Hoare triple {4380#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4481#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:07:45,638 INFO L273 TraceCheckUtils]: 33: Hoare triple {4481#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {4366#false} is VALID [2018-11-23 13:07:45,638 INFO L256 TraceCheckUtils]: 34: Hoare triple {4366#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4366#false} is VALID [2018-11-23 13:07:45,638 INFO L273 TraceCheckUtils]: 35: Hoare triple {4366#false} ~cond := #in~cond; {4366#false} is VALID [2018-11-23 13:07:45,639 INFO L273 TraceCheckUtils]: 36: Hoare triple {4366#false} assume 0 == ~cond; {4366#false} is VALID [2018-11-23 13:07:45,639 INFO L273 TraceCheckUtils]: 37: Hoare triple {4366#false} assume !false; {4366#false} is VALID [2018-11-23 13:07:45,642 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:45,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:45,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 13:07:45,662 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2018-11-23 13:07:45,662 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:45,662 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 13:07:45,708 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:45,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 13:07:45,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 13:07:45,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-11-23 13:07:45,710 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 18 states. [2018-11-23 13:07:47,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:47,607 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-11-23 13:07:47,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 13:07:47,607 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2018-11-23 13:07:47,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:47,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 13:07:47,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 47 transitions. [2018-11-23 13:07:47,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 13:07:47,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 47 transitions. [2018-11-23 13:07:47,610 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 47 transitions. [2018-11-23 13:07:47,711 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:47,712 INFO L225 Difference]: With dead ends: 47 [2018-11-23 13:07:47,712 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 13:07:47,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-11-23 13:07:47,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 13:07:47,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-11-23 13:07:47,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:47,865 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 41 states. [2018-11-23 13:07:47,865 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 41 states. [2018-11-23 13:07:47,865 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 41 states. [2018-11-23 13:07:47,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:47,866 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-11-23 13:07:47,866 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-23 13:07:47,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:47,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:47,867 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 42 states. [2018-11-23 13:07:47,867 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 42 states. [2018-11-23 13:07:47,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:47,868 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-11-23 13:07:47,868 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-23 13:07:47,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:47,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:47,869 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:47,869 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:47,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 13:07:47,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-11-23 13:07:47,870 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2018-11-23 13:07:47,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:47,870 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-11-23 13:07:47,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 13:07:47,870 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-11-23 13:07:47,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 13:07:47,871 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:47,871 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:47,871 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:47,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:47,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1813266699, now seen corresponding path program 15 times [2018-11-23 13:07:47,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:47,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:47,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:47,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:07:47,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:47,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:48,633 INFO L256 TraceCheckUtils]: 0: Hoare triple {4714#true} call ULTIMATE.init(); {4714#true} is VALID [2018-11-23 13:07:48,634 INFO L273 TraceCheckUtils]: 1: Hoare triple {4714#true} assume true; {4714#true} is VALID [2018-11-23 13:07:48,634 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4714#true} {4714#true} #37#return; {4714#true} is VALID [2018-11-23 13:07:48,634 INFO L256 TraceCheckUtils]: 3: Hoare triple {4714#true} call #t~ret2 := main(); {4714#true} is VALID [2018-11-23 13:07:48,635 INFO L273 TraceCheckUtils]: 4: Hoare triple {4714#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {4716#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:48,636 INFO L273 TraceCheckUtils]: 5: Hoare triple {4716#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4716#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:48,637 INFO L273 TraceCheckUtils]: 6: Hoare triple {4716#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4717#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:48,637 INFO L273 TraceCheckUtils]: 7: Hoare triple {4717#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {4717#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:48,639 INFO L273 TraceCheckUtils]: 8: Hoare triple {4717#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4718#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:48,639 INFO L273 TraceCheckUtils]: 9: Hoare triple {4718#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {4718#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:48,640 INFO L273 TraceCheckUtils]: 10: Hoare triple {4718#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4719#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:48,641 INFO L273 TraceCheckUtils]: 11: Hoare triple {4719#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4719#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:48,642 INFO L273 TraceCheckUtils]: 12: Hoare triple {4719#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4720#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:48,643 INFO L273 TraceCheckUtils]: 13: Hoare triple {4720#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {4720#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:48,644 INFO L273 TraceCheckUtils]: 14: Hoare triple {4720#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4721#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:48,645 INFO L273 TraceCheckUtils]: 15: Hoare triple {4721#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4721#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:48,646 INFO L273 TraceCheckUtils]: 16: Hoare triple {4721#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4722#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:48,647 INFO L273 TraceCheckUtils]: 17: Hoare triple {4722#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4722#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:48,648 INFO L273 TraceCheckUtils]: 18: Hoare triple {4722#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4723#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:48,649 INFO L273 TraceCheckUtils]: 19: Hoare triple {4723#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4723#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:48,650 INFO L273 TraceCheckUtils]: 20: Hoare triple {4723#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4724#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:48,650 INFO L273 TraceCheckUtils]: 21: Hoare triple {4724#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4724#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:48,652 INFO L273 TraceCheckUtils]: 22: Hoare triple {4724#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4725#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:48,653 INFO L273 TraceCheckUtils]: 23: Hoare triple {4725#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4725#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:48,654 INFO L273 TraceCheckUtils]: 24: Hoare triple {4725#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4726#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:48,655 INFO L273 TraceCheckUtils]: 25: Hoare triple {4726#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {4726#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:48,655 INFO L273 TraceCheckUtils]: 26: Hoare triple {4726#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4727#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:07:48,656 INFO L273 TraceCheckUtils]: 27: Hoare triple {4727#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4727#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:07:48,657 INFO L273 TraceCheckUtils]: 28: Hoare triple {4727#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4728#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:07:48,657 INFO L273 TraceCheckUtils]: 29: Hoare triple {4728#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4728#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:07:48,658 INFO L273 TraceCheckUtils]: 30: Hoare triple {4728#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4729#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:07:48,659 INFO L273 TraceCheckUtils]: 31: Hoare triple {4729#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4729#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:07:48,660 INFO L273 TraceCheckUtils]: 32: Hoare triple {4729#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4730#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:07:48,661 INFO L273 TraceCheckUtils]: 33: Hoare triple {4730#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4730#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:07:48,662 INFO L273 TraceCheckUtils]: 34: Hoare triple {4730#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4731#(and (<= main_~x~0 30) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:07:48,663 INFO L273 TraceCheckUtils]: 35: Hoare triple {4731#(and (<= main_~x~0 30) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {4715#false} is VALID [2018-11-23 13:07:48,664 INFO L256 TraceCheckUtils]: 36: Hoare triple {4715#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4715#false} is VALID [2018-11-23 13:07:48,664 INFO L273 TraceCheckUtils]: 37: Hoare triple {4715#false} ~cond := #in~cond; {4715#false} is VALID [2018-11-23 13:07:48,664 INFO L273 TraceCheckUtils]: 38: Hoare triple {4715#false} assume 0 == ~cond; {4715#false} is VALID [2018-11-23 13:07:48,664 INFO L273 TraceCheckUtils]: 39: Hoare triple {4715#false} assume !false; {4715#false} is VALID [2018-11-23 13:07:48,668 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:48,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:48,668 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:07:48,678 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:07:55,532 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-11-23 13:07:55,532 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:07:55,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:55,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:55,791 INFO L256 TraceCheckUtils]: 0: Hoare triple {4714#true} call ULTIMATE.init(); {4714#true} is VALID [2018-11-23 13:07:55,791 INFO L273 TraceCheckUtils]: 1: Hoare triple {4714#true} assume true; {4714#true} is VALID [2018-11-23 13:07:55,791 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4714#true} {4714#true} #37#return; {4714#true} is VALID [2018-11-23 13:07:55,791 INFO L256 TraceCheckUtils]: 3: Hoare triple {4714#true} call #t~ret2 := main(); {4714#true} is VALID [2018-11-23 13:07:55,792 INFO L273 TraceCheckUtils]: 4: Hoare triple {4714#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {4716#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:55,792 INFO L273 TraceCheckUtils]: 5: Hoare triple {4716#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4716#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:55,793 INFO L273 TraceCheckUtils]: 6: Hoare triple {4716#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4717#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:55,794 INFO L273 TraceCheckUtils]: 7: Hoare triple {4717#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {4717#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:55,795 INFO L273 TraceCheckUtils]: 8: Hoare triple {4717#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4718#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:55,796 INFO L273 TraceCheckUtils]: 9: Hoare triple {4718#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {4718#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:55,797 INFO L273 TraceCheckUtils]: 10: Hoare triple {4718#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4719#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:55,798 INFO L273 TraceCheckUtils]: 11: Hoare triple {4719#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4719#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:55,799 INFO L273 TraceCheckUtils]: 12: Hoare triple {4719#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4720#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:55,800 INFO L273 TraceCheckUtils]: 13: Hoare triple {4720#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {4720#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:55,801 INFO L273 TraceCheckUtils]: 14: Hoare triple {4720#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4721#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:55,802 INFO L273 TraceCheckUtils]: 15: Hoare triple {4721#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4721#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:55,803 INFO L273 TraceCheckUtils]: 16: Hoare triple {4721#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4722#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:55,803 INFO L273 TraceCheckUtils]: 17: Hoare triple {4722#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4722#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:55,805 INFO L273 TraceCheckUtils]: 18: Hoare triple {4722#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4723#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:55,805 INFO L273 TraceCheckUtils]: 19: Hoare triple {4723#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4723#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:55,806 INFO L273 TraceCheckUtils]: 20: Hoare triple {4723#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4724#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:55,807 INFO L273 TraceCheckUtils]: 21: Hoare triple {4724#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4724#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:55,808 INFO L273 TraceCheckUtils]: 22: Hoare triple {4724#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4725#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:55,809 INFO L273 TraceCheckUtils]: 23: Hoare triple {4725#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4725#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:55,810 INFO L273 TraceCheckUtils]: 24: Hoare triple {4725#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4726#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:55,811 INFO L273 TraceCheckUtils]: 25: Hoare triple {4726#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {4726#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:55,812 INFO L273 TraceCheckUtils]: 26: Hoare triple {4726#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4727#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:07:55,813 INFO L273 TraceCheckUtils]: 27: Hoare triple {4727#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4727#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:07:55,814 INFO L273 TraceCheckUtils]: 28: Hoare triple {4727#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4728#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:07:55,815 INFO L273 TraceCheckUtils]: 29: Hoare triple {4728#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4728#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:07:55,816 INFO L273 TraceCheckUtils]: 30: Hoare triple {4728#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4729#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:07:55,816 INFO L273 TraceCheckUtils]: 31: Hoare triple {4729#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4729#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:07:55,818 INFO L273 TraceCheckUtils]: 32: Hoare triple {4729#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4730#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:07:55,818 INFO L273 TraceCheckUtils]: 33: Hoare triple {4730#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4730#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:07:55,819 INFO L273 TraceCheckUtils]: 34: Hoare triple {4730#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {4837#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:07:55,820 INFO L273 TraceCheckUtils]: 35: Hoare triple {4837#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !(~x~0 % 4294967296 < 99); {4715#false} is VALID [2018-11-23 13:07:55,821 INFO L256 TraceCheckUtils]: 36: Hoare triple {4715#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4715#false} is VALID [2018-11-23 13:07:55,821 INFO L273 TraceCheckUtils]: 37: Hoare triple {4715#false} ~cond := #in~cond; {4715#false} is VALID [2018-11-23 13:07:55,821 INFO L273 TraceCheckUtils]: 38: Hoare triple {4715#false} assume 0 == ~cond; {4715#false} is VALID [2018-11-23 13:07:55,821 INFO L273 TraceCheckUtils]: 39: Hoare triple {4715#false} assume !false; {4715#false} is VALID [2018-11-23 13:07:55,824 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:55,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:55,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-23 13:07:55,845 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 40 [2018-11-23 13:07:55,845 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:55,845 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 13:07:55,897 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:55,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 13:07:55,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 13:07:55,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-11-23 13:07:55,898 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 19 states. [2018-11-23 13:07:57,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:57,923 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-11-23 13:07:57,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 13:07:57,923 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 40 [2018-11-23 13:07:57,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:57,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 13:07:57,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 49 transitions. [2018-11-23 13:07:57,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 13:07:57,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 49 transitions. [2018-11-23 13:07:57,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 49 transitions. [2018-11-23 13:07:58,478 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:58,479 INFO L225 Difference]: With dead ends: 49 [2018-11-23 13:07:58,479 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 13:07:58,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-11-23 13:07:58,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 13:07:58,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2018-11-23 13:07:58,518 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:58,518 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 43 states. [2018-11-23 13:07:58,518 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 43 states. [2018-11-23 13:07:58,518 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 43 states. [2018-11-23 13:07:58,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:58,520 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-11-23 13:07:58,520 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-11-23 13:07:58,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:58,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:58,521 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 44 states. [2018-11-23 13:07:58,521 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 44 states. [2018-11-23 13:07:58,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:58,522 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-11-23 13:07:58,522 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-11-23 13:07:58,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:58,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:58,523 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:58,523 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:58,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 13:07:58,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-11-23 13:07:58,524 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2018-11-23 13:07:58,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:58,524 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-11-23 13:07:58,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 13:07:58,525 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-11-23 13:07:58,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 13:07:58,525 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:58,525 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:58,525 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:58,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:58,526 INFO L82 PathProgramCache]: Analyzing trace with hash -132092408, now seen corresponding path program 16 times [2018-11-23 13:07:58,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:58,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:58,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:58,527 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:07:58,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:58,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:59,558 INFO L256 TraceCheckUtils]: 0: Hoare triple {5080#true} call ULTIMATE.init(); {5080#true} is VALID [2018-11-23 13:07:59,559 INFO L273 TraceCheckUtils]: 1: Hoare triple {5080#true} assume true; {5080#true} is VALID [2018-11-23 13:07:59,559 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5080#true} {5080#true} #37#return; {5080#true} is VALID [2018-11-23 13:07:59,559 INFO L256 TraceCheckUtils]: 3: Hoare triple {5080#true} call #t~ret2 := main(); {5080#true} is VALID [2018-11-23 13:07:59,560 INFO L273 TraceCheckUtils]: 4: Hoare triple {5080#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {5082#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:59,560 INFO L273 TraceCheckUtils]: 5: Hoare triple {5082#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5082#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:59,561 INFO L273 TraceCheckUtils]: 6: Hoare triple {5082#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5083#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:59,562 INFO L273 TraceCheckUtils]: 7: Hoare triple {5083#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {5083#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:59,562 INFO L273 TraceCheckUtils]: 8: Hoare triple {5083#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5084#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:59,563 INFO L273 TraceCheckUtils]: 9: Hoare triple {5084#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {5084#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:59,564 INFO L273 TraceCheckUtils]: 10: Hoare triple {5084#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5085#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:59,565 INFO L273 TraceCheckUtils]: 11: Hoare triple {5085#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5085#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:59,566 INFO L273 TraceCheckUtils]: 12: Hoare triple {5085#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5086#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:59,567 INFO L273 TraceCheckUtils]: 13: Hoare triple {5086#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {5086#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:59,568 INFO L273 TraceCheckUtils]: 14: Hoare triple {5086#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5087#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:59,569 INFO L273 TraceCheckUtils]: 15: Hoare triple {5087#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5087#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:59,570 INFO L273 TraceCheckUtils]: 16: Hoare triple {5087#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5088#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:59,571 INFO L273 TraceCheckUtils]: 17: Hoare triple {5088#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5088#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:59,572 INFO L273 TraceCheckUtils]: 18: Hoare triple {5088#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5089#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:59,572 INFO L273 TraceCheckUtils]: 19: Hoare triple {5089#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5089#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:59,574 INFO L273 TraceCheckUtils]: 20: Hoare triple {5089#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5090#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:59,574 INFO L273 TraceCheckUtils]: 21: Hoare triple {5090#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5090#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:59,575 INFO L273 TraceCheckUtils]: 22: Hoare triple {5090#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5091#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:59,576 INFO L273 TraceCheckUtils]: 23: Hoare triple {5091#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5091#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:59,577 INFO L273 TraceCheckUtils]: 24: Hoare triple {5091#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5092#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:59,578 INFO L273 TraceCheckUtils]: 25: Hoare triple {5092#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {5092#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:59,600 INFO L273 TraceCheckUtils]: 26: Hoare triple {5092#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5093#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:07:59,601 INFO L273 TraceCheckUtils]: 27: Hoare triple {5093#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5093#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:07:59,602 INFO L273 TraceCheckUtils]: 28: Hoare triple {5093#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5094#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:07:59,607 INFO L273 TraceCheckUtils]: 29: Hoare triple {5094#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5094#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:07:59,608 INFO L273 TraceCheckUtils]: 30: Hoare triple {5094#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5095#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:07:59,609 INFO L273 TraceCheckUtils]: 31: Hoare triple {5095#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5095#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:07:59,609 INFO L273 TraceCheckUtils]: 32: Hoare triple {5095#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5096#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:07:59,610 INFO L273 TraceCheckUtils]: 33: Hoare triple {5096#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5096#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:07:59,610 INFO L273 TraceCheckUtils]: 34: Hoare triple {5096#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5097#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:07:59,611 INFO L273 TraceCheckUtils]: 35: Hoare triple {5097#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {5097#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:07:59,612 INFO L273 TraceCheckUtils]: 36: Hoare triple {5097#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5098#(and (<= main_~x~0 32) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:07:59,612 INFO L273 TraceCheckUtils]: 37: Hoare triple {5098#(and (<= main_~x~0 32) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {5081#false} is VALID [2018-11-23 13:07:59,613 INFO L256 TraceCheckUtils]: 38: Hoare triple {5081#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {5081#false} is VALID [2018-11-23 13:07:59,613 INFO L273 TraceCheckUtils]: 39: Hoare triple {5081#false} ~cond := #in~cond; {5081#false} is VALID [2018-11-23 13:07:59,613 INFO L273 TraceCheckUtils]: 40: Hoare triple {5081#false} assume 0 == ~cond; {5081#false} is VALID [2018-11-23 13:07:59,613 INFO L273 TraceCheckUtils]: 41: Hoare triple {5081#false} assume !false; {5081#false} is VALID [2018-11-23 13:07:59,616 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:59,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:59,616 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:07:59,625 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:07:59,645 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:07:59,645 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:07:59,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:59,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:59,896 INFO L256 TraceCheckUtils]: 0: Hoare triple {5080#true} call ULTIMATE.init(); {5080#true} is VALID [2018-11-23 13:07:59,896 INFO L273 TraceCheckUtils]: 1: Hoare triple {5080#true} assume true; {5080#true} is VALID [2018-11-23 13:07:59,896 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5080#true} {5080#true} #37#return; {5080#true} is VALID [2018-11-23 13:07:59,896 INFO L256 TraceCheckUtils]: 3: Hoare triple {5080#true} call #t~ret2 := main(); {5080#true} is VALID [2018-11-23 13:07:59,897 INFO L273 TraceCheckUtils]: 4: Hoare triple {5080#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {5082#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:59,898 INFO L273 TraceCheckUtils]: 5: Hoare triple {5082#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5082#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:59,903 INFO L273 TraceCheckUtils]: 6: Hoare triple {5082#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5083#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:59,903 INFO L273 TraceCheckUtils]: 7: Hoare triple {5083#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {5083#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:59,904 INFO L273 TraceCheckUtils]: 8: Hoare triple {5083#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5084#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:59,904 INFO L273 TraceCheckUtils]: 9: Hoare triple {5084#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {5084#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:59,905 INFO L273 TraceCheckUtils]: 10: Hoare triple {5084#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5085#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:59,906 INFO L273 TraceCheckUtils]: 11: Hoare triple {5085#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5085#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:59,906 INFO L273 TraceCheckUtils]: 12: Hoare triple {5085#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5086#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:59,909 INFO L273 TraceCheckUtils]: 13: Hoare triple {5086#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {5086#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:59,910 INFO L273 TraceCheckUtils]: 14: Hoare triple {5086#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5087#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:59,911 INFO L273 TraceCheckUtils]: 15: Hoare triple {5087#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5087#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:59,912 INFO L273 TraceCheckUtils]: 16: Hoare triple {5087#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5088#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:59,913 INFO L273 TraceCheckUtils]: 17: Hoare triple {5088#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5088#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:59,914 INFO L273 TraceCheckUtils]: 18: Hoare triple {5088#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5089#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:59,915 INFO L273 TraceCheckUtils]: 19: Hoare triple {5089#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5089#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:59,916 INFO L273 TraceCheckUtils]: 20: Hoare triple {5089#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5090#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:59,916 INFO L273 TraceCheckUtils]: 21: Hoare triple {5090#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5090#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:59,918 INFO L273 TraceCheckUtils]: 22: Hoare triple {5090#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5091#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:59,918 INFO L273 TraceCheckUtils]: 23: Hoare triple {5091#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5091#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:59,920 INFO L273 TraceCheckUtils]: 24: Hoare triple {5091#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5092#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:59,921 INFO L273 TraceCheckUtils]: 25: Hoare triple {5092#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {5092#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:59,922 INFO L273 TraceCheckUtils]: 26: Hoare triple {5092#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5093#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:07:59,922 INFO L273 TraceCheckUtils]: 27: Hoare triple {5093#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5093#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:07:59,924 INFO L273 TraceCheckUtils]: 28: Hoare triple {5093#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5094#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:07:59,924 INFO L273 TraceCheckUtils]: 29: Hoare triple {5094#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5094#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:07:59,925 INFO L273 TraceCheckUtils]: 30: Hoare triple {5094#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5095#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:07:59,926 INFO L273 TraceCheckUtils]: 31: Hoare triple {5095#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5095#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:07:59,927 INFO L273 TraceCheckUtils]: 32: Hoare triple {5095#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5096#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:07:59,928 INFO L273 TraceCheckUtils]: 33: Hoare triple {5096#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5096#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:07:59,929 INFO L273 TraceCheckUtils]: 34: Hoare triple {5096#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5097#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:07:59,930 INFO L273 TraceCheckUtils]: 35: Hoare triple {5097#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {5097#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:07:59,931 INFO L273 TraceCheckUtils]: 36: Hoare triple {5097#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5210#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:07:59,932 INFO L273 TraceCheckUtils]: 37: Hoare triple {5210#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {5081#false} is VALID [2018-11-23 13:07:59,932 INFO L256 TraceCheckUtils]: 38: Hoare triple {5081#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {5081#false} is VALID [2018-11-23 13:07:59,932 INFO L273 TraceCheckUtils]: 39: Hoare triple {5081#false} ~cond := #in~cond; {5081#false} is VALID [2018-11-23 13:07:59,933 INFO L273 TraceCheckUtils]: 40: Hoare triple {5081#false} assume 0 == ~cond; {5081#false} is VALID [2018-11-23 13:07:59,933 INFO L273 TraceCheckUtils]: 41: Hoare triple {5081#false} assume !false; {5081#false} is VALID [2018-11-23 13:07:59,937 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:59,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:59,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-23 13:07:59,957 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 42 [2018-11-23 13:07:59,957 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:59,957 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 13:08:00,024 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:00,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 13:08:00,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 13:08:00,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-11-23 13:08:00,025 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 20 states. [2018-11-23 13:08:01,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:01,772 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-11-23 13:08:01,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 13:08:01,772 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 42 [2018-11-23 13:08:01,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:01,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:08:01,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 51 transitions. [2018-11-23 13:08:01,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:08:01,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 51 transitions. [2018-11-23 13:08:01,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 51 transitions. [2018-11-23 13:08:01,851 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:01,853 INFO L225 Difference]: With dead ends: 51 [2018-11-23 13:08:01,853 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 13:08:01,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-11-23 13:08:01,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 13:08:01,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-11-23 13:08:01,900 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:01,900 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 45 states. [2018-11-23 13:08:01,900 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 45 states. [2018-11-23 13:08:01,901 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 45 states. [2018-11-23 13:08:01,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:01,902 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-11-23 13:08:01,902 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-11-23 13:08:01,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:01,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:01,903 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 46 states. [2018-11-23 13:08:01,903 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 46 states. [2018-11-23 13:08:01,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:01,904 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-11-23 13:08:01,904 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-11-23 13:08:01,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:01,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:01,904 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:01,904 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:01,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 13:08:01,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-11-23 13:08:01,905 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2018-11-23 13:08:01,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:01,905 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-11-23 13:08:01,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 13:08:01,906 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-11-23 13:08:01,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 13:08:01,906 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:01,906 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:01,906 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:01,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:01,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1311420475, now seen corresponding path program 17 times [2018-11-23 13:08:01,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:01,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:01,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:01,907 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:08:01,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:01,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:02,382 INFO L256 TraceCheckUtils]: 0: Hoare triple {5463#true} call ULTIMATE.init(); {5463#true} is VALID [2018-11-23 13:08:02,383 INFO L273 TraceCheckUtils]: 1: Hoare triple {5463#true} assume true; {5463#true} is VALID [2018-11-23 13:08:02,383 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5463#true} {5463#true} #37#return; {5463#true} is VALID [2018-11-23 13:08:02,383 INFO L256 TraceCheckUtils]: 3: Hoare triple {5463#true} call #t~ret2 := main(); {5463#true} is VALID [2018-11-23 13:08:02,384 INFO L273 TraceCheckUtils]: 4: Hoare triple {5463#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {5465#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:02,384 INFO L273 TraceCheckUtils]: 5: Hoare triple {5465#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5465#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:02,385 INFO L273 TraceCheckUtils]: 6: Hoare triple {5465#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5466#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:08:02,386 INFO L273 TraceCheckUtils]: 7: Hoare triple {5466#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {5466#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:08:02,387 INFO L273 TraceCheckUtils]: 8: Hoare triple {5466#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5467#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:08:02,388 INFO L273 TraceCheckUtils]: 9: Hoare triple {5467#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {5467#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:08:02,389 INFO L273 TraceCheckUtils]: 10: Hoare triple {5467#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5468#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:08:02,390 INFO L273 TraceCheckUtils]: 11: Hoare triple {5468#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5468#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:08:02,391 INFO L273 TraceCheckUtils]: 12: Hoare triple {5468#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5469#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:08:02,392 INFO L273 TraceCheckUtils]: 13: Hoare triple {5469#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {5469#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:08:02,393 INFO L273 TraceCheckUtils]: 14: Hoare triple {5469#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5470#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:02,393 INFO L273 TraceCheckUtils]: 15: Hoare triple {5470#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5470#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:02,395 INFO L273 TraceCheckUtils]: 16: Hoare triple {5470#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5471#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:02,395 INFO L273 TraceCheckUtils]: 17: Hoare triple {5471#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5471#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:02,396 INFO L273 TraceCheckUtils]: 18: Hoare triple {5471#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5472#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:08:02,397 INFO L273 TraceCheckUtils]: 19: Hoare triple {5472#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5472#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:08:02,398 INFO L273 TraceCheckUtils]: 20: Hoare triple {5472#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5473#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:08:02,399 INFO L273 TraceCheckUtils]: 21: Hoare triple {5473#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5473#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:08:02,400 INFO L273 TraceCheckUtils]: 22: Hoare triple {5473#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5474#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:08:02,401 INFO L273 TraceCheckUtils]: 23: Hoare triple {5474#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5474#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:08:02,402 INFO L273 TraceCheckUtils]: 24: Hoare triple {5474#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5475#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:08:02,403 INFO L273 TraceCheckUtils]: 25: Hoare triple {5475#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {5475#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:08:02,404 INFO L273 TraceCheckUtils]: 26: Hoare triple {5475#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5476#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:08:02,404 INFO L273 TraceCheckUtils]: 27: Hoare triple {5476#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5476#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:08:02,405 INFO L273 TraceCheckUtils]: 28: Hoare triple {5476#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5477#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:08:02,406 INFO L273 TraceCheckUtils]: 29: Hoare triple {5477#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5477#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:08:02,407 INFO L273 TraceCheckUtils]: 30: Hoare triple {5477#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5478#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:08:02,408 INFO L273 TraceCheckUtils]: 31: Hoare triple {5478#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5478#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:08:02,409 INFO L273 TraceCheckUtils]: 32: Hoare triple {5478#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5479#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:08:02,409 INFO L273 TraceCheckUtils]: 33: Hoare triple {5479#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5479#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:08:02,410 INFO L273 TraceCheckUtils]: 34: Hoare triple {5479#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5480#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:08:02,411 INFO L273 TraceCheckUtils]: 35: Hoare triple {5480#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {5480#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:08:02,412 INFO L273 TraceCheckUtils]: 36: Hoare triple {5480#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5481#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:08:02,413 INFO L273 TraceCheckUtils]: 37: Hoare triple {5481#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5481#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:08:02,414 INFO L273 TraceCheckUtils]: 38: Hoare triple {5481#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5482#(and (<= main_~x~0 34) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:08:02,415 INFO L273 TraceCheckUtils]: 39: Hoare triple {5482#(and (<= main_~x~0 34) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {5464#false} is VALID [2018-11-23 13:08:02,415 INFO L256 TraceCheckUtils]: 40: Hoare triple {5464#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {5464#false} is VALID [2018-11-23 13:08:02,415 INFO L273 TraceCheckUtils]: 41: Hoare triple {5464#false} ~cond := #in~cond; {5464#false} is VALID [2018-11-23 13:08:02,415 INFO L273 TraceCheckUtils]: 42: Hoare triple {5464#false} assume 0 == ~cond; {5464#false} is VALID [2018-11-23 13:08:02,416 INFO L273 TraceCheckUtils]: 43: Hoare triple {5464#false} assume !false; {5464#false} is VALID [2018-11-23 13:08:02,419 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:02,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:08:02,419 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:08:02,427 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:08:35,253 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-11-23 13:08:35,253 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:08:35,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:35,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:08:35,455 INFO L256 TraceCheckUtils]: 0: Hoare triple {5463#true} call ULTIMATE.init(); {5463#true} is VALID [2018-11-23 13:08:35,455 INFO L273 TraceCheckUtils]: 1: Hoare triple {5463#true} assume true; {5463#true} is VALID [2018-11-23 13:08:35,455 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5463#true} {5463#true} #37#return; {5463#true} is VALID [2018-11-23 13:08:35,455 INFO L256 TraceCheckUtils]: 3: Hoare triple {5463#true} call #t~ret2 := main(); {5463#true} is VALID [2018-11-23 13:08:35,455 INFO L273 TraceCheckUtils]: 4: Hoare triple {5463#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {5465#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:35,456 INFO L273 TraceCheckUtils]: 5: Hoare triple {5465#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5465#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:35,457 INFO L273 TraceCheckUtils]: 6: Hoare triple {5465#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5466#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:08:35,457 INFO L273 TraceCheckUtils]: 7: Hoare triple {5466#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {5466#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:08:35,458 INFO L273 TraceCheckUtils]: 8: Hoare triple {5466#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5467#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:08:35,458 INFO L273 TraceCheckUtils]: 9: Hoare triple {5467#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {5467#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:08:35,459 INFO L273 TraceCheckUtils]: 10: Hoare triple {5467#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5468#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:08:35,460 INFO L273 TraceCheckUtils]: 11: Hoare triple {5468#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5468#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:08:35,461 INFO L273 TraceCheckUtils]: 12: Hoare triple {5468#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5469#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:08:35,462 INFO L273 TraceCheckUtils]: 13: Hoare triple {5469#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {5469#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:08:35,463 INFO L273 TraceCheckUtils]: 14: Hoare triple {5469#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5470#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:35,464 INFO L273 TraceCheckUtils]: 15: Hoare triple {5470#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5470#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:35,465 INFO L273 TraceCheckUtils]: 16: Hoare triple {5470#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5471#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:35,466 INFO L273 TraceCheckUtils]: 17: Hoare triple {5471#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5471#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:35,467 INFO L273 TraceCheckUtils]: 18: Hoare triple {5471#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5472#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:08:35,467 INFO L273 TraceCheckUtils]: 19: Hoare triple {5472#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5472#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:08:35,469 INFO L273 TraceCheckUtils]: 20: Hoare triple {5472#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5473#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:08:35,469 INFO L273 TraceCheckUtils]: 21: Hoare triple {5473#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5473#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:08:35,470 INFO L273 TraceCheckUtils]: 22: Hoare triple {5473#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5474#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:08:35,471 INFO L273 TraceCheckUtils]: 23: Hoare triple {5474#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5474#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:08:35,472 INFO L273 TraceCheckUtils]: 24: Hoare triple {5474#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5475#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:08:35,473 INFO L273 TraceCheckUtils]: 25: Hoare triple {5475#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {5475#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:08:35,474 INFO L273 TraceCheckUtils]: 26: Hoare triple {5475#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5476#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:08:35,475 INFO L273 TraceCheckUtils]: 27: Hoare triple {5476#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5476#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:08:35,476 INFO L273 TraceCheckUtils]: 28: Hoare triple {5476#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5477#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:08:35,477 INFO L273 TraceCheckUtils]: 29: Hoare triple {5477#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5477#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:08:35,478 INFO L273 TraceCheckUtils]: 30: Hoare triple {5477#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5478#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:08:35,478 INFO L273 TraceCheckUtils]: 31: Hoare triple {5478#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5478#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:08:35,480 INFO L273 TraceCheckUtils]: 32: Hoare triple {5478#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5479#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:08:35,480 INFO L273 TraceCheckUtils]: 33: Hoare triple {5479#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5479#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:08:35,481 INFO L273 TraceCheckUtils]: 34: Hoare triple {5479#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5480#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:08:35,482 INFO L273 TraceCheckUtils]: 35: Hoare triple {5480#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {5480#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:08:35,483 INFO L273 TraceCheckUtils]: 36: Hoare triple {5480#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5481#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:08:35,484 INFO L273 TraceCheckUtils]: 37: Hoare triple {5481#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5481#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:08:35,485 INFO L273 TraceCheckUtils]: 38: Hoare triple {5481#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5600#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:08:35,486 INFO L273 TraceCheckUtils]: 39: Hoare triple {5600#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !(~x~0 % 4294967296 < 99); {5464#false} is VALID [2018-11-23 13:08:35,486 INFO L256 TraceCheckUtils]: 40: Hoare triple {5464#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {5464#false} is VALID [2018-11-23 13:08:35,487 INFO L273 TraceCheckUtils]: 41: Hoare triple {5464#false} ~cond := #in~cond; {5464#false} is VALID [2018-11-23 13:08:35,487 INFO L273 TraceCheckUtils]: 42: Hoare triple {5464#false} assume 0 == ~cond; {5464#false} is VALID [2018-11-23 13:08:35,487 INFO L273 TraceCheckUtils]: 43: Hoare triple {5464#false} assume !false; {5464#false} is VALID [2018-11-23 13:08:35,490 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:35,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:08:35,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-23 13:08:35,511 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 44 [2018-11-23 13:08:35,511 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:35,512 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 13:08:35,577 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:35,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 13:08:35,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 13:08:35,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2018-11-23 13:08:35,578 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 21 states. [2018-11-23 13:08:37,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:37,644 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-11-23 13:08:37,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 13:08:37,645 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 44 [2018-11-23 13:08:37,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:37,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 13:08:37,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 53 transitions. [2018-11-23 13:08:37,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 13:08:37,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 53 transitions. [2018-11-23 13:08:37,647 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 53 transitions. [2018-11-23 13:08:37,716 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:37,717 INFO L225 Difference]: With dead ends: 53 [2018-11-23 13:08:37,717 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 13:08:37,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2018-11-23 13:08:37,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 13:08:37,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2018-11-23 13:08:37,784 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:37,784 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 47 states. [2018-11-23 13:08:37,784 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 47 states. [2018-11-23 13:08:37,785 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 47 states. [2018-11-23 13:08:37,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:37,786 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-11-23 13:08:37,786 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-11-23 13:08:37,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:37,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:37,787 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 48 states. [2018-11-23 13:08:37,787 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 48 states. [2018-11-23 13:08:37,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:37,789 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-11-23 13:08:37,789 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-11-23 13:08:37,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:37,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:37,790 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:37,790 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:37,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 13:08:37,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-11-23 13:08:37,791 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2018-11-23 13:08:37,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:37,791 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-11-23 13:08:37,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 13:08:37,792 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-11-23 13:08:37,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 13:08:37,792 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:37,793 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:37,793 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:37,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:37,793 INFO L82 PathProgramCache]: Analyzing trace with hash -774326718, now seen corresponding path program 18 times [2018-11-23 13:08:37,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:37,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:37,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:37,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:08:37,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:37,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:39,189 INFO L256 TraceCheckUtils]: 0: Hoare triple {5863#true} call ULTIMATE.init(); {5863#true} is VALID [2018-11-23 13:08:39,190 INFO L273 TraceCheckUtils]: 1: Hoare triple {5863#true} assume true; {5863#true} is VALID [2018-11-23 13:08:39,190 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5863#true} {5863#true} #37#return; {5863#true} is VALID [2018-11-23 13:08:39,190 INFO L256 TraceCheckUtils]: 3: Hoare triple {5863#true} call #t~ret2 := main(); {5863#true} is VALID [2018-11-23 13:08:39,191 INFO L273 TraceCheckUtils]: 4: Hoare triple {5863#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {5865#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:39,191 INFO L273 TraceCheckUtils]: 5: Hoare triple {5865#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5865#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:39,193 INFO L273 TraceCheckUtils]: 6: Hoare triple {5865#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5866#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:08:39,193 INFO L273 TraceCheckUtils]: 7: Hoare triple {5866#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {5866#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:08:39,194 INFO L273 TraceCheckUtils]: 8: Hoare triple {5866#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5867#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:08:39,195 INFO L273 TraceCheckUtils]: 9: Hoare triple {5867#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {5867#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:08:39,196 INFO L273 TraceCheckUtils]: 10: Hoare triple {5867#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5868#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:08:39,197 INFO L273 TraceCheckUtils]: 11: Hoare triple {5868#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5868#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:08:39,198 INFO L273 TraceCheckUtils]: 12: Hoare triple {5868#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5869#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:08:39,199 INFO L273 TraceCheckUtils]: 13: Hoare triple {5869#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {5869#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:08:39,200 INFO L273 TraceCheckUtils]: 14: Hoare triple {5869#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5870#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:39,201 INFO L273 TraceCheckUtils]: 15: Hoare triple {5870#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5870#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:39,202 INFO L273 TraceCheckUtils]: 16: Hoare triple {5870#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5871#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:39,203 INFO L273 TraceCheckUtils]: 17: Hoare triple {5871#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5871#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:39,204 INFO L273 TraceCheckUtils]: 18: Hoare triple {5871#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5872#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:08:39,204 INFO L273 TraceCheckUtils]: 19: Hoare triple {5872#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5872#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:08:39,206 INFO L273 TraceCheckUtils]: 20: Hoare triple {5872#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5873#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:08:39,206 INFO L273 TraceCheckUtils]: 21: Hoare triple {5873#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5873#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:08:39,207 INFO L273 TraceCheckUtils]: 22: Hoare triple {5873#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5874#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:08:39,208 INFO L273 TraceCheckUtils]: 23: Hoare triple {5874#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5874#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:08:39,209 INFO L273 TraceCheckUtils]: 24: Hoare triple {5874#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5875#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:08:39,210 INFO L273 TraceCheckUtils]: 25: Hoare triple {5875#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {5875#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:08:39,211 INFO L273 TraceCheckUtils]: 26: Hoare triple {5875#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5876#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:08:39,212 INFO L273 TraceCheckUtils]: 27: Hoare triple {5876#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5876#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:08:39,213 INFO L273 TraceCheckUtils]: 28: Hoare triple {5876#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5877#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:08:39,214 INFO L273 TraceCheckUtils]: 29: Hoare triple {5877#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5877#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:08:39,215 INFO L273 TraceCheckUtils]: 30: Hoare triple {5877#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5878#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:08:39,215 INFO L273 TraceCheckUtils]: 31: Hoare triple {5878#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5878#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:08:39,217 INFO L273 TraceCheckUtils]: 32: Hoare triple {5878#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5879#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:08:39,217 INFO L273 TraceCheckUtils]: 33: Hoare triple {5879#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5879#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:08:39,218 INFO L273 TraceCheckUtils]: 34: Hoare triple {5879#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5880#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:08:39,219 INFO L273 TraceCheckUtils]: 35: Hoare triple {5880#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {5880#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:08:39,220 INFO L273 TraceCheckUtils]: 36: Hoare triple {5880#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5881#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:08:39,221 INFO L273 TraceCheckUtils]: 37: Hoare triple {5881#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5881#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:08:39,222 INFO L273 TraceCheckUtils]: 38: Hoare triple {5881#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5882#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:08:39,223 INFO L273 TraceCheckUtils]: 39: Hoare triple {5882#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 < 99); {5882#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:08:39,224 INFO L273 TraceCheckUtils]: 40: Hoare triple {5882#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5883#(and (<= main_~x~0 36) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:08:39,225 INFO L273 TraceCheckUtils]: 41: Hoare triple {5883#(and (<= main_~x~0 36) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {5864#false} is VALID [2018-11-23 13:08:39,225 INFO L256 TraceCheckUtils]: 42: Hoare triple {5864#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {5864#false} is VALID [2018-11-23 13:08:39,225 INFO L273 TraceCheckUtils]: 43: Hoare triple {5864#false} ~cond := #in~cond; {5864#false} is VALID [2018-11-23 13:08:39,226 INFO L273 TraceCheckUtils]: 44: Hoare triple {5864#false} assume 0 == ~cond; {5864#false} is VALID [2018-11-23 13:08:39,226 INFO L273 TraceCheckUtils]: 45: Hoare triple {5864#false} assume !false; {5864#false} is VALID [2018-11-23 13:08:39,230 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:39,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:08:39,230 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:08:39,238 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:08:50,671 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-11-23 13:08:50,671 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:08:50,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:50,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:08:51,225 INFO L256 TraceCheckUtils]: 0: Hoare triple {5863#true} call ULTIMATE.init(); {5863#true} is VALID [2018-11-23 13:08:51,225 INFO L273 TraceCheckUtils]: 1: Hoare triple {5863#true} assume true; {5863#true} is VALID [2018-11-23 13:08:51,225 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5863#true} {5863#true} #37#return; {5863#true} is VALID [2018-11-23 13:08:51,225 INFO L256 TraceCheckUtils]: 3: Hoare triple {5863#true} call #t~ret2 := main(); {5863#true} is VALID [2018-11-23 13:08:51,226 INFO L273 TraceCheckUtils]: 4: Hoare triple {5863#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {5865#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:51,227 INFO L273 TraceCheckUtils]: 5: Hoare triple {5865#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5865#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:51,227 INFO L273 TraceCheckUtils]: 6: Hoare triple {5865#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5866#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:08:51,228 INFO L273 TraceCheckUtils]: 7: Hoare triple {5866#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {5866#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:08:51,228 INFO L273 TraceCheckUtils]: 8: Hoare triple {5866#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5867#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:08:51,229 INFO L273 TraceCheckUtils]: 9: Hoare triple {5867#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {5867#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:08:51,230 INFO L273 TraceCheckUtils]: 10: Hoare triple {5867#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5868#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:08:51,231 INFO L273 TraceCheckUtils]: 11: Hoare triple {5868#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5868#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:08:51,232 INFO L273 TraceCheckUtils]: 12: Hoare triple {5868#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5869#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:08:51,233 INFO L273 TraceCheckUtils]: 13: Hoare triple {5869#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {5869#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:08:51,234 INFO L273 TraceCheckUtils]: 14: Hoare triple {5869#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5870#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:51,235 INFO L273 TraceCheckUtils]: 15: Hoare triple {5870#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5870#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:51,236 INFO L273 TraceCheckUtils]: 16: Hoare triple {5870#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5871#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:51,237 INFO L273 TraceCheckUtils]: 17: Hoare triple {5871#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5871#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:51,238 INFO L273 TraceCheckUtils]: 18: Hoare triple {5871#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5872#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:08:51,238 INFO L273 TraceCheckUtils]: 19: Hoare triple {5872#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5872#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:08:51,240 INFO L273 TraceCheckUtils]: 20: Hoare triple {5872#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5873#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:08:51,240 INFO L273 TraceCheckUtils]: 21: Hoare triple {5873#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5873#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:08:51,241 INFO L273 TraceCheckUtils]: 22: Hoare triple {5873#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5874#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:08:51,242 INFO L273 TraceCheckUtils]: 23: Hoare triple {5874#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5874#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:08:51,243 INFO L273 TraceCheckUtils]: 24: Hoare triple {5874#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5875#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:08:51,244 INFO L273 TraceCheckUtils]: 25: Hoare triple {5875#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {5875#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:08:51,245 INFO L273 TraceCheckUtils]: 26: Hoare triple {5875#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5876#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:08:51,246 INFO L273 TraceCheckUtils]: 27: Hoare triple {5876#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5876#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:08:51,247 INFO L273 TraceCheckUtils]: 28: Hoare triple {5876#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5877#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:08:51,248 INFO L273 TraceCheckUtils]: 29: Hoare triple {5877#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5877#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:08:51,249 INFO L273 TraceCheckUtils]: 30: Hoare triple {5877#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5878#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:08:51,250 INFO L273 TraceCheckUtils]: 31: Hoare triple {5878#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5878#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:08:51,251 INFO L273 TraceCheckUtils]: 32: Hoare triple {5878#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5879#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:08:51,251 INFO L273 TraceCheckUtils]: 33: Hoare triple {5879#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5879#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:08:51,253 INFO L273 TraceCheckUtils]: 34: Hoare triple {5879#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5880#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:08:51,253 INFO L273 TraceCheckUtils]: 35: Hoare triple {5880#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {5880#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:08:51,254 INFO L273 TraceCheckUtils]: 36: Hoare triple {5880#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5881#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:08:51,255 INFO L273 TraceCheckUtils]: 37: Hoare triple {5881#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5881#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:08:51,256 INFO L273 TraceCheckUtils]: 38: Hoare triple {5881#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {5882#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:08:51,257 INFO L273 TraceCheckUtils]: 39: Hoare triple {5882#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 < 99); {5882#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:08:51,258 INFO L273 TraceCheckUtils]: 40: Hoare triple {5882#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6007#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-23 13:08:51,259 INFO L273 TraceCheckUtils]: 41: Hoare triple {6007#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {5864#false} is VALID [2018-11-23 13:08:51,259 INFO L256 TraceCheckUtils]: 42: Hoare triple {5864#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {5864#false} is VALID [2018-11-23 13:08:51,259 INFO L273 TraceCheckUtils]: 43: Hoare triple {5864#false} ~cond := #in~cond; {5864#false} is VALID [2018-11-23 13:08:51,260 INFO L273 TraceCheckUtils]: 44: Hoare triple {5864#false} assume 0 == ~cond; {5864#false} is VALID [2018-11-23 13:08:51,260 INFO L273 TraceCheckUtils]: 45: Hoare triple {5864#false} assume !false; {5864#false} is VALID [2018-11-23 13:08:51,264 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:51,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:08:51,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-11-23 13:08:51,285 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 46 [2018-11-23 13:08:51,286 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:51,286 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 13:08:51,351 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:51,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 13:08:51,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 13:08:51,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-11-23 13:08:51,352 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 22 states. [2018-11-23 13:08:53,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:53,443 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-11-23 13:08:53,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 13:08:53,444 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 46 [2018-11-23 13:08:53,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:53,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:08:53,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 55 transitions. [2018-11-23 13:08:53,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:08:53,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 55 transitions. [2018-11-23 13:08:53,446 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 55 transitions. [2018-11-23 13:08:53,564 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:53,565 INFO L225 Difference]: With dead ends: 55 [2018-11-23 13:08:53,566 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 13:08:53,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-11-23 13:08:53,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 13:08:53,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-11-23 13:08:53,608 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:53,608 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 49 states. [2018-11-23 13:08:53,608 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 49 states. [2018-11-23 13:08:53,608 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 49 states. [2018-11-23 13:08:53,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:53,609 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-11-23 13:08:53,610 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-11-23 13:08:53,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:53,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:53,610 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 50 states. [2018-11-23 13:08:53,610 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 50 states. [2018-11-23 13:08:53,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:53,611 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-11-23 13:08:53,611 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-11-23 13:08:53,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:53,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:53,612 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:53,612 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:53,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 13:08:53,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-11-23 13:08:53,613 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2018-11-23 13:08:53,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:53,613 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-11-23 13:08:53,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 13:08:53,613 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-11-23 13:08:53,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 13:08:53,614 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:53,614 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:53,614 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:53,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:53,615 INFO L82 PathProgramCache]: Analyzing trace with hash -23301761, now seen corresponding path program 19 times [2018-11-23 13:08:53,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:53,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:53,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:53,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:08:53,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:53,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:54,845 INFO L256 TraceCheckUtils]: 0: Hoare triple {6280#true} call ULTIMATE.init(); {6280#true} is VALID [2018-11-23 13:08:54,845 INFO L273 TraceCheckUtils]: 1: Hoare triple {6280#true} assume true; {6280#true} is VALID [2018-11-23 13:08:54,845 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6280#true} {6280#true} #37#return; {6280#true} is VALID [2018-11-23 13:08:54,845 INFO L256 TraceCheckUtils]: 3: Hoare triple {6280#true} call #t~ret2 := main(); {6280#true} is VALID [2018-11-23 13:08:54,846 INFO L273 TraceCheckUtils]: 4: Hoare triple {6280#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {6282#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:54,847 INFO L273 TraceCheckUtils]: 5: Hoare triple {6282#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6282#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:54,848 INFO L273 TraceCheckUtils]: 6: Hoare triple {6282#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6283#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:08:54,849 INFO L273 TraceCheckUtils]: 7: Hoare triple {6283#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {6283#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:08:54,850 INFO L273 TraceCheckUtils]: 8: Hoare triple {6283#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6284#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:08:54,850 INFO L273 TraceCheckUtils]: 9: Hoare triple {6284#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {6284#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:08:54,852 INFO L273 TraceCheckUtils]: 10: Hoare triple {6284#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6285#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:08:54,852 INFO L273 TraceCheckUtils]: 11: Hoare triple {6285#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6285#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:08:54,853 INFO L273 TraceCheckUtils]: 12: Hoare triple {6285#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6286#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:08:54,854 INFO L273 TraceCheckUtils]: 13: Hoare triple {6286#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {6286#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:08:54,855 INFO L273 TraceCheckUtils]: 14: Hoare triple {6286#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6287#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:54,856 INFO L273 TraceCheckUtils]: 15: Hoare triple {6287#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6287#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:54,857 INFO L273 TraceCheckUtils]: 16: Hoare triple {6287#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6288#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:54,858 INFO L273 TraceCheckUtils]: 17: Hoare triple {6288#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6288#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:54,859 INFO L273 TraceCheckUtils]: 18: Hoare triple {6288#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6289#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:08:54,860 INFO L273 TraceCheckUtils]: 19: Hoare triple {6289#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6289#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:08:54,861 INFO L273 TraceCheckUtils]: 20: Hoare triple {6289#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6290#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:08:54,862 INFO L273 TraceCheckUtils]: 21: Hoare triple {6290#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6290#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:08:54,863 INFO L273 TraceCheckUtils]: 22: Hoare triple {6290#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6291#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:08:54,863 INFO L273 TraceCheckUtils]: 23: Hoare triple {6291#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6291#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:08:54,865 INFO L273 TraceCheckUtils]: 24: Hoare triple {6291#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6292#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:08:54,865 INFO L273 TraceCheckUtils]: 25: Hoare triple {6292#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {6292#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:08:54,866 INFO L273 TraceCheckUtils]: 26: Hoare triple {6292#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6293#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:08:54,867 INFO L273 TraceCheckUtils]: 27: Hoare triple {6293#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6293#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:08:54,868 INFO L273 TraceCheckUtils]: 28: Hoare triple {6293#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6294#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:08:54,869 INFO L273 TraceCheckUtils]: 29: Hoare triple {6294#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6294#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:08:54,870 INFO L273 TraceCheckUtils]: 30: Hoare triple {6294#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6295#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:08:54,871 INFO L273 TraceCheckUtils]: 31: Hoare triple {6295#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6295#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:08:54,872 INFO L273 TraceCheckUtils]: 32: Hoare triple {6295#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6296#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:08:54,873 INFO L273 TraceCheckUtils]: 33: Hoare triple {6296#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6296#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:08:54,874 INFO L273 TraceCheckUtils]: 34: Hoare triple {6296#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6297#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:08:54,875 INFO L273 TraceCheckUtils]: 35: Hoare triple {6297#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {6297#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:08:54,876 INFO L273 TraceCheckUtils]: 36: Hoare triple {6297#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6298#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:08:54,876 INFO L273 TraceCheckUtils]: 37: Hoare triple {6298#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6298#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:08:54,878 INFO L273 TraceCheckUtils]: 38: Hoare triple {6298#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6299#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:08:54,878 INFO L273 TraceCheckUtils]: 39: Hoare triple {6299#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 < 99); {6299#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:08:54,879 INFO L273 TraceCheckUtils]: 40: Hoare triple {6299#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6300#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-23 13:08:54,880 INFO L273 TraceCheckUtils]: 41: Hoare triple {6300#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6300#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-23 13:08:54,881 INFO L273 TraceCheckUtils]: 42: Hoare triple {6300#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6301#(and (<= main_~x~0 38) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:08:54,882 INFO L273 TraceCheckUtils]: 43: Hoare triple {6301#(and (<= main_~x~0 38) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {6281#false} is VALID [2018-11-23 13:08:54,883 INFO L256 TraceCheckUtils]: 44: Hoare triple {6281#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {6281#false} is VALID [2018-11-23 13:08:54,883 INFO L273 TraceCheckUtils]: 45: Hoare triple {6281#false} ~cond := #in~cond; {6281#false} is VALID [2018-11-23 13:08:54,883 INFO L273 TraceCheckUtils]: 46: Hoare triple {6281#false} assume 0 == ~cond; {6281#false} is VALID [2018-11-23 13:08:54,883 INFO L273 TraceCheckUtils]: 47: Hoare triple {6281#false} assume !false; {6281#false} is VALID [2018-11-23 13:08:54,887 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:54,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:08:54,887 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:08:54,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:08:54,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:54,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:54,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:08:55,124 INFO L256 TraceCheckUtils]: 0: Hoare triple {6280#true} call ULTIMATE.init(); {6280#true} is VALID [2018-11-23 13:08:55,124 INFO L273 TraceCheckUtils]: 1: Hoare triple {6280#true} assume true; {6280#true} is VALID [2018-11-23 13:08:55,124 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6280#true} {6280#true} #37#return; {6280#true} is VALID [2018-11-23 13:08:55,124 INFO L256 TraceCheckUtils]: 3: Hoare triple {6280#true} call #t~ret2 := main(); {6280#true} is VALID [2018-11-23 13:08:55,125 INFO L273 TraceCheckUtils]: 4: Hoare triple {6280#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {6282#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:55,125 INFO L273 TraceCheckUtils]: 5: Hoare triple {6282#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6282#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:55,126 INFO L273 TraceCheckUtils]: 6: Hoare triple {6282#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6283#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:08:55,126 INFO L273 TraceCheckUtils]: 7: Hoare triple {6283#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {6283#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:08:55,127 INFO L273 TraceCheckUtils]: 8: Hoare triple {6283#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6284#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:08:55,127 INFO L273 TraceCheckUtils]: 9: Hoare triple {6284#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {6284#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:08:55,128 INFO L273 TraceCheckUtils]: 10: Hoare triple {6284#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6285#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:08:55,129 INFO L273 TraceCheckUtils]: 11: Hoare triple {6285#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6285#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:08:55,130 INFO L273 TraceCheckUtils]: 12: Hoare triple {6285#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6286#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:08:55,131 INFO L273 TraceCheckUtils]: 13: Hoare triple {6286#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {6286#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:08:55,132 INFO L273 TraceCheckUtils]: 14: Hoare triple {6286#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6287#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:55,132 INFO L273 TraceCheckUtils]: 15: Hoare triple {6287#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6287#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:55,134 INFO L273 TraceCheckUtils]: 16: Hoare triple {6287#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6288#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:55,134 INFO L273 TraceCheckUtils]: 17: Hoare triple {6288#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6288#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:55,135 INFO L273 TraceCheckUtils]: 18: Hoare triple {6288#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6289#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:08:55,136 INFO L273 TraceCheckUtils]: 19: Hoare triple {6289#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6289#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:08:55,137 INFO L273 TraceCheckUtils]: 20: Hoare triple {6289#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6290#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:08:55,138 INFO L273 TraceCheckUtils]: 21: Hoare triple {6290#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6290#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:08:55,139 INFO L273 TraceCheckUtils]: 22: Hoare triple {6290#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6291#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:08:55,140 INFO L273 TraceCheckUtils]: 23: Hoare triple {6291#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6291#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:08:55,141 INFO L273 TraceCheckUtils]: 24: Hoare triple {6291#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6292#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:08:55,142 INFO L273 TraceCheckUtils]: 25: Hoare triple {6292#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {6292#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:08:55,143 INFO L273 TraceCheckUtils]: 26: Hoare triple {6292#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6293#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:08:55,143 INFO L273 TraceCheckUtils]: 27: Hoare triple {6293#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6293#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:08:55,145 INFO L273 TraceCheckUtils]: 28: Hoare triple {6293#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6294#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:08:55,145 INFO L273 TraceCheckUtils]: 29: Hoare triple {6294#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6294#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:08:55,146 INFO L273 TraceCheckUtils]: 30: Hoare triple {6294#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6295#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:08:55,147 INFO L273 TraceCheckUtils]: 31: Hoare triple {6295#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6295#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:08:55,148 INFO L273 TraceCheckUtils]: 32: Hoare triple {6295#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6296#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:08:55,149 INFO L273 TraceCheckUtils]: 33: Hoare triple {6296#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6296#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:08:55,150 INFO L273 TraceCheckUtils]: 34: Hoare triple {6296#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6297#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:08:55,151 INFO L273 TraceCheckUtils]: 35: Hoare triple {6297#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {6297#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:08:55,152 INFO L273 TraceCheckUtils]: 36: Hoare triple {6297#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6298#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:08:55,153 INFO L273 TraceCheckUtils]: 37: Hoare triple {6298#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6298#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:08:55,154 INFO L273 TraceCheckUtils]: 38: Hoare triple {6298#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6299#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:08:55,155 INFO L273 TraceCheckUtils]: 39: Hoare triple {6299#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 < 99); {6299#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:08:55,156 INFO L273 TraceCheckUtils]: 40: Hoare triple {6299#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6300#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-23 13:08:55,156 INFO L273 TraceCheckUtils]: 41: Hoare triple {6300#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6300#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-23 13:08:55,158 INFO L273 TraceCheckUtils]: 42: Hoare triple {6300#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6431#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-23 13:08:55,159 INFO L273 TraceCheckUtils]: 43: Hoare triple {6431#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {6281#false} is VALID [2018-11-23 13:08:55,159 INFO L256 TraceCheckUtils]: 44: Hoare triple {6281#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {6281#false} is VALID [2018-11-23 13:08:55,159 INFO L273 TraceCheckUtils]: 45: Hoare triple {6281#false} ~cond := #in~cond; {6281#false} is VALID [2018-11-23 13:08:55,159 INFO L273 TraceCheckUtils]: 46: Hoare triple {6281#false} assume 0 == ~cond; {6281#false} is VALID [2018-11-23 13:08:55,159 INFO L273 TraceCheckUtils]: 47: Hoare triple {6281#false} assume !false; {6281#false} is VALID [2018-11-23 13:08:55,163 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:55,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:08:55,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-23 13:08:55,187 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2018-11-23 13:08:55,187 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:55,187 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 13:08:55,338 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:55,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 13:08:55,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 13:08:55,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-11-23 13:08:55,340 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 23 states. [2018-11-23 13:08:57,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:57,675 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-11-23 13:08:57,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 13:08:57,675 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2018-11-23 13:08:57,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:57,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:08:57,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 57 transitions. [2018-11-23 13:08:57,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:08:57,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 57 transitions. [2018-11-23 13:08:57,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 57 transitions. [2018-11-23 13:08:57,743 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:57,744 INFO L225 Difference]: With dead ends: 57 [2018-11-23 13:08:57,745 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 13:08:57,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-11-23 13:08:57,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 13:08:57,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2018-11-23 13:08:57,792 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:57,792 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 51 states. [2018-11-23 13:08:57,792 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 51 states. [2018-11-23 13:08:57,792 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 51 states. [2018-11-23 13:08:57,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:57,794 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-11-23 13:08:57,794 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-11-23 13:08:57,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:57,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:57,795 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 52 states. [2018-11-23 13:08:57,795 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 52 states. [2018-11-23 13:08:57,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:57,796 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-11-23 13:08:57,796 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-11-23 13:08:57,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:57,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:57,797 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:57,797 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:57,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 13:08:57,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-11-23 13:08:57,798 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2018-11-23 13:08:57,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:57,798 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-11-23 13:08:57,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 13:08:57,798 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-11-23 13:08:57,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 13:08:57,799 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:57,799 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:57,799 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:57,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:57,800 INFO L82 PathProgramCache]: Analyzing trace with hash 157176188, now seen corresponding path program 20 times [2018-11-23 13:08:57,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:57,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:57,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:57,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:08:57,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:57,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:58,380 INFO L256 TraceCheckUtils]: 0: Hoare triple {6714#true} call ULTIMATE.init(); {6714#true} is VALID [2018-11-23 13:08:58,380 INFO L273 TraceCheckUtils]: 1: Hoare triple {6714#true} assume true; {6714#true} is VALID [2018-11-23 13:08:58,381 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6714#true} {6714#true} #37#return; {6714#true} is VALID [2018-11-23 13:08:58,381 INFO L256 TraceCheckUtils]: 3: Hoare triple {6714#true} call #t~ret2 := main(); {6714#true} is VALID [2018-11-23 13:08:58,381 INFO L273 TraceCheckUtils]: 4: Hoare triple {6714#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {6716#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:58,382 INFO L273 TraceCheckUtils]: 5: Hoare triple {6716#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6716#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:58,383 INFO L273 TraceCheckUtils]: 6: Hoare triple {6716#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6717#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:08:58,384 INFO L273 TraceCheckUtils]: 7: Hoare triple {6717#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {6717#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:08:58,384 INFO L273 TraceCheckUtils]: 8: Hoare triple {6717#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6718#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:08:58,385 INFO L273 TraceCheckUtils]: 9: Hoare triple {6718#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {6718#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:08:58,386 INFO L273 TraceCheckUtils]: 10: Hoare triple {6718#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6719#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:08:58,386 INFO L273 TraceCheckUtils]: 11: Hoare triple {6719#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6719#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:08:58,388 INFO L273 TraceCheckUtils]: 12: Hoare triple {6719#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6720#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:08:58,388 INFO L273 TraceCheckUtils]: 13: Hoare triple {6720#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {6720#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:08:58,408 INFO L273 TraceCheckUtils]: 14: Hoare triple {6720#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6721#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:58,409 INFO L273 TraceCheckUtils]: 15: Hoare triple {6721#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6721#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:58,409 INFO L273 TraceCheckUtils]: 16: Hoare triple {6721#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6722#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:58,410 INFO L273 TraceCheckUtils]: 17: Hoare triple {6722#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6722#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:58,411 INFO L273 TraceCheckUtils]: 18: Hoare triple {6722#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6723#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:08:58,411 INFO L273 TraceCheckUtils]: 19: Hoare triple {6723#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6723#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:08:58,412 INFO L273 TraceCheckUtils]: 20: Hoare triple {6723#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6724#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:08:58,412 INFO L273 TraceCheckUtils]: 21: Hoare triple {6724#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6724#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:08:58,414 INFO L273 TraceCheckUtils]: 22: Hoare triple {6724#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6725#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:08:58,414 INFO L273 TraceCheckUtils]: 23: Hoare triple {6725#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6725#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:08:58,416 INFO L273 TraceCheckUtils]: 24: Hoare triple {6725#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6726#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:08:58,416 INFO L273 TraceCheckUtils]: 25: Hoare triple {6726#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {6726#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:08:58,417 INFO L273 TraceCheckUtils]: 26: Hoare triple {6726#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6727#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:08:58,418 INFO L273 TraceCheckUtils]: 27: Hoare triple {6727#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6727#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:08:58,419 INFO L273 TraceCheckUtils]: 28: Hoare triple {6727#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6728#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:08:58,420 INFO L273 TraceCheckUtils]: 29: Hoare triple {6728#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6728#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:08:58,421 INFO L273 TraceCheckUtils]: 30: Hoare triple {6728#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6729#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:08:58,422 INFO L273 TraceCheckUtils]: 31: Hoare triple {6729#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6729#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:08:58,423 INFO L273 TraceCheckUtils]: 32: Hoare triple {6729#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6730#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:08:58,424 INFO L273 TraceCheckUtils]: 33: Hoare triple {6730#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6730#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:08:58,425 INFO L273 TraceCheckUtils]: 34: Hoare triple {6730#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6731#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:08:58,426 INFO L273 TraceCheckUtils]: 35: Hoare triple {6731#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {6731#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:08:58,427 INFO L273 TraceCheckUtils]: 36: Hoare triple {6731#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6732#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:08:58,427 INFO L273 TraceCheckUtils]: 37: Hoare triple {6732#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6732#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:08:58,429 INFO L273 TraceCheckUtils]: 38: Hoare triple {6732#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6733#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:08:58,429 INFO L273 TraceCheckUtils]: 39: Hoare triple {6733#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 < 99); {6733#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:08:58,430 INFO L273 TraceCheckUtils]: 40: Hoare triple {6733#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6734#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-23 13:08:58,431 INFO L273 TraceCheckUtils]: 41: Hoare triple {6734#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6734#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-23 13:08:58,432 INFO L273 TraceCheckUtils]: 42: Hoare triple {6734#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6735#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-23 13:08:58,433 INFO L273 TraceCheckUtils]: 43: Hoare triple {6735#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6735#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-23 13:08:58,434 INFO L273 TraceCheckUtils]: 44: Hoare triple {6735#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6736#(and (<= main_~x~0 40) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:08:58,435 INFO L273 TraceCheckUtils]: 45: Hoare triple {6736#(and (<= main_~x~0 40) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {6715#false} is VALID [2018-11-23 13:08:58,435 INFO L256 TraceCheckUtils]: 46: Hoare triple {6715#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {6715#false} is VALID [2018-11-23 13:08:58,436 INFO L273 TraceCheckUtils]: 47: Hoare triple {6715#false} ~cond := #in~cond; {6715#false} is VALID [2018-11-23 13:08:58,436 INFO L273 TraceCheckUtils]: 48: Hoare triple {6715#false} assume 0 == ~cond; {6715#false} is VALID [2018-11-23 13:08:58,436 INFO L273 TraceCheckUtils]: 49: Hoare triple {6715#false} assume !false; {6715#false} is VALID [2018-11-23 13:08:58,440 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:58,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:08:58,440 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:08:58,449 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:08:58,467 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:08:58,468 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:08:58,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:58,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:08:58,650 INFO L256 TraceCheckUtils]: 0: Hoare triple {6714#true} call ULTIMATE.init(); {6714#true} is VALID [2018-11-23 13:08:58,650 INFO L273 TraceCheckUtils]: 1: Hoare triple {6714#true} assume true; {6714#true} is VALID [2018-11-23 13:08:58,650 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6714#true} {6714#true} #37#return; {6714#true} is VALID [2018-11-23 13:08:58,651 INFO L256 TraceCheckUtils]: 3: Hoare triple {6714#true} call #t~ret2 := main(); {6714#true} is VALID [2018-11-23 13:08:58,651 INFO L273 TraceCheckUtils]: 4: Hoare triple {6714#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {6716#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:58,652 INFO L273 TraceCheckUtils]: 5: Hoare triple {6716#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6716#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:58,652 INFO L273 TraceCheckUtils]: 6: Hoare triple {6716#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6717#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:08:58,653 INFO L273 TraceCheckUtils]: 7: Hoare triple {6717#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {6717#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:08:58,653 INFO L273 TraceCheckUtils]: 8: Hoare triple {6717#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6718#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:08:58,654 INFO L273 TraceCheckUtils]: 9: Hoare triple {6718#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {6718#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:08:58,654 INFO L273 TraceCheckUtils]: 10: Hoare triple {6718#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6719#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:08:58,655 INFO L273 TraceCheckUtils]: 11: Hoare triple {6719#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6719#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:08:58,656 INFO L273 TraceCheckUtils]: 12: Hoare triple {6719#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6720#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:08:58,657 INFO L273 TraceCheckUtils]: 13: Hoare triple {6720#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {6720#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:08:58,658 INFO L273 TraceCheckUtils]: 14: Hoare triple {6720#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6721#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:58,659 INFO L273 TraceCheckUtils]: 15: Hoare triple {6721#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6721#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:58,660 INFO L273 TraceCheckUtils]: 16: Hoare triple {6721#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6722#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:58,661 INFO L273 TraceCheckUtils]: 17: Hoare triple {6722#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6722#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:58,662 INFO L273 TraceCheckUtils]: 18: Hoare triple {6722#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6723#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:08:58,662 INFO L273 TraceCheckUtils]: 19: Hoare triple {6723#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6723#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:08:58,663 INFO L273 TraceCheckUtils]: 20: Hoare triple {6723#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6724#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:08:58,664 INFO L273 TraceCheckUtils]: 21: Hoare triple {6724#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6724#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:08:58,665 INFO L273 TraceCheckUtils]: 22: Hoare triple {6724#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6725#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:08:58,669 INFO L273 TraceCheckUtils]: 23: Hoare triple {6725#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6725#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:08:58,670 INFO L273 TraceCheckUtils]: 24: Hoare triple {6725#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6726#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:08:58,670 INFO L273 TraceCheckUtils]: 25: Hoare triple {6726#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {6726#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:08:58,671 INFO L273 TraceCheckUtils]: 26: Hoare triple {6726#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6727#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:08:58,671 INFO L273 TraceCheckUtils]: 27: Hoare triple {6727#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6727#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:08:58,672 INFO L273 TraceCheckUtils]: 28: Hoare triple {6727#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6728#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:08:58,673 INFO L273 TraceCheckUtils]: 29: Hoare triple {6728#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6728#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:08:58,674 INFO L273 TraceCheckUtils]: 30: Hoare triple {6728#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6729#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:08:58,675 INFO L273 TraceCheckUtils]: 31: Hoare triple {6729#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6729#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:08:58,676 INFO L273 TraceCheckUtils]: 32: Hoare triple {6729#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6730#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:08:58,677 INFO L273 TraceCheckUtils]: 33: Hoare triple {6730#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6730#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:08:58,678 INFO L273 TraceCheckUtils]: 34: Hoare triple {6730#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6731#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:08:58,679 INFO L273 TraceCheckUtils]: 35: Hoare triple {6731#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {6731#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:08:58,680 INFO L273 TraceCheckUtils]: 36: Hoare triple {6731#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6732#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:08:58,681 INFO L273 TraceCheckUtils]: 37: Hoare triple {6732#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6732#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:08:58,682 INFO L273 TraceCheckUtils]: 38: Hoare triple {6732#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6733#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:08:58,683 INFO L273 TraceCheckUtils]: 39: Hoare triple {6733#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 < 99); {6733#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:08:58,684 INFO L273 TraceCheckUtils]: 40: Hoare triple {6733#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6734#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-23 13:08:58,684 INFO L273 TraceCheckUtils]: 41: Hoare triple {6734#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6734#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-23 13:08:58,686 INFO L273 TraceCheckUtils]: 42: Hoare triple {6734#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6735#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-23 13:08:58,686 INFO L273 TraceCheckUtils]: 43: Hoare triple {6735#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6735#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-23 13:08:58,688 INFO L273 TraceCheckUtils]: 44: Hoare triple {6735#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {6872#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-23 13:08:58,688 INFO L273 TraceCheckUtils]: 45: Hoare triple {6872#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {6715#false} is VALID [2018-11-23 13:08:58,689 INFO L256 TraceCheckUtils]: 46: Hoare triple {6715#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {6715#false} is VALID [2018-11-23 13:08:58,689 INFO L273 TraceCheckUtils]: 47: Hoare triple {6715#false} ~cond := #in~cond; {6715#false} is VALID [2018-11-23 13:08:58,689 INFO L273 TraceCheckUtils]: 48: Hoare triple {6715#false} assume 0 == ~cond; {6715#false} is VALID [2018-11-23 13:08:58,689 INFO L273 TraceCheckUtils]: 49: Hoare triple {6715#false} assume !false; {6715#false} is VALID [2018-11-23 13:08:58,694 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:58,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:08:58,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-23 13:08:58,715 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 50 [2018-11-23 13:08:58,715 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:58,715 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 13:08:58,798 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:58,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 13:08:58,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 13:08:58,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2018-11-23 13:08:58,798 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 24 states. [2018-11-23 13:09:01,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:01,285 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-11-23 13:09:01,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 13:09:01,286 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 50 [2018-11-23 13:09:01,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:09:01,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 13:09:01,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 59 transitions. [2018-11-23 13:09:01,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 13:09:01,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 59 transitions. [2018-11-23 13:09:01,287 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 59 transitions. [2018-11-23 13:09:01,372 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:01,373 INFO L225 Difference]: With dead ends: 59 [2018-11-23 13:09:01,373 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 13:09:01,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2018-11-23 13:09:01,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 13:09:01,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-11-23 13:09:01,473 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:09:01,473 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 53 states. [2018-11-23 13:09:01,473 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 53 states. [2018-11-23 13:09:01,473 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 53 states. [2018-11-23 13:09:01,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:01,474 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-11-23 13:09:01,474 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-11-23 13:09:01,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:01,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:01,475 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 54 states. [2018-11-23 13:09:01,475 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 54 states. [2018-11-23 13:09:01,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:01,476 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-11-23 13:09:01,476 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-11-23 13:09:01,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:01,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:01,476 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:09:01,476 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:09:01,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 13:09:01,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-11-23 13:09:01,477 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2018-11-23 13:09:01,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:09:01,478 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-11-23 13:09:01,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 13:09:01,478 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-11-23 13:09:01,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 13:09:01,478 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:09:01,479 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:09:01,479 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:09:01,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:09:01,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1797793337, now seen corresponding path program 21 times [2018-11-23 13:09:01,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:09:01,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:09:01,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:01,480 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:09:01,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:01,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:02,378 INFO L256 TraceCheckUtils]: 0: Hoare triple {7165#true} call ULTIMATE.init(); {7165#true} is VALID [2018-11-23 13:09:02,378 INFO L273 TraceCheckUtils]: 1: Hoare triple {7165#true} assume true; {7165#true} is VALID [2018-11-23 13:09:02,379 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {7165#true} {7165#true} #37#return; {7165#true} is VALID [2018-11-23 13:09:02,379 INFO L256 TraceCheckUtils]: 3: Hoare triple {7165#true} call #t~ret2 := main(); {7165#true} is VALID [2018-11-23 13:09:02,379 INFO L273 TraceCheckUtils]: 4: Hoare triple {7165#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {7167#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:09:02,380 INFO L273 TraceCheckUtils]: 5: Hoare triple {7167#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7167#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:09:02,381 INFO L273 TraceCheckUtils]: 6: Hoare triple {7167#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7168#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:09:02,382 INFO L273 TraceCheckUtils]: 7: Hoare triple {7168#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {7168#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:09:02,383 INFO L273 TraceCheckUtils]: 8: Hoare triple {7168#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7169#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:09:02,384 INFO L273 TraceCheckUtils]: 9: Hoare triple {7169#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {7169#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:09:02,385 INFO L273 TraceCheckUtils]: 10: Hoare triple {7169#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7170#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:09:02,386 INFO L273 TraceCheckUtils]: 11: Hoare triple {7170#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7170#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:09:02,387 INFO L273 TraceCheckUtils]: 12: Hoare triple {7170#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7171#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:09:02,387 INFO L273 TraceCheckUtils]: 13: Hoare triple {7171#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {7171#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:09:02,389 INFO L273 TraceCheckUtils]: 14: Hoare triple {7171#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7172#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:09:02,389 INFO L273 TraceCheckUtils]: 15: Hoare triple {7172#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7172#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:09:02,390 INFO L273 TraceCheckUtils]: 16: Hoare triple {7172#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7173#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:09:02,391 INFO L273 TraceCheckUtils]: 17: Hoare triple {7173#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7173#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:09:02,392 INFO L273 TraceCheckUtils]: 18: Hoare triple {7173#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7174#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:09:02,393 INFO L273 TraceCheckUtils]: 19: Hoare triple {7174#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7174#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:09:02,394 INFO L273 TraceCheckUtils]: 20: Hoare triple {7174#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7175#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:09:02,395 INFO L273 TraceCheckUtils]: 21: Hoare triple {7175#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7175#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:09:02,396 INFO L273 TraceCheckUtils]: 22: Hoare triple {7175#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7176#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:09:02,397 INFO L273 TraceCheckUtils]: 23: Hoare triple {7176#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7176#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:09:02,398 INFO L273 TraceCheckUtils]: 24: Hoare triple {7176#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7177#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:09:02,398 INFO L273 TraceCheckUtils]: 25: Hoare triple {7177#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {7177#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:09:02,399 INFO L273 TraceCheckUtils]: 26: Hoare triple {7177#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7178#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:09:02,400 INFO L273 TraceCheckUtils]: 27: Hoare triple {7178#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7178#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:09:02,401 INFO L273 TraceCheckUtils]: 28: Hoare triple {7178#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7179#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:09:02,402 INFO L273 TraceCheckUtils]: 29: Hoare triple {7179#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7179#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:09:02,403 INFO L273 TraceCheckUtils]: 30: Hoare triple {7179#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7180#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:09:02,404 INFO L273 TraceCheckUtils]: 31: Hoare triple {7180#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7180#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:09:02,405 INFO L273 TraceCheckUtils]: 32: Hoare triple {7180#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7181#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:09:02,406 INFO L273 TraceCheckUtils]: 33: Hoare triple {7181#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7181#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:09:02,407 INFO L273 TraceCheckUtils]: 34: Hoare triple {7181#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7182#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:09:02,407 INFO L273 TraceCheckUtils]: 35: Hoare triple {7182#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {7182#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:09:02,408 INFO L273 TraceCheckUtils]: 36: Hoare triple {7182#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7183#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:09:02,409 INFO L273 TraceCheckUtils]: 37: Hoare triple {7183#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7183#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:09:02,410 INFO L273 TraceCheckUtils]: 38: Hoare triple {7183#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7184#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:09:02,411 INFO L273 TraceCheckUtils]: 39: Hoare triple {7184#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 < 99); {7184#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:09:02,412 INFO L273 TraceCheckUtils]: 40: Hoare triple {7184#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7185#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-23 13:09:02,413 INFO L273 TraceCheckUtils]: 41: Hoare triple {7185#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7185#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-23 13:09:02,414 INFO L273 TraceCheckUtils]: 42: Hoare triple {7185#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7186#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-23 13:09:02,415 INFO L273 TraceCheckUtils]: 43: Hoare triple {7186#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7186#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-23 13:09:02,416 INFO L273 TraceCheckUtils]: 44: Hoare triple {7186#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7187#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-23 13:09:02,416 INFO L273 TraceCheckUtils]: 45: Hoare triple {7187#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7187#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-23 13:09:02,418 INFO L273 TraceCheckUtils]: 46: Hoare triple {7187#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7188#(and (<= main_~x~0 42) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:09:02,419 INFO L273 TraceCheckUtils]: 47: Hoare triple {7188#(and (<= main_~x~0 42) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {7166#false} is VALID [2018-11-23 13:09:02,419 INFO L256 TraceCheckUtils]: 48: Hoare triple {7166#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {7166#false} is VALID [2018-11-23 13:09:02,419 INFO L273 TraceCheckUtils]: 49: Hoare triple {7166#false} ~cond := #in~cond; {7166#false} is VALID [2018-11-23 13:09:02,419 INFO L273 TraceCheckUtils]: 50: Hoare triple {7166#false} assume 0 == ~cond; {7166#false} is VALID [2018-11-23 13:09:02,419 INFO L273 TraceCheckUtils]: 51: Hoare triple {7166#false} assume !false; {7166#false} is VALID [2018-11-23 13:09:02,424 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:02,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:09:02,425 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:09:02,433 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:09:05,329 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-11-23 13:09:05,329 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:09:05,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:05,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:09:05,526 INFO L256 TraceCheckUtils]: 0: Hoare triple {7165#true} call ULTIMATE.init(); {7165#true} is VALID [2018-11-23 13:09:05,526 INFO L273 TraceCheckUtils]: 1: Hoare triple {7165#true} assume true; {7165#true} is VALID [2018-11-23 13:09:05,527 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {7165#true} {7165#true} #37#return; {7165#true} is VALID [2018-11-23 13:09:05,527 INFO L256 TraceCheckUtils]: 3: Hoare triple {7165#true} call #t~ret2 := main(); {7165#true} is VALID [2018-11-23 13:09:05,527 INFO L273 TraceCheckUtils]: 4: Hoare triple {7165#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {7167#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:09:05,528 INFO L273 TraceCheckUtils]: 5: Hoare triple {7167#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7167#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:09:05,529 INFO L273 TraceCheckUtils]: 6: Hoare triple {7167#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7168#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:09:05,529 INFO L273 TraceCheckUtils]: 7: Hoare triple {7168#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {7168#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:09:05,530 INFO L273 TraceCheckUtils]: 8: Hoare triple {7168#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7169#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:09:05,531 INFO L273 TraceCheckUtils]: 9: Hoare triple {7169#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {7169#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:09:05,532 INFO L273 TraceCheckUtils]: 10: Hoare triple {7169#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7170#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:09:05,532 INFO L273 TraceCheckUtils]: 11: Hoare triple {7170#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7170#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:09:05,534 INFO L273 TraceCheckUtils]: 12: Hoare triple {7170#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7171#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:09:05,534 INFO L273 TraceCheckUtils]: 13: Hoare triple {7171#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {7171#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:09:05,535 INFO L273 TraceCheckUtils]: 14: Hoare triple {7171#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7172#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:09:05,536 INFO L273 TraceCheckUtils]: 15: Hoare triple {7172#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7172#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:09:05,537 INFO L273 TraceCheckUtils]: 16: Hoare triple {7172#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7173#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:09:05,538 INFO L273 TraceCheckUtils]: 17: Hoare triple {7173#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7173#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:09:05,539 INFO L273 TraceCheckUtils]: 18: Hoare triple {7173#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7174#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:09:05,540 INFO L273 TraceCheckUtils]: 19: Hoare triple {7174#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7174#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:09:05,541 INFO L273 TraceCheckUtils]: 20: Hoare triple {7174#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7175#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:09:05,542 INFO L273 TraceCheckUtils]: 21: Hoare triple {7175#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7175#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:09:05,543 INFO L273 TraceCheckUtils]: 22: Hoare triple {7175#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7176#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:09:05,543 INFO L273 TraceCheckUtils]: 23: Hoare triple {7176#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7176#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:09:05,545 INFO L273 TraceCheckUtils]: 24: Hoare triple {7176#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7177#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:09:05,545 INFO L273 TraceCheckUtils]: 25: Hoare triple {7177#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {7177#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:09:05,546 INFO L273 TraceCheckUtils]: 26: Hoare triple {7177#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7178#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:09:05,547 INFO L273 TraceCheckUtils]: 27: Hoare triple {7178#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7178#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:09:05,548 INFO L273 TraceCheckUtils]: 28: Hoare triple {7178#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7179#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:09:05,549 INFO L273 TraceCheckUtils]: 29: Hoare triple {7179#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7179#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:09:05,550 INFO L273 TraceCheckUtils]: 30: Hoare triple {7179#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7180#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:09:05,551 INFO L273 TraceCheckUtils]: 31: Hoare triple {7180#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7180#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:09:05,552 INFO L273 TraceCheckUtils]: 32: Hoare triple {7180#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7181#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:09:05,552 INFO L273 TraceCheckUtils]: 33: Hoare triple {7181#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7181#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:09:05,553 INFO L273 TraceCheckUtils]: 34: Hoare triple {7181#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7182#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:09:05,554 INFO L273 TraceCheckUtils]: 35: Hoare triple {7182#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {7182#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:09:05,555 INFO L273 TraceCheckUtils]: 36: Hoare triple {7182#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7183#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:09:05,556 INFO L273 TraceCheckUtils]: 37: Hoare triple {7183#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7183#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:09:05,557 INFO L273 TraceCheckUtils]: 38: Hoare triple {7183#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7184#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:09:05,557 INFO L273 TraceCheckUtils]: 39: Hoare triple {7184#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 < 99); {7184#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:09:05,559 INFO L273 TraceCheckUtils]: 40: Hoare triple {7184#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7185#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-23 13:09:05,559 INFO L273 TraceCheckUtils]: 41: Hoare triple {7185#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7185#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-23 13:09:05,560 INFO L273 TraceCheckUtils]: 42: Hoare triple {7185#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7186#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-23 13:09:05,561 INFO L273 TraceCheckUtils]: 43: Hoare triple {7186#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7186#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-23 13:09:05,562 INFO L273 TraceCheckUtils]: 44: Hoare triple {7186#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7187#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-23 13:09:05,563 INFO L273 TraceCheckUtils]: 45: Hoare triple {7187#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7187#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-23 13:09:05,564 INFO L273 TraceCheckUtils]: 46: Hoare triple {7187#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7330#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2018-11-23 13:09:05,565 INFO L273 TraceCheckUtils]: 47: Hoare triple {7330#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {7166#false} is VALID [2018-11-23 13:09:05,565 INFO L256 TraceCheckUtils]: 48: Hoare triple {7166#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {7166#false} is VALID [2018-11-23 13:09:05,565 INFO L273 TraceCheckUtils]: 49: Hoare triple {7166#false} ~cond := #in~cond; {7166#false} is VALID [2018-11-23 13:09:05,565 INFO L273 TraceCheckUtils]: 50: Hoare triple {7166#false} assume 0 == ~cond; {7166#false} is VALID [2018-11-23 13:09:05,565 INFO L273 TraceCheckUtils]: 51: Hoare triple {7166#false} assume !false; {7166#false} is VALID [2018-11-23 13:09:05,570 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:05,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:09:05,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-11-23 13:09:05,590 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 52 [2018-11-23 13:09:05,590 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:09:05,590 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 13:09:05,715 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:05,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 13:09:05,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 13:09:05,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2018-11-23 13:09:05,716 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 25 states. [2018-11-23 13:09:08,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:08,413 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-11-23 13:09:08,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 13:09:08,413 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 52 [2018-11-23 13:09:08,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:09:08,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:09:08,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 61 transitions. [2018-11-23 13:09:08,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:09:08,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 61 transitions. [2018-11-23 13:09:08,415 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 61 transitions. [2018-11-23 13:09:08,488 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:08,490 INFO L225 Difference]: With dead ends: 61 [2018-11-23 13:09:08,490 INFO L226 Difference]: Without dead ends: 56 [2018-11-23 13:09:08,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2018-11-23 13:09:08,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-23 13:09:08,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2018-11-23 13:09:08,536 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:09:08,536 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 55 states. [2018-11-23 13:09:08,536 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 55 states. [2018-11-23 13:09:08,536 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 55 states. [2018-11-23 13:09:08,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:08,538 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-11-23 13:09:08,538 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-11-23 13:09:08,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:08,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:08,539 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 56 states. [2018-11-23 13:09:08,539 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 56 states. [2018-11-23 13:09:08,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:08,540 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-11-23 13:09:08,540 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-11-23 13:09:08,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:08,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:08,541 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:09:08,541 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:09:08,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 13:09:08,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-11-23 13:09:08,545 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2018-11-23 13:09:08,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:09:08,545 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-11-23 13:09:08,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 13:09:08,545 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-11-23 13:09:08,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-23 13:09:08,546 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:09:08,546 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:09:08,546 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:09:08,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:09:08,546 INFO L82 PathProgramCache]: Analyzing trace with hash -2117091402, now seen corresponding path program 22 times [2018-11-23 13:09:08,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:09:08,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:09:08,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:08,547 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:09:08,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:08,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:10,339 INFO L256 TraceCheckUtils]: 0: Hoare triple {7633#true} call ULTIMATE.init(); {7633#true} is VALID [2018-11-23 13:09:10,340 INFO L273 TraceCheckUtils]: 1: Hoare triple {7633#true} assume true; {7633#true} is VALID [2018-11-23 13:09:10,340 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {7633#true} {7633#true} #37#return; {7633#true} is VALID [2018-11-23 13:09:10,340 INFO L256 TraceCheckUtils]: 3: Hoare triple {7633#true} call #t~ret2 := main(); {7633#true} is VALID [2018-11-23 13:09:10,340 INFO L273 TraceCheckUtils]: 4: Hoare triple {7633#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {7635#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:09:10,341 INFO L273 TraceCheckUtils]: 5: Hoare triple {7635#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7635#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:09:10,341 INFO L273 TraceCheckUtils]: 6: Hoare triple {7635#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7636#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:09:10,342 INFO L273 TraceCheckUtils]: 7: Hoare triple {7636#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {7636#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:09:10,343 INFO L273 TraceCheckUtils]: 8: Hoare triple {7636#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7637#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:09:10,344 INFO L273 TraceCheckUtils]: 9: Hoare triple {7637#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {7637#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:09:10,345 INFO L273 TraceCheckUtils]: 10: Hoare triple {7637#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7638#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:09:10,346 INFO L273 TraceCheckUtils]: 11: Hoare triple {7638#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7638#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:09:10,347 INFO L273 TraceCheckUtils]: 12: Hoare triple {7638#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7639#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:09:10,347 INFO L273 TraceCheckUtils]: 13: Hoare triple {7639#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {7639#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:09:10,348 INFO L273 TraceCheckUtils]: 14: Hoare triple {7639#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7640#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:09:10,349 INFO L273 TraceCheckUtils]: 15: Hoare triple {7640#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7640#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:09:10,350 INFO L273 TraceCheckUtils]: 16: Hoare triple {7640#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7641#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:09:10,351 INFO L273 TraceCheckUtils]: 17: Hoare triple {7641#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7641#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:09:10,352 INFO L273 TraceCheckUtils]: 18: Hoare triple {7641#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7642#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:09:10,353 INFO L273 TraceCheckUtils]: 19: Hoare triple {7642#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7642#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:09:10,354 INFO L273 TraceCheckUtils]: 20: Hoare triple {7642#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7643#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:09:10,355 INFO L273 TraceCheckUtils]: 21: Hoare triple {7643#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7643#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:09:10,356 INFO L273 TraceCheckUtils]: 22: Hoare triple {7643#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7644#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:09:10,357 INFO L273 TraceCheckUtils]: 23: Hoare triple {7644#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7644#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:09:10,358 INFO L273 TraceCheckUtils]: 24: Hoare triple {7644#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7645#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:09:10,358 INFO L273 TraceCheckUtils]: 25: Hoare triple {7645#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {7645#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:09:10,359 INFO L273 TraceCheckUtils]: 26: Hoare triple {7645#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7646#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:09:10,360 INFO L273 TraceCheckUtils]: 27: Hoare triple {7646#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7646#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:09:10,361 INFO L273 TraceCheckUtils]: 28: Hoare triple {7646#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7647#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:09:10,362 INFO L273 TraceCheckUtils]: 29: Hoare triple {7647#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7647#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:09:10,363 INFO L273 TraceCheckUtils]: 30: Hoare triple {7647#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7648#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:09:10,364 INFO L273 TraceCheckUtils]: 31: Hoare triple {7648#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7648#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:09:10,365 INFO L273 TraceCheckUtils]: 32: Hoare triple {7648#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7649#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:09:10,366 INFO L273 TraceCheckUtils]: 33: Hoare triple {7649#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7649#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:09:10,367 INFO L273 TraceCheckUtils]: 34: Hoare triple {7649#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7650#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:09:10,367 INFO L273 TraceCheckUtils]: 35: Hoare triple {7650#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {7650#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:09:10,369 INFO L273 TraceCheckUtils]: 36: Hoare triple {7650#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7651#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:09:10,369 INFO L273 TraceCheckUtils]: 37: Hoare triple {7651#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7651#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:09:10,370 INFO L273 TraceCheckUtils]: 38: Hoare triple {7651#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7652#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:09:10,371 INFO L273 TraceCheckUtils]: 39: Hoare triple {7652#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 < 99); {7652#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:09:10,372 INFO L273 TraceCheckUtils]: 40: Hoare triple {7652#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7653#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-23 13:09:10,373 INFO L273 TraceCheckUtils]: 41: Hoare triple {7653#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7653#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-23 13:09:10,374 INFO L273 TraceCheckUtils]: 42: Hoare triple {7653#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7654#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-23 13:09:10,375 INFO L273 TraceCheckUtils]: 43: Hoare triple {7654#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7654#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-23 13:09:10,376 INFO L273 TraceCheckUtils]: 44: Hoare triple {7654#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7655#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-23 13:09:10,377 INFO L273 TraceCheckUtils]: 45: Hoare triple {7655#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7655#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-23 13:09:10,378 INFO L273 TraceCheckUtils]: 46: Hoare triple {7655#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7656#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2018-11-23 13:09:10,379 INFO L273 TraceCheckUtils]: 47: Hoare triple {7656#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7656#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2018-11-23 13:09:10,380 INFO L273 TraceCheckUtils]: 48: Hoare triple {7656#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7657#(and (<= main_~x~0 44) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:09:10,381 INFO L273 TraceCheckUtils]: 49: Hoare triple {7657#(and (<= main_~x~0 44) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {7634#false} is VALID [2018-11-23 13:09:10,381 INFO L256 TraceCheckUtils]: 50: Hoare triple {7634#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {7634#false} is VALID [2018-11-23 13:09:10,381 INFO L273 TraceCheckUtils]: 51: Hoare triple {7634#false} ~cond := #in~cond; {7634#false} is VALID [2018-11-23 13:09:10,381 INFO L273 TraceCheckUtils]: 52: Hoare triple {7634#false} assume 0 == ~cond; {7634#false} is VALID [2018-11-23 13:09:10,382 INFO L273 TraceCheckUtils]: 53: Hoare triple {7634#false} assume !false; {7634#false} is VALID [2018-11-23 13:09:10,385 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:10,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:09:10,386 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:09:10,396 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:09:10,417 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:09:10,418 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:09:10,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:10,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:09:10,586 INFO L256 TraceCheckUtils]: 0: Hoare triple {7633#true} call ULTIMATE.init(); {7633#true} is VALID [2018-11-23 13:09:10,587 INFO L273 TraceCheckUtils]: 1: Hoare triple {7633#true} assume true; {7633#true} is VALID [2018-11-23 13:09:10,587 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {7633#true} {7633#true} #37#return; {7633#true} is VALID [2018-11-23 13:09:10,587 INFO L256 TraceCheckUtils]: 3: Hoare triple {7633#true} call #t~ret2 := main(); {7633#true} is VALID [2018-11-23 13:09:10,588 INFO L273 TraceCheckUtils]: 4: Hoare triple {7633#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {7635#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:09:10,588 INFO L273 TraceCheckUtils]: 5: Hoare triple {7635#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7635#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:09:10,590 INFO L273 TraceCheckUtils]: 6: Hoare triple {7635#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7636#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:09:10,590 INFO L273 TraceCheckUtils]: 7: Hoare triple {7636#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {7636#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:09:10,591 INFO L273 TraceCheckUtils]: 8: Hoare triple {7636#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7637#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:09:10,591 INFO L273 TraceCheckUtils]: 9: Hoare triple {7637#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {7637#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:09:10,592 INFO L273 TraceCheckUtils]: 10: Hoare triple {7637#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7638#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:09:10,592 INFO L273 TraceCheckUtils]: 11: Hoare triple {7638#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7638#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:09:10,593 INFO L273 TraceCheckUtils]: 12: Hoare triple {7638#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7639#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:09:10,594 INFO L273 TraceCheckUtils]: 13: Hoare triple {7639#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {7639#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:09:10,595 INFO L273 TraceCheckUtils]: 14: Hoare triple {7639#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7640#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:09:10,596 INFO L273 TraceCheckUtils]: 15: Hoare triple {7640#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7640#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:09:10,597 INFO L273 TraceCheckUtils]: 16: Hoare triple {7640#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7641#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:09:10,597 INFO L273 TraceCheckUtils]: 17: Hoare triple {7641#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7641#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:09:10,599 INFO L273 TraceCheckUtils]: 18: Hoare triple {7641#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7642#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:09:10,599 INFO L273 TraceCheckUtils]: 19: Hoare triple {7642#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7642#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:09:10,600 INFO L273 TraceCheckUtils]: 20: Hoare triple {7642#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7643#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:09:10,601 INFO L273 TraceCheckUtils]: 21: Hoare triple {7643#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7643#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:09:10,602 INFO L273 TraceCheckUtils]: 22: Hoare triple {7643#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7644#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:09:10,603 INFO L273 TraceCheckUtils]: 23: Hoare triple {7644#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7644#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:09:10,604 INFO L273 TraceCheckUtils]: 24: Hoare triple {7644#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7645#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:09:10,605 INFO L273 TraceCheckUtils]: 25: Hoare triple {7645#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {7645#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:09:10,606 INFO L273 TraceCheckUtils]: 26: Hoare triple {7645#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7646#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:09:10,607 INFO L273 TraceCheckUtils]: 27: Hoare triple {7646#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7646#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:09:10,608 INFO L273 TraceCheckUtils]: 28: Hoare triple {7646#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7647#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:09:10,608 INFO L273 TraceCheckUtils]: 29: Hoare triple {7647#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7647#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:09:10,609 INFO L273 TraceCheckUtils]: 30: Hoare triple {7647#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7648#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:09:10,610 INFO L273 TraceCheckUtils]: 31: Hoare triple {7648#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7648#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:09:10,611 INFO L273 TraceCheckUtils]: 32: Hoare triple {7648#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7649#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:09:10,612 INFO L273 TraceCheckUtils]: 33: Hoare triple {7649#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7649#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:09:10,613 INFO L273 TraceCheckUtils]: 34: Hoare triple {7649#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7650#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:09:10,614 INFO L273 TraceCheckUtils]: 35: Hoare triple {7650#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {7650#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:09:10,615 INFO L273 TraceCheckUtils]: 36: Hoare triple {7650#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7651#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:09:10,616 INFO L273 TraceCheckUtils]: 37: Hoare triple {7651#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7651#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:09:10,617 INFO L273 TraceCheckUtils]: 38: Hoare triple {7651#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7652#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:09:10,618 INFO L273 TraceCheckUtils]: 39: Hoare triple {7652#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 < 99); {7652#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:09:10,619 INFO L273 TraceCheckUtils]: 40: Hoare triple {7652#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7653#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-23 13:09:10,619 INFO L273 TraceCheckUtils]: 41: Hoare triple {7653#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7653#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-23 13:09:10,620 INFO L273 TraceCheckUtils]: 42: Hoare triple {7653#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7654#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-23 13:09:10,621 INFO L273 TraceCheckUtils]: 43: Hoare triple {7654#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7654#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-23 13:09:10,622 INFO L273 TraceCheckUtils]: 44: Hoare triple {7654#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7655#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-23 13:09:10,623 INFO L273 TraceCheckUtils]: 45: Hoare triple {7655#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7655#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-23 13:09:10,624 INFO L273 TraceCheckUtils]: 46: Hoare triple {7655#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7656#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2018-11-23 13:09:10,625 INFO L273 TraceCheckUtils]: 47: Hoare triple {7656#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7656#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2018-11-23 13:09:10,626 INFO L273 TraceCheckUtils]: 48: Hoare triple {7656#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {7805#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2018-11-23 13:09:10,627 INFO L273 TraceCheckUtils]: 49: Hoare triple {7805#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !(~x~0 % 4294967296 < 99); {7634#false} is VALID [2018-11-23 13:09:10,627 INFO L256 TraceCheckUtils]: 50: Hoare triple {7634#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {7634#false} is VALID [2018-11-23 13:09:10,627 INFO L273 TraceCheckUtils]: 51: Hoare triple {7634#false} ~cond := #in~cond; {7634#false} is VALID [2018-11-23 13:09:10,628 INFO L273 TraceCheckUtils]: 52: Hoare triple {7634#false} assume 0 == ~cond; {7634#false} is VALID [2018-11-23 13:09:10,628 INFO L273 TraceCheckUtils]: 53: Hoare triple {7634#false} assume !false; {7634#false} is VALID [2018-11-23 13:09:10,634 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:10,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:09:10,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-11-23 13:09:10,655 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 54 [2018-11-23 13:09:10,655 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:09:10,656 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 13:09:10,720 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:10,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 13:09:10,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 13:09:10,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2018-11-23 13:09:10,721 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 26 states. [2018-11-23 13:09:13,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:13,595 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-11-23 13:09:13,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 13:09:13,595 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 54 [2018-11-23 13:09:13,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:09:13,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 13:09:13,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 63 transitions. [2018-11-23 13:09:13,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 13:09:13,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 63 transitions. [2018-11-23 13:09:13,598 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 63 transitions. [2018-11-23 13:09:13,792 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:13,793 INFO L225 Difference]: With dead ends: 63 [2018-11-23 13:09:13,793 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 13:09:13,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2018-11-23 13:09:13,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 13:09:13,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-11-23 13:09:13,843 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:09:13,843 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 57 states. [2018-11-23 13:09:13,843 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 57 states. [2018-11-23 13:09:13,843 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 57 states. [2018-11-23 13:09:13,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:13,844 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-11-23 13:09:13,844 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-11-23 13:09:13,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:13,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:13,845 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 58 states. [2018-11-23 13:09:13,845 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 58 states. [2018-11-23 13:09:13,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:13,846 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-11-23 13:09:13,846 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-11-23 13:09:13,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:13,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:13,846 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:09:13,846 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:09:13,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 13:09:13,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-11-23 13:09:13,847 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2018-11-23 13:09:13,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:09:13,847 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-11-23 13:09:13,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 13:09:13,848 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-11-23 13:09:13,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 13:09:13,848 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:09:13,848 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:09:13,848 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:09:13,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:09:13,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1929974285, now seen corresponding path program 23 times [2018-11-23 13:09:13,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:09:13,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:09:13,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:13,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:09:13,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:13,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:15,304 INFO L256 TraceCheckUtils]: 0: Hoare triple {8118#true} call ULTIMATE.init(); {8118#true} is VALID [2018-11-23 13:09:15,304 INFO L273 TraceCheckUtils]: 1: Hoare triple {8118#true} assume true; {8118#true} is VALID [2018-11-23 13:09:15,304 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {8118#true} {8118#true} #37#return; {8118#true} is VALID [2018-11-23 13:09:15,305 INFO L256 TraceCheckUtils]: 3: Hoare triple {8118#true} call #t~ret2 := main(); {8118#true} is VALID [2018-11-23 13:09:15,305 INFO L273 TraceCheckUtils]: 4: Hoare triple {8118#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {8120#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:09:15,306 INFO L273 TraceCheckUtils]: 5: Hoare triple {8120#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8120#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:09:15,307 INFO L273 TraceCheckUtils]: 6: Hoare triple {8120#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8121#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:09:15,308 INFO L273 TraceCheckUtils]: 7: Hoare triple {8121#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {8121#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:09:15,309 INFO L273 TraceCheckUtils]: 8: Hoare triple {8121#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8122#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:09:15,310 INFO L273 TraceCheckUtils]: 9: Hoare triple {8122#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {8122#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:09:15,311 INFO L273 TraceCheckUtils]: 10: Hoare triple {8122#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8123#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:09:15,312 INFO L273 TraceCheckUtils]: 11: Hoare triple {8123#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8123#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:09:15,313 INFO L273 TraceCheckUtils]: 12: Hoare triple {8123#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8124#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:09:15,313 INFO L273 TraceCheckUtils]: 13: Hoare triple {8124#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {8124#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:09:15,315 INFO L273 TraceCheckUtils]: 14: Hoare triple {8124#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8125#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:09:15,315 INFO L273 TraceCheckUtils]: 15: Hoare triple {8125#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8125#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:09:15,316 INFO L273 TraceCheckUtils]: 16: Hoare triple {8125#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8126#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:09:15,317 INFO L273 TraceCheckUtils]: 17: Hoare triple {8126#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8126#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:09:15,318 INFO L273 TraceCheckUtils]: 18: Hoare triple {8126#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8127#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:09:15,319 INFO L273 TraceCheckUtils]: 19: Hoare triple {8127#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8127#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:09:15,320 INFO L273 TraceCheckUtils]: 20: Hoare triple {8127#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8128#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:09:15,321 INFO L273 TraceCheckUtils]: 21: Hoare triple {8128#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8128#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:09:15,322 INFO L273 TraceCheckUtils]: 22: Hoare triple {8128#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8129#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:09:15,323 INFO L273 TraceCheckUtils]: 23: Hoare triple {8129#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8129#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:09:15,324 INFO L273 TraceCheckUtils]: 24: Hoare triple {8129#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8130#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:09:15,325 INFO L273 TraceCheckUtils]: 25: Hoare triple {8130#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {8130#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:09:15,326 INFO L273 TraceCheckUtils]: 26: Hoare triple {8130#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8131#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:09:15,326 INFO L273 TraceCheckUtils]: 27: Hoare triple {8131#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8131#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:09:15,328 INFO L273 TraceCheckUtils]: 28: Hoare triple {8131#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8132#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:09:15,328 INFO L273 TraceCheckUtils]: 29: Hoare triple {8132#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8132#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:09:15,329 INFO L273 TraceCheckUtils]: 30: Hoare triple {8132#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8133#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:09:15,330 INFO L273 TraceCheckUtils]: 31: Hoare triple {8133#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8133#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:09:15,331 INFO L273 TraceCheckUtils]: 32: Hoare triple {8133#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8134#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:09:15,332 INFO L273 TraceCheckUtils]: 33: Hoare triple {8134#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8134#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:09:15,333 INFO L273 TraceCheckUtils]: 34: Hoare triple {8134#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8135#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:09:15,334 INFO L273 TraceCheckUtils]: 35: Hoare triple {8135#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {8135#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:09:15,335 INFO L273 TraceCheckUtils]: 36: Hoare triple {8135#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8136#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:09:15,336 INFO L273 TraceCheckUtils]: 37: Hoare triple {8136#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8136#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:09:15,337 INFO L273 TraceCheckUtils]: 38: Hoare triple {8136#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8137#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:09:15,337 INFO L273 TraceCheckUtils]: 39: Hoare triple {8137#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 < 99); {8137#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:09:15,339 INFO L273 TraceCheckUtils]: 40: Hoare triple {8137#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8138#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-23 13:09:15,339 INFO L273 TraceCheckUtils]: 41: Hoare triple {8138#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8138#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-23 13:09:15,340 INFO L273 TraceCheckUtils]: 42: Hoare triple {8138#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8139#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-23 13:09:15,341 INFO L273 TraceCheckUtils]: 43: Hoare triple {8139#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8139#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-23 13:09:15,342 INFO L273 TraceCheckUtils]: 44: Hoare triple {8139#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8140#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-23 13:09:15,343 INFO L273 TraceCheckUtils]: 45: Hoare triple {8140#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8140#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-23 13:09:15,344 INFO L273 TraceCheckUtils]: 46: Hoare triple {8140#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8141#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2018-11-23 13:09:15,345 INFO L273 TraceCheckUtils]: 47: Hoare triple {8141#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8141#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2018-11-23 13:09:15,346 INFO L273 TraceCheckUtils]: 48: Hoare triple {8141#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8142#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2018-11-23 13:09:15,347 INFO L273 TraceCheckUtils]: 49: Hoare triple {8142#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 99); {8142#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2018-11-23 13:09:15,348 INFO L273 TraceCheckUtils]: 50: Hoare triple {8142#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {8143#(and (<= main_~x~0 46) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:09:15,349 INFO L273 TraceCheckUtils]: 51: Hoare triple {8143#(and (<= main_~x~0 46) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {8119#false} is VALID [2018-11-23 13:09:15,349 INFO L256 TraceCheckUtils]: 52: Hoare triple {8119#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {8119#false} is VALID [2018-11-23 13:09:15,349 INFO L273 TraceCheckUtils]: 53: Hoare triple {8119#false} ~cond := #in~cond; {8119#false} is VALID [2018-11-23 13:09:15,350 INFO L273 TraceCheckUtils]: 54: Hoare triple {8119#false} assume 0 == ~cond; {8119#false} is VALID [2018-11-23 13:09:15,350 INFO L273 TraceCheckUtils]: 55: Hoare triple {8119#false} assume !false; {8119#false} is VALID [2018-11-23 13:09:15,354 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:15,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:09:15,355 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:09:15,364 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1