/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/Mono1_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 03:28:36,435 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 03:28:36,437 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 03:28:36,469 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 03:28:36,470 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 03:28:36,470 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 03:28:36,471 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 03:28:36,472 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 03:28:36,473 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 03:28:36,473 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 03:28:36,474 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 03:28:36,474 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 03:28:36,475 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 03:28:36,475 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 03:28:36,476 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 03:28:36,476 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 03:28:36,477 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 03:28:36,477 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 03:28:36,478 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 03:28:36,479 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 03:28:36,480 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 03:28:36,481 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 03:28:36,481 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 03:28:36,482 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 03:28:36,483 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 03:28:36,484 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 03:28:36,485 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 03:28:36,485 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 03:28:36,485 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 03:28:36,486 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 03:28:36,486 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 03:28:36,486 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 03:28:36,487 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 03:28:36,487 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 03:28:36,488 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 03:28:36,488 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 03:28:36,488 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 03:28:36,489 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 03:28:36,489 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 03:28:36,489 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 03:28:36,490 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 03:28:36,490 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 03:28:36,491 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 03:28:36,496 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 03:28:36,496 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 03:28:36,497 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 03:28:36,497 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 03:28:36,497 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 03:28:36,497 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 03:28:36,497 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 03:28:36,498 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 03:28:36,498 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 03:28:36,498 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 03:28:36,498 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 03:28:36,498 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 03:28:36,498 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 03:28:36,498 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 03:28:36,498 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 03:28:36,499 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 03:28:36,499 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 03:28:36,499 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 03:28:36,499 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:28:36,499 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 03:28:36,499 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 03:28:36,499 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 03:28:36,499 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 03:28:36,500 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 03:28:36,500 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 03:28:36,500 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 03:28:36,676 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 03:28:36,691 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 03:28:36,692 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 03:28:36,693 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 03:28:36,694 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 03:28:36,695 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/Mono1_1-2.c [2022-04-28 03:28:36,740 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d605c818/2d675848f6f842ed9bc421676ee25e1b/FLAG34e99f3f2 [2022-04-28 03:28:37,105 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 03:28:37,106 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono1_1-2.c [2022-04-28 03:28:37,111 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d605c818/2d675848f6f842ed9bc421676ee25e1b/FLAG34e99f3f2 [2022-04-28 03:28:37,122 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d605c818/2d675848f6f842ed9bc421676ee25e1b [2022-04-28 03:28:37,125 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 03:28:37,126 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 03:28:37,128 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 03:28:37,128 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 03:28:37,131 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 03:28:37,132 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:28:37" (1/1) ... [2022-04-28 03:28:37,133 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7aa5bc05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:28:37, skipping insertion in model container [2022-04-28 03:28:37,133 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:28:37" (1/1) ... [2022-04-28 03:28:37,138 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 03:28:37,146 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 03:28:37,263 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/Mono1_1-2.c[313,326] [2022-04-28 03:28:37,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:28:37,304 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 03:28:37,313 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/Mono1_1-2.c[313,326] [2022-04-28 03:28:37,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:28:37,354 INFO L208 MainTranslator]: Completed translation [2022-04-28 03:28:37,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:28:37 WrapperNode [2022-04-28 03:28:37,354 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 03:28:37,355 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 03:28:37,355 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 03:28:37,356 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 03:28:37,365 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:28:37" (1/1) ... [2022-04-28 03:28:37,365 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:28:37" (1/1) ... [2022-04-28 03:28:37,372 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:28:37" (1/1) ... [2022-04-28 03:28:37,372 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:28:37" (1/1) ... [2022-04-28 03:28:37,378 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:28:37" (1/1) ... [2022-04-28 03:28:37,381 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:28:37" (1/1) ... [2022-04-28 03:28:37,385 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:28:37" (1/1) ... [2022-04-28 03:28:37,386 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 03:28:37,387 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 03:28:37,387 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 03:28:37,387 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 03:28:37,388 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:28:37" (1/1) ... [2022-04-28 03:28:37,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:28:37,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:28:37,416 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 03:28:37,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 03:28:37,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 03:28:37,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 03:28:37,459 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 03:28:37,459 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 03:28:37,459 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 03:28:37,459 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 03:28:37,459 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 03:28:37,459 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 03:28:37,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 03:28:37,459 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 03:28:37,459 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 03:28:37,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 03:28:37,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 03:28:37,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 03:28:37,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 03:28:37,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 03:28:37,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 03:28:37,498 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 03:28:37,499 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 03:28:37,578 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 03:28:37,583 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 03:28:37,583 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 03:28:37,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:28:37 BoogieIcfgContainer [2022-04-28 03:28:37,584 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 03:28:37,585 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 03:28:37,585 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 03:28:37,587 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 03:28:37,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:28:37" (1/3) ... [2022-04-28 03:28:37,588 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@231a0dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:28:37, skipping insertion in model container [2022-04-28 03:28:37,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:28:37" (2/3) ... [2022-04-28 03:28:37,588 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@231a0dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:28:37, skipping insertion in model container [2022-04-28 03:28:37,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:28:37" (3/3) ... [2022-04-28 03:28:37,589 INFO L111 eAbstractionObserver]: Analyzing ICFG Mono1_1-2.c [2022-04-28 03:28:37,597 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 03:28:37,597 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 03:28:37,636 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 03:28:37,640 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1110f9b3, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@482d73d6 [2022-04-28 03:28:37,640 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 03:28:37,649 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 03:28:37,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 03:28:37,654 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:28:37,654 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:28:37,654 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:28:37,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:28:37,657 INFO L85 PathProgramCache]: Analyzing trace with hash 491760044, now seen corresponding path program 1 times [2022-04-28 03:28:37,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:28:37,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [256733535] [2022-04-28 03:28:37,673 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:28:37,673 INFO L85 PathProgramCache]: Analyzing trace with hash 491760044, now seen corresponding path program 2 times [2022-04-28 03:28:37,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:28:37,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894089487] [2022-04-28 03:28:37,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:28:37,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:28:37,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:28:37,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:28:37,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:28:37,810 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#(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(12, 2);call #Ultimate.allocInit(12, 3); {22#true} is VALID [2022-04-28 03:28:37,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-28 03:28:37,811 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #40#return; {22#true} is VALID [2022-04-28 03:28:37,825 INFO L272 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:28:37,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#(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(12, 2);call #Ultimate.allocInit(12, 3); {22#true} is VALID [2022-04-28 03:28:37,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-28 03:28:37,826 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22#true} {22#true} #40#return; {22#true} is VALID [2022-04-28 03:28:37,826 INFO L272 TraceCheckUtils]: 4: Hoare triple {22#true} call #t~ret5 := main(); {22#true} is VALID [2022-04-28 03:28:37,827 INFO L290 TraceCheckUtils]: 5: Hoare triple {22#true} ~x~0 := 0; {22#true} is VALID [2022-04-28 03:28:37,828 INFO L290 TraceCheckUtils]: 6: Hoare triple {22#true} assume !true; {23#false} is VALID [2022-04-28 03:28:37,828 INFO L272 TraceCheckUtils]: 7: Hoare triple {23#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {23#false} is VALID [2022-04-28 03:28:37,828 INFO L290 TraceCheckUtils]: 8: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2022-04-28 03:28:37,828 INFO L290 TraceCheckUtils]: 9: Hoare triple {23#false} assume 0 == ~cond; {23#false} is VALID [2022-04-28 03:28:37,829 INFO L290 TraceCheckUtils]: 10: Hoare triple {23#false} assume !false; {23#false} is VALID [2022-04-28 03:28:37,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:28:37,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:28:37,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894089487] [2022-04-28 03:28:37,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894089487] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:28:37,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:28:37,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 03:28:37,832 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:28:37,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [256733535] [2022-04-28 03:28:37,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [256733535] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:28:37,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:28:37,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 03:28:37,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237529308] [2022-04-28 03:28:37,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:28:37,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 03:28:37,838 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:28:37,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:28:37,866 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:28:37,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 03:28:37,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:28:37,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 03:28:37,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 03:28:37,882 INFO L87 Difference]: Start difference. First operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:28:37,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:28:37,933 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-04-28 03:28:37,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 03:28:37,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 03:28:37,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:28:37,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:28:37,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-04-28 03:28:37,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:28:37,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-04-28 03:28:37,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 34 transitions. [2022-04-28 03:28:37,975 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:28:37,980 INFO L225 Difference]: With dead ends: 30 [2022-04-28 03:28:37,980 INFO L226 Difference]: Without dead ends: 13 [2022-04-28 03:28:37,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 03:28:37,985 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:28:37,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 22 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:28:37,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-28 03:28:38,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-28 03:28:38,004 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:28:38,005 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:28:38,005 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:28:38,005 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:28:38,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:28:38,007 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-28 03:28:38,007 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-28 03:28:38,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:28:38,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:28:38,008 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-28 03:28:38,008 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-28 03:28:38,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:28:38,010 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-28 03:28:38,010 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-28 03:28:38,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:28:38,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:28:38,010 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:28:38,010 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:28:38,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:28:38,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-04-28 03:28:38,013 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2022-04-28 03:28:38,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:28:38,013 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-04-28 03:28:38,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:28:38,013 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 14 transitions. [2022-04-28 03:28:38,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:28:38,030 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-28 03:28:38,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 03:28:38,030 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:28:38,030 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:28:38,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 03:28:38,031 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:28:38,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:28:38,032 INFO L85 PathProgramCache]: Analyzing trace with hash 482524834, now seen corresponding path program 1 times [2022-04-28 03:28:38,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:28:38,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [115465559] [2022-04-28 03:28:38,033 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:28:38,033 INFO L85 PathProgramCache]: Analyzing trace with hash 482524834, now seen corresponding path program 2 times [2022-04-28 03:28:38,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:28:38,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709327780] [2022-04-28 03:28:38,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:28:38,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:28:38,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:28:38,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:28:38,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:28:38,134 INFO L290 TraceCheckUtils]: 0: Hoare triple {148#(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(12, 2);call #Ultimate.allocInit(12, 3); {142#true} is VALID [2022-04-28 03:28:38,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {142#true} assume true; {142#true} is VALID [2022-04-28 03:28:38,134 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {142#true} {142#true} #40#return; {142#true} is VALID [2022-04-28 03:28:38,135 INFO L272 TraceCheckUtils]: 0: Hoare triple {142#true} call ULTIMATE.init(); {148#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:28:38,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {148#(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(12, 2);call #Ultimate.allocInit(12, 3); {142#true} is VALID [2022-04-28 03:28:38,135 INFO L290 TraceCheckUtils]: 2: Hoare triple {142#true} assume true; {142#true} is VALID [2022-04-28 03:28:38,135 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {142#true} {142#true} #40#return; {142#true} is VALID [2022-04-28 03:28:38,136 INFO L272 TraceCheckUtils]: 4: Hoare triple {142#true} call #t~ret5 := main(); {142#true} is VALID [2022-04-28 03:28:38,136 INFO L290 TraceCheckUtils]: 5: Hoare triple {142#true} ~x~0 := 0; {147#(= main_~x~0 0)} is VALID [2022-04-28 03:28:38,136 INFO L290 TraceCheckUtils]: 6: Hoare triple {147#(= main_~x~0 0)} assume !(~x~0 % 4294967296 < 100000000); {143#false} is VALID [2022-04-28 03:28:38,137 INFO L272 TraceCheckUtils]: 7: Hoare triple {143#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {143#false} is VALID [2022-04-28 03:28:38,137 INFO L290 TraceCheckUtils]: 8: Hoare triple {143#false} ~cond := #in~cond; {143#false} is VALID [2022-04-28 03:28:38,137 INFO L290 TraceCheckUtils]: 9: Hoare triple {143#false} assume 0 == ~cond; {143#false} is VALID [2022-04-28 03:28:38,137 INFO L290 TraceCheckUtils]: 10: Hoare triple {143#false} assume !false; {143#false} is VALID [2022-04-28 03:28:38,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:28:38,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:28:38,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709327780] [2022-04-28 03:28:38,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709327780] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:28:38,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:28:38,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:28:38,138 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:28:38,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [115465559] [2022-04-28 03:28:38,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [115465559] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:28:38,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:28:38,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:28:38,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139643584] [2022-04-28 03:28:38,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:28:38,139 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 03:28:38,140 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:28:38,140 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:28:38,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:28:38,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 03:28:38,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:28:38,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 03:28:38,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 03:28:38,152 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:28:38,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:28:38,212 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-04-28 03:28:38,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 03:28:38,212 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 03:28:38,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:28:38,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:28:38,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-28 03:28:38,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:28:38,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-28 03:28:38,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 26 transitions. [2022-04-28 03:28:38,239 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:28:38,243 INFO L225 Difference]: With dead ends: 22 [2022-04-28 03:28:38,243 INFO L226 Difference]: Without dead ends: 15 [2022-04-28 03:28:38,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 03:28:38,246 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:28:38,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 19 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:28:38,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-28 03:28:38,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-28 03:28:38,254 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:28:38,254 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:28:38,254 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:28:38,255 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:28:38,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:28:38,256 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-28 03:28:38,257 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 03:28:38,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:28:38,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:28:38,257 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 03:28:38,258 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 03:28:38,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:28:38,259 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-28 03:28:38,260 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 03:28:38,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:28:38,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:28:38,260 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:28:38,260 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:28:38,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:28:38,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-28 03:28:38,267 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2022-04-28 03:28:38,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:28:38,268 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-28 03:28:38,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:28:38,270 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 16 transitions. [2022-04-28 03:28:38,285 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:28:38,286 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 03:28:38,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 03:28:38,286 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:28:38,286 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:28:38,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 03:28:38,290 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:28:38,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:28:38,291 INFO L85 PathProgramCache]: Analyzing trace with hash 925229631, now seen corresponding path program 1 times [2022-04-28 03:28:38,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:28:38,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1663509773] [2022-04-28 03:28:41,127 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:28:41,362 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:28:41,365 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:28:41,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1303175503, now seen corresponding path program 1 times [2022-04-28 03:28:41,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:28:41,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317417896] [2022-04-28 03:28:41,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:28:41,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:28:41,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:28:41,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:28:41,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:28:41,479 INFO L290 TraceCheckUtils]: 0: Hoare triple {264#(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(12, 2);call #Ultimate.allocInit(12, 3); {257#true} is VALID [2022-04-28 03:28:41,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {257#true} assume true; {257#true} is VALID [2022-04-28 03:28:41,479 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {257#true} {257#true} #40#return; {257#true} is VALID [2022-04-28 03:28:41,480 INFO L272 TraceCheckUtils]: 0: Hoare triple {257#true} call ULTIMATE.init(); {264#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:28:41,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {264#(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(12, 2);call #Ultimate.allocInit(12, 3); {257#true} is VALID [2022-04-28 03:28:41,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {257#true} assume true; {257#true} is VALID [2022-04-28 03:28:41,480 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {257#true} {257#true} #40#return; {257#true} is VALID [2022-04-28 03:28:41,480 INFO L272 TraceCheckUtils]: 4: Hoare triple {257#true} call #t~ret5 := main(); {257#true} is VALID [2022-04-28 03:28:41,481 INFO L290 TraceCheckUtils]: 5: Hoare triple {257#true} ~x~0 := 0; {262#(= main_~x~0 0)} is VALID [2022-04-28 03:28:41,482 INFO L290 TraceCheckUtils]: 6: Hoare triple {262#(= main_~x~0 0)} [46] 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] {263#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 10000001))} is VALID [2022-04-28 03:28:41,482 INFO L290 TraceCheckUtils]: 7: Hoare triple {263#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 10000001))} [45] 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[] {258#false} is VALID [2022-04-28 03:28:41,483 INFO L272 TraceCheckUtils]: 8: Hoare triple {258#false} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {258#false} is VALID [2022-04-28 03:28:41,483 INFO L290 TraceCheckUtils]: 9: Hoare triple {258#false} ~cond := #in~cond; {258#false} is VALID [2022-04-28 03:28:41,483 INFO L290 TraceCheckUtils]: 10: Hoare triple {258#false} assume 0 == ~cond; {258#false} is VALID [2022-04-28 03:28:41,483 INFO L290 TraceCheckUtils]: 11: Hoare triple {258#false} assume !false; {258#false} is VALID [2022-04-28 03:28:41,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:28:41,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:28:41,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317417896] [2022-04-28 03:28:41,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317417896] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:28:41,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:28:41,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:28:41,601 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:28:41,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1663509773] [2022-04-28 03:28:41,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1663509773] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:28:41,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:28:41,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:28:41,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142635918] [2022-04-28 03:28:41,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:28:41,602 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-28 03:28:41,603 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:28:41,603 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:28:41,629 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:28:41,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 03:28:41,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:28:41,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 03:28:41,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-04-28 03:28:41,630 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:28:41,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:28:41,724 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-28 03:28:41,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 03:28:41,724 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-28 03:28:41,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:28:41,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:28:41,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-04-28 03:28:41,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:28:41,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-04-28 03:28:41,726 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 24 transitions. [2022-04-28 03:28:41,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:28:41,751 INFO L225 Difference]: With dead ends: 22 [2022-04-28 03:28:41,751 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 03:28:41,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-04-28 03:28:41,752 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:28:41,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 18 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:28:41,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 03:28:41,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-28 03:28:41,765 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:28:41,765 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:28:41,765 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:28:41,765 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:28:41,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:28:41,767 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-28 03:28:41,767 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 03:28:41,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:28:41,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:28:41,768 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 03:28:41,769 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 03:28:41,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:28:41,770 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-28 03:28:41,771 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 03:28:41,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:28:41,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:28:41,771 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:28:41,771 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:28:41,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:28:41,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-28 03:28:41,774 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2022-04-28 03:28:41,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:28:41,776 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-28 03:28:41,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:28:41,776 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-28 03:28:41,805 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:28:41,805 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 03:28:41,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 03:28:41,805 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:28:41,806 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:28:41,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 03:28:41,808 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:28:41,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:28:41,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1220035546, now seen corresponding path program 1 times [2022-04-28 03:28:41,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:28:41,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [977880694] [2022-04-28 03:28:42,551 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:28:42,860 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:28:42,863 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:28:42,866 INFO L85 PathProgramCache]: Analyzing trace with hash 442797488, now seen corresponding path program 1 times [2022-04-28 03:28:42,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:28:42,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770423950] [2022-04-28 03:28:42,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:28:42,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:28:42,886 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 2) .v_it_3.0) (* (- 1) main_~x~0_6) (* 4294967296 (div (+ (* 2 .v_it_3.0) main_~x~0_6) 4294967296)) 100000000) 0)) [2022-04-28 03:28:42,889 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 2) .v_it_3.0) (* (- 1) main_~x~0_6) (* 4294967296 (div (+ (* 2 .v_it_3.0) main_~x~0_6) 4294967296)) 10000000) 0) [2022-04-28 03:28:42,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:28:42,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:28:42,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770423950] [2022-04-28 03:28:42,996 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Interpolation not supported for quantified formulae. [2022-04-28 03:28:42,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634851556] [2022-04-28 03:28:42,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:28:42,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:28:42,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:28:43,035 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:28:43,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 03:28:43,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:28:43,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 03:28:43,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:28:43,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:31:45,509 INFO L272 TraceCheckUtils]: 0: Hoare triple {385#true} call ULTIMATE.init(); {385#true} is VALID [2022-04-28 03:31:45,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {385#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(12, 2);call #Ultimate.allocInit(12, 3); {385#true} is VALID [2022-04-28 03:31:45,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-28 03:31:45,510 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {385#true} {385#true} #40#return; {385#true} is VALID [2022-04-28 03:31:45,510 INFO L272 TraceCheckUtils]: 4: Hoare triple {385#true} call #t~ret5 := main(); {385#true} is VALID [2022-04-28 03:31:45,511 INFO L290 TraceCheckUtils]: 5: Hoare triple {385#true} ~x~0 := 0; {405#(= main_~x~0 0)} is VALID [2022-04-28 03:31:45,511 INFO L290 TraceCheckUtils]: 6: Hoare triple {405#(= main_~x~0 0)} [48] 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] {409#(or (= main_~x~0 0) (and (< 0 main_~x~0) (<= (div (+ (* (- 1) main_~x~0) 10000000) (- 4294967296)) 0)))} is VALID [2022-04-28 03:31:45,514 INFO L290 TraceCheckUtils]: 7: Hoare triple {409#(or (= main_~x~0 0) (and (< 0 main_~x~0) (<= (div (+ (* (- 1) main_~x~0) 10000000) (- 4294967296)) 0)))} [49] L8-2_primed-->L9-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {409#(or (= main_~x~0 0) (and (< 0 main_~x~0) (<= (div (+ (* (- 1) main_~x~0) 10000000) (- 4294967296)) 0)))} is VALID [2022-04-28 03:31:45,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {409#(or (= main_~x~0 0) (and (< 0 main_~x~0) (<= (div (+ (* (- 1) main_~x~0) 10000000) (- 4294967296)) 0)))} [50] 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] {416#(or (= main_~x~0 0) (exists ((aux_div_v_main_~x~0_28_46 Int) (aux_div_aux_mod_v_main_~x~0_28_46_33 Int)) (and (< (* aux_div_aux_mod_v_main_~x~0_28_46_33 2) 2) (< (+ (* aux_div_aux_mod_v_main_~x~0_28_46_33 2) (* 2 aux_div_v_main_~x~0_28_46)) main_~x~0) (< 0 aux_div_v_main_~x~0_28_46) (<= 10000000 (mod (+ (* aux_div_aux_mod_v_main_~x~0_28_46_33 4294967294) main_~x~0 (* 4294967294 aux_div_v_main_~x~0_28_46)) 4294967296)) (<= (div (+ (* aux_div_aux_mod_v_main_~x~0_28_46_33 2) (* 2 aux_div_v_main_~x~0_28_46) (* (- 1) main_~x~0) 10000000) (- 4294967296)) 0) (<= 0 (* aux_div_aux_mod_v_main_~x~0_28_46_33 2)) (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) (+ aux_div_aux_mod_v_main_~x~0_28_46_33 aux_div_v_main_~x~0_28_46))) (not (<= 1 v_it_3)) (and (<= 10000000 (mod (+ (* v_it_3 2) (* aux_div_aux_mod_v_main_~x~0_28_46_33 4294967294) main_~x~0 (* 4294967294 aux_div_v_main_~x~0_28_46)) 4294967296)) (< (mod (+ (* v_it_3 2) (* aux_div_aux_mod_v_main_~x~0_28_46_33 4294967294) main_~x~0 (* 4294967294 aux_div_v_main_~x~0_28_46)) 4294967296) 100000000)))))) (and (< 0 main_~x~0) (<= (div (+ (* (- 1) main_~x~0) 10000000) (- 4294967296)) 0)))} is VALID [2022-04-28 03:31:45,590 INFO L290 TraceCheckUtils]: 9: Hoare triple {416#(or (= main_~x~0 0) (exists ((aux_div_v_main_~x~0_28_46 Int) (aux_div_aux_mod_v_main_~x~0_28_46_33 Int)) (and (< (* aux_div_aux_mod_v_main_~x~0_28_46_33 2) 2) (< (+ (* aux_div_aux_mod_v_main_~x~0_28_46_33 2) (* 2 aux_div_v_main_~x~0_28_46)) main_~x~0) (< 0 aux_div_v_main_~x~0_28_46) (<= 10000000 (mod (+ (* aux_div_aux_mod_v_main_~x~0_28_46_33 4294967294) main_~x~0 (* 4294967294 aux_div_v_main_~x~0_28_46)) 4294967296)) (<= (div (+ (* aux_div_aux_mod_v_main_~x~0_28_46_33 2) (* 2 aux_div_v_main_~x~0_28_46) (* (- 1) main_~x~0) 10000000) (- 4294967296)) 0) (<= 0 (* aux_div_aux_mod_v_main_~x~0_28_46_33 2)) (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) (+ aux_div_aux_mod_v_main_~x~0_28_46_33 aux_div_v_main_~x~0_28_46))) (not (<= 1 v_it_3)) (and (<= 10000000 (mod (+ (* v_it_3 2) (* aux_div_aux_mod_v_main_~x~0_28_46_33 4294967294) main_~x~0 (* 4294967294 aux_div_v_main_~x~0_28_46)) 4294967296)) (< (mod (+ (* v_it_3 2) (* aux_div_aux_mod_v_main_~x~0_28_46_33 4294967294) main_~x~0 (* 4294967294 aux_div_v_main_~x~0_28_46)) 4294967296) 100000000)))))) (and (< 0 main_~x~0) (<= (div (+ (* (- 1) main_~x~0) 10000000) (- 4294967296)) 0)))} [47] 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[] {420#(and (exists ((aux_div_v_main_~x~0_28_46 Int) (aux_div_aux_mod_v_main_~x~0_28_46_33 Int)) (and (< (* aux_div_aux_mod_v_main_~x~0_28_46_33 2) 2) (< (+ (* aux_div_aux_mod_v_main_~x~0_28_46_33 2) (* 2 aux_div_v_main_~x~0_28_46)) main_~x~0) (< 0 aux_div_v_main_~x~0_28_46) (<= 10000000 (mod (+ (* aux_div_aux_mod_v_main_~x~0_28_46_33 4294967294) main_~x~0 (* 4294967294 aux_div_v_main_~x~0_28_46)) 4294967296)) (<= (div (+ (* aux_div_aux_mod_v_main_~x~0_28_46_33 2) (* 2 aux_div_v_main_~x~0_28_46) (* (- 1) main_~x~0) 10000000) (- 4294967296)) 0) (<= 0 (* aux_div_aux_mod_v_main_~x~0_28_46_33 2)) (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) (+ aux_div_aux_mod_v_main_~x~0_28_46_33 aux_div_v_main_~x~0_28_46))) (not (<= 1 v_it_3)) (and (<= 10000000 (mod (+ (* v_it_3 2) (* aux_div_aux_mod_v_main_~x~0_28_46_33 4294967294) main_~x~0 (* 4294967294 aux_div_v_main_~x~0_28_46)) 4294967296)) (< (mod (+ (* v_it_3 2) (* aux_div_aux_mod_v_main_~x~0_28_46_33 4294967294) main_~x~0 (* 4294967294 aux_div_v_main_~x~0_28_46)) 4294967296) 100000000)))))) (not (< (mod main_~x~0 4294967296) 100000000)))} is VALID [2022-04-28 03:31:45,593 INFO L272 TraceCheckUtils]: 10: Hoare triple {420#(and (exists ((aux_div_v_main_~x~0_28_46 Int) (aux_div_aux_mod_v_main_~x~0_28_46_33 Int)) (and (< (* aux_div_aux_mod_v_main_~x~0_28_46_33 2) 2) (< (+ (* aux_div_aux_mod_v_main_~x~0_28_46_33 2) (* 2 aux_div_v_main_~x~0_28_46)) main_~x~0) (< 0 aux_div_v_main_~x~0_28_46) (<= 10000000 (mod (+ (* aux_div_aux_mod_v_main_~x~0_28_46_33 4294967294) main_~x~0 (* 4294967294 aux_div_v_main_~x~0_28_46)) 4294967296)) (<= (div (+ (* aux_div_aux_mod_v_main_~x~0_28_46_33 2) (* 2 aux_div_v_main_~x~0_28_46) (* (- 1) main_~x~0) 10000000) (- 4294967296)) 0) (<= 0 (* aux_div_aux_mod_v_main_~x~0_28_46_33 2)) (forall ((v_it_3 Int)) (or (not (<= (+ v_it_3 1) (+ aux_div_aux_mod_v_main_~x~0_28_46_33 aux_div_v_main_~x~0_28_46))) (not (<= 1 v_it_3)) (and (<= 10000000 (mod (+ (* v_it_3 2) (* aux_div_aux_mod_v_main_~x~0_28_46_33 4294967294) main_~x~0 (* 4294967294 aux_div_v_main_~x~0_28_46)) 4294967296)) (< (mod (+ (* v_it_3 2) (* aux_div_aux_mod_v_main_~x~0_28_46_33 4294967294) main_~x~0 (* 4294967294 aux_div_v_main_~x~0_28_46)) 4294967296) 100000000)))))) (not (< (mod main_~x~0 4294967296) 100000000)))} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {424#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:31:45,593 INFO L290 TraceCheckUtils]: 11: Hoare triple {424#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {428#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:31:45,594 INFO L290 TraceCheckUtils]: 12: Hoare triple {428#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {386#false} is VALID [2022-04-28 03:31:45,594 INFO L290 TraceCheckUtils]: 13: Hoare triple {386#false} assume !false; {386#false} is VALID [2022-04-28 03:31:45,594 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:31:45,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:33:03,528 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~x~0 4294967296))) (and (or (not (<= 10000000 .cse0)) (forall ((aux_div_aux_mod_v_main_~x~0_29_31_42 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58 Int) (aux_div_v_main_~x~0_29_31 Int)) (let ((.cse1 (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58))) (let ((.cse2 (+ 100000000 c_main_~x~0)) (.cse4 (+ 4294967296 c_main_~x~0)) (.cse3 (+ (* aux_div_aux_mod_v_main_~x~0_29_31_42 4294967296) .cse1))) (or (< .cse1 .cse2) (= .cse2 .cse3) (<= .cse4 .cse3) (exists ((v_it_3 Int)) (and (let ((.cse5 (mod (+ (* v_it_3 2) c_main_~x~0) 4294967296))) (or (not (<= 10000000 .cse5)) (not (< .cse5 100000000)))) (<= 1 v_it_3) (<= (+ v_it_3 c_main_~x~0 1) (+ (* aux_div_aux_mod_v_main_~x~0_29_31_42 2147483648) aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58 (* aux_div_v_main_~x~0_29_31 2147483648))))) (<= .cse4 .cse1) (< .cse3 c_main_~x~0) (<= (+ (* aux_div_aux_mod_v_main_~x~0_29_31_42 2147483648) aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58 (* aux_div_v_main_~x~0_29_31 2147483648)) c_main_~x~0))))) (not (< .cse0 100000000))) (<= (div (+ (- 100000001) c_main_~x~0) 4294967296) (div (+ (- 4294967296) c_main_~x~0) 4294967296)) (or (forall ((aux_div_v_main_~x~0_30_58 Int) (aux_mod_v_main_~x~0_30_58 Int)) (or (not (< (+ aux_mod_v_main_~x~0_30_58 c_main_~x~0) (+ (* aux_div_v_main_~x~0_30_58 4294967296) 10000000))) (not (<= 10000000 (mod (+ (* aux_mod_v_main_~x~0_30_58 4294967295) 10000000) 4294967296))) (forall ((aux_div_aux_mod_v_main_~x~0_29_31_42 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58 Int) (aux_div_v_main_~x~0_29_31 Int)) (let ((.cse6 (* aux_div_aux_mod_v_main_~x~0_29_31_42 4294967296)) (.cse7 (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58)) (.cse8 (* aux_div_v_main_~x~0_30_58 4294967296))) (let ((.cse10 (+ .cse8 10000000)) (.cse9 (+ aux_mod_v_main_~x~0_30_58 .cse6 .cse7)) (.cse13 (+ 4304967296 .cse8)) (.cse11 (+ aux_mod_v_main_~x~0_30_58 .cse7))) (or (= (+ .cse6 .cse7) (+ (* (- 1) aux_mod_v_main_~x~0_30_58) .cse8 110000000)) (< .cse9 .cse10) (< .cse11 (+ .cse8 110000000)) (exists ((v_it_3 Int)) (and (<= 1 v_it_3) (<= (+ v_it_3 10000001 (* aux_div_v_main_~x~0_30_58 4294967296)) (+ aux_mod_v_main_~x~0_30_58 (* aux_div_aux_mod_v_main_~x~0_29_31_42 2147483648) aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58 (* aux_div_v_main_~x~0_29_31 2147483648))) (let ((.cse12 (mod (+ (* v_it_3 2) (* aux_mod_v_main_~x~0_30_58 4294967295) 10000000) 4294967296))) (or (not (< .cse12 100000000)) (not (<= 10000000 .cse12)))))) (<= (+ aux_mod_v_main_~x~0_30_58 (* aux_div_aux_mod_v_main_~x~0_29_31_42 2147483648) aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58 (* aux_div_v_main_~x~0_29_31 2147483648)) .cse10) (<= .cse13 .cse9) (<= .cse13 .cse11))))) (< (+ (div (+ (- 4294967295) c_main_~x~0) 4294967296) 1) aux_div_v_main_~x~0_30_58) (> 0 aux_mod_v_main_~x~0_30_58))) (not (< .cse0 10000000))))) is different from false [2022-04-28 03:33:04,272 INFO L290 TraceCheckUtils]: 13: Hoare triple {386#false} assume !false; {386#false} is VALID [2022-04-28 03:33:04,273 INFO L290 TraceCheckUtils]: 12: Hoare triple {428#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {386#false} is VALID [2022-04-28 03:33:04,273 INFO L290 TraceCheckUtils]: 11: Hoare triple {424#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {428#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:33:04,274 INFO L272 TraceCheckUtils]: 10: Hoare triple {444#(= 100000000 (mod main_~x~0 4294967296))} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {424#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:33:04,274 INFO L290 TraceCheckUtils]: 9: Hoare triple {448#(or (< (mod main_~x~0 4294967296) 100000000) (= 100000000 (mod main_~x~0 4294967296)))} [47] 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[] {444#(= 100000000 (mod main_~x~0 4294967296))} is VALID [2022-04-28 03:33:06,281 WARN L290 TraceCheckUtils]: 8: Hoare triple {452#(and (<= (div (+ main_~x~0 (- 100000001)) 4294967296) (div (+ main_~x~0 (- 4294967296)) 4294967296)) (or (forall ((aux_div_aux_mod_v_main_~x~0_29_31_42 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58 Int) (aux_div_v_main_~x~0_29_31 Int)) (or (<= (+ main_~x~0 4294967296) (+ (* aux_div_aux_mod_v_main_~x~0_29_31_42 4294967296) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58))) (< (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58) (+ 100000000 main_~x~0)) (= (+ 100000000 main_~x~0) (+ (* aux_div_aux_mod_v_main_~x~0_29_31_42 4294967296) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58))) (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)))) (<= (+ v_it_3 main_~x~0 1) (+ (* aux_div_aux_mod_v_main_~x~0_29_31_42 2147483648) aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58 (* aux_div_v_main_~x~0_29_31 2147483648))) (<= 1 v_it_3))) (<= (+ main_~x~0 4294967296) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58)) (<= (+ (* aux_div_aux_mod_v_main_~x~0_29_31_42 2147483648) aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58 (* aux_div_v_main_~x~0_29_31 2147483648)) main_~x~0) (< (+ (* aux_div_aux_mod_v_main_~x~0_29_31_42 4294967296) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58)) main_~x~0))) (not (< (mod main_~x~0 4294967296) 100000000)) (not (<= 10000000 (mod main_~x~0 4294967296)))))} [50] 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] {448#(or (< (mod main_~x~0 4294967296) 100000000) (= 100000000 (mod main_~x~0 4294967296)))} is UNKNOWN [2022-04-28 03:33:06,287 INFO L290 TraceCheckUtils]: 7: Hoare triple {452#(and (<= (div (+ main_~x~0 (- 100000001)) 4294967296) (div (+ main_~x~0 (- 4294967296)) 4294967296)) (or (forall ((aux_div_aux_mod_v_main_~x~0_29_31_42 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58 Int) (aux_div_v_main_~x~0_29_31 Int)) (or (<= (+ main_~x~0 4294967296) (+ (* aux_div_aux_mod_v_main_~x~0_29_31_42 4294967296) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58))) (< (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58) (+ 100000000 main_~x~0)) (= (+ 100000000 main_~x~0) (+ (* aux_div_aux_mod_v_main_~x~0_29_31_42 4294967296) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58))) (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)))) (<= (+ v_it_3 main_~x~0 1) (+ (* aux_div_aux_mod_v_main_~x~0_29_31_42 2147483648) aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58 (* aux_div_v_main_~x~0_29_31 2147483648))) (<= 1 v_it_3))) (<= (+ main_~x~0 4294967296) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58)) (<= (+ (* aux_div_aux_mod_v_main_~x~0_29_31_42 2147483648) aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58 (* aux_div_v_main_~x~0_29_31 2147483648)) main_~x~0) (< (+ (* aux_div_aux_mod_v_main_~x~0_29_31_42 4294967296) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58)) main_~x~0))) (not (< (mod main_~x~0 4294967296) 100000000)) (not (<= 10000000 (mod main_~x~0 4294967296)))))} [49] L8-2_primed-->L9-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {452#(and (<= (div (+ main_~x~0 (- 100000001)) 4294967296) (div (+ main_~x~0 (- 4294967296)) 4294967296)) (or (forall ((aux_div_aux_mod_v_main_~x~0_29_31_42 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58 Int) (aux_div_v_main_~x~0_29_31 Int)) (or (<= (+ main_~x~0 4294967296) (+ (* aux_div_aux_mod_v_main_~x~0_29_31_42 4294967296) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58))) (< (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58) (+ 100000000 main_~x~0)) (= (+ 100000000 main_~x~0) (+ (* aux_div_aux_mod_v_main_~x~0_29_31_42 4294967296) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58))) (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)))) (<= (+ v_it_3 main_~x~0 1) (+ (* aux_div_aux_mod_v_main_~x~0_29_31_42 2147483648) aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58 (* aux_div_v_main_~x~0_29_31 2147483648))) (<= 1 v_it_3))) (<= (+ main_~x~0 4294967296) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58)) (<= (+ (* aux_div_aux_mod_v_main_~x~0_29_31_42 2147483648) aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58 (* aux_div_v_main_~x~0_29_31 2147483648)) main_~x~0) (< (+ (* aux_div_aux_mod_v_main_~x~0_29_31_42 4294967296) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58)) main_~x~0))) (not (< (mod main_~x~0 4294967296) 100000000)) (not (<= 10000000 (mod main_~x~0 4294967296)))))} is VALID [2022-04-28 03:33:08,339 WARN L290 TraceCheckUtils]: 6: Hoare triple {459#(and (or (not (< (mod main_~x~0 4294967296) 10000000)) (forall ((aux_div_v_main_~x~0_30_58 Int) (aux_mod_v_main_~x~0_30_58 Int)) (or (not (< (+ aux_mod_v_main_~x~0_30_58 main_~x~0) (+ (* aux_div_v_main_~x~0_30_58 4294967296) 10000000))) (not (<= 10000000 (mod (+ (* aux_mod_v_main_~x~0_30_58 4294967295) 10000000) 4294967296))) (< (+ (div (+ main_~x~0 (- 4294967295)) 4294967296) 1) aux_div_v_main_~x~0_30_58) (forall ((aux_div_aux_mod_v_main_~x~0_29_31_42 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58 Int) (aux_div_v_main_~x~0_29_31 Int)) (or (= (+ (* aux_div_aux_mod_v_main_~x~0_29_31_42 4294967296) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58)) (+ (* (- 1) aux_mod_v_main_~x~0_30_58) (* aux_div_v_main_~x~0_30_58 4294967296) 110000000)) (< (+ aux_mod_v_main_~x~0_30_58 (* aux_div_aux_mod_v_main_~x~0_29_31_42 4294967296) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58)) (+ (* aux_div_v_main_~x~0_30_58 4294967296) 10000000)) (< (+ aux_mod_v_main_~x~0_30_58 (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58)) (+ (* aux_div_v_main_~x~0_30_58 4294967296) 110000000)) (exists ((v_it_3 Int)) (and (<= 1 v_it_3) (<= (+ v_it_3 10000001 (* aux_div_v_main_~x~0_30_58 4294967296)) (+ aux_mod_v_main_~x~0_30_58 (* aux_div_aux_mod_v_main_~x~0_29_31_42 2147483648) aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58 (* aux_div_v_main_~x~0_29_31 2147483648))) (or (not (< (mod (+ (* v_it_3 2) (* aux_mod_v_main_~x~0_30_58 4294967295) 10000000) 4294967296) 100000000)) (not (<= 10000000 (mod (+ (* v_it_3 2) (* aux_mod_v_main_~x~0_30_58 4294967295) 10000000) 4294967296)))))) (<= (+ aux_mod_v_main_~x~0_30_58 (* aux_div_aux_mod_v_main_~x~0_29_31_42 2147483648) aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58 (* aux_div_v_main_~x~0_29_31 2147483648)) (+ (* aux_div_v_main_~x~0_30_58 4294967296) 10000000)) (<= (+ 4304967296 (* aux_div_v_main_~x~0_30_58 4294967296)) (+ aux_mod_v_main_~x~0_30_58 (* aux_div_aux_mod_v_main_~x~0_29_31_42 4294967296) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58))) (<= (+ 4304967296 (* aux_div_v_main_~x~0_30_58 4294967296)) (+ aux_mod_v_main_~x~0_30_58 (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58))))) (> 0 aux_mod_v_main_~x~0_30_58)))) (<= (div (+ main_~x~0 (- 100000001)) 4294967296) (div (+ main_~x~0 (- 4294967296)) 4294967296)) (or (forall ((aux_div_aux_mod_v_main_~x~0_29_31_42 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58 Int) (aux_div_v_main_~x~0_29_31 Int)) (or (<= (+ main_~x~0 4294967296) (+ (* aux_div_aux_mod_v_main_~x~0_29_31_42 4294967296) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58))) (< (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58) (+ 100000000 main_~x~0)) (= (+ 100000000 main_~x~0) (+ (* aux_div_aux_mod_v_main_~x~0_29_31_42 4294967296) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58))) (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)))) (<= (+ v_it_3 main_~x~0 1) (+ (* aux_div_aux_mod_v_main_~x~0_29_31_42 2147483648) aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58 (* aux_div_v_main_~x~0_29_31 2147483648))) (<= 1 v_it_3))) (<= (+ main_~x~0 4294967296) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58)) (<= (+ (* aux_div_aux_mod_v_main_~x~0_29_31_42 2147483648) aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58 (* aux_div_v_main_~x~0_29_31 2147483648)) main_~x~0) (< (+ (* aux_div_aux_mod_v_main_~x~0_29_31_42 4294967296) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58)) main_~x~0))) (not (< (mod main_~x~0 4294967296) 100000000)) (not (<= 10000000 (mod main_~x~0 4294967296)))))} [48] 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] {452#(and (<= (div (+ main_~x~0 (- 100000001)) 4294967296) (div (+ main_~x~0 (- 4294967296)) 4294967296)) (or (forall ((aux_div_aux_mod_v_main_~x~0_29_31_42 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58 Int) (aux_div_v_main_~x~0_29_31 Int)) (or (<= (+ main_~x~0 4294967296) (+ (* aux_div_aux_mod_v_main_~x~0_29_31_42 4294967296) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58))) (< (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58) (+ 100000000 main_~x~0)) (= (+ 100000000 main_~x~0) (+ (* aux_div_aux_mod_v_main_~x~0_29_31_42 4294967296) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58))) (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)))) (<= (+ v_it_3 main_~x~0 1) (+ (* aux_div_aux_mod_v_main_~x~0_29_31_42 2147483648) aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58 (* aux_div_v_main_~x~0_29_31 2147483648))) (<= 1 v_it_3))) (<= (+ main_~x~0 4294967296) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58)) (<= (+ (* aux_div_aux_mod_v_main_~x~0_29_31_42 2147483648) aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58 (* aux_div_v_main_~x~0_29_31 2147483648)) main_~x~0) (< (+ (* aux_div_aux_mod_v_main_~x~0_29_31_42 4294967296) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58)) main_~x~0))) (not (< (mod main_~x~0 4294967296) 100000000)) (not (<= 10000000 (mod main_~x~0 4294967296)))))} is UNKNOWN [2022-04-28 03:33:08,352 INFO L290 TraceCheckUtils]: 5: Hoare triple {385#true} ~x~0 := 0; {459#(and (or (not (< (mod main_~x~0 4294967296) 10000000)) (forall ((aux_div_v_main_~x~0_30_58 Int) (aux_mod_v_main_~x~0_30_58 Int)) (or (not (< (+ aux_mod_v_main_~x~0_30_58 main_~x~0) (+ (* aux_div_v_main_~x~0_30_58 4294967296) 10000000))) (not (<= 10000000 (mod (+ (* aux_mod_v_main_~x~0_30_58 4294967295) 10000000) 4294967296))) (< (+ (div (+ main_~x~0 (- 4294967295)) 4294967296) 1) aux_div_v_main_~x~0_30_58) (forall ((aux_div_aux_mod_v_main_~x~0_29_31_42 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58 Int) (aux_div_v_main_~x~0_29_31 Int)) (or (= (+ (* aux_div_aux_mod_v_main_~x~0_29_31_42 4294967296) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58)) (+ (* (- 1) aux_mod_v_main_~x~0_30_58) (* aux_div_v_main_~x~0_30_58 4294967296) 110000000)) (< (+ aux_mod_v_main_~x~0_30_58 (* aux_div_aux_mod_v_main_~x~0_29_31_42 4294967296) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58)) (+ (* aux_div_v_main_~x~0_30_58 4294967296) 10000000)) (< (+ aux_mod_v_main_~x~0_30_58 (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58)) (+ (* aux_div_v_main_~x~0_30_58 4294967296) 110000000)) (exists ((v_it_3 Int)) (and (<= 1 v_it_3) (<= (+ v_it_3 10000001 (* aux_div_v_main_~x~0_30_58 4294967296)) (+ aux_mod_v_main_~x~0_30_58 (* aux_div_aux_mod_v_main_~x~0_29_31_42 2147483648) aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58 (* aux_div_v_main_~x~0_29_31 2147483648))) (or (not (< (mod (+ (* v_it_3 2) (* aux_mod_v_main_~x~0_30_58 4294967295) 10000000) 4294967296) 100000000)) (not (<= 10000000 (mod (+ (* v_it_3 2) (* aux_mod_v_main_~x~0_30_58 4294967295) 10000000) 4294967296)))))) (<= (+ aux_mod_v_main_~x~0_30_58 (* aux_div_aux_mod_v_main_~x~0_29_31_42 2147483648) aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58 (* aux_div_v_main_~x~0_29_31 2147483648)) (+ (* aux_div_v_main_~x~0_30_58 4294967296) 10000000)) (<= (+ 4304967296 (* aux_div_v_main_~x~0_30_58 4294967296)) (+ aux_mod_v_main_~x~0_30_58 (* aux_div_aux_mod_v_main_~x~0_29_31_42 4294967296) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58))) (<= (+ 4304967296 (* aux_div_v_main_~x~0_30_58 4294967296)) (+ aux_mod_v_main_~x~0_30_58 (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58))))) (> 0 aux_mod_v_main_~x~0_30_58)))) (<= (div (+ main_~x~0 (- 100000001)) 4294967296) (div (+ main_~x~0 (- 4294967296)) 4294967296)) (or (forall ((aux_div_aux_mod_v_main_~x~0_29_31_42 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58 Int) (aux_div_v_main_~x~0_29_31 Int)) (or (<= (+ main_~x~0 4294967296) (+ (* aux_div_aux_mod_v_main_~x~0_29_31_42 4294967296) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58))) (< (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58) (+ 100000000 main_~x~0)) (= (+ 100000000 main_~x~0) (+ (* aux_div_aux_mod_v_main_~x~0_29_31_42 4294967296) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58))) (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)))) (<= (+ v_it_3 main_~x~0 1) (+ (* aux_div_aux_mod_v_main_~x~0_29_31_42 2147483648) aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58 (* aux_div_v_main_~x~0_29_31 2147483648))) (<= 1 v_it_3))) (<= (+ main_~x~0 4294967296) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58)) (<= (+ (* aux_div_aux_mod_v_main_~x~0_29_31_42 2147483648) aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58 (* aux_div_v_main_~x~0_29_31 2147483648)) main_~x~0) (< (+ (* aux_div_aux_mod_v_main_~x~0_29_31_42 4294967296) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_29_31_42_58)) main_~x~0))) (not (< (mod main_~x~0 4294967296) 100000000)) (not (<= 10000000 (mod main_~x~0 4294967296)))))} is VALID [2022-04-28 03:33:08,353 INFO L272 TraceCheckUtils]: 4: Hoare triple {385#true} call #t~ret5 := main(); {385#true} is VALID [2022-04-28 03:33:08,353 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {385#true} {385#true} #40#return; {385#true} is VALID [2022-04-28 03:33:08,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-28 03:33:08,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {385#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(12, 2);call #Ultimate.allocInit(12, 3); {385#true} is VALID [2022-04-28 03:33:08,353 INFO L272 TraceCheckUtils]: 0: Hoare triple {385#true} call ULTIMATE.init(); {385#true} is VALID [2022-04-28 03:33:08,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-04-28 03:33:08,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634851556] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:33:08,354 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 03:33:08,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2022-04-28 03:33:12,839 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:33:12,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [977880694] [2022-04-28 03:33:12,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [977880694] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:33:12,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:33:12,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:33:12,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390982698] [2022-04-28 03:33:12,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:33:12,840 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 03:33:12,840 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:33:12,840 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:33:12,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:33:12,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 03:33:12,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:33:12,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 03:33:12,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=111, Unknown=2, NotChecked=22, Total=182 [2022-04-28 03:33:12,864 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:33:13,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:33:13,087 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-28 03:33:13,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 03:33:13,087 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 03:33:13,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:33:13,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:33:13,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-28 03:33:13,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:33:13,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-28 03:33:13,090 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2022-04-28 03:33:13,123 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:33:13,123 INFO L225 Difference]: With dead ends: 26 [2022-04-28 03:33:13,123 INFO L226 Difference]: Without dead ends: 19 [2022-04-28 03:33:13,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=47, Invalid=111, Unknown=2, NotChecked=22, Total=182 [2022-04-28 03:33:13,124 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:33:13,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 61 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 10 Unchecked, 0.1s Time] [2022-04-28 03:33:13,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-28 03:33:13,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-28 03:33:13,135 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:33:13,136 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:33:13,136 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:33:13,136 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:33:13,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:33:13,137 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-28 03:33:13,137 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-28 03:33:13,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:33:13,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:33:13,137 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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 19 states. [2022-04-28 03:33:13,137 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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 19 states. [2022-04-28 03:33:13,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:33:13,138 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-28 03:33:13,138 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-28 03:33:13,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:33:13,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:33:13,138 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:33:13,138 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:33:13,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:33:13,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-28 03:33:13,139 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2022-04-28 03:33:13,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:33:13,139 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-28 03:33:13,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:33:13,140 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 21 transitions. [2022-04-28 03:33:13,172 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:33:13,172 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-28 03:33:13,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 03:33:13,173 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:33:13,173 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:33:13,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 03:33:13,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:33:13,374 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:33:13,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:33:13,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1060678325, now seen corresponding path program 2 times [2022-04-28 03:33:13,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:33:13,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [314310772] [2022-04-28 03:33:13,984 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:33:14,254 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:33:14,256 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:33:14,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1802637648, now seen corresponding path program 1 times [2022-04-28 03:33:14,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:33:14,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567581086] [2022-04-28 03:33:14,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:33:14,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:33:14,273 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) main_~x~0_6) (* (- 2) .v_it_5.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_5.0)) 4294967296)) 10000000) 0) [2022-04-28 03:33:14,274 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_6) (* (- 2) .v_it_5.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_5.0)) 4294967296)) 100000000) 0)) [2022-04-28 03:33:14,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:33:14,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:33:14,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567581086] [2022-04-28 03:33:14,321 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Interpolation not supported for quantified formulae. [2022-04-28 03:33:14,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999803498] [2022-04-28 03:33:14,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:33:14,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:33:14,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:33:14,325 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:33:14,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 03:33:14,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:33:14,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 03:33:14,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:33:14,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:33:24,613 INFO L272 TraceCheckUtils]: 0: Hoare triple {610#true} call ULTIMATE.init(); {610#true} is VALID [2022-04-28 03:33:24,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {610#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(12, 2);call #Ultimate.allocInit(12, 3); {610#true} is VALID [2022-04-28 03:33:24,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {610#true} assume true; {610#true} is VALID [2022-04-28 03:33:24,614 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {610#true} {610#true} #40#return; {610#true} is VALID [2022-04-28 03:33:24,614 INFO L272 TraceCheckUtils]: 4: Hoare triple {610#true} call #t~ret5 := main(); {610#true} is VALID [2022-04-28 03:33:24,614 INFO L290 TraceCheckUtils]: 5: Hoare triple {610#true} ~x~0 := 0; {630#(= main_~x~0 0)} is VALID [2022-04-28 03:33:24,615 INFO L290 TraceCheckUtils]: 6: Hoare triple {630#(= main_~x~0 0)} [52] 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] {634#(or (= main_~x~0 0) (and (< 0 main_~x~0) (<= (div (+ (* (- 1) main_~x~0) 10000000) (- 4294967296)) 0)))} is VALID [2022-04-28 03:33:24,615 INFO L290 TraceCheckUtils]: 7: Hoare triple {634#(or (= main_~x~0 0) (and (< 0 main_~x~0) (<= (div (+ (* (- 1) main_~x~0) 10000000) (- 4294967296)) 0)))} [53] L8-2_primed-->L9-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {634#(or (= main_~x~0 0) (and (< 0 main_~x~0) (<= (div (+ (* (- 1) main_~x~0) 10000000) (- 4294967296)) 0)))} is VALID [2022-04-28 03:33:24,756 INFO L290 TraceCheckUtils]: 8: Hoare triple {634#(or (= main_~x~0 0) (and (< 0 main_~x~0) (<= (div (+ (* (- 1) main_~x~0) 10000000) (- 4294967296)) 0)))} [54] 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] {641#(or (= main_~x~0 0) (exists ((aux_div_aux_mod_v_main_~x~0_47_31_102 Int) (aux_div_v_main_~x~0_47_31 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_47_31_102_45 Int)) (and (<= (div (+ (* (- 2) aux_div_aux_mod_aux_mod_v_main_~x~0_47_31_102_45) (* (- 1) main_~x~0) 10000000 (* 2 aux_div_aux_mod_v_main_~x~0_47_31_102)) (- 4294967296)) 0) (< (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_47_31_102_45) main_~x~0) (+ (* aux_div_v_main_~x~0_47_31 4294967296) 4294967296 (* 2 aux_div_aux_mod_v_main_~x~0_47_31_102))) (<= 0 (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_47_31_102_45)) (<= (+ 10000000 (* 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)) (< (* 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)) (< (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_47_31_102_45) 2) (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 (< 0 main_~x~0) (<= (div (+ (* (- 1) main_~x~0) 10000000) (- 4294967296)) 0)))} is VALID [2022-04-28 03:33:24,759 INFO L290 TraceCheckUtils]: 9: Hoare triple {641#(or (= main_~x~0 0) (exists ((aux_div_aux_mod_v_main_~x~0_47_31_102 Int) (aux_div_v_main_~x~0_47_31 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_47_31_102_45 Int)) (and (<= (div (+ (* (- 2) aux_div_aux_mod_aux_mod_v_main_~x~0_47_31_102_45) (* (- 1) main_~x~0) 10000000 (* 2 aux_div_aux_mod_v_main_~x~0_47_31_102)) (- 4294967296)) 0) (< (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_47_31_102_45) main_~x~0) (+ (* aux_div_v_main_~x~0_47_31 4294967296) 4294967296 (* 2 aux_div_aux_mod_v_main_~x~0_47_31_102))) (<= 0 (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_47_31_102_45)) (<= (+ 10000000 (* 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)) (< (* 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)) (< (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_47_31_102_45) 2) (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 (< 0 main_~x~0) (<= (div (+ (* (- 1) main_~x~0) 10000000) (- 4294967296)) 0)))} [51] 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[] {645#(and (not (< (mod main_~x~0 4294967296) 100000000)) (exists ((aux_div_aux_mod_v_main_~x~0_47_31_102 Int) (aux_div_v_main_~x~0_47_31 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_47_31_102_45 Int)) (and (<= (div (+ (* (- 2) aux_div_aux_mod_aux_mod_v_main_~x~0_47_31_102_45) (* (- 1) main_~x~0) 10000000 (* 2 aux_div_aux_mod_v_main_~x~0_47_31_102)) (- 4294967296)) 0) (< (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_47_31_102_45) main_~x~0) (+ (* aux_div_v_main_~x~0_47_31 4294967296) 4294967296 (* 2 aux_div_aux_mod_v_main_~x~0_47_31_102))) (<= 0 (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_47_31_102_45)) (<= (+ 10000000 (* 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)) (< (* 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)) (< (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_47_31_102_45) 2) (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))))} is VALID [2022-04-28 03:33:24,777 INFO L272 TraceCheckUtils]: 10: Hoare triple {645#(and (not (< (mod main_~x~0 4294967296) 100000000)) (exists ((aux_div_aux_mod_v_main_~x~0_47_31_102 Int) (aux_div_v_main_~x~0_47_31 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_47_31_102_45 Int)) (and (<= (div (+ (* (- 2) aux_div_aux_mod_aux_mod_v_main_~x~0_47_31_102_45) (* (- 1) main_~x~0) 10000000 (* 2 aux_div_aux_mod_v_main_~x~0_47_31_102)) (- 4294967296)) 0) (< (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_47_31_102_45) main_~x~0) (+ (* aux_div_v_main_~x~0_47_31 4294967296) 4294967296 (* 2 aux_div_aux_mod_v_main_~x~0_47_31_102))) (<= 0 (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_47_31_102_45)) (<= (+ 10000000 (* 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)) (< (* 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)) (< (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_47_31_102_45) 2) (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))))} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {649#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:33:24,777 INFO L290 TraceCheckUtils]: 11: Hoare triple {649#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {653#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:33:24,777 INFO L290 TraceCheckUtils]: 12: Hoare triple {653#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {611#false} is VALID [2022-04-28 03:33:24,778 INFO L290 TraceCheckUtils]: 13: Hoare triple {611#false} assume !false; {611#false} is VALID [2022-04-28 03:33:24,778 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:33:24,778 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:37:54,581 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173 Int)) (let ((.cse0 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56))) (or (<= 2 .cse0) (< .cse0 0) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173 0) (and (let ((.cse1 (* (- 1) c_main_~x~0))) (or (<= (div (+ .cse1 (- 1)) (- 4294967296)) (+ (div (+ (- 100000000) c_main_~x~0) 4294967296) 1)) (<= (div (+ .cse1 9999999) (- 4294967296)) (+ 1 (div (+ (- 4294967296) c_main_~x~0) 4294967296))) (exists ((v_it_5 Int)) (and (<= (+ v_it_5 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56 1) aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173) (<= 1 v_it_5) (let ((.cse2 (mod (+ (* v_it_5 2) c_main_~x~0) 4294967296))) (or (not (<= 10000000 .cse2)) (not (< .cse2 100000000)))))) (forall ((aux_div_v_main_~x~0_48_31 Int) (aux_div_aux_mod_v_main_~x~0_48_31_42 Int)) (let ((.cse6 (* aux_div_aux_mod_v_main_~x~0_48_31_42 4294967296)) (.cse3 (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173 2) c_main_~x~0)) (.cse4 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56)) (.cse5 (* aux_div_v_main_~x~0_48_31 4294967296))) (or (= .cse3 (+ 100000000 .cse4 .cse5)) (<= (+ .cse4 4294967296 .cse5) .cse3) (<= (+ .cse4 .cse6 4294967296 .cse5) .cse3) (< .cse3 (+ 100000000 .cse4 .cse6 .cse5)) (< .cse3 (+ .cse4 .cse5))))))) (forall ((aux_mod_aux_mod_aux_mod_v_main_~x~0_49_31_42_181 Int) (aux_div_v_main_~x~0_48_31 Int) (aux_div_v_main_~x~0_49_31 Int) (aux_div_aux_mod_v_main_~x~0_49_31_42 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_49_31_42_181 Int) (aux_div_aux_mod_v_main_~x~0_48_31_42 Int)) (let ((.cse12 (* aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173 2)) (.cse8 (* 4294967296 aux_div_aux_mod_aux_mod_v_main_~x~0_49_31_42_181))) (let ((.cse15 (+ 10000000 .cse8)) (.cse16 (* aux_div_aux_mod_v_main_~x~0_49_31_42 4294967296)) (.cse9 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56)) (.cse14 (* aux_div_aux_mod_v_main_~x~0_48_31_42 4294967296)) (.cse10 (* aux_div_v_main_~x~0_48_31 4294967296)) (.cse11 (+ .cse12 .cse8)) (.cse7 (* aux_div_v_main_~x~0_49_31 4294967296))) (or (<= (+ 4284967296 .cse7 aux_mod_aux_mod_aux_mod_v_main_~x~0_49_31_42_181) .cse8) (<= (+ 4284967296 .cse9 aux_mod_aux_mod_aux_mod_v_main_~x~0_49_31_42_181 .cse10) .cse11) (< (+ .cse12 10000000 .cse8) (+ .cse9 aux_mod_aux_mod_aux_mod_v_main_~x~0_49_31_42_181 .cse10)) (exists ((v_it_5 Int)) (and (<= (+ v_it_5 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56 1) aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173) (let ((.cse13 (mod (+ (* 4294967295 aux_mod_aux_mod_aux_mod_v_main_~x~0_49_31_42_181) (* v_it_5 2) 10000000) 4294967296))) (or (not (<= 10000000 .cse13)) (not (< .cse13 100000000)))) (<= 1 v_it_5))) (< .cse11 (+ 90000000 .cse9 aux_mod_aux_mod_aux_mod_v_main_~x~0_49_31_42_181 .cse14 .cse10)) (< (+ (div (+ (- 4294967295) c_main_~x~0) 4294967296) 1) aux_div_aux_mod_aux_mod_v_main_~x~0_49_31_42_181) (not (< (+ aux_mod_aux_mod_aux_mod_v_main_~x~0_49_31_42_181 c_main_~x~0) .cse15)) (= (+ (* (- 1) aux_mod_aux_mod_aux_mod_v_main_~x~0_49_31_42_181) .cse12 10000000 .cse8) (+ 100000000 .cse9 .cse10)) (<= (+ 90000000 .cse16 .cse7 aux_mod_aux_mod_aux_mod_v_main_~x~0_49_31_42_181) .cse8) (< .cse15 (+ .cse16 .cse7 aux_mod_aux_mod_aux_mod_v_main_~x~0_49_31_42_181)) (> 0 aux_mod_aux_mod_aux_mod_v_main_~x~0_49_31_42_181) (<= (+ 4284967296 .cse9 aux_mod_aux_mod_aux_mod_v_main_~x~0_49_31_42_181 .cse14 .cse10) .cse11) (< .cse8 (+ .cse7 aux_mod_aux_mod_aux_mod_v_main_~x~0_49_31_42_181)))))))))) (<= (div (+ (* (- 1) c_main_~x~0) 100000000) (- 4294967296)) (+ 2 (div (+ (- 8589934592) c_main_~x~0) 4294967296)))) is different from false [2022-04-28 03:37:56,293 INFO L290 TraceCheckUtils]: 13: Hoare triple {611#false} assume !false; {611#false} is VALID [2022-04-28 03:37:56,293 INFO L290 TraceCheckUtils]: 12: Hoare triple {653#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {611#false} is VALID [2022-04-28 03:37:56,294 INFO L290 TraceCheckUtils]: 11: Hoare triple {649#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {653#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:37:56,295 INFO L272 TraceCheckUtils]: 10: Hoare triple {669#(= 100000000 (mod main_~x~0 4294967296))} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {649#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:37:56,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {673#(or (< (mod main_~x~0 4294967296) 100000000) (= 100000000 (mod main_~x~0 4294967296)))} [51] 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[] {669#(= 100000000 (mod main_~x~0 4294967296))} is VALID [2022-04-28 03:37:58,329 WARN L290 TraceCheckUtils]: 8: Hoare triple {677#(and (<= (div (+ main_~x~0 (- 100000001)) 4294967296) (div (+ main_~x~0 (- 4294967296)) 4294967296)) (or (forall ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56 Int) (aux_div_v_main_~x~0_48_31 Int) (aux_div_aux_mod_v_main_~x~0_48_31_42 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173 Int)) (or (<= 2 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56)) (<= (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56) (* aux_div_aux_mod_v_main_~x~0_48_31_42 4294967296) 4294967296 (* aux_div_v_main_~x~0_48_31 4294967296)) (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173 2))) (< (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56) 0) (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 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56 1) aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173) (<= 1 v_it_5))) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173 0) (<= (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56) 4294967296 (* aux_div_v_main_~x~0_48_31 4294967296)) (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173 2))) (< (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173 2)) (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56) (* aux_div_v_main_~x~0_48_31 4294967296))) (= (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173 2)) (+ 100000000 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56) (* aux_div_v_main_~x~0_48_31 4294967296))) (< (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173 2)) (+ 100000000 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56) (* aux_div_aux_mod_v_main_~x~0_48_31_42 4294967296) (* aux_div_v_main_~x~0_48_31 4294967296))))) (not (< (mod main_~x~0 4294967296) 100000000)) (not (<= 10000000 (mod main_~x~0 4294967296)))))} [54] 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] {673#(or (< (mod main_~x~0 4294967296) 100000000) (= 100000000 (mod main_~x~0 4294967296)))} is UNKNOWN [2022-04-28 03:37:58,335 INFO L290 TraceCheckUtils]: 7: Hoare triple {677#(and (<= (div (+ main_~x~0 (- 100000001)) 4294967296) (div (+ main_~x~0 (- 4294967296)) 4294967296)) (or (forall ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56 Int) (aux_div_v_main_~x~0_48_31 Int) (aux_div_aux_mod_v_main_~x~0_48_31_42 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173 Int)) (or (<= 2 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56)) (<= (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56) (* aux_div_aux_mod_v_main_~x~0_48_31_42 4294967296) 4294967296 (* aux_div_v_main_~x~0_48_31 4294967296)) (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173 2))) (< (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56) 0) (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 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56 1) aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173) (<= 1 v_it_5))) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173 0) (<= (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56) 4294967296 (* aux_div_v_main_~x~0_48_31 4294967296)) (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173 2))) (< (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173 2)) (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56) (* aux_div_v_main_~x~0_48_31 4294967296))) (= (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173 2)) (+ 100000000 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56) (* aux_div_v_main_~x~0_48_31 4294967296))) (< (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173 2)) (+ 100000000 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56) (* aux_div_aux_mod_v_main_~x~0_48_31_42 4294967296) (* aux_div_v_main_~x~0_48_31 4294967296))))) (not (< (mod main_~x~0 4294967296) 100000000)) (not (<= 10000000 (mod main_~x~0 4294967296)))))} [53] L8-2_primed-->L9-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {677#(and (<= (div (+ main_~x~0 (- 100000001)) 4294967296) (div (+ main_~x~0 (- 4294967296)) 4294967296)) (or (forall ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56 Int) (aux_div_v_main_~x~0_48_31 Int) (aux_div_aux_mod_v_main_~x~0_48_31_42 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173 Int)) (or (<= 2 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56)) (<= (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56) (* aux_div_aux_mod_v_main_~x~0_48_31_42 4294967296) 4294967296 (* aux_div_v_main_~x~0_48_31 4294967296)) (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173 2))) (< (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56) 0) (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 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56 1) aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173) (<= 1 v_it_5))) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173 0) (<= (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56) 4294967296 (* aux_div_v_main_~x~0_48_31 4294967296)) (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173 2))) (< (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173 2)) (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56) (* aux_div_v_main_~x~0_48_31 4294967296))) (= (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173 2)) (+ 100000000 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56) (* aux_div_v_main_~x~0_48_31 4294967296))) (< (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173 2)) (+ 100000000 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56) (* aux_div_aux_mod_v_main_~x~0_48_31_42 4294967296) (* aux_div_v_main_~x~0_48_31 4294967296))))) (not (< (mod main_~x~0 4294967296) 100000000)) (not (<= 10000000 (mod main_~x~0 4294967296)))))} is VALID [2022-04-28 03:38:00,387 WARN L290 TraceCheckUtils]: 6: Hoare triple {684#(and (forall ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173 Int)) (or (<= 2 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56)) (< (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56) 0) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173 0) (and (or (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 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56 1) aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173) (<= 1 v_it_5))) (forall ((aux_div_v_main_~x~0_48_31 Int) (aux_div_aux_mod_v_main_~x~0_48_31_42 Int)) (or (<= (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56) (* aux_div_aux_mod_v_main_~x~0_48_31_42 4294967296) 4294967296 (* aux_div_v_main_~x~0_48_31 4294967296)) (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173 2))) (<= (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56) 4294967296 (* aux_div_v_main_~x~0_48_31 4294967296)) (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173 2))) (< (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173 2)) (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56) (* aux_div_v_main_~x~0_48_31 4294967296))) (= (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173 2)) (+ 100000000 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56) (* aux_div_v_main_~x~0_48_31 4294967296))) (< (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173 2)) (+ 100000000 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56) (* aux_div_aux_mod_v_main_~x~0_48_31_42 4294967296) (* aux_div_v_main_~x~0_48_31 4294967296))))) (<= (div (+ (- 1) (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 100000000)) 4294967296) 1)) (<= (div (+ 9999999 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1))) (forall ((aux_mod_aux_mod_aux_mod_v_main_~x~0_49_31_42_181 Int) (aux_div_v_main_~x~0_48_31 Int) (aux_div_v_main_~x~0_49_31 Int) (aux_div_aux_mod_v_main_~x~0_49_31_42 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_49_31_42_181 Int) (aux_div_aux_mod_v_main_~x~0_48_31_42 Int)) (or (<= (+ 4284967296 (* aux_div_v_main_~x~0_49_31 4294967296) aux_mod_aux_mod_aux_mod_v_main_~x~0_49_31_42_181) (* 4294967296 aux_div_aux_mod_aux_mod_v_main_~x~0_49_31_42_181)) (not (< (+ main_~x~0 aux_mod_aux_mod_aux_mod_v_main_~x~0_49_31_42_181) (+ 10000000 (* 4294967296 aux_div_aux_mod_aux_mod_v_main_~x~0_49_31_42_181)))) (<= (+ 4284967296 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56) aux_mod_aux_mod_aux_mod_v_main_~x~0_49_31_42_181 (* aux_div_v_main_~x~0_48_31 4294967296)) (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173 2) (* 4294967296 aux_div_aux_mod_aux_mod_v_main_~x~0_49_31_42_181))) (< (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173 2) 10000000 (* 4294967296 aux_div_aux_mod_aux_mod_v_main_~x~0_49_31_42_181)) (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56) aux_mod_aux_mod_aux_mod_v_main_~x~0_49_31_42_181 (* aux_div_v_main_~x~0_48_31 4294967296))) (exists ((v_it_5 Int)) (and (<= (+ v_it_5 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56 1) aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173) (or (not (<= 10000000 (mod (+ (* 4294967295 aux_mod_aux_mod_aux_mod_v_main_~x~0_49_31_42_181) (* v_it_5 2) 10000000) 4294967296))) (not (< (mod (+ (* 4294967295 aux_mod_aux_mod_aux_mod_v_main_~x~0_49_31_42_181) (* v_it_5 2) 10000000) 4294967296) 100000000))) (<= 1 v_it_5))) (< (+ (div (+ main_~x~0 (- 4294967295)) 4294967296) 1) aux_div_aux_mod_aux_mod_v_main_~x~0_49_31_42_181) (< (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173 2) (* 4294967296 aux_div_aux_mod_aux_mod_v_main_~x~0_49_31_42_181)) (+ 90000000 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56) aux_mod_aux_mod_aux_mod_v_main_~x~0_49_31_42_181 (* aux_div_aux_mod_v_main_~x~0_48_31_42 4294967296) (* aux_div_v_main_~x~0_48_31 4294967296))) (= (+ (* (- 1) aux_mod_aux_mod_aux_mod_v_main_~x~0_49_31_42_181) (* aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173 2) 10000000 (* 4294967296 aux_div_aux_mod_aux_mod_v_main_~x~0_49_31_42_181)) (+ 100000000 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56) (* aux_div_v_main_~x~0_48_31 4294967296))) (<= (+ 90000000 (* aux_div_aux_mod_v_main_~x~0_49_31_42 4294967296) (* aux_div_v_main_~x~0_49_31 4294967296) aux_mod_aux_mod_aux_mod_v_main_~x~0_49_31_42_181) (* 4294967296 aux_div_aux_mod_aux_mod_v_main_~x~0_49_31_42_181)) (< (+ 10000000 (* 4294967296 aux_div_aux_mod_aux_mod_v_main_~x~0_49_31_42_181)) (+ (* aux_div_aux_mod_v_main_~x~0_49_31_42 4294967296) (* aux_div_v_main_~x~0_49_31 4294967296) aux_mod_aux_mod_aux_mod_v_main_~x~0_49_31_42_181)) (> 0 aux_mod_aux_mod_aux_mod_v_main_~x~0_49_31_42_181) (<= (+ 4284967296 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56) aux_mod_aux_mod_aux_mod_v_main_~x~0_49_31_42_181 (* aux_div_aux_mod_v_main_~x~0_48_31_42 4294967296) (* aux_div_v_main_~x~0_48_31 4294967296)) (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173 2) (* 4294967296 aux_div_aux_mod_aux_mod_v_main_~x~0_49_31_42_181))) (< (* 4294967296 aux_div_aux_mod_aux_mod_v_main_~x~0_49_31_42_181) (+ (* aux_div_v_main_~x~0_49_31 4294967296) aux_mod_aux_mod_aux_mod_v_main_~x~0_49_31_42_181))))))) (<= (div (+ 100000000 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ (- 8589934592) main_~x~0) 4294967296) 2)))} [52] 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] {677#(and (<= (div (+ main_~x~0 (- 100000001)) 4294967296) (div (+ main_~x~0 (- 4294967296)) 4294967296)) (or (forall ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56 Int) (aux_div_v_main_~x~0_48_31 Int) (aux_div_aux_mod_v_main_~x~0_48_31_42 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173 Int)) (or (<= 2 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56)) (<= (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56) (* aux_div_aux_mod_v_main_~x~0_48_31_42 4294967296) 4294967296 (* aux_div_v_main_~x~0_48_31 4294967296)) (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173 2))) (< (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56) 0) (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 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56 1) aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173) (<= 1 v_it_5))) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173 0) (<= (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56) 4294967296 (* aux_div_v_main_~x~0_48_31 4294967296)) (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173 2))) (< (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173 2)) (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56) (* aux_div_v_main_~x~0_48_31 4294967296))) (= (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173 2)) (+ 100000000 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56) (* aux_div_v_main_~x~0_48_31 4294967296))) (< (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173 2)) (+ 100000000 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56) (* aux_div_aux_mod_v_main_~x~0_48_31_42 4294967296) (* aux_div_v_main_~x~0_48_31 4294967296))))) (not (< (mod main_~x~0 4294967296) 100000000)) (not (<= 10000000 (mod main_~x~0 4294967296)))))} is UNKNOWN [2022-04-28 03:38:00,410 INFO L290 TraceCheckUtils]: 5: Hoare triple {610#true} ~x~0 := 0; {684#(and (forall ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173 Int)) (or (<= 2 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56)) (< (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56) 0) (<= aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173 0) (and (or (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 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56 1) aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173) (<= 1 v_it_5))) (forall ((aux_div_v_main_~x~0_48_31 Int) (aux_div_aux_mod_v_main_~x~0_48_31_42 Int)) (or (<= (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56) (* aux_div_aux_mod_v_main_~x~0_48_31_42 4294967296) 4294967296 (* aux_div_v_main_~x~0_48_31 4294967296)) (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173 2))) (<= (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56) 4294967296 (* aux_div_v_main_~x~0_48_31 4294967296)) (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173 2))) (< (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173 2)) (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56) (* aux_div_v_main_~x~0_48_31 4294967296))) (= (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173 2)) (+ 100000000 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56) (* aux_div_v_main_~x~0_48_31 4294967296))) (< (+ main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173 2)) (+ 100000000 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56) (* aux_div_aux_mod_v_main_~x~0_48_31_42 4294967296) (* aux_div_v_main_~x~0_48_31 4294967296))))) (<= (div (+ (- 1) (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 100000000)) 4294967296) 1)) (<= (div (+ 9999999 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1))) (forall ((aux_mod_aux_mod_aux_mod_v_main_~x~0_49_31_42_181 Int) (aux_div_v_main_~x~0_48_31 Int) (aux_div_v_main_~x~0_49_31 Int) (aux_div_aux_mod_v_main_~x~0_49_31_42 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_49_31_42_181 Int) (aux_div_aux_mod_v_main_~x~0_48_31_42 Int)) (or (<= (+ 4284967296 (* aux_div_v_main_~x~0_49_31 4294967296) aux_mod_aux_mod_aux_mod_v_main_~x~0_49_31_42_181) (* 4294967296 aux_div_aux_mod_aux_mod_v_main_~x~0_49_31_42_181)) (not (< (+ main_~x~0 aux_mod_aux_mod_aux_mod_v_main_~x~0_49_31_42_181) (+ 10000000 (* 4294967296 aux_div_aux_mod_aux_mod_v_main_~x~0_49_31_42_181)))) (<= (+ 4284967296 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56) aux_mod_aux_mod_aux_mod_v_main_~x~0_49_31_42_181 (* aux_div_v_main_~x~0_48_31 4294967296)) (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173 2) (* 4294967296 aux_div_aux_mod_aux_mod_v_main_~x~0_49_31_42_181))) (< (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173 2) 10000000 (* 4294967296 aux_div_aux_mod_aux_mod_v_main_~x~0_49_31_42_181)) (+ (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56) aux_mod_aux_mod_aux_mod_v_main_~x~0_49_31_42_181 (* aux_div_v_main_~x~0_48_31 4294967296))) (exists ((v_it_5 Int)) (and (<= (+ v_it_5 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56 1) aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173) (or (not (<= 10000000 (mod (+ (* 4294967295 aux_mod_aux_mod_aux_mod_v_main_~x~0_49_31_42_181) (* v_it_5 2) 10000000) 4294967296))) (not (< (mod (+ (* 4294967295 aux_mod_aux_mod_aux_mod_v_main_~x~0_49_31_42_181) (* v_it_5 2) 10000000) 4294967296) 100000000))) (<= 1 v_it_5))) (< (+ (div (+ main_~x~0 (- 4294967295)) 4294967296) 1) aux_div_aux_mod_aux_mod_v_main_~x~0_49_31_42_181) (< (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173 2) (* 4294967296 aux_div_aux_mod_aux_mod_v_main_~x~0_49_31_42_181)) (+ 90000000 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56) aux_mod_aux_mod_aux_mod_v_main_~x~0_49_31_42_181 (* aux_div_aux_mod_v_main_~x~0_48_31_42 4294967296) (* aux_div_v_main_~x~0_48_31 4294967296))) (= (+ (* (- 1) aux_mod_aux_mod_aux_mod_v_main_~x~0_49_31_42_181) (* aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173 2) 10000000 (* 4294967296 aux_div_aux_mod_aux_mod_v_main_~x~0_49_31_42_181)) (+ 100000000 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56) (* aux_div_v_main_~x~0_48_31 4294967296))) (<= (+ 90000000 (* aux_div_aux_mod_v_main_~x~0_49_31_42 4294967296) (* aux_div_v_main_~x~0_49_31 4294967296) aux_mod_aux_mod_aux_mod_v_main_~x~0_49_31_42_181) (* 4294967296 aux_div_aux_mod_aux_mod_v_main_~x~0_49_31_42_181)) (< (+ 10000000 (* 4294967296 aux_div_aux_mod_aux_mod_v_main_~x~0_49_31_42_181)) (+ (* aux_div_aux_mod_v_main_~x~0_49_31_42 4294967296) (* aux_div_v_main_~x~0_49_31 4294967296) aux_mod_aux_mod_aux_mod_v_main_~x~0_49_31_42_181)) (> 0 aux_mod_aux_mod_aux_mod_v_main_~x~0_49_31_42_181) (<= (+ 4284967296 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_48_31_42_173_56) aux_mod_aux_mod_aux_mod_v_main_~x~0_49_31_42_181 (* aux_div_aux_mod_v_main_~x~0_48_31_42 4294967296) (* aux_div_v_main_~x~0_48_31 4294967296)) (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_42_173 2) (* 4294967296 aux_div_aux_mod_aux_mod_v_main_~x~0_49_31_42_181))) (< (* 4294967296 aux_div_aux_mod_aux_mod_v_main_~x~0_49_31_42_181) (+ (* aux_div_v_main_~x~0_49_31 4294967296) aux_mod_aux_mod_aux_mod_v_main_~x~0_49_31_42_181))))))) (<= (div (+ 100000000 (* (- 1) main_~x~0)) (- 4294967296)) (+ (div (+ (- 8589934592) main_~x~0) 4294967296) 2)))} is VALID [2022-04-28 03:38:00,411 INFO L272 TraceCheckUtils]: 4: Hoare triple {610#true} call #t~ret5 := main(); {610#true} is VALID [2022-04-28 03:38:00,411 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {610#true} {610#true} #40#return; {610#true} is VALID [2022-04-28 03:38:00,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {610#true} assume true; {610#true} is VALID [2022-04-28 03:38:00,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {610#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(12, 2);call #Ultimate.allocInit(12, 3); {610#true} is VALID [2022-04-28 03:38:00,420 INFO L272 TraceCheckUtils]: 0: Hoare triple {610#true} call ULTIMATE.init(); {610#true} is VALID [2022-04-28 03:38:00,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-04-28 03:38:00,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999803498] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:38:00,420 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 03:38:00,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2022-04-28 03:38:05,204 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:38:05,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [314310772] [2022-04-28 03:38:05,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [314310772] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:38:05,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:38:05,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 03:38:05,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515240644] [2022-04-28 03:38:05,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:38:05,205 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (3), 2 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 17 [2022-04-28 03:38:05,205 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:38:05,205 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:38:05,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:38:05,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 03:38:05,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:38:05,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 03:38:05,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=132, Unknown=1, NotChecked=24, Total=210 [2022-04-28 03:38:05,243 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:38:05,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:38:05,570 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2022-04-28 03:38:05,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 03:38:05,570 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (3), 2 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 17 [2022-04-28 03:38:05,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:38:05,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:38:05,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2022-04-28 03:38:05,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:38:05,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2022-04-28 03:38:05,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 33 transitions. [2022-04-28 03:38:05,608 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:38:05,609 INFO L225 Difference]: With dead ends: 28 [2022-04-28 03:38:05,609 INFO L226 Difference]: Without dead ends: 21 [2022-04-28 03:38:05,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=53, Invalid=132, Unknown=1, NotChecked=24, Total=210 [2022-04-28 03:38:05,611 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:38:05,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 61 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 12 Unchecked, 0.1s Time] [2022-04-28 03:38:05,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-28 03:38:05,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-28 03:38:05,626 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:38:05,627 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:38:05,628 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:38:05,628 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:38:05,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:38:05,631 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-28 03:38:05,631 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-28 03:38:05,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:38:05,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:38:05,632 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-28 03:38:05,632 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-28 03:38:05,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:38:05,633 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-28 03:38:05,633 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-28 03:38:05,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:38:05,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:38:05,633 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:38:05,633 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:38:05,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:38:05,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-04-28 03:38:05,638 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 17 [2022-04-28 03:38:05,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:38:05,638 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-04-28 03:38:05,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:38:05,638 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 23 transitions. [2022-04-28 03:38:05,667 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:38:05,667 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-28 03:38:05,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 03:38:05,668 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:38:05,668 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:38:05,674 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-28 03:38:05,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:38:05,876 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:38:05,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:38:05,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1757755696, now seen corresponding path program 3 times [2022-04-28 03:38:05,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:38:05,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [713023244] [2022-04-28 03:38:07,447 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:38:07,613 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:38:09,847 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:38:09,849 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:38:09,852 INFO L85 PathProgramCache]: Analyzing trace with hash 246894512, now seen corresponding path program 1 times [2022-04-28 03:38:09,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:38:09,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687884154] [2022-04-28 03:38:09,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:38:09,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:38:09,863 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) main_~x~0_6) (* (- 2) .v_it_7.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_7.0)) 4294967296)) 10000000) 0) [2022-04-28 03:38:09,863 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_6) (* (- 2) .v_it_7.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_7.0)) 4294967296)) 100000000) 0)) [2022-04-28 03:38:09,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:38:09,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:38:09,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687884154] [2022-04-28 03:38:09,908 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Interpolation not supported for quantified formulae. [2022-04-28 03:38:09,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201558729] [2022-04-28 03:38:09,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:38:09,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:38:09,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:38:09,909 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:38:09,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 03:38:10,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:38:10,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 03:38:10,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:38:10,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:40:40,033 INFO L272 TraceCheckUtils]: 0: Hoare triple {848#true} call ULTIMATE.init(); {848#true} is VALID [2022-04-28 03:40:40,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {848#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(12, 2);call #Ultimate.allocInit(12, 3); {848#true} is VALID [2022-04-28 03:40:40,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {848#true} assume true; {848#true} is VALID [2022-04-28 03:40:40,034 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {848#true} {848#true} #40#return; {848#true} is VALID [2022-04-28 03:40:40,034 INFO L272 TraceCheckUtils]: 4: Hoare triple {848#true} call #t~ret5 := main(); {848#true} is VALID [2022-04-28 03:40:40,036 INFO L290 TraceCheckUtils]: 5: Hoare triple {848#true} ~x~0 := 0; {868#(= main_~x~0 0)} is VALID [2022-04-28 03:40:40,037 INFO L290 TraceCheckUtils]: 6: Hoare triple {868#(= main_~x~0 0)} [56] L9-2-->L8-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_57 v_main_~x~0_56)) (.cse1 (= |v_main_#t~post4_23| |v_main_#t~post4_22|)) (.cse2 (mod v_main_~x~0_57 4294967296))) (or (and .cse0 .cse1 (<= 10000000 .cse2)) (and .cse0 .cse1) (and (<= (div (+ 10000000 (* (- 1) v_main_~x~0_56)) (- 4294967296)) (+ (div (+ v_main_~x~0_57 (- 4294967295)) 4294967296) 1)) (< v_main_~x~0_57 v_main_~x~0_56) (< .cse2 10000000)))) InVars {main_~x~0=v_main_~x~0_57, main_#t~post4=|v_main_#t~post4_23|} OutVars{main_~x~0=v_main_~x~0_56, main_#t~post4=|v_main_#t~post4_22|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {872#(or (= main_~x~0 0) (and (< 0 main_~x~0) (<= (div (+ (* (- 1) main_~x~0) 10000000) (- 4294967296)) 0)))} is VALID [2022-04-28 03:40:40,037 INFO L290 TraceCheckUtils]: 7: Hoare triple {872#(or (= main_~x~0 0) (and (< 0 main_~x~0) (<= (div (+ (* (- 1) main_~x~0) 10000000) (- 4294967296)) 0)))} [57] L8-2_primed-->L9-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {872#(or (= main_~x~0 0) (and (< 0 main_~x~0) (<= (div (+ (* (- 1) main_~x~0) 10000000) (- 4294967296)) 0)))} is VALID [2022-04-28 03:40:42,073 WARN L290 TraceCheckUtils]: 8: Hoare triple {872#(or (= main_~x~0 0) (and (< 0 main_~x~0) (<= (div (+ (* (- 1) main_~x~0) 10000000) (- 4294967296)) 0)))} [58] L9-2-->L8-2_primed: Formula: (let ((.cse4 (mod v_main_~x~0_59 4294967296))) (let ((.cse0 (= v_main_~x~0_59 v_main_~x~0_58)) (.cse1 (< .cse4 100000000)) (.cse2 (<= 10000000 .cse4))) (or .cse0 (and .cse0 (or (not .cse1) (not .cse2))) (and (forall ((v_it_7 Int)) (or (not (<= (+ v_it_7 1) (div (+ v_main_~x~0_59 (* (- 1) v_main_~x~0_58)) (- 2)))) (let ((.cse3 (mod (+ v_main_~x~0_59 (* v_it_7 2)) 4294967296))) (and (< .cse3 100000000) (<= 10000000 .cse3))) (not (<= 1 v_it_7)))) .cse1 (< 0 (div (+ v_main_~x~0_59 (* (- 1) v_main_~x~0_58)) (- 2))) .cse2 (= (mod (+ v_main_~x~0_59 v_main_~x~0_58) 2) 0))))) InVars {main_~x~0=v_main_~x~0_59} OutVars{main_~x~0=v_main_~x~0_58} AuxVars[] AssignedVars[main_~x~0] {879#(or (= main_~x~0 0) (exists ((aux_div_v_main_~x~0_67_58 Int)) (and (or (exists ((aux_div_aux_mod_v_main_~x~0_67_58_47 Int)) (and (< (* 2 aux_div_aux_mod_v_main_~x~0_67_58_47) (+ main_~x~0 (* aux_div_v_main_~x~0_67_58 4294967296) 10000000)) (forall ((v_it_7 Int)) (or (and (<= 10000000 (mod (+ (* v_it_7 2) main_~x~0 (* 4294967294 aux_div_aux_mod_v_main_~x~0_67_58_47) 10000000) 4294967296)) (< (mod (+ (* v_it_7 2) main_~x~0 (* 4294967294 aux_div_aux_mod_v_main_~x~0_67_58_47) 10000000) 4294967296) 100000000)) (not (<= (+ v_it_7 5000001 (* aux_div_v_main_~x~0_67_58 2147483648)) aux_div_aux_mod_v_main_~x~0_67_58_47)) (not (<= 1 v_it_7)))) (<= 10000000 (mod (+ main_~x~0 (* 4294967294 aux_div_aux_mod_v_main_~x~0_67_58_47) 10000000) 4294967296)) (<= main_~x~0 (* 2 aux_div_aux_mod_v_main_~x~0_67_58_47)) (< (+ 5000000 (* aux_div_v_main_~x~0_67_58 2147483648)) aux_div_aux_mod_v_main_~x~0_67_58_47))) (and (< 0 main_~x~0) (<= main_~x~0 (+ (* aux_div_v_main_~x~0_67_58 4294967296) 10000000)))) (<= aux_div_v_main_~x~0_67_58 0))))} is UNKNOWN [2022-04-28 03:40:44,083 WARN L290 TraceCheckUtils]: 9: Hoare triple {879#(or (= main_~x~0 0) (exists ((aux_div_v_main_~x~0_67_58 Int)) (and (or (exists ((aux_div_aux_mod_v_main_~x~0_67_58_47 Int)) (and (< (* 2 aux_div_aux_mod_v_main_~x~0_67_58_47) (+ main_~x~0 (* aux_div_v_main_~x~0_67_58 4294967296) 10000000)) (forall ((v_it_7 Int)) (or (and (<= 10000000 (mod (+ (* v_it_7 2) main_~x~0 (* 4294967294 aux_div_aux_mod_v_main_~x~0_67_58_47) 10000000) 4294967296)) (< (mod (+ (* v_it_7 2) main_~x~0 (* 4294967294 aux_div_aux_mod_v_main_~x~0_67_58_47) 10000000) 4294967296) 100000000)) (not (<= (+ v_it_7 5000001 (* aux_div_v_main_~x~0_67_58 2147483648)) aux_div_aux_mod_v_main_~x~0_67_58_47)) (not (<= 1 v_it_7)))) (<= 10000000 (mod (+ main_~x~0 (* 4294967294 aux_div_aux_mod_v_main_~x~0_67_58_47) 10000000) 4294967296)) (<= main_~x~0 (* 2 aux_div_aux_mod_v_main_~x~0_67_58_47)) (< (+ 5000000 (* aux_div_v_main_~x~0_67_58 2147483648)) aux_div_aux_mod_v_main_~x~0_67_58_47))) (and (< 0 main_~x~0) (<= main_~x~0 (+ (* aux_div_v_main_~x~0_67_58 4294967296) 10000000)))) (<= aux_div_v_main_~x~0_67_58 0))))} [55] 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[] {883#(and (exists ((aux_div_v_main_~x~0_67_58 Int)) (and (<= aux_div_v_main_~x~0_67_58 0) (exists ((aux_div_aux_mod_v_main_~x~0_67_58_47 Int)) (and (< (* 2 aux_div_aux_mod_v_main_~x~0_67_58_47) (+ main_~x~0 (* aux_div_v_main_~x~0_67_58 4294967296) 10000000)) (forall ((v_it_7 Int)) (or (and (<= 10000000 (mod (+ (* v_it_7 2) main_~x~0 (* 4294967294 aux_div_aux_mod_v_main_~x~0_67_58_47) 10000000) 4294967296)) (< (mod (+ (* v_it_7 2) main_~x~0 (* 4294967294 aux_div_aux_mod_v_main_~x~0_67_58_47) 10000000) 4294967296) 100000000)) (not (<= (+ v_it_7 5000001 (* aux_div_v_main_~x~0_67_58 2147483648)) aux_div_aux_mod_v_main_~x~0_67_58_47)) (not (<= 1 v_it_7)))) (<= 10000000 (mod (+ main_~x~0 (* 4294967294 aux_div_aux_mod_v_main_~x~0_67_58_47) 10000000) 4294967296)) (<= main_~x~0 (* 2 aux_div_aux_mod_v_main_~x~0_67_58_47)) (< (+ 5000000 (* aux_div_v_main_~x~0_67_58 2147483648)) aux_div_aux_mod_v_main_~x~0_67_58_47))))) (not (< (mod main_~x~0 4294967296) 100000000)))} is UNKNOWN [2022-04-28 03:40:44,089 INFO L272 TraceCheckUtils]: 10: Hoare triple {883#(and (exists ((aux_div_v_main_~x~0_67_58 Int)) (and (<= aux_div_v_main_~x~0_67_58 0) (exists ((aux_div_aux_mod_v_main_~x~0_67_58_47 Int)) (and (< (* 2 aux_div_aux_mod_v_main_~x~0_67_58_47) (+ main_~x~0 (* aux_div_v_main_~x~0_67_58 4294967296) 10000000)) (forall ((v_it_7 Int)) (or (and (<= 10000000 (mod (+ (* v_it_7 2) main_~x~0 (* 4294967294 aux_div_aux_mod_v_main_~x~0_67_58_47) 10000000) 4294967296)) (< (mod (+ (* v_it_7 2) main_~x~0 (* 4294967294 aux_div_aux_mod_v_main_~x~0_67_58_47) 10000000) 4294967296) 100000000)) (not (<= (+ v_it_7 5000001 (* aux_div_v_main_~x~0_67_58 2147483648)) aux_div_aux_mod_v_main_~x~0_67_58_47)) (not (<= 1 v_it_7)))) (<= 10000000 (mod (+ main_~x~0 (* 4294967294 aux_div_aux_mod_v_main_~x~0_67_58_47) 10000000) 4294967296)) (<= main_~x~0 (* 2 aux_div_aux_mod_v_main_~x~0_67_58_47)) (< (+ 5000000 (* aux_div_v_main_~x~0_67_58 2147483648)) aux_div_aux_mod_v_main_~x~0_67_58_47))))) (not (< (mod main_~x~0 4294967296) 100000000)))} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {887#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:40:44,090 INFO L290 TraceCheckUtils]: 11: Hoare triple {887#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {891#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:40:44,090 INFO L290 TraceCheckUtils]: 12: Hoare triple {891#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {849#false} is VALID [2022-04-28 03:40:44,090 INFO L290 TraceCheckUtils]: 13: Hoare triple {849#false} assume !false; {849#false} is VALID [2022-04-28 03:40:44,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:40:44,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:42:01,061 INFO L290 TraceCheckUtils]: 13: Hoare triple {849#false} assume !false; {849#false} is VALID [2022-04-28 03:42:01,062 INFO L290 TraceCheckUtils]: 12: Hoare triple {891#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {849#false} is VALID [2022-04-28 03:42:01,063 INFO L290 TraceCheckUtils]: 11: Hoare triple {887#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {891#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:42:01,064 INFO L272 TraceCheckUtils]: 10: Hoare triple {907#(= 100000000 (mod main_~x~0 4294967296))} call __VERIFIER_assert((if 100000000 == ~x~0 % 4294967296 then 1 else 0)); {887#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:42:01,065 INFO L290 TraceCheckUtils]: 9: Hoare triple {911#(or (< (mod main_~x~0 4294967296) 100000000) (= 100000000 (mod main_~x~0 4294967296)))} [55] 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[] {907#(= 100000000 (mod main_~x~0 4294967296))} is VALID [2022-04-28 03:42:03,075 WARN L290 TraceCheckUtils]: 8: Hoare triple {915#(and (<= (div (+ main_~x~0 (- 100000001)) 4294967296) (div (+ main_~x~0 (- 4294967296)) 4294967296)) (or (forall ((aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_42_58 Int) (aux_div_aux_mod_v_main_~x~0_68_31_42 Int) (aux_div_v_main_~x~0_68_31 Int)) (or (<= (+ main_~x~0 4294967296) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_42_58)) (<= (+ (* 2147483648 aux_div_aux_mod_v_main_~x~0_68_31_42) (* aux_div_v_main_~x~0_68_31 2147483648) aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_42_58) main_~x~0) (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) (+ (* 2147483648 aux_div_aux_mod_v_main_~x~0_68_31_42) (* aux_div_v_main_~x~0_68_31 2147483648) aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_42_58)))) (= (+ 100000000 main_~x~0) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_42_58)) (<= (+ main_~x~0 4294967296) (+ (* 4294967296 aux_div_aux_mod_v_main_~x~0_68_31_42) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_42_58))) (< (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_42_58) main_~x~0) (< (+ (* 4294967296 aux_div_aux_mod_v_main_~x~0_68_31_42) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_42_58)) (+ 100000000 main_~x~0)))) (not (< (mod main_~x~0 4294967296) 100000000)) (not (<= 10000000 (mod main_~x~0 4294967296)))))} [58] L9-2-->L8-2_primed: Formula: (let ((.cse4 (mod v_main_~x~0_59 4294967296))) (let ((.cse0 (= v_main_~x~0_59 v_main_~x~0_58)) (.cse1 (< .cse4 100000000)) (.cse2 (<= 10000000 .cse4))) (or .cse0 (and .cse0 (or (not .cse1) (not .cse2))) (and (forall ((v_it_7 Int)) (or (not (<= (+ v_it_7 1) (div (+ v_main_~x~0_59 (* (- 1) v_main_~x~0_58)) (- 2)))) (let ((.cse3 (mod (+ v_main_~x~0_59 (* v_it_7 2)) 4294967296))) (and (< .cse3 100000000) (<= 10000000 .cse3))) (not (<= 1 v_it_7)))) .cse1 (< 0 (div (+ v_main_~x~0_59 (* (- 1) v_main_~x~0_58)) (- 2))) .cse2 (= (mod (+ v_main_~x~0_59 v_main_~x~0_58) 2) 0))))) InVars {main_~x~0=v_main_~x~0_59} OutVars{main_~x~0=v_main_~x~0_58} AuxVars[] AssignedVars[main_~x~0] {911#(or (< (mod main_~x~0 4294967296) 100000000) (= 100000000 (mod main_~x~0 4294967296)))} is UNKNOWN [2022-04-28 03:42:03,079 INFO L290 TraceCheckUtils]: 7: Hoare triple {915#(and (<= (div (+ main_~x~0 (- 100000001)) 4294967296) (div (+ main_~x~0 (- 4294967296)) 4294967296)) (or (forall ((aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_42_58 Int) (aux_div_aux_mod_v_main_~x~0_68_31_42 Int) (aux_div_v_main_~x~0_68_31 Int)) (or (<= (+ main_~x~0 4294967296) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_42_58)) (<= (+ (* 2147483648 aux_div_aux_mod_v_main_~x~0_68_31_42) (* aux_div_v_main_~x~0_68_31 2147483648) aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_42_58) main_~x~0) (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) (+ (* 2147483648 aux_div_aux_mod_v_main_~x~0_68_31_42) (* aux_div_v_main_~x~0_68_31 2147483648) aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_42_58)))) (= (+ 100000000 main_~x~0) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_42_58)) (<= (+ main_~x~0 4294967296) (+ (* 4294967296 aux_div_aux_mod_v_main_~x~0_68_31_42) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_42_58))) (< (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_42_58) main_~x~0) (< (+ (* 4294967296 aux_div_aux_mod_v_main_~x~0_68_31_42) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_42_58)) (+ 100000000 main_~x~0)))) (not (< (mod main_~x~0 4294967296) 100000000)) (not (<= 10000000 (mod main_~x~0 4294967296)))))} [57] L8-2_primed-->L9-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {915#(and (<= (div (+ main_~x~0 (- 100000001)) 4294967296) (div (+ main_~x~0 (- 4294967296)) 4294967296)) (or (forall ((aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_42_58 Int) (aux_div_aux_mod_v_main_~x~0_68_31_42 Int) (aux_div_v_main_~x~0_68_31 Int)) (or (<= (+ main_~x~0 4294967296) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_42_58)) (<= (+ (* 2147483648 aux_div_aux_mod_v_main_~x~0_68_31_42) (* aux_div_v_main_~x~0_68_31 2147483648) aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_42_58) main_~x~0) (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) (+ (* 2147483648 aux_div_aux_mod_v_main_~x~0_68_31_42) (* aux_div_v_main_~x~0_68_31 2147483648) aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_42_58)))) (= (+ 100000000 main_~x~0) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_42_58)) (<= (+ main_~x~0 4294967296) (+ (* 4294967296 aux_div_aux_mod_v_main_~x~0_68_31_42) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_42_58))) (< (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_42_58) main_~x~0) (< (+ (* 4294967296 aux_div_aux_mod_v_main_~x~0_68_31_42) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_42_58)) (+ 100000000 main_~x~0)))) (not (< (mod main_~x~0 4294967296) 100000000)) (not (<= 10000000 (mod main_~x~0 4294967296)))))} is VALID [2022-04-28 03:42:05,097 WARN L290 TraceCheckUtils]: 6: Hoare triple {915#(and (<= (div (+ main_~x~0 (- 100000001)) 4294967296) (div (+ main_~x~0 (- 4294967296)) 4294967296)) (or (forall ((aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_42_58 Int) (aux_div_aux_mod_v_main_~x~0_68_31_42 Int) (aux_div_v_main_~x~0_68_31 Int)) (or (<= (+ main_~x~0 4294967296) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_42_58)) (<= (+ (* 2147483648 aux_div_aux_mod_v_main_~x~0_68_31_42) (* aux_div_v_main_~x~0_68_31 2147483648) aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_42_58) main_~x~0) (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) (+ (* 2147483648 aux_div_aux_mod_v_main_~x~0_68_31_42) (* aux_div_v_main_~x~0_68_31 2147483648) aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_42_58)))) (= (+ 100000000 main_~x~0) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_42_58)) (<= (+ main_~x~0 4294967296) (+ (* 4294967296 aux_div_aux_mod_v_main_~x~0_68_31_42) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_42_58))) (< (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_42_58) main_~x~0) (< (+ (* 4294967296 aux_div_aux_mod_v_main_~x~0_68_31_42) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_42_58)) (+ 100000000 main_~x~0)))) (not (< (mod main_~x~0 4294967296) 100000000)) (not (<= 10000000 (mod main_~x~0 4294967296)))))} [56] L9-2-->L8-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_57 v_main_~x~0_56)) (.cse1 (= |v_main_#t~post4_23| |v_main_#t~post4_22|)) (.cse2 (mod v_main_~x~0_57 4294967296))) (or (and .cse0 .cse1 (<= 10000000 .cse2)) (and .cse0 .cse1) (and (<= (div (+ 10000000 (* (- 1) v_main_~x~0_56)) (- 4294967296)) (+ (div (+ v_main_~x~0_57 (- 4294967295)) 4294967296) 1)) (< v_main_~x~0_57 v_main_~x~0_56) (< .cse2 10000000)))) InVars {main_~x~0=v_main_~x~0_57, main_#t~post4=|v_main_#t~post4_23|} OutVars{main_~x~0=v_main_~x~0_56, main_#t~post4=|v_main_#t~post4_22|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {915#(and (<= (div (+ main_~x~0 (- 100000001)) 4294967296) (div (+ main_~x~0 (- 4294967296)) 4294967296)) (or (forall ((aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_42_58 Int) (aux_div_aux_mod_v_main_~x~0_68_31_42 Int) (aux_div_v_main_~x~0_68_31 Int)) (or (<= (+ main_~x~0 4294967296) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_42_58)) (<= (+ (* 2147483648 aux_div_aux_mod_v_main_~x~0_68_31_42) (* aux_div_v_main_~x~0_68_31 2147483648) aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_42_58) main_~x~0) (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) (+ (* 2147483648 aux_div_aux_mod_v_main_~x~0_68_31_42) (* aux_div_v_main_~x~0_68_31 2147483648) aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_42_58)))) (= (+ 100000000 main_~x~0) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_42_58)) (<= (+ main_~x~0 4294967296) (+ (* 4294967296 aux_div_aux_mod_v_main_~x~0_68_31_42) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_42_58))) (< (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_42_58) main_~x~0) (< (+ (* 4294967296 aux_div_aux_mod_v_main_~x~0_68_31_42) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_42_58)) (+ 100000000 main_~x~0)))) (not (< (mod main_~x~0 4294967296) 100000000)) (not (<= 10000000 (mod main_~x~0 4294967296)))))} is UNKNOWN [2022-04-28 03:42:05,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {848#true} ~x~0 := 0; {915#(and (<= (div (+ main_~x~0 (- 100000001)) 4294967296) (div (+ main_~x~0 (- 4294967296)) 4294967296)) (or (forall ((aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_42_58 Int) (aux_div_aux_mod_v_main_~x~0_68_31_42 Int) (aux_div_v_main_~x~0_68_31 Int)) (or (<= (+ main_~x~0 4294967296) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_42_58)) (<= (+ (* 2147483648 aux_div_aux_mod_v_main_~x~0_68_31_42) (* aux_div_v_main_~x~0_68_31 2147483648) aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_42_58) main_~x~0) (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) (+ (* 2147483648 aux_div_aux_mod_v_main_~x~0_68_31_42) (* aux_div_v_main_~x~0_68_31 2147483648) aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_42_58)))) (= (+ 100000000 main_~x~0) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_42_58)) (<= (+ main_~x~0 4294967296) (+ (* 4294967296 aux_div_aux_mod_v_main_~x~0_68_31_42) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_42_58))) (< (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_42_58) main_~x~0) (< (+ (* 4294967296 aux_div_aux_mod_v_main_~x~0_68_31_42) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_42_58)) (+ 100000000 main_~x~0)))) (not (< (mod main_~x~0 4294967296) 100000000)) (not (<= 10000000 (mod main_~x~0 4294967296)))))} is VALID [2022-04-28 03:42:05,102 INFO L272 TraceCheckUtils]: 4: Hoare triple {848#true} call #t~ret5 := main(); {848#true} is VALID [2022-04-28 03:42:05,102 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {848#true} {848#true} #40#return; {848#true} is VALID [2022-04-28 03:42:05,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {848#true} assume true; {848#true} is VALID [2022-04-28 03:42:05,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {848#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(12, 2);call #Ultimate.allocInit(12, 3); {848#true} is VALID [2022-04-28 03:42:05,102 INFO L272 TraceCheckUtils]: 0: Hoare triple {848#true} call ULTIMATE.init(); {848#true} is VALID [2022-04-28 03:42:05,103 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:42:05,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201558729] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:42:05,103 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 03:42:05,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2022-04-28 03:42:11,885 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:42:11,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [713023244] [2022-04-28 03:42:11,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [713023244] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:42:11,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:42:11,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 03:42:11,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038785159] [2022-04-28 03:42:11,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:42:11,886 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 03:42:11,886 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:42:11,886 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), 9 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:11,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:11,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 03:42:11,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:11,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 03:42:11,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=153, Unknown=4, NotChecked=0, Total=210 [2022-04-28 03:42:11,973 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:12,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:12,335 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-04-28 03:42:12,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 03:42:12,335 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 03:42:12,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:42:12,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:12,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2022-04-28 03:42:12,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:12,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2022-04-28 03:42:12,337 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 35 transitions. [2022-04-28 03:42:12,372 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:12,372 INFO L225 Difference]: With dead ends: 30 [2022-04-28 03:42:12,373 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 03:42:12,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 17 SyntacticMatches, 7 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 22.0s TimeCoverageRelationStatistics Valid=53, Invalid=153, Unknown=4, NotChecked=0, Total=210 [2022-04-28 03:42:12,373 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 15 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:42:12,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 69 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 15 Unchecked, 0.1s Time] [2022-04-28 03:42:12,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 03:42:12,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-28 03:42:12,391 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:42:12,391 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:12,391 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:12,391 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:12,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:12,392 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-28 03:42:12,392 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-28 03:42:12,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:12,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:12,392 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-28 03:42:12,392 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-28 03:42:12,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:12,393 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-28 03:42:12,393 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-28 03:42:12,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:12,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:12,393 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:42:12,394 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:42:12,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:12,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-04-28 03:42:12,394 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 19 [2022-04-28 03:42:12,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:42:12,394 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-04-28 03:42:12,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:12,401 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 25 transitions. [2022-04-28 03:42:12,431 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:12,431 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-28 03:42:12,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 03:42:12,431 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:42:12,431 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:42:12,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-28 03:42:12,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:42:12,632 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:42:12,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:42:12,632 INFO L85 PathProgramCache]: Analyzing trace with hash -148486101, now seen corresponding path program 4 times [2022-04-28 03:42:12,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:12,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1020092387] [2022-04-28 03:42:14,339 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:42:14,593 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:42:14,595 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:42:14,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1998540624, now seen corresponding path program 1 times [2022-04-28 03:42:14,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:42:14,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575015026] [2022-04-28 03:42:14,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:14,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:42:14,636 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) main_~x~0_6) (* (- 2) .v_it_9.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_9.0)) 4294967296)) 10000000) 0) [2022-04-28 03:42:14,636 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_6) (* (- 2) .v_it_9.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_9.0)) 4294967296)) 100000000) 0)) [2022-04-28 03:42:14,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:14,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:42:14,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575015026] [2022-04-28 03:42:14,653 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Interpolation not supported for quantified formulae. [2022-04-28 03:42:14,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969502509] [2022-04-28 03:42:14,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:14,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:42:14,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:42:14,654 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:42:14,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 03:42:14,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:14,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 03:42:14,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:14,893 INFO L286 TraceCheckSpWp]: Computing forward predicates...