/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_11.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 03:43:08,515 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 03:43:08,548 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 03:43:08,565 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 03:43:08,566 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 03:43:08,566 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 03:43:08,568 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 03:43:08,576 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 03:43:08,577 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 03:43:08,581 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 03:43:08,582 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 03:43:08,582 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 03:43:08,583 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 03:43:08,583 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 03:43:08,584 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 03:43:08,584 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 03:43:08,584 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 03:43:08,585 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 03:43:08,586 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 03:43:08,587 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 03:43:08,588 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 03:43:08,590 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 03:43:08,592 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 03:43:08,594 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 03:43:08,596 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 03:43:08,604 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 03:43:08,605 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 03:43:08,605 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 03:43:08,605 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 03:43:08,606 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 03:43:08,606 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 03:43:08,606 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 03:43:08,607 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 03:43:08,607 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 03:43:08,608 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 03:43:08,608 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 03:43:08,608 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 03:43:08,609 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 03:43:08,609 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 03:43:08,609 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 03:43:08,610 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 03:43:08,611 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 03:43:08,612 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 03:43:08,620 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 03:43:08,621 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 03:43:08,622 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 03:43:08,622 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 03:43:08,622 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 03:43:08,622 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 03:43:08,622 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 03:43:08,622 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 03:43:08,622 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 03:43:08,623 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 03:43:08,623 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 03:43:08,623 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 03:43:08,623 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 03:43:08,623 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 03:43:08,623 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 03:43:08,623 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 03:43:08,623 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 03:43:08,624 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 03:43:08,624 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:43:08,624 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 03:43:08,624 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 03:43:08,624 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 03:43:08,624 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 03:43:08,624 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 03:43:08,624 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 03:43:08,624 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 03:43:08,774 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 03:43:08,789 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 03:43:08,791 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 03:43:08,792 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 03:43:08,792 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 03:43:08,793 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_11.c [2022-04-28 03:43:08,840 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c36bd9548/71ed6b0016a94f35b0c9d48d708c5988/FLAGad7c702cf [2022-04-28 03:43:09,189 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 03:43:09,189 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_11.c [2022-04-28 03:43:09,194 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c36bd9548/71ed6b0016a94f35b0c9d48d708c5988/FLAGad7c702cf [2022-04-28 03:43:09,204 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c36bd9548/71ed6b0016a94f35b0c9d48d708c5988 [2022-04-28 03:43:09,205 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 03:43:09,208 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 03:43:09,209 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 03:43:09,209 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 03:43:09,211 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 03:43:09,215 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:43:09" (1/1) ... [2022-04-28 03:43:09,216 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b1e0312 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:43:09, skipping insertion in model container [2022-04-28 03:43:09,216 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:43:09" (1/1) ... [2022-04-28 03:43:09,220 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 03:43:09,229 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 03:43:09,351 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_11.c[319,332] [2022-04-28 03:43:09,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:43:09,393 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 03:43:09,400 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_11.c[319,332] [2022-04-28 03:43:09,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:43:09,409 INFO L208 MainTranslator]: Completed translation [2022-04-28 03:43:09,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:43:09 WrapperNode [2022-04-28 03:43:09,410 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 03:43:09,410 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 03:43:09,410 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 03:43:09,410 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 03:43:09,416 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:43:09" (1/1) ... [2022-04-28 03:43:09,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:43:09" (1/1) ... [2022-04-28 03:43:09,421 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:43:09" (1/1) ... [2022-04-28 03:43:09,421 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:43:09" (1/1) ... [2022-04-28 03:43:09,431 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:43:09" (1/1) ... [2022-04-28 03:43:09,433 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:43:09" (1/1) ... [2022-04-28 03:43:09,434 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:43:09" (1/1) ... [2022-04-28 03:43:09,436 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 03:43:09,436 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 03:43:09,436 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 03:43:09,436 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 03:43:09,437 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:43:09" (1/1) ... [2022-04-28 03:43:09,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:43:09,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:43:09,468 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 03:43:09,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 03:43:09,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 03:43:09,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 03:43:09,494 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 03:43:09,494 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 03:43:09,495 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 03:43:09,495 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 03:43:09,495 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 03:43:09,495 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 03:43:09,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 03:43:09,495 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 03:43:09,496 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 03:43:09,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 03:43:09,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 03:43:09,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 03:43:09,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 03:43:09,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 03:43:09,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 03:43:09,538 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 03:43:09,539 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 03:43:09,650 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 03:43:09,654 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 03:43:09,654 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 03:43:09,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:43:09 BoogieIcfgContainer [2022-04-28 03:43:09,655 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 03:43:09,656 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 03:43:09,656 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 03:43:09,658 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 03:43:09,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:43:09" (1/3) ... [2022-04-28 03:43:09,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62e49aa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:43:09, skipping insertion in model container [2022-04-28 03:43:09,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:43:09" (2/3) ... [2022-04-28 03:43:09,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62e49aa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:43:09, skipping insertion in model container [2022-04-28 03:43:09,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:43:09" (3/3) ... [2022-04-28 03:43:09,660 INFO L111 eAbstractionObserver]: Analyzing ICFG mono-crafted_11.c [2022-04-28 03:43:09,668 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 03:43:09,668 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 03:43:09,724 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 03:43:09,736 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5cb1bc1c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4f3cbc5 [2022-04-28 03:43:09,736 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 03:43:09,745 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 03:43:09,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 03:43:09,749 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:43:09,749 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:43:09,750 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:43:09,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:43:09,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1325153485, now seen corresponding path program 1 times [2022-04-28 03:43:09,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:09,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1159195162] [2022-04-28 03:43:09,765 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:43:09,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1325153485, now seen corresponding path program 2 times [2022-04-28 03:43:09,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:43:09,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352647383] [2022-04-28 03:43:09,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:09,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:43:09,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:09,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:43:09,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:09,917 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {23#true} is VALID [2022-04-28 03:43:09,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-28 03:43:09,917 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #41#return; {23#true} is VALID [2022-04-28 03:43:09,932 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:43:09,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {23#true} is VALID [2022-04-28 03:43:09,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-28 03:43:09,933 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #41#return; {23#true} is VALID [2022-04-28 03:43:09,933 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret5 := main(); {23#true} is VALID [2022-04-28 03:43:09,933 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} ~x~0 := 0; {23#true} is VALID [2022-04-28 03:43:09,933 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} assume !true; {24#false} is VALID [2022-04-28 03:43:09,934 INFO L272 TraceCheckUtils]: 7: Hoare triple {24#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {24#false} is VALID [2022-04-28 03:43:09,934 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2022-04-28 03:43:09,934 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2022-04-28 03:43:09,934 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-28 03:43:09,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:43:09,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:43:09,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352647383] [2022-04-28 03:43:09,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352647383] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:43:09,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:43:09,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 03:43:09,938 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:43:09,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1159195162] [2022-04-28 03:43:09,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1159195162] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:43:09,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:43:09,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 03:43:09,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327919643] [2022-04-28 03:43:09,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:43:09,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 03:43:09,959 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:43:09,961 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:09,972 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:09,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 03:43:09,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:09,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 03:43:09,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 03:43:09,989 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:10,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:10,031 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-04-28 03:43:10,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 03:43:10,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 03:43:10,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:43:10,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:10,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-04-28 03:43:10,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:10,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-04-28 03:43:10,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 36 transitions. [2022-04-28 03:43:10,068 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:10,073 INFO L225 Difference]: With dead ends: 32 [2022-04-28 03:43:10,073 INFO L226 Difference]: Without dead ends: 13 [2022-04-28 03:43:10,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 03:43:10,077 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:43:10,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 23 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:43:10,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-28 03:43:10,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-28 03:43:10,094 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:43:10,095 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:10,095 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:10,096 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:10,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:10,097 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-28 03:43:10,097 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-28 03:43:10,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:10,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:10,098 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-28 03:43:10,098 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-28 03:43:10,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:10,099 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-28 03:43:10,100 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-28 03:43:10,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:10,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:10,100 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:43:10,100 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:43:10,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:10,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-04-28 03:43:10,102 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2022-04-28 03:43:10,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:43:10,102 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-04-28 03:43:10,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:10,103 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 14 transitions. [2022-04-28 03:43:10,115 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:10,116 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-28 03:43:10,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 03:43:10,116 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:43:10,116 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:43:10,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 03:43:10,117 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:43:10,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:43:10,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1315918275, now seen corresponding path program 1 times [2022-04-28 03:43:10,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:10,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1332986870] [2022-04-28 03:43:10,122 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:43:10,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1315918275, now seen corresponding path program 2 times [2022-04-28 03:43:10,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:43:10,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146968242] [2022-04-28 03:43:10,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:10,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:43:10,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:10,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:43:10,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:10,240 INFO L290 TraceCheckUtils]: 0: Hoare triple {153#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {147#true} is VALID [2022-04-28 03:43:10,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {147#true} assume true; {147#true} is VALID [2022-04-28 03:43:10,241 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {147#true} {147#true} #41#return; {147#true} is VALID [2022-04-28 03:43:10,242 INFO L272 TraceCheckUtils]: 0: Hoare triple {147#true} call ULTIMATE.init(); {153#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:43:10,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {153#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {147#true} is VALID [2022-04-28 03:43:10,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {147#true} assume true; {147#true} is VALID [2022-04-28 03:43:10,242 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {147#true} {147#true} #41#return; {147#true} is VALID [2022-04-28 03:43:10,242 INFO L272 TraceCheckUtils]: 4: Hoare triple {147#true} call #t~ret5 := main(); {147#true} is VALID [2022-04-28 03:43:10,243 INFO L290 TraceCheckUtils]: 5: Hoare triple {147#true} ~x~0 := 0; {152#(= main_~x~0 0)} is VALID [2022-04-28 03:43:10,246 INFO L290 TraceCheckUtils]: 6: Hoare triple {152#(= main_~x~0 0)} assume !(~x~0 % 4294967296 < 100000000); {148#false} is VALID [2022-04-28 03:43:10,247 INFO L272 TraceCheckUtils]: 7: Hoare triple {148#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {148#false} is VALID [2022-04-28 03:43:10,247 INFO L290 TraceCheckUtils]: 8: Hoare triple {148#false} ~cond := #in~cond; {148#false} is VALID [2022-04-28 03:43:10,247 INFO L290 TraceCheckUtils]: 9: Hoare triple {148#false} assume 0 == ~cond; {148#false} is VALID [2022-04-28 03:43:10,247 INFO L290 TraceCheckUtils]: 10: Hoare triple {148#false} assume !false; {148#false} is VALID [2022-04-28 03:43:10,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:43:10,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:43:10,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146968242] [2022-04-28 03:43:10,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146968242] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:43:10,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:43:10,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:43:10,248 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:43:10,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1332986870] [2022-04-28 03:43:10,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1332986870] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:43:10,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:43:10,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:43:10,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467583009] [2022-04-28 03:43:10,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:43:10,250 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 03:43:10,250 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:43:10,250 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:10,262 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:10,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 03:43:10,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:10,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 03:43:10,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 03:43:10,265 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:10,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:10,357 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-04-28 03:43:10,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 03:43:10,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 03:43:10,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:43:10,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:10,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-28 03:43:10,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:10,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-28 03:43:10,360 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 26 transitions. [2022-04-28 03:43:10,381 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:10,382 INFO L225 Difference]: With dead ends: 22 [2022-04-28 03:43:10,382 INFO L226 Difference]: Without dead ends: 15 [2022-04-28 03:43:10,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 03:43:10,383 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:43:10,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 19 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:43:10,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-28 03:43:10,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-28 03:43:10,387 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:43:10,387 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:10,387 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:10,387 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:10,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:10,388 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-28 03:43:10,389 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 03:43:10,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:10,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:10,389 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 03:43:10,389 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 03:43:10,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:10,390 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-28 03:43:10,390 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 03:43:10,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:10,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:10,391 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:43:10,391 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:43:10,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:10,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-28 03:43:10,392 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2022-04-28 03:43:10,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:43:10,392 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-28 03:43:10,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:10,392 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 16 transitions. [2022-04-28 03:43:10,406 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:10,406 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 03:43:10,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 03:43:10,406 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:43:10,407 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:43:10,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 03:43:10,407 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:43:10,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:43:10,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1372110560, now seen corresponding path program 1 times [2022-04-28 03:43:10,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:10,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2097850183] [2022-04-28 03:43:13,275 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:43:13,454 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:43:13,456 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:43:13,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1209153456, now seen corresponding path program 1 times [2022-04-28 03:43:13,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:43:13,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718943105] [2022-04-28 03:43:13,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:13,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:43:13,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:13,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:43:13,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:13,534 INFO L290 TraceCheckUtils]: 0: Hoare triple {269#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {262#true} is VALID [2022-04-28 03:43:13,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-28 03:43:13,534 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {262#true} {262#true} #41#return; {262#true} is VALID [2022-04-28 03:43:13,535 INFO L272 TraceCheckUtils]: 0: Hoare triple {262#true} call ULTIMATE.init(); {269#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:43:13,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {269#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {262#true} is VALID [2022-04-28 03:43:13,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-28 03:43:13,535 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {262#true} {262#true} #41#return; {262#true} is VALID [2022-04-28 03:43:13,536 INFO L272 TraceCheckUtils]: 4: Hoare triple {262#true} call #t~ret5 := main(); {262#true} is VALID [2022-04-28 03:43:13,536 INFO L290 TraceCheckUtils]: 5: Hoare triple {262#true} ~x~0 := 0; {267#(= main_~x~0 0)} is VALID [2022-04-28 03:43:13,537 INFO L290 TraceCheckUtils]: 6: Hoare triple {267#(= main_~x~0 0)} [47] L9-2-->L8-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_11 v_main_~x~0_10)) (.cse2 (mod v_main_~x~0_11 4294967296)) (.cse1 (= |v_main_#t~post4_4| |v_main_#t~post4_3|))) (or (and .cse0 .cse1) (and (<= (div (+ (* (- 1) v_main_~x~0_10) 10000000) (- 4294967296)) (+ (div (+ v_main_~x~0_11 (- 4294967295)) 4294967296) 1)) (< .cse2 10000000) (< v_main_~x~0_11 v_main_~x~0_10)) (and .cse0 (<= 10000000 .cse2) .cse1))) InVars {main_~x~0=v_main_~x~0_11, main_#t~post4=|v_main_#t~post4_4|} OutVars{main_~x~0=v_main_~x~0_10, main_#t~post4=|v_main_#t~post4_3|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {268#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 10000001))} is VALID [2022-04-28 03:43:13,537 INFO L290 TraceCheckUtils]: 7: Hoare triple {268#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 10000001))} [46] L8-2_primed-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {263#false} is VALID [2022-04-28 03:43:13,538 INFO L272 TraceCheckUtils]: 8: Hoare triple {263#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {263#false} is VALID [2022-04-28 03:43:13,538 INFO L290 TraceCheckUtils]: 9: Hoare triple {263#false} ~cond := #in~cond; {263#false} is VALID [2022-04-28 03:43:13,538 INFO L290 TraceCheckUtils]: 10: Hoare triple {263#false} assume 0 == ~cond; {263#false} is VALID [2022-04-28 03:43:13,538 INFO L290 TraceCheckUtils]: 11: Hoare triple {263#false} assume !false; {263#false} is VALID [2022-04-28 03:43:13,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:43:13,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:43:13,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718943105] [2022-04-28 03:43:13,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718943105] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:43:13,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:43:13,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:43:13,601 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:43:13,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2097850183] [2022-04-28 03:43:13,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2097850183] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:43:13,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:43:13,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:43:13,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705804634] [2022-04-28 03:43:13,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:43:13,603 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-28 03:43:13,603 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:43:13,603 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:13,613 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:13,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 03:43:13,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:13,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 03:43:13,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-04-28 03:43:13,614 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:13,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:13,715 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-28 03:43:13,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 03:43:13,715 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-28 03:43:13,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:43:13,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:13,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-04-28 03:43:13,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:13,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-04-28 03:43:13,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 24 transitions. [2022-04-28 03:43:13,739 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:13,740 INFO L225 Difference]: With dead ends: 22 [2022-04-28 03:43:13,740 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 03:43:13,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-04-28 03:43:13,741 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:43:13,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 23 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:43:13,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 03:43:13,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-28 03:43:13,749 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:43:13,750 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:13,750 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:13,750 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:13,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:13,751 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-28 03:43:13,751 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 03:43:13,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:13,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:13,751 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 03:43:13,752 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 03:43:13,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:13,752 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-28 03:43:13,752 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 03:43:13,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:13,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:13,753 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:43:13,753 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:43:13,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:13,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-28 03:43:13,754 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2022-04-28 03:43:13,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:43:13,754 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-28 03:43:13,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:13,754 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-28 03:43:13,772 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:13,772 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 03:43:13,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 03:43:13,772 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:43:13,772 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:43:13,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 03:43:13,772 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:43:13,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:43:13,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1059749499, now seen corresponding path program 1 times [2022-04-28 03:43:13,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:13,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2019600182] [2022-04-28 03:43:15,678 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:43:15,828 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:43:16,140 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:43:16,142 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:43:16,146 INFO L85 PathProgramCache]: Analyzing trace with hash 603671471, now seen corresponding path program 1 times [2022-04-28 03:43:16,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:43:16,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499838091] [2022-04-28 03:43:16,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:16,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:43:16,157 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 2) .v_it_3.0) (* (- 1) main_~x~0_6) (* 4294967296 (div (+ (* 2 .v_it_3.0) main_~x~0_6) 4294967296)) 100000000) 0)) [2022-04-28 03:43:16,160 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 2) .v_it_3.0) (* (- 1) main_~x~0_6) (* 4294967296 (div (+ (* 2 .v_it_3.0) main_~x~0_6) 4294967296)) 10000000) 0) [2022-04-28 03:43:16,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:16,253 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 2) .v_it_3.1) (* (- 1) main_~x~0_6) (* 4294967296 (div (+ (* 2 .v_it_3.1) main_~x~0_6) 4294967296)) 100000000) 0)) [2022-04-28 03:43:16,254 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 2) .v_it_3.1) (* (- 1) main_~x~0_6) (* 4294967296 (div (+ (* 2 .v_it_3.1) main_~x~0_6) 4294967296)) 10000000) 0) [2022-04-28 03:43:16,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:43:16,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:16,386 INFO L290 TraceCheckUtils]: 0: Hoare triple {401#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {390#true} is VALID [2022-04-28 03:43:16,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {390#true} assume true; {390#true} is VALID [2022-04-28 03:43:16,386 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {390#true} {390#true} #41#return; {390#true} is VALID [2022-04-28 03:43:16,387 INFO L272 TraceCheckUtils]: 0: Hoare triple {390#true} call ULTIMATE.init(); {401#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:43:16,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {401#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {390#true} is VALID [2022-04-28 03:43:16,387 INFO L290 TraceCheckUtils]: 2: Hoare triple {390#true} assume true; {390#true} is VALID [2022-04-28 03:43:16,389 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {390#true} {390#true} #41#return; {390#true} is VALID [2022-04-28 03:43:16,390 INFO L272 TraceCheckUtils]: 4: Hoare triple {390#true} call #t~ret5 := main(); {390#true} is VALID [2022-04-28 03:43:16,390 INFO L290 TraceCheckUtils]: 5: Hoare triple {390#true} ~x~0 := 0; {395#(= main_~x~0 0)} is VALID [2022-04-28 03:43:16,391 INFO L290 TraceCheckUtils]: 6: Hoare triple {395#(= main_~x~0 0)} [49] L9-2-->L8-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_18 v_main_~x~0_17)) (.cse2 (= |v_main_#t~post4_9| |v_main_#t~post4_8|)) (.cse1 (mod v_main_~x~0_18 4294967296))) (or (and .cse0 (<= 10000000 .cse1) .cse2) (and .cse0 .cse2) (and (<= (div (+ 10000000 (* (- 1) v_main_~x~0_17)) (- 4294967296)) (+ (div (+ v_main_~x~0_18 (- 4294967295)) 4294967296) 1)) (< v_main_~x~0_18 v_main_~x~0_17) (< .cse1 10000000)))) InVars {main_~x~0=v_main_~x~0_18, main_#t~post4=|v_main_#t~post4_9|} OutVars{main_~x~0=v_main_~x~0_17, main_#t~post4=|v_main_#t~post4_8|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {396#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= (div (+ (* (- 1) main_~x~0) 10000000) (- 4294967296)) 0))} is VALID [2022-04-28 03:43:16,392 INFO L290 TraceCheckUtils]: 7: Hoare triple {396#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= (div (+ (* (- 1) main_~x~0) 10000000) (- 4294967296)) 0))} [50] L8-2_primed-->L9-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {396#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= (div (+ (* (- 1) main_~x~0) 10000000) (- 4294967296)) 0))} is VALID [2022-04-28 03:43:16,395 INFO L290 TraceCheckUtils]: 8: Hoare triple {396#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= (div (+ (* (- 1) main_~x~0) 10000000) (- 4294967296)) 0))} [51] L9-2-->L8-2_primed: Formula: (let ((.cse4 (mod v_main_~x~0_20 4294967296))) (let ((.cse0 (< .cse4 100000000)) (.cse1 (<= 10000000 .cse4)) (.cse2 (= v_main_~x~0_20 v_main_~x~0_19))) (or (and (or (not .cse0) (not .cse1)) .cse2) (and (= (mod (+ v_main_~x~0_20 v_main_~x~0_19) 2) 0) .cse0 (< 0 (div (+ v_main_~x~0_19 (* (- 1) v_main_~x~0_20)) 2)) (forall ((v_it_3 Int)) (or (let ((.cse3 (mod (+ (* v_it_3 2) v_main_~x~0_20) 4294967296))) (and (<= 10000000 .cse3) (< .cse3 100000000))) (not (<= 1 v_it_3)) (not (<= (+ v_it_3 1) (div (+ v_main_~x~0_19 (* (- 1) v_main_~x~0_20)) 2))))) .cse1) .cse2))) InVars {main_~x~0=v_main_~x~0_20} OutVars{main_~x~0=v_main_~x~0_19} AuxVars[] AssignedVars[main_~x~0] {397#(or (<= main_~x~0 (* (div main_~x~0 2) 2)) (<= (div main_~x~0 2) (+ 4999999 (* (div main_~x~0 4294967296) 2147483648))))} is VALID [2022-04-28 03:43:16,397 INFO L290 TraceCheckUtils]: 9: Hoare triple {397#(or (<= main_~x~0 (* (div main_~x~0 2) 2)) (<= (div main_~x~0 2) (+ 4999999 (* (div main_~x~0 4294967296) 2147483648))))} [48] L8-2_primed-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {398#(<= main_~x~0 (* (div main_~x~0 2) 2))} is VALID [2022-04-28 03:43:16,399 INFO L272 TraceCheckUtils]: 10: Hoare triple {398#(<= main_~x~0 (* (div main_~x~0 2) 2))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {399#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:43:16,400 INFO L290 TraceCheckUtils]: 11: Hoare triple {399#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {400#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:43:16,400 INFO L290 TraceCheckUtils]: 12: Hoare triple {400#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {391#false} is VALID [2022-04-28 03:43:16,400 INFO L290 TraceCheckUtils]: 13: Hoare triple {391#false} assume !false; {391#false} is VALID [2022-04-28 03:43:16,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:43:16,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:43:16,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499838091] [2022-04-28 03:43:16,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499838091] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:43:16,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142021497] [2022-04-28 03:43:16,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:16,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:43:16,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:43:16,416 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:43:16,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 03:43:16,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:16,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 03:43:16,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:16,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:43:25,882 WARN L833 $PredicateComparison]: unable to prove that (and (not (< (mod c_main_~x~0 4294967296) 100000000)) (exists ((aux_div_aux_mod_v_main_~x~0_28_58_106 Int) (aux_div_v_main_~x~0_28_58 Int)) (and (<= aux_div_v_main_~x~0_28_58 0) (< 0 (+ aux_div_aux_mod_v_main_~x~0_28_58_106 1)) (exists ((aux_div_aux_mod_aux_mod_v_main_~x~0_28_58_106_59 Int)) (let ((.cse0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_28_58_106_59 2))) (and (<= 10000000 (mod (+ .cse0 (* 4294967295 c_main_~x~0)) 4294967296)) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (let ((.cse1 (mod (+ (* v_it_3 2) (* aux_div_aux_mod_aux_mod_v_main_~x~0_28_58_106_59 2) (* 4294967295 c_main_~x~0)) 4294967296))) (and (< .cse1 100000000) (<= 10000000 .cse1))) (not (<= (+ aux_div_aux_mod_aux_mod_v_main_~x~0_28_58_106_59 v_it_3 (* aux_div_aux_mod_v_main_~x~0_28_58_106 2147483648) 1) c_main_~x~0)))) (<= (+ (* aux_div_aux_mod_v_main_~x~0_28_58_106 4294967296) .cse0) (+ (* aux_div_v_main_~x~0_28_58 4294967296) 10000000 c_main_~x~0)) (< (+ aux_div_aux_mod_aux_mod_v_main_~x~0_28_58_106_59 (* aux_div_aux_mod_v_main_~x~0_28_58_106 2147483648)) c_main_~x~0) (<= c_main_~x~0 .cse0))))))) is different from false [2022-04-28 03:43:34,496 INFO L272 TraceCheckUtils]: 0: Hoare triple {390#true} call ULTIMATE.init(); {390#true} is VALID [2022-04-28 03:43:34,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {390#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {390#true} is VALID [2022-04-28 03:43:34,499 INFO L290 TraceCheckUtils]: 2: Hoare triple {390#true} assume true; {390#true} is VALID [2022-04-28 03:43:34,499 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {390#true} {390#true} #41#return; {390#true} is VALID [2022-04-28 03:43:34,500 INFO L272 TraceCheckUtils]: 4: Hoare triple {390#true} call #t~ret5 := main(); {390#true} is VALID [2022-04-28 03:43:34,500 INFO L290 TraceCheckUtils]: 5: Hoare triple {390#true} ~x~0 := 0; {395#(= main_~x~0 0)} is VALID [2022-04-28 03:43:34,501 INFO L290 TraceCheckUtils]: 6: Hoare triple {395#(= main_~x~0 0)} [49] L9-2-->L8-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_18 v_main_~x~0_17)) (.cse2 (= |v_main_#t~post4_9| |v_main_#t~post4_8|)) (.cse1 (mod v_main_~x~0_18 4294967296))) (or (and .cse0 (<= 10000000 .cse1) .cse2) (and .cse0 .cse2) (and (<= (div (+ 10000000 (* (- 1) v_main_~x~0_17)) (- 4294967296)) (+ (div (+ v_main_~x~0_18 (- 4294967295)) 4294967296) 1)) (< v_main_~x~0_18 v_main_~x~0_17) (< .cse1 10000000)))) InVars {main_~x~0=v_main_~x~0_18, main_#t~post4=|v_main_#t~post4_9|} OutVars{main_~x~0=v_main_~x~0_17, main_#t~post4=|v_main_#t~post4_8|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {396#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= (div (+ (* (- 1) main_~x~0) 10000000) (- 4294967296)) 0))} is VALID [2022-04-28 03:43:34,501 INFO L290 TraceCheckUtils]: 7: Hoare triple {396#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= (div (+ (* (- 1) main_~x~0) 10000000) (- 4294967296)) 0))} [50] L8-2_primed-->L9-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {396#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= (div (+ (* (- 1) main_~x~0) 10000000) (- 4294967296)) 0))} is VALID [2022-04-28 03:43:34,570 INFO L290 TraceCheckUtils]: 8: Hoare triple {396#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= (div (+ (* (- 1) main_~x~0) 10000000) (- 4294967296)) 0))} [51] L9-2-->L8-2_primed: Formula: (let ((.cse4 (mod v_main_~x~0_20 4294967296))) (let ((.cse0 (< .cse4 100000000)) (.cse1 (<= 10000000 .cse4)) (.cse2 (= v_main_~x~0_20 v_main_~x~0_19))) (or (and (or (not .cse0) (not .cse1)) .cse2) (and (= (mod (+ v_main_~x~0_20 v_main_~x~0_19) 2) 0) .cse0 (< 0 (div (+ v_main_~x~0_19 (* (- 1) v_main_~x~0_20)) 2)) (forall ((v_it_3 Int)) (or (let ((.cse3 (mod (+ (* v_it_3 2) v_main_~x~0_20) 4294967296))) (and (<= 10000000 .cse3) (< .cse3 100000000))) (not (<= 1 v_it_3)) (not (<= (+ v_it_3 1) (div (+ v_main_~x~0_19 (* (- 1) v_main_~x~0_20)) 2))))) .cse1) .cse2))) InVars {main_~x~0=v_main_~x~0_20} OutVars{main_~x~0=v_main_~x~0_19} AuxVars[] AssignedVars[main_~x~0] {429#(exists ((aux_div_aux_mod_v_main_~x~0_28_58_106 Int) (aux_div_v_main_~x~0_28_58 Int)) (and (<= aux_div_v_main_~x~0_28_58 0) (< 0 (+ aux_div_aux_mod_v_main_~x~0_28_58_106 1)) (or (and (<= (* aux_div_aux_mod_v_main_~x~0_28_58_106 4294967296) main_~x~0) (<= main_~x~0 (+ (* aux_div_v_main_~x~0_28_58 4294967296) 10000000))) (exists ((aux_div_aux_mod_aux_mod_v_main_~x~0_28_58_106_59 Int)) (and (<= main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_28_58_106_59 2)) (forall ((v_it_3 Int)) (or (not (<= (+ aux_div_aux_mod_aux_mod_v_main_~x~0_28_58_106_59 v_it_3 (* aux_div_aux_mod_v_main_~x~0_28_58_106 2147483648) 1) main_~x~0)) (not (<= 1 v_it_3)) (and (<= 10000000 (mod (+ (* v_it_3 2) (* aux_div_aux_mod_aux_mod_v_main_~x~0_28_58_106_59 2) (* main_~x~0 4294967295)) 4294967296)) (< (mod (+ (* v_it_3 2) (* aux_div_aux_mod_aux_mod_v_main_~x~0_28_58_106_59 2) (* main_~x~0 4294967295)) 4294967296) 100000000)))) (< (+ aux_div_aux_mod_aux_mod_v_main_~x~0_28_58_106_59 (* aux_div_aux_mod_v_main_~x~0_28_58_106 2147483648)) main_~x~0) (<= (+ (* aux_div_aux_mod_v_main_~x~0_28_58_106 4294967296) (* aux_div_aux_mod_aux_mod_v_main_~x~0_28_58_106_59 2)) (+ (* aux_div_v_main_~x~0_28_58 4294967296) main_~x~0 10000000)) (<= 10000000 (mod (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_28_58_106_59 2) (* main_~x~0 4294967295)) 4294967296)))))))} is VALID [2022-04-28 03:43:36,582 WARN L290 TraceCheckUtils]: 9: Hoare triple {429#(exists ((aux_div_aux_mod_v_main_~x~0_28_58_106 Int) (aux_div_v_main_~x~0_28_58 Int)) (and (<= aux_div_v_main_~x~0_28_58 0) (< 0 (+ aux_div_aux_mod_v_main_~x~0_28_58_106 1)) (or (and (<= (* aux_div_aux_mod_v_main_~x~0_28_58_106 4294967296) main_~x~0) (<= main_~x~0 (+ (* aux_div_v_main_~x~0_28_58 4294967296) 10000000))) (exists ((aux_div_aux_mod_aux_mod_v_main_~x~0_28_58_106_59 Int)) (and (<= main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_28_58_106_59 2)) (forall ((v_it_3 Int)) (or (not (<= (+ aux_div_aux_mod_aux_mod_v_main_~x~0_28_58_106_59 v_it_3 (* aux_div_aux_mod_v_main_~x~0_28_58_106 2147483648) 1) main_~x~0)) (not (<= 1 v_it_3)) (and (<= 10000000 (mod (+ (* v_it_3 2) (* aux_div_aux_mod_aux_mod_v_main_~x~0_28_58_106_59 2) (* main_~x~0 4294967295)) 4294967296)) (< (mod (+ (* v_it_3 2) (* aux_div_aux_mod_aux_mod_v_main_~x~0_28_58_106_59 2) (* main_~x~0 4294967295)) 4294967296) 100000000)))) (< (+ aux_div_aux_mod_aux_mod_v_main_~x~0_28_58_106_59 (* aux_div_aux_mod_v_main_~x~0_28_58_106 2147483648)) main_~x~0) (<= (+ (* aux_div_aux_mod_v_main_~x~0_28_58_106 4294967296) (* aux_div_aux_mod_aux_mod_v_main_~x~0_28_58_106_59 2)) (+ (* aux_div_v_main_~x~0_28_58 4294967296) main_~x~0 10000000)) (<= 10000000 (mod (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_28_58_106_59 2) (* main_~x~0 4294967295)) 4294967296)))))))} [48] L8-2_primed-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {433#(and (exists ((aux_div_aux_mod_v_main_~x~0_28_58_106 Int) (aux_div_v_main_~x~0_28_58 Int)) (and (<= aux_div_v_main_~x~0_28_58 0) (< 0 (+ aux_div_aux_mod_v_main_~x~0_28_58_106 1)) (exists ((aux_div_aux_mod_aux_mod_v_main_~x~0_28_58_106_59 Int)) (and (<= main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_28_58_106_59 2)) (forall ((v_it_3 Int)) (or (not (<= (+ aux_div_aux_mod_aux_mod_v_main_~x~0_28_58_106_59 v_it_3 (* aux_div_aux_mod_v_main_~x~0_28_58_106 2147483648) 1) main_~x~0)) (not (<= 1 v_it_3)) (and (<= 10000000 (mod (+ (* v_it_3 2) (* aux_div_aux_mod_aux_mod_v_main_~x~0_28_58_106_59 2) (* main_~x~0 4294967295)) 4294967296)) (< (mod (+ (* v_it_3 2) (* aux_div_aux_mod_aux_mod_v_main_~x~0_28_58_106_59 2) (* main_~x~0 4294967295)) 4294967296) 100000000)))) (< (+ aux_div_aux_mod_aux_mod_v_main_~x~0_28_58_106_59 (* aux_div_aux_mod_v_main_~x~0_28_58_106 2147483648)) main_~x~0) (<= (+ (* aux_div_aux_mod_v_main_~x~0_28_58_106 4294967296) (* aux_div_aux_mod_aux_mod_v_main_~x~0_28_58_106_59 2)) (+ (* aux_div_v_main_~x~0_28_58 4294967296) main_~x~0 10000000)) (<= 10000000 (mod (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_28_58_106_59 2) (* main_~x~0 4294967295)) 4294967296)))))) (not (< (mod main_~x~0 4294967296) 100000000)))} is UNKNOWN [2022-04-28 03:43:36,591 INFO L272 TraceCheckUtils]: 10: Hoare triple {433#(and (exists ((aux_div_aux_mod_v_main_~x~0_28_58_106 Int) (aux_div_v_main_~x~0_28_58 Int)) (and (<= aux_div_v_main_~x~0_28_58 0) (< 0 (+ aux_div_aux_mod_v_main_~x~0_28_58_106 1)) (exists ((aux_div_aux_mod_aux_mod_v_main_~x~0_28_58_106_59 Int)) (and (<= main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_28_58_106_59 2)) (forall ((v_it_3 Int)) (or (not (<= (+ aux_div_aux_mod_aux_mod_v_main_~x~0_28_58_106_59 v_it_3 (* aux_div_aux_mod_v_main_~x~0_28_58_106 2147483648) 1) main_~x~0)) (not (<= 1 v_it_3)) (and (<= 10000000 (mod (+ (* v_it_3 2) (* aux_div_aux_mod_aux_mod_v_main_~x~0_28_58_106_59 2) (* main_~x~0 4294967295)) 4294967296)) (< (mod (+ (* v_it_3 2) (* aux_div_aux_mod_aux_mod_v_main_~x~0_28_58_106_59 2) (* main_~x~0 4294967295)) 4294967296) 100000000)))) (< (+ aux_div_aux_mod_aux_mod_v_main_~x~0_28_58_106_59 (* aux_div_aux_mod_v_main_~x~0_28_58_106 2147483648)) main_~x~0) (<= (+ (* aux_div_aux_mod_v_main_~x~0_28_58_106 4294967296) (* aux_div_aux_mod_aux_mod_v_main_~x~0_28_58_106_59 2)) (+ (* aux_div_v_main_~x~0_28_58 4294967296) main_~x~0 10000000)) (<= 10000000 (mod (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_28_58_106_59 2) (* main_~x~0 4294967295)) 4294967296)))))) (not (< (mod main_~x~0 4294967296) 100000000)))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {437#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:43:36,592 INFO L290 TraceCheckUtils]: 11: Hoare triple {437#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {441#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:43:36,592 INFO L290 TraceCheckUtils]: 12: Hoare triple {441#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {391#false} is VALID [2022-04-28 03:43:36,592 INFO L290 TraceCheckUtils]: 13: Hoare triple {391#false} assume !false; {391#false} is VALID [2022-04-28 03:43:36,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:43:36,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:44:10,566 INFO L290 TraceCheckUtils]: 13: Hoare triple {391#false} assume !false; {391#false} is VALID [2022-04-28 03:44:10,566 INFO L290 TraceCheckUtils]: 12: Hoare triple {441#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {391#false} is VALID [2022-04-28 03:44:10,567 INFO L290 TraceCheckUtils]: 11: Hoare triple {437#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {441#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:44:10,568 INFO L272 TraceCheckUtils]: 10: Hoare triple {398#(<= main_~x~0 (* (div main_~x~0 2) 2))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {437#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:44:10,568 INFO L290 TraceCheckUtils]: 9: Hoare triple {460#(or (< (mod main_~x~0 4294967296) 100000000) (<= main_~x~0 (* (div main_~x~0 2) 2)))} [48] L8-2_primed-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {398#(<= main_~x~0 (* (div main_~x~0 2) 2))} is VALID [2022-04-28 03:44:12,579 WARN L290 TraceCheckUtils]: 8: Hoare triple {464#(and (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (not (<= 10000000 (mod main_~x~0 4294967296))) (forall ((aux_div_v_main_~x~0_29_31 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_29_31_78_111_56 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_78_111 Int)) (or (<= 2 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_29_31_78_111_56 2)) (exists ((v_it_3 Int)) (and (or (not (< (mod (+ (* v_it_3 2) main_~x~0) 4294967296) 100000000)) (not (<= 10000000 (mod (+ (* v_it_3 2) main_~x~0) 4294967296)))) (<= 1 v_it_3) (<= (+ v_it_3 1) (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_29_31_78_111_56 aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_78_111)))) (< (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_29_31_78_111_56 2) 0) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_78_111 0) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_29_31_78_111_56 2) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_78_111) main_~x~0) (+ (* aux_div_v_main_~x~0_29_31 4294967296) 100000000)) (<= (+ (* aux_div_v_main_~x~0_29_31 4294967296) 4294967296) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_29_31_78_111_56 2) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_78_111) main_~x~0))))) (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (<= (div (+ 99999999 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1))))} [51] L9-2-->L8-2_primed: Formula: (let ((.cse4 (mod v_main_~x~0_20 4294967296))) (let ((.cse0 (< .cse4 100000000)) (.cse1 (<= 10000000 .cse4)) (.cse2 (= v_main_~x~0_20 v_main_~x~0_19))) (or (and (or (not .cse0) (not .cse1)) .cse2) (and (= (mod (+ v_main_~x~0_20 v_main_~x~0_19) 2) 0) .cse0 (< 0 (div (+ v_main_~x~0_19 (* (- 1) v_main_~x~0_20)) 2)) (forall ((v_it_3 Int)) (or (let ((.cse3 (mod (+ (* v_it_3 2) v_main_~x~0_20) 4294967296))) (and (<= 10000000 .cse3) (< .cse3 100000000))) (not (<= 1 v_it_3)) (not (<= (+ v_it_3 1) (div (+ v_main_~x~0_19 (* (- 1) v_main_~x~0_20)) 2))))) .cse1) .cse2))) InVars {main_~x~0=v_main_~x~0_20} OutVars{main_~x~0=v_main_~x~0_19} AuxVars[] AssignedVars[main_~x~0] {460#(or (< (mod main_~x~0 4294967296) 100000000) (<= main_~x~0 (* (div main_~x~0 2) 2)))} is UNKNOWN [2022-04-28 03:44:12,584 INFO L290 TraceCheckUtils]: 7: Hoare triple {464#(and (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (not (<= 10000000 (mod main_~x~0 4294967296))) (forall ((aux_div_v_main_~x~0_29_31 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_29_31_78_111_56 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_78_111 Int)) (or (<= 2 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_29_31_78_111_56 2)) (exists ((v_it_3 Int)) (and (or (not (< (mod (+ (* v_it_3 2) main_~x~0) 4294967296) 100000000)) (not (<= 10000000 (mod (+ (* v_it_3 2) main_~x~0) 4294967296)))) (<= 1 v_it_3) (<= (+ v_it_3 1) (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_29_31_78_111_56 aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_78_111)))) (< (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_29_31_78_111_56 2) 0) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_78_111 0) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_29_31_78_111_56 2) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_78_111) main_~x~0) (+ (* aux_div_v_main_~x~0_29_31 4294967296) 100000000)) (<= (+ (* aux_div_v_main_~x~0_29_31 4294967296) 4294967296) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_29_31_78_111_56 2) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_78_111) main_~x~0))))) (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (<= (div (+ 99999999 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1))))} [50] L8-2_primed-->L9-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {464#(and (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (not (<= 10000000 (mod main_~x~0 4294967296))) (forall ((aux_div_v_main_~x~0_29_31 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_29_31_78_111_56 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_78_111 Int)) (or (<= 2 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_29_31_78_111_56 2)) (exists ((v_it_3 Int)) (and (or (not (< (mod (+ (* v_it_3 2) main_~x~0) 4294967296) 100000000)) (not (<= 10000000 (mod (+ (* v_it_3 2) main_~x~0) 4294967296)))) (<= 1 v_it_3) (<= (+ v_it_3 1) (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_29_31_78_111_56 aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_78_111)))) (< (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_29_31_78_111_56 2) 0) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_78_111 0) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_29_31_78_111_56 2) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_78_111) main_~x~0) (+ (* aux_div_v_main_~x~0_29_31 4294967296) 100000000)) (<= (+ (* aux_div_v_main_~x~0_29_31 4294967296) 4294967296) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_29_31_78_111_56 2) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_78_111) main_~x~0))))) (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (<= (div (+ 99999999 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1))))} is VALID [2022-04-28 03:44:14,213 INFO L290 TraceCheckUtils]: 6: Hoare triple {464#(and (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (not (<= 10000000 (mod main_~x~0 4294967296))) (forall ((aux_div_v_main_~x~0_29_31 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_29_31_78_111_56 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_78_111 Int)) (or (<= 2 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_29_31_78_111_56 2)) (exists ((v_it_3 Int)) (and (or (not (< (mod (+ (* v_it_3 2) main_~x~0) 4294967296) 100000000)) (not (<= 10000000 (mod (+ (* v_it_3 2) main_~x~0) 4294967296)))) (<= 1 v_it_3) (<= (+ v_it_3 1) (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_29_31_78_111_56 aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_78_111)))) (< (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_29_31_78_111_56 2) 0) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_78_111 0) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_29_31_78_111_56 2) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_78_111) main_~x~0) (+ (* aux_div_v_main_~x~0_29_31 4294967296) 100000000)) (<= (+ (* aux_div_v_main_~x~0_29_31 4294967296) 4294967296) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_29_31_78_111_56 2) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_78_111) main_~x~0))))) (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (<= (div (+ 99999999 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1))))} [49] L9-2-->L8-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_18 v_main_~x~0_17)) (.cse2 (= |v_main_#t~post4_9| |v_main_#t~post4_8|)) (.cse1 (mod v_main_~x~0_18 4294967296))) (or (and .cse0 (<= 10000000 .cse1) .cse2) (and .cse0 .cse2) (and (<= (div (+ 10000000 (* (- 1) v_main_~x~0_17)) (- 4294967296)) (+ (div (+ v_main_~x~0_18 (- 4294967295)) 4294967296) 1)) (< v_main_~x~0_18 v_main_~x~0_17) (< .cse1 10000000)))) InVars {main_~x~0=v_main_~x~0_18, main_#t~post4=|v_main_#t~post4_9|} OutVars{main_~x~0=v_main_~x~0_17, main_#t~post4=|v_main_#t~post4_8|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {464#(and (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (not (<= 10000000 (mod main_~x~0 4294967296))) (forall ((aux_div_v_main_~x~0_29_31 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_29_31_78_111_56 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_78_111 Int)) (or (<= 2 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_29_31_78_111_56 2)) (exists ((v_it_3 Int)) (and (or (not (< (mod (+ (* v_it_3 2) main_~x~0) 4294967296) 100000000)) (not (<= 10000000 (mod (+ (* v_it_3 2) main_~x~0) 4294967296)))) (<= 1 v_it_3) (<= (+ v_it_3 1) (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_29_31_78_111_56 aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_78_111)))) (< (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_29_31_78_111_56 2) 0) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_78_111 0) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_29_31_78_111_56 2) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_78_111) main_~x~0) (+ (* aux_div_v_main_~x~0_29_31 4294967296) 100000000)) (<= (+ (* aux_div_v_main_~x~0_29_31 4294967296) 4294967296) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_29_31_78_111_56 2) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_78_111) main_~x~0))))) (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (<= (div (+ 99999999 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1))))} is VALID [2022-04-28 03:44:14,214 INFO L290 TraceCheckUtils]: 5: Hoare triple {390#true} ~x~0 := 0; {464#(and (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (not (<= 10000000 (mod main_~x~0 4294967296))) (forall ((aux_div_v_main_~x~0_29_31 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_29_31_78_111_56 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_78_111 Int)) (or (<= 2 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_29_31_78_111_56 2)) (exists ((v_it_3 Int)) (and (or (not (< (mod (+ (* v_it_3 2) main_~x~0) 4294967296) 100000000)) (not (<= 10000000 (mod (+ (* v_it_3 2) main_~x~0) 4294967296)))) (<= 1 v_it_3) (<= (+ v_it_3 1) (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_29_31_78_111_56 aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_78_111)))) (< (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_29_31_78_111_56 2) 0) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_78_111 0) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_29_31_78_111_56 2) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_78_111) main_~x~0) (+ (* aux_div_v_main_~x~0_29_31 4294967296) 100000000)) (<= (+ (* aux_div_v_main_~x~0_29_31 4294967296) 4294967296) (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_29_31_78_111_56 2) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_78_111) main_~x~0))))) (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (<= (div (+ 99999999 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1))))} is VALID [2022-04-28 03:44:14,214 INFO L272 TraceCheckUtils]: 4: Hoare triple {390#true} call #t~ret5 := main(); {390#true} is VALID [2022-04-28 03:44:14,214 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {390#true} {390#true} #41#return; {390#true} is VALID [2022-04-28 03:44:14,215 INFO L290 TraceCheckUtils]: 2: Hoare triple {390#true} assume true; {390#true} is VALID [2022-04-28 03:44:14,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {390#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {390#true} is VALID [2022-04-28 03:44:14,215 INFO L272 TraceCheckUtils]: 0: Hoare triple {390#true} call ULTIMATE.init(); {390#true} is VALID [2022-04-28 03:44:14,215 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:44:14,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142021497] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:44:14,216 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:44:14,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 15 [2022-04-28 03:44:16,903 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:44:16,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2019600182] [2022-04-28 03:44:16,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2019600182] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:44:16,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:44:16,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 03:44:16,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229697878] [2022-04-28 03:44:16,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:44:16,905 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 03:44:16,905 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:44:16,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:16,923 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:44:16,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 03:44:16,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:44:16,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 03:44:16,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=180, Unknown=2, NotChecked=28, Total=272 [2022-04-28 03:44:16,924 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:17,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:17,936 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-04-28 03:44:17,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 03:44:17,936 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 03:44:17,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:44:17,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:17,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 38 transitions. [2022-04-28 03:44:17,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:17,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 38 transitions. [2022-04-28 03:44:17,939 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 38 transitions. [2022-04-28 03:44:17,993 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:44:17,994 INFO L225 Difference]: With dead ends: 31 [2022-04-28 03:44:17,994 INFO L226 Difference]: Without dead ends: 21 [2022-04-28 03:44:17,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=108, Invalid=356, Unknown=2, NotChecked=40, Total=506 [2022-04-28 03:44:17,995 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 20 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:44:17,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 31 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 03:44:17,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-28 03:44:18,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-28 03:44:18,015 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:44:18,015 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:18,016 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:18,016 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:18,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:18,017 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-04-28 03:44:18,017 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-28 03:44:18,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:44:18,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:44:18,017 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-28 03:44:18,017 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-28 03:44:18,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:18,018 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-04-28 03:44:18,018 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-28 03:44:18,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:44:18,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:44:18,019 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:44:18,019 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:44:18,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:18,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-04-28 03:44:18,019 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 15 [2022-04-28 03:44:18,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:44:18,020 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-04-28 03:44:18,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:18,020 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 24 transitions. [2022-04-28 03:44:18,051 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:44:18,052 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-28 03:44:18,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 03:44:18,052 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:44:18,052 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:44:18,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 03:44:18,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:44:18,253 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:44:18,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:44:18,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1662437453, now seen corresponding path program 2 times [2022-04-28 03:44:18,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:44:18,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [679754974] [2022-04-28 03:44:19,154 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:44:19,618 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:44:19,620 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:44:19,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1641763665, now seen corresponding path program 1 times [2022-04-28 03:44:19,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:44:19,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890244083] [2022-04-28 03:44:19,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:44:19,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:44:19,657 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) main_~x~0_6) (* (- 2) .v_it_5.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_5.0)) 4294967296)) 10000000) 0) [2022-04-28 03:44:19,658 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_6) (* (- 2) .v_it_5.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_5.0)) 4294967296)) 100000000) 0)) [2022-04-28 03:44:19,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:19,712 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) main_~x~0_6) (* (- 2) .v_it_5.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_5.1)) 4294967296)) 10000000) 0) [2022-04-28 03:44:19,712 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_6) (* (- 2) .v_it_5.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_5.1)) 4294967296)) 100000000) 0)) [2022-04-28 03:44:20,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:44:20,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:20,082 INFO L290 TraceCheckUtils]: 0: Hoare triple {662#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {651#true} is VALID [2022-04-28 03:44:20,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {651#true} assume true; {651#true} is VALID [2022-04-28 03:44:20,082 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {651#true} {651#true} #41#return; {651#true} is VALID [2022-04-28 03:44:20,083 INFO L272 TraceCheckUtils]: 0: Hoare triple {651#true} call ULTIMATE.init(); {662#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:44:20,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {662#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {651#true} is VALID [2022-04-28 03:44:20,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {651#true} assume true; {651#true} is VALID [2022-04-28 03:44:20,083 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {651#true} {651#true} #41#return; {651#true} is VALID [2022-04-28 03:44:20,083 INFO L272 TraceCheckUtils]: 4: Hoare triple {651#true} call #t~ret5 := main(); {651#true} is VALID [2022-04-28 03:44:20,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {651#true} ~x~0 := 0; {656#(= main_~x~0 0)} is VALID [2022-04-28 03:44:20,085 INFO L290 TraceCheckUtils]: 6: Hoare triple {656#(= main_~x~0 0)} [53] L9-2-->L8-2_primed: Formula: (let ((.cse0 (mod v_main_~x~0_37 4294967296)) (.cse1 (= v_main_~x~0_37 v_main_~x~0_36)) (.cse2 (= |v_main_#t~post4_16| |v_main_#t~post4_15|))) (or (and (< .cse0 10000000) (<= (div (+ (* (- 1) v_main_~x~0_36) 10000000) (- 4294967296)) (+ (div (+ v_main_~x~0_37 (- 4294967295)) 4294967296) 1)) (< v_main_~x~0_37 v_main_~x~0_36)) (and .cse1 (<= 10000000 .cse0) .cse2) (and .cse1 .cse2))) InVars {main_~x~0=v_main_~x~0_37, main_#t~post4=|v_main_#t~post4_16|} OutVars{main_~x~0=v_main_~x~0_36, main_#t~post4=|v_main_#t~post4_15|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {657#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 10000000))} is VALID [2022-04-28 03:44:20,085 INFO L290 TraceCheckUtils]: 7: Hoare triple {657#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 10000000))} [54] L8-2_primed-->L9-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {657#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 10000000))} is VALID [2022-04-28 03:44:20,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {657#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 10000000))} [55] L9-2-->L8-2_primed: Formula: (let ((.cse4 (mod v_main_~x~0_39 4294967296))) (let ((.cse1 (<= 10000000 .cse4)) (.cse0 (< .cse4 100000000)) (.cse2 (= v_main_~x~0_39 v_main_~x~0_38))) (or (and (or (not .cse0) (not .cse1)) .cse2) (and (forall ((v_it_5 Int)) (or (not (<= 1 v_it_5)) (not (<= (+ v_it_5 1) (div (+ v_main_~x~0_39 (* (- 1) v_main_~x~0_38)) (- 2)))) (let ((.cse3 (mod (+ v_main_~x~0_39 (* v_it_5 2)) 4294967296))) (and (< .cse3 100000000) (<= 10000000 .cse3))))) .cse1 .cse0 (< 0 (div (+ v_main_~x~0_39 (* (- 1) v_main_~x~0_38)) (- 2))) (= (mod (+ v_main_~x~0_39 v_main_~x~0_38) 2) 0)) .cse2))) InVars {main_~x~0=v_main_~x~0_39} OutVars{main_~x~0=v_main_~x~0_38} AuxVars[] AssignedVars[main_~x~0] {658#(or (<= main_~x~0 (* (div main_~x~0 2) 2)) (<= main_~x~0 (+ 10000000 (* 4294967296 (div main_~x~0 4294967296)))))} is VALID [2022-04-28 03:44:20,088 INFO L290 TraceCheckUtils]: 9: Hoare triple {658#(or (<= main_~x~0 (* (div main_~x~0 2) 2)) (<= main_~x~0 (+ 10000000 (* 4294967296 (div main_~x~0 4294967296)))))} [52] L8-2_primed-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {659#(<= main_~x~0 (* (div main_~x~0 2) 2))} is VALID [2022-04-28 03:44:20,089 INFO L272 TraceCheckUtils]: 10: Hoare triple {659#(<= main_~x~0 (* (div main_~x~0 2) 2))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {660#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:44:20,089 INFO L290 TraceCheckUtils]: 11: Hoare triple {660#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {661#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:44:20,090 INFO L290 TraceCheckUtils]: 12: Hoare triple {661#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {652#false} is VALID [2022-04-28 03:44:20,090 INFO L290 TraceCheckUtils]: 13: Hoare triple {652#false} assume !false; {652#false} is VALID [2022-04-28 03:44:20,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:44:20,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:44:20,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890244083] [2022-04-28 03:44:20,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890244083] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:44:20,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789184396] [2022-04-28 03:44:20,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:44:20,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:44:20,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:44:20,092 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:44:20,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 03:44:20,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:20,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 03:44:20,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:20,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:45:34,078 INFO L272 TraceCheckUtils]: 0: Hoare triple {651#true} call ULTIMATE.init(); {651#true} is VALID [2022-04-28 03:45:34,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {651#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {651#true} is VALID [2022-04-28 03:45:34,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {651#true} assume true; {651#true} is VALID [2022-04-28 03:45:34,079 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {651#true} {651#true} #41#return; {651#true} is VALID [2022-04-28 03:45:34,079 INFO L272 TraceCheckUtils]: 4: Hoare triple {651#true} call #t~ret5 := main(); {651#true} is VALID [2022-04-28 03:45:34,080 INFO L290 TraceCheckUtils]: 5: Hoare triple {651#true} ~x~0 := 0; {656#(= main_~x~0 0)} is VALID [2022-04-28 03:45:34,081 INFO L290 TraceCheckUtils]: 6: Hoare triple {656#(= main_~x~0 0)} [53] L9-2-->L8-2_primed: Formula: (let ((.cse0 (mod v_main_~x~0_37 4294967296)) (.cse1 (= v_main_~x~0_37 v_main_~x~0_36)) (.cse2 (= |v_main_#t~post4_16| |v_main_#t~post4_15|))) (or (and (< .cse0 10000000) (<= (div (+ (* (- 1) v_main_~x~0_36) 10000000) (- 4294967296)) (+ (div (+ v_main_~x~0_37 (- 4294967295)) 4294967296) 1)) (< v_main_~x~0_37 v_main_~x~0_36)) (and .cse1 (<= 10000000 .cse0) .cse2) (and .cse1 .cse2))) InVars {main_~x~0=v_main_~x~0_37, main_#t~post4=|v_main_#t~post4_16|} OutVars{main_~x~0=v_main_~x~0_36, main_#t~post4=|v_main_#t~post4_15|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {657#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 10000000))} is VALID [2022-04-28 03:45:34,081 INFO L290 TraceCheckUtils]: 7: Hoare triple {657#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 10000000))} [54] L8-2_primed-->L9-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {657#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 10000000))} is VALID [2022-04-28 03:45:34,218 INFO L290 TraceCheckUtils]: 8: Hoare triple {657#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 10000000))} [55] L9-2-->L8-2_primed: Formula: (let ((.cse4 (mod v_main_~x~0_39 4294967296))) (let ((.cse1 (<= 10000000 .cse4)) (.cse0 (< .cse4 100000000)) (.cse2 (= v_main_~x~0_39 v_main_~x~0_38))) (or (and (or (not .cse0) (not .cse1)) .cse2) (and (forall ((v_it_5 Int)) (or (not (<= 1 v_it_5)) (not (<= (+ v_it_5 1) (div (+ v_main_~x~0_39 (* (- 1) v_main_~x~0_38)) (- 2)))) (let ((.cse3 (mod (+ v_main_~x~0_39 (* v_it_5 2)) 4294967296))) (and (< .cse3 100000000) (<= 10000000 .cse3))))) .cse1 .cse0 (< 0 (div (+ v_main_~x~0_39 (* (- 1) v_main_~x~0_38)) (- 2))) (= (mod (+ v_main_~x~0_39 v_main_~x~0_38) 2) 0)) .cse2))) InVars {main_~x~0=v_main_~x~0_39} OutVars{main_~x~0=v_main_~x~0_38} AuxVars[] AssignedVars[main_~x~0] {690#(exists ((aux_div_v_main_~x~0_47_31 Int)) (and (or (exists ((aux_div_aux_mod_v_main_~x~0_47_31_102 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_47_31_102_45 Int)) (and (<= (+ (* aux_div_v_main_~x~0_47_31 4294967296) (* 2 aux_div_aux_mod_v_main_~x~0_47_31_102)) (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_47_31_102_45) main_~x~0)) (<= 0 (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_47_31_102_45)) (<= 10000000 (mod (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_47_31_102_45) main_~x~0 (* 4294967294 aux_div_aux_mod_v_main_~x~0_47_31_102)) 4294967296)) (< (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_47_31_102_45) 2) (<= (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_47_31_102_45) main_~x~0) (+ 10000000 (* 2 aux_div_aux_mod_v_main_~x~0_47_31_102))) (forall ((v_it_5 Int)) (or (not (<= (+ v_it_5 aux_div_aux_mod_aux_mod_v_main_~x~0_47_31_102_45 1) aux_div_aux_mod_v_main_~x~0_47_31_102)) (not (<= 1 v_it_5)) (and (< (mod (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_47_31_102_45) main_~x~0 (* v_it_5 2) (* 4294967294 aux_div_aux_mod_v_main_~x~0_47_31_102)) 4294967296) 100000000) (<= 10000000 (mod (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_47_31_102_45) main_~x~0 (* v_it_5 2) (* 4294967294 aux_div_aux_mod_v_main_~x~0_47_31_102)) 4294967296))))) (< 0 aux_div_aux_mod_v_main_~x~0_47_31_102))) (and (<= (* aux_div_v_main_~x~0_47_31 4294967296) main_~x~0) (<= main_~x~0 10000000))) (< 0 (+ aux_div_v_main_~x~0_47_31 1))))} is VALID [2022-04-28 03:45:34,248 INFO L290 TraceCheckUtils]: 9: Hoare triple {690#(exists ((aux_div_v_main_~x~0_47_31 Int)) (and (or (exists ((aux_div_aux_mod_v_main_~x~0_47_31_102 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_47_31_102_45 Int)) (and (<= (+ (* aux_div_v_main_~x~0_47_31 4294967296) (* 2 aux_div_aux_mod_v_main_~x~0_47_31_102)) (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_47_31_102_45) main_~x~0)) (<= 0 (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_47_31_102_45)) (<= 10000000 (mod (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_47_31_102_45) main_~x~0 (* 4294967294 aux_div_aux_mod_v_main_~x~0_47_31_102)) 4294967296)) (< (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_47_31_102_45) 2) (<= (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_47_31_102_45) main_~x~0) (+ 10000000 (* 2 aux_div_aux_mod_v_main_~x~0_47_31_102))) (forall ((v_it_5 Int)) (or (not (<= (+ v_it_5 aux_div_aux_mod_aux_mod_v_main_~x~0_47_31_102_45 1) aux_div_aux_mod_v_main_~x~0_47_31_102)) (not (<= 1 v_it_5)) (and (< (mod (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_47_31_102_45) main_~x~0 (* v_it_5 2) (* 4294967294 aux_div_aux_mod_v_main_~x~0_47_31_102)) 4294967296) 100000000) (<= 10000000 (mod (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_47_31_102_45) main_~x~0 (* v_it_5 2) (* 4294967294 aux_div_aux_mod_v_main_~x~0_47_31_102)) 4294967296))))) (< 0 aux_div_aux_mod_v_main_~x~0_47_31_102))) (and (<= (* aux_div_v_main_~x~0_47_31 4294967296) main_~x~0) (<= main_~x~0 10000000))) (< 0 (+ aux_div_v_main_~x~0_47_31 1))))} [52] L8-2_primed-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {694#(and (not (< (mod main_~x~0 4294967296) 100000000)) (exists ((aux_div_v_main_~x~0_47_31 Int)) (and (exists ((aux_div_aux_mod_v_main_~x~0_47_31_102 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_47_31_102_45 Int)) (and (<= (+ (* aux_div_v_main_~x~0_47_31 4294967296) (* 2 aux_div_aux_mod_v_main_~x~0_47_31_102)) (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_47_31_102_45) main_~x~0)) (<= 0 (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_47_31_102_45)) (<= 10000000 (mod (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_47_31_102_45) main_~x~0 (* 4294967294 aux_div_aux_mod_v_main_~x~0_47_31_102)) 4294967296)) (< (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_47_31_102_45) 2) (<= (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_47_31_102_45) main_~x~0) (+ 10000000 (* 2 aux_div_aux_mod_v_main_~x~0_47_31_102))) (forall ((v_it_5 Int)) (or (not (<= (+ v_it_5 aux_div_aux_mod_aux_mod_v_main_~x~0_47_31_102_45 1) aux_div_aux_mod_v_main_~x~0_47_31_102)) (not (<= 1 v_it_5)) (and (< (mod (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_47_31_102_45) main_~x~0 (* v_it_5 2) (* 4294967294 aux_div_aux_mod_v_main_~x~0_47_31_102)) 4294967296) 100000000) (<= 10000000 (mod (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_47_31_102_45) main_~x~0 (* v_it_5 2) (* 4294967294 aux_div_aux_mod_v_main_~x~0_47_31_102)) 4294967296))))) (< 0 aux_div_aux_mod_v_main_~x~0_47_31_102))) (< 0 (+ aux_div_v_main_~x~0_47_31 1)))))} is VALID [2022-04-28 03:45:34,251 INFO L272 TraceCheckUtils]: 10: Hoare triple {694#(and (not (< (mod main_~x~0 4294967296) 100000000)) (exists ((aux_div_v_main_~x~0_47_31 Int)) (and (exists ((aux_div_aux_mod_v_main_~x~0_47_31_102 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_47_31_102_45 Int)) (and (<= (+ (* aux_div_v_main_~x~0_47_31 4294967296) (* 2 aux_div_aux_mod_v_main_~x~0_47_31_102)) (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_47_31_102_45) main_~x~0)) (<= 0 (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_47_31_102_45)) (<= 10000000 (mod (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_47_31_102_45) main_~x~0 (* 4294967294 aux_div_aux_mod_v_main_~x~0_47_31_102)) 4294967296)) (< (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_47_31_102_45) 2) (<= (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_47_31_102_45) main_~x~0) (+ 10000000 (* 2 aux_div_aux_mod_v_main_~x~0_47_31_102))) (forall ((v_it_5 Int)) (or (not (<= (+ v_it_5 aux_div_aux_mod_aux_mod_v_main_~x~0_47_31_102_45 1) aux_div_aux_mod_v_main_~x~0_47_31_102)) (not (<= 1 v_it_5)) (and (< (mod (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_47_31_102_45) main_~x~0 (* v_it_5 2) (* 4294967294 aux_div_aux_mod_v_main_~x~0_47_31_102)) 4294967296) 100000000) (<= 10000000 (mod (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_47_31_102_45) main_~x~0 (* v_it_5 2) (* 4294967294 aux_div_aux_mod_v_main_~x~0_47_31_102)) 4294967296))))) (< 0 aux_div_aux_mod_v_main_~x~0_47_31_102))) (< 0 (+ aux_div_v_main_~x~0_47_31 1)))))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {698#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:45:34,252 INFO L290 TraceCheckUtils]: 11: Hoare triple {698#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {702#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:45:34,252 INFO L290 TraceCheckUtils]: 12: Hoare triple {702#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {652#false} is VALID [2022-04-28 03:45:34,252 INFO L290 TraceCheckUtils]: 13: Hoare triple {652#false} assume !false; {652#false} is VALID [2022-04-28 03:45:34,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:45:34,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:45:51,042 INFO L290 TraceCheckUtils]: 13: Hoare triple {652#false} assume !false; {652#false} is VALID [2022-04-28 03:45:51,053 INFO L290 TraceCheckUtils]: 12: Hoare triple {702#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {652#false} is VALID [2022-04-28 03:45:51,059 INFO L290 TraceCheckUtils]: 11: Hoare triple {698#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {702#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:45:51,060 INFO L272 TraceCheckUtils]: 10: Hoare triple {659#(<= main_~x~0 (* (div main_~x~0 2) 2))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {698#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:45:51,060 INFO L290 TraceCheckUtils]: 9: Hoare triple {721#(or (< (mod main_~x~0 4294967296) 100000000) (<= main_~x~0 (* (div main_~x~0 2) 2)))} [52] L8-2_primed-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {659#(<= main_~x~0 (* (div main_~x~0 2) 2))} is VALID [2022-04-28 03:45:53,074 WARN L290 TraceCheckUtils]: 8: Hoare triple {725#(and (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (<= (div (+ 99999999 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1))) (or (forall ((aux_div_aux_mod_v_main_~x~0_48_22_78 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_48_22_78_58 Int)) (or (< (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_48_22_78_58) (+ 100000000 main_~x~0)) (<= (+ aux_div_aux_mod_aux_mod_v_main_~x~0_48_22_78_58 (* aux_div_aux_mod_v_main_~x~0_48_22_78 2147483648)) main_~x~0) (<= (+ main_~x~0 4294967296) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_48_22_78_58)) (exists ((v_it_5 Int)) (and (or (not (<= 10000000 (mod (+ main_~x~0 (* v_it_5 2)) 4294967296))) (not (< (mod (+ main_~x~0 (* v_it_5 2)) 4294967296) 100000000))) (<= (+ v_it_5 main_~x~0 1) (+ aux_div_aux_mod_aux_mod_v_main_~x~0_48_22_78_58 (* aux_div_aux_mod_v_main_~x~0_48_22_78 2147483648))) (<= 1 v_it_5))))) (<= (div main_~x~0 (- 2)) (+ (div (+ (- 2) (* (- 1) main_~x~0)) 2) 1)) (not (<= 10000000 (mod main_~x~0 4294967296)))))} [55] L9-2-->L8-2_primed: Formula: (let ((.cse4 (mod v_main_~x~0_39 4294967296))) (let ((.cse1 (<= 10000000 .cse4)) (.cse0 (< .cse4 100000000)) (.cse2 (= v_main_~x~0_39 v_main_~x~0_38))) (or (and (or (not .cse0) (not .cse1)) .cse2) (and (forall ((v_it_5 Int)) (or (not (<= 1 v_it_5)) (not (<= (+ v_it_5 1) (div (+ v_main_~x~0_39 (* (- 1) v_main_~x~0_38)) (- 2)))) (let ((.cse3 (mod (+ v_main_~x~0_39 (* v_it_5 2)) 4294967296))) (and (< .cse3 100000000) (<= 10000000 .cse3))))) .cse1 .cse0 (< 0 (div (+ v_main_~x~0_39 (* (- 1) v_main_~x~0_38)) (- 2))) (= (mod (+ v_main_~x~0_39 v_main_~x~0_38) 2) 0)) .cse2))) InVars {main_~x~0=v_main_~x~0_39} OutVars{main_~x~0=v_main_~x~0_38} AuxVars[] AssignedVars[main_~x~0] {721#(or (< (mod main_~x~0 4294967296) 100000000) (<= main_~x~0 (* (div main_~x~0 2) 2)))} is UNKNOWN [2022-04-28 03:45:53,080 INFO L290 TraceCheckUtils]: 7: Hoare triple {725#(and (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (<= (div (+ 99999999 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1))) (or (forall ((aux_div_aux_mod_v_main_~x~0_48_22_78 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_48_22_78_58 Int)) (or (< (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_48_22_78_58) (+ 100000000 main_~x~0)) (<= (+ aux_div_aux_mod_aux_mod_v_main_~x~0_48_22_78_58 (* aux_div_aux_mod_v_main_~x~0_48_22_78 2147483648)) main_~x~0) (<= (+ main_~x~0 4294967296) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_48_22_78_58)) (exists ((v_it_5 Int)) (and (or (not (<= 10000000 (mod (+ main_~x~0 (* v_it_5 2)) 4294967296))) (not (< (mod (+ main_~x~0 (* v_it_5 2)) 4294967296) 100000000))) (<= (+ v_it_5 main_~x~0 1) (+ aux_div_aux_mod_aux_mod_v_main_~x~0_48_22_78_58 (* aux_div_aux_mod_v_main_~x~0_48_22_78 2147483648))) (<= 1 v_it_5))))) (<= (div main_~x~0 (- 2)) (+ (div (+ (- 2) (* (- 1) main_~x~0)) 2) 1)) (not (<= 10000000 (mod main_~x~0 4294967296)))))} [54] L8-2_primed-->L9-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {725#(and (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (<= (div (+ 99999999 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1))) (or (forall ((aux_div_aux_mod_v_main_~x~0_48_22_78 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_48_22_78_58 Int)) (or (< (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_48_22_78_58) (+ 100000000 main_~x~0)) (<= (+ aux_div_aux_mod_aux_mod_v_main_~x~0_48_22_78_58 (* aux_div_aux_mod_v_main_~x~0_48_22_78 2147483648)) main_~x~0) (<= (+ main_~x~0 4294967296) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_48_22_78_58)) (exists ((v_it_5 Int)) (and (or (not (<= 10000000 (mod (+ main_~x~0 (* v_it_5 2)) 4294967296))) (not (< (mod (+ main_~x~0 (* v_it_5 2)) 4294967296) 100000000))) (<= (+ v_it_5 main_~x~0 1) (+ aux_div_aux_mod_aux_mod_v_main_~x~0_48_22_78_58 (* aux_div_aux_mod_v_main_~x~0_48_22_78 2147483648))) (<= 1 v_it_5))))) (<= (div main_~x~0 (- 2)) (+ (div (+ (- 2) (* (- 1) main_~x~0)) 2) 1)) (not (<= 10000000 (mod main_~x~0 4294967296)))))} is VALID [2022-04-28 03:45:54,492 INFO L290 TraceCheckUtils]: 6: Hoare triple {725#(and (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (<= (div (+ 99999999 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1))) (or (forall ((aux_div_aux_mod_v_main_~x~0_48_22_78 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_48_22_78_58 Int)) (or (< (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_48_22_78_58) (+ 100000000 main_~x~0)) (<= (+ aux_div_aux_mod_aux_mod_v_main_~x~0_48_22_78_58 (* aux_div_aux_mod_v_main_~x~0_48_22_78 2147483648)) main_~x~0) (<= (+ main_~x~0 4294967296) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_48_22_78_58)) (exists ((v_it_5 Int)) (and (or (not (<= 10000000 (mod (+ main_~x~0 (* v_it_5 2)) 4294967296))) (not (< (mod (+ main_~x~0 (* v_it_5 2)) 4294967296) 100000000))) (<= (+ v_it_5 main_~x~0 1) (+ aux_div_aux_mod_aux_mod_v_main_~x~0_48_22_78_58 (* aux_div_aux_mod_v_main_~x~0_48_22_78 2147483648))) (<= 1 v_it_5))))) (<= (div main_~x~0 (- 2)) (+ (div (+ (- 2) (* (- 1) main_~x~0)) 2) 1)) (not (<= 10000000 (mod main_~x~0 4294967296)))))} [53] L9-2-->L8-2_primed: Formula: (let ((.cse0 (mod v_main_~x~0_37 4294967296)) (.cse1 (= v_main_~x~0_37 v_main_~x~0_36)) (.cse2 (= |v_main_#t~post4_16| |v_main_#t~post4_15|))) (or (and (< .cse0 10000000) (<= (div (+ (* (- 1) v_main_~x~0_36) 10000000) (- 4294967296)) (+ (div (+ v_main_~x~0_37 (- 4294967295)) 4294967296) 1)) (< v_main_~x~0_37 v_main_~x~0_36)) (and .cse1 (<= 10000000 .cse0) .cse2) (and .cse1 .cse2))) InVars {main_~x~0=v_main_~x~0_37, main_#t~post4=|v_main_#t~post4_16|} OutVars{main_~x~0=v_main_~x~0_36, main_#t~post4=|v_main_#t~post4_15|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {725#(and (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (<= (div (+ 99999999 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1))) (or (forall ((aux_div_aux_mod_v_main_~x~0_48_22_78 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_48_22_78_58 Int)) (or (< (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_48_22_78_58) (+ 100000000 main_~x~0)) (<= (+ aux_div_aux_mod_aux_mod_v_main_~x~0_48_22_78_58 (* aux_div_aux_mod_v_main_~x~0_48_22_78 2147483648)) main_~x~0) (<= (+ main_~x~0 4294967296) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_48_22_78_58)) (exists ((v_it_5 Int)) (and (or (not (<= 10000000 (mod (+ main_~x~0 (* v_it_5 2)) 4294967296))) (not (< (mod (+ main_~x~0 (* v_it_5 2)) 4294967296) 100000000))) (<= (+ v_it_5 main_~x~0 1) (+ aux_div_aux_mod_aux_mod_v_main_~x~0_48_22_78_58 (* aux_div_aux_mod_v_main_~x~0_48_22_78 2147483648))) (<= 1 v_it_5))))) (<= (div main_~x~0 (- 2)) (+ (div (+ (- 2) (* (- 1) main_~x~0)) 2) 1)) (not (<= 10000000 (mod main_~x~0 4294967296)))))} is VALID [2022-04-28 03:45:54,494 INFO L290 TraceCheckUtils]: 5: Hoare triple {651#true} ~x~0 := 0; {725#(and (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (<= (div (+ 99999999 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1))) (or (forall ((aux_div_aux_mod_v_main_~x~0_48_22_78 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_48_22_78_58 Int)) (or (< (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_48_22_78_58) (+ 100000000 main_~x~0)) (<= (+ aux_div_aux_mod_aux_mod_v_main_~x~0_48_22_78_58 (* aux_div_aux_mod_v_main_~x~0_48_22_78 2147483648)) main_~x~0) (<= (+ main_~x~0 4294967296) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_48_22_78_58)) (exists ((v_it_5 Int)) (and (or (not (<= 10000000 (mod (+ main_~x~0 (* v_it_5 2)) 4294967296))) (not (< (mod (+ main_~x~0 (* v_it_5 2)) 4294967296) 100000000))) (<= (+ v_it_5 main_~x~0 1) (+ aux_div_aux_mod_aux_mod_v_main_~x~0_48_22_78_58 (* aux_div_aux_mod_v_main_~x~0_48_22_78 2147483648))) (<= 1 v_it_5))))) (<= (div main_~x~0 (- 2)) (+ (div (+ (- 2) (* (- 1) main_~x~0)) 2) 1)) (not (<= 10000000 (mod main_~x~0 4294967296)))))} is VALID [2022-04-28 03:45:54,494 INFO L272 TraceCheckUtils]: 4: Hoare triple {651#true} call #t~ret5 := main(); {651#true} is VALID [2022-04-28 03:45:54,494 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {651#true} {651#true} #41#return; {651#true} is VALID [2022-04-28 03:45:54,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {651#true} assume true; {651#true} is VALID [2022-04-28 03:45:54,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {651#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {651#true} is VALID [2022-04-28 03:45:54,494 INFO L272 TraceCheckUtils]: 0: Hoare triple {651#true} call ULTIMATE.init(); {651#true} is VALID [2022-04-28 03:45:54,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:45:54,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789184396] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:45:54,495 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:45:54,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 15 [2022-04-28 03:45:55,317 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:45:55,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [679754974] [2022-04-28 03:45:55,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [679754974] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:45:55,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:45:55,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 03:45:55,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302476934] [2022-04-28 03:45:55,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:45:55,318 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 03:45:55,318 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:45:55,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:55,340 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:45:55,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 03:45:55,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:45:55,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 03:45:55,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=231, Unknown=2, NotChecked=0, Total=306 [2022-04-28 03:45:55,341 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:56,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:45:56,355 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-04-28 03:45:56,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 03:45:56,356 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 03:45:56,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:45:56,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:56,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-28 03:45:56,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:56,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-28 03:45:56,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 35 transitions. [2022-04-28 03:45:56,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:45:56,404 INFO L225 Difference]: With dead ends: 30 [2022-04-28 03:45:56,404 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 03:45:56,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 21 SyntacticMatches, 10 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=119, Invalid=385, Unknown=2, NotChecked=0, Total=506 [2022-04-28 03:45:56,407 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 17 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:45:56,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 33 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 03:45:56,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 03:45:56,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-28 03:45:56,435 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:45:56,436 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:56,436 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:56,437 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:56,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:45:56,441 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-04-28 03:45:56,441 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-04-28 03:45:56,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:45:56,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:45:56,442 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-28 03:45:56,442 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-28 03:45:56,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:45:56,448 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-04-28 03:45:56,448 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-04-28 03:45:56,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:45:56,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:45:56,448 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:45:56,448 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:45:56,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:56,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2022-04-28 03:45:56,451 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 19 [2022-04-28 03:45:56,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:45:56,451 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2022-04-28 03:45:56,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:56,451 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 26 transitions. [2022-04-28 03:45:56,484 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:45:56,484 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-04-28 03:45:56,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 03:45:56,484 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:45:56,484 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:45:56,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 03:45:56,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:45:56,695 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:45:56,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:45:56,696 INFO L85 PathProgramCache]: Analyzing trace with hash 361874638, now seen corresponding path program 3 times [2022-04-28 03:45:56,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:45:56,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1211893702] [2022-04-28 03:45:59,868 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:46:02,806 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:46:02,808 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:46:02,811 INFO L85 PathProgramCache]: Analyzing trace with hash 407768495, now seen corresponding path program 1 times [2022-04-28 03:46:02,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:46:02,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140585195] [2022-04-28 03:46:02,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:46:02,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:46:02,835 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_6) (* (- 2) .v_it_7.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_7.0)) 4294967296)) 100000000) 0)) [2022-04-28 03:46:02,836 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) main_~x~0_6) (* (- 2) .v_it_7.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_7.0)) 4294967296)) 10000000) 0) [2022-04-28 03:46:02,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:02,895 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_6) (* (- 2) .v_it_7.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_7.1)) 4294967296)) 100000000) 0)) [2022-04-28 03:46:02,895 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) main_~x~0_6) (* (- 2) .v_it_7.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_7.1)) 4294967296)) 10000000) 0) [2022-04-28 03:46:03,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:46:03,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:03,272 INFO L290 TraceCheckUtils]: 0: Hoare triple {928#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {917#true} is VALID [2022-04-28 03:46:03,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {917#true} assume true; {917#true} is VALID [2022-04-28 03:46:03,272 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {917#true} {917#true} #41#return; {917#true} is VALID [2022-04-28 03:46:03,272 INFO L272 TraceCheckUtils]: 0: Hoare triple {917#true} call ULTIMATE.init(); {928#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:46:03,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {928#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {917#true} is VALID [2022-04-28 03:46:03,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {917#true} assume true; {917#true} is VALID [2022-04-28 03:46:03,273 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {917#true} {917#true} #41#return; {917#true} is VALID [2022-04-28 03:46:03,273 INFO L272 TraceCheckUtils]: 4: Hoare triple {917#true} call #t~ret5 := main(); {917#true} is VALID [2022-04-28 03:46:03,273 INFO L290 TraceCheckUtils]: 5: Hoare triple {917#true} ~x~0 := 0; {922#(= main_~x~0 0)} is VALID [2022-04-28 03:46:03,274 INFO L290 TraceCheckUtils]: 6: Hoare triple {922#(= main_~x~0 0)} [57] L9-2-->L8-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_58 v_main_~x~0_57)) (.cse1 (= |v_main_#t~post4_23| |v_main_#t~post4_22|)) (.cse2 (mod v_main_~x~0_58 4294967296))) (or (and .cse0 .cse1 (<= 10000000 .cse2)) (and .cse0 .cse1) (and (< v_main_~x~0_58 v_main_~x~0_57) (<= (div (+ (* (- 1) v_main_~x~0_57) 10000000) (- 4294967296)) (+ (div (+ v_main_~x~0_58 (- 4294967295)) 4294967296) 1)) (< .cse2 10000000)))) InVars {main_~x~0=v_main_~x~0_58, main_#t~post4=|v_main_#t~post4_23|} OutVars{main_~x~0=v_main_~x~0_57, main_#t~post4=|v_main_#t~post4_22|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {923#(or (= main_~x~0 0) (and (<= 1 main_~x~0) (<= main_~x~0 10000000)))} is VALID [2022-04-28 03:46:03,275 INFO L290 TraceCheckUtils]: 7: Hoare triple {923#(or (= main_~x~0 0) (and (<= 1 main_~x~0) (<= main_~x~0 10000000)))} [58] L8-2_primed-->L9-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {923#(or (= main_~x~0 0) (and (<= 1 main_~x~0) (<= main_~x~0 10000000)))} is VALID [2022-04-28 03:46:03,279 INFO L290 TraceCheckUtils]: 8: Hoare triple {923#(or (= main_~x~0 0) (and (<= 1 main_~x~0) (<= main_~x~0 10000000)))} [59] L9-2-->L8-2_primed: Formula: (let ((.cse4 (mod v_main_~x~0_60 4294967296))) (let ((.cse1 (<= 10000000 .cse4)) (.cse0 (< .cse4 100000000)) (.cse2 (= v_main_~x~0_60 v_main_~x~0_59))) (or (and (or (not .cse0) (not .cse1)) .cse2) (and .cse1 .cse0 (< 0 (div (+ v_main_~x~0_60 (* (- 1) v_main_~x~0_59)) (- 2))) (forall ((v_it_7 Int)) (or (let ((.cse3 (mod (+ v_main_~x~0_60 (* v_it_7 2)) 4294967296))) (and (<= 10000000 .cse3) (< .cse3 100000000))) (not (<= (+ v_it_7 1) (div (+ v_main_~x~0_60 (* (- 1) v_main_~x~0_59)) (- 2)))) (not (<= 1 v_it_7)))) (= (mod (+ v_main_~x~0_60 v_main_~x~0_59) 2) 0)) .cse2))) InVars {main_~x~0=v_main_~x~0_60} OutVars{main_~x~0=v_main_~x~0_59} AuxVars[] AssignedVars[main_~x~0] {924#(or (<= main_~x~0 (* (div main_~x~0 2) 2)) (<= main_~x~0 (+ 50000000 (div main_~x~0 2) (* (div main_~x~0 4294967296) 2147483648))))} is VALID [2022-04-28 03:46:03,280 INFO L290 TraceCheckUtils]: 9: Hoare triple {924#(or (<= main_~x~0 (* (div main_~x~0 2) 2)) (<= main_~x~0 (+ 50000000 (div main_~x~0 2) (* (div main_~x~0 4294967296) 2147483648))))} [56] L8-2_primed-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {925#(<= main_~x~0 (* (div main_~x~0 2) 2))} is VALID [2022-04-28 03:46:03,281 INFO L272 TraceCheckUtils]: 10: Hoare triple {925#(<= main_~x~0 (* (div main_~x~0 2) 2))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {926#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:46:03,281 INFO L290 TraceCheckUtils]: 11: Hoare triple {926#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {927#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:46:03,281 INFO L290 TraceCheckUtils]: 12: Hoare triple {927#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {918#false} is VALID [2022-04-28 03:46:03,281 INFO L290 TraceCheckUtils]: 13: Hoare triple {918#false} assume !false; {918#false} is VALID [2022-04-28 03:46:03,282 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:46:03,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:46:03,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140585195] [2022-04-28 03:46:03,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140585195] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:46:03,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316874000] [2022-04-28 03:46:03,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:46:03,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:46:03,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:46:03,293 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:46:03,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 03:46:03,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:03,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 03:46:03,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:03,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:47:08,279 INFO L272 TraceCheckUtils]: 0: Hoare triple {917#true} call ULTIMATE.init(); {917#true} is VALID [2022-04-28 03:47:08,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {917#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {917#true} is VALID [2022-04-28 03:47:08,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {917#true} assume true; {917#true} is VALID [2022-04-28 03:47:08,279 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {917#true} {917#true} #41#return; {917#true} is VALID [2022-04-28 03:47:08,279 INFO L272 TraceCheckUtils]: 4: Hoare triple {917#true} call #t~ret5 := main(); {917#true} is VALID [2022-04-28 03:47:08,280 INFO L290 TraceCheckUtils]: 5: Hoare triple {917#true} ~x~0 := 0; {922#(= main_~x~0 0)} is VALID [2022-04-28 03:47:08,281 INFO L290 TraceCheckUtils]: 6: Hoare triple {922#(= main_~x~0 0)} [57] L9-2-->L8-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_58 v_main_~x~0_57)) (.cse1 (= |v_main_#t~post4_23| |v_main_#t~post4_22|)) (.cse2 (mod v_main_~x~0_58 4294967296))) (or (and .cse0 .cse1 (<= 10000000 .cse2)) (and .cse0 .cse1) (and (< v_main_~x~0_58 v_main_~x~0_57) (<= (div (+ (* (- 1) v_main_~x~0_57) 10000000) (- 4294967296)) (+ (div (+ v_main_~x~0_58 (- 4294967295)) 4294967296) 1)) (< .cse2 10000000)))) InVars {main_~x~0=v_main_~x~0_58, main_#t~post4=|v_main_#t~post4_23|} OutVars{main_~x~0=v_main_~x~0_57, main_#t~post4=|v_main_#t~post4_22|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {923#(or (= main_~x~0 0) (and (<= 1 main_~x~0) (<= main_~x~0 10000000)))} is VALID [2022-04-28 03:47:08,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {923#(or (= main_~x~0 0) (and (<= 1 main_~x~0) (<= main_~x~0 10000000)))} [58] L8-2_primed-->L9-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {923#(or (= main_~x~0 0) (and (<= 1 main_~x~0) (<= main_~x~0 10000000)))} is VALID [2022-04-28 03:47:08,314 INFO L290 TraceCheckUtils]: 8: Hoare triple {923#(or (= main_~x~0 0) (and (<= 1 main_~x~0) (<= main_~x~0 10000000)))} [59] L9-2-->L8-2_primed: Formula: (let ((.cse4 (mod v_main_~x~0_60 4294967296))) (let ((.cse1 (<= 10000000 .cse4)) (.cse0 (< .cse4 100000000)) (.cse2 (= v_main_~x~0_60 v_main_~x~0_59))) (or (and (or (not .cse0) (not .cse1)) .cse2) (and .cse1 .cse0 (< 0 (div (+ v_main_~x~0_60 (* (- 1) v_main_~x~0_59)) (- 2))) (forall ((v_it_7 Int)) (or (let ((.cse3 (mod (+ v_main_~x~0_60 (* v_it_7 2)) 4294967296))) (and (<= 10000000 .cse3) (< .cse3 100000000))) (not (<= (+ v_it_7 1) (div (+ v_main_~x~0_60 (* (- 1) v_main_~x~0_59)) (- 2)))) (not (<= 1 v_it_7)))) (= (mod (+ v_main_~x~0_60 v_main_~x~0_59) 2) 0)) .cse2))) InVars {main_~x~0=v_main_~x~0_60} OutVars{main_~x~0=v_main_~x~0_59} AuxVars[] AssignedVars[main_~x~0] {956#(or (= main_~x~0 0) (exists ((aux_div_aux_mod_v_main_~x~0_68_31_102 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_102_45 Int) (aux_div_v_main_~x~0_68_31 Int)) (and (<= 10000000 (mod (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_102_45 2) main_~x~0 (* aux_div_aux_mod_v_main_~x~0_68_31_102 4294967294)) 4294967296)) (<= (+ (* aux_div_aux_mod_v_main_~x~0_68_31_102 2) 1) (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_102_45 2) main_~x~0)) (<= 0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_102_45 2)) (forall ((v_it_7 Int)) (or (not (<= (+ v_it_7 aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_102_45 1) aux_div_aux_mod_v_main_~x~0_68_31_102)) (and (<= 10000000 (mod (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_102_45 2) (* v_it_7 2) main_~x~0 (* aux_div_aux_mod_v_main_~x~0_68_31_102 4294967294)) 4294967296)) (< (mod (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_102_45 2) (* v_it_7 2) main_~x~0 (* aux_div_aux_mod_v_main_~x~0_68_31_102 4294967294)) 4294967296) 100000000)) (not (<= 1 v_it_7)))) (< (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_102_45 2) main_~x~0) (+ 100000000 (* aux_div_v_main_~x~0_68_31 4294967296) (* aux_div_aux_mod_v_main_~x~0_68_31_102 2))) (< (* aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_102_45 2) 2) (< 0 aux_div_aux_mod_v_main_~x~0_68_31_102) (<= (+ (* aux_div_v_main_~x~0_68_31 4294967296) (* aux_div_aux_mod_v_main_~x~0_68_31_102 2)) (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_102_45 2) main_~x~0)) (<= (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_102_45 2) main_~x~0) (+ 10000000 (* aux_div_aux_mod_v_main_~x~0_68_31_102 2))))) (and (<= 1 main_~x~0) (<= main_~x~0 10000000)))} is VALID [2022-04-28 03:47:08,327 INFO L290 TraceCheckUtils]: 9: Hoare triple {956#(or (= main_~x~0 0) (exists ((aux_div_aux_mod_v_main_~x~0_68_31_102 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_102_45 Int) (aux_div_v_main_~x~0_68_31 Int)) (and (<= 10000000 (mod (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_102_45 2) main_~x~0 (* aux_div_aux_mod_v_main_~x~0_68_31_102 4294967294)) 4294967296)) (<= (+ (* aux_div_aux_mod_v_main_~x~0_68_31_102 2) 1) (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_102_45 2) main_~x~0)) (<= 0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_102_45 2)) (forall ((v_it_7 Int)) (or (not (<= (+ v_it_7 aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_102_45 1) aux_div_aux_mod_v_main_~x~0_68_31_102)) (and (<= 10000000 (mod (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_102_45 2) (* v_it_7 2) main_~x~0 (* aux_div_aux_mod_v_main_~x~0_68_31_102 4294967294)) 4294967296)) (< (mod (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_102_45 2) (* v_it_7 2) main_~x~0 (* aux_div_aux_mod_v_main_~x~0_68_31_102 4294967294)) 4294967296) 100000000)) (not (<= 1 v_it_7)))) (< (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_102_45 2) main_~x~0) (+ 100000000 (* aux_div_v_main_~x~0_68_31 4294967296) (* aux_div_aux_mod_v_main_~x~0_68_31_102 2))) (< (* aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_102_45 2) 2) (< 0 aux_div_aux_mod_v_main_~x~0_68_31_102) (<= (+ (* aux_div_v_main_~x~0_68_31 4294967296) (* aux_div_aux_mod_v_main_~x~0_68_31_102 2)) (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_102_45 2) main_~x~0)) (<= (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_102_45 2) main_~x~0) (+ 10000000 (* aux_div_aux_mod_v_main_~x~0_68_31_102 2))))) (and (<= 1 main_~x~0) (<= main_~x~0 10000000)))} [56] L8-2_primed-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {960#(and (not (< (mod main_~x~0 4294967296) 100000000)) (exists ((aux_div_aux_mod_v_main_~x~0_68_31_102 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_102_45 Int) (aux_div_v_main_~x~0_68_31 Int)) (and (<= 10000000 (mod (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_102_45 2) main_~x~0 (* aux_div_aux_mod_v_main_~x~0_68_31_102 4294967294)) 4294967296)) (<= (+ (* aux_div_aux_mod_v_main_~x~0_68_31_102 2) 1) (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_102_45 2) main_~x~0)) (<= 0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_102_45 2)) (forall ((v_it_7 Int)) (or (not (<= (+ v_it_7 aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_102_45 1) aux_div_aux_mod_v_main_~x~0_68_31_102)) (and (<= 10000000 (mod (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_102_45 2) (* v_it_7 2) main_~x~0 (* aux_div_aux_mod_v_main_~x~0_68_31_102 4294967294)) 4294967296)) (< (mod (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_102_45 2) (* v_it_7 2) main_~x~0 (* aux_div_aux_mod_v_main_~x~0_68_31_102 4294967294)) 4294967296) 100000000)) (not (<= 1 v_it_7)))) (< (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_102_45 2) main_~x~0) (+ 100000000 (* aux_div_v_main_~x~0_68_31 4294967296) (* aux_div_aux_mod_v_main_~x~0_68_31_102 2))) (< (* aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_102_45 2) 2) (< 0 aux_div_aux_mod_v_main_~x~0_68_31_102) (<= (+ (* aux_div_v_main_~x~0_68_31 4294967296) (* aux_div_aux_mod_v_main_~x~0_68_31_102 2)) (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_102_45 2) main_~x~0)) (<= (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_102_45 2) main_~x~0) (+ 10000000 (* aux_div_aux_mod_v_main_~x~0_68_31_102 2))))))} is VALID [2022-04-28 03:47:08,331 INFO L272 TraceCheckUtils]: 10: Hoare triple {960#(and (not (< (mod main_~x~0 4294967296) 100000000)) (exists ((aux_div_aux_mod_v_main_~x~0_68_31_102 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_102_45 Int) (aux_div_v_main_~x~0_68_31 Int)) (and (<= 10000000 (mod (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_102_45 2) main_~x~0 (* aux_div_aux_mod_v_main_~x~0_68_31_102 4294967294)) 4294967296)) (<= (+ (* aux_div_aux_mod_v_main_~x~0_68_31_102 2) 1) (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_102_45 2) main_~x~0)) (<= 0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_102_45 2)) (forall ((v_it_7 Int)) (or (not (<= (+ v_it_7 aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_102_45 1) aux_div_aux_mod_v_main_~x~0_68_31_102)) (and (<= 10000000 (mod (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_102_45 2) (* v_it_7 2) main_~x~0 (* aux_div_aux_mod_v_main_~x~0_68_31_102 4294967294)) 4294967296)) (< (mod (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_102_45 2) (* v_it_7 2) main_~x~0 (* aux_div_aux_mod_v_main_~x~0_68_31_102 4294967294)) 4294967296) 100000000)) (not (<= 1 v_it_7)))) (< (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_102_45 2) main_~x~0) (+ 100000000 (* aux_div_v_main_~x~0_68_31 4294967296) (* aux_div_aux_mod_v_main_~x~0_68_31_102 2))) (< (* aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_102_45 2) 2) (< 0 aux_div_aux_mod_v_main_~x~0_68_31_102) (<= (+ (* aux_div_v_main_~x~0_68_31 4294967296) (* aux_div_aux_mod_v_main_~x~0_68_31_102 2)) (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_102_45 2) main_~x~0)) (<= (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_102_45 2) main_~x~0) (+ 10000000 (* aux_div_aux_mod_v_main_~x~0_68_31_102 2))))))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {964#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:47:08,331 INFO L290 TraceCheckUtils]: 11: Hoare triple {964#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {968#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:47:08,332 INFO L290 TraceCheckUtils]: 12: Hoare triple {968#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {918#false} is VALID [2022-04-28 03:47:08,332 INFO L290 TraceCheckUtils]: 13: Hoare triple {918#false} assume !false; {918#false} is VALID [2022-04-28 03:47:08,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:47:08,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:47:22,497 INFO L290 TraceCheckUtils]: 13: Hoare triple {918#false} assume !false; {918#false} is VALID [2022-04-28 03:47:22,498 INFO L290 TraceCheckUtils]: 12: Hoare triple {968#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {918#false} is VALID [2022-04-28 03:47:22,498 INFO L290 TraceCheckUtils]: 11: Hoare triple {964#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {968#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:47:22,499 INFO L272 TraceCheckUtils]: 10: Hoare triple {925#(<= main_~x~0 (* (div main_~x~0 2) 2))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {964#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:47:22,500 INFO L290 TraceCheckUtils]: 9: Hoare triple {924#(or (<= main_~x~0 (* (div main_~x~0 2) 2)) (<= main_~x~0 (+ 50000000 (div main_~x~0 2) (* (div main_~x~0 4294967296) 2147483648))))} [56] L8-2_primed-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {925#(<= main_~x~0 (* (div main_~x~0 2) 2))} is VALID [2022-04-28 03:47:24,509 WARN L290 TraceCheckUtils]: 8: Hoare triple {990#(and (or (<= (div (* (- 1) main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (<= (div (+ (* (- 1) main_~x~0) 50000001 (div (+ (- 2) main_~x~0) 2)) (- 2147483648)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1))) (or (<= (div main_~x~0 (- 2)) (+ (div (+ (- 2) (* (- 1) main_~x~0)) 2) 1)) (forall ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_69_22_69_100_70 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_69_22_69_100 Int)) (or (<= aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_69_22_69_100_70 (+ main_~x~0 (div (+ (- 2) (* (- 1) main_~x~0)) 2) 50000001)) (<= (+ main_~x~0 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_69_22_69_100_70 2)) (exists ((v_it_7 Int)) (and (or (not (<= 10000000 (mod (+ (* v_it_7 2) main_~x~0) 4294967296))) (not (< (mod (+ (* v_it_7 2) main_~x~0) 4294967296) 100000000))) (<= 1 v_it_7) (<= (+ v_it_7 main_~x~0 1) (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_69_22_69_100_70 (* aux_div_aux_mod_aux_mod_v_main_~x~0_69_22_69_100 2147483648))))) (<= (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_69_22_69_100_70 (* aux_div_aux_mod_aux_mod_v_main_~x~0_69_22_69_100 2147483648)) main_~x~0))) (not (<= 10000000 (mod main_~x~0 4294967296)))))} [59] L9-2-->L8-2_primed: Formula: (let ((.cse4 (mod v_main_~x~0_60 4294967296))) (let ((.cse1 (<= 10000000 .cse4)) (.cse0 (< .cse4 100000000)) (.cse2 (= v_main_~x~0_60 v_main_~x~0_59))) (or (and (or (not .cse0) (not .cse1)) .cse2) (and .cse1 .cse0 (< 0 (div (+ v_main_~x~0_60 (* (- 1) v_main_~x~0_59)) (- 2))) (forall ((v_it_7 Int)) (or (let ((.cse3 (mod (+ v_main_~x~0_60 (* v_it_7 2)) 4294967296))) (and (<= 10000000 .cse3) (< .cse3 100000000))) (not (<= (+ v_it_7 1) (div (+ v_main_~x~0_60 (* (- 1) v_main_~x~0_59)) (- 2)))) (not (<= 1 v_it_7)))) (= (mod (+ v_main_~x~0_60 v_main_~x~0_59) 2) 0)) .cse2))) InVars {main_~x~0=v_main_~x~0_60} OutVars{main_~x~0=v_main_~x~0_59} AuxVars[] AssignedVars[main_~x~0] {924#(or (<= main_~x~0 (* (div main_~x~0 2) 2)) (<= main_~x~0 (+ 50000000 (div main_~x~0 2) (* (div main_~x~0 4294967296) 2147483648))))} is UNKNOWN [2022-04-28 03:47:24,515 INFO L290 TraceCheckUtils]: 7: Hoare triple {990#(and (or (<= (div (* (- 1) main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (<= (div (+ (* (- 1) main_~x~0) 50000001 (div (+ (- 2) main_~x~0) 2)) (- 2147483648)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1))) (or (<= (div main_~x~0 (- 2)) (+ (div (+ (- 2) (* (- 1) main_~x~0)) 2) 1)) (forall ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_69_22_69_100_70 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_69_22_69_100 Int)) (or (<= aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_69_22_69_100_70 (+ main_~x~0 (div (+ (- 2) (* (- 1) main_~x~0)) 2) 50000001)) (<= (+ main_~x~0 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_69_22_69_100_70 2)) (exists ((v_it_7 Int)) (and (or (not (<= 10000000 (mod (+ (* v_it_7 2) main_~x~0) 4294967296))) (not (< (mod (+ (* v_it_7 2) main_~x~0) 4294967296) 100000000))) (<= 1 v_it_7) (<= (+ v_it_7 main_~x~0 1) (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_69_22_69_100_70 (* aux_div_aux_mod_aux_mod_v_main_~x~0_69_22_69_100 2147483648))))) (<= (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_69_22_69_100_70 (* aux_div_aux_mod_aux_mod_v_main_~x~0_69_22_69_100 2147483648)) main_~x~0))) (not (<= 10000000 (mod main_~x~0 4294967296)))))} [58] L8-2_primed-->L9-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {990#(and (or (<= (div (* (- 1) main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (<= (div (+ (* (- 1) main_~x~0) 50000001 (div (+ (- 2) main_~x~0) 2)) (- 2147483648)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1))) (or (<= (div main_~x~0 (- 2)) (+ (div (+ (- 2) (* (- 1) main_~x~0)) 2) 1)) (forall ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_69_22_69_100_70 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_69_22_69_100 Int)) (or (<= aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_69_22_69_100_70 (+ main_~x~0 (div (+ (- 2) (* (- 1) main_~x~0)) 2) 50000001)) (<= (+ main_~x~0 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_69_22_69_100_70 2)) (exists ((v_it_7 Int)) (and (or (not (<= 10000000 (mod (+ (* v_it_7 2) main_~x~0) 4294967296))) (not (< (mod (+ (* v_it_7 2) main_~x~0) 4294967296) 100000000))) (<= 1 v_it_7) (<= (+ v_it_7 main_~x~0 1) (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_69_22_69_100_70 (* aux_div_aux_mod_aux_mod_v_main_~x~0_69_22_69_100 2147483648))))) (<= (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_69_22_69_100_70 (* aux_div_aux_mod_aux_mod_v_main_~x~0_69_22_69_100 2147483648)) main_~x~0))) (not (<= 10000000 (mod main_~x~0 4294967296)))))} is VALID [2022-04-28 03:47:26,275 INFO L290 TraceCheckUtils]: 6: Hoare triple {990#(and (or (<= (div (* (- 1) main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (<= (div (+ (* (- 1) main_~x~0) 50000001 (div (+ (- 2) main_~x~0) 2)) (- 2147483648)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1))) (or (<= (div main_~x~0 (- 2)) (+ (div (+ (- 2) (* (- 1) main_~x~0)) 2) 1)) (forall ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_69_22_69_100_70 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_69_22_69_100 Int)) (or (<= aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_69_22_69_100_70 (+ main_~x~0 (div (+ (- 2) (* (- 1) main_~x~0)) 2) 50000001)) (<= (+ main_~x~0 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_69_22_69_100_70 2)) (exists ((v_it_7 Int)) (and (or (not (<= 10000000 (mod (+ (* v_it_7 2) main_~x~0) 4294967296))) (not (< (mod (+ (* v_it_7 2) main_~x~0) 4294967296) 100000000))) (<= 1 v_it_7) (<= (+ v_it_7 main_~x~0 1) (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_69_22_69_100_70 (* aux_div_aux_mod_aux_mod_v_main_~x~0_69_22_69_100 2147483648))))) (<= (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_69_22_69_100_70 (* aux_div_aux_mod_aux_mod_v_main_~x~0_69_22_69_100 2147483648)) main_~x~0))) (not (<= 10000000 (mod main_~x~0 4294967296)))))} [57] L9-2-->L8-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_58 v_main_~x~0_57)) (.cse1 (= |v_main_#t~post4_23| |v_main_#t~post4_22|)) (.cse2 (mod v_main_~x~0_58 4294967296))) (or (and .cse0 .cse1 (<= 10000000 .cse2)) (and .cse0 .cse1) (and (< v_main_~x~0_58 v_main_~x~0_57) (<= (div (+ (* (- 1) v_main_~x~0_57) 10000000) (- 4294967296)) (+ (div (+ v_main_~x~0_58 (- 4294967295)) 4294967296) 1)) (< .cse2 10000000)))) InVars {main_~x~0=v_main_~x~0_58, main_#t~post4=|v_main_#t~post4_23|} OutVars{main_~x~0=v_main_~x~0_57, main_#t~post4=|v_main_#t~post4_22|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {990#(and (or (<= (div (* (- 1) main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (<= (div (+ (* (- 1) main_~x~0) 50000001 (div (+ (- 2) main_~x~0) 2)) (- 2147483648)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1))) (or (<= (div main_~x~0 (- 2)) (+ (div (+ (- 2) (* (- 1) main_~x~0)) 2) 1)) (forall ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_69_22_69_100_70 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_69_22_69_100 Int)) (or (<= aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_69_22_69_100_70 (+ main_~x~0 (div (+ (- 2) (* (- 1) main_~x~0)) 2) 50000001)) (<= (+ main_~x~0 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_69_22_69_100_70 2)) (exists ((v_it_7 Int)) (and (or (not (<= 10000000 (mod (+ (* v_it_7 2) main_~x~0) 4294967296))) (not (< (mod (+ (* v_it_7 2) main_~x~0) 4294967296) 100000000))) (<= 1 v_it_7) (<= (+ v_it_7 main_~x~0 1) (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_69_22_69_100_70 (* aux_div_aux_mod_aux_mod_v_main_~x~0_69_22_69_100 2147483648))))) (<= (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_69_22_69_100_70 (* aux_div_aux_mod_aux_mod_v_main_~x~0_69_22_69_100 2147483648)) main_~x~0))) (not (<= 10000000 (mod main_~x~0 4294967296)))))} is VALID [2022-04-28 03:47:26,277 INFO L290 TraceCheckUtils]: 5: Hoare triple {917#true} ~x~0 := 0; {990#(and (or (<= (div (* (- 1) main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (<= (div (+ (* (- 1) main_~x~0) 50000001 (div (+ (- 2) main_~x~0) 2)) (- 2147483648)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1))) (or (<= (div main_~x~0 (- 2)) (+ (div (+ (- 2) (* (- 1) main_~x~0)) 2) 1)) (forall ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_69_22_69_100_70 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_69_22_69_100 Int)) (or (<= aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_69_22_69_100_70 (+ main_~x~0 (div (+ (- 2) (* (- 1) main_~x~0)) 2) 50000001)) (<= (+ main_~x~0 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_69_22_69_100_70 2)) (exists ((v_it_7 Int)) (and (or (not (<= 10000000 (mod (+ (* v_it_7 2) main_~x~0) 4294967296))) (not (< (mod (+ (* v_it_7 2) main_~x~0) 4294967296) 100000000))) (<= 1 v_it_7) (<= (+ v_it_7 main_~x~0 1) (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_69_22_69_100_70 (* aux_div_aux_mod_aux_mod_v_main_~x~0_69_22_69_100 2147483648))))) (<= (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_69_22_69_100_70 (* aux_div_aux_mod_aux_mod_v_main_~x~0_69_22_69_100 2147483648)) main_~x~0))) (not (<= 10000000 (mod main_~x~0 4294967296)))))} is VALID [2022-04-28 03:47:26,277 INFO L272 TraceCheckUtils]: 4: Hoare triple {917#true} call #t~ret5 := main(); {917#true} is VALID [2022-04-28 03:47:26,277 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {917#true} {917#true} #41#return; {917#true} is VALID [2022-04-28 03:47:26,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {917#true} assume true; {917#true} is VALID [2022-04-28 03:47:26,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {917#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {917#true} is VALID [2022-04-28 03:47:26,277 INFO L272 TraceCheckUtils]: 0: Hoare triple {917#true} call ULTIMATE.init(); {917#true} is VALID [2022-04-28 03:47:26,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:47:26,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316874000] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:47:26,278 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:47:26,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 14 [2022-04-28 03:47:31,381 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:47:31,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1211893702] [2022-04-28 03:47:31,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1211893702] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:47:31,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:47:31,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 03:47:31,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789043440] [2022-04-28 03:47:31,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:47:31,382 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 03:47:31,382 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:47:31,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:31,403 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:47:31,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 03:47:31,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:47:31,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 03:47:31,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=238, Unknown=1, NotChecked=0, Total=306 [2022-04-28 03:47:31,404 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 11 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:34,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:47:34,912 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-04-28 03:47:34,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 03:47:34,912 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 03:47:34,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:47:34,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:34,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 37 transitions. [2022-04-28 03:47:34,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:34,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 37 transitions. [2022-04-28 03:47:34,914 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 37 transitions. [2022-04-28 03:47:34,960 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:47:34,960 INFO L225 Difference]: With dead ends: 32 [2022-04-28 03:47:34,960 INFO L226 Difference]: Without dead ends: 25 [2022-04-28 03:47:34,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 22 SyntacticMatches, 11 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=116, Invalid=434, Unknown=2, NotChecked=0, Total=552 [2022-04-28 03:47:34,961 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 19 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:47:34,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 43 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 03:47:34,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-28 03:47:34,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-28 03:47:34,991 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:47:34,992 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:34,992 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:34,992 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:34,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:47:34,993 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-28 03:47:34,993 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-28 03:47:34,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:47:34,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:47:34,994 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-28 03:47:34,995 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-28 03:47:35,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:47:35,004 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-28 03:47:35,004 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-28 03:47:35,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:47:35,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:47:35,006 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:47:35,006 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:47:35,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:35,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-04-28 03:47:35,009 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 21 [2022-04-28 03:47:35,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:47:35,009 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-04-28 03:47:35,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:35,009 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 28 transitions. [2022-04-28 03:47:35,048 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:47:35,048 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-28 03:47:35,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 03:47:35,049 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:47:35,049 INFO L195 NwaCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:47:35,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 03:47:35,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:47:35,256 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:47:35,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:47:35,256 INFO L85 PathProgramCache]: Analyzing trace with hash 105609001, now seen corresponding path program 4 times [2022-04-28 03:47:35,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:47:35,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [561079714] [2022-04-28 03:47:39,813 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:47:40,359 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:47:40,808 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:47:40,810 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:47:40,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1837666641, now seen corresponding path program 1 times [2022-04-28 03:47:40,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:47:40,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608899493] [2022-04-28 03:47:40,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:47:40,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:47:40,822 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) main_~x~0_6) (* (- 2) .v_it_9.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_9.0)) 4294967296)) 10000000) 0) [2022-04-28 03:47:40,822 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_6) (* (- 2) .v_it_9.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_9.0)) 4294967296)) 100000000) 0)) [2022-04-28 03:47:40,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:47:40,867 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) main_~x~0_6) (* (- 2) .v_it_9.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_9.1)) 4294967296)) 10000000) 0) [2022-04-28 03:47:40,867 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_6) (* (- 2) .v_it_9.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_9.1)) 4294967296)) 100000000) 0)) [2022-04-28 03:47:41,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:47:41,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:47:41,232 INFO L290 TraceCheckUtils]: 0: Hoare triple {1208#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1197#true} is VALID [2022-04-28 03:47:41,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {1197#true} assume true; {1197#true} is VALID [2022-04-28 03:47:41,232 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1197#true} {1197#true} #41#return; {1197#true} is VALID [2022-04-28 03:47:41,233 INFO L272 TraceCheckUtils]: 0: Hoare triple {1197#true} call ULTIMATE.init(); {1208#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:47:41,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {1208#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1197#true} is VALID [2022-04-28 03:47:41,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {1197#true} assume true; {1197#true} is VALID [2022-04-28 03:47:41,233 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1197#true} {1197#true} #41#return; {1197#true} is VALID [2022-04-28 03:47:41,233 INFO L272 TraceCheckUtils]: 4: Hoare triple {1197#true} call #t~ret5 := main(); {1197#true} is VALID [2022-04-28 03:47:41,234 INFO L290 TraceCheckUtils]: 5: Hoare triple {1197#true} ~x~0 := 0; {1202#(= main_~x~0 0)} is VALID [2022-04-28 03:47:41,235 INFO L290 TraceCheckUtils]: 6: Hoare triple {1202#(= main_~x~0 0)} [61] L9-2-->L8-2_primed: Formula: (let ((.cse0 (mod v_main_~x~0_80 4294967296))) (or (and (= v_main_~x~0_80 v_main_~x~0_79) (= |v_main_#t~post4_30| |v_main_#t~post4_29|)) (and (<= 10000000 .cse0) (= |v_main_#t~post4_29| |v_main_#t~post4_30|) (= v_main_~x~0_79 v_main_~x~0_80)) (and (<= (div (+ 10000000 (* (- 1) v_main_~x~0_79)) (- 4294967296)) (+ (div (+ v_main_~x~0_80 (- 4294967295)) 4294967296) 1)) (< .cse0 10000000) (< v_main_~x~0_80 v_main_~x~0_79)))) InVars {main_~x~0=v_main_~x~0_80, main_#t~post4=|v_main_#t~post4_30|} OutVars{main_~x~0=v_main_~x~0_79, main_#t~post4=|v_main_#t~post4_29|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1203#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= (div (+ (* (- 1) main_~x~0) 10000000) (- 4294967296)) 0))} is VALID [2022-04-28 03:47:41,235 INFO L290 TraceCheckUtils]: 7: Hoare triple {1203#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= (div (+ (* (- 1) main_~x~0) 10000000) (- 4294967296)) 0))} [62] L8-2_primed-->L9-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1203#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= (div (+ (* (- 1) main_~x~0) 10000000) (- 4294967296)) 0))} is VALID [2022-04-28 03:47:41,239 INFO L290 TraceCheckUtils]: 8: Hoare triple {1203#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= (div (+ (* (- 1) main_~x~0) 10000000) (- 4294967296)) 0))} [63] L9-2-->L8-2_primed: Formula: (let ((.cse3 (mod v_main_~x~0_82 4294967296))) (let ((.cse1 (<= 10000000 .cse3)) (.cse0 (< .cse3 100000000))) (or (= v_main_~x~0_82 v_main_~x~0_81) (and (= (mod (+ v_main_~x~0_81 v_main_~x~0_82) 2) 0) .cse0 .cse1 (< 0 (div (+ v_main_~x~0_82 (* (- 1) v_main_~x~0_81)) (- 2))) (forall ((v_it_9 Int)) (or (not (<= 1 v_it_9)) (not (<= (+ v_it_9 1) (div (+ v_main_~x~0_82 (* (- 1) v_main_~x~0_81)) (- 2)))) (let ((.cse2 (mod (+ v_main_~x~0_82 (* v_it_9 2)) 4294967296))) (and (< .cse2 100000000) (<= 10000000 .cse2)))))) (and (or (not .cse1) (not .cse0)) (= v_main_~x~0_81 v_main_~x~0_82))))) InVars {main_~x~0=v_main_~x~0_82} OutVars{main_~x~0=v_main_~x~0_81} AuxVars[] AssignedVars[main_~x~0] {1204#(or (and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 10000001)) (<= main_~x~0 (* (div main_~x~0 2) 2)))} is VALID [2022-04-28 03:47:41,239 INFO L290 TraceCheckUtils]: 9: Hoare triple {1204#(or (and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 10000001)) (<= main_~x~0 (* (div main_~x~0 2) 2)))} [60] L8-2_primed-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {1205#(<= main_~x~0 (* (div main_~x~0 2) 2))} is VALID [2022-04-28 03:47:41,240 INFO L272 TraceCheckUtils]: 10: Hoare triple {1205#(<= main_~x~0 (* (div main_~x~0 2) 2))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1206#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:47:41,241 INFO L290 TraceCheckUtils]: 11: Hoare triple {1206#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1207#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:47:41,241 INFO L290 TraceCheckUtils]: 12: Hoare triple {1207#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1198#false} is VALID [2022-04-28 03:47:41,241 INFO L290 TraceCheckUtils]: 13: Hoare triple {1198#false} assume !false; {1198#false} is VALID [2022-04-28 03:47:41,241 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:47:41,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:47:41,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608899493] [2022-04-28 03:47:41,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608899493] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:47:41,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910217895] [2022-04-28 03:47:41,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:47:41,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:47:41,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:47:41,243 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:47:41,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 03:47:41,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:47:41,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 03:47:41,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:47:41,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:48:14,449 INFO L272 TraceCheckUtils]: 0: Hoare triple {1197#true} call ULTIMATE.init(); {1197#true} is VALID [2022-04-28 03:48:14,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {1197#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1197#true} is VALID [2022-04-28 03:48:14,450 INFO L290 TraceCheckUtils]: 2: Hoare triple {1197#true} assume true; {1197#true} is VALID [2022-04-28 03:48:14,450 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1197#true} {1197#true} #41#return; {1197#true} is VALID [2022-04-28 03:48:14,450 INFO L272 TraceCheckUtils]: 4: Hoare triple {1197#true} call #t~ret5 := main(); {1197#true} is VALID [2022-04-28 03:48:14,454 INFO L290 TraceCheckUtils]: 5: Hoare triple {1197#true} ~x~0 := 0; {1202#(= main_~x~0 0)} is VALID [2022-04-28 03:48:14,455 INFO L290 TraceCheckUtils]: 6: Hoare triple {1202#(= main_~x~0 0)} [61] L9-2-->L8-2_primed: Formula: (let ((.cse0 (mod v_main_~x~0_80 4294967296))) (or (and (= v_main_~x~0_80 v_main_~x~0_79) (= |v_main_#t~post4_30| |v_main_#t~post4_29|)) (and (<= 10000000 .cse0) (= |v_main_#t~post4_29| |v_main_#t~post4_30|) (= v_main_~x~0_79 v_main_~x~0_80)) (and (<= (div (+ 10000000 (* (- 1) v_main_~x~0_79)) (- 4294967296)) (+ (div (+ v_main_~x~0_80 (- 4294967295)) 4294967296) 1)) (< .cse0 10000000) (< v_main_~x~0_80 v_main_~x~0_79)))) InVars {main_~x~0=v_main_~x~0_80, main_#t~post4=|v_main_#t~post4_30|} OutVars{main_~x~0=v_main_~x~0_79, main_#t~post4=|v_main_#t~post4_29|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1203#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= (div (+ (* (- 1) main_~x~0) 10000000) (- 4294967296)) 0))} is VALID [2022-04-28 03:48:14,455 INFO L290 TraceCheckUtils]: 7: Hoare triple {1203#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= (div (+ (* (- 1) main_~x~0) 10000000) (- 4294967296)) 0))} [62] L8-2_primed-->L9-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1203#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= (div (+ (* (- 1) main_~x~0) 10000000) (- 4294967296)) 0))} is VALID [2022-04-28 03:48:15,256 INFO L290 TraceCheckUtils]: 8: Hoare triple {1203#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= (div (+ (* (- 1) main_~x~0) 10000000) (- 4294967296)) 0))} [63] L9-2-->L8-2_primed: Formula: (let ((.cse3 (mod v_main_~x~0_82 4294967296))) (let ((.cse1 (<= 10000000 .cse3)) (.cse0 (< .cse3 100000000))) (or (= v_main_~x~0_82 v_main_~x~0_81) (and (= (mod (+ v_main_~x~0_81 v_main_~x~0_82) 2) 0) .cse0 .cse1 (< 0 (div (+ v_main_~x~0_82 (* (- 1) v_main_~x~0_81)) (- 2))) (forall ((v_it_9 Int)) (or (not (<= 1 v_it_9)) (not (<= (+ v_it_9 1) (div (+ v_main_~x~0_82 (* (- 1) v_main_~x~0_81)) (- 2)))) (let ((.cse2 (mod (+ v_main_~x~0_82 (* v_it_9 2)) 4294967296))) (and (< .cse2 100000000) (<= 10000000 .cse2)))))) (and (or (not .cse1) (not .cse0)) (= v_main_~x~0_81 v_main_~x~0_82))))) InVars {main_~x~0=v_main_~x~0_82} OutVars{main_~x~0=v_main_~x~0_81} AuxVars[] AssignedVars[main_~x~0] {1236#(exists ((aux_div_v_main_~x~0_90_58 Int) (aux_div_aux_mod_v_main_~x~0_90_58_106 Int)) (and (<= aux_div_v_main_~x~0_90_58 0) (< 0 (+ aux_div_aux_mod_v_main_~x~0_90_58_106 1)) (or (exists ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_90_58_106_54_70 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_90_58_106_54 Int)) (and (<= main_~x~0 (+ (* 4294967296 aux_div_aux_mod_aux_mod_v_main_~x~0_90_58_106_54) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_90_58_106_54_70 2))) (<= (+ (* 4294967296 aux_div_aux_mod_aux_mod_v_main_~x~0_90_58_106_54) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_90_58_106_54_70 2) (* aux_div_aux_mod_v_main_~x~0_90_58_106 4294967296)) (+ main_~x~0 (* aux_div_v_main_~x~0_90_58 4294967296) 10000000)) (< (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_90_58_106_54_70 2) (+ main_~x~0 4294967296)) (<= (+ main_~x~0 10000000) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_90_58_106_54_70 2)) (< (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_90_58_106_54_70 (* aux_div_aux_mod_v_main_~x~0_90_58_106 2147483648) (* aux_div_aux_mod_aux_mod_v_main_~x~0_90_58_106_54 2147483648)) main_~x~0) (forall ((v_it_9 Int)) (or (not (<= 1 v_it_9)) (not (<= (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_90_58_106_54_70 v_it_9 (* aux_div_aux_mod_v_main_~x~0_90_58_106 2147483648) (* aux_div_aux_mod_aux_mod_v_main_~x~0_90_58_106_54 2147483648) 1) main_~x~0)) (and (<= 10000000 (mod (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_90_58_106_54_70 2) (* v_it_9 2) (* main_~x~0 4294967295)) 4294967296)) (< (mod (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_90_58_106_54_70 2) (* v_it_9 2) (* main_~x~0 4294967295)) 4294967296) 100000000)))))) (and (<= (* aux_div_aux_mod_v_main_~x~0_90_58_106 4294967296) main_~x~0) (<= main_~x~0 (+ (* aux_div_v_main_~x~0_90_58 4294967296) 10000000))))))} is VALID [2022-04-28 03:48:17,268 WARN L290 TraceCheckUtils]: 9: Hoare triple {1236#(exists ((aux_div_v_main_~x~0_90_58 Int) (aux_div_aux_mod_v_main_~x~0_90_58_106 Int)) (and (<= aux_div_v_main_~x~0_90_58 0) (< 0 (+ aux_div_aux_mod_v_main_~x~0_90_58_106 1)) (or (exists ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_90_58_106_54_70 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_90_58_106_54 Int)) (and (<= main_~x~0 (+ (* 4294967296 aux_div_aux_mod_aux_mod_v_main_~x~0_90_58_106_54) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_90_58_106_54_70 2))) (<= (+ (* 4294967296 aux_div_aux_mod_aux_mod_v_main_~x~0_90_58_106_54) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_90_58_106_54_70 2) (* aux_div_aux_mod_v_main_~x~0_90_58_106 4294967296)) (+ main_~x~0 (* aux_div_v_main_~x~0_90_58 4294967296) 10000000)) (< (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_90_58_106_54_70 2) (+ main_~x~0 4294967296)) (<= (+ main_~x~0 10000000) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_90_58_106_54_70 2)) (< (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_90_58_106_54_70 (* aux_div_aux_mod_v_main_~x~0_90_58_106 2147483648) (* aux_div_aux_mod_aux_mod_v_main_~x~0_90_58_106_54 2147483648)) main_~x~0) (forall ((v_it_9 Int)) (or (not (<= 1 v_it_9)) (not (<= (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_90_58_106_54_70 v_it_9 (* aux_div_aux_mod_v_main_~x~0_90_58_106 2147483648) (* aux_div_aux_mod_aux_mod_v_main_~x~0_90_58_106_54 2147483648) 1) main_~x~0)) (and (<= 10000000 (mod (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_90_58_106_54_70 2) (* v_it_9 2) (* main_~x~0 4294967295)) 4294967296)) (< (mod (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_90_58_106_54_70 2) (* v_it_9 2) (* main_~x~0 4294967295)) 4294967296) 100000000)))))) (and (<= (* aux_div_aux_mod_v_main_~x~0_90_58_106 4294967296) main_~x~0) (<= main_~x~0 (+ (* aux_div_v_main_~x~0_90_58 4294967296) 10000000))))))} [60] L8-2_primed-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {1240#(and (exists ((aux_div_v_main_~x~0_90_58 Int) (aux_div_aux_mod_v_main_~x~0_90_58_106 Int)) (and (<= aux_div_v_main_~x~0_90_58 0) (exists ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_90_58_106_54_70 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_90_58_106_54 Int)) (and (<= main_~x~0 (+ (* 4294967296 aux_div_aux_mod_aux_mod_v_main_~x~0_90_58_106_54) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_90_58_106_54_70 2))) (<= (+ (* 4294967296 aux_div_aux_mod_aux_mod_v_main_~x~0_90_58_106_54) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_90_58_106_54_70 2) (* aux_div_aux_mod_v_main_~x~0_90_58_106 4294967296)) (+ main_~x~0 (* aux_div_v_main_~x~0_90_58 4294967296) 10000000)) (< (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_90_58_106_54_70 2) (+ main_~x~0 4294967296)) (<= (+ main_~x~0 10000000) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_90_58_106_54_70 2)) (< (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_90_58_106_54_70 (* aux_div_aux_mod_v_main_~x~0_90_58_106 2147483648) (* aux_div_aux_mod_aux_mod_v_main_~x~0_90_58_106_54 2147483648)) main_~x~0) (forall ((v_it_9 Int)) (or (not (<= 1 v_it_9)) (not (<= (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_90_58_106_54_70 v_it_9 (* aux_div_aux_mod_v_main_~x~0_90_58_106 2147483648) (* aux_div_aux_mod_aux_mod_v_main_~x~0_90_58_106_54 2147483648) 1) main_~x~0)) (and (<= 10000000 (mod (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_90_58_106_54_70 2) (* v_it_9 2) (* main_~x~0 4294967295)) 4294967296)) (< (mod (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_90_58_106_54_70 2) (* v_it_9 2) (* main_~x~0 4294967295)) 4294967296) 100000000)))))) (< 0 (+ aux_div_aux_mod_v_main_~x~0_90_58_106 1)))) (not (< (mod main_~x~0 4294967296) 100000000)))} is UNKNOWN [2022-04-28 03:48:17,274 INFO L272 TraceCheckUtils]: 10: Hoare triple {1240#(and (exists ((aux_div_v_main_~x~0_90_58 Int) (aux_div_aux_mod_v_main_~x~0_90_58_106 Int)) (and (<= aux_div_v_main_~x~0_90_58 0) (exists ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_90_58_106_54_70 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_90_58_106_54 Int)) (and (<= main_~x~0 (+ (* 4294967296 aux_div_aux_mod_aux_mod_v_main_~x~0_90_58_106_54) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_90_58_106_54_70 2))) (<= (+ (* 4294967296 aux_div_aux_mod_aux_mod_v_main_~x~0_90_58_106_54) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_90_58_106_54_70 2) (* aux_div_aux_mod_v_main_~x~0_90_58_106 4294967296)) (+ main_~x~0 (* aux_div_v_main_~x~0_90_58 4294967296) 10000000)) (< (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_90_58_106_54_70 2) (+ main_~x~0 4294967296)) (<= (+ main_~x~0 10000000) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_90_58_106_54_70 2)) (< (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_90_58_106_54_70 (* aux_div_aux_mod_v_main_~x~0_90_58_106 2147483648) (* aux_div_aux_mod_aux_mod_v_main_~x~0_90_58_106_54 2147483648)) main_~x~0) (forall ((v_it_9 Int)) (or (not (<= 1 v_it_9)) (not (<= (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_90_58_106_54_70 v_it_9 (* aux_div_aux_mod_v_main_~x~0_90_58_106 2147483648) (* aux_div_aux_mod_aux_mod_v_main_~x~0_90_58_106_54 2147483648) 1) main_~x~0)) (and (<= 10000000 (mod (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_90_58_106_54_70 2) (* v_it_9 2) (* main_~x~0 4294967295)) 4294967296)) (< (mod (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_90_58_106_54_70 2) (* v_it_9 2) (* main_~x~0 4294967295)) 4294967296) 100000000)))))) (< 0 (+ aux_div_aux_mod_v_main_~x~0_90_58_106 1)))) (not (< (mod main_~x~0 4294967296) 100000000)))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1244#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:48:17,275 INFO L290 TraceCheckUtils]: 11: Hoare triple {1244#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1248#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:48:17,275 INFO L290 TraceCheckUtils]: 12: Hoare triple {1248#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1198#false} is VALID [2022-04-28 03:48:17,276 INFO L290 TraceCheckUtils]: 13: Hoare triple {1198#false} assume !false; {1198#false} is VALID [2022-04-28 03:48:17,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:48:17,276 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:48:30,235 WARN L232 SmtUtils]: Spent 5.68s on a formula simplification. DAG size of input: 63 DAG size of output: 61 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 03:48:42,123 INFO L290 TraceCheckUtils]: 13: Hoare triple {1198#false} assume !false; {1198#false} is VALID [2022-04-28 03:48:42,124 INFO L290 TraceCheckUtils]: 12: Hoare triple {1248#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1198#false} is VALID [2022-04-28 03:48:42,124 INFO L290 TraceCheckUtils]: 11: Hoare triple {1244#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1248#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:48:42,125 INFO L272 TraceCheckUtils]: 10: Hoare triple {1205#(<= main_~x~0 (* (div main_~x~0 2) 2))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1244#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:48:42,125 INFO L290 TraceCheckUtils]: 9: Hoare triple {1267#(or (< (mod main_~x~0 4294967296) 100000000) (<= main_~x~0 (* (div main_~x~0 2) 2)))} [60] L8-2_primed-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {1205#(<= main_~x~0 (* (div main_~x~0 2) 2))} is VALID [2022-04-28 03:48:42,204 INFO L290 TraceCheckUtils]: 8: Hoare triple {1271#(and (or (forall ((aux_div_aux_mod_aux_mod_v_main_~x~0_91_31_78_58 Int) (aux_div_aux_mod_v_main_~x~0_91_31_78 Int) (aux_div_v_main_~x~0_91_31 Int)) (or (<= (+ aux_div_aux_mod_v_main_~x~0_91_31_78 aux_div_aux_mod_aux_mod_v_main_~x~0_91_31_78_58) main_~x~0) (< (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_91_31_78_58) (* 2 aux_div_aux_mod_v_main_~x~0_91_31_78)) (+ (* aux_div_v_main_~x~0_91_31 4294967296) 100000000 main_~x~0)) (<= (+ main_~x~0 2) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_91_31_78_58)) (<= (+ (* aux_div_v_main_~x~0_91_31 4294967296) main_~x~0 4294967296) (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_91_31_78_58) (* 2 aux_div_aux_mod_v_main_~x~0_91_31_78))) (<= (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_91_31_78_58) main_~x~0) (exists ((v_it_9 Int)) (and (<= (+ v_it_9 main_~x~0 1) (+ aux_div_aux_mod_v_main_~x~0_91_31_78 aux_div_aux_mod_aux_mod_v_main_~x~0_91_31_78_58)) (<= 1 v_it_9) (or (not (< (mod (+ (* v_it_9 2) main_~x~0) 4294967296) 100000000)) (not (<= 10000000 (mod (+ (* v_it_9 2) main_~x~0) 4294967296)))))))) (not (<= 10000000 (mod main_~x~0 4294967296)))) (or (<= (div (+ 99999999 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (<= (div (* (- 1) main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1))))} [63] L9-2-->L8-2_primed: Formula: (let ((.cse3 (mod v_main_~x~0_82 4294967296))) (let ((.cse1 (<= 10000000 .cse3)) (.cse0 (< .cse3 100000000))) (or (= v_main_~x~0_82 v_main_~x~0_81) (and (= (mod (+ v_main_~x~0_81 v_main_~x~0_82) 2) 0) .cse0 .cse1 (< 0 (div (+ v_main_~x~0_82 (* (- 1) v_main_~x~0_81)) (- 2))) (forall ((v_it_9 Int)) (or (not (<= 1 v_it_9)) (not (<= (+ v_it_9 1) (div (+ v_main_~x~0_82 (* (- 1) v_main_~x~0_81)) (- 2)))) (let ((.cse2 (mod (+ v_main_~x~0_82 (* v_it_9 2)) 4294967296))) (and (< .cse2 100000000) (<= 10000000 .cse2)))))) (and (or (not .cse1) (not .cse0)) (= v_main_~x~0_81 v_main_~x~0_82))))) InVars {main_~x~0=v_main_~x~0_82} OutVars{main_~x~0=v_main_~x~0_81} AuxVars[] AssignedVars[main_~x~0] {1267#(or (< (mod main_~x~0 4294967296) 100000000) (<= main_~x~0 (* (div main_~x~0 2) 2)))} is VALID [2022-04-28 03:48:42,205 INFO L290 TraceCheckUtils]: 7: Hoare triple {1271#(and (or (forall ((aux_div_aux_mod_aux_mod_v_main_~x~0_91_31_78_58 Int) (aux_div_aux_mod_v_main_~x~0_91_31_78 Int) (aux_div_v_main_~x~0_91_31 Int)) (or (<= (+ aux_div_aux_mod_v_main_~x~0_91_31_78 aux_div_aux_mod_aux_mod_v_main_~x~0_91_31_78_58) main_~x~0) (< (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_91_31_78_58) (* 2 aux_div_aux_mod_v_main_~x~0_91_31_78)) (+ (* aux_div_v_main_~x~0_91_31 4294967296) 100000000 main_~x~0)) (<= (+ main_~x~0 2) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_91_31_78_58)) (<= (+ (* aux_div_v_main_~x~0_91_31 4294967296) main_~x~0 4294967296) (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_91_31_78_58) (* 2 aux_div_aux_mod_v_main_~x~0_91_31_78))) (<= (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_91_31_78_58) main_~x~0) (exists ((v_it_9 Int)) (and (<= (+ v_it_9 main_~x~0 1) (+ aux_div_aux_mod_v_main_~x~0_91_31_78 aux_div_aux_mod_aux_mod_v_main_~x~0_91_31_78_58)) (<= 1 v_it_9) (or (not (< (mod (+ (* v_it_9 2) main_~x~0) 4294967296) 100000000)) (not (<= 10000000 (mod (+ (* v_it_9 2) main_~x~0) 4294967296)))))))) (not (<= 10000000 (mod main_~x~0 4294967296)))) (or (<= (div (+ 99999999 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (<= (div (* (- 1) main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1))))} [62] L8-2_primed-->L9-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1271#(and (or (forall ((aux_div_aux_mod_aux_mod_v_main_~x~0_91_31_78_58 Int) (aux_div_aux_mod_v_main_~x~0_91_31_78 Int) (aux_div_v_main_~x~0_91_31 Int)) (or (<= (+ aux_div_aux_mod_v_main_~x~0_91_31_78 aux_div_aux_mod_aux_mod_v_main_~x~0_91_31_78_58) main_~x~0) (< (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_91_31_78_58) (* 2 aux_div_aux_mod_v_main_~x~0_91_31_78)) (+ (* aux_div_v_main_~x~0_91_31 4294967296) 100000000 main_~x~0)) (<= (+ main_~x~0 2) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_91_31_78_58)) (<= (+ (* aux_div_v_main_~x~0_91_31 4294967296) main_~x~0 4294967296) (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_91_31_78_58) (* 2 aux_div_aux_mod_v_main_~x~0_91_31_78))) (<= (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_91_31_78_58) main_~x~0) (exists ((v_it_9 Int)) (and (<= (+ v_it_9 main_~x~0 1) (+ aux_div_aux_mod_v_main_~x~0_91_31_78 aux_div_aux_mod_aux_mod_v_main_~x~0_91_31_78_58)) (<= 1 v_it_9) (or (not (< (mod (+ (* v_it_9 2) main_~x~0) 4294967296) 100000000)) (not (<= 10000000 (mod (+ (* v_it_9 2) main_~x~0) 4294967296)))))))) (not (<= 10000000 (mod main_~x~0 4294967296)))) (or (<= (div (+ 99999999 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (<= (div (* (- 1) main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1))))} is VALID [2022-04-28 03:48:43,965 INFO L290 TraceCheckUtils]: 6: Hoare triple {1271#(and (or (forall ((aux_div_aux_mod_aux_mod_v_main_~x~0_91_31_78_58 Int) (aux_div_aux_mod_v_main_~x~0_91_31_78 Int) (aux_div_v_main_~x~0_91_31 Int)) (or (<= (+ aux_div_aux_mod_v_main_~x~0_91_31_78 aux_div_aux_mod_aux_mod_v_main_~x~0_91_31_78_58) main_~x~0) (< (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_91_31_78_58) (* 2 aux_div_aux_mod_v_main_~x~0_91_31_78)) (+ (* aux_div_v_main_~x~0_91_31 4294967296) 100000000 main_~x~0)) (<= (+ main_~x~0 2) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_91_31_78_58)) (<= (+ (* aux_div_v_main_~x~0_91_31 4294967296) main_~x~0 4294967296) (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_91_31_78_58) (* 2 aux_div_aux_mod_v_main_~x~0_91_31_78))) (<= (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_91_31_78_58) main_~x~0) (exists ((v_it_9 Int)) (and (<= (+ v_it_9 main_~x~0 1) (+ aux_div_aux_mod_v_main_~x~0_91_31_78 aux_div_aux_mod_aux_mod_v_main_~x~0_91_31_78_58)) (<= 1 v_it_9) (or (not (< (mod (+ (* v_it_9 2) main_~x~0) 4294967296) 100000000)) (not (<= 10000000 (mod (+ (* v_it_9 2) main_~x~0) 4294967296)))))))) (not (<= 10000000 (mod main_~x~0 4294967296)))) (or (<= (div (+ 99999999 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (<= (div (* (- 1) main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1))))} [61] L9-2-->L8-2_primed: Formula: (let ((.cse0 (mod v_main_~x~0_80 4294967296))) (or (and (= v_main_~x~0_80 v_main_~x~0_79) (= |v_main_#t~post4_30| |v_main_#t~post4_29|)) (and (<= 10000000 .cse0) (= |v_main_#t~post4_29| |v_main_#t~post4_30|) (= v_main_~x~0_79 v_main_~x~0_80)) (and (<= (div (+ 10000000 (* (- 1) v_main_~x~0_79)) (- 4294967296)) (+ (div (+ v_main_~x~0_80 (- 4294967295)) 4294967296) 1)) (< .cse0 10000000) (< v_main_~x~0_80 v_main_~x~0_79)))) InVars {main_~x~0=v_main_~x~0_80, main_#t~post4=|v_main_#t~post4_30|} OutVars{main_~x~0=v_main_~x~0_79, main_#t~post4=|v_main_#t~post4_29|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1271#(and (or (forall ((aux_div_aux_mod_aux_mod_v_main_~x~0_91_31_78_58 Int) (aux_div_aux_mod_v_main_~x~0_91_31_78 Int) (aux_div_v_main_~x~0_91_31 Int)) (or (<= (+ aux_div_aux_mod_v_main_~x~0_91_31_78 aux_div_aux_mod_aux_mod_v_main_~x~0_91_31_78_58) main_~x~0) (< (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_91_31_78_58) (* 2 aux_div_aux_mod_v_main_~x~0_91_31_78)) (+ (* aux_div_v_main_~x~0_91_31 4294967296) 100000000 main_~x~0)) (<= (+ main_~x~0 2) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_91_31_78_58)) (<= (+ (* aux_div_v_main_~x~0_91_31 4294967296) main_~x~0 4294967296) (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_91_31_78_58) (* 2 aux_div_aux_mod_v_main_~x~0_91_31_78))) (<= (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_91_31_78_58) main_~x~0) (exists ((v_it_9 Int)) (and (<= (+ v_it_9 main_~x~0 1) (+ aux_div_aux_mod_v_main_~x~0_91_31_78 aux_div_aux_mod_aux_mod_v_main_~x~0_91_31_78_58)) (<= 1 v_it_9) (or (not (< (mod (+ (* v_it_9 2) main_~x~0) 4294967296) 100000000)) (not (<= 10000000 (mod (+ (* v_it_9 2) main_~x~0) 4294967296)))))))) (not (<= 10000000 (mod main_~x~0 4294967296)))) (or (<= (div (+ 99999999 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (<= (div (* (- 1) main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1))))} is VALID [2022-04-28 03:48:43,966 INFO L290 TraceCheckUtils]: 5: Hoare triple {1197#true} ~x~0 := 0; {1271#(and (or (forall ((aux_div_aux_mod_aux_mod_v_main_~x~0_91_31_78_58 Int) (aux_div_aux_mod_v_main_~x~0_91_31_78 Int) (aux_div_v_main_~x~0_91_31 Int)) (or (<= (+ aux_div_aux_mod_v_main_~x~0_91_31_78 aux_div_aux_mod_aux_mod_v_main_~x~0_91_31_78_58) main_~x~0) (< (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_91_31_78_58) (* 2 aux_div_aux_mod_v_main_~x~0_91_31_78)) (+ (* aux_div_v_main_~x~0_91_31 4294967296) 100000000 main_~x~0)) (<= (+ main_~x~0 2) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_91_31_78_58)) (<= (+ (* aux_div_v_main_~x~0_91_31 4294967296) main_~x~0 4294967296) (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_91_31_78_58) (* 2 aux_div_aux_mod_v_main_~x~0_91_31_78))) (<= (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_91_31_78_58) main_~x~0) (exists ((v_it_9 Int)) (and (<= (+ v_it_9 main_~x~0 1) (+ aux_div_aux_mod_v_main_~x~0_91_31_78 aux_div_aux_mod_aux_mod_v_main_~x~0_91_31_78_58)) (<= 1 v_it_9) (or (not (< (mod (+ (* v_it_9 2) main_~x~0) 4294967296) 100000000)) (not (<= 10000000 (mod (+ (* v_it_9 2) main_~x~0) 4294967296)))))))) (not (<= 10000000 (mod main_~x~0 4294967296)))) (or (<= (div (+ 99999999 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1)) (<= (div (* (- 1) main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1))))} is VALID [2022-04-28 03:48:43,967 INFO L272 TraceCheckUtils]: 4: Hoare triple {1197#true} call #t~ret5 := main(); {1197#true} is VALID [2022-04-28 03:48:43,967 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1197#true} {1197#true} #41#return; {1197#true} is VALID [2022-04-28 03:48:43,967 INFO L290 TraceCheckUtils]: 2: Hoare triple {1197#true} assume true; {1197#true} is VALID [2022-04-28 03:48:43,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {1197#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1197#true} is VALID [2022-04-28 03:48:43,967 INFO L272 TraceCheckUtils]: 0: Hoare triple {1197#true} call ULTIMATE.init(); {1197#true} is VALID [2022-04-28 03:48:43,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:48:43,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910217895] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:48:43,968 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:48:43,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 15 [2022-04-28 03:48:50,093 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:48:50,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [561079714] [2022-04-28 03:48:50,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [561079714] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:48:50,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:48:50,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 03:48:50,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909139697] [2022-04-28 03:48:50,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:48:50,094 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 03:48:50,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:48:50,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:50,149 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:48:50,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 03:48:50,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:48:50,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 03:48:50,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=291, Unknown=2, NotChecked=0, Total=380 [2022-04-28 03:48:50,150 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:52,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:52,267 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-04-28 03:48:52,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 03:48:52,267 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 03:48:52,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:48:52,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:52,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 39 transitions. [2022-04-28 03:48:52,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:52,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 39 transitions. [2022-04-28 03:48:52,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 39 transitions. [2022-04-28 03:48:52,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:48:52,357 INFO L225 Difference]: With dead ends: 34 [2022-04-28 03:48:52,357 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 03:48:52,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 22 SyntacticMatches, 11 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=153, Invalid=547, Unknown=2, NotChecked=0, Total=702 [2022-04-28 03:48:52,358 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 21 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 03:48:52,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 43 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 03:48:52,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 03:48:52,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-28 03:48:52,402 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:48:52,402 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:52,402 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:52,402 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:52,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:52,403 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-28 03:48:52,404 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-28 03:48:52,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:48:52,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:48:52,404 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-28 03:48:52,404 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-28 03:48:52,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:52,405 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-28 03:48:52,405 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-28 03:48:52,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:48:52,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:48:52,405 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:48:52,405 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:48:52,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:52,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-04-28 03:48:52,406 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 23 [2022-04-28 03:48:52,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:48:52,406 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-04-28 03:48:52,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:52,406 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 30 transitions. [2022-04-28 03:48:52,466 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:48:52,467 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-28 03:48:52,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 03:48:52,467 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:48:52,467 INFO L195 NwaCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:48:52,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 03:48:52,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:48:52,668 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:48:52,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:48:52,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1352532284, now seen corresponding path program 5 times [2022-04-28 03:48:52,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:48:52,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [209344913] [2022-04-28 03:48:57,201 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:48:57,545 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:48:58,234 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:48:58,236 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:48:58,247 INFO L85 PathProgramCache]: Analyzing trace with hash 211865519, now seen corresponding path program 1 times [2022-04-28 03:48:58,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:48:58,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364561597] [2022-04-28 03:48:58,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:48:58,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:48:58,256 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_6) (* (- 2) .v_it_11.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_11.0)) 4294967296)) 100000000) 0)) [2022-04-28 03:48:58,257 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) main_~x~0_6) (* (- 2) .v_it_11.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_11.0)) 4294967296)) 10000000) 0) [2022-04-28 03:48:58,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:58,293 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_6) (* (- 2) .v_it_11.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_11.1)) 4294967296)) 100000000) 0)) [2022-04-28 03:48:58,293 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) main_~x~0_6) (* (- 2) .v_it_11.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_11.1)) 4294967296)) 10000000) 0) [2022-04-28 03:48:58,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:48:58,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:58,643 INFO L290 TraceCheckUtils]: 0: Hoare triple {1504#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1493#true} is VALID [2022-04-28 03:48:58,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {1493#true} assume true; {1493#true} is VALID [2022-04-28 03:48:58,643 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1493#true} {1493#true} #41#return; {1493#true} is VALID [2022-04-28 03:48:58,644 INFO L272 TraceCheckUtils]: 0: Hoare triple {1493#true} call ULTIMATE.init(); {1504#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:48:58,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {1504#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1493#true} is VALID [2022-04-28 03:48:58,644 INFO L290 TraceCheckUtils]: 2: Hoare triple {1493#true} assume true; {1493#true} is VALID [2022-04-28 03:48:58,644 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1493#true} {1493#true} #41#return; {1493#true} is VALID [2022-04-28 03:48:58,644 INFO L272 TraceCheckUtils]: 4: Hoare triple {1493#true} call #t~ret5 := main(); {1493#true} is VALID [2022-04-28 03:48:58,644 INFO L290 TraceCheckUtils]: 5: Hoare triple {1493#true} ~x~0 := 0; {1498#(= main_~x~0 0)} is VALID [2022-04-28 03:48:58,645 INFO L290 TraceCheckUtils]: 6: Hoare triple {1498#(= main_~x~0 0)} [65] L9-2-->L8-2_primed: Formula: (let ((.cse0 (mod v_main_~x~0_103 4294967296)) (.cse1 (= |v_main_#t~post4_37| |v_main_#t~post4_36|)) (.cse2 (= v_main_~x~0_103 v_main_~x~0_102))) (or (and (< v_main_~x~0_103 v_main_~x~0_102) (<= (div (+ (* v_main_~x~0_102 (- 1)) 10000000) (- 4294967296)) (+ (div (+ v_main_~x~0_103 (- 4294967295)) 4294967296) 1)) (< .cse0 10000000)) (and (<= 10000000 .cse0) .cse1 .cse2) (and .cse1 .cse2))) InVars {main_~x~0=v_main_~x~0_103, main_#t~post4=|v_main_#t~post4_37|} OutVars{main_~x~0=v_main_~x~0_102, main_#t~post4=|v_main_#t~post4_36|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1499#(or (and (<= main_~x~0 0) (<= 0 main_~x~0)) (and (<= 1 main_~x~0) (<= main_~x~0 10000000)))} is VALID [2022-04-28 03:48:58,646 INFO L290 TraceCheckUtils]: 7: Hoare triple {1499#(or (and (<= main_~x~0 0) (<= 0 main_~x~0)) (and (<= 1 main_~x~0) (<= main_~x~0 10000000)))} [66] L8-2_primed-->L9-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1499#(or (and (<= main_~x~0 0) (<= 0 main_~x~0)) (and (<= 1 main_~x~0) (<= main_~x~0 10000000)))} is VALID [2022-04-28 03:48:58,649 INFO L290 TraceCheckUtils]: 8: Hoare triple {1499#(or (and (<= main_~x~0 0) (<= 0 main_~x~0)) (and (<= 1 main_~x~0) (<= main_~x~0 10000000)))} [67] L9-2-->L8-2_primed: Formula: (let ((.cse3 (mod v_main_~x~0_105 4294967296))) (let ((.cse2 (<= 10000000 .cse3)) (.cse1 (< .cse3 100000000))) (or (and (= (mod (+ v_main_~x~0_104 v_main_~x~0_105) 2) 0) (< 0 (div (+ v_main_~x~0_105 (* v_main_~x~0_104 (- 1))) (- 2))) (forall ((v_it_11 Int)) (or (not (<= 1 v_it_11)) (not (<= (+ v_it_11 1) (div (+ v_main_~x~0_105 (* v_main_~x~0_104 (- 1))) (- 2)))) (let ((.cse0 (mod (+ v_main_~x~0_105 (* 2 v_it_11)) 4294967296))) (and (<= 10000000 .cse0) (< .cse0 100000000))))) .cse1 .cse2) (and (= v_main_~x~0_104 v_main_~x~0_105) (or (not .cse2) (not .cse1))) (= v_main_~x~0_105 v_main_~x~0_104)))) InVars {main_~x~0=v_main_~x~0_105} OutVars{main_~x~0=v_main_~x~0_104} AuxVars[] AssignedVars[main_~x~0] {1500#(or (<= main_~x~0 (* (div main_~x~0 2) 2)) (and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 10000000)))} is VALID [2022-04-28 03:48:58,650 INFO L290 TraceCheckUtils]: 9: Hoare triple {1500#(or (<= main_~x~0 (* (div main_~x~0 2) 2)) (and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 10000000)))} [64] L8-2_primed-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {1501#(<= main_~x~0 (* (div main_~x~0 2) 2))} is VALID [2022-04-28 03:48:58,650 INFO L272 TraceCheckUtils]: 10: Hoare triple {1501#(<= main_~x~0 (* (div main_~x~0 2) 2))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1502#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:48:58,651 INFO L290 TraceCheckUtils]: 11: Hoare triple {1502#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1503#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:48:58,651 INFO L290 TraceCheckUtils]: 12: Hoare triple {1503#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1494#false} is VALID [2022-04-28 03:48:58,651 INFO L290 TraceCheckUtils]: 13: Hoare triple {1494#false} assume !false; {1494#false} is VALID [2022-04-28 03:48:58,651 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:48:58,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:48:58,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364561597] [2022-04-28 03:48:58,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364561597] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:48:58,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354794807] [2022-04-28 03:48:58,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:48:58,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:48:58,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:48:58,653 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:48:58,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 03:48:58,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:58,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 03:48:58,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:58,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:49:07,251 INFO L272 TraceCheckUtils]: 0: Hoare triple {1493#true} call ULTIMATE.init(); {1493#true} is VALID [2022-04-28 03:49:07,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {1493#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1493#true} is VALID [2022-04-28 03:49:07,252 INFO L290 TraceCheckUtils]: 2: Hoare triple {1493#true} assume true; {1493#true} is VALID [2022-04-28 03:49:07,252 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1493#true} {1493#true} #41#return; {1493#true} is VALID [2022-04-28 03:49:07,252 INFO L272 TraceCheckUtils]: 4: Hoare triple {1493#true} call #t~ret5 := main(); {1493#true} is VALID [2022-04-28 03:49:07,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {1493#true} ~x~0 := 0; {1498#(= main_~x~0 0)} is VALID [2022-04-28 03:49:07,258 INFO L290 TraceCheckUtils]: 6: Hoare triple {1498#(= main_~x~0 0)} [65] L9-2-->L8-2_primed: Formula: (let ((.cse0 (mod v_main_~x~0_103 4294967296)) (.cse1 (= |v_main_#t~post4_37| |v_main_#t~post4_36|)) (.cse2 (= v_main_~x~0_103 v_main_~x~0_102))) (or (and (< v_main_~x~0_103 v_main_~x~0_102) (<= (div (+ (* v_main_~x~0_102 (- 1)) 10000000) (- 4294967296)) (+ (div (+ v_main_~x~0_103 (- 4294967295)) 4294967296) 1)) (< .cse0 10000000)) (and (<= 10000000 .cse0) .cse1 .cse2) (and .cse1 .cse2))) InVars {main_~x~0=v_main_~x~0_103, main_#t~post4=|v_main_#t~post4_37|} OutVars{main_~x~0=v_main_~x~0_102, main_#t~post4=|v_main_#t~post4_36|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1499#(or (and (<= main_~x~0 0) (<= 0 main_~x~0)) (and (<= 1 main_~x~0) (<= main_~x~0 10000000)))} is VALID [2022-04-28 03:49:07,259 INFO L290 TraceCheckUtils]: 7: Hoare triple {1499#(or (and (<= main_~x~0 0) (<= 0 main_~x~0)) (and (<= 1 main_~x~0) (<= main_~x~0 10000000)))} [66] L8-2_primed-->L9-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1499#(or (and (<= main_~x~0 0) (<= 0 main_~x~0)) (and (<= 1 main_~x~0) (<= main_~x~0 10000000)))} is VALID [2022-04-28 03:49:07,276 INFO L290 TraceCheckUtils]: 8: Hoare triple {1499#(or (and (<= main_~x~0 0) (<= 0 main_~x~0)) (and (<= 1 main_~x~0) (<= main_~x~0 10000000)))} [67] L9-2-->L8-2_primed: Formula: (let ((.cse3 (mod v_main_~x~0_105 4294967296))) (let ((.cse2 (<= 10000000 .cse3)) (.cse1 (< .cse3 100000000))) (or (and (= (mod (+ v_main_~x~0_104 v_main_~x~0_105) 2) 0) (< 0 (div (+ v_main_~x~0_105 (* v_main_~x~0_104 (- 1))) (- 2))) (forall ((v_it_11 Int)) (or (not (<= 1 v_it_11)) (not (<= (+ v_it_11 1) (div (+ v_main_~x~0_105 (* v_main_~x~0_104 (- 1))) (- 2)))) (let ((.cse0 (mod (+ v_main_~x~0_105 (* 2 v_it_11)) 4294967296))) (and (<= 10000000 .cse0) (< .cse0 100000000))))) .cse1 .cse2) (and (= v_main_~x~0_104 v_main_~x~0_105) (or (not .cse2) (not .cse1))) (= v_main_~x~0_105 v_main_~x~0_104)))) InVars {main_~x~0=v_main_~x~0_105} OutVars{main_~x~0=v_main_~x~0_104} AuxVars[] AssignedVars[main_~x~0] {1532#(or (and (<= main_~x~0 0) (<= 0 main_~x~0)) (and (<= 1 main_~x~0) (<= main_~x~0 10000000)) (exists ((aux_div_v_main_~x~0_113_37 Int)) (and (forall ((v_it_11 Int)) (or (not (<= 1 v_it_11)) (and (<= 10000000 (mod (+ (* 2 aux_div_v_main_~x~0_113_37) (* 2 v_it_11) (* main_~x~0 4294967295)) 4294967296)) (< (mod (+ (* 2 aux_div_v_main_~x~0_113_37) (* 2 v_it_11) (* main_~x~0 4294967295)) 4294967296) 100000000)) (not (<= (+ v_it_11 aux_div_v_main_~x~0_113_37 1) main_~x~0)))) (<= (* 2 aux_div_v_main_~x~0_113_37) (+ main_~x~0 10000000)) (<= 10000000 (mod (+ (* 2 aux_div_v_main_~x~0_113_37) (* main_~x~0 4294967295)) 4294967296)) (<= (+ main_~x~0 1) (* 2 aux_div_v_main_~x~0_113_37)) (< aux_div_v_main_~x~0_113_37 main_~x~0))))} is VALID [2022-04-28 03:49:07,280 INFO L290 TraceCheckUtils]: 9: Hoare triple {1532#(or (and (<= main_~x~0 0) (<= 0 main_~x~0)) (and (<= 1 main_~x~0) (<= main_~x~0 10000000)) (exists ((aux_div_v_main_~x~0_113_37 Int)) (and (forall ((v_it_11 Int)) (or (not (<= 1 v_it_11)) (and (<= 10000000 (mod (+ (* 2 aux_div_v_main_~x~0_113_37) (* 2 v_it_11) (* main_~x~0 4294967295)) 4294967296)) (< (mod (+ (* 2 aux_div_v_main_~x~0_113_37) (* 2 v_it_11) (* main_~x~0 4294967295)) 4294967296) 100000000)) (not (<= (+ v_it_11 aux_div_v_main_~x~0_113_37 1) main_~x~0)))) (<= (* 2 aux_div_v_main_~x~0_113_37) (+ main_~x~0 10000000)) (<= 10000000 (mod (+ (* 2 aux_div_v_main_~x~0_113_37) (* main_~x~0 4294967295)) 4294967296)) (<= (+ main_~x~0 1) (* 2 aux_div_v_main_~x~0_113_37)) (< aux_div_v_main_~x~0_113_37 main_~x~0))))} [64] L8-2_primed-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {1536#(and (not (< (mod main_~x~0 4294967296) 100000000)) (exists ((aux_div_v_main_~x~0_113_37 Int)) (and (forall ((v_it_11 Int)) (or (not (<= 1 v_it_11)) (and (<= 10000000 (mod (+ (* 2 aux_div_v_main_~x~0_113_37) (* 2 v_it_11) (* main_~x~0 4294967295)) 4294967296)) (< (mod (+ (* 2 aux_div_v_main_~x~0_113_37) (* 2 v_it_11) (* main_~x~0 4294967295)) 4294967296) 100000000)) (not (<= (+ v_it_11 aux_div_v_main_~x~0_113_37 1) main_~x~0)))) (<= (* 2 aux_div_v_main_~x~0_113_37) (+ main_~x~0 10000000)) (<= 10000000 (mod (+ (* 2 aux_div_v_main_~x~0_113_37) (* main_~x~0 4294967295)) 4294967296)) (<= (+ main_~x~0 1) (* 2 aux_div_v_main_~x~0_113_37)) (< aux_div_v_main_~x~0_113_37 main_~x~0))))} is VALID [2022-04-28 03:49:07,283 INFO L272 TraceCheckUtils]: 10: Hoare triple {1536#(and (not (< (mod main_~x~0 4294967296) 100000000)) (exists ((aux_div_v_main_~x~0_113_37 Int)) (and (forall ((v_it_11 Int)) (or (not (<= 1 v_it_11)) (and (<= 10000000 (mod (+ (* 2 aux_div_v_main_~x~0_113_37) (* 2 v_it_11) (* main_~x~0 4294967295)) 4294967296)) (< (mod (+ (* 2 aux_div_v_main_~x~0_113_37) (* 2 v_it_11) (* main_~x~0 4294967295)) 4294967296) 100000000)) (not (<= (+ v_it_11 aux_div_v_main_~x~0_113_37 1) main_~x~0)))) (<= (* 2 aux_div_v_main_~x~0_113_37) (+ main_~x~0 10000000)) (<= 10000000 (mod (+ (* 2 aux_div_v_main_~x~0_113_37) (* main_~x~0 4294967295)) 4294967296)) (<= (+ main_~x~0 1) (* 2 aux_div_v_main_~x~0_113_37)) (< aux_div_v_main_~x~0_113_37 main_~x~0))))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1540#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:49:07,284 INFO L290 TraceCheckUtils]: 11: Hoare triple {1540#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1544#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:49:07,284 INFO L290 TraceCheckUtils]: 12: Hoare triple {1544#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1494#false} is VALID [2022-04-28 03:49:07,284 INFO L290 TraceCheckUtils]: 13: Hoare triple {1494#false} assume !false; {1494#false} is VALID [2022-04-28 03:49:07,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:49:07,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:49:43,092 INFO L290 TraceCheckUtils]: 13: Hoare triple {1494#false} assume !false; {1494#false} is VALID [2022-04-28 03:49:43,092 INFO L290 TraceCheckUtils]: 12: Hoare triple {1544#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1494#false} is VALID [2022-04-28 03:49:43,093 INFO L290 TraceCheckUtils]: 11: Hoare triple {1540#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1544#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:49:43,093 INFO L272 TraceCheckUtils]: 10: Hoare triple {1501#(<= main_~x~0 (* (div main_~x~0 2) 2))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1540#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:49:43,094 INFO L290 TraceCheckUtils]: 9: Hoare triple {1563#(or (< (mod main_~x~0 4294967296) 100000000) (<= main_~x~0 (* (div main_~x~0 2) 2)))} [64] L8-2_primed-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {1501#(<= main_~x~0 (* (div main_~x~0 2) 2))} is VALID [2022-04-28 03:49:45,099 WARN L290 TraceCheckUtils]: 8: Hoare triple {1567#(and (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (forall ((aux_div_v_main_~x~0_114_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_114_32_80_121_57 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_114_32_80_121 Int)) (or (< (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_114_32_80_121) main_~x~0) (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_114_32_80_121_57) 100000000 (* 4294967296 aux_div_v_main_~x~0_114_32))) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_114_32_80_121 0) (<= 2 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_114_32_80_121_57)) (exists ((v_it_11 Int)) (and (<= 1 v_it_11) (<= (+ v_it_11 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_114_32_80_121_57 1) aux_div_aux_mod_aux_mod_v_main_~x~0_114_32_80_121) (or (not (<= 10000000 (mod (+ main_~x~0 (* 2 v_it_11)) 4294967296))) (not (< (mod (+ main_~x~0 (* 2 v_it_11)) 4294967296) 100000000))))) (<= (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_114_32_80_121_57) (* 4294967296 aux_div_v_main_~x~0_114_32) 4294967296) (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_114_32_80_121) main_~x~0)) (< (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_114_32_80_121_57) 0))) (not (<= 10000000 (mod main_~x~0 4294967296)))) (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (<= (div (+ 99999999 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1))))} [67] L9-2-->L8-2_primed: Formula: (let ((.cse3 (mod v_main_~x~0_105 4294967296))) (let ((.cse2 (<= 10000000 .cse3)) (.cse1 (< .cse3 100000000))) (or (and (= (mod (+ v_main_~x~0_104 v_main_~x~0_105) 2) 0) (< 0 (div (+ v_main_~x~0_105 (* v_main_~x~0_104 (- 1))) (- 2))) (forall ((v_it_11 Int)) (or (not (<= 1 v_it_11)) (not (<= (+ v_it_11 1) (div (+ v_main_~x~0_105 (* v_main_~x~0_104 (- 1))) (- 2)))) (let ((.cse0 (mod (+ v_main_~x~0_105 (* 2 v_it_11)) 4294967296))) (and (<= 10000000 .cse0) (< .cse0 100000000))))) .cse1 .cse2) (and (= v_main_~x~0_104 v_main_~x~0_105) (or (not .cse2) (not .cse1))) (= v_main_~x~0_105 v_main_~x~0_104)))) InVars {main_~x~0=v_main_~x~0_105} OutVars{main_~x~0=v_main_~x~0_104} AuxVars[] AssignedVars[main_~x~0] {1563#(or (< (mod main_~x~0 4294967296) 100000000) (<= main_~x~0 (* (div main_~x~0 2) 2)))} is UNKNOWN [2022-04-28 03:49:47,132 WARN L290 TraceCheckUtils]: 7: Hoare triple {1567#(and (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (forall ((aux_div_v_main_~x~0_114_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_114_32_80_121_57 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_114_32_80_121 Int)) (or (< (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_114_32_80_121) main_~x~0) (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_114_32_80_121_57) 100000000 (* 4294967296 aux_div_v_main_~x~0_114_32))) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_114_32_80_121 0) (<= 2 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_114_32_80_121_57)) (exists ((v_it_11 Int)) (and (<= 1 v_it_11) (<= (+ v_it_11 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_114_32_80_121_57 1) aux_div_aux_mod_aux_mod_v_main_~x~0_114_32_80_121) (or (not (<= 10000000 (mod (+ main_~x~0 (* 2 v_it_11)) 4294967296))) (not (< (mod (+ main_~x~0 (* 2 v_it_11)) 4294967296) 100000000))))) (<= (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_114_32_80_121_57) (* 4294967296 aux_div_v_main_~x~0_114_32) 4294967296) (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_114_32_80_121) main_~x~0)) (< (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_114_32_80_121_57) 0))) (not (<= 10000000 (mod main_~x~0 4294967296)))) (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (<= (div (+ 99999999 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1))))} [66] L8-2_primed-->L9-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1567#(and (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (forall ((aux_div_v_main_~x~0_114_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_114_32_80_121_57 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_114_32_80_121 Int)) (or (< (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_114_32_80_121) main_~x~0) (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_114_32_80_121_57) 100000000 (* 4294967296 aux_div_v_main_~x~0_114_32))) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_114_32_80_121 0) (<= 2 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_114_32_80_121_57)) (exists ((v_it_11 Int)) (and (<= 1 v_it_11) (<= (+ v_it_11 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_114_32_80_121_57 1) aux_div_aux_mod_aux_mod_v_main_~x~0_114_32_80_121) (or (not (<= 10000000 (mod (+ main_~x~0 (* 2 v_it_11)) 4294967296))) (not (< (mod (+ main_~x~0 (* 2 v_it_11)) 4294967296) 100000000))))) (<= (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_114_32_80_121_57) (* 4294967296 aux_div_v_main_~x~0_114_32) 4294967296) (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_114_32_80_121) main_~x~0)) (< (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_114_32_80_121_57) 0))) (not (<= 10000000 (mod main_~x~0 4294967296)))) (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (<= (div (+ 99999999 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1))))} is UNKNOWN [2022-04-28 03:49:49,139 WARN L290 TraceCheckUtils]: 6: Hoare triple {1567#(and (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (forall ((aux_div_v_main_~x~0_114_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_114_32_80_121_57 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_114_32_80_121 Int)) (or (< (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_114_32_80_121) main_~x~0) (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_114_32_80_121_57) 100000000 (* 4294967296 aux_div_v_main_~x~0_114_32))) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_114_32_80_121 0) (<= 2 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_114_32_80_121_57)) (exists ((v_it_11 Int)) (and (<= 1 v_it_11) (<= (+ v_it_11 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_114_32_80_121_57 1) aux_div_aux_mod_aux_mod_v_main_~x~0_114_32_80_121) (or (not (<= 10000000 (mod (+ main_~x~0 (* 2 v_it_11)) 4294967296))) (not (< (mod (+ main_~x~0 (* 2 v_it_11)) 4294967296) 100000000))))) (<= (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_114_32_80_121_57) (* 4294967296 aux_div_v_main_~x~0_114_32) 4294967296) (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_114_32_80_121) main_~x~0)) (< (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_114_32_80_121_57) 0))) (not (<= 10000000 (mod main_~x~0 4294967296)))) (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (<= (div (+ 99999999 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1))))} [65] L9-2-->L8-2_primed: Formula: (let ((.cse0 (mod v_main_~x~0_103 4294967296)) (.cse1 (= |v_main_#t~post4_37| |v_main_#t~post4_36|)) (.cse2 (= v_main_~x~0_103 v_main_~x~0_102))) (or (and (< v_main_~x~0_103 v_main_~x~0_102) (<= (div (+ (* v_main_~x~0_102 (- 1)) 10000000) (- 4294967296)) (+ (div (+ v_main_~x~0_103 (- 4294967295)) 4294967296) 1)) (< .cse0 10000000)) (and (<= 10000000 .cse0) .cse1 .cse2) (and .cse1 .cse2))) InVars {main_~x~0=v_main_~x~0_103, main_#t~post4=|v_main_#t~post4_37|} OutVars{main_~x~0=v_main_~x~0_102, main_#t~post4=|v_main_#t~post4_36|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1567#(and (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (forall ((aux_div_v_main_~x~0_114_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_114_32_80_121_57 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_114_32_80_121 Int)) (or (< (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_114_32_80_121) main_~x~0) (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_114_32_80_121_57) 100000000 (* 4294967296 aux_div_v_main_~x~0_114_32))) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_114_32_80_121 0) (<= 2 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_114_32_80_121_57)) (exists ((v_it_11 Int)) (and (<= 1 v_it_11) (<= (+ v_it_11 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_114_32_80_121_57 1) aux_div_aux_mod_aux_mod_v_main_~x~0_114_32_80_121) (or (not (<= 10000000 (mod (+ main_~x~0 (* 2 v_it_11)) 4294967296))) (not (< (mod (+ main_~x~0 (* 2 v_it_11)) 4294967296) 100000000))))) (<= (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_114_32_80_121_57) (* 4294967296 aux_div_v_main_~x~0_114_32) 4294967296) (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_114_32_80_121) main_~x~0)) (< (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_114_32_80_121_57) 0))) (not (<= 10000000 (mod main_~x~0 4294967296)))) (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (<= (div (+ 99999999 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1))))} is UNKNOWN [2022-04-28 03:49:49,141 INFO L290 TraceCheckUtils]: 5: Hoare triple {1493#true} ~x~0 := 0; {1567#(and (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (forall ((aux_div_v_main_~x~0_114_32 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_114_32_80_121_57 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_114_32_80_121 Int)) (or (< (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_114_32_80_121) main_~x~0) (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_114_32_80_121_57) 100000000 (* 4294967296 aux_div_v_main_~x~0_114_32))) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_114_32_80_121 0) (<= 2 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_114_32_80_121_57)) (exists ((v_it_11 Int)) (and (<= 1 v_it_11) (<= (+ v_it_11 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_114_32_80_121_57 1) aux_div_aux_mod_aux_mod_v_main_~x~0_114_32_80_121) (or (not (<= 10000000 (mod (+ main_~x~0 (* 2 v_it_11)) 4294967296))) (not (< (mod (+ main_~x~0 (* 2 v_it_11)) 4294967296) 100000000))))) (<= (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_114_32_80_121_57) (* 4294967296 aux_div_v_main_~x~0_114_32) 4294967296) (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_114_32_80_121) main_~x~0)) (< (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_114_32_80_121_57) 0))) (not (<= 10000000 (mod main_~x~0 4294967296)))) (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (<= (div (+ 99999999 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1))))} is VALID [2022-04-28 03:49:49,141 INFO L272 TraceCheckUtils]: 4: Hoare triple {1493#true} call #t~ret5 := main(); {1493#true} is VALID [2022-04-28 03:49:49,141 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1493#true} {1493#true} #41#return; {1493#true} is VALID [2022-04-28 03:49:49,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {1493#true} assume true; {1493#true} is VALID [2022-04-28 03:49:49,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {1493#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1493#true} is VALID [2022-04-28 03:49:49,141 INFO L272 TraceCheckUtils]: 0: Hoare triple {1493#true} call ULTIMATE.init(); {1493#true} is VALID [2022-04-28 03:49:49,141 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:49:49,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354794807] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:49:49,142 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:49:49,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 15 [2022-04-28 03:50:10,549 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:50:10,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [209344913] [2022-04-28 03:50:10,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [209344913] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:50:10,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:50:10,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 03:50:10,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718118873] [2022-04-28 03:50:10,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:50:10,550 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 03:50:10,550 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:50:10,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:10,582 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:50:10,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 03:50:10,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:50:10,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 03:50:10,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=324, Unknown=5, NotChecked=0, Total=420 [2022-04-28 03:50:10,583 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:17,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:17,709 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-28 03:50:17,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 03:50:17,709 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 03:50:17,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:50:17,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:17,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 41 transitions. [2022-04-28 03:50:17,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:17,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 41 transitions. [2022-04-28 03:50:17,714 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 41 transitions. [2022-04-28 03:50:17,762 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:50:17,763 INFO L225 Difference]: With dead ends: 36 [2022-04-28 03:50:17,763 INFO L226 Difference]: Without dead ends: 29 [2022-04-28 03:50:17,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 21 SyntacticMatches, 13 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 29.7s TimeCoverageRelationStatistics Valid=165, Invalid=640, Unknown=7, NotChecked=0, Total=812 [2022-04-28 03:50:17,764 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 23 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 03:50:17,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 63 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 03:50:17,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-28 03:50:17,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-28 03:50:17,810 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:50:17,811 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:17,811 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:17,811 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:17,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:17,812 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-28 03:50:17,812 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-04-28 03:50:17,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:50:17,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:50:17,812 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-28 03:50:17,812 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-28 03:50:17,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:17,813 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-28 03:50:17,813 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-04-28 03:50:17,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:50:17,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:50:17,813 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:50:17,813 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:50:17,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:17,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-04-28 03:50:17,814 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 25 [2022-04-28 03:50:17,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:50:17,814 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-04-28 03:50:17,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:17,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 32 transitions. [2022-04-28 03:50:17,872 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:50:17,872 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-04-28 03:50:17,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 03:50:17,872 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:50:17,872 INFO L195 NwaCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:50:17,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-28 03:50:18,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:50:18,073 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:50:18,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:50:18,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1827998623, now seen corresponding path program 6 times [2022-04-28 03:50:18,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:50:18,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1732066252] [2022-04-28 03:50:22,566 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:50:22,930 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:50:23,372 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:50:23,373 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:50:23,377 INFO L85 PathProgramCache]: Analyzing trace with hash -2033569617, now seen corresponding path program 1 times [2022-04-28 03:50:23,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:50:23,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676440235] [2022-04-28 03:50:23,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:50:23,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:50:23,384 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_6) (* (- 2) .v_it_13.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_13.0)) 4294967296)) 100000000) 0)) [2022-04-28 03:50:23,385 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) main_~x~0_6) (* (- 2) .v_it_13.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_13.0)) 4294967296)) 10000000) 0) [2022-04-28 03:50:23,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:23,404 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_6) (* (- 2) .v_it_13.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_13.1)) 4294967296)) 100000000) 0)) [2022-04-28 03:50:23,404 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) main_~x~0_6) (* (- 2) .v_it_13.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_13.1)) 4294967296)) 10000000) 0) [2022-04-28 03:50:23,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:50:23,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:23,807 INFO L290 TraceCheckUtils]: 0: Hoare triple {1815#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1804#true} is VALID [2022-04-28 03:50:23,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {1804#true} assume true; {1804#true} is VALID [2022-04-28 03:50:23,807 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1804#true} {1804#true} #41#return; {1804#true} is VALID [2022-04-28 03:50:23,807 INFO L272 TraceCheckUtils]: 0: Hoare triple {1804#true} call ULTIMATE.init(); {1815#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:50:23,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {1815#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1804#true} is VALID [2022-04-28 03:50:23,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {1804#true} assume true; {1804#true} is VALID [2022-04-28 03:50:23,808 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1804#true} {1804#true} #41#return; {1804#true} is VALID [2022-04-28 03:50:23,808 INFO L272 TraceCheckUtils]: 4: Hoare triple {1804#true} call #t~ret5 := main(); {1804#true} is VALID [2022-04-28 03:50:23,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {1804#true} ~x~0 := 0; {1809#(= main_~x~0 0)} is VALID [2022-04-28 03:50:23,809 INFO L290 TraceCheckUtils]: 6: Hoare triple {1809#(= main_~x~0 0)} [69] L9-2-->L8-2_primed: Formula: (let ((.cse0 (mod v_main_~x~0_127 4294967296)) (.cse1 (= |v_main_#t~post4_44| |v_main_#t~post4_43|))) (or (and (<= (div (+ (* v_main_~x~0_126 (- 1)) 10000000) (- 4294967296)) (+ (div (+ v_main_~x~0_127 (- 4294967295)) 4294967296) 1)) (< .cse0 10000000) (< v_main_~x~0_127 v_main_~x~0_126)) (and (= v_main_~x~0_126 v_main_~x~0_127) (<= 10000000 .cse0) .cse1) (and .cse1 (= v_main_~x~0_127 v_main_~x~0_126)))) InVars {main_~x~0=v_main_~x~0_127, main_#t~post4=|v_main_#t~post4_44|} OutVars{main_~x~0=v_main_~x~0_126, main_#t~post4=|v_main_#t~post4_43|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1810#(or (and (<= 1 main_~x~0) (<= (div (+ (* (- 1) main_~x~0) 10000000) (- 4294967296)) 0)) (and (<= main_~x~0 0) (<= 0 main_~x~0)))} is VALID [2022-04-28 03:50:23,810 INFO L290 TraceCheckUtils]: 7: Hoare triple {1810#(or (and (<= 1 main_~x~0) (<= (div (+ (* (- 1) main_~x~0) 10000000) (- 4294967296)) 0)) (and (<= main_~x~0 0) (<= 0 main_~x~0)))} [70] L8-2_primed-->L9-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1810#(or (and (<= 1 main_~x~0) (<= (div (+ (* (- 1) main_~x~0) 10000000) (- 4294967296)) 0)) (and (<= main_~x~0 0) (<= 0 main_~x~0)))} is VALID [2022-04-28 03:50:23,813 INFO L290 TraceCheckUtils]: 8: Hoare triple {1810#(or (and (<= 1 main_~x~0) (<= (div (+ (* (- 1) main_~x~0) 10000000) (- 4294967296)) 0)) (and (<= main_~x~0 0) (<= 0 main_~x~0)))} [71] L9-2-->L8-2_primed: Formula: (let ((.cse4 (mod v_main_~x~0_129 4294967296))) (let ((.cse0 (= v_main_~x~0_129 v_main_~x~0_128)) (.cse2 (<= 10000000 .cse4)) (.cse3 (< .cse4 100000000))) (or .cse0 (and (= (mod (+ v_main_~x~0_129 v_main_~x~0_128) 2) 0) (forall ((v_it_13 Int)) (or (let ((.cse1 (mod (+ v_main_~x~0_129 (* 2 v_it_13)) 4294967296))) (and (<= 10000000 .cse1) (< .cse1 100000000))) (not (<= 1 v_it_13)) (not (<= (+ v_it_13 1) (div (+ v_main_~x~0_129 (* v_main_~x~0_128 (- 1))) (- 2)))))) (< 0 (div (+ v_main_~x~0_129 (* v_main_~x~0_128 (- 1))) (- 2))) .cse2 .cse3) (and .cse0 (or (not .cse2) (not .cse3)))))) InVars {main_~x~0=v_main_~x~0_129} OutVars{main_~x~0=v_main_~x~0_128} AuxVars[] AssignedVars[main_~x~0] {1811#(or (<= main_~x~0 (* (div main_~x~0 2) 2)) (<= main_~x~0 (+ 50000000 (div main_~x~0 2) (* (div main_~x~0 4294967296) 2147483648))))} is VALID [2022-04-28 03:50:23,814 INFO L290 TraceCheckUtils]: 9: Hoare triple {1811#(or (<= main_~x~0 (* (div main_~x~0 2) 2)) (<= main_~x~0 (+ 50000000 (div main_~x~0 2) (* (div main_~x~0 4294967296) 2147483648))))} [68] L8-2_primed-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {1812#(<= main_~x~0 (* (div main_~x~0 2) 2))} is VALID [2022-04-28 03:50:23,815 INFO L272 TraceCheckUtils]: 10: Hoare triple {1812#(<= main_~x~0 (* (div main_~x~0 2) 2))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1813#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:50:23,815 INFO L290 TraceCheckUtils]: 11: Hoare triple {1813#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1814#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:50:23,815 INFO L290 TraceCheckUtils]: 12: Hoare triple {1814#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1805#false} is VALID [2022-04-28 03:50:23,816 INFO L290 TraceCheckUtils]: 13: Hoare triple {1805#false} assume !false; {1805#false} is VALID [2022-04-28 03:50:23,816 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:50:23,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:50:23,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676440235] [2022-04-28 03:50:23,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676440235] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:50:23,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290128683] [2022-04-28 03:50:23,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:50:23,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:50:23,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:50:23,817 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:50:23,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 03:50:23,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:23,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 03:50:23,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:23,876 INFO L286 TraceCheckSpWp]: Computing forward predicates...