/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-e106359-m [2022-04-15 06:42:48,443 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 06:42:48,444 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 06:42:48,469 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 06:42:48,469 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 06:42:48,470 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 06:42:48,473 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 06:42:48,477 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 06:42:48,479 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 06:42:48,482 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 06:42:48,483 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 06:42:48,484 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 06:42:48,484 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 06:42:48,485 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 06:42:48,486 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 06:42:48,487 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 06:42:48,487 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 06:42:48,488 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 06:42:48,490 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 06:42:48,494 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 06:42:48,499 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 06:42:48,500 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 06:42:48,500 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 06:42:48,501 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 06:42:48,501 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 06:42:48,502 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 06:42:48,503 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 06:42:48,503 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 06:42:48,503 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 06:42:48,503 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 06:42:48,504 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 06:42:48,504 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 06:42:48,504 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 06:42:48,505 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 06:42:48,505 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 06:42:48,509 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 06:42:48,509 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 06:42:48,509 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 06:42:48,509 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 06:42:48,510 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 06:42:48,510 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 06:42:48,511 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 06:42:48,512 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 06:42:48,520 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 06:42:48,520 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 06:42:48,521 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 06:42:48,521 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 06:42:48,521 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 06:42:48,521 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 06:42:48,521 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 06:42:48,521 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 06:42:48,521 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 06:42:48,522 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 06:42:48,522 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 06:42:48,522 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 06:42:48,522 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 06:42:48,522 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 06:42:48,522 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 06:42:48,522 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 06:42:48,522 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 06:42:48,522 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 06:42:48,522 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:42:48,523 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 06:42:48,523 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 06:42:48,523 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 06:42:48,523 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 06:42:48,523 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 06:42:48,523 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 06:42:48,523 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-15 06:42:48,696 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 06:42:48,715 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 06:42:48,717 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 06:42:48,717 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 06:42:48,718 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 06:42:48,719 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-15 06:42:48,758 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2de3cdd4/9b26db52607b4e8b932b75791adc9c93/FLAGa3baa2038 [2022-04-15 06:42:49,107 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 06:42:49,108 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_11.c [2022-04-15 06:42:49,111 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2de3cdd4/9b26db52607b4e8b932b75791adc9c93/FLAGa3baa2038 [2022-04-15 06:42:49,126 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2de3cdd4/9b26db52607b4e8b932b75791adc9c93 [2022-04-15 06:42:49,128 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 06:42:49,129 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 06:42:49,131 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 06:42:49,131 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 06:42:49,134 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 06:42:49,137 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:42:49" (1/1) ... [2022-04-15 06:42:49,138 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26f5afe2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:42:49, skipping insertion in model container [2022-04-15 06:42:49,138 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:42:49" (1/1) ... [2022-04-15 06:42:49,143 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 06:42:49,151 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 06:42:49,287 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-15 06:42:49,297 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:42:49,318 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 06:42:49,335 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-15 06:42:49,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:42:49,348 INFO L208 MainTranslator]: Completed translation [2022-04-15 06:42:49,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:42:49 WrapperNode [2022-04-15 06:42:49,350 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 06:42:49,350 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 06:42:49,350 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 06:42:49,351 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 06:42:49,358 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:42:49" (1/1) ... [2022-04-15 06:42:49,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:42:49" (1/1) ... [2022-04-15 06:42:49,367 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:42:49" (1/1) ... [2022-04-15 06:42:49,367 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:42:49" (1/1) ... [2022-04-15 06:42:49,374 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:42:49" (1/1) ... [2022-04-15 06:42:49,378 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:42:49" (1/1) ... [2022-04-15 06:42:49,379 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:42:49" (1/1) ... [2022-04-15 06:42:49,381 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 06:42:49,382 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 06:42:49,382 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 06:42:49,382 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 06:42:49,383 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:42:49" (1/1) ... [2022-04-15 06:42:49,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:42:49,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:42:49,404 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-15 06:42:49,427 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-15 06:42:49,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 06:42:49,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 06:42:49,437 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 06:42:49,437 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 06:42:49,437 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 06:42:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 06:42:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 06:42:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 06:42:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 06:42:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 06:42:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 06:42:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 06:42:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 06:42:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 06:42:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 06:42:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 06:42:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 06:42:49,476 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 06:42:49,477 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 06:42:49,580 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 06:42:49,585 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 06:42:49,585 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 06:42:49,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:42:49 BoogieIcfgContainer [2022-04-15 06:42:49,586 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 06:42:49,587 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 06:42:49,587 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 06:42:49,602 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 06:42:49,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 06:42:49" (1/3) ... [2022-04-15 06:42:49,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@679a7c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:42:49, skipping insertion in model container [2022-04-15 06:42:49,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:42:49" (2/3) ... [2022-04-15 06:42:49,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@679a7c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:42:49, skipping insertion in model container [2022-04-15 06:42:49,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:42:49" (3/3) ... [2022-04-15 06:42:49,604 INFO L111 eAbstractionObserver]: Analyzing ICFG mono-crafted_11.c [2022-04-15 06:42:49,607 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 06:42:49,607 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 06:42:49,632 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 06:42:49,636 INFO L340 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 [2022-04-15 06:42:49,637 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 06:42:49,647 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-15 06:42:49,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 06:42:49,651 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:42:49,651 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:42:49,652 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:42:49,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:42:49,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1325153485, now seen corresponding path program 1 times [2022-04-15 06:42:49,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:49,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2027102345] [2022-04-15 06:42:49,667 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:42:49,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1325153485, now seen corresponding path program 2 times [2022-04-15 06:42:49,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:42:49,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136396148] [2022-04-15 06:42:49,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:49,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:42:49,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:49,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:42:49,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:49,839 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-15 06:42:49,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-15 06:42:49,840 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #41#return; {23#true} is VALID [2022-04-15 06:42:49,843 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-15 06:42:49,844 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-15 06:42:49,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-15 06:42:49,845 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #41#return; {23#true} is VALID [2022-04-15 06:42:49,845 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret5 := main(); {23#true} is VALID [2022-04-15 06:42:49,845 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} ~x~0 := 0; {23#true} is VALID [2022-04-15 06:42:49,846 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} assume !true; {24#false} is VALID [2022-04-15 06:42:49,846 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-15 06:42:49,846 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2022-04-15 06:42:49,847 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2022-04-15 06:42:49,847 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-15 06:42:49,847 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-15 06:42:49,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:42:49,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136396148] [2022-04-15 06:42:49,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136396148] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:42:49,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:42:49,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 06:42:49,853 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:42:49,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2027102345] [2022-04-15 06:42:49,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2027102345] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:42:49,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:42:49,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 06:42:49,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420838846] [2022-04-15 06:42:49,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:42:49,858 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-15 06:42:49,859 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:42:49,861 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-15 06:42:49,884 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-15 06:42:49,885 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 06:42:49,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:49,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 06:42:49,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 06:42:49,905 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-15 06:42:49,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:49,983 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-04-15 06:42:49,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 06:42:49,983 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-15 06:42:49,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:42:49,984 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-15 06:42:49,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-04-15 06:42:49,993 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-15 06:42:49,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-04-15 06:42:49,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 36 transitions. [2022-04-15 06:42:50,042 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-15 06:42:50,048 INFO L225 Difference]: With dead ends: 32 [2022-04-15 06:42:50,048 INFO L226 Difference]: Without dead ends: 13 [2022-04-15 06:42:50,050 INFO L912 BasicCegarLoop]: 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-15 06:42:50,053 INFO L913 BasicCegarLoop]: 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-15 06:42:50,055 INFO L914 BasicCegarLoop]: 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-15 06:42:50,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-15 06:42:50,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-15 06:42:50,076 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:42:50,077 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-15 06:42:50,077 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-15 06:42:50,078 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-15 06:42:50,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:50,083 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-15 06:42:50,083 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-15 06:42:50,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:50,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:50,084 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-15 06:42:50,084 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-15 06:42:50,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:50,087 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-15 06:42:50,087 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-15 06:42:50,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:50,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:50,088 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:42:50,088 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:42:50,088 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-15 06:42:50,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-04-15 06:42:50,090 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2022-04-15 06:42:50,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:42:50,090 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-04-15 06:42:50,090 INFO L479 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-15 06:42:50,090 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 14 transitions. [2022-04-15 06:42:50,107 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-15 06:42:50,108 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-15 06:42:50,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 06:42:50,110 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:42:50,111 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:42:50,114 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 06:42:50,115 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:42:50,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:42:50,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1315918275, now seen corresponding path program 1 times [2022-04-15 06:42:50,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:50,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [414344232] [2022-04-15 06:42:50,119 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:42:50,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1315918275, now seen corresponding path program 2 times [2022-04-15 06:42:50,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:42:50,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478587589] [2022-04-15 06:42:50,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:50,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:42:50,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:50,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:42:50,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:50,232 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-15 06:42:50,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {147#true} assume true; {147#true} is VALID [2022-04-15 06:42:50,232 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {147#true} {147#true} #41#return; {147#true} is VALID [2022-04-15 06:42:50,233 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-15 06:42:50,234 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-15 06:42:50,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {147#true} assume true; {147#true} is VALID [2022-04-15 06:42:50,235 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {147#true} {147#true} #41#return; {147#true} is VALID [2022-04-15 06:42:50,235 INFO L272 TraceCheckUtils]: 4: Hoare triple {147#true} call #t~ret5 := main(); {147#true} is VALID [2022-04-15 06:42:50,236 INFO L290 TraceCheckUtils]: 5: Hoare triple {147#true} ~x~0 := 0; {152#(= main_~x~0 0)} is VALID [2022-04-15 06:42:50,236 INFO L290 TraceCheckUtils]: 6: Hoare triple {152#(= main_~x~0 0)} assume !(~x~0 % 4294967296 < 100000000); {148#false} is VALID [2022-04-15 06:42:50,237 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-15 06:42:50,237 INFO L290 TraceCheckUtils]: 8: Hoare triple {148#false} ~cond := #in~cond; {148#false} is VALID [2022-04-15 06:42:50,237 INFO L290 TraceCheckUtils]: 9: Hoare triple {148#false} assume 0 == ~cond; {148#false} is VALID [2022-04-15 06:42:50,237 INFO L290 TraceCheckUtils]: 10: Hoare triple {148#false} assume !false; {148#false} is VALID [2022-04-15 06:42:50,238 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-15 06:42:50,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:42:50,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478587589] [2022-04-15 06:42:50,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478587589] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:42:50,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:42:50,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:42:50,241 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:42:50,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [414344232] [2022-04-15 06:42:50,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [414344232] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:42:50,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:42:50,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:42:50,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040145339] [2022-04-15 06:42:50,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:42:50,242 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-15 06:42:50,242 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:42:50,243 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-15 06:42:50,252 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-15 06:42:50,252 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 06:42:50,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:50,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 06:42:50,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 06:42:50,254 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-15 06:42:50,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:50,313 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-04-15 06:42:50,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 06:42:50,313 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-15 06:42:50,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:42:50,314 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-15 06:42:50,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-15 06:42:50,315 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-15 06:42:50,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-15 06:42:50,317 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 26 transitions. [2022-04-15 06:42:50,340 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-15 06:42:50,342 INFO L225 Difference]: With dead ends: 22 [2022-04-15 06:42:50,342 INFO L226 Difference]: Without dead ends: 15 [2022-04-15 06:42:50,344 INFO L912 BasicCegarLoop]: 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-15 06:42:50,347 INFO L913 BasicCegarLoop]: 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-15 06:42:50,347 INFO L914 BasicCegarLoop]: 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-15 06:42:50,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-15 06:42:50,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-15 06:42:50,354 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:42:50,354 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-15 06:42:50,355 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-15 06:42:50,355 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-15 06:42:50,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:50,356 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-15 06:42:50,356 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-15 06:42:50,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:50,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:50,356 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-15 06:42:50,357 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-15 06:42:50,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:50,357 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-15 06:42:50,357 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-15 06:42:50,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:50,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:50,358 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:42:50,358 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:42:50,358 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-15 06:42:50,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-15 06:42:50,359 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2022-04-15 06:42:50,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:42:50,359 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-15 06:42:50,359 INFO L479 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-15 06:42:50,359 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 16 transitions. [2022-04-15 06:42:50,392 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-15 06:42:50,393 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-15 06:42:50,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 06:42:50,393 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:42:50,393 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:42:50,393 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 06:42:50,394 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:42:50,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:42:50,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1372110560, now seen corresponding path program 1 times [2022-04-15 06:42:50,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:50,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [891311619] [2022-04-15 06:42:53,336 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:42:53,598 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-15 06:42:53,600 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:42:53,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1209153456, now seen corresponding path program 1 times [2022-04-15 06:42:53,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:42:53,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544412996] [2022-04-15 06:42:53,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:53,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:42:53,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:53,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:42:53,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:53,731 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-15 06:42:53,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-15 06:42:53,732 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {262#true} {262#true} #41#return; {262#true} is VALID [2022-04-15 06:42:53,732 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-15 06:42:53,732 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-15 06:42:53,733 INFO L290 TraceCheckUtils]: 2: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-15 06:42:53,733 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {262#true} {262#true} #41#return; {262#true} is VALID [2022-04-15 06:42:53,733 INFO L272 TraceCheckUtils]: 4: Hoare triple {262#true} call #t~ret5 := main(); {262#true} is VALID [2022-04-15 06:42:53,734 INFO L290 TraceCheckUtils]: 5: Hoare triple {262#true} ~x~0 := 0; {267#(= main_~x~0 0)} is VALID [2022-04-15 06:42:53,738 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-15 06:42:53,738 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-15 06:42:53,739 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-15 06:42:53,739 INFO L290 TraceCheckUtils]: 9: Hoare triple {263#false} ~cond := #in~cond; {263#false} is VALID [2022-04-15 06:42:53,740 INFO L290 TraceCheckUtils]: 10: Hoare triple {263#false} assume 0 == ~cond; {263#false} is VALID [2022-04-15 06:42:53,740 INFO L290 TraceCheckUtils]: 11: Hoare triple {263#false} assume !false; {263#false} is VALID [2022-04-15 06:42:53,740 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-15 06:42:53,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:42:53,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544412996] [2022-04-15 06:42:53,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544412996] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:42:53,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:42:53,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 06:42:53,822 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:42:53,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [891311619] [2022-04-15 06:42:53,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [891311619] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:42:53,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:42:53,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 06:42:53,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790920508] [2022-04-15 06:42:53,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:42:53,823 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-15 06:42:53,823 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:42:53,824 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-15 06:42:53,836 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-15 06:42:53,837 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 06:42:53,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:53,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 06:42:53,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-04-15 06:42:53,838 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-15 06:42:53,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:53,970 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-15 06:42:53,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 06:42:53,971 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-15 06:42:53,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:42:53,971 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-15 06:42:53,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-04-15 06:42:53,972 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-15 06:42:53,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-04-15 06:42:53,973 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 24 transitions. [2022-04-15 06:42:53,998 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-15 06:42:53,999 INFO L225 Difference]: With dead ends: 22 [2022-04-15 06:42:53,999 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 06:42:53,999 INFO L912 BasicCegarLoop]: 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-15 06:42:54,000 INFO L913 BasicCegarLoop]: 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-15 06:42:54,000 INFO L914 BasicCegarLoop]: 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-15 06:42:54,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 06:42:54,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-15 06:42:54,008 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:42:54,008 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-15 06:42:54,009 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-15 06:42:54,009 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-15 06:42:54,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:54,010 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-15 06:42:54,010 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 06:42:54,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:54,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:54,010 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-15 06:42:54,010 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-15 06:42:54,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:54,011 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-15 06:42:54,011 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 06:42:54,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:54,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:54,011 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:42:54,012 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:42:54,012 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-15 06:42:54,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-15 06:42:54,012 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2022-04-15 06:42:54,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:42:54,013 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-15 06:42:54,013 INFO L479 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-15 06:42:54,013 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-15 06:42:54,032 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-15 06:42:54,032 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 06:42:54,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 06:42:54,032 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:42:54,032 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:42:54,032 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 06:42:54,033 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:42:54,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:42:54,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1059749499, now seen corresponding path program 1 times [2022-04-15 06:42:54,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:54,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1677851288] [2022-04-15 06:42:57,101 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:42:57,312 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-15 06:42:57,716 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-15 06:42:57,719 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:42:57,723 INFO L85 PathProgramCache]: Analyzing trace with hash 603671471, now seen corresponding path program 1 times [2022-04-15 06:42:57,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:42:57,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021005047] [2022-04-15 06:42:57,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:57,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:42:57,742 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-15 06:42:57,745 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-15 06:42:57,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:57,836 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-15 06:42:57,837 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-15 06:42:57,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:42:57,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:57,952 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-15 06:42:57,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {390#true} assume true; {390#true} is VALID [2022-04-15 06:42:57,952 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {390#true} {390#true} #41#return; {390#true} is VALID [2022-04-15 06:42:57,953 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-15 06:42:57,953 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-15 06:42:57,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {390#true} assume true; {390#true} is VALID [2022-04-15 06:42:57,953 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {390#true} {390#true} #41#return; {390#true} is VALID [2022-04-15 06:42:57,953 INFO L272 TraceCheckUtils]: 4: Hoare triple {390#true} call #t~ret5 := main(); {390#true} is VALID [2022-04-15 06:42:57,954 INFO L290 TraceCheckUtils]: 5: Hoare triple {390#true} ~x~0 := 0; {395#(= main_~x~0 0)} is VALID [2022-04-15 06:42:57,955 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-15 06:42:57,955 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-15 06:42:58,031 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-15 06:42:58,032 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-15 06:42:58,032 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-15 06:42:58,033 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-15 06:42:58,033 INFO L290 TraceCheckUtils]: 12: Hoare triple {400#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {391#false} is VALID [2022-04-15 06:42:58,033 INFO L290 TraceCheckUtils]: 13: Hoare triple {391#false} assume !false; {391#false} is VALID [2022-04-15 06:42:58,034 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-15 06:42:58,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:42:58,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021005047] [2022-04-15 06:42:58,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021005047] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:42:58,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59567502] [2022-04-15 06:42:58,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:58,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:42:58,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:42:58,036 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-15 06:42:58,040 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-15 06:42:58,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:58,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:42:58,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:58,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:43:08,772 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-15 06:43:19,564 INFO L272 TraceCheckUtils]: 0: Hoare triple {390#true} call ULTIMATE.init(); {390#true} is VALID [2022-04-15 06:43:19,564 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-15 06:43:19,564 INFO L290 TraceCheckUtils]: 2: Hoare triple {390#true} assume true; {390#true} is VALID [2022-04-15 06:43:19,565 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {390#true} {390#true} #41#return; {390#true} is VALID [2022-04-15 06:43:19,565 INFO L272 TraceCheckUtils]: 4: Hoare triple {390#true} call #t~ret5 := main(); {390#true} is VALID [2022-04-15 06:43:19,567 INFO L290 TraceCheckUtils]: 5: Hoare triple {390#true} ~x~0 := 0; {395#(= main_~x~0 0)} is VALID [2022-04-15 06:43:19,568 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-15 06:43:19,569 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-15 06:43:19,638 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-15 06:43:21,643 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-15 06:43:21,646 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-15 06:43:21,647 INFO L290 TraceCheckUtils]: 11: Hoare triple {437#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {441#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:43:21,647 INFO L290 TraceCheckUtils]: 12: Hoare triple {441#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {391#false} is VALID [2022-04-15 06:43:21,647 INFO L290 TraceCheckUtils]: 13: Hoare triple {391#false} assume !false; {391#false} is VALID [2022-04-15 06:43:21,648 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-15 06:43:21,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:43:53,127 INFO L290 TraceCheckUtils]: 13: Hoare triple {391#false} assume !false; {391#false} is VALID [2022-04-15 06:43:53,128 INFO L290 TraceCheckUtils]: 12: Hoare triple {441#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {391#false} is VALID [2022-04-15 06:43:53,128 INFO L290 TraceCheckUtils]: 11: Hoare triple {437#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {441#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:43:53,129 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-15 06:43:53,129 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-15 06:43:55,137 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-15 06:43:55,139 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-15 06:43:55,704 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-15 06:43:55,706 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-15 06:43:55,706 INFO L272 TraceCheckUtils]: 4: Hoare triple {390#true} call #t~ret5 := main(); {390#true} is VALID [2022-04-15 06:43:55,707 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {390#true} {390#true} #41#return; {390#true} is VALID [2022-04-15 06:43:55,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {390#true} assume true; {390#true} is VALID [2022-04-15 06:43:55,707 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-15 06:43:55,707 INFO L272 TraceCheckUtils]: 0: Hoare triple {390#true} call ULTIMATE.init(); {390#true} is VALID [2022-04-15 06:43:55,707 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-15 06:43:55,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59567502] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:43:55,707 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:43:55,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 15 [2022-04-15 06:43:58,440 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:43:58,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1677851288] [2022-04-15 06:43:58,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1677851288] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:43:58,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:43:58,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 06:43:58,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586125621] [2022-04-15 06:43:58,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:43:58,441 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-15 06:43:58,442 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:43:58,442 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-15 06:43:58,463 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-15 06:43:58,463 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 06:43:58,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:43:58,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 06:43:58,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=180, Unknown=2, NotChecked=28, Total=272 [2022-04-15 06:43:58,464 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-15 06:43:59,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:59,521 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-04-15 06:43:59,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 06:43:59,522 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-15 06:43:59,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:43:59,522 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-15 06:43:59,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 38 transitions. [2022-04-15 06:43:59,523 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-15 06:43:59,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 38 transitions. [2022-04-15 06:43:59,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 38 transitions. [2022-04-15 06:43:59,566 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-15 06:43:59,567 INFO L225 Difference]: With dead ends: 31 [2022-04-15 06:43:59,567 INFO L226 Difference]: Without dead ends: 21 [2022-04-15 06:43:59,568 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=108, Invalid=356, Unknown=2, NotChecked=40, Total=506 [2022-04-15 06:43:59,568 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 20 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:43:59,568 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 31 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 06:43:59,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-15 06:43:59,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-15 06:43:59,583 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:43:59,584 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-15 06:43:59,584 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-15 06:43:59,584 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-15 06:43:59,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:59,586 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-04-15 06:43:59,586 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-15 06:43:59,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:43:59,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:43:59,587 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-15 06:43:59,587 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-15 06:43:59,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:59,588 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-04-15 06:43:59,588 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-15 06:43:59,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:43:59,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:43:59,588 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:43:59,588 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:43:59,588 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-15 06:43:59,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-04-15 06:43:59,589 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 15 [2022-04-15 06:43:59,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:43:59,589 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-04-15 06:43:59,589 INFO L479 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-15 06:43:59,589 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 24 transitions. [2022-04-15 06:43:59,632 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-15 06:43:59,632 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-15 06:43:59,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 06:43:59,632 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:43:59,632 INFO L499 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:43:59,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-15 06:43:59,833 WARN L460 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-15 06:43:59,833 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:43:59,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:43:59,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1662437453, now seen corresponding path program 2 times [2022-04-15 06:43:59,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:43:59,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1169793316] [2022-04-15 06:44:04,617 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:44:04,983 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-15 06:44:05,433 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-15 06:44:05,435 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:44:05,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1641763665, now seen corresponding path program 1 times [2022-04-15 06:44:05,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:44:05,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651221825] [2022-04-15 06:44:05,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:44:05,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:44:05,447 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-15 06:44:05,448 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-15 06:44:05,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:05,470 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-15 06:44:05,470 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-15 06:44:05,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:44:05,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:05,777 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-15 06:44:05,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {651#true} assume true; {651#true} is VALID [2022-04-15 06:44:05,777 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {651#true} {651#true} #41#return; {651#true} is VALID [2022-04-15 06:44:05,778 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-15 06:44:05,778 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-15 06:44:05,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {651#true} assume true; {651#true} is VALID [2022-04-15 06:44:05,778 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {651#true} {651#true} #41#return; {651#true} is VALID [2022-04-15 06:44:05,778 INFO L272 TraceCheckUtils]: 4: Hoare triple {651#true} call #t~ret5 := main(); {651#true} is VALID [2022-04-15 06:44:05,779 INFO L290 TraceCheckUtils]: 5: Hoare triple {651#true} ~x~0 := 0; {656#(= main_~x~0 0)} is VALID [2022-04-15 06:44:05,780 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-15 06:44:05,780 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-15 06:44:05,783 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-15 06:44:05,783 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-15 06:44:05,784 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-15 06:44:05,784 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-15 06:44:05,785 INFO L290 TraceCheckUtils]: 12: Hoare triple {661#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {652#false} is VALID [2022-04-15 06:44:05,785 INFO L290 TraceCheckUtils]: 13: Hoare triple {652#false} assume !false; {652#false} is VALID [2022-04-15 06:44:05,785 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-15 06:44:05,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:44:05,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651221825] [2022-04-15 06:44:05,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651221825] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:44:05,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327790755] [2022-04-15 06:44:05,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:44:05,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:44:05,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:44:05,787 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-15 06:44:05,788 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-15 06:44:05,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:05,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:44:05,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:05,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:45:10,921 INFO L272 TraceCheckUtils]: 0: Hoare triple {651#true} call ULTIMATE.init(); {651#true} is VALID [2022-04-15 06:45:10,922 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-15 06:45:10,922 INFO L290 TraceCheckUtils]: 2: Hoare triple {651#true} assume true; {651#true} is VALID [2022-04-15 06:45:10,922 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {651#true} {651#true} #41#return; {651#true} is VALID [2022-04-15 06:45:10,922 INFO L272 TraceCheckUtils]: 4: Hoare triple {651#true} call #t~ret5 := main(); {651#true} is VALID [2022-04-15 06:45:10,922 INFO L290 TraceCheckUtils]: 5: Hoare triple {651#true} ~x~0 := 0; {656#(= main_~x~0 0)} is VALID [2022-04-15 06:45:10,923 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-15 06:45:10,924 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-15 06:45:11,014 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-15 06:45:11,054 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-15 06:45:11,058 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-15 06:45:11,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-15 06:45:11,059 INFO L290 TraceCheckUtils]: 12: Hoare triple {702#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {652#false} is VALID [2022-04-15 06:45:11,059 INFO L290 TraceCheckUtils]: 13: Hoare triple {652#false} assume !false; {652#false} is VALID [2022-04-15 06:45:11,059 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-15 06:45:11,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:45:29,420 INFO L290 TraceCheckUtils]: 13: Hoare triple {652#false} assume !false; {652#false} is VALID [2022-04-15 06:45:29,430 INFO L290 TraceCheckUtils]: 12: Hoare triple {702#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {652#false} is VALID [2022-04-15 06:45:29,430 INFO L290 TraceCheckUtils]: 11: Hoare triple {698#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {702#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:45:29,431 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-15 06:45:29,432 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-15 06:45:31,437 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-15 06:45:31,442 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-15 06:45:33,466 WARN 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 UNKNOWN [2022-04-15 06:45:33,468 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-15 06:45:33,468 INFO L272 TraceCheckUtils]: 4: Hoare triple {651#true} call #t~ret5 := main(); {651#true} is VALID [2022-04-15 06:45:33,468 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {651#true} {651#true} #41#return; {651#true} is VALID [2022-04-15 06:45:33,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {651#true} assume true; {651#true} is VALID [2022-04-15 06:45:33,468 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-15 06:45:33,468 INFO L272 TraceCheckUtils]: 0: Hoare triple {651#true} call ULTIMATE.init(); {651#true} is VALID [2022-04-15 06:45:33,468 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-15 06:45:33,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327790755] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:45:33,469 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:45:33,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 15 [2022-04-15 06:45:34,232 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:45:34,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1169793316] [2022-04-15 06:45:34,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1169793316] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:45:34,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:45:34,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 06:45:34,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517476656] [2022-04-15 06:45:34,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:45:34,233 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-15 06:45:34,233 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:45:34,233 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-15 06:45:34,258 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-15 06:45:34,259 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 06:45:34,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:45:34,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 06:45:34,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=231, Unknown=1, NotChecked=0, Total=306 [2022-04-15 06:45:34,259 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-15 06:45:35,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:45:35,235 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-04-15 06:45:35,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 06:45:35,235 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-15 06:45:35,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:45:35,235 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-15 06:45:35,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-15 06:45:35,236 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-15 06:45:35,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-15 06:45:35,237 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 35 transitions. [2022-04-15 06:45:35,278 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-15 06:45:35,279 INFO L225 Difference]: With dead ends: 30 [2022-04-15 06:45:35,279 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 06:45:35,280 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 21 SyntacticMatches, 10 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=120, Invalid=385, Unknown=1, NotChecked=0, Total=506 [2022-04-15 06:45:35,280 INFO L913 BasicCegarLoop]: 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-15 06:45:35,280 INFO L914 BasicCegarLoop]: 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-15 06:45:35,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 06:45:35,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-15 06:45:35,314 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:45:35,314 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-15 06:45:35,314 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-15 06:45:35,315 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-15 06:45:35,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:45:35,315 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-04-15 06:45:35,315 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-04-15 06:45:35,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:45:35,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:45:35,316 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-15 06:45:35,316 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-15 06:45:35,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:45:35,317 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-04-15 06:45:35,317 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-04-15 06:45:35,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:45:35,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:45:35,317 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:45:35,317 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:45:35,317 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-15 06:45:35,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2022-04-15 06:45:35,318 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 19 [2022-04-15 06:45:35,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:45:35,318 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2022-04-15 06:45:35,318 INFO L479 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-15 06:45:35,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 26 transitions. [2022-04-15 06:45:35,353 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-15 06:45:35,353 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-04-15 06:45:35,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 06:45:35,353 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:45:35,353 INFO L499 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:45:35,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-15 06:45:35,569 WARN L460 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-15 06:45:35,569 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:45:35,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:45:35,571 INFO L85 PathProgramCache]: Analyzing trace with hash 361874638, now seen corresponding path program 3 times [2022-04-15 06:45:35,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:45:35,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [641366851] [2022-04-15 06:45:40,881 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:45:41,463 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-15 06:45:41,896 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-15 06:45:41,898 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:45:41,901 INFO L85 PathProgramCache]: Analyzing trace with hash 407768495, now seen corresponding path program 1 times [2022-04-15 06:45:41,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:45:41,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105279763] [2022-04-15 06:45:41,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:45:41,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:45:41,916 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-15 06:45:41,917 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-15 06:45:41,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:45:41,945 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-15 06:45:41,945 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-15 06:45:42,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:45:42,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:45:42,286 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-15 06:45:42,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {917#true} assume true; {917#true} is VALID [2022-04-15 06:45:42,286 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {917#true} {917#true} #41#return; {917#true} is VALID [2022-04-15 06:45:42,286 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-15 06:45:42,287 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-15 06:45:42,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {917#true} assume true; {917#true} is VALID [2022-04-15 06:45:42,287 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {917#true} {917#true} #41#return; {917#true} is VALID [2022-04-15 06:45:42,287 INFO L272 TraceCheckUtils]: 4: Hoare triple {917#true} call #t~ret5 := main(); {917#true} is VALID [2022-04-15 06:45:42,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {917#true} ~x~0 := 0; {922#(= main_~x~0 0)} is VALID [2022-04-15 06:45:42,288 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-15 06:45:42,296 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-15 06:45:42,303 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-15 06:45:42,304 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-15 06:45:42,304 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-15 06:45:42,305 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-15 06:45:42,305 INFO L290 TraceCheckUtils]: 12: Hoare triple {927#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {918#false} is VALID [2022-04-15 06:45:42,305 INFO L290 TraceCheckUtils]: 13: Hoare triple {918#false} assume !false; {918#false} is VALID [2022-04-15 06:45:42,305 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-15 06:45:42,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:45:42,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105279763] [2022-04-15 06:45:42,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105279763] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:45:42,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193052457] [2022-04-15 06:45:42,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:45:42,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:45:42,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:45:42,307 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-15 06:45:42,307 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-15 06:45:42,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:45:42,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:45:42,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:45:42,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:46:45,295 INFO L272 TraceCheckUtils]: 0: Hoare triple {917#true} call ULTIMATE.init(); {917#true} is VALID [2022-04-15 06:46:45,296 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-15 06:46:45,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {917#true} assume true; {917#true} is VALID [2022-04-15 06:46:45,296 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {917#true} {917#true} #41#return; {917#true} is VALID [2022-04-15 06:46:45,296 INFO L272 TraceCheckUtils]: 4: Hoare triple {917#true} call #t~ret5 := main(); {917#true} is VALID [2022-04-15 06:46:45,296 INFO L290 TraceCheckUtils]: 5: Hoare triple {917#true} ~x~0 := 0; {922#(= main_~x~0 0)} is VALID [2022-04-15 06:46:45,297 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-15 06:46:45,298 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-15 06:46:45,324 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-15 06:46:45,356 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-15 06:46:45,360 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-15 06:46:45,360 INFO L290 TraceCheckUtils]: 11: Hoare triple {964#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {968#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:46:45,360 INFO L290 TraceCheckUtils]: 12: Hoare triple {968#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {918#false} is VALID [2022-04-15 06:46:45,360 INFO L290 TraceCheckUtils]: 13: Hoare triple {918#false} assume !false; {918#false} is VALID [2022-04-15 06:46:45,361 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-15 06:46:45,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:49:08,018 INFO L290 TraceCheckUtils]: 13: Hoare triple {918#false} assume !false; {918#false} is VALID [2022-04-15 06:49:08,019 INFO L290 TraceCheckUtils]: 12: Hoare triple {968#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {918#false} is VALID [2022-04-15 06:49:08,019 INFO L290 TraceCheckUtils]: 11: Hoare triple {964#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {968#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:49:08,020 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-15 06:49:08,021 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-15 06:49:10,034 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-15 06:49:10,042 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-15 06:49:12,056 WARN 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 UNKNOWN [2022-04-15 06:49:12,057 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-15 06:49:12,057 INFO L272 TraceCheckUtils]: 4: Hoare triple {917#true} call #t~ret5 := main(); {917#true} is VALID [2022-04-15 06:49:12,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {917#true} {917#true} #41#return; {917#true} is VALID [2022-04-15 06:49:12,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {917#true} assume true; {917#true} is VALID [2022-04-15 06:49:12,057 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-15 06:49:12,058 INFO L272 TraceCheckUtils]: 0: Hoare triple {917#true} call ULTIMATE.init(); {917#true} is VALID [2022-04-15 06:49:12,058 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-15 06:49:12,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193052457] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:49:12,058 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:49:12,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 14 [2022-04-15 06:49:17,150 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:49:17,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [641366851] [2022-04-15 06:49:17,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [641366851] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:49:17,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:49:17,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 06:49:17,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452496505] [2022-04-15 06:49:17,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:49:17,151 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-15 06:49:17,151 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:49:17,151 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-15 06:49:17,174 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-15 06:49:17,174 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 06:49:17,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:49:17,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 06:49:17,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=238, Unknown=1, NotChecked=0, Total=306 [2022-04-15 06:49:17,175 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-15 06:49:20,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:49:20,685 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-04-15 06:49:20,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 06:49:20,685 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-15 06:49:20,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:49:20,685 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-15 06:49:20,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 37 transitions. [2022-04-15 06:49:20,686 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-15 06:49:20,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 37 transitions. [2022-04-15 06:49:20,692 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 37 transitions. [2022-04-15 06:49:20,733 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-15 06:49:20,734 INFO L225 Difference]: With dead ends: 32 [2022-04-15 06:49:20,734 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 06:49:20,734 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 21 SyntacticMatches, 12 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=116, Invalid=434, Unknown=2, NotChecked=0, Total=552 [2022-04-15 06:49:20,735 INFO L913 BasicCegarLoop]: 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-15 06:49:20,735 INFO L914 BasicCegarLoop]: 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-15 06:49:20,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 06:49:20,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-15 06:49:20,763 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:49:20,763 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-15 06:49:20,763 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-15 06:49:20,763 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-15 06:49:20,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:49:20,764 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-15 06:49:20,764 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-15 06:49:20,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:49:20,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:49:20,765 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-15 06:49:20,765 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-15 06:49:20,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:49:20,765 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-15 06:49:20,765 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-15 06:49:20,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:49:20,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:49:20,766 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:49:20,766 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:49:20,766 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-15 06:49:20,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-04-15 06:49:20,767 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 21 [2022-04-15 06:49:20,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:49:20,767 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-04-15 06:49:20,767 INFO L479 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-15 06:49:20,767 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 28 transitions. [2022-04-15 06:49:20,816 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-15 06:49:20,816 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-15 06:49:20,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 06:49:20,816 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:49:20,816 INFO L499 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:49:20,823 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-15 06:49:21,017 WARN L460 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-15 06:49:21,017 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:49:21,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:49:21,017 INFO L85 PathProgramCache]: Analyzing trace with hash 105609001, now seen corresponding path program 4 times [2022-04-15 06:49:21,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:49:21,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1652280084] [2022-04-15 06:49:25,635 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:49:26,170 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-15 06:49:28,760 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-15 06:49:28,762 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:49:28,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1837666641, now seen corresponding path program 1 times [2022-04-15 06:49:28,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:49:28,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898371747] [2022-04-15 06:49:28,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:49:28,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:49:28,786 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-15 06:49:28,786 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-15 06:49:28,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:28,801 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-15 06:49:28,802 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-15 06:49:29,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:49:29,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:29,128 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-15 06:49:29,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {1197#true} assume true; {1197#true} is VALID [2022-04-15 06:49:29,128 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1197#true} {1197#true} #41#return; {1197#true} is VALID [2022-04-15 06:49:29,129 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-15 06:49:29,129 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-15 06:49:29,129 INFO L290 TraceCheckUtils]: 2: Hoare triple {1197#true} assume true; {1197#true} is VALID [2022-04-15 06:49:29,129 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1197#true} {1197#true} #41#return; {1197#true} is VALID [2022-04-15 06:49:29,129 INFO L272 TraceCheckUtils]: 4: Hoare triple {1197#true} call #t~ret5 := main(); {1197#true} is VALID [2022-04-15 06:49:29,130 INFO L290 TraceCheckUtils]: 5: Hoare triple {1197#true} ~x~0 := 0; {1202#(= main_~x~0 0)} is VALID [2022-04-15 06:49:29,131 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-15 06:49:29,131 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-15 06:49:29,133 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-15 06:49:29,134 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-15 06:49:29,134 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-15 06:49:29,135 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-15 06:49:29,135 INFO L290 TraceCheckUtils]: 12: Hoare triple {1207#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1198#false} is VALID [2022-04-15 06:49:29,135 INFO L290 TraceCheckUtils]: 13: Hoare triple {1198#false} assume !false; {1198#false} is VALID [2022-04-15 06:49:29,135 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-15 06:49:29,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:49:29,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898371747] [2022-04-15 06:49:29,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898371747] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:49:29,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129810864] [2022-04-15 06:49:29,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:49:29,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:49:29,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:49:29,137 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-15 06:49:29,137 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-15 06:49:29,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:29,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:49:29,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:29,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:50:00,627 INFO L272 TraceCheckUtils]: 0: Hoare triple {1197#true} call ULTIMATE.init(); {1197#true} is VALID [2022-04-15 06:50:00,627 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-15 06:50:00,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {1197#true} assume true; {1197#true} is VALID [2022-04-15 06:50:00,627 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1197#true} {1197#true} #41#return; {1197#true} is VALID [2022-04-15 06:50:00,628 INFO L272 TraceCheckUtils]: 4: Hoare triple {1197#true} call #t~ret5 := main(); {1197#true} is VALID [2022-04-15 06:50:00,631 INFO L290 TraceCheckUtils]: 5: Hoare triple {1197#true} ~x~0 := 0; {1202#(= main_~x~0 0)} is VALID [2022-04-15 06:50:00,632 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-15 06:50:00,632 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-15 06:50:00,953 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-15 06:50:02,959 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-15 06:50:02,965 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-15 06:50:02,965 INFO L290 TraceCheckUtils]: 11: Hoare triple {1244#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1248#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:50:02,966 INFO L290 TraceCheckUtils]: 12: Hoare triple {1248#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1198#false} is VALID [2022-04-15 06:50:02,966 INFO L290 TraceCheckUtils]: 13: Hoare triple {1198#false} assume !false; {1198#false} is VALID [2022-04-15 06:50:02,966 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-15 06:50:02,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:50:19,111 INFO L290 TraceCheckUtils]: 13: Hoare triple {1198#false} assume !false; {1198#false} is VALID [2022-04-15 06:50:19,112 INFO L290 TraceCheckUtils]: 12: Hoare triple {1248#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1198#false} is VALID [2022-04-15 06:50:19,112 INFO L290 TraceCheckUtils]: 11: Hoare triple {1244#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1248#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:50:19,113 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-15 06:50:19,113 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-15 06:50:21,123 WARN 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 UNKNOWN [2022-04-15 06:50:21,125 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-15 06:50:23,163 WARN 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 UNKNOWN [2022-04-15 06:50:23,164 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-15 06:50:23,164 INFO L272 TraceCheckUtils]: 4: Hoare triple {1197#true} call #t~ret5 := main(); {1197#true} is VALID [2022-04-15 06:50:23,164 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1197#true} {1197#true} #41#return; {1197#true} is VALID [2022-04-15 06:50:23,164 INFO L290 TraceCheckUtils]: 2: Hoare triple {1197#true} assume true; {1197#true} is VALID [2022-04-15 06:50:23,164 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-15 06:50:23,164 INFO L272 TraceCheckUtils]: 0: Hoare triple {1197#true} call ULTIMATE.init(); {1197#true} is VALID [2022-04-15 06:50:23,165 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-15 06:50:23,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129810864] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:50:23,165 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:50:23,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 15 [2022-04-15 06:50:35,159 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:50:35,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1652280084] [2022-04-15 06:50:35,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1652280084] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:50:35,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:50:35,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 06:50:35,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91639073] [2022-04-15 06:50:35,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:50:35,160 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-15 06:50:35,160 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:50:35,160 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-15 06:50:35,200 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-15 06:50:35,200 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 06:50:35,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:50:35,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 06:50:35,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=287, Unknown=7, NotChecked=0, Total=380 [2022-04-15 06:50:35,201 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-15 06:50:37,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:50:37,279 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-04-15 06:50:37,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 06:50:37,279 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-15 06:50:37,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:50:37,279 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-15 06:50:37,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 39 transitions. [2022-04-15 06:50:37,280 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-15 06:50:37,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 39 transitions. [2022-04-15 06:50:37,281 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 39 transitions. [2022-04-15 06:50:37,349 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-15 06:50:37,350 INFO L225 Difference]: With dead ends: 34 [2022-04-15 06:50:37,350 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 06:50:37,351 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 22 SyntacticMatches, 11 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 21.9s TimeCoverageRelationStatistics Valid=152, Invalid=543, Unknown=7, NotChecked=0, Total=702 [2022-04-15 06:50:37,351 INFO L913 BasicCegarLoop]: 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-15 06:50:37,351 INFO L914 BasicCegarLoop]: 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-15 06:50:37,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 06:50:37,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-15 06:50:37,390 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:50:37,391 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-15 06:50:37,391 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-15 06:50:37,391 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-15 06:50:37,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:50:37,392 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-15 06:50:37,392 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-15 06:50:37,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:50:37,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:50:37,392 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-15 06:50:37,392 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-15 06:50:37,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:50:37,393 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-15 06:50:37,393 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-15 06:50:37,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:50:37,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:50:37,394 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:50:37,394 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:50:37,394 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-15 06:50:37,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-04-15 06:50:37,394 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 23 [2022-04-15 06:50:37,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:50:37,395 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-04-15 06:50:37,395 INFO L479 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-15 06:50:37,395 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 30 transitions. [2022-04-15 06:50:37,445 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-15 06:50:37,446 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-15 06:50:37,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 06:50:37,446 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:50:37,446 INFO L499 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:50:37,450 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-15 06:50:37,646 WARN L460 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-15 06:50:37,647 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:50:37,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:50:37,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1352532284, now seen corresponding path program 5 times [2022-04-15 06:50:37,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:50:37,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1116781344] [2022-04-15 06:50:38,576 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-15 06:50:41,003 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:50:41,306 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-15 06:50:41,309 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:50:41,313 INFO L85 PathProgramCache]: Analyzing trace with hash 211865519, now seen corresponding path program 1 times [2022-04-15 06:50:41,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:50:41,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91271551] [2022-04-15 06:50:41,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:50:41,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:50:41,321 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-15 06:50:41,321 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-15 06:50:41,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:50:41,348 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-15 06:50:41,348 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-15 06:50:41,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:50:41,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:50:41,710 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-15 06:50:41,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {1493#true} assume true; {1493#true} is VALID [2022-04-15 06:50:41,710 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1493#true} {1493#true} #41#return; {1493#true} is VALID [2022-04-15 06:50:41,716 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-15 06:50:41,716 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-15 06:50:41,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {1493#true} assume true; {1493#true} is VALID [2022-04-15 06:50:41,716 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1493#true} {1493#true} #41#return; {1493#true} is VALID [2022-04-15 06:50:41,716 INFO L272 TraceCheckUtils]: 4: Hoare triple {1493#true} call #t~ret5 := main(); {1493#true} is VALID [2022-04-15 06:50:41,716 INFO L290 TraceCheckUtils]: 5: Hoare triple {1493#true} ~x~0 := 0; {1498#(= main_~x~0 0)} is VALID [2022-04-15 06:50:41,717 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-15 06:50:41,718 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-15 06:50:41,722 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-15 06:50:41,723 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-15 06:50:41,724 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-15 06:50:41,724 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-15 06:50:41,725 INFO L290 TraceCheckUtils]: 12: Hoare triple {1503#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1494#false} is VALID [2022-04-15 06:50:41,725 INFO L290 TraceCheckUtils]: 13: Hoare triple {1494#false} assume !false; {1494#false} is VALID [2022-04-15 06:50:41,725 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-15 06:50:41,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:50:41,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91271551] [2022-04-15 06:50:41,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91271551] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:50:41,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342399174] [2022-04-15 06:50:41,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:50:41,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:50:41,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:50:41,726 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-15 06:50:41,727 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-15 06:50:41,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:50:41,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:50:41,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:50:41,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:50:49,953 INFO L272 TraceCheckUtils]: 0: Hoare triple {1493#true} call ULTIMATE.init(); {1493#true} is VALID [2022-04-15 06:50:49,953 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-15 06:50:49,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {1493#true} assume true; {1493#true} is VALID [2022-04-15 06:50:49,953 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1493#true} {1493#true} #41#return; {1493#true} is VALID [2022-04-15 06:50:49,953 INFO L272 TraceCheckUtils]: 4: Hoare triple {1493#true} call #t~ret5 := main(); {1493#true} is VALID [2022-04-15 06:50:49,958 INFO L290 TraceCheckUtils]: 5: Hoare triple {1493#true} ~x~0 := 0; {1498#(= main_~x~0 0)} is VALID [2022-04-15 06:50:49,959 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-15 06:50:49,960 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-15 06:50:49,967 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-15 06:50:49,975 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-15 06:50:49,977 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-15 06:50:49,977 INFO L290 TraceCheckUtils]: 11: Hoare triple {1540#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1544#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:50:49,978 INFO L290 TraceCheckUtils]: 12: Hoare triple {1544#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1494#false} is VALID [2022-04-15 06:50:49,979 INFO L290 TraceCheckUtils]: 13: Hoare triple {1494#false} assume !false; {1494#false} is VALID [2022-04-15 06:50:49,979 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-15 06:50:49,979 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:51:45,418 INFO L290 TraceCheckUtils]: 13: Hoare triple {1494#false} assume !false; {1494#false} is VALID [2022-04-15 06:51:45,421 INFO L290 TraceCheckUtils]: 12: Hoare triple {1544#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1494#false} is VALID [2022-04-15 06:51:45,421 INFO L290 TraceCheckUtils]: 11: Hoare triple {1540#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1544#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:51:45,422 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-15 06:51:45,423 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-15 06:51:47,436 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-15 06:51:47,674 INFO 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 VALID [2022-04-15 06:51:49,682 WARN L290 TraceCheckUtils]: 6: Hoare triple {1574#(and (or (<= (div (+ (- 2) (* (- 1) main_~x~0)) (- 2)) (+ (div (+ main_~x~0 (- 4)) 2) 3)) (<= (div (+ (* (- 1) main_~x~0) (- 4194967297)) (- 4294967296)) (+ (div (+ (- 8589934592) main_~x~0) 4294967296) 3))) (or (<= (div (+ (- 2) (* (- 1) main_~x~0)) (- 2)) (+ (div (+ main_~x~0 (- 4)) 2) 3)) (forall ((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 (<= aux_div_aux_mod_aux_mod_v_main_~x~0_114_32_80_121 0) (<= (div (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_114_32_80_121_57) 99999999 (* (- 1) main_~x~0) (* (- 2) aux_div_aux_mod_aux_mod_v_main_~x~0_114_32_80_121)) (- 4294967296)) (+ (div (+ (* (- 2) aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_114_32_80_121_57) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_114_32_80_121) main_~x~0 (- 4294967296)) 4294967296) 1)) (<= 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) 0))) (<= (div (+ 9999999 (* (- 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-15 06:51:49,684 INFO L290 TraceCheckUtils]: 5: Hoare triple {1493#true} ~x~0 := 0; {1574#(and (or (<= (div (+ (- 2) (* (- 1) main_~x~0)) (- 2)) (+ (div (+ main_~x~0 (- 4)) 2) 3)) (<= (div (+ (* (- 1) main_~x~0) (- 4194967297)) (- 4294967296)) (+ (div (+ (- 8589934592) main_~x~0) 4294967296) 3))) (or (<= (div (+ (- 2) (* (- 1) main_~x~0)) (- 2)) (+ (div (+ main_~x~0 (- 4)) 2) 3)) (forall ((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 (<= aux_div_aux_mod_aux_mod_v_main_~x~0_114_32_80_121 0) (<= (div (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_114_32_80_121_57) 99999999 (* (- 1) main_~x~0) (* (- 2) aux_div_aux_mod_aux_mod_v_main_~x~0_114_32_80_121)) (- 4294967296)) (+ (div (+ (* (- 2) aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_114_32_80_121_57) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_114_32_80_121) main_~x~0 (- 4294967296)) 4294967296) 1)) (<= 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) 0))) (<= (div (+ 9999999 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1))))} is VALID [2022-04-15 06:51:49,684 INFO L272 TraceCheckUtils]: 4: Hoare triple {1493#true} call #t~ret5 := main(); {1493#true} is VALID [2022-04-15 06:51:49,684 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1493#true} {1493#true} #41#return; {1493#true} is VALID [2022-04-15 06:51:49,684 INFO L290 TraceCheckUtils]: 2: Hoare triple {1493#true} assume true; {1493#true} is VALID [2022-04-15 06:51:49,684 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-15 06:51:49,684 INFO L272 TraceCheckUtils]: 0: Hoare triple {1493#true} call ULTIMATE.init(); {1493#true} is VALID [2022-04-15 06:51:49,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:51:49,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342399174] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:51:49,685 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:51:49,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-15 06:52:10,134 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:52:10,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1116781344] [2022-04-15 06:52:10,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1116781344] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:52:10,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:52:10,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 06:52:10,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014049580] [2022-04-15 06:52:10,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:52:10,135 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-15 06:52:10,135 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:52:10,135 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-15 06:52:10,163 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-15 06:52:10,163 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 06:52:10,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:52:10,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 06:52:10,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=349, Unknown=7, NotChecked=0, Total=462 [2022-04-15 06:52:10,164 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-15 06:52:16,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:52:16,927 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-15 06:52:16,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 06:52:16,927 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-15 06:52:16,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:52:16,928 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-15 06:52:16,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 41 transitions. [2022-04-15 06:52:16,929 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-15 06:52:16,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 41 transitions. [2022-04-15 06:52:16,929 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 41 transitions. [2022-04-15 06:52:16,976 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-15 06:52:16,976 INFO L225 Difference]: With dead ends: 36 [2022-04-15 06:52:16,977 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 06:52:16,977 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 21 SyntacticMatches, 12 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 37.1s TimeCoverageRelationStatistics Valid=188, Invalid=673, Unknown=9, NotChecked=0, Total=870 [2022-04-15 06:52:16,977 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 23 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-15 06:52:16,978 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 58 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-15 06:52:16,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 06:52:17,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-15 06:52:17,020 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:52:17,020 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-15 06:52:17,021 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-15 06:52:17,021 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-15 06:52:17,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:52:17,022 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-15 06:52:17,022 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-04-15 06:52:17,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:52:17,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:52:17,022 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-15 06:52:17,022 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-15 06:52:17,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:52:17,023 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-15 06:52:17,023 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-04-15 06:52:17,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:52:17,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:52:17,023 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:52:17,023 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:52:17,023 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-15 06:52:17,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-04-15 06:52:17,024 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 25 [2022-04-15 06:52:17,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:52:17,024 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-04-15 06:52:17,024 INFO L479 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-15 06:52:17,024 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 32 transitions. [2022-04-15 06:52:17,085 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-15 06:52:17,085 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-04-15 06:52:17,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 06:52:17,085 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:52:17,086 INFO L499 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:52:17,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-15 06:52:17,286 WARN L460 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-15 06:52:17,286 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:52:17,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:52:17,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1827998623, now seen corresponding path program 6 times [2022-04-15 06:52:17,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:52:17,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1094534539] [2022-04-15 06:52:22,229 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:52:22,611 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-15 06:52:26,913 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:52:27,114 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-15 06:52:27,115 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:52:27,118 INFO L85 PathProgramCache]: Analyzing trace with hash -2033569617, now seen corresponding path program 1 times [2022-04-15 06:52:27,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:52:27,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432057347] [2022-04-15 06:52:27,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:52:27,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:52:27,126 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-15 06:52:27,127 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-15 06:52:27,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:52:27,144 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-15 06:52:27,145 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-15 06:52:27,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:52:27,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:52:27,589 INFO L290 TraceCheckUtils]: 0: Hoare triple {1816#(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); {1805#true} is VALID [2022-04-15 06:52:27,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {1805#true} assume true; {1805#true} is VALID [2022-04-15 06:52:27,589 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1805#true} {1805#true} #41#return; {1805#true} is VALID [2022-04-15 06:52:27,590 INFO L272 TraceCheckUtils]: 0: Hoare triple {1805#true} call ULTIMATE.init(); {1816#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:52:27,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {1816#(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); {1805#true} is VALID [2022-04-15 06:52:27,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {1805#true} assume true; {1805#true} is VALID [2022-04-15 06:52:27,590 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1805#true} {1805#true} #41#return; {1805#true} is VALID [2022-04-15 06:52:27,590 INFO L272 TraceCheckUtils]: 4: Hoare triple {1805#true} call #t~ret5 := main(); {1805#true} is VALID [2022-04-15 06:52:27,590 INFO L290 TraceCheckUtils]: 5: Hoare triple {1805#true} ~x~0 := 0; {1810#(= main_~x~0 0)} is VALID [2022-04-15 06:52:27,591 INFO L290 TraceCheckUtils]: 6: Hoare triple {1810#(= 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] {1811#(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-15 06:52:27,592 INFO L290 TraceCheckUtils]: 7: Hoare triple {1811#(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[] {1811#(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-15 06:52:27,604 INFO L290 TraceCheckUtils]: 8: Hoare triple {1811#(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] {1812#(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-15 06:52:27,605 INFO L290 TraceCheckUtils]: 9: Hoare triple {1812#(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[] {1813#(<= main_~x~0 (* (div main_~x~0 2) 2))} is VALID [2022-04-15 06:52:27,605 INFO L272 TraceCheckUtils]: 10: Hoare triple {1813#(<= 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)); {1814#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:52:27,606 INFO L290 TraceCheckUtils]: 11: Hoare triple {1814#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1815#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:52:27,606 INFO L290 TraceCheckUtils]: 12: Hoare triple {1815#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1806#false} is VALID [2022-04-15 06:52:27,606 INFO L290 TraceCheckUtils]: 13: Hoare triple {1806#false} assume !false; {1806#false} is VALID [2022-04-15 06:52:27,606 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-15 06:52:27,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:52:27,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432057347] [2022-04-15 06:52:27,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432057347] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:52:27,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651775039] [2022-04-15 06:52:27,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:52:27,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:52:27,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:52:27,608 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-15 06:52:27,609 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-15 06:52:27,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:52:27,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:52:27,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:52:27,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:57:05,774 WARN L855 $PredicateComparison]: unable to prove that (or (and (<= c_main_~x~0 0) (<= 0 c_main_~x~0)) (exists ((aux_div_v_main_~x~0_137_59 Int)) (and (or (exists ((aux_div_aux_mod_aux_mod_v_main_~x~0_137_59_123_123 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_137_59_123_123_67 Int) (aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_137_59_123_123_67_83 Int) (aux_div_aux_mod_v_main_~x~0_137_59_123 Int)) (let ((.cse7 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_137_59_123_123_67 4294967296)) (.cse0 (* 2 aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_137_59_123_123_67_83))) (let ((.cse1 (* aux_div_aux_mod_v_main_~x~0_137_59_123 4294967296)) (.cse4 (* aux_div_aux_mod_v_main_~x~0_137_59_123 4294967294)) (.cse5 (* 2 c_main_~x~0)) (.cse2 (+ .cse7 (* aux_div_aux_mod_aux_mod_v_main_~x~0_137_59_123_123 4294967296) .cse0)) (.cse3 (+ .cse7 .cse0))) (and (< .cse0 (+ 100000000 c_main_~x~0)) (<= (+ .cse1 c_main_~x~0 1) .cse2) (<= (+ 10000000 c_main_~x~0) .cse3) (<= .cse2 (+ (* 4294967296 aux_div_v_main_~x~0_137_59) 10000000 .cse1 c_main_~x~0)) (< .cse2 (+ .cse4 .cse5 2)) (<= c_main_~x~0 .cse0) (forall ((v_it_13 Int)) (or (not (<= (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_137_59_123_123 2147483648) v_it_13 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_137_59_123_123_67 2147483648) 1 aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_137_59_123_123_67_83) (+ (* aux_div_aux_mod_v_main_~x~0_137_59_123 2147483648) c_main_~x~0))) (not (<= 1 v_it_13)) (let ((.cse6 (mod (+ (* 2 v_it_13) (* 4294967295 c_main_~x~0) (* 2 aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_137_59_123_123_67_83)) 4294967296))) (and (< .cse6 100000000) (<= 10000000 .cse6))))) (<= (+ .cse4 .cse5) .cse2) (< .cse3 (+ 4294967296 c_main_~x~0)) (< 0 aux_div_aux_mod_v_main_~x~0_137_59_123))))) (and (<= c_main_~x~0 (+ (* 4294967296 aux_div_v_main_~x~0_137_59) 10000000)) (<= 1 c_main_~x~0))) (<= aux_div_v_main_~x~0_137_59 0)))) is different from true