/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_13.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 06:48:01,560 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 06:48:01,562 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 06:48:01,604 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 06:48:01,605 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 06:48:01,606 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 06:48:01,609 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 06:48:01,611 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 06:48:01,613 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 06:48:01,617 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 06:48:01,618 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 06:48:01,619 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 06:48:01,620 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 06:48:01,622 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 06:48:01,623 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 06:48:01,625 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 06:48:01,626 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 06:48:01,626 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 06:48:01,628 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 06:48:01,633 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 06:48:01,635 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 06:48:01,636 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 06:48:01,637 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 06:48:01,638 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 06:48:01,639 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 06:48:01,645 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 06:48:01,645 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 06:48:01,646 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 06:48:01,646 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 06:48:01,647 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 06:48:01,648 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 06:48:01,648 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 06:48:01,650 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 06:48:01,651 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 06:48:01,651 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 06:48:01,652 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 06:48:01,652 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 06:48:01,653 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 06:48:01,653 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 06:48:01,653 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 06:48:01,654 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 06:48:01,655 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 06:48:01,656 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 06:48:01,664 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 06:48:01,665 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 06:48:01,666 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 06:48:01,666 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 06:48:01,666 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 06:48:01,666 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 06:48:01,666 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 06:48:01,666 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 06:48:01,667 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 06:48:01,667 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 06:48:01,667 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 06:48:01,668 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 06:48:01,668 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 06:48:01,668 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 06:48:01,668 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 06:48:01,668 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 06:48:01,668 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 06:48:01,668 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 06:48:01,669 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:48:01,669 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 06:48:01,669 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 06:48:01,669 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 06:48:01,669 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 06:48:01,669 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 06:48:01,669 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 06:48:01,669 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 06:48:01,896 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 06:48:01,911 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 06:48:01,913 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 06:48:01,914 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 06:48:01,915 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 06:48:01,916 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_13.c [2022-04-15 06:48:01,979 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9153b95f/c4a7fd5dec01427eb1fe2f7174986f55/FLAG686e56e80 [2022-04-15 06:48:02,318 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 06:48:02,319 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_13.c [2022-04-15 06:48:02,324 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9153b95f/c4a7fd5dec01427eb1fe2f7174986f55/FLAG686e56e80 [2022-04-15 06:48:02,338 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9153b95f/c4a7fd5dec01427eb1fe2f7174986f55 [2022-04-15 06:48:02,341 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 06:48:02,342 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 06:48:02,345 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 06:48:02,345 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 06:48:02,348 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 06:48:02,349 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:48:02" (1/1) ... [2022-04-15 06:48:02,350 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76feacf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:48:02, skipping insertion in model container [2022-04-15 06:48:02,350 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:48:02" (1/1) ... [2022-04-15 06:48:02,356 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 06:48:02,367 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 06:48:02,517 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_13.c[319,332] [2022-04-15 06:48:02,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:48:02,534 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 06:48:02,544 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_13.c[319,332] [2022-04-15 06:48:02,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:48:02,558 INFO L208 MainTranslator]: Completed translation [2022-04-15 06:48:02,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:48:02 WrapperNode [2022-04-15 06:48:02,559 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 06:48:02,560 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 06:48:02,560 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 06:48:02,560 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 06:48:02,568 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:48:02" (1/1) ... [2022-04-15 06:48:02,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:48:02" (1/1) ... [2022-04-15 06:48:02,573 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:48:02" (1/1) ... [2022-04-15 06:48:02,573 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:48:02" (1/1) ... [2022-04-15 06:48:02,578 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:48:02" (1/1) ... [2022-04-15 06:48:02,581 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:48:02" (1/1) ... [2022-04-15 06:48:02,582 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:48:02" (1/1) ... [2022-04-15 06:48:02,583 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 06:48:02,584 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 06:48:02,584 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 06:48:02,584 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 06:48:02,585 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:48:02" (1/1) ... [2022-04-15 06:48:02,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:48:02,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:48:02,611 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 06:48:02,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 06:48:02,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 06:48:02,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 06:48:02,650 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 06:48:02,650 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 06:48:02,650 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 06:48:02,650 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 06:48:02,651 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 06:48:02,651 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 06:48:02,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 06:48:02,652 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 06:48:02,652 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 06:48:02,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 06:48:02,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 06:48:02,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 06:48:02,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 06:48:02,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 06:48:02,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 06:48:02,708 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 06:48:02,709 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 06:48:02,831 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 06:48:02,837 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 06:48:02,837 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 06:48:02,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:48:02 BoogieIcfgContainer [2022-04-15 06:48:02,839 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 06:48:02,841 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 06:48:02,841 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 06:48:02,846 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 06:48:02,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 06:48:02" (1/3) ... [2022-04-15 06:48:02,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@181c39b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:48:02, skipping insertion in model container [2022-04-15 06:48:02,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:48:02" (2/3) ... [2022-04-15 06:48:02,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@181c39b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:48:02, skipping insertion in model container [2022-04-15 06:48:02,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:48:02" (3/3) ... [2022-04-15 06:48:02,864 INFO L111 eAbstractionObserver]: Analyzing ICFG mono-crafted_13.c [2022-04-15 06:48:02,868 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 06:48:02,868 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 06:48:02,933 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 06:48:02,938 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 06:48:02,939 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 06:48:02,961 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:48:02,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 06:48:02,967 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:48:02,968 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:48:02,969 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:48:02,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:48:02,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1168619535, now seen corresponding path program 1 times [2022-04-15 06:48:02,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:48:02,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1552269488] [2022-04-15 06:48:02,994 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:48:02,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1168619535, now seen corresponding path program 2 times [2022-04-15 06:48:02,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:48:02,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445522131] [2022-04-15 06:48:02,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:48:02,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:48:03,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:03,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:48:03,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:03,191 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {24#true} is VALID [2022-04-15 06:48:03,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-15 06:48:03,191 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #52#return; {24#true} is VALID [2022-04-15 06:48:03,193 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:48:03,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {24#true} is VALID [2022-04-15 06:48:03,194 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-15 06:48:03,195 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #52#return; {24#true} is VALID [2022-04-15 06:48:03,195 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret7 := main(); {24#true} is VALID [2022-04-15 06:48:03,195 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {24#true} is VALID [2022-04-15 06:48:03,196 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} assume !true; {25#false} is VALID [2022-04-15 06:48:03,196 INFO L290 TraceCheckUtils]: 7: Hoare triple {25#false} assume !true; {25#false} is VALID [2022-04-15 06:48:03,197 INFO L272 TraceCheckUtils]: 8: Hoare triple {25#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {25#false} is VALID [2022-04-15 06:48:03,197 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2022-04-15 06:48:03,197 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2022-04-15 06:48:03,198 INFO L290 TraceCheckUtils]: 11: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-15 06:48:03,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:48:03,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:48:03,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445522131] [2022-04-15 06:48:03,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445522131] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:48:03,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:48:03,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 06:48:03,202 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:48:03,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1552269488] [2022-04-15 06:48:03,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1552269488] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:48:03,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:48:03,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 06:48:03,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106577096] [2022-04-15 06:48:03,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:48:03,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 12 [2022-04-15 06:48:03,209 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:48:03,211 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:03,245 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:48:03,245 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 06:48:03,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:48:03,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 06:48:03,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 06:48:03,276 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 14 states have internal predecessors, (20), 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.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:03,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:03,361 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2022-04-15 06:48:03,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 06:48:03,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 12 [2022-04-15 06:48:03,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:48:03,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:03,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-04-15 06:48:03,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:03,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-04-15 06:48:03,380 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 42 transitions. [2022-04-15 06:48:03,441 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:48:03,447 INFO L225 Difference]: With dead ends: 34 [2022-04-15 06:48:03,447 INFO L226 Difference]: Without dead ends: 14 [2022-04-15 06:48:03,450 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 06:48:03,454 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 14 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:48:03,456 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 25 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:48:03,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-15 06:48:03,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-15 06:48:03,490 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:48:03,491 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:03,492 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:03,492 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:03,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:03,498 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2022-04-15 06:48:03,498 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-04-15 06:48:03,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:48:03,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:48:03,499 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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 14 states. [2022-04-15 06:48:03,500 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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 14 states. [2022-04-15 06:48:03,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:03,503 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2022-04-15 06:48:03,504 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-04-15 06:48:03,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:48:03,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:48:03,504 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:48:03,504 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:48:03,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:03,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2022-04-15 06:48:03,508 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 12 [2022-04-15 06:48:03,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:48:03,509 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-04-15 06:48:03,509 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:03,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 16 transitions. [2022-04-15 06:48:03,535 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:48:03,536 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-04-15 06:48:03,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 06:48:03,540 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:48:03,543 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:48:03,543 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 06:48:03,543 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:48:03,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:48:03,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1458605129, now seen corresponding path program 1 times [2022-04-15 06:48:03,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:48:03,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2112788919] [2022-04-15 06:48:03,547 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:48:03,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1458605129, now seen corresponding path program 2 times [2022-04-15 06:48:03,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:48:03,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079218055] [2022-04-15 06:48:03,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:48:03,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:48:03,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:03,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:48:03,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:03,647 INFO L290 TraceCheckUtils]: 0: Hoare triple {162#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {156#true} is VALID [2022-04-15 06:48:03,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {156#true} assume true; {156#true} is VALID [2022-04-15 06:48:03,648 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {156#true} {156#true} #52#return; {156#true} is VALID [2022-04-15 06:48:03,649 INFO L272 TraceCheckUtils]: 0: Hoare triple {156#true} call ULTIMATE.init(); {162#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:48:03,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {162#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {156#true} is VALID [2022-04-15 06:48:03,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {156#true} assume true; {156#true} is VALID [2022-04-15 06:48:03,650 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {156#true} {156#true} #52#return; {156#true} is VALID [2022-04-15 06:48:03,650 INFO L272 TraceCheckUtils]: 4: Hoare triple {156#true} call #t~ret7 := main(); {156#true} is VALID [2022-04-15 06:48:03,651 INFO L290 TraceCheckUtils]: 5: Hoare triple {156#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {161#(= main_~x~0 0)} is VALID [2022-04-15 06:48:03,651 INFO L290 TraceCheckUtils]: 6: Hoare triple {161#(= main_~x~0 0)} assume !(~x~0 < 1000000); {157#false} is VALID [2022-04-15 06:48:03,652 INFO L290 TraceCheckUtils]: 7: Hoare triple {157#false} assume !(~y~0 > ~z~0); {157#false} is VALID [2022-04-15 06:48:03,652 INFO L272 TraceCheckUtils]: 8: Hoare triple {157#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {157#false} is VALID [2022-04-15 06:48:03,652 INFO L290 TraceCheckUtils]: 9: Hoare triple {157#false} ~cond := #in~cond; {157#false} is VALID [2022-04-15 06:48:03,652 INFO L290 TraceCheckUtils]: 10: Hoare triple {157#false} assume 0 == ~cond; {157#false} is VALID [2022-04-15 06:48:03,652 INFO L290 TraceCheckUtils]: 11: Hoare triple {157#false} assume !false; {157#false} is VALID [2022-04-15 06:48:03,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:48:03,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:48:03,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079218055] [2022-04-15 06:48:03,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079218055] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:48:03,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:48:03,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:48:03,660 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:48:03,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2112788919] [2022-04-15 06:48:03,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2112788919] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:48:03,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:48:03,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:48:03,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446821235] [2022-04-15 06:48:03,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:48:03,662 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 12 [2022-04-15 06:48:03,662 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:48:03,662 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:03,677 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:48:03,678 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 06:48:03,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:48:03,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 06:48:03,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 06:48:03,680 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:03,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:03,750 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2022-04-15 06:48:03,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 06:48:03,750 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 12 [2022-04-15 06:48:03,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:48:03,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:03,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-04-15 06:48:03,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:03,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-04-15 06:48:03,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 30 transitions. [2022-04-15 06:48:03,788 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:48:03,790 INFO L225 Difference]: With dead ends: 24 [2022-04-15 06:48:03,790 INFO L226 Difference]: Without dead ends: 16 [2022-04-15 06:48:03,790 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 06:48:03,793 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:48:03,794 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 21 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:48:03,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-15 06:48:03,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-15 06:48:03,810 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:48:03,810 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:03,810 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:03,811 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:03,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:03,813 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-15 06:48:03,813 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-15 06:48:03,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:48:03,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:48:03,815 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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 16 states. [2022-04-15 06:48:03,815 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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 16 states. [2022-04-15 06:48:03,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:03,817 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-15 06:48:03,817 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-15 06:48:03,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:48:03,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:48:03,817 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:48:03,818 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:48:03,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:03,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-04-15 06:48:03,819 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 12 [2022-04-15 06:48:03,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:48:03,820 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-04-15 06:48:03,820 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:03,820 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 18 transitions. [2022-04-15 06:48:03,837 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:48:03,837 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-15 06:48:03,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 06:48:03,837 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:48:03,838 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:48:03,838 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 06:48:03,838 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:48:03,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:48:03,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1316432198, now seen corresponding path program 1 times [2022-04-15 06:48:03,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:48:03,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1723020900] [2022-04-15 06:48:04,116 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:48:04,118 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:48:04,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1148992352, now seen corresponding path program 1 times [2022-04-15 06:48:04,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:48:04,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514334477] [2022-04-15 06:48:04,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:48:04,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:48:04,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:04,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:48:04,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:04,212 INFO L290 TraceCheckUtils]: 0: Hoare triple {285#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {279#true} is VALID [2022-04-15 06:48:04,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {279#true} assume true; {279#true} is VALID [2022-04-15 06:48:04,213 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {279#true} {279#true} #52#return; {279#true} is VALID [2022-04-15 06:48:04,213 INFO L272 TraceCheckUtils]: 0: Hoare triple {279#true} call ULTIMATE.init(); {285#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:48:04,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {285#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {279#true} is VALID [2022-04-15 06:48:04,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {279#true} assume true; {279#true} is VALID [2022-04-15 06:48:04,214 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {279#true} {279#true} #52#return; {279#true} is VALID [2022-04-15 06:48:04,216 INFO L272 TraceCheckUtils]: 4: Hoare triple {279#true} call #t~ret7 := main(); {279#true} is VALID [2022-04-15 06:48:04,219 INFO L290 TraceCheckUtils]: 5: Hoare triple {279#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {284#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:48:04,220 INFO L290 TraceCheckUtils]: 6: Hoare triple {284#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [58] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_14 v_main_~x~0_13)) (.cse1 (= |v_main_#t~post4_4| |v_main_#t~post4_3|))) (or (and (< v_main_~x~0_14 v_main_~x~0_13) (< v_main_~x~0_13 50001)) (and .cse0 .cse1) (and (not (< v_main_~x~0_14 50000)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_14, main_#t~post4=|v_main_#t~post4_4|} OutVars{main_~x~0=v_main_~x~0_13, main_#t~post4=|v_main_#t~post4_3|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {284#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:48:04,221 INFO L290 TraceCheckUtils]: 7: Hoare triple {284#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [57] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {284#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:48:04,224 INFO L290 TraceCheckUtils]: 8: Hoare triple {284#(and (= main_~z~0 0) (<= 50000 main_~y~0))} assume !(~y~0 > ~z~0); {280#false} is VALID [2022-04-15 06:48:04,224 INFO L272 TraceCheckUtils]: 9: Hoare triple {280#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {280#false} is VALID [2022-04-15 06:48:04,225 INFO L290 TraceCheckUtils]: 10: Hoare triple {280#false} ~cond := #in~cond; {280#false} is VALID [2022-04-15 06:48:04,225 INFO L290 TraceCheckUtils]: 11: Hoare triple {280#false} assume 0 == ~cond; {280#false} is VALID [2022-04-15 06:48:04,226 INFO L290 TraceCheckUtils]: 12: Hoare triple {280#false} assume !false; {280#false} is VALID [2022-04-15 06:48:04,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:48:04,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:48:04,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514334477] [2022-04-15 06:48:04,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514334477] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:48:04,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:48:04,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:48:04,292 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:48:04,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1723020900] [2022-04-15 06:48:04,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1723020900] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:48:04,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:48:04,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:48:04,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617514079] [2022-04-15 06:48:04,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:48:04,294 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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 14 [2022-04-15 06:48:04,294 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:48:04,294 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:04,306 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:48:04,306 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 06:48:04,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:48:04,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 06:48:04,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-15 06:48:04,307 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:04,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:04,433 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-04-15 06:48:04,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 06:48:04,433 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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 14 [2022-04-15 06:48:04,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:48:04,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:04,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2022-04-15 06:48:04,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:04,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2022-04-15 06:48:04,437 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 30 transitions. [2022-04-15 06:48:04,466 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:48:04,467 INFO L225 Difference]: With dead ends: 26 [2022-04-15 06:48:04,467 INFO L226 Difference]: Without dead ends: 20 [2022-04-15 06:48:04,467 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-04-15 06:48:04,468 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 15 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:48:04,468 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 24 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:48:04,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-15 06:48:04,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-15 06:48:04,484 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:48:04,485 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 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-15 06:48:04,485 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 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-15 06:48:04,485 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 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-15 06:48:04,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:04,487 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-15 06:48:04,487 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-15 06:48:04,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:48:04,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:48:04,487 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 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 20 states. [2022-04-15 06:48:04,488 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 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 20 states. [2022-04-15 06:48:04,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:04,489 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-15 06:48:04,489 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-15 06:48:04,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:48:04,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:48:04,490 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:48:04,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:48:04,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 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-15 06:48:04,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-04-15 06:48:04,491 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 14 [2022-04-15 06:48:04,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:48:04,491 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-04-15 06:48:04,491 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:04,492 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 23 transitions. [2022-04-15 06:48:04,513 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:48:04,513 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-15 06:48:04,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 06:48:04,514 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:48:04,514 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:48:04,514 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 06:48:04,515 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:48:04,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:48:04,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1342594849, now seen corresponding path program 1 times [2022-04-15 06:48:04,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:48:04,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1079388853] [2022-04-15 06:48:06,638 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:48:06,747 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:48:07,161 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:48:07,163 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:48:07,166 INFO L85 PathProgramCache]: Analyzing trace with hash -538275198, now seen corresponding path program 1 times [2022-04-15 06:48:07,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:48:07,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585353875] [2022-04-15 06:48:07,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:48:07,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:48:07,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:07,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:48:07,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:07,310 INFO L290 TraceCheckUtils]: 0: Hoare triple {438#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {428#true} is VALID [2022-04-15 06:48:07,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {428#true} assume true; {428#true} is VALID [2022-04-15 06:48:07,310 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {428#true} {428#true} #52#return; {428#true} is VALID [2022-04-15 06:48:07,311 INFO L272 TraceCheckUtils]: 0: Hoare triple {428#true} call ULTIMATE.init(); {438#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:48:07,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {438#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {428#true} is VALID [2022-04-15 06:48:07,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {428#true} assume true; {428#true} is VALID [2022-04-15 06:48:07,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {428#true} {428#true} #52#return; {428#true} is VALID [2022-04-15 06:48:07,312 INFO L272 TraceCheckUtils]: 4: Hoare triple {428#true} call #t~ret7 := main(); {428#true} is VALID [2022-04-15 06:48:07,312 INFO L290 TraceCheckUtils]: 5: Hoare triple {428#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {433#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:48:07,313 INFO L290 TraceCheckUtils]: 6: Hoare triple {433#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} [60] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_9| |v_main_#t~post4_8|)) (.cse1 (= v_main_~x~0_21 v_main_~x~0_20))) (or (and (not (< v_main_~x~0_21 50000)) .cse0 .cse1) (and (< v_main_~x~0_20 50001) (< v_main_~x~0_21 v_main_~x~0_20)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_21, main_#t~post4=|v_main_#t~post4_9|} OutVars{main_~x~0=v_main_~x~0_20, main_#t~post4=|v_main_#t~post4_8|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {434#(and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:48:07,314 INFO L290 TraceCheckUtils]: 7: Hoare triple {434#(and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} [61] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {434#(and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:48:07,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {434#(and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} [62] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_8 v_main_~y~0_7)) (.cse1 (= v_main_~x~0_23 v_main_~x~0_22)) (.cse3 (<= 50000 v_main_~x~0_23))) (or (and .cse0 .cse1) (let ((.cse2 (div (+ v_main_~x~0_23 (* (- 1) v_main_~x~0_22)) (- 2)))) (and (< 0 .cse2) .cse3 (= (mod (+ v_main_~x~0_23 v_main_~x~0_22) 2) 0) (< .cse2 (+ (div (+ 999999 (* (- 1) v_main_~x~0_23)) 2) 2)) (= v_main_~y~0_7 (+ v_main_~y~0_8 (* .cse2 2))))) (and .cse0 .cse1 (or (not .cse3) (not (< v_main_~x~0_23 1000000)))))) InVars {main_~x~0=v_main_~x~0_23, main_~y~0=v_main_~y~0_8} OutVars{main_~x~0=v_main_~x~0_22, main_~y~0=v_main_~y~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {435#(and (= main_~z~0 0) (or (<= main_~x~0 main_~y~0) (<= 2 main_~y~0)))} is VALID [2022-04-15 06:48:07,316 INFO L290 TraceCheckUtils]: 9: Hoare triple {435#(and (= main_~z~0 0) (or (<= main_~x~0 main_~y~0) (<= 2 main_~y~0)))} [59] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {436#(and (= main_~z~0 0) (<= 2 main_~y~0))} is VALID [2022-04-15 06:48:07,316 INFO L290 TraceCheckUtils]: 10: Hoare triple {436#(and (= main_~z~0 0) (<= 2 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {437#(and (= main_~z~0 0) (<= 1 main_~y~0))} is VALID [2022-04-15 06:48:07,317 INFO L290 TraceCheckUtils]: 11: Hoare triple {437#(and (= main_~z~0 0) (<= 1 main_~y~0))} assume !(~y~0 > ~z~0); {429#false} is VALID [2022-04-15 06:48:07,317 INFO L272 TraceCheckUtils]: 12: Hoare triple {429#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {429#false} is VALID [2022-04-15 06:48:07,317 INFO L290 TraceCheckUtils]: 13: Hoare triple {429#false} ~cond := #in~cond; {429#false} is VALID [2022-04-15 06:48:07,317 INFO L290 TraceCheckUtils]: 14: Hoare triple {429#false} assume 0 == ~cond; {429#false} is VALID [2022-04-15 06:48:07,318 INFO L290 TraceCheckUtils]: 15: Hoare triple {429#false} assume !false; {429#false} is VALID [2022-04-15 06:48:07,318 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:48:07,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:48:07,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585353875] [2022-04-15 06:48:07,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585353875] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:48:07,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144962673] [2022-04-15 06:48:07,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:48:07,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:48:07,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:48:07,324 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:48:07,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 06:48:07,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:07,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 06:48:07,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:07,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:48:44,786 INFO L272 TraceCheckUtils]: 0: Hoare triple {428#true} call ULTIMATE.init(); {428#true} is VALID [2022-04-15 06:48:44,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {428#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {428#true} is VALID [2022-04-15 06:48:44,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {428#true} assume true; {428#true} is VALID [2022-04-15 06:48:44,787 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {428#true} {428#true} #52#return; {428#true} is VALID [2022-04-15 06:48:44,788 INFO L272 TraceCheckUtils]: 4: Hoare triple {428#true} call #t~ret7 := main(); {428#true} is VALID [2022-04-15 06:48:44,788 INFO L290 TraceCheckUtils]: 5: Hoare triple {428#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {457#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:48:44,789 INFO L290 TraceCheckUtils]: 6: Hoare triple {457#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [60] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_9| |v_main_#t~post4_8|)) (.cse1 (= v_main_~x~0_21 v_main_~x~0_20))) (or (and (not (< v_main_~x~0_21 50000)) .cse0 .cse1) (and (< v_main_~x~0_20 50001) (< v_main_~x~0_21 v_main_~x~0_20)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_21, main_#t~post4=|v_main_#t~post4_9|} OutVars{main_~x~0=v_main_~x~0_20, main_#t~post4=|v_main_#t~post4_8|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {457#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:48:44,790 INFO L290 TraceCheckUtils]: 7: Hoare triple {457#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [61] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {457#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:48:44,792 INFO L290 TraceCheckUtils]: 8: Hoare triple {457#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [62] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_8 v_main_~y~0_7)) (.cse1 (= v_main_~x~0_23 v_main_~x~0_22)) (.cse3 (<= 50000 v_main_~x~0_23))) (or (and .cse0 .cse1) (let ((.cse2 (div (+ v_main_~x~0_23 (* (- 1) v_main_~x~0_22)) (- 2)))) (and (< 0 .cse2) .cse3 (= (mod (+ v_main_~x~0_23 v_main_~x~0_22) 2) 0) (< .cse2 (+ (div (+ 999999 (* (- 1) v_main_~x~0_23)) 2) 2)) (= v_main_~y~0_7 (+ v_main_~y~0_8 (* .cse2 2))))) (and .cse0 .cse1 (or (not .cse3) (not (< v_main_~x~0_23 1000000)))))) InVars {main_~x~0=v_main_~x~0_23, main_~y~0=v_main_~y~0_8} OutVars{main_~x~0=v_main_~x~0_22, main_~y~0=v_main_~y~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {457#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:48:44,792 INFO L290 TraceCheckUtils]: 9: Hoare triple {457#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [59] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {457#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:48:44,793 INFO L290 TraceCheckUtils]: 10: Hoare triple {457#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {473#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-15 06:48:44,794 INFO L290 TraceCheckUtils]: 11: Hoare triple {473#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !(~y~0 > ~z~0); {429#false} is VALID [2022-04-15 06:48:44,794 INFO L272 TraceCheckUtils]: 12: Hoare triple {429#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {429#false} is VALID [2022-04-15 06:48:44,794 INFO L290 TraceCheckUtils]: 13: Hoare triple {429#false} ~cond := #in~cond; {429#false} is VALID [2022-04-15 06:48:44,794 INFO L290 TraceCheckUtils]: 14: Hoare triple {429#false} assume 0 == ~cond; {429#false} is VALID [2022-04-15 06:48:44,794 INFO L290 TraceCheckUtils]: 15: Hoare triple {429#false} assume !false; {429#false} is VALID [2022-04-15 06:48:44,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:48:44,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:49:37,580 INFO L290 TraceCheckUtils]: 15: Hoare triple {429#false} assume !false; {429#false} is VALID [2022-04-15 06:49:37,581 INFO L290 TraceCheckUtils]: 14: Hoare triple {429#false} assume 0 == ~cond; {429#false} is VALID [2022-04-15 06:49:37,581 INFO L290 TraceCheckUtils]: 13: Hoare triple {429#false} ~cond := #in~cond; {429#false} is VALID [2022-04-15 06:49:37,581 INFO L272 TraceCheckUtils]: 12: Hoare triple {429#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {429#false} is VALID [2022-04-15 06:49:37,583 INFO L290 TraceCheckUtils]: 11: Hoare triple {501#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {429#false} is VALID [2022-04-15 06:49:37,583 INFO L290 TraceCheckUtils]: 10: Hoare triple {505#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {501#(< main_~z~0 main_~y~0)} is VALID [2022-04-15 06:49:37,584 INFO L290 TraceCheckUtils]: 9: Hoare triple {505#(< (+ main_~z~0 1) main_~y~0)} [59] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {505#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-15 06:49:37,585 INFO L290 TraceCheckUtils]: 8: Hoare triple {505#(< (+ main_~z~0 1) main_~y~0)} [62] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_8 v_main_~y~0_7)) (.cse1 (= v_main_~x~0_23 v_main_~x~0_22)) (.cse3 (<= 50000 v_main_~x~0_23))) (or (and .cse0 .cse1) (let ((.cse2 (div (+ v_main_~x~0_23 (* (- 1) v_main_~x~0_22)) (- 2)))) (and (< 0 .cse2) .cse3 (= (mod (+ v_main_~x~0_23 v_main_~x~0_22) 2) 0) (< .cse2 (+ (div (+ 999999 (* (- 1) v_main_~x~0_23)) 2) 2)) (= v_main_~y~0_7 (+ v_main_~y~0_8 (* .cse2 2))))) (and .cse0 .cse1 (or (not .cse3) (not (< v_main_~x~0_23 1000000)))))) InVars {main_~x~0=v_main_~x~0_23, main_~y~0=v_main_~y~0_8} OutVars{main_~x~0=v_main_~x~0_22, main_~y~0=v_main_~y~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {505#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-15 06:49:37,586 INFO L290 TraceCheckUtils]: 7: Hoare triple {505#(< (+ main_~z~0 1) main_~y~0)} [61] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {505#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-15 06:49:37,586 INFO L290 TraceCheckUtils]: 6: Hoare triple {505#(< (+ main_~z~0 1) main_~y~0)} [60] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_9| |v_main_#t~post4_8|)) (.cse1 (= v_main_~x~0_21 v_main_~x~0_20))) (or (and (not (< v_main_~x~0_21 50000)) .cse0 .cse1) (and (< v_main_~x~0_20 50001) (< v_main_~x~0_21 v_main_~x~0_20)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_21, main_#t~post4=|v_main_#t~post4_9|} OutVars{main_~x~0=v_main_~x~0_20, main_#t~post4=|v_main_#t~post4_8|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {505#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-15 06:49:37,586 INFO L290 TraceCheckUtils]: 5: Hoare triple {428#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {505#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-15 06:49:37,587 INFO L272 TraceCheckUtils]: 4: Hoare triple {428#true} call #t~ret7 := main(); {428#true} is VALID [2022-04-15 06:49:37,587 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {428#true} {428#true} #52#return; {428#true} is VALID [2022-04-15 06:49:37,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {428#true} assume true; {428#true} is VALID [2022-04-15 06:49:37,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {428#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {428#true} is VALID [2022-04-15 06:49:37,587 INFO L272 TraceCheckUtils]: 0: Hoare triple {428#true} call ULTIMATE.init(); {428#true} is VALID [2022-04-15 06:49:37,588 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:49:37,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144962673] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:49:37,588 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:49:37,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 12 [2022-04-15 06:49:37,774 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:49:37,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1079388853] [2022-04-15 06:49:37,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1079388853] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:49:37,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:49:37,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 06:49:37,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990236031] [2022-04-15 06:49:37,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:49:37,775 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 06:49:37,775 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:49:37,775 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:37,794 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:49:37,794 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 06:49:37,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:49:37,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 06:49:37,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2022-04-15 06:49:37,795 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:38,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:49:38,104 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2022-04-15 06:49:38,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 06:49:38,104 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 06:49:38,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:49:38,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:38,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 41 transitions. [2022-04-15 06:49:38,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:38,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 41 transitions. [2022-04-15 06:49:38,108 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 41 transitions. [2022-04-15 06:49:38,147 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:49:38,148 INFO L225 Difference]: With dead ends: 39 [2022-04-15 06:49:38,148 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 06:49:38,149 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=301, Unknown=0, NotChecked=0, Total=462 [2022-04-15 06:49:38,149 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 25 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:49:38,150 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 24 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:49:38,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 06:49:38,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-15 06:49:38,178 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:49:38,178 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:38,178 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:38,179 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:38,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:49:38,180 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-15 06:49:38,180 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-15 06:49:38,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:49:38,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:49:38,181 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-15 06:49:38,181 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-15 06:49:38,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:49:38,182 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-15 06:49:38,183 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-15 06:49:38,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:49:38,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:49:38,183 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:49:38,183 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:49:38,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:38,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-15 06:49:38,184 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 19 [2022-04-15 06:49:38,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:49:38,185 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-15 06:49:38,185 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:38,185 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 31 transitions. [2022-04-15 06:49:38,216 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-15 06:49:38,216 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-15 06:49:38,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 06:49:38,217 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:49:38,217 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:49:38,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-15 06:49:38,435 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:49:38,436 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:49:38,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:49:38,436 INFO L85 PathProgramCache]: Analyzing trace with hash -510493847, now seen corresponding path program 2 times [2022-04-15 06:49:38,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:49:38,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [623949546] [2022-04-15 06:49:41,213 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:49:41,569 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:49:41,570 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:49:41,575 INFO L85 PathProgramCache]: Analyzing trace with hash 886374433, now seen corresponding path program 1 times [2022-04-15 06:49:41,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:49:41,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566830178] [2022-04-15 06:49:41,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:49:41,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:49:41,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:41,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:49:41,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:41,722 INFO L290 TraceCheckUtils]: 0: Hoare triple {751#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {740#true} is VALID [2022-04-15 06:49:41,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {740#true} assume true; {740#true} is VALID [2022-04-15 06:49:41,722 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {740#true} {740#true} #52#return; {740#true} is VALID [2022-04-15 06:49:41,723 INFO L272 TraceCheckUtils]: 0: Hoare triple {740#true} call ULTIMATE.init(); {751#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:49:41,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {751#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {740#true} is VALID [2022-04-15 06:49:41,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {740#true} assume true; {740#true} is VALID [2022-04-15 06:49:41,723 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {740#true} {740#true} #52#return; {740#true} is VALID [2022-04-15 06:49:41,723 INFO L272 TraceCheckUtils]: 4: Hoare triple {740#true} call #t~ret7 := main(); {740#true} is VALID [2022-04-15 06:49:41,726 INFO L290 TraceCheckUtils]: 5: Hoare triple {740#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {745#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:49:41,726 INFO L290 TraceCheckUtils]: 6: Hoare triple {745#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} [64] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_41 v_main_~x~0_40)) (.cse1 (= |v_main_#t~post4_15| |v_main_#t~post4_14|))) (or (and (< v_main_~x~0_41 v_main_~x~0_40) (< v_main_~x~0_40 50001)) (and .cse0 .cse1 (<= 50000 v_main_~x~0_41)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_41, main_#t~post4=|v_main_#t~post4_15|} OutVars{main_~x~0=v_main_~x~0_40, main_#t~post4=|v_main_#t~post4_14|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {746#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} is VALID [2022-04-15 06:49:41,727 INFO L290 TraceCheckUtils]: 7: Hoare triple {746#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} [65] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {746#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} is VALID [2022-04-15 06:49:41,728 INFO L290 TraceCheckUtils]: 8: Hoare triple {746#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} [66] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_21 v_main_~y~0_20)) (.cse3 (<= 50000 v_main_~x~0_43)) (.cse1 (= v_main_~x~0_43 v_main_~x~0_42))) (or (and .cse0 .cse1) (let ((.cse2 (div (+ v_main_~x~0_43 (* (- 1) v_main_~x~0_42)) (- 2)))) (and (< 0 .cse2) (< .cse2 (+ 2 (div (+ 999999 (* (- 1) v_main_~x~0_43)) 2))) (= (mod (+ v_main_~x~0_43 v_main_~x~0_42) 2) 0) .cse3 (= v_main_~y~0_20 (+ v_main_~y~0_21 (* .cse2 2))))) (and .cse0 (or (not .cse3) (not (< v_main_~x~0_43 1000000))) .cse1))) InVars {main_~x~0=v_main_~x~0_43, main_~y~0=v_main_~y~0_21} OutVars{main_~x~0=v_main_~x~0_42, main_~y~0=v_main_~y~0_20} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {747#(or (and (= main_~z~0 0) (<= main_~x~0 main_~y~0)) (<= main_~x~0 50000))} is VALID [2022-04-15 06:49:41,729 INFO L290 TraceCheckUtils]: 9: Hoare triple {747#(or (and (= main_~z~0 0) (<= main_~x~0 main_~y~0)) (<= main_~x~0 50000))} [63] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {748#(and (= main_~z~0 0) (<= 1000000 main_~y~0))} is VALID [2022-04-15 06:49:41,729 INFO L290 TraceCheckUtils]: 10: Hoare triple {748#(and (= main_~z~0 0) (<= 1000000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {749#(and (= main_~z~0 0) (<= 999999 main_~y~0))} is VALID [2022-04-15 06:49:41,730 INFO L290 TraceCheckUtils]: 11: Hoare triple {749#(and (= main_~z~0 0) (<= 999999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {750#(and (= main_~z~0 0) (<= 999998 main_~y~0))} is VALID [2022-04-15 06:49:41,731 INFO L290 TraceCheckUtils]: 12: Hoare triple {750#(and (= main_~z~0 0) (<= 999998 main_~y~0))} assume !(~y~0 > ~z~0); {741#false} is VALID [2022-04-15 06:49:41,731 INFO L272 TraceCheckUtils]: 13: Hoare triple {741#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {741#false} is VALID [2022-04-15 06:49:41,732 INFO L290 TraceCheckUtils]: 14: Hoare triple {741#false} ~cond := #in~cond; {741#false} is VALID [2022-04-15 06:49:41,732 INFO L290 TraceCheckUtils]: 15: Hoare triple {741#false} assume 0 == ~cond; {741#false} is VALID [2022-04-15 06:49:41,732 INFO L290 TraceCheckUtils]: 16: Hoare triple {741#false} assume !false; {741#false} is VALID [2022-04-15 06:49:41,732 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:49:41,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:49:41,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566830178] [2022-04-15 06:49:41,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566830178] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:49:41,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992115216] [2022-04-15 06:49:41,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:49:41,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:49:41,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:49:41,740 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:49:41,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 06:49:41,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:41,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 06:49:41,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:41,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:50:10,149 INFO L272 TraceCheckUtils]: 0: Hoare triple {740#true} call ULTIMATE.init(); {740#true} is VALID [2022-04-15 06:50:10,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {740#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {740#true} is VALID [2022-04-15 06:50:10,150 INFO L290 TraceCheckUtils]: 2: Hoare triple {740#true} assume true; {740#true} is VALID [2022-04-15 06:50:10,150 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {740#true} {740#true} #52#return; {740#true} is VALID [2022-04-15 06:50:10,150 INFO L272 TraceCheckUtils]: 4: Hoare triple {740#true} call #t~ret7 := main(); {740#true} is VALID [2022-04-15 06:50:10,151 INFO L290 TraceCheckUtils]: 5: Hoare triple {740#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {770#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:50:10,156 INFO L290 TraceCheckUtils]: 6: Hoare triple {770#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [64] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_41 v_main_~x~0_40)) (.cse1 (= |v_main_#t~post4_15| |v_main_#t~post4_14|))) (or (and (< v_main_~x~0_41 v_main_~x~0_40) (< v_main_~x~0_40 50001)) (and .cse0 .cse1 (<= 50000 v_main_~x~0_41)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_41, main_#t~post4=|v_main_#t~post4_15|} OutVars{main_~x~0=v_main_~x~0_40, main_#t~post4=|v_main_#t~post4_14|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {770#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:50:10,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {770#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [65] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {770#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:50:10,158 INFO L290 TraceCheckUtils]: 8: Hoare triple {770#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [66] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_21 v_main_~y~0_20)) (.cse3 (<= 50000 v_main_~x~0_43)) (.cse1 (= v_main_~x~0_43 v_main_~x~0_42))) (or (and .cse0 .cse1) (let ((.cse2 (div (+ v_main_~x~0_43 (* (- 1) v_main_~x~0_42)) (- 2)))) (and (< 0 .cse2) (< .cse2 (+ 2 (div (+ 999999 (* (- 1) v_main_~x~0_43)) 2))) (= (mod (+ v_main_~x~0_43 v_main_~x~0_42) 2) 0) .cse3 (= v_main_~y~0_20 (+ v_main_~y~0_21 (* .cse2 2))))) (and .cse0 (or (not .cse3) (not (< v_main_~x~0_43 1000000))) .cse1))) InVars {main_~x~0=v_main_~x~0_43, main_~y~0=v_main_~y~0_21} OutVars{main_~x~0=v_main_~x~0_42, main_~y~0=v_main_~y~0_20} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {770#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:50:10,159 INFO L290 TraceCheckUtils]: 9: Hoare triple {770#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [63] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {770#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:50:10,159 INFO L290 TraceCheckUtils]: 10: Hoare triple {770#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {786#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-15 06:50:10,160 INFO L290 TraceCheckUtils]: 11: Hoare triple {786#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {790#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-15 06:50:10,161 INFO L290 TraceCheckUtils]: 12: Hoare triple {790#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !(~y~0 > ~z~0); {741#false} is VALID [2022-04-15 06:50:10,161 INFO L272 TraceCheckUtils]: 13: Hoare triple {741#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {741#false} is VALID [2022-04-15 06:50:10,161 INFO L290 TraceCheckUtils]: 14: Hoare triple {741#false} ~cond := #in~cond; {741#false} is VALID [2022-04-15 06:50:10,161 INFO L290 TraceCheckUtils]: 15: Hoare triple {741#false} assume 0 == ~cond; {741#false} is VALID [2022-04-15 06:50:10,161 INFO L290 TraceCheckUtils]: 16: Hoare triple {741#false} assume !false; {741#false} is VALID [2022-04-15 06:50:10,162 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:50:10,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:51:02,778 INFO L290 TraceCheckUtils]: 16: Hoare triple {741#false} assume !false; {741#false} is VALID [2022-04-15 06:51:02,779 INFO L290 TraceCheckUtils]: 15: Hoare triple {741#false} assume 0 == ~cond; {741#false} is VALID [2022-04-15 06:51:02,779 INFO L290 TraceCheckUtils]: 14: Hoare triple {741#false} ~cond := #in~cond; {741#false} is VALID [2022-04-15 06:51:02,779 INFO L272 TraceCheckUtils]: 13: Hoare triple {741#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {741#false} is VALID [2022-04-15 06:51:02,780 INFO L290 TraceCheckUtils]: 12: Hoare triple {818#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {741#false} is VALID [2022-04-15 06:51:02,780 INFO L290 TraceCheckUtils]: 11: Hoare triple {822#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {818#(< main_~z~0 main_~y~0)} is VALID [2022-04-15 06:51:02,781 INFO L290 TraceCheckUtils]: 10: Hoare triple {826#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {822#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-15 06:51:02,782 INFO L290 TraceCheckUtils]: 9: Hoare triple {826#(< (+ main_~z~0 2) main_~y~0)} [63] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {826#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-15 06:51:02,783 INFO L290 TraceCheckUtils]: 8: Hoare triple {826#(< (+ main_~z~0 2) main_~y~0)} [66] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_21 v_main_~y~0_20)) (.cse3 (<= 50000 v_main_~x~0_43)) (.cse1 (= v_main_~x~0_43 v_main_~x~0_42))) (or (and .cse0 .cse1) (let ((.cse2 (div (+ v_main_~x~0_43 (* (- 1) v_main_~x~0_42)) (- 2)))) (and (< 0 .cse2) (< .cse2 (+ 2 (div (+ 999999 (* (- 1) v_main_~x~0_43)) 2))) (= (mod (+ v_main_~x~0_43 v_main_~x~0_42) 2) 0) .cse3 (= v_main_~y~0_20 (+ v_main_~y~0_21 (* .cse2 2))))) (and .cse0 (or (not .cse3) (not (< v_main_~x~0_43 1000000))) .cse1))) InVars {main_~x~0=v_main_~x~0_43, main_~y~0=v_main_~y~0_21} OutVars{main_~x~0=v_main_~x~0_42, main_~y~0=v_main_~y~0_20} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {826#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-15 06:51:02,784 INFO L290 TraceCheckUtils]: 7: Hoare triple {826#(< (+ main_~z~0 2) main_~y~0)} [65] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {826#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-15 06:51:02,785 INFO L290 TraceCheckUtils]: 6: Hoare triple {826#(< (+ main_~z~0 2) main_~y~0)} [64] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_41 v_main_~x~0_40)) (.cse1 (= |v_main_#t~post4_15| |v_main_#t~post4_14|))) (or (and (< v_main_~x~0_41 v_main_~x~0_40) (< v_main_~x~0_40 50001)) (and .cse0 .cse1 (<= 50000 v_main_~x~0_41)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_41, main_#t~post4=|v_main_#t~post4_15|} OutVars{main_~x~0=v_main_~x~0_40, main_#t~post4=|v_main_#t~post4_14|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {826#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-15 06:51:02,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {740#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {826#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-15 06:51:02,785 INFO L272 TraceCheckUtils]: 4: Hoare triple {740#true} call #t~ret7 := main(); {740#true} is VALID [2022-04-15 06:51:02,785 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {740#true} {740#true} #52#return; {740#true} is VALID [2022-04-15 06:51:02,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {740#true} assume true; {740#true} is VALID [2022-04-15 06:51:02,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {740#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {740#true} is VALID [2022-04-15 06:51:02,786 INFO L272 TraceCheckUtils]: 0: Hoare triple {740#true} call ULTIMATE.init(); {740#true} is VALID [2022-04-15 06:51:02,786 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:51:02,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992115216] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:51:02,786 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:51:02,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 15 [2022-04-15 06:51:03,047 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:51:03,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [623949546] [2022-04-15 06:51:03,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [623949546] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:51:03,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:51:03,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 06:51:03,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30386936] [2022-04-15 06:51:03,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:51:03,049 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 states have internal predecessors, (18), 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 22 [2022-04-15 06:51:03,049 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:51:03,049 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:51:03,072 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:51:03,072 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 06:51:03,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:51:03,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 06:51:03,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2022-04-15 06:51:03,073 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:51:03,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:51:03,449 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-15 06:51:03,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 06:51:03,449 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 states have internal predecessors, (18), 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 22 [2022-04-15 06:51:03,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:51:03,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:51:03,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-15 06:51:03,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:51:03,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-15 06:51:03,457 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 39 transitions. [2022-04-15 06:51:03,497 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:51:03,500 INFO L225 Difference]: With dead ends: 42 [2022-04-15 06:51:03,500 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 06:51:03,501 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2022-04-15 06:51:03,502 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 15 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:51:03,502 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 45 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:51:03,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 06:51:03,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-15 06:51:03,534 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:51:03,534 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:51:03,534 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:51:03,535 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:51:03,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:51:03,536 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-15 06:51:03,536 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-15 06:51:03,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:51:03,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:51:03,537 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-15 06:51:03,537 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-15 06:51:03,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:51:03,538 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-15 06:51:03,538 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-15 06:51:03,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:51:03,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:51:03,538 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:51:03,538 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:51:03,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:51:03,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-04-15 06:51:03,540 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 22 [2022-04-15 06:51:03,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:51:03,540 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-04-15 06:51:03,540 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:51:03,540 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 33 transitions. [2022-04-15 06:51:03,578 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-15 06:51:03,579 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-15 06:51:03,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 06:51:03,580 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:51:03,580 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:51:03,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 06:51:03,803 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:51:03,804 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:51:03,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:51:03,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1246825262, now seen corresponding path program 3 times [2022-04-15 06:51:03,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:51:03,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2120206864] [2022-04-15 06:51:07,881 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:51:07,954 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:51:08,280 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:51:08,282 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:51:08,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1243873057, now seen corresponding path program 1 times [2022-04-15 06:51:08,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:51:08,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434823752] [2022-04-15 06:51:08,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:51:08,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:51:08,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:51:08,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:51:08,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:51:08,465 INFO L290 TraceCheckUtils]: 0: Hoare triple {1085#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1074#true} is VALID [2022-04-15 06:51:08,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {1074#true} assume true; {1074#true} is VALID [2022-04-15 06:51:08,466 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1074#true} {1074#true} #52#return; {1074#true} is VALID [2022-04-15 06:51:08,466 INFO L272 TraceCheckUtils]: 0: Hoare triple {1074#true} call ULTIMATE.init(); {1085#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:51:08,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {1085#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1074#true} is VALID [2022-04-15 06:51:08,466 INFO L290 TraceCheckUtils]: 2: Hoare triple {1074#true} assume true; {1074#true} is VALID [2022-04-15 06:51:08,467 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1074#true} {1074#true} #52#return; {1074#true} is VALID [2022-04-15 06:51:08,467 INFO L272 TraceCheckUtils]: 4: Hoare triple {1074#true} call #t~ret7 := main(); {1074#true} is VALID [2022-04-15 06:51:08,467 INFO L290 TraceCheckUtils]: 5: Hoare triple {1074#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {1079#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:51:08,468 INFO L290 TraceCheckUtils]: 6: Hoare triple {1079#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} [68] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_63 v_main_~x~0_62)) (.cse1 (= |v_main_#t~post4_21| |v_main_#t~post4_20|))) (or (and (not (< v_main_~x~0_63 50000)) .cse0 .cse1) (and .cse0 .cse1) (and (< v_main_~x~0_62 50001) (< v_main_~x~0_63 v_main_~x~0_62)))) InVars {main_~x~0=v_main_~x~0_63, main_#t~post4=|v_main_#t~post4_21|} OutVars{main_~x~0=v_main_~x~0_62, main_#t~post4=|v_main_#t~post4_20|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1080#(and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:51:08,468 INFO L290 TraceCheckUtils]: 7: Hoare triple {1080#(and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} [69] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1080#(and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:51:08,470 INFO L290 TraceCheckUtils]: 8: Hoare triple {1080#(and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} [70] L10-2-->L17-1_primed: Formula: (let ((.cse2 (<= 50000 v_main_~x~0_65)) (.cse0 (= v_main_~y~0_37 v_main_~y~0_36)) (.cse1 (= v_main_~x~0_65 v_main_~x~0_64))) (or (and .cse0 .cse1) (let ((.cse3 (div (+ v_main_~x~0_65 (* (- 1) v_main_~x~0_64)) (- 2)))) (and .cse2 (< 0 .cse3) (< .cse3 (+ 2 (div (+ 999999 (* (- 1) v_main_~x~0_65)) 2))) (= (mod (+ v_main_~x~0_65 v_main_~x~0_64) 2) 0) (= (+ v_main_~y~0_37 (* .cse3 2)) v_main_~y~0_36))) (and (or (not (< v_main_~x~0_65 1000000)) (not .cse2)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_65, main_~y~0=v_main_~y~0_37} OutVars{main_~x~0=v_main_~x~0_64, main_~y~0=v_main_~y~0_36} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {1081#(and (= main_~z~0 0) (or (<= main_~x~0 main_~y~0) (<= 3 main_~y~0)))} is VALID [2022-04-15 06:51:08,470 INFO L290 TraceCheckUtils]: 9: Hoare triple {1081#(and (= main_~z~0 0) (or (<= main_~x~0 main_~y~0) (<= 3 main_~y~0)))} [67] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {1082#(and (= main_~z~0 0) (<= 3 main_~y~0))} is VALID [2022-04-15 06:51:08,471 INFO L290 TraceCheckUtils]: 10: Hoare triple {1082#(and (= main_~z~0 0) (<= 3 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1083#(and (= main_~z~0 0) (<= 2 main_~y~0))} is VALID [2022-04-15 06:51:08,472 INFO L290 TraceCheckUtils]: 11: Hoare triple {1083#(and (= main_~z~0 0) (<= 2 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1084#(and (= main_~z~0 0) (<= 1 main_~y~0))} is VALID [2022-04-15 06:51:08,472 INFO L290 TraceCheckUtils]: 12: Hoare triple {1084#(and (= main_~z~0 0) (<= 1 main_~y~0))} assume !(~y~0 > ~z~0); {1075#false} is VALID [2022-04-15 06:51:08,472 INFO L272 TraceCheckUtils]: 13: Hoare triple {1075#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {1075#false} is VALID [2022-04-15 06:51:08,472 INFO L290 TraceCheckUtils]: 14: Hoare triple {1075#false} ~cond := #in~cond; {1075#false} is VALID [2022-04-15 06:51:08,472 INFO L290 TraceCheckUtils]: 15: Hoare triple {1075#false} assume 0 == ~cond; {1075#false} is VALID [2022-04-15 06:51:08,472 INFO L290 TraceCheckUtils]: 16: Hoare triple {1075#false} assume !false; {1075#false} is VALID [2022-04-15 06:51:08,473 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:51:08,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:51:08,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434823752] [2022-04-15 06:51:08,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434823752] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:51:08,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181925221] [2022-04-15 06:51:08,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:51:08,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:51:08,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:51:08,474 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:51:08,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 06:51:08,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:51:08,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 06:51:08,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:51:08,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:51:36,854 INFO L272 TraceCheckUtils]: 0: Hoare triple {1074#true} call ULTIMATE.init(); {1074#true} is VALID [2022-04-15 06:51:36,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {1074#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1074#true} is VALID [2022-04-15 06:51:36,855 INFO L290 TraceCheckUtils]: 2: Hoare triple {1074#true} assume true; {1074#true} is VALID [2022-04-15 06:51:36,855 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1074#true} {1074#true} #52#return; {1074#true} is VALID [2022-04-15 06:51:36,855 INFO L272 TraceCheckUtils]: 4: Hoare triple {1074#true} call #t~ret7 := main(); {1074#true} is VALID [2022-04-15 06:51:36,855 INFO L290 TraceCheckUtils]: 5: Hoare triple {1074#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {1104#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:51:36,856 INFO L290 TraceCheckUtils]: 6: Hoare triple {1104#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [68] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_63 v_main_~x~0_62)) (.cse1 (= |v_main_#t~post4_21| |v_main_#t~post4_20|))) (or (and (not (< v_main_~x~0_63 50000)) .cse0 .cse1) (and .cse0 .cse1) (and (< v_main_~x~0_62 50001) (< v_main_~x~0_63 v_main_~x~0_62)))) InVars {main_~x~0=v_main_~x~0_63, main_#t~post4=|v_main_#t~post4_21|} OutVars{main_~x~0=v_main_~x~0_62, main_#t~post4=|v_main_#t~post4_20|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1104#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:51:36,856 INFO L290 TraceCheckUtils]: 7: Hoare triple {1104#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [69] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1104#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:51:36,858 INFO L290 TraceCheckUtils]: 8: Hoare triple {1104#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [70] L10-2-->L17-1_primed: Formula: (let ((.cse2 (<= 50000 v_main_~x~0_65)) (.cse0 (= v_main_~y~0_37 v_main_~y~0_36)) (.cse1 (= v_main_~x~0_65 v_main_~x~0_64))) (or (and .cse0 .cse1) (let ((.cse3 (div (+ v_main_~x~0_65 (* (- 1) v_main_~x~0_64)) (- 2)))) (and .cse2 (< 0 .cse3) (< .cse3 (+ 2 (div (+ 999999 (* (- 1) v_main_~x~0_65)) 2))) (= (mod (+ v_main_~x~0_65 v_main_~x~0_64) 2) 0) (= (+ v_main_~y~0_37 (* .cse3 2)) v_main_~y~0_36))) (and (or (not (< v_main_~x~0_65 1000000)) (not .cse2)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_65, main_~y~0=v_main_~y~0_37} OutVars{main_~x~0=v_main_~x~0_64, main_~y~0=v_main_~y~0_36} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {1104#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:51:36,858 INFO L290 TraceCheckUtils]: 9: Hoare triple {1104#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [67] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {1104#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:51:36,859 INFO L290 TraceCheckUtils]: 10: Hoare triple {1104#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1120#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-15 06:51:36,859 INFO L290 TraceCheckUtils]: 11: Hoare triple {1120#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1124#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-15 06:51:36,860 INFO L290 TraceCheckUtils]: 12: Hoare triple {1124#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !(~y~0 > ~z~0); {1075#false} is VALID [2022-04-15 06:51:36,860 INFO L272 TraceCheckUtils]: 13: Hoare triple {1075#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {1075#false} is VALID [2022-04-15 06:51:36,860 INFO L290 TraceCheckUtils]: 14: Hoare triple {1075#false} ~cond := #in~cond; {1075#false} is VALID [2022-04-15 06:51:36,860 INFO L290 TraceCheckUtils]: 15: Hoare triple {1075#false} assume 0 == ~cond; {1075#false} is VALID [2022-04-15 06:51:36,860 INFO L290 TraceCheckUtils]: 16: Hoare triple {1075#false} assume !false; {1075#false} is VALID [2022-04-15 06:51:36,861 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:51:36,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:52:28,754 INFO L290 TraceCheckUtils]: 16: Hoare triple {1075#false} assume !false; {1075#false} is VALID [2022-04-15 06:52:28,754 INFO L290 TraceCheckUtils]: 15: Hoare triple {1075#false} assume 0 == ~cond; {1075#false} is VALID [2022-04-15 06:52:28,754 INFO L290 TraceCheckUtils]: 14: Hoare triple {1075#false} ~cond := #in~cond; {1075#false} is VALID [2022-04-15 06:52:28,754 INFO L272 TraceCheckUtils]: 13: Hoare triple {1075#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {1075#false} is VALID [2022-04-15 06:52:28,755 INFO L290 TraceCheckUtils]: 12: Hoare triple {1152#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {1075#false} is VALID [2022-04-15 06:52:28,755 INFO L290 TraceCheckUtils]: 11: Hoare triple {1156#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1152#(< main_~z~0 main_~y~0)} is VALID [2022-04-15 06:52:28,756 INFO L290 TraceCheckUtils]: 10: Hoare triple {1160#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1156#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-15 06:52:28,756 INFO L290 TraceCheckUtils]: 9: Hoare triple {1160#(< (+ main_~z~0 2) main_~y~0)} [67] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {1160#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-15 06:52:28,758 INFO L290 TraceCheckUtils]: 8: Hoare triple {1160#(< (+ main_~z~0 2) main_~y~0)} [70] L10-2-->L17-1_primed: Formula: (let ((.cse2 (<= 50000 v_main_~x~0_65)) (.cse0 (= v_main_~y~0_37 v_main_~y~0_36)) (.cse1 (= v_main_~x~0_65 v_main_~x~0_64))) (or (and .cse0 .cse1) (let ((.cse3 (div (+ v_main_~x~0_65 (* (- 1) v_main_~x~0_64)) (- 2)))) (and .cse2 (< 0 .cse3) (< .cse3 (+ 2 (div (+ 999999 (* (- 1) v_main_~x~0_65)) 2))) (= (mod (+ v_main_~x~0_65 v_main_~x~0_64) 2) 0) (= (+ v_main_~y~0_37 (* .cse3 2)) v_main_~y~0_36))) (and (or (not (< v_main_~x~0_65 1000000)) (not .cse2)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_65, main_~y~0=v_main_~y~0_37} OutVars{main_~x~0=v_main_~x~0_64, main_~y~0=v_main_~y~0_36} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {1160#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-15 06:52:28,758 INFO L290 TraceCheckUtils]: 7: Hoare triple {1160#(< (+ main_~z~0 2) main_~y~0)} [69] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1160#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-15 06:52:28,758 INFO L290 TraceCheckUtils]: 6: Hoare triple {1160#(< (+ main_~z~0 2) main_~y~0)} [68] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_63 v_main_~x~0_62)) (.cse1 (= |v_main_#t~post4_21| |v_main_#t~post4_20|))) (or (and (not (< v_main_~x~0_63 50000)) .cse0 .cse1) (and .cse0 .cse1) (and (< v_main_~x~0_62 50001) (< v_main_~x~0_63 v_main_~x~0_62)))) InVars {main_~x~0=v_main_~x~0_63, main_#t~post4=|v_main_#t~post4_21|} OutVars{main_~x~0=v_main_~x~0_62, main_#t~post4=|v_main_#t~post4_20|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1160#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-15 06:52:28,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {1074#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {1160#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-15 06:52:28,759 INFO L272 TraceCheckUtils]: 4: Hoare triple {1074#true} call #t~ret7 := main(); {1074#true} is VALID [2022-04-15 06:52:28,759 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1074#true} {1074#true} #52#return; {1074#true} is VALID [2022-04-15 06:52:28,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {1074#true} assume true; {1074#true} is VALID [2022-04-15 06:52:28,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {1074#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1074#true} is VALID [2022-04-15 06:52:28,759 INFO L272 TraceCheckUtils]: 0: Hoare triple {1074#true} call ULTIMATE.init(); {1074#true} is VALID [2022-04-15 06:52:28,760 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:52:28,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181925221] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:52:28,760 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:52:28,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 15 [2022-04-15 06:52:28,961 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:52:28,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2120206864] [2022-04-15 06:52:28,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2120206864] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:52:28,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:52:28,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 06:52:28,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026993602] [2022-04-15 06:52:28,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:52:28,962 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 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 24 [2022-04-15 06:52:28,962 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:52:28,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:52:28,986 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:52:28,986 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 06:52:28,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:52:28,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 06:52:28,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=267, Unknown=0, NotChecked=0, Total=420 [2022-04-15 06:52:28,987 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:52:29,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:52:29,452 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2022-04-15 06:52:29,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 06:52:29,452 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 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 24 [2022-04-15 06:52:29,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:52:29,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:52:29,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 45 transitions. [2022-04-15 06:52:29,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:52:29,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 45 transitions. [2022-04-15 06:52:29,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 45 transitions. [2022-04-15 06:52:29,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:52:29,501 INFO L225 Difference]: With dead ends: 45 [2022-04-15 06:52:29,501 INFO L226 Difference]: Without dead ends: 32 [2022-04-15 06:52:29,502 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=288, Invalid=582, Unknown=0, NotChecked=0, Total=870 [2022-04-15 06:52:29,502 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 30 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:52:29,503 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 29 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:52:29,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-15 06:52:29,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-15 06:52:29,550 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:52:29,551 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:52:29,551 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:52:29,551 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:52:29,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:52:29,553 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-04-15 06:52:29,554 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-04-15 06:52:29,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:52:29,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:52:29,555 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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 32 states. [2022-04-15 06:52:29,555 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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 32 states. [2022-04-15 06:52:29,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:52:29,557 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-04-15 06:52:29,557 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-04-15 06:52:29,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:52:29,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:52:29,561 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:52:29,561 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:52:29,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:52:29,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-04-15 06:52:29,563 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 24 [2022-04-15 06:52:29,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:52:29,564 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-04-15 06:52:29,564 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:52:29,564 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 36 transitions. [2022-04-15 06:52:29,603 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:52:29,603 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-04-15 06:52:29,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 06:52:29,605 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:52:29,605 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:52:29,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 06:52:29,823 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:52:29,824 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:52:29,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:52:29,824 INFO L85 PathProgramCache]: Analyzing trace with hash 969620496, now seen corresponding path program 4 times [2022-04-15 06:52:29,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:52:29,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [72942382] [2022-04-15 06:52:29,928 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:52:30,285 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:52:30,286 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:52:30,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1861547678, now seen corresponding path program 1 times [2022-04-15 06:52:30,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:52:30,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880173622] [2022-04-15 06:52:30,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:52:30,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:52:30,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:52:30,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:52:30,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:52:30,406 INFO L290 TraceCheckUtils]: 0: Hoare triple {1444#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1435#true} is VALID [2022-04-15 06:52:30,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {1435#true} assume true; {1435#true} is VALID [2022-04-15 06:52:30,406 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1435#true} {1435#true} #52#return; {1435#true} is VALID [2022-04-15 06:52:30,407 INFO L272 TraceCheckUtils]: 0: Hoare triple {1435#true} call ULTIMATE.init(); {1444#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:52:30,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {1444#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1435#true} is VALID [2022-04-15 06:52:30,407 INFO L290 TraceCheckUtils]: 2: Hoare triple {1435#true} assume true; {1435#true} is VALID [2022-04-15 06:52:30,407 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1435#true} {1435#true} #52#return; {1435#true} is VALID [2022-04-15 06:52:30,407 INFO L272 TraceCheckUtils]: 4: Hoare triple {1435#true} call #t~ret7 := main(); {1435#true} is VALID [2022-04-15 06:52:30,408 INFO L290 TraceCheckUtils]: 5: Hoare triple {1435#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {1440#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:52:30,409 INFO L290 TraceCheckUtils]: 6: Hoare triple {1440#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [72] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_86 v_main_~x~0_85))) (or (and .cse0 (= |v_main_#t~post4_26| |v_main_#t~post4_27|) (<= 50000 v_main_~x~0_86)) (and (= |v_main_#t~post4_27| |v_main_#t~post4_26|) .cse0) (and (< v_main_~x~0_85 50001) (< v_main_~x~0_86 v_main_~x~0_85)))) InVars {main_~x~0=v_main_~x~0_86, main_#t~post4=|v_main_#t~post4_27|} OutVars{main_~x~0=v_main_~x~0_85, main_#t~post4=|v_main_#t~post4_26|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1440#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:52:30,410 INFO L290 TraceCheckUtils]: 7: Hoare triple {1440#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [73] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1440#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:52:30,412 INFO L290 TraceCheckUtils]: 8: Hoare triple {1440#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [74] L10-2-->L17-1_primed: Formula: (let ((.cse1 (<= 50000 v_main_~x~0_88)) (.cse2 (= v_main_~y~0_54 v_main_~y~0_53)) (.cse3 (= v_main_~x~0_88 v_main_~x~0_87))) (or (let ((.cse0 (div (+ v_main_~y~0_53 (* (- 1) v_main_~y~0_54)) 2))) (and (= (mod (+ v_main_~y~0_54 v_main_~y~0_53) 2) 0) (< .cse0 (+ (div (+ 999999 (* (- 1) v_main_~x~0_88)) 2) 2)) (= v_main_~x~0_87 (+ v_main_~x~0_88 (* 2 .cse0))) .cse1 (< 0 .cse0))) (and .cse2 (or (not .cse1) (not (< v_main_~x~0_88 1000000))) .cse3) (and .cse2 .cse3))) InVars {main_~x~0=v_main_~x~0_88, main_~y~0=v_main_~y~0_54} OutVars{main_~x~0=v_main_~x~0_87, main_~y~0=v_main_~y~0_53} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {1440#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:52:30,412 INFO L290 TraceCheckUtils]: 9: Hoare triple {1440#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [71] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {1440#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:52:30,413 INFO L290 TraceCheckUtils]: 10: Hoare triple {1440#(and (= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1441#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-15 06:52:30,414 INFO L290 TraceCheckUtils]: 11: Hoare triple {1441#(and (= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1442#(and (<= 49998 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 06:52:30,415 INFO L290 TraceCheckUtils]: 12: Hoare triple {1442#(and (<= 49998 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1443#(and (= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-15 06:52:30,415 INFO L290 TraceCheckUtils]: 13: Hoare triple {1443#(and (= main_~z~0 0) (<= 49997 main_~y~0))} assume !(~y~0 > ~z~0); {1436#false} is VALID [2022-04-15 06:52:30,415 INFO L272 TraceCheckUtils]: 14: Hoare triple {1436#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {1436#false} is VALID [2022-04-15 06:52:30,415 INFO L290 TraceCheckUtils]: 15: Hoare triple {1436#false} ~cond := #in~cond; {1436#false} is VALID [2022-04-15 06:52:30,416 INFO L290 TraceCheckUtils]: 16: Hoare triple {1436#false} assume 0 == ~cond; {1436#false} is VALID [2022-04-15 06:52:30,416 INFO L290 TraceCheckUtils]: 17: Hoare triple {1436#false} assume !false; {1436#false} is VALID [2022-04-15 06:52:30,416 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:52:30,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:52:30,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880173622] [2022-04-15 06:52:30,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880173622] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:52:30,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456988578] [2022-04-15 06:52:30,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:52:30,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:52:30,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:52:30,418 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:52:30,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 06:52:30,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:52:30,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 06:52:30,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:52:30,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:52:54,904 INFO L272 TraceCheckUtils]: 0: Hoare triple {1435#true} call ULTIMATE.init(); {1435#true} is VALID [2022-04-15 06:52:54,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {1435#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1435#true} is VALID [2022-04-15 06:52:54,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {1435#true} assume true; {1435#true} is VALID [2022-04-15 06:52:54,904 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1435#true} {1435#true} #52#return; {1435#true} is VALID [2022-04-15 06:52:54,904 INFO L272 TraceCheckUtils]: 4: Hoare triple {1435#true} call #t~ret7 := main(); {1435#true} is VALID [2022-04-15 06:52:54,905 INFO L290 TraceCheckUtils]: 5: Hoare triple {1435#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {1463#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:52:54,905 INFO L290 TraceCheckUtils]: 6: Hoare triple {1463#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [72] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_86 v_main_~x~0_85))) (or (and .cse0 (= |v_main_#t~post4_26| |v_main_#t~post4_27|) (<= 50000 v_main_~x~0_86)) (and (= |v_main_#t~post4_27| |v_main_#t~post4_26|) .cse0) (and (< v_main_~x~0_85 50001) (< v_main_~x~0_86 v_main_~x~0_85)))) InVars {main_~x~0=v_main_~x~0_86, main_#t~post4=|v_main_#t~post4_27|} OutVars{main_~x~0=v_main_~x~0_85, main_#t~post4=|v_main_#t~post4_26|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1463#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:52:54,906 INFO L290 TraceCheckUtils]: 7: Hoare triple {1463#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [73] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1463#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:52:54,907 INFO L290 TraceCheckUtils]: 8: Hoare triple {1463#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [74] L10-2-->L17-1_primed: Formula: (let ((.cse1 (<= 50000 v_main_~x~0_88)) (.cse2 (= v_main_~y~0_54 v_main_~y~0_53)) (.cse3 (= v_main_~x~0_88 v_main_~x~0_87))) (or (let ((.cse0 (div (+ v_main_~y~0_53 (* (- 1) v_main_~y~0_54)) 2))) (and (= (mod (+ v_main_~y~0_54 v_main_~y~0_53) 2) 0) (< .cse0 (+ (div (+ 999999 (* (- 1) v_main_~x~0_88)) 2) 2)) (= v_main_~x~0_87 (+ v_main_~x~0_88 (* 2 .cse0))) .cse1 (< 0 .cse0))) (and .cse2 (or (not .cse1) (not (< v_main_~x~0_88 1000000))) .cse3) (and .cse2 .cse3))) InVars {main_~x~0=v_main_~x~0_88, main_~y~0=v_main_~y~0_54} OutVars{main_~x~0=v_main_~x~0_87, main_~y~0=v_main_~y~0_53} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {1463#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:52:54,908 INFO L290 TraceCheckUtils]: 9: Hoare triple {1463#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [71] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {1463#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:52:54,908 INFO L290 TraceCheckUtils]: 10: Hoare triple {1463#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1479#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-15 06:52:54,909 INFO L290 TraceCheckUtils]: 11: Hoare triple {1479#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1483#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-15 06:52:54,909 INFO L290 TraceCheckUtils]: 12: Hoare triple {1483#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1487#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-15 06:52:54,910 INFO L290 TraceCheckUtils]: 13: Hoare triple {1487#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} assume !(~y~0 > ~z~0); {1436#false} is VALID [2022-04-15 06:52:54,910 INFO L272 TraceCheckUtils]: 14: Hoare triple {1436#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {1436#false} is VALID [2022-04-15 06:52:54,910 INFO L290 TraceCheckUtils]: 15: Hoare triple {1436#false} ~cond := #in~cond; {1436#false} is VALID [2022-04-15 06:52:54,910 INFO L290 TraceCheckUtils]: 16: Hoare triple {1436#false} assume 0 == ~cond; {1436#false} is VALID [2022-04-15 06:52:54,910 INFO L290 TraceCheckUtils]: 17: Hoare triple {1436#false} assume !false; {1436#false} is VALID [2022-04-15 06:52:54,911 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:52:54,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:53:18,032 INFO L290 TraceCheckUtils]: 17: Hoare triple {1436#false} assume !false; {1436#false} is VALID [2022-04-15 06:53:18,045 INFO L290 TraceCheckUtils]: 16: Hoare triple {1436#false} assume 0 == ~cond; {1436#false} is VALID [2022-04-15 06:53:18,045 INFO L290 TraceCheckUtils]: 15: Hoare triple {1436#false} ~cond := #in~cond; {1436#false} is VALID [2022-04-15 06:53:18,045 INFO L272 TraceCheckUtils]: 14: Hoare triple {1436#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {1436#false} is VALID [2022-04-15 06:53:18,046 INFO L290 TraceCheckUtils]: 13: Hoare triple {1515#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {1436#false} is VALID [2022-04-15 06:53:18,047 INFO L290 TraceCheckUtils]: 12: Hoare triple {1519#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1515#(< main_~z~0 main_~y~0)} is VALID [2022-04-15 06:53:18,049 INFO L290 TraceCheckUtils]: 11: Hoare triple {1523#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1519#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-15 06:53:18,049 INFO L290 TraceCheckUtils]: 10: Hoare triple {1527#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1523#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-15 06:53:18,050 INFO L290 TraceCheckUtils]: 9: Hoare triple {1527#(< (+ main_~z~0 3) main_~y~0)} [71] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {1527#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-15 06:53:18,051 INFO L290 TraceCheckUtils]: 8: Hoare triple {1527#(< (+ main_~z~0 3) main_~y~0)} [74] L10-2-->L17-1_primed: Formula: (let ((.cse1 (<= 50000 v_main_~x~0_88)) (.cse2 (= v_main_~y~0_54 v_main_~y~0_53)) (.cse3 (= v_main_~x~0_88 v_main_~x~0_87))) (or (let ((.cse0 (div (+ v_main_~y~0_53 (* (- 1) v_main_~y~0_54)) 2))) (and (= (mod (+ v_main_~y~0_54 v_main_~y~0_53) 2) 0) (< .cse0 (+ (div (+ 999999 (* (- 1) v_main_~x~0_88)) 2) 2)) (= v_main_~x~0_87 (+ v_main_~x~0_88 (* 2 .cse0))) .cse1 (< 0 .cse0))) (and .cse2 (or (not .cse1) (not (< v_main_~x~0_88 1000000))) .cse3) (and .cse2 .cse3))) InVars {main_~x~0=v_main_~x~0_88, main_~y~0=v_main_~y~0_54} OutVars{main_~x~0=v_main_~x~0_87, main_~y~0=v_main_~y~0_53} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {1527#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-15 06:53:18,051 INFO L290 TraceCheckUtils]: 7: Hoare triple {1527#(< (+ main_~z~0 3) main_~y~0)} [73] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1527#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-15 06:53:18,054 INFO L290 TraceCheckUtils]: 6: Hoare triple {1527#(< (+ main_~z~0 3) main_~y~0)} [72] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_86 v_main_~x~0_85))) (or (and .cse0 (= |v_main_#t~post4_26| |v_main_#t~post4_27|) (<= 50000 v_main_~x~0_86)) (and (= |v_main_#t~post4_27| |v_main_#t~post4_26|) .cse0) (and (< v_main_~x~0_85 50001) (< v_main_~x~0_86 v_main_~x~0_85)))) InVars {main_~x~0=v_main_~x~0_86, main_#t~post4=|v_main_#t~post4_27|} OutVars{main_~x~0=v_main_~x~0_85, main_#t~post4=|v_main_#t~post4_26|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1527#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-15 06:53:18,055 INFO L290 TraceCheckUtils]: 5: Hoare triple {1435#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {1527#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-15 06:53:18,055 INFO L272 TraceCheckUtils]: 4: Hoare triple {1435#true} call #t~ret7 := main(); {1435#true} is VALID [2022-04-15 06:53:18,055 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1435#true} {1435#true} #52#return; {1435#true} is VALID [2022-04-15 06:53:18,055 INFO L290 TraceCheckUtils]: 2: Hoare triple {1435#true} assume true; {1435#true} is VALID [2022-04-15 06:53:18,055 INFO L290 TraceCheckUtils]: 1: Hoare triple {1435#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1435#true} is VALID [2022-04-15 06:53:18,055 INFO L272 TraceCheckUtils]: 0: Hoare triple {1435#true} call ULTIMATE.init(); {1435#true} is VALID [2022-04-15 06:53:18,055 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:53:18,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456988578] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:53:18,056 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:53:18,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2022-04-15 06:53:18,328 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:53:18,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [72942382] [2022-04-15 06:53:18,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [72942382] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:53:18,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:53:18,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 06:53:18,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897120027] [2022-04-15 06:53:18,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:53:18,329 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 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 27 [2022-04-15 06:53:18,329 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:53:18,329 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:18,354 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:53:18,354 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 06:53:18,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:53:18,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 06:53:18,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=271, Unknown=0, NotChecked=0, Total=462 [2022-04-15 06:53:18,355 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:18,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:53:18,946 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2022-04-15 06:53:18,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 06:53:18,947 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 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 27 [2022-04-15 06:53:18,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:53:18,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:18,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 55 transitions. [2022-04-15 06:53:18,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:18,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 55 transitions. [2022-04-15 06:53:18,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 55 transitions. [2022-04-15 06:53:18,996 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:53:18,997 INFO L225 Difference]: With dead ends: 57 [2022-04-15 06:53:18,997 INFO L226 Difference]: Without dead ends: 43 [2022-04-15 06:53:18,998 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=659, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 06:53:18,999 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 40 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:53:18,999 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 29 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:53:18,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-15 06:53:19,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 33. [2022-04-15 06:53:19,050 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:53:19,050 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 33 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:19,050 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 33 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:19,050 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 33 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:19,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:53:19,052 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-04-15 06:53:19,052 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-15 06:53:19,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:53:19,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:53:19,052 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 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 43 states. [2022-04-15 06:53:19,052 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 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 43 states. [2022-04-15 06:53:19,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:53:19,054 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-04-15 06:53:19,054 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-15 06:53:19,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:53:19,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:53:19,054 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:53:19,054 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:53:19,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:19,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-04-15 06:53:19,055 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 27 [2022-04-15 06:53:19,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:53:19,056 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-04-15 06:53:19,056 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:19,056 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 36 transitions. [2022-04-15 06:53:19,096 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:53:19,096 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-15 06:53:19,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 06:53:19,096 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:53:19,096 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:53:19,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 06:53:19,297 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:53:19,297 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:53:19,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:53:19,297 INFO L85 PathProgramCache]: Analyzing trace with hash -777622499, now seen corresponding path program 5 times [2022-04-15 06:53:19,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:53:19,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1590593819] [2022-04-15 06:53:19,415 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:53:19,701 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:53:19,702 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:53:19,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1879071423, now seen corresponding path program 1 times [2022-04-15 06:53:19,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:53:19,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407805827] [2022-04-15 06:53:19,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:53:19,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:53:19,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:19,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:53:19,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:19,868 INFO L290 TraceCheckUtils]: 0: Hoare triple {1868#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1855#true} is VALID [2022-04-15 06:53:19,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {1855#true} assume true; {1855#true} is VALID [2022-04-15 06:53:19,869 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1855#true} {1855#true} #52#return; {1855#true} is VALID [2022-04-15 06:53:19,870 INFO L272 TraceCheckUtils]: 0: Hoare triple {1855#true} call ULTIMATE.init(); {1868#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:53:19,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {1868#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1855#true} is VALID [2022-04-15 06:53:19,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {1855#true} assume true; {1855#true} is VALID [2022-04-15 06:53:19,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1855#true} {1855#true} #52#return; {1855#true} is VALID [2022-04-15 06:53:19,870 INFO L272 TraceCheckUtils]: 4: Hoare triple {1855#true} call #t~ret7 := main(); {1855#true} is VALID [2022-04-15 06:53:19,871 INFO L290 TraceCheckUtils]: 5: Hoare triple {1855#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {1860#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:53:19,872 INFO L290 TraceCheckUtils]: 6: Hoare triple {1860#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} [76] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_33| |v_main_#t~post4_32|)) (.cse1 (= v_main_~x~0_111 v_main_~x~0_110))) (or (and (< v_main_~x~0_111 v_main_~x~0_110) (< v_main_~x~0_110 50001)) (and .cse0 .cse1 (<= 50000 v_main_~x~0_111)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_111, main_#t~post4=|v_main_#t~post4_33|} OutVars{main_~x~0=v_main_~x~0_110, main_#t~post4=|v_main_#t~post4_32|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1861#(and (= main_~z~0 0) (<= main_~x~0 50000) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:53:19,872 INFO L290 TraceCheckUtils]: 7: Hoare triple {1861#(and (= main_~z~0 0) (<= main_~x~0 50000) (<= 50000 main_~y~0))} [77] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1861#(and (= main_~z~0 0) (<= main_~x~0 50000) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:53:19,874 INFO L290 TraceCheckUtils]: 8: Hoare triple {1861#(and (= main_~z~0 0) (<= main_~x~0 50000) (<= 50000 main_~y~0))} [78] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_74 v_main_~y~0_73)) (.cse1 (= v_main_~x~0_113 v_main_~x~0_112)) (.cse2 (<= 50000 v_main_~x~0_113))) (or (and .cse0 .cse1) (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_113 1000000)))) (let ((.cse3 (div (+ v_main_~y~0_74 (* (- 1) v_main_~y~0_73)) (- 2)))) (and (< 0 .cse3) (= v_main_~x~0_112 (+ v_main_~x~0_113 (* 2 .cse3))) (= (mod (+ v_main_~y~0_74 v_main_~y~0_73) 2) 0) .cse2 (< .cse3 (+ 2 (div (+ (* v_main_~x~0_113 (- 1)) 999999) 2))))))) InVars {main_~x~0=v_main_~x~0_113, main_~y~0=v_main_~y~0_74} OutVars{main_~x~0=v_main_~x~0_112, main_~y~0=v_main_~y~0_73} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {1862#(or (<= main_~x~0 50000) (and (= main_~z~0 0) (<= 50001 main_~y~0)))} is VALID [2022-04-15 06:53:19,874 INFO L290 TraceCheckUtils]: 9: Hoare triple {1862#(or (<= main_~x~0 50000) (and (= main_~z~0 0) (<= 50001 main_~y~0)))} [75] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {1863#(and (= main_~z~0 0) (<= 50001 main_~y~0))} is VALID [2022-04-15 06:53:19,875 INFO L290 TraceCheckUtils]: 10: Hoare triple {1863#(and (= main_~z~0 0) (<= 50001 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1864#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:53:19,875 INFO L290 TraceCheckUtils]: 11: Hoare triple {1864#(and (= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1865#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-15 06:53:19,876 INFO L290 TraceCheckUtils]: 12: Hoare triple {1865#(and (= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1866#(and (<= 49998 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 06:53:19,877 INFO L290 TraceCheckUtils]: 13: Hoare triple {1866#(and (<= 49998 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1867#(and (= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-15 06:53:19,877 INFO L290 TraceCheckUtils]: 14: Hoare triple {1867#(and (= main_~z~0 0) (<= 49997 main_~y~0))} assume !(~y~0 > ~z~0); {1856#false} is VALID [2022-04-15 06:53:19,877 INFO L272 TraceCheckUtils]: 15: Hoare triple {1856#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {1856#false} is VALID [2022-04-15 06:53:19,877 INFO L290 TraceCheckUtils]: 16: Hoare triple {1856#false} ~cond := #in~cond; {1856#false} is VALID [2022-04-15 06:53:19,877 INFO L290 TraceCheckUtils]: 17: Hoare triple {1856#false} assume 0 == ~cond; {1856#false} is VALID [2022-04-15 06:53:19,877 INFO L290 TraceCheckUtils]: 18: Hoare triple {1856#false} assume !false; {1856#false} is VALID [2022-04-15 06:53:19,878 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:53:19,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:53:19,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407805827] [2022-04-15 06:53:19,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407805827] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:53:19,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356421472] [2022-04-15 06:53:19,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:53:19,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:53:19,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:53:19,880 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:53:19,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 06:53:19,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:19,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:53:19,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:19,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:53:41,808 INFO L272 TraceCheckUtils]: 0: Hoare triple {1855#true} call ULTIMATE.init(); {1855#true} is VALID [2022-04-15 06:53:41,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {1855#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1855#true} is VALID [2022-04-15 06:53:41,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {1855#true} assume true; {1855#true} is VALID [2022-04-15 06:53:41,809 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1855#true} {1855#true} #52#return; {1855#true} is VALID [2022-04-15 06:53:41,809 INFO L272 TraceCheckUtils]: 4: Hoare triple {1855#true} call #t~ret7 := main(); {1855#true} is VALID [2022-04-15 06:53:41,809 INFO L290 TraceCheckUtils]: 5: Hoare triple {1855#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {1887#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:53:41,810 INFO L290 TraceCheckUtils]: 6: Hoare triple {1887#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [76] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_33| |v_main_#t~post4_32|)) (.cse1 (= v_main_~x~0_111 v_main_~x~0_110))) (or (and (< v_main_~x~0_111 v_main_~x~0_110) (< v_main_~x~0_110 50001)) (and .cse0 .cse1 (<= 50000 v_main_~x~0_111)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_111, main_#t~post4=|v_main_#t~post4_33|} OutVars{main_~x~0=v_main_~x~0_110, main_#t~post4=|v_main_#t~post4_32|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1887#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:53:41,811 INFO L290 TraceCheckUtils]: 7: Hoare triple {1887#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [77] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1887#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:53:41,812 INFO L290 TraceCheckUtils]: 8: Hoare triple {1887#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [78] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_74 v_main_~y~0_73)) (.cse1 (= v_main_~x~0_113 v_main_~x~0_112)) (.cse2 (<= 50000 v_main_~x~0_113))) (or (and .cse0 .cse1) (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_113 1000000)))) (let ((.cse3 (div (+ v_main_~y~0_74 (* (- 1) v_main_~y~0_73)) (- 2)))) (and (< 0 .cse3) (= v_main_~x~0_112 (+ v_main_~x~0_113 (* 2 .cse3))) (= (mod (+ v_main_~y~0_74 v_main_~y~0_73) 2) 0) .cse2 (< .cse3 (+ 2 (div (+ (* v_main_~x~0_113 (- 1)) 999999) 2))))))) InVars {main_~x~0=v_main_~x~0_113, main_~y~0=v_main_~y~0_74} OutVars{main_~x~0=v_main_~x~0_112, main_~y~0=v_main_~y~0_73} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {1887#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:53:41,813 INFO L290 TraceCheckUtils]: 9: Hoare triple {1887#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [75] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {1887#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:53:41,813 INFO L290 TraceCheckUtils]: 10: Hoare triple {1887#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1903#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-15 06:53:41,814 INFO L290 TraceCheckUtils]: 11: Hoare triple {1903#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1907#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-15 06:53:41,815 INFO L290 TraceCheckUtils]: 12: Hoare triple {1907#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1911#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-15 06:53:41,816 INFO L290 TraceCheckUtils]: 13: Hoare triple {1911#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1915#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-15 06:53:41,816 INFO L290 TraceCheckUtils]: 14: Hoare triple {1915#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} assume !(~y~0 > ~z~0); {1856#false} is VALID [2022-04-15 06:53:41,817 INFO L272 TraceCheckUtils]: 15: Hoare triple {1856#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {1856#false} is VALID [2022-04-15 06:53:41,817 INFO L290 TraceCheckUtils]: 16: Hoare triple {1856#false} ~cond := #in~cond; {1856#false} is VALID [2022-04-15 06:53:41,817 INFO L290 TraceCheckUtils]: 17: Hoare triple {1856#false} assume 0 == ~cond; {1856#false} is VALID [2022-04-15 06:53:41,817 INFO L290 TraceCheckUtils]: 18: Hoare triple {1856#false} assume !false; {1856#false} is VALID [2022-04-15 06:53:41,817 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:53:41,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:54:05,081 INFO L290 TraceCheckUtils]: 18: Hoare triple {1856#false} assume !false; {1856#false} is VALID [2022-04-15 06:54:05,081 INFO L290 TraceCheckUtils]: 17: Hoare triple {1856#false} assume 0 == ~cond; {1856#false} is VALID [2022-04-15 06:54:05,081 INFO L290 TraceCheckUtils]: 16: Hoare triple {1856#false} ~cond := #in~cond; {1856#false} is VALID [2022-04-15 06:54:05,081 INFO L272 TraceCheckUtils]: 15: Hoare triple {1856#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {1856#false} is VALID [2022-04-15 06:54:05,083 INFO L290 TraceCheckUtils]: 14: Hoare triple {1943#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {1856#false} is VALID [2022-04-15 06:54:05,084 INFO L290 TraceCheckUtils]: 13: Hoare triple {1947#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1943#(< main_~z~0 main_~y~0)} is VALID [2022-04-15 06:54:05,084 INFO L290 TraceCheckUtils]: 12: Hoare triple {1951#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1947#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-15 06:54:05,085 INFO L290 TraceCheckUtils]: 11: Hoare triple {1955#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1951#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-15 06:54:05,086 INFO L290 TraceCheckUtils]: 10: Hoare triple {1959#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1955#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-15 06:54:05,086 INFO L290 TraceCheckUtils]: 9: Hoare triple {1959#(< (+ main_~z~0 4) main_~y~0)} [75] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {1959#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-15 06:54:05,088 INFO L290 TraceCheckUtils]: 8: Hoare triple {1959#(< (+ main_~z~0 4) main_~y~0)} [78] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_74 v_main_~y~0_73)) (.cse1 (= v_main_~x~0_113 v_main_~x~0_112)) (.cse2 (<= 50000 v_main_~x~0_113))) (or (and .cse0 .cse1) (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_113 1000000)))) (let ((.cse3 (div (+ v_main_~y~0_74 (* (- 1) v_main_~y~0_73)) (- 2)))) (and (< 0 .cse3) (= v_main_~x~0_112 (+ v_main_~x~0_113 (* 2 .cse3))) (= (mod (+ v_main_~y~0_74 v_main_~y~0_73) 2) 0) .cse2 (< .cse3 (+ 2 (div (+ (* v_main_~x~0_113 (- 1)) 999999) 2))))))) InVars {main_~x~0=v_main_~x~0_113, main_~y~0=v_main_~y~0_74} OutVars{main_~x~0=v_main_~x~0_112, main_~y~0=v_main_~y~0_73} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {1959#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-15 06:54:05,088 INFO L290 TraceCheckUtils]: 7: Hoare triple {1959#(< (+ main_~z~0 4) main_~y~0)} [77] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1959#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-15 06:54:05,089 INFO L290 TraceCheckUtils]: 6: Hoare triple {1959#(< (+ main_~z~0 4) main_~y~0)} [76] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_33| |v_main_#t~post4_32|)) (.cse1 (= v_main_~x~0_111 v_main_~x~0_110))) (or (and (< v_main_~x~0_111 v_main_~x~0_110) (< v_main_~x~0_110 50001)) (and .cse0 .cse1 (<= 50000 v_main_~x~0_111)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_111, main_#t~post4=|v_main_#t~post4_33|} OutVars{main_~x~0=v_main_~x~0_110, main_#t~post4=|v_main_#t~post4_32|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1959#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-15 06:54:05,090 INFO L290 TraceCheckUtils]: 5: Hoare triple {1855#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {1959#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-15 06:54:05,090 INFO L272 TraceCheckUtils]: 4: Hoare triple {1855#true} call #t~ret7 := main(); {1855#true} is VALID [2022-04-15 06:54:05,090 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1855#true} {1855#true} #52#return; {1855#true} is VALID [2022-04-15 06:54:05,090 INFO L290 TraceCheckUtils]: 2: Hoare triple {1855#true} assume true; {1855#true} is VALID [2022-04-15 06:54:05,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {1855#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1855#true} is VALID [2022-04-15 06:54:05,090 INFO L272 TraceCheckUtils]: 0: Hoare triple {1855#true} call ULTIMATE.init(); {1855#true} is VALID [2022-04-15 06:54:05,090 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:54:05,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356421472] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:54:05,091 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:54:05,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 21 [2022-04-15 06:54:05,464 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:54:05,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1590593819] [2022-04-15 06:54:05,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1590593819] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:54:05,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:54:05,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 06:54:05,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212592216] [2022-04-15 06:54:05,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:54:05,465 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 states have internal predecessors, (28), 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 32 [2022-04-15 06:54:05,465 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:54:05,465 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:05,489 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:05,489 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 06:54:05,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:05,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 06:54:05,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=334, Invalid=536, Unknown=0, NotChecked=0, Total=870 [2022-04-15 06:54:05,490 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:06,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:06,448 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2022-04-15 06:54:06,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 06:54:06,448 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 states have internal predecessors, (28), 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 32 [2022-04-15 06:54:06,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:54:06,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:06,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 54 transitions. [2022-04-15 06:54:06,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:06,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 54 transitions. [2022-04-15 06:54:06,451 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 54 transitions. [2022-04-15 06:54:06,509 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:06,510 INFO L225 Difference]: With dead ends: 75 [2022-04-15 06:54:06,510 INFO L226 Difference]: Without dead ends: 50 [2022-04-15 06:54:06,511 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=644, Invalid=1248, Unknown=0, NotChecked=0, Total=1892 [2022-04-15 06:54:06,512 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 29 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:54:06,512 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 70 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 06:54:06,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-15 06:54:06,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-15 06:54:06,613 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:54:06,613 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:06,613 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:06,614 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:06,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:06,615 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2022-04-15 06:54:06,615 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-04-15 06:54:06,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:06,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:06,616 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 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 50 states. [2022-04-15 06:54:06,616 INFO L87 Difference]: Start difference. First operand has 50 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 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 50 states. [2022-04-15 06:54:06,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:06,617 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2022-04-15 06:54:06,617 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-04-15 06:54:06,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:06,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:06,618 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:54:06,618 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:54:06,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:06,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2022-04-15 06:54:06,619 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 32 [2022-04-15 06:54:06,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:54:06,619 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2022-04-15 06:54:06,620 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:06,620 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 54 transitions. [2022-04-15 06:54:06,677 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:06,678 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-04-15 06:54:06,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 06:54:06,678 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:54:06,678 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:54:06,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-15 06:54:06,883 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:54:06,884 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:54:06,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:54:06,884 INFO L85 PathProgramCache]: Analyzing trace with hash -522473983, now seen corresponding path program 6 times [2022-04-15 06:54:06,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:06,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1086733187] [2022-04-15 06:54:07,022 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:07,346 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:07,348 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:54:07,354 INFO L85 PathProgramCache]: Analyzing trace with hash 636479298, now seen corresponding path program 1 times [2022-04-15 06:54:07,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:54:07,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296725282] [2022-04-15 06:54:07,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:07,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:54:07,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:07,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:54:07,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:07,536 INFO L290 TraceCheckUtils]: 0: Hoare triple {2393#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {2379#true} is VALID [2022-04-15 06:54:07,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {2379#true} assume true; {2379#true} is VALID [2022-04-15 06:54:07,536 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2379#true} {2379#true} #52#return; {2379#true} is VALID [2022-04-15 06:54:07,537 INFO L272 TraceCheckUtils]: 0: Hoare triple {2379#true} call ULTIMATE.init(); {2393#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:54:07,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {2393#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {2379#true} is VALID [2022-04-15 06:54:07,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {2379#true} assume true; {2379#true} is VALID [2022-04-15 06:54:07,537 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2379#true} {2379#true} #52#return; {2379#true} is VALID [2022-04-15 06:54:07,537 INFO L272 TraceCheckUtils]: 4: Hoare triple {2379#true} call #t~ret7 := main(); {2379#true} is VALID [2022-04-15 06:54:07,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {2379#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {2384#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:54:07,539 INFO L290 TraceCheckUtils]: 6: Hoare triple {2384#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} [80] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_139 v_main_~x~0_138)) (.cse1 (= |v_main_#t~post4_39| |v_main_#t~post4_38|))) (or (and (< v_main_~x~0_139 v_main_~x~0_138) (< v_main_~x~0_138 50001)) (and .cse0 .cse1 (<= 50000 v_main_~x~0_139)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_139, main_#t~post4=|v_main_#t~post4_39|} OutVars{main_~x~0=v_main_~x~0_138, main_#t~post4=|v_main_#t~post4_38|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2385#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} is VALID [2022-04-15 06:54:07,540 INFO L290 TraceCheckUtils]: 7: Hoare triple {2385#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} [81] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2385#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} is VALID [2022-04-15 06:54:07,541 INFO L290 TraceCheckUtils]: 8: Hoare triple {2385#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} [82] L10-2-->L17-1_primed: Formula: (let ((.cse1 (<= 50000 v_main_~x~0_141)) (.cse2 (= v_main_~x~0_141 v_main_~x~0_140)) (.cse3 (= v_main_~y~0_98 v_main_~y~0_97))) (or (let ((.cse0 (div (+ v_main_~x~0_141 (* v_main_~x~0_140 (- 1))) (- 2)))) (and (= v_main_~y~0_97 (+ v_main_~y~0_98 (* 2 .cse0))) (< 0 .cse0) (= (mod (+ v_main_~x~0_141 v_main_~x~0_140) 2) 0) (< .cse0 (+ (div (+ (* v_main_~x~0_141 (- 1)) 999999) 2) 2)) .cse1)) (and .cse2 .cse3) (and (or (not .cse1) (not (< v_main_~x~0_141 1000000))) .cse2 .cse3))) InVars {main_~x~0=v_main_~x~0_141, main_~y~0=v_main_~y~0_98} OutVars{main_~x~0=v_main_~x~0_140, main_~y~0=v_main_~y~0_97} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {2386#(or (and (= main_~z~0 0) (<= main_~x~0 main_~y~0)) (<= main_~x~0 50000))} is VALID [2022-04-15 06:54:07,542 INFO L290 TraceCheckUtils]: 9: Hoare triple {2386#(or (and (= main_~z~0 0) (<= main_~x~0 main_~y~0)) (<= main_~x~0 50000))} [79] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {2387#(and (= main_~z~0 0) (<= 1000000 main_~y~0))} is VALID [2022-04-15 06:54:07,543 INFO L290 TraceCheckUtils]: 10: Hoare triple {2387#(and (= main_~z~0 0) (<= 1000000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2388#(and (= main_~z~0 0) (<= 999999 main_~y~0))} is VALID [2022-04-15 06:54:07,544 INFO L290 TraceCheckUtils]: 11: Hoare triple {2388#(and (= main_~z~0 0) (<= 999999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2389#(and (= main_~z~0 0) (<= 999998 main_~y~0))} is VALID [2022-04-15 06:54:07,544 INFO L290 TraceCheckUtils]: 12: Hoare triple {2389#(and (= main_~z~0 0) (<= 999998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2390#(and (= main_~z~0 0) (<= 999997 main_~y~0))} is VALID [2022-04-15 06:54:07,545 INFO L290 TraceCheckUtils]: 13: Hoare triple {2390#(and (= main_~z~0 0) (<= 999997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2391#(and (<= 999996 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 06:54:07,546 INFO L290 TraceCheckUtils]: 14: Hoare triple {2391#(and (<= 999996 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2392#(and (= main_~z~0 0) (<= 999995 main_~y~0))} is VALID [2022-04-15 06:54:07,546 INFO L290 TraceCheckUtils]: 15: Hoare triple {2392#(and (= main_~z~0 0) (<= 999995 main_~y~0))} assume !(~y~0 > ~z~0); {2380#false} is VALID [2022-04-15 06:54:07,546 INFO L272 TraceCheckUtils]: 16: Hoare triple {2380#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {2380#false} is VALID [2022-04-15 06:54:07,546 INFO L290 TraceCheckUtils]: 17: Hoare triple {2380#false} ~cond := #in~cond; {2380#false} is VALID [2022-04-15 06:54:07,547 INFO L290 TraceCheckUtils]: 18: Hoare triple {2380#false} assume 0 == ~cond; {2380#false} is VALID [2022-04-15 06:54:07,547 INFO L290 TraceCheckUtils]: 19: Hoare triple {2380#false} assume !false; {2380#false} is VALID [2022-04-15 06:54:07,547 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:54:07,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:54:07,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296725282] [2022-04-15 06:54:07,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296725282] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:54:07,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732943262] [2022-04-15 06:54:07,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:07,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:54:07,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:54:07,551 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:54:07,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 06:54:07,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:07,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:54:07,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:07,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:54:32,195 INFO L272 TraceCheckUtils]: 0: Hoare triple {2379#true} call ULTIMATE.init(); {2379#true} is VALID [2022-04-15 06:54:32,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {2379#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {2379#true} is VALID [2022-04-15 06:54:32,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {2379#true} assume true; {2379#true} is VALID [2022-04-15 06:54:32,195 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2379#true} {2379#true} #52#return; {2379#true} is VALID [2022-04-15 06:54:32,195 INFO L272 TraceCheckUtils]: 4: Hoare triple {2379#true} call #t~ret7 := main(); {2379#true} is VALID [2022-04-15 06:54:32,196 INFO L290 TraceCheckUtils]: 5: Hoare triple {2379#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {2412#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:54:32,196 INFO L290 TraceCheckUtils]: 6: Hoare triple {2412#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [80] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_139 v_main_~x~0_138)) (.cse1 (= |v_main_#t~post4_39| |v_main_#t~post4_38|))) (or (and (< v_main_~x~0_139 v_main_~x~0_138) (< v_main_~x~0_138 50001)) (and .cse0 .cse1 (<= 50000 v_main_~x~0_139)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_139, main_#t~post4=|v_main_#t~post4_39|} OutVars{main_~x~0=v_main_~x~0_138, main_#t~post4=|v_main_#t~post4_38|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2412#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:54:32,196 INFO L290 TraceCheckUtils]: 7: Hoare triple {2412#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [81] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2412#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:54:32,198 INFO L290 TraceCheckUtils]: 8: Hoare triple {2412#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [82] L10-2-->L17-1_primed: Formula: (let ((.cse1 (<= 50000 v_main_~x~0_141)) (.cse2 (= v_main_~x~0_141 v_main_~x~0_140)) (.cse3 (= v_main_~y~0_98 v_main_~y~0_97))) (or (let ((.cse0 (div (+ v_main_~x~0_141 (* v_main_~x~0_140 (- 1))) (- 2)))) (and (= v_main_~y~0_97 (+ v_main_~y~0_98 (* 2 .cse0))) (< 0 .cse0) (= (mod (+ v_main_~x~0_141 v_main_~x~0_140) 2) 0) (< .cse0 (+ (div (+ (* v_main_~x~0_141 (- 1)) 999999) 2) 2)) .cse1)) (and .cse2 .cse3) (and (or (not .cse1) (not (< v_main_~x~0_141 1000000))) .cse2 .cse3))) InVars {main_~x~0=v_main_~x~0_141, main_~y~0=v_main_~y~0_98} OutVars{main_~x~0=v_main_~x~0_140, main_~y~0=v_main_~y~0_97} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {2412#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:54:32,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {2412#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [79] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {2412#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:54:32,202 INFO L290 TraceCheckUtils]: 10: Hoare triple {2412#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2428#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-15 06:54:32,203 INFO L290 TraceCheckUtils]: 11: Hoare triple {2428#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2432#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-15 06:54:32,204 INFO L290 TraceCheckUtils]: 12: Hoare triple {2432#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2436#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-15 06:54:32,205 INFO L290 TraceCheckUtils]: 13: Hoare triple {2436#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2440#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-15 06:54:32,206 INFO L290 TraceCheckUtils]: 14: Hoare triple {2440#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2444#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-15 06:54:32,206 INFO L290 TraceCheckUtils]: 15: Hoare triple {2444#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} assume !(~y~0 > ~z~0); {2380#false} is VALID [2022-04-15 06:54:32,206 INFO L272 TraceCheckUtils]: 16: Hoare triple {2380#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {2380#false} is VALID [2022-04-15 06:54:32,206 INFO L290 TraceCheckUtils]: 17: Hoare triple {2380#false} ~cond := #in~cond; {2380#false} is VALID [2022-04-15 06:54:32,206 INFO L290 TraceCheckUtils]: 18: Hoare triple {2380#false} assume 0 == ~cond; {2380#false} is VALID [2022-04-15 06:54:32,207 INFO L290 TraceCheckUtils]: 19: Hoare triple {2380#false} assume !false; {2380#false} is VALID [2022-04-15 06:54:32,207 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:54:32,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:54:49,065 INFO L290 TraceCheckUtils]: 19: Hoare triple {2380#false} assume !false; {2380#false} is VALID [2022-04-15 06:54:49,065 INFO L290 TraceCheckUtils]: 18: Hoare triple {2380#false} assume 0 == ~cond; {2380#false} is VALID [2022-04-15 06:54:49,065 INFO L290 TraceCheckUtils]: 17: Hoare triple {2380#false} ~cond := #in~cond; {2380#false} is VALID [2022-04-15 06:54:49,065 INFO L272 TraceCheckUtils]: 16: Hoare triple {2380#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {2380#false} is VALID [2022-04-15 06:54:49,066 INFO L290 TraceCheckUtils]: 15: Hoare triple {2472#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {2380#false} is VALID [2022-04-15 06:54:49,066 INFO L290 TraceCheckUtils]: 14: Hoare triple {2476#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2472#(< main_~z~0 main_~y~0)} is VALID [2022-04-15 06:54:49,068 INFO L290 TraceCheckUtils]: 13: Hoare triple {2480#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2476#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-15 06:54:49,068 INFO L290 TraceCheckUtils]: 12: Hoare triple {2484#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2480#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-15 06:54:49,069 INFO L290 TraceCheckUtils]: 11: Hoare triple {2488#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2484#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-15 06:54:49,070 INFO L290 TraceCheckUtils]: 10: Hoare triple {2492#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2488#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-15 06:54:49,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {2492#(< (+ 5 main_~z~0) main_~y~0)} [79] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {2492#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-15 06:54:49,072 INFO L290 TraceCheckUtils]: 8: Hoare triple {2492#(< (+ 5 main_~z~0) main_~y~0)} [82] L10-2-->L17-1_primed: Formula: (let ((.cse1 (<= 50000 v_main_~x~0_141)) (.cse2 (= v_main_~x~0_141 v_main_~x~0_140)) (.cse3 (= v_main_~y~0_98 v_main_~y~0_97))) (or (let ((.cse0 (div (+ v_main_~x~0_141 (* v_main_~x~0_140 (- 1))) (- 2)))) (and (= v_main_~y~0_97 (+ v_main_~y~0_98 (* 2 .cse0))) (< 0 .cse0) (= (mod (+ v_main_~x~0_141 v_main_~x~0_140) 2) 0) (< .cse0 (+ (div (+ (* v_main_~x~0_141 (- 1)) 999999) 2) 2)) .cse1)) (and .cse2 .cse3) (and (or (not .cse1) (not (< v_main_~x~0_141 1000000))) .cse2 .cse3))) InVars {main_~x~0=v_main_~x~0_141, main_~y~0=v_main_~y~0_98} OutVars{main_~x~0=v_main_~x~0_140, main_~y~0=v_main_~y~0_97} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {2492#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-15 06:54:49,072 INFO L290 TraceCheckUtils]: 7: Hoare triple {2492#(< (+ 5 main_~z~0) main_~y~0)} [81] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2492#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-15 06:54:49,073 INFO L290 TraceCheckUtils]: 6: Hoare triple {2492#(< (+ 5 main_~z~0) main_~y~0)} [80] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_139 v_main_~x~0_138)) (.cse1 (= |v_main_#t~post4_39| |v_main_#t~post4_38|))) (or (and (< v_main_~x~0_139 v_main_~x~0_138) (< v_main_~x~0_138 50001)) (and .cse0 .cse1 (<= 50000 v_main_~x~0_139)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_139, main_#t~post4=|v_main_#t~post4_39|} OutVars{main_~x~0=v_main_~x~0_138, main_#t~post4=|v_main_#t~post4_38|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2492#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-15 06:54:49,073 INFO L290 TraceCheckUtils]: 5: Hoare triple {2379#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {2492#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-15 06:54:49,073 INFO L272 TraceCheckUtils]: 4: Hoare triple {2379#true} call #t~ret7 := main(); {2379#true} is VALID [2022-04-15 06:54:49,074 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2379#true} {2379#true} #52#return; {2379#true} is VALID [2022-04-15 06:54:49,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {2379#true} assume true; {2379#true} is VALID [2022-04-15 06:54:49,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {2379#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {2379#true} is VALID [2022-04-15 06:54:49,074 INFO L272 TraceCheckUtils]: 0: Hoare triple {2379#true} call ULTIMATE.init(); {2379#true} is VALID [2022-04-15 06:54:49,074 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:54:49,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732943262] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:54:49,075 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:54:49,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 24 [2022-04-15 06:54:49,447 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:54:49,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1086733187] [2022-04-15 06:54:49,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1086733187] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:54:49,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:54:49,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 06:54:49,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959592242] [2022-04-15 06:54:49,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:54:49,448 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 18 states have internal predecessors, (31), 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 35 [2022-04-15 06:54:49,448 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:54:49,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 18 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:49,476 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:49,476 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 06:54:49,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:49,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 06:54:49,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=755, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 06:54:49,477 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 18 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:50,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:50,558 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2022-04-15 06:54:50,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 06:54:50,559 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 18 states have internal predecessors, (31), 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 35 [2022-04-15 06:54:50,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:54:50,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 18 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:50,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 49 transitions. [2022-04-15 06:54:50,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 18 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:50,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 49 transitions. [2022-04-15 06:54:50,561 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 49 transitions. [2022-04-15 06:54:50,606 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:50,607 INFO L225 Difference]: With dead ends: 78 [2022-04-15 06:54:50,607 INFO L226 Difference]: Without dead ends: 52 [2022-04-15 06:54:50,608 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=541, Invalid=1351, Unknown=0, NotChecked=0, Total=1892 [2022-04-15 06:54:50,609 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 20 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:54:50,609 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 80 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 06:54:50,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-15 06:54:50,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-15 06:54:50,723 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:54:50,723 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:50,723 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:50,723 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:50,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:50,725 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-04-15 06:54:50,725 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2022-04-15 06:54:50,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:50,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:50,725 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 states have internal predecessors, (52), 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 52 states. [2022-04-15 06:54:50,725 INFO L87 Difference]: Start difference. First operand has 52 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 states have internal predecessors, (52), 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 52 states. [2022-04-15 06:54:50,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:50,727 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-04-15 06:54:50,727 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2022-04-15 06:54:50,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:50,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:50,727 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:54:50,727 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:54:50,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:50,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2022-04-15 06:54:50,729 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 35 [2022-04-15 06:54:50,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:54:50,729 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2022-04-15 06:54:50,729 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 18 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:50,729 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 56 transitions. [2022-04-15 06:54:50,789 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:50,789 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2022-04-15 06:54:50,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 06:54:50,789 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:54:50,790 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:54:50,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-15 06:54:50,991 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:54:50,992 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:54:50,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:54:50,992 INFO L85 PathProgramCache]: Analyzing trace with hash -802576804, now seen corresponding path program 7 times [2022-04-15 06:54:50,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:50,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1819294016] [2022-04-15 06:54:53,145 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:53,467 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:53,468 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:54:53,471 INFO L85 PathProgramCache]: Analyzing trace with hash -640907198, now seen corresponding path program 1 times [2022-04-15 06:54:53,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:54:53,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086097950] [2022-04-15 06:54:53,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:53,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:54:53,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:53,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:54:53,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:53,609 INFO L290 TraceCheckUtils]: 0: Hoare triple {2930#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {2919#true} is VALID [2022-04-15 06:54:53,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {2919#true} assume true; {2919#true} is VALID [2022-04-15 06:54:53,610 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2919#true} {2919#true} #52#return; {2919#true} is VALID [2022-04-15 06:54:53,610 INFO L272 TraceCheckUtils]: 0: Hoare triple {2919#true} call ULTIMATE.init(); {2930#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:54:53,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {2930#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {2919#true} is VALID [2022-04-15 06:54:53,611 INFO L290 TraceCheckUtils]: 2: Hoare triple {2919#true} assume true; {2919#true} is VALID [2022-04-15 06:54:53,611 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2919#true} {2919#true} #52#return; {2919#true} is VALID [2022-04-15 06:54:53,611 INFO L272 TraceCheckUtils]: 4: Hoare triple {2919#true} call #t~ret7 := main(); {2919#true} is VALID [2022-04-15 06:54:53,612 INFO L290 TraceCheckUtils]: 5: Hoare triple {2919#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {2924#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:54:53,612 INFO L290 TraceCheckUtils]: 6: Hoare triple {2924#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [84] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_169 v_main_~x~0_168)) (.cse1 (= |v_main_#t~post4_45| |v_main_#t~post4_44|))) (or (and .cse0 .cse1) (and (< v_main_~x~0_168 50001) (< v_main_~x~0_169 v_main_~x~0_168)) (and (not (< v_main_~x~0_169 50000)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_169, main_#t~post4=|v_main_#t~post4_45|} OutVars{main_~x~0=v_main_~x~0_168, main_#t~post4=|v_main_#t~post4_44|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2924#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:54:53,613 INFO L290 TraceCheckUtils]: 7: Hoare triple {2924#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [85] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2924#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:54:53,615 INFO L290 TraceCheckUtils]: 8: Hoare triple {2924#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [86] L10-2-->L17-1_primed: Formula: (let ((.cse2 (= v_main_~x~0_171 v_main_~x~0_170)) (.cse3 (= v_main_~y~0_125 v_main_~y~0_124)) (.cse1 (<= 50000 v_main_~x~0_171))) (or (let ((.cse0 (div (+ (* (- 1) v_main_~y~0_124) v_main_~y~0_125) (- 2)))) (and (= v_main_~x~0_170 (+ v_main_~x~0_171 (* 2 .cse0))) (= (mod (+ v_main_~y~0_125 v_main_~y~0_124) 2) 0) .cse1 (< 0 .cse0) (< .cse0 (+ (div (+ 999999 (* v_main_~x~0_171 (- 1))) 2) 2)))) (and .cse2 .cse3) (and .cse2 .cse3 (or (not .cse1) (not (< v_main_~x~0_171 1000000)))))) InVars {main_~x~0=v_main_~x~0_171, main_~y~0=v_main_~y~0_125} OutVars{main_~x~0=v_main_~x~0_170, main_~y~0=v_main_~y~0_124} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {2924#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:54:53,615 INFO L290 TraceCheckUtils]: 9: Hoare triple {2924#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [83] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {2924#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:54:53,616 INFO L290 TraceCheckUtils]: 10: Hoare triple {2924#(and (= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2925#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-15 06:54:53,617 INFO L290 TraceCheckUtils]: 11: Hoare triple {2925#(and (= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2926#(and (<= 49998 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 06:54:53,617 INFO L290 TraceCheckUtils]: 12: Hoare triple {2926#(and (<= 49998 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2927#(and (= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-15 06:54:53,618 INFO L290 TraceCheckUtils]: 13: Hoare triple {2927#(and (= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2928#(and (= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-15 06:54:53,619 INFO L290 TraceCheckUtils]: 14: Hoare triple {2928#(and (= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2929#(and (= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-15 06:54:53,620 INFO L290 TraceCheckUtils]: 15: Hoare triple {2929#(and (= main_~z~0 0) (<= 49995 main_~y~0))} assume !(~y~0 > ~z~0); {2920#false} is VALID [2022-04-15 06:54:53,620 INFO L272 TraceCheckUtils]: 16: Hoare triple {2920#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {2920#false} is VALID [2022-04-15 06:54:53,620 INFO L290 TraceCheckUtils]: 17: Hoare triple {2920#false} ~cond := #in~cond; {2920#false} is VALID [2022-04-15 06:54:53,620 INFO L290 TraceCheckUtils]: 18: Hoare triple {2920#false} assume 0 == ~cond; {2920#false} is VALID [2022-04-15 06:54:53,620 INFO L290 TraceCheckUtils]: 19: Hoare triple {2920#false} assume !false; {2920#false} is VALID [2022-04-15 06:54:53,620 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:54:53,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:54:53,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086097950] [2022-04-15 06:54:53,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086097950] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:54:53,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987055314] [2022-04-15 06:54:53,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:53,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:54:53,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:54:53,624 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:54:53,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-15 06:54:53,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:53,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:54:53,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:53,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:55:17,160 INFO L272 TraceCheckUtils]: 0: Hoare triple {2919#true} call ULTIMATE.init(); {2919#true} is VALID [2022-04-15 06:55:17,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {2919#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {2919#true} is VALID [2022-04-15 06:55:17,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {2919#true} assume true; {2919#true} is VALID [2022-04-15 06:55:17,161 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2919#true} {2919#true} #52#return; {2919#true} is VALID [2022-04-15 06:55:17,161 INFO L272 TraceCheckUtils]: 4: Hoare triple {2919#true} call #t~ret7 := main(); {2919#true} is VALID [2022-04-15 06:55:17,161 INFO L290 TraceCheckUtils]: 5: Hoare triple {2919#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {2949#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:55:17,162 INFO L290 TraceCheckUtils]: 6: Hoare triple {2949#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [84] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_169 v_main_~x~0_168)) (.cse1 (= |v_main_#t~post4_45| |v_main_#t~post4_44|))) (or (and .cse0 .cse1) (and (< v_main_~x~0_168 50001) (< v_main_~x~0_169 v_main_~x~0_168)) (and (not (< v_main_~x~0_169 50000)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_169, main_#t~post4=|v_main_#t~post4_45|} OutVars{main_~x~0=v_main_~x~0_168, main_#t~post4=|v_main_#t~post4_44|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2949#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:55:17,162 INFO L290 TraceCheckUtils]: 7: Hoare triple {2949#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [85] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2949#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:55:17,164 INFO L290 TraceCheckUtils]: 8: Hoare triple {2949#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [86] L10-2-->L17-1_primed: Formula: (let ((.cse2 (= v_main_~x~0_171 v_main_~x~0_170)) (.cse3 (= v_main_~y~0_125 v_main_~y~0_124)) (.cse1 (<= 50000 v_main_~x~0_171))) (or (let ((.cse0 (div (+ (* (- 1) v_main_~y~0_124) v_main_~y~0_125) (- 2)))) (and (= v_main_~x~0_170 (+ v_main_~x~0_171 (* 2 .cse0))) (= (mod (+ v_main_~y~0_125 v_main_~y~0_124) 2) 0) .cse1 (< 0 .cse0) (< .cse0 (+ (div (+ 999999 (* v_main_~x~0_171 (- 1))) 2) 2)))) (and .cse2 .cse3) (and .cse2 .cse3 (or (not .cse1) (not (< v_main_~x~0_171 1000000)))))) InVars {main_~x~0=v_main_~x~0_171, main_~y~0=v_main_~y~0_125} OutVars{main_~x~0=v_main_~x~0_170, main_~y~0=v_main_~y~0_124} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {2949#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:55:17,165 INFO L290 TraceCheckUtils]: 9: Hoare triple {2949#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [83] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {2949#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:55:17,166 INFO L290 TraceCheckUtils]: 10: Hoare triple {2949#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2965#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-15 06:55:17,166 INFO L290 TraceCheckUtils]: 11: Hoare triple {2965#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2969#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-15 06:55:17,167 INFO L290 TraceCheckUtils]: 12: Hoare triple {2969#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2973#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-15 06:55:17,168 INFO L290 TraceCheckUtils]: 13: Hoare triple {2973#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2977#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-15 06:55:17,169 INFO L290 TraceCheckUtils]: 14: Hoare triple {2977#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2981#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-15 06:55:17,169 INFO L290 TraceCheckUtils]: 15: Hoare triple {2981#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} assume !(~y~0 > ~z~0); {2920#false} is VALID [2022-04-15 06:55:17,170 INFO L272 TraceCheckUtils]: 16: Hoare triple {2920#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {2920#false} is VALID [2022-04-15 06:55:17,170 INFO L290 TraceCheckUtils]: 17: Hoare triple {2920#false} ~cond := #in~cond; {2920#false} is VALID [2022-04-15 06:55:17,170 INFO L290 TraceCheckUtils]: 18: Hoare triple {2920#false} assume 0 == ~cond; {2920#false} is VALID [2022-04-15 06:55:17,170 INFO L290 TraceCheckUtils]: 19: Hoare triple {2920#false} assume !false; {2920#false} is VALID [2022-04-15 06:55:17,170 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:55:17,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:55:38,461 INFO L290 TraceCheckUtils]: 19: Hoare triple {2920#false} assume !false; {2920#false} is VALID [2022-04-15 06:55:38,461 INFO L290 TraceCheckUtils]: 18: Hoare triple {2920#false} assume 0 == ~cond; {2920#false} is VALID [2022-04-15 06:55:38,461 INFO L290 TraceCheckUtils]: 17: Hoare triple {2920#false} ~cond := #in~cond; {2920#false} is VALID [2022-04-15 06:55:38,462 INFO L272 TraceCheckUtils]: 16: Hoare triple {2920#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {2920#false} is VALID [2022-04-15 06:55:38,462 INFO L290 TraceCheckUtils]: 15: Hoare triple {3009#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {2920#false} is VALID [2022-04-15 06:55:38,463 INFO L290 TraceCheckUtils]: 14: Hoare triple {3013#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3009#(< main_~z~0 main_~y~0)} is VALID [2022-04-15 06:55:38,463 INFO L290 TraceCheckUtils]: 13: Hoare triple {3017#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3013#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-15 06:55:38,464 INFO L290 TraceCheckUtils]: 12: Hoare triple {3021#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3017#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-15 06:55:38,464 INFO L290 TraceCheckUtils]: 11: Hoare triple {3025#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3021#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-15 06:55:38,465 INFO L290 TraceCheckUtils]: 10: Hoare triple {3029#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3025#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-15 06:55:38,466 INFO L290 TraceCheckUtils]: 9: Hoare triple {3029#(< (+ 5 main_~z~0) main_~y~0)} [83] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {3029#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-15 06:55:38,467 INFO L290 TraceCheckUtils]: 8: Hoare triple {3029#(< (+ 5 main_~z~0) main_~y~0)} [86] L10-2-->L17-1_primed: Formula: (let ((.cse2 (= v_main_~x~0_171 v_main_~x~0_170)) (.cse3 (= v_main_~y~0_125 v_main_~y~0_124)) (.cse1 (<= 50000 v_main_~x~0_171))) (or (let ((.cse0 (div (+ (* (- 1) v_main_~y~0_124) v_main_~y~0_125) (- 2)))) (and (= v_main_~x~0_170 (+ v_main_~x~0_171 (* 2 .cse0))) (= (mod (+ v_main_~y~0_125 v_main_~y~0_124) 2) 0) .cse1 (< 0 .cse0) (< .cse0 (+ (div (+ 999999 (* v_main_~x~0_171 (- 1))) 2) 2)))) (and .cse2 .cse3) (and .cse2 .cse3 (or (not .cse1) (not (< v_main_~x~0_171 1000000)))))) InVars {main_~x~0=v_main_~x~0_171, main_~y~0=v_main_~y~0_125} OutVars{main_~x~0=v_main_~x~0_170, main_~y~0=v_main_~y~0_124} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {3029#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-15 06:55:38,467 INFO L290 TraceCheckUtils]: 7: Hoare triple {3029#(< (+ 5 main_~z~0) main_~y~0)} [85] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3029#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-15 06:55:38,467 INFO L290 TraceCheckUtils]: 6: Hoare triple {3029#(< (+ 5 main_~z~0) main_~y~0)} [84] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_169 v_main_~x~0_168)) (.cse1 (= |v_main_#t~post4_45| |v_main_#t~post4_44|))) (or (and .cse0 .cse1) (and (< v_main_~x~0_168 50001) (< v_main_~x~0_169 v_main_~x~0_168)) (and (not (< v_main_~x~0_169 50000)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_169, main_#t~post4=|v_main_#t~post4_45|} OutVars{main_~x~0=v_main_~x~0_168, main_#t~post4=|v_main_#t~post4_44|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3029#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-15 06:55:38,468 INFO L290 TraceCheckUtils]: 5: Hoare triple {2919#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {3029#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-15 06:55:38,468 INFO L272 TraceCheckUtils]: 4: Hoare triple {2919#true} call #t~ret7 := main(); {2919#true} is VALID [2022-04-15 06:55:38,468 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2919#true} {2919#true} #52#return; {2919#true} is VALID [2022-04-15 06:55:38,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {2919#true} assume true; {2919#true} is VALID [2022-04-15 06:55:38,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {2919#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {2919#true} is VALID [2022-04-15 06:55:38,468 INFO L272 TraceCheckUtils]: 0: Hoare triple {2919#true} call ULTIMATE.init(); {2919#true} is VALID [2022-04-15 06:55:38,469 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:55:38,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987055314] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:55:38,469 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:55:38,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2022-04-15 06:55:38,838 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:55:38,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1819294016] [2022-04-15 06:55:38,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1819294016] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:55:38,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:55:38,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 06:55:38,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841645355] [2022-04-15 06:55:38,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:55:38,839 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 states have internal predecessors, (33), 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 37 [2022-04-15 06:55:38,839 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:55:38,839 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:38,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:38,874 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 06:55:38,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:38,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 06:55:38,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=407, Invalid=585, Unknown=0, NotChecked=0, Total=992 [2022-04-15 06:55:38,875 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:39,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:39,875 INFO L93 Difference]: Finished difference Result 87 states and 103 transitions. [2022-04-15 06:55:39,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 06:55:39,875 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 states have internal predecessors, (33), 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 37 [2022-04-15 06:55:39,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:55:39,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:39,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 63 transitions. [2022-04-15 06:55:39,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:39,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 63 transitions. [2022-04-15 06:55:39,878 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 63 transitions. [2022-04-15 06:55:39,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:39,934 INFO L225 Difference]: With dead ends: 87 [2022-04-15 06:55:39,934 INFO L226 Difference]: Without dead ends: 61 [2022-04-15 06:55:39,934 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 624 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=846, Invalid=1506, Unknown=0, NotChecked=0, Total=2352 [2022-04-15 06:55:39,935 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 44 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:55:39,935 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 34 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 06:55:39,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-15 06:55:40,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 43. [2022-04-15 06:55:40,023 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:55:40,023 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 43 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:40,023 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 43 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:40,023 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 43 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:40,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:40,025 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2022-04-15 06:55:40,025 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2022-04-15 06:55:40,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:55:40,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:55:40,027 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 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 61 states. [2022-04-15 06:55:40,027 INFO L87 Difference]: Start difference. First operand has 43 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 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 61 states. [2022-04-15 06:55:40,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:40,028 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2022-04-15 06:55:40,028 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2022-04-15 06:55:40,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:55:40,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:55:40,029 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:55:40,029 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:55:40,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:40,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2022-04-15 06:55:40,030 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 37 [2022-04-15 06:55:40,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:55:40,030 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2022-04-15 06:55:40,030 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:40,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 46 transitions. [2022-04-15 06:55:40,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:40,078 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2022-04-15 06:55:40,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-15 06:55:40,078 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:55:40,079 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:55:40,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-15 06:55:40,283 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:55:40,283 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:55:40,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:55:40,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1080568111, now seen corresponding path program 8 times [2022-04-15 06:55:40,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:40,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [844674608] [2022-04-15 06:55:43,064 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:55:43,119 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:43,414 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:43,415 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:55:43,418 INFO L85 PathProgramCache]: Analyzing trace with hash 697975393, now seen corresponding path program 1 times [2022-04-15 06:55:43,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:55:43,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834809387] [2022-04-15 06:55:43,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:55:43,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:55:43,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:43,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:55:43,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:43,638 INFO L290 TraceCheckUtils]: 0: Hoare triple {3504#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {3489#true} is VALID [2022-04-15 06:55:43,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {3489#true} assume true; {3489#true} is VALID [2022-04-15 06:55:43,638 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3489#true} {3489#true} #52#return; {3489#true} is VALID [2022-04-15 06:55:43,639 INFO L272 TraceCheckUtils]: 0: Hoare triple {3489#true} call ULTIMATE.init(); {3504#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:55:43,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {3504#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {3489#true} is VALID [2022-04-15 06:55:43,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {3489#true} assume true; {3489#true} is VALID [2022-04-15 06:55:43,639 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3489#true} {3489#true} #52#return; {3489#true} is VALID [2022-04-15 06:55:43,639 INFO L272 TraceCheckUtils]: 4: Hoare triple {3489#true} call #t~ret7 := main(); {3489#true} is VALID [2022-04-15 06:55:43,640 INFO L290 TraceCheckUtils]: 5: Hoare triple {3489#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {3494#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:55:43,641 INFO L290 TraceCheckUtils]: 6: Hoare triple {3494#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} [88] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_51| |v_main_#t~post4_50|)) (.cse1 (= v_main_~x~0_200 v_main_~x~0_199))) (or (and (< v_main_~x~0_199 50001) (< v_main_~x~0_200 v_main_~x~0_199)) (and .cse0 .cse1) (and .cse0 .cse1 (not (< v_main_~x~0_200 50000))))) InVars {main_~x~0=v_main_~x~0_200, main_#t~post4=|v_main_#t~post4_51|} OutVars{main_~x~0=v_main_~x~0_199, main_#t~post4=|v_main_#t~post4_50|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3495#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} is VALID [2022-04-15 06:55:43,641 INFO L290 TraceCheckUtils]: 7: Hoare triple {3495#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} [89] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3495#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} is VALID [2022-04-15 06:55:43,643 INFO L290 TraceCheckUtils]: 8: Hoare triple {3495#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} [90] L10-2-->L17-1_primed: Formula: (let ((.cse1 (<= 50000 v_main_~x~0_202)) (.cse2 (= v_main_~x~0_202 v_main_~x~0_201)) (.cse3 (= v_main_~y~0_153 v_main_~y~0_152))) (or (let ((.cse0 (div (+ v_main_~x~0_202 (* v_main_~x~0_201 (- 1))) (- 2)))) (and (< 0 .cse0) (= v_main_~y~0_152 (+ v_main_~y~0_153 (* 2 .cse0))) (= (mod (+ v_main_~x~0_202 v_main_~x~0_201) 2) 0) .cse1 (< .cse0 (+ (div (+ 999999 (* v_main_~x~0_202 (- 1))) 2) 2)))) (and .cse2 (or (not .cse1) (not (< v_main_~x~0_202 1000000))) .cse3) (and .cse2 .cse3))) InVars {main_~x~0=v_main_~x~0_202, main_~y~0=v_main_~y~0_153} OutVars{main_~x~0=v_main_~x~0_201, main_~y~0=v_main_~y~0_152} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {3496#(or (and (= main_~z~0 0) (<= main_~x~0 main_~y~0)) (<= main_~x~0 50000))} is VALID [2022-04-15 06:55:43,644 INFO L290 TraceCheckUtils]: 9: Hoare triple {3496#(or (and (= main_~z~0 0) (<= main_~x~0 main_~y~0)) (<= main_~x~0 50000))} [87] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {3497#(and (= main_~z~0 0) (<= 1000000 main_~y~0))} is VALID [2022-04-15 06:55:43,645 INFO L290 TraceCheckUtils]: 10: Hoare triple {3497#(and (= main_~z~0 0) (<= 1000000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3498#(and (= main_~z~0 0) (<= 999999 main_~y~0))} is VALID [2022-04-15 06:55:43,646 INFO L290 TraceCheckUtils]: 11: Hoare triple {3498#(and (= main_~z~0 0) (<= 999999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3499#(and (= main_~z~0 0) (<= 999998 main_~y~0))} is VALID [2022-04-15 06:55:43,646 INFO L290 TraceCheckUtils]: 12: Hoare triple {3499#(and (= main_~z~0 0) (<= 999998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3500#(and (= main_~z~0 0) (<= 999997 main_~y~0))} is VALID [2022-04-15 06:55:43,649 INFO L290 TraceCheckUtils]: 13: Hoare triple {3500#(and (= main_~z~0 0) (<= 999997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3501#(and (<= 999996 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 06:55:43,650 INFO L290 TraceCheckUtils]: 14: Hoare triple {3501#(and (<= 999996 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3502#(and (= main_~z~0 0) (<= 999995 main_~y~0))} is VALID [2022-04-15 06:55:43,650 INFO L290 TraceCheckUtils]: 15: Hoare triple {3502#(and (= main_~z~0 0) (<= 999995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3503#(and (= main_~z~0 0) (<= 999994 main_~y~0))} is VALID [2022-04-15 06:55:43,651 INFO L290 TraceCheckUtils]: 16: Hoare triple {3503#(and (= main_~z~0 0) (<= 999994 main_~y~0))} assume !(~y~0 > ~z~0); {3490#false} is VALID [2022-04-15 06:55:43,651 INFO L272 TraceCheckUtils]: 17: Hoare triple {3490#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {3490#false} is VALID [2022-04-15 06:55:43,651 INFO L290 TraceCheckUtils]: 18: Hoare triple {3490#false} ~cond := #in~cond; {3490#false} is VALID [2022-04-15 06:55:43,651 INFO L290 TraceCheckUtils]: 19: Hoare triple {3490#false} assume 0 == ~cond; {3490#false} is VALID [2022-04-15 06:55:43,651 INFO L290 TraceCheckUtils]: 20: Hoare triple {3490#false} assume !false; {3490#false} is VALID [2022-04-15 06:55:43,652 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:55:43,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:55:43,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834809387] [2022-04-15 06:55:43,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834809387] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:55:43,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839763207] [2022-04-15 06:55:43,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:55:43,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:55:43,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:55:43,656 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:55:43,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-15 06:55:43,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:43,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 06:55:43,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:43,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:56:04,041 INFO L272 TraceCheckUtils]: 0: Hoare triple {3489#true} call ULTIMATE.init(); {3489#true} is VALID [2022-04-15 06:56:04,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {3489#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {3489#true} is VALID [2022-04-15 06:56:04,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {3489#true} assume true; {3489#true} is VALID [2022-04-15 06:56:04,042 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3489#true} {3489#true} #52#return; {3489#true} is VALID [2022-04-15 06:56:04,042 INFO L272 TraceCheckUtils]: 4: Hoare triple {3489#true} call #t~ret7 := main(); {3489#true} is VALID [2022-04-15 06:56:04,042 INFO L290 TraceCheckUtils]: 5: Hoare triple {3489#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {3523#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:56:04,043 INFO L290 TraceCheckUtils]: 6: Hoare triple {3523#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [88] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_51| |v_main_#t~post4_50|)) (.cse1 (= v_main_~x~0_200 v_main_~x~0_199))) (or (and (< v_main_~x~0_199 50001) (< v_main_~x~0_200 v_main_~x~0_199)) (and .cse0 .cse1) (and .cse0 .cse1 (not (< v_main_~x~0_200 50000))))) InVars {main_~x~0=v_main_~x~0_200, main_#t~post4=|v_main_#t~post4_51|} OutVars{main_~x~0=v_main_~x~0_199, main_#t~post4=|v_main_#t~post4_50|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3523#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:56:04,043 INFO L290 TraceCheckUtils]: 7: Hoare triple {3523#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [89] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3523#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:56:04,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {3523#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [90] L10-2-->L17-1_primed: Formula: (let ((.cse1 (<= 50000 v_main_~x~0_202)) (.cse2 (= v_main_~x~0_202 v_main_~x~0_201)) (.cse3 (= v_main_~y~0_153 v_main_~y~0_152))) (or (let ((.cse0 (div (+ v_main_~x~0_202 (* v_main_~x~0_201 (- 1))) (- 2)))) (and (< 0 .cse0) (= v_main_~y~0_152 (+ v_main_~y~0_153 (* 2 .cse0))) (= (mod (+ v_main_~x~0_202 v_main_~x~0_201) 2) 0) .cse1 (< .cse0 (+ (div (+ 999999 (* v_main_~x~0_202 (- 1))) 2) 2)))) (and .cse2 (or (not .cse1) (not (< v_main_~x~0_202 1000000))) .cse3) (and .cse2 .cse3))) InVars {main_~x~0=v_main_~x~0_202, main_~y~0=v_main_~y~0_153} OutVars{main_~x~0=v_main_~x~0_201, main_~y~0=v_main_~y~0_152} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {3523#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:56:04,045 INFO L290 TraceCheckUtils]: 9: Hoare triple {3523#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [87] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {3523#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:56:04,045 INFO L290 TraceCheckUtils]: 10: Hoare triple {3523#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3539#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-15 06:56:04,046 INFO L290 TraceCheckUtils]: 11: Hoare triple {3539#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3543#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-15 06:56:04,047 INFO L290 TraceCheckUtils]: 12: Hoare triple {3543#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3547#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-15 06:56:04,047 INFO L290 TraceCheckUtils]: 13: Hoare triple {3547#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3551#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-15 06:56:04,048 INFO L290 TraceCheckUtils]: 14: Hoare triple {3551#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3555#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-15 06:56:04,048 INFO L290 TraceCheckUtils]: 15: Hoare triple {3555#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3559#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-15 06:56:04,049 INFO L290 TraceCheckUtils]: 16: Hoare triple {3559#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} assume !(~y~0 > ~z~0); {3490#false} is VALID [2022-04-15 06:56:04,049 INFO L272 TraceCheckUtils]: 17: Hoare triple {3490#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {3490#false} is VALID [2022-04-15 06:56:04,049 INFO L290 TraceCheckUtils]: 18: Hoare triple {3490#false} ~cond := #in~cond; {3490#false} is VALID [2022-04-15 06:56:04,049 INFO L290 TraceCheckUtils]: 19: Hoare triple {3490#false} assume 0 == ~cond; {3490#false} is VALID [2022-04-15 06:56:04,049 INFO L290 TraceCheckUtils]: 20: Hoare triple {3490#false} assume !false; {3490#false} is VALID [2022-04-15 06:56:04,049 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:56:04,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:56:20,104 INFO L290 TraceCheckUtils]: 20: Hoare triple {3490#false} assume !false; {3490#false} is VALID [2022-04-15 06:56:20,105 INFO L290 TraceCheckUtils]: 19: Hoare triple {3490#false} assume 0 == ~cond; {3490#false} is VALID [2022-04-15 06:56:20,105 INFO L290 TraceCheckUtils]: 18: Hoare triple {3490#false} ~cond := #in~cond; {3490#false} is VALID [2022-04-15 06:56:20,105 INFO L272 TraceCheckUtils]: 17: Hoare triple {3490#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {3490#false} is VALID [2022-04-15 06:56:20,105 INFO L290 TraceCheckUtils]: 16: Hoare triple {3587#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {3490#false} is VALID [2022-04-15 06:56:20,106 INFO L290 TraceCheckUtils]: 15: Hoare triple {3591#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3587#(< main_~z~0 main_~y~0)} is VALID [2022-04-15 06:56:20,107 INFO L290 TraceCheckUtils]: 14: Hoare triple {3595#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3591#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-15 06:56:20,108 INFO L290 TraceCheckUtils]: 13: Hoare triple {3599#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3595#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-15 06:56:20,108 INFO L290 TraceCheckUtils]: 12: Hoare triple {3603#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3599#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-15 06:56:20,109 INFO L290 TraceCheckUtils]: 11: Hoare triple {3607#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3603#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-15 06:56:20,110 INFO L290 TraceCheckUtils]: 10: Hoare triple {3611#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3607#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-15 06:56:20,110 INFO L290 TraceCheckUtils]: 9: Hoare triple {3611#(< (+ main_~z~0 6) main_~y~0)} [87] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {3611#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-15 06:56:20,112 INFO L290 TraceCheckUtils]: 8: Hoare triple {3611#(< (+ main_~z~0 6) main_~y~0)} [90] L10-2-->L17-1_primed: Formula: (let ((.cse1 (<= 50000 v_main_~x~0_202)) (.cse2 (= v_main_~x~0_202 v_main_~x~0_201)) (.cse3 (= v_main_~y~0_153 v_main_~y~0_152))) (or (let ((.cse0 (div (+ v_main_~x~0_202 (* v_main_~x~0_201 (- 1))) (- 2)))) (and (< 0 .cse0) (= v_main_~y~0_152 (+ v_main_~y~0_153 (* 2 .cse0))) (= (mod (+ v_main_~x~0_202 v_main_~x~0_201) 2) 0) .cse1 (< .cse0 (+ (div (+ 999999 (* v_main_~x~0_202 (- 1))) 2) 2)))) (and .cse2 (or (not .cse1) (not (< v_main_~x~0_202 1000000))) .cse3) (and .cse2 .cse3))) InVars {main_~x~0=v_main_~x~0_202, main_~y~0=v_main_~y~0_153} OutVars{main_~x~0=v_main_~x~0_201, main_~y~0=v_main_~y~0_152} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {3611#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-15 06:56:20,113 INFO L290 TraceCheckUtils]: 7: Hoare triple {3611#(< (+ main_~z~0 6) main_~y~0)} [89] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3611#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-15 06:56:20,113 INFO L290 TraceCheckUtils]: 6: Hoare triple {3611#(< (+ main_~z~0 6) main_~y~0)} [88] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_51| |v_main_#t~post4_50|)) (.cse1 (= v_main_~x~0_200 v_main_~x~0_199))) (or (and (< v_main_~x~0_199 50001) (< v_main_~x~0_200 v_main_~x~0_199)) (and .cse0 .cse1) (and .cse0 .cse1 (not (< v_main_~x~0_200 50000))))) InVars {main_~x~0=v_main_~x~0_200, main_#t~post4=|v_main_#t~post4_51|} OutVars{main_~x~0=v_main_~x~0_199, main_#t~post4=|v_main_#t~post4_50|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3611#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-15 06:56:20,114 INFO L290 TraceCheckUtils]: 5: Hoare triple {3489#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {3611#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-15 06:56:20,114 INFO L272 TraceCheckUtils]: 4: Hoare triple {3489#true} call #t~ret7 := main(); {3489#true} is VALID [2022-04-15 06:56:20,114 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3489#true} {3489#true} #52#return; {3489#true} is VALID [2022-04-15 06:56:20,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {3489#true} assume true; {3489#true} is VALID [2022-04-15 06:56:20,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {3489#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {3489#true} is VALID [2022-04-15 06:56:20,114 INFO L272 TraceCheckUtils]: 0: Hoare triple {3489#true} call ULTIMATE.init(); {3489#true} is VALID [2022-04-15 06:56:20,115 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:56:20,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839763207] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:56:20,115 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:56:20,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 27 [2022-04-15 06:56:20,647 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:56:20,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [844674608] [2022-04-15 06:56:20,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [844674608] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:56:20,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:56:20,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-15 06:56:20,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464956460] [2022-04-15 06:56:20,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:56:20,648 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 22 states have internal predecessors, (38), 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 42 [2022-04-15 06:56:20,648 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:56:20,649 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 22 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:20,680 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:56:20,681 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-15 06:56:20,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:56:20,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-15 06:56:20,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=503, Invalid=1057, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 06:56:20,682 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand has 23 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 22 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:22,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:22,247 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2022-04-15 06:56:22,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 06:56:22,247 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 22 states have internal predecessors, (38), 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 42 [2022-04-15 06:56:22,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:56:22,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 22 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:22,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 56 transitions. [2022-04-15 06:56:22,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 22 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:22,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 56 transitions. [2022-04-15 06:56:22,250 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 56 transitions. [2022-04-15 06:56:22,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:56:22,300 INFO L225 Difference]: With dead ends: 102 [2022-04-15 06:56:22,301 INFO L226 Difference]: Without dead ends: 67 [2022-04-15 06:56:22,301 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=754, Invalid=2002, Unknown=0, NotChecked=0, Total=2756 [2022-04-15 06:56:22,302 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 23 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:56:22,302 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 95 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 06:56:22,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-15 06:56:22,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-04-15 06:56:22,466 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:56:22,466 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 67 states, 62 states have (on average 1.0806451612903225) internal successors, (67), 62 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:22,466 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 67 states, 62 states have (on average 1.0806451612903225) internal successors, (67), 62 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:22,466 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 67 states, 62 states have (on average 1.0806451612903225) internal successors, (67), 62 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:22,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:22,468 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2022-04-15 06:56:22,468 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-04-15 06:56:22,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:56:22,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:56:22,469 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 62 states have (on average 1.0806451612903225) internal successors, (67), 62 states have internal predecessors, (67), 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 67 states. [2022-04-15 06:56:22,469 INFO L87 Difference]: Start difference. First operand has 67 states, 62 states have (on average 1.0806451612903225) internal successors, (67), 62 states have internal predecessors, (67), 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 67 states. [2022-04-15 06:56:22,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:22,470 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2022-04-15 06:56:22,470 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-04-15 06:56:22,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:56:22,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:56:22,470 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:56:22,470 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:56:22,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.0806451612903225) internal successors, (67), 62 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:22,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2022-04-15 06:56:22,471 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 42 [2022-04-15 06:56:22,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:56:22,472 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2022-04-15 06:56:22,472 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 22 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:22,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 71 transitions. [2022-04-15 06:56:22,558 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:56:22,558 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-04-15 06:56:22,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-15 06:56:22,558 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:56:22,558 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:56:22,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-15 06:56:22,759 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-15 06:56:22,759 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:56:22,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:56:22,759 INFO L85 PathProgramCache]: Analyzing trace with hash -2144480746, now seen corresponding path program 9 times [2022-04-15 06:56:22,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:56:22,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2105141874] [2022-04-15 06:56:26,836 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:56:26,896 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:56:27,176 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:56:27,177 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:56:27,180 INFO L85 PathProgramCache]: Analyzing trace with hash -246300319, now seen corresponding path program 1 times [2022-04-15 06:56:27,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:56:27,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843509880] [2022-04-15 06:56:27,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:56:27,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:56:27,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:27,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:56:27,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:27,374 INFO L290 TraceCheckUtils]: 0: Hoare triple {4170#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {4155#true} is VALID [2022-04-15 06:56:27,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {4155#true} assume true; {4155#true} is VALID [2022-04-15 06:56:27,375 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4155#true} {4155#true} #52#return; {4155#true} is VALID [2022-04-15 06:56:27,375 INFO L272 TraceCheckUtils]: 0: Hoare triple {4155#true} call ULTIMATE.init(); {4170#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:56:27,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {4170#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {4155#true} is VALID [2022-04-15 06:56:27,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {4155#true} assume true; {4155#true} is VALID [2022-04-15 06:56:27,376 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4155#true} {4155#true} #52#return; {4155#true} is VALID [2022-04-15 06:56:27,376 INFO L272 TraceCheckUtils]: 4: Hoare triple {4155#true} call #t~ret7 := main(); {4155#true} is VALID [2022-04-15 06:56:27,376 INFO L290 TraceCheckUtils]: 5: Hoare triple {4155#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {4160#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:56:27,377 INFO L290 TraceCheckUtils]: 6: Hoare triple {4160#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} [92] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_57| |v_main_#t~post4_56|)) (.cse1 (= v_main_~x~0_234 v_main_~x~0_233))) (or (and (< v_main_~x~0_234 v_main_~x~0_233) (< v_main_~x~0_233 50001)) (and .cse0 .cse1 (not (< v_main_~x~0_234 50000))) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_234, main_#t~post4=|v_main_#t~post4_57|} OutVars{main_~x~0=v_main_~x~0_233, main_#t~post4=|v_main_#t~post4_56|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4161#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} is VALID [2022-04-15 06:56:27,378 INFO L290 TraceCheckUtils]: 7: Hoare triple {4161#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} [93] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4161#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} is VALID [2022-04-15 06:56:27,380 INFO L290 TraceCheckUtils]: 8: Hoare triple {4161#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} [94] L10-2-->L17-1_primed: Formula: (let ((.cse2 (<= 50000 v_main_~x~0_236)) (.cse0 (= v_main_~x~0_236 v_main_~x~0_235)) (.cse1 (= v_main_~y~0_185 v_main_~y~0_184))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_236 1000000)))) (let ((.cse4 (* v_main_~x~0_236 (- 1)))) (let ((.cse3 (div (+ v_main_~x~0_235 .cse4) 2))) (and (= (mod (+ v_main_~x~0_236 v_main_~x~0_235) 2) 0) (= v_main_~y~0_184 (+ v_main_~y~0_185 (* 2 .cse3))) (< 0 .cse3) .cse2 (< .cse3 (+ (div (+ 999999 .cse4) 2) 2))))) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_236, main_~y~0=v_main_~y~0_185} OutVars{main_~x~0=v_main_~x~0_235, main_~y~0=v_main_~y~0_184} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {4162#(or (and (= main_~z~0 0) (<= main_~x~0 (+ main_~y~0 1))) (<= main_~x~0 50000))} is VALID [2022-04-15 06:56:27,380 INFO L290 TraceCheckUtils]: 9: Hoare triple {4162#(or (and (= main_~z~0 0) (<= main_~x~0 (+ main_~y~0 1))) (<= main_~x~0 50000))} [91] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {4163#(and (= main_~z~0 0) (<= 999999 main_~y~0))} is VALID [2022-04-15 06:56:27,381 INFO L290 TraceCheckUtils]: 10: Hoare triple {4163#(and (= main_~z~0 0) (<= 999999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4164#(and (= main_~z~0 0) (<= 999998 main_~y~0))} is VALID [2022-04-15 06:56:27,382 INFO L290 TraceCheckUtils]: 11: Hoare triple {4164#(and (= main_~z~0 0) (<= 999998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4165#(and (= main_~z~0 0) (<= 999997 main_~y~0))} is VALID [2022-04-15 06:56:27,383 INFO L290 TraceCheckUtils]: 12: Hoare triple {4165#(and (= main_~z~0 0) (<= 999997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4166#(and (<= 999996 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 06:56:27,383 INFO L290 TraceCheckUtils]: 13: Hoare triple {4166#(and (<= 999996 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4167#(and (= main_~z~0 0) (<= 999995 main_~y~0))} is VALID [2022-04-15 06:56:27,384 INFO L290 TraceCheckUtils]: 14: Hoare triple {4167#(and (= main_~z~0 0) (<= 999995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4168#(and (= main_~z~0 0) (<= 999994 main_~y~0))} is VALID [2022-04-15 06:56:27,385 INFO L290 TraceCheckUtils]: 15: Hoare triple {4168#(and (= main_~z~0 0) (<= 999994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4169#(and (= main_~z~0 0) (<= 999993 main_~y~0))} is VALID [2022-04-15 06:56:27,385 INFO L290 TraceCheckUtils]: 16: Hoare triple {4169#(and (= main_~z~0 0) (<= 999993 main_~y~0))} assume !(~y~0 > ~z~0); {4156#false} is VALID [2022-04-15 06:56:27,385 INFO L272 TraceCheckUtils]: 17: Hoare triple {4156#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {4156#false} is VALID [2022-04-15 06:56:27,385 INFO L290 TraceCheckUtils]: 18: Hoare triple {4156#false} ~cond := #in~cond; {4156#false} is VALID [2022-04-15 06:56:27,386 INFO L290 TraceCheckUtils]: 19: Hoare triple {4156#false} assume 0 == ~cond; {4156#false} is VALID [2022-04-15 06:56:27,386 INFO L290 TraceCheckUtils]: 20: Hoare triple {4156#false} assume !false; {4156#false} is VALID [2022-04-15 06:56:27,387 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:56:27,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:56:27,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843509880] [2022-04-15 06:56:27,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843509880] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:56:27,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674481754] [2022-04-15 06:56:27,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:56:27,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:56:27,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:56:27,392 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:56:27,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-15 06:56:27,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:27,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 06:56:27,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:27,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:56:44,291 INFO L272 TraceCheckUtils]: 0: Hoare triple {4155#true} call ULTIMATE.init(); {4155#true} is VALID [2022-04-15 06:56:44,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {4155#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {4155#true} is VALID [2022-04-15 06:56:44,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {4155#true} assume true; {4155#true} is VALID [2022-04-15 06:56:44,291 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4155#true} {4155#true} #52#return; {4155#true} is VALID [2022-04-15 06:56:44,291 INFO L272 TraceCheckUtils]: 4: Hoare triple {4155#true} call #t~ret7 := main(); {4155#true} is VALID [2022-04-15 06:56:44,292 INFO L290 TraceCheckUtils]: 5: Hoare triple {4155#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {4189#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:56:44,292 INFO L290 TraceCheckUtils]: 6: Hoare triple {4189#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [92] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_57| |v_main_#t~post4_56|)) (.cse1 (= v_main_~x~0_234 v_main_~x~0_233))) (or (and (< v_main_~x~0_234 v_main_~x~0_233) (< v_main_~x~0_233 50001)) (and .cse0 .cse1 (not (< v_main_~x~0_234 50000))) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_234, main_#t~post4=|v_main_#t~post4_57|} OutVars{main_~x~0=v_main_~x~0_233, main_#t~post4=|v_main_#t~post4_56|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4189#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:56:44,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {4189#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [93] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4189#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:56:44,295 INFO L290 TraceCheckUtils]: 8: Hoare triple {4189#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [94] L10-2-->L17-1_primed: Formula: (let ((.cse2 (<= 50000 v_main_~x~0_236)) (.cse0 (= v_main_~x~0_236 v_main_~x~0_235)) (.cse1 (= v_main_~y~0_185 v_main_~y~0_184))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_236 1000000)))) (let ((.cse4 (* v_main_~x~0_236 (- 1)))) (let ((.cse3 (div (+ v_main_~x~0_235 .cse4) 2))) (and (= (mod (+ v_main_~x~0_236 v_main_~x~0_235) 2) 0) (= v_main_~y~0_184 (+ v_main_~y~0_185 (* 2 .cse3))) (< 0 .cse3) .cse2 (< .cse3 (+ (div (+ 999999 .cse4) 2) 2))))) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_236, main_~y~0=v_main_~y~0_185} OutVars{main_~x~0=v_main_~x~0_235, main_~y~0=v_main_~y~0_184} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {4189#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:56:44,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {4189#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [91] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {4189#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:56:44,296 INFO L290 TraceCheckUtils]: 10: Hoare triple {4189#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4205#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-15 06:56:44,296 INFO L290 TraceCheckUtils]: 11: Hoare triple {4205#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4209#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-15 06:56:44,297 INFO L290 TraceCheckUtils]: 12: Hoare triple {4209#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4213#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-15 06:56:44,298 INFO L290 TraceCheckUtils]: 13: Hoare triple {4213#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4217#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-15 06:56:44,298 INFO L290 TraceCheckUtils]: 14: Hoare triple {4217#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4221#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-15 06:56:44,299 INFO L290 TraceCheckUtils]: 15: Hoare triple {4221#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4225#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-15 06:56:44,299 INFO L290 TraceCheckUtils]: 16: Hoare triple {4225#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} assume !(~y~0 > ~z~0); {4156#false} is VALID [2022-04-15 06:56:44,299 INFO L272 TraceCheckUtils]: 17: Hoare triple {4156#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {4156#false} is VALID [2022-04-15 06:56:44,299 INFO L290 TraceCheckUtils]: 18: Hoare triple {4156#false} ~cond := #in~cond; {4156#false} is VALID [2022-04-15 06:56:44,299 INFO L290 TraceCheckUtils]: 19: Hoare triple {4156#false} assume 0 == ~cond; {4156#false} is VALID [2022-04-15 06:56:44,299 INFO L290 TraceCheckUtils]: 20: Hoare triple {4156#false} assume !false; {4156#false} is VALID [2022-04-15 06:56:44,300 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:56:44,300 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:57:01,237 INFO L290 TraceCheckUtils]: 20: Hoare triple {4156#false} assume !false; {4156#false} is VALID [2022-04-15 06:57:01,237 INFO L290 TraceCheckUtils]: 19: Hoare triple {4156#false} assume 0 == ~cond; {4156#false} is VALID [2022-04-15 06:57:01,238 INFO L290 TraceCheckUtils]: 18: Hoare triple {4156#false} ~cond := #in~cond; {4156#false} is VALID [2022-04-15 06:57:01,238 INFO L272 TraceCheckUtils]: 17: Hoare triple {4156#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {4156#false} is VALID [2022-04-15 06:57:01,238 INFO L290 TraceCheckUtils]: 16: Hoare triple {4253#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {4156#false} is VALID [2022-04-15 06:57:01,239 INFO L290 TraceCheckUtils]: 15: Hoare triple {4257#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4253#(< main_~z~0 main_~y~0)} is VALID [2022-04-15 06:57:01,239 INFO L290 TraceCheckUtils]: 14: Hoare triple {4261#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4257#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-15 06:57:01,240 INFO L290 TraceCheckUtils]: 13: Hoare triple {4265#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4261#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-15 06:57:01,240 INFO L290 TraceCheckUtils]: 12: Hoare triple {4269#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4265#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-15 06:57:01,241 INFO L290 TraceCheckUtils]: 11: Hoare triple {4273#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4269#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-15 06:57:01,241 INFO L290 TraceCheckUtils]: 10: Hoare triple {4277#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4273#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-15 06:57:01,242 INFO L290 TraceCheckUtils]: 9: Hoare triple {4277#(< (+ main_~z~0 6) main_~y~0)} [91] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {4277#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-15 06:57:01,243 INFO L290 TraceCheckUtils]: 8: Hoare triple {4277#(< (+ main_~z~0 6) main_~y~0)} [94] L10-2-->L17-1_primed: Formula: (let ((.cse2 (<= 50000 v_main_~x~0_236)) (.cse0 (= v_main_~x~0_236 v_main_~x~0_235)) (.cse1 (= v_main_~y~0_185 v_main_~y~0_184))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_236 1000000)))) (let ((.cse4 (* v_main_~x~0_236 (- 1)))) (let ((.cse3 (div (+ v_main_~x~0_235 .cse4) 2))) (and (= (mod (+ v_main_~x~0_236 v_main_~x~0_235) 2) 0) (= v_main_~y~0_184 (+ v_main_~y~0_185 (* 2 .cse3))) (< 0 .cse3) .cse2 (< .cse3 (+ (div (+ 999999 .cse4) 2) 2))))) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_236, main_~y~0=v_main_~y~0_185} OutVars{main_~x~0=v_main_~x~0_235, main_~y~0=v_main_~y~0_184} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {4277#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-15 06:57:01,244 INFO L290 TraceCheckUtils]: 7: Hoare triple {4277#(< (+ main_~z~0 6) main_~y~0)} [93] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4277#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-15 06:57:01,244 INFO L290 TraceCheckUtils]: 6: Hoare triple {4277#(< (+ main_~z~0 6) main_~y~0)} [92] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_57| |v_main_#t~post4_56|)) (.cse1 (= v_main_~x~0_234 v_main_~x~0_233))) (or (and (< v_main_~x~0_234 v_main_~x~0_233) (< v_main_~x~0_233 50001)) (and .cse0 .cse1 (not (< v_main_~x~0_234 50000))) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_234, main_#t~post4=|v_main_#t~post4_57|} OutVars{main_~x~0=v_main_~x~0_233, main_#t~post4=|v_main_#t~post4_56|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4277#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-15 06:57:01,244 INFO L290 TraceCheckUtils]: 5: Hoare triple {4155#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {4277#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-15 06:57:01,245 INFO L272 TraceCheckUtils]: 4: Hoare triple {4155#true} call #t~ret7 := main(); {4155#true} is VALID [2022-04-15 06:57:01,245 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4155#true} {4155#true} #52#return; {4155#true} is VALID [2022-04-15 06:57:01,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {4155#true} assume true; {4155#true} is VALID [2022-04-15 06:57:01,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {4155#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {4155#true} is VALID [2022-04-15 06:57:01,245 INFO L272 TraceCheckUtils]: 0: Hoare triple {4155#true} call ULTIMATE.init(); {4155#true} is VALID [2022-04-15 06:57:01,245 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:57:01,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1674481754] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:57:01,245 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:57:01,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 27 [2022-04-15 06:57:01,832 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:57:01,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2105141874] [2022-04-15 06:57:01,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2105141874] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:57:01,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:57:01,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-15 06:57:01,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810100612] [2022-04-15 06:57:01,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:57:01,833 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 23 states have internal predecessors, (40), 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 44 [2022-04-15 06:57:01,833 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:57:01,833 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 23 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:01,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:57:01,867 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-15 06:57:01,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:57:01,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-15 06:57:01,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=520, Invalid=1120, Unknown=0, NotChecked=0, Total=1640 [2022-04-15 06:57:01,868 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand has 24 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 23 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:03,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:57:03,871 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2022-04-15 06:57:03,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 06:57:03,872 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 23 states have internal predecessors, (40), 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 44 [2022-04-15 06:57:03,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:57:03,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 23 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:03,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 57 transitions. [2022-04-15 06:57:03,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 23 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:03,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 57 transitions. [2022-04-15 06:57:03,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 57 transitions. [2022-04-15 06:57:03,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:57:03,941 INFO L225 Difference]: With dead ends: 104 [2022-04-15 06:57:03,941 INFO L226 Difference]: Without dead ends: 69 [2022-04-15 06:57:03,942 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 713 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=790, Invalid=2180, Unknown=0, NotChecked=0, Total=2970 [2022-04-15 06:57:03,943 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 24 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 06:57:03,943 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 95 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 06:57:03,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-15 06:57:04,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-04-15 06:57:04,113 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:57:04,113 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 69 states, 64 states have (on average 1.078125) internal successors, (69), 64 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:04,114 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 69 states, 64 states have (on average 1.078125) internal successors, (69), 64 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:04,114 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 69 states, 64 states have (on average 1.078125) internal successors, (69), 64 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:04,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:57:04,115 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-04-15 06:57:04,115 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-04-15 06:57:04,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:57:04,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:57:04,115 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 64 states have (on average 1.078125) internal successors, (69), 64 states have internal predecessors, (69), 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 69 states. [2022-04-15 06:57:04,115 INFO L87 Difference]: Start difference. First operand has 69 states, 64 states have (on average 1.078125) internal successors, (69), 64 states have internal predecessors, (69), 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 69 states. [2022-04-15 06:57:04,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:57:04,119 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-04-15 06:57:04,119 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-04-15 06:57:04,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:57:04,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:57:04,119 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:57:04,119 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:57:04,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.078125) internal successors, (69), 64 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:04,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2022-04-15 06:57:04,121 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 44 [2022-04-15 06:57:04,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:57:04,121 INFO L478 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2022-04-15 06:57:04,121 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 23 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:04,121 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 73 transitions. [2022-04-15 06:57:04,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:57:04,202 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-04-15 06:57:04,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-15 06:57:04,203 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:57:04,203 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:57:04,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-15 06:57:04,403 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:57:04,404 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:57:04,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:57:04,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1932660763, now seen corresponding path program 10 times [2022-04-15 06:57:04,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:57:04,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [694286101] [2022-04-15 06:57:04,552 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:57:04,861 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:57:04,862 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:57:04,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1190576031, now seen corresponding path program 1 times [2022-04-15 06:57:04,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:57:04,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756341891] [2022-04-15 06:57:04,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:57:04,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:57:04,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:57:05,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:57:05,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:57:05,042 INFO L290 TraceCheckUtils]: 0: Hoare triple {4848#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {4836#true} is VALID [2022-04-15 06:57:05,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {4836#true} assume true; {4836#true} is VALID [2022-04-15 06:57:05,042 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4836#true} {4836#true} #52#return; {4836#true} is VALID [2022-04-15 06:57:05,042 INFO L272 TraceCheckUtils]: 0: Hoare triple {4836#true} call ULTIMATE.init(); {4848#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:57:05,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {4848#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {4836#true} is VALID [2022-04-15 06:57:05,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {4836#true} assume true; {4836#true} is VALID [2022-04-15 06:57:05,043 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4836#true} {4836#true} #52#return; {4836#true} is VALID [2022-04-15 06:57:05,043 INFO L272 TraceCheckUtils]: 4: Hoare triple {4836#true} call #t~ret7 := main(); {4836#true} is VALID [2022-04-15 06:57:05,043 INFO L290 TraceCheckUtils]: 5: Hoare triple {4836#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {4841#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:57:05,044 INFO L290 TraceCheckUtils]: 6: Hoare triple {4841#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [96] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_63| |v_main_#t~post4_62|)) (.cse1 (= v_main_~x~0_269 v_main_~x~0_268))) (or (and .cse0 .cse1) (and (< v_main_~x~0_269 v_main_~x~0_268) (< v_main_~x~0_268 50001)) (and .cse0 .cse1 (not (< v_main_~x~0_269 50000))))) InVars {main_~x~0=v_main_~x~0_269, main_#t~post4=|v_main_#t~post4_63|} OutVars{main_~x~0=v_main_~x~0_268, main_#t~post4=|v_main_#t~post4_62|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4841#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:57:05,044 INFO L290 TraceCheckUtils]: 7: Hoare triple {4841#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [97] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4841#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:57:05,045 INFO L290 TraceCheckUtils]: 8: Hoare triple {4841#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [98] L10-2-->L17-1_primed: Formula: (let ((.cse2 (= v_main_~x~0_271 v_main_~x~0_270)) (.cse3 (= v_main_~y~0_218 v_main_~y~0_217)) (.cse1 (<= 50000 v_main_~x~0_271))) (or (let ((.cse0 (div (+ (* (- 1) v_main_~y~0_217) v_main_~y~0_218) (- 2)))) (and (< .cse0 (+ (div (+ (* v_main_~x~0_271 (- 1)) 999999) 2) 2)) (= v_main_~x~0_270 (+ v_main_~x~0_271 (* .cse0 2))) .cse1 (< 0 .cse0) (= (mod (+ v_main_~y~0_218 v_main_~y~0_217) 2) 0))) (and .cse2 .cse3) (and .cse2 .cse3 (or (not .cse1) (not (< v_main_~x~0_271 1000000)))))) InVars {main_~x~0=v_main_~x~0_271, main_~y~0=v_main_~y~0_218} OutVars{main_~x~0=v_main_~x~0_270, main_~y~0=v_main_~y~0_217} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {4841#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:57:05,046 INFO L290 TraceCheckUtils]: 9: Hoare triple {4841#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [95] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {4841#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:57:05,046 INFO L290 TraceCheckUtils]: 10: Hoare triple {4841#(and (= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4842#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-15 06:57:05,047 INFO L290 TraceCheckUtils]: 11: Hoare triple {4842#(and (= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4843#(and (<= 49998 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 06:57:05,048 INFO L290 TraceCheckUtils]: 12: Hoare triple {4843#(and (<= 49998 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4844#(and (= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-15 06:57:05,048 INFO L290 TraceCheckUtils]: 13: Hoare triple {4844#(and (= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4845#(and (= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-15 06:57:05,049 INFO L290 TraceCheckUtils]: 14: Hoare triple {4845#(and (= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4846#(and (= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-15 06:57:05,049 INFO L290 TraceCheckUtils]: 15: Hoare triple {4846#(and (= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4847#(and (= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-15 06:57:05,050 INFO L290 TraceCheckUtils]: 16: Hoare triple {4847#(and (= main_~z~0 0) (<= 49994 main_~y~0))} assume !(~y~0 > ~z~0); {4837#false} is VALID [2022-04-15 06:57:05,050 INFO L272 TraceCheckUtils]: 17: Hoare triple {4837#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {4837#false} is VALID [2022-04-15 06:57:05,050 INFO L290 TraceCheckUtils]: 18: Hoare triple {4837#false} ~cond := #in~cond; {4837#false} is VALID [2022-04-15 06:57:05,050 INFO L290 TraceCheckUtils]: 19: Hoare triple {4837#false} assume 0 == ~cond; {4837#false} is VALID [2022-04-15 06:57:05,050 INFO L290 TraceCheckUtils]: 20: Hoare triple {4837#false} assume !false; {4837#false} is VALID [2022-04-15 06:57:05,050 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:57:05,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:57:05,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756341891] [2022-04-15 06:57:05,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756341891] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:57:05,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154991472] [2022-04-15 06:57:05,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:57:05,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:57:05,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:57:05,053 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:57:05,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-15 06:57:05,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:57:05,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 06:57:05,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:57:05,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:57:28,993 INFO L272 TraceCheckUtils]: 0: Hoare triple {4836#true} call ULTIMATE.init(); {4836#true} is VALID [2022-04-15 06:57:28,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {4836#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {4836#true} is VALID [2022-04-15 06:57:28,993 INFO L290 TraceCheckUtils]: 2: Hoare triple {4836#true} assume true; {4836#true} is VALID [2022-04-15 06:57:28,993 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4836#true} {4836#true} #52#return; {4836#true} is VALID [2022-04-15 06:57:28,993 INFO L272 TraceCheckUtils]: 4: Hoare triple {4836#true} call #t~ret7 := main(); {4836#true} is VALID [2022-04-15 06:57:28,994 INFO L290 TraceCheckUtils]: 5: Hoare triple {4836#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {4867#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:57:28,994 INFO L290 TraceCheckUtils]: 6: Hoare triple {4867#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [96] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_63| |v_main_#t~post4_62|)) (.cse1 (= v_main_~x~0_269 v_main_~x~0_268))) (or (and .cse0 .cse1) (and (< v_main_~x~0_269 v_main_~x~0_268) (< v_main_~x~0_268 50001)) (and .cse0 .cse1 (not (< v_main_~x~0_269 50000))))) InVars {main_~x~0=v_main_~x~0_269, main_#t~post4=|v_main_#t~post4_63|} OutVars{main_~x~0=v_main_~x~0_268, main_#t~post4=|v_main_#t~post4_62|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4867#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:57:28,995 INFO L290 TraceCheckUtils]: 7: Hoare triple {4867#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [97] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4867#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:57:28,996 INFO L290 TraceCheckUtils]: 8: Hoare triple {4867#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [98] L10-2-->L17-1_primed: Formula: (let ((.cse2 (= v_main_~x~0_271 v_main_~x~0_270)) (.cse3 (= v_main_~y~0_218 v_main_~y~0_217)) (.cse1 (<= 50000 v_main_~x~0_271))) (or (let ((.cse0 (div (+ (* (- 1) v_main_~y~0_217) v_main_~y~0_218) (- 2)))) (and (< .cse0 (+ (div (+ (* v_main_~x~0_271 (- 1)) 999999) 2) 2)) (= v_main_~x~0_270 (+ v_main_~x~0_271 (* .cse0 2))) .cse1 (< 0 .cse0) (= (mod (+ v_main_~y~0_218 v_main_~y~0_217) 2) 0))) (and .cse2 .cse3) (and .cse2 .cse3 (or (not .cse1) (not (< v_main_~x~0_271 1000000)))))) InVars {main_~x~0=v_main_~x~0_271, main_~y~0=v_main_~y~0_218} OutVars{main_~x~0=v_main_~x~0_270, main_~y~0=v_main_~y~0_217} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {4867#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:57:28,996 INFO L290 TraceCheckUtils]: 9: Hoare triple {4867#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [95] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {4867#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:57:28,997 INFO L290 TraceCheckUtils]: 10: Hoare triple {4867#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4883#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-15 06:57:28,998 INFO L290 TraceCheckUtils]: 11: Hoare triple {4883#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4887#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-15 06:57:28,998 INFO L290 TraceCheckUtils]: 12: Hoare triple {4887#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4891#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-15 06:57:28,999 INFO L290 TraceCheckUtils]: 13: Hoare triple {4891#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4895#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-15 06:57:28,999 INFO L290 TraceCheckUtils]: 14: Hoare triple {4895#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4899#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-15 06:57:29,000 INFO L290 TraceCheckUtils]: 15: Hoare triple {4899#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4903#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-15 06:57:29,000 INFO L290 TraceCheckUtils]: 16: Hoare triple {4903#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} assume !(~y~0 > ~z~0); {4837#false} is VALID [2022-04-15 06:57:29,000 INFO L272 TraceCheckUtils]: 17: Hoare triple {4837#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {4837#false} is VALID [2022-04-15 06:57:29,001 INFO L290 TraceCheckUtils]: 18: Hoare triple {4837#false} ~cond := #in~cond; {4837#false} is VALID [2022-04-15 06:57:29,001 INFO L290 TraceCheckUtils]: 19: Hoare triple {4837#false} assume 0 == ~cond; {4837#false} is VALID [2022-04-15 06:57:29,001 INFO L290 TraceCheckUtils]: 20: Hoare triple {4837#false} assume !false; {4837#false} is VALID [2022-04-15 06:57:29,001 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:57:29,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:57:51,656 INFO L290 TraceCheckUtils]: 20: Hoare triple {4837#false} assume !false; {4837#false} is VALID [2022-04-15 06:57:51,656 INFO L290 TraceCheckUtils]: 19: Hoare triple {4837#false} assume 0 == ~cond; {4837#false} is VALID [2022-04-15 06:57:51,656 INFO L290 TraceCheckUtils]: 18: Hoare triple {4837#false} ~cond := #in~cond; {4837#false} is VALID [2022-04-15 06:57:51,656 INFO L272 TraceCheckUtils]: 17: Hoare triple {4837#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {4837#false} is VALID [2022-04-15 06:57:51,656 INFO L290 TraceCheckUtils]: 16: Hoare triple {4931#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {4837#false} is VALID [2022-04-15 06:57:51,657 INFO L290 TraceCheckUtils]: 15: Hoare triple {4935#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4931#(< main_~z~0 main_~y~0)} is VALID [2022-04-15 06:57:51,657 INFO L290 TraceCheckUtils]: 14: Hoare triple {4939#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4935#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-15 06:57:51,658 INFO L290 TraceCheckUtils]: 13: Hoare triple {4943#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4939#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-15 06:57:51,659 INFO L290 TraceCheckUtils]: 12: Hoare triple {4947#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4943#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-15 06:57:51,659 INFO L290 TraceCheckUtils]: 11: Hoare triple {4951#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4947#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-15 06:57:51,660 INFO L290 TraceCheckUtils]: 10: Hoare triple {4955#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4951#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-15 06:57:51,660 INFO L290 TraceCheckUtils]: 9: Hoare triple {4955#(< (+ main_~z~0 6) main_~y~0)} [95] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {4955#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-15 06:57:51,661 INFO L290 TraceCheckUtils]: 8: Hoare triple {4955#(< (+ main_~z~0 6) main_~y~0)} [98] L10-2-->L17-1_primed: Formula: (let ((.cse2 (= v_main_~x~0_271 v_main_~x~0_270)) (.cse3 (= v_main_~y~0_218 v_main_~y~0_217)) (.cse1 (<= 50000 v_main_~x~0_271))) (or (let ((.cse0 (div (+ (* (- 1) v_main_~y~0_217) v_main_~y~0_218) (- 2)))) (and (< .cse0 (+ (div (+ (* v_main_~x~0_271 (- 1)) 999999) 2) 2)) (= v_main_~x~0_270 (+ v_main_~x~0_271 (* .cse0 2))) .cse1 (< 0 .cse0) (= (mod (+ v_main_~y~0_218 v_main_~y~0_217) 2) 0))) (and .cse2 .cse3) (and .cse2 .cse3 (or (not .cse1) (not (< v_main_~x~0_271 1000000)))))) InVars {main_~x~0=v_main_~x~0_271, main_~y~0=v_main_~y~0_218} OutVars{main_~x~0=v_main_~x~0_270, main_~y~0=v_main_~y~0_217} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {4955#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-15 06:57:51,662 INFO L290 TraceCheckUtils]: 7: Hoare triple {4955#(< (+ main_~z~0 6) main_~y~0)} [97] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4955#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-15 06:57:51,662 INFO L290 TraceCheckUtils]: 6: Hoare triple {4955#(< (+ main_~z~0 6) main_~y~0)} [96] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_63| |v_main_#t~post4_62|)) (.cse1 (= v_main_~x~0_269 v_main_~x~0_268))) (or (and .cse0 .cse1) (and (< v_main_~x~0_269 v_main_~x~0_268) (< v_main_~x~0_268 50001)) (and .cse0 .cse1 (not (< v_main_~x~0_269 50000))))) InVars {main_~x~0=v_main_~x~0_269, main_#t~post4=|v_main_#t~post4_63|} OutVars{main_~x~0=v_main_~x~0_268, main_#t~post4=|v_main_#t~post4_62|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4955#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-15 06:57:51,663 INFO L290 TraceCheckUtils]: 5: Hoare triple {4836#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {4955#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-15 06:57:51,663 INFO L272 TraceCheckUtils]: 4: Hoare triple {4836#true} call #t~ret7 := main(); {4836#true} is VALID [2022-04-15 06:57:51,663 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4836#true} {4836#true} #52#return; {4836#true} is VALID [2022-04-15 06:57:51,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {4836#true} assume true; {4836#true} is VALID [2022-04-15 06:57:51,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {4836#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {4836#true} is VALID [2022-04-15 06:57:51,663 INFO L272 TraceCheckUtils]: 0: Hoare triple {4836#true} call ULTIMATE.init(); {4836#true} is VALID [2022-04-15 06:57:51,663 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:57:51,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154991472] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:57:51,664 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:57:51,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24 [2022-04-15 06:57:52,231 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:57:52,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [694286101] [2022-04-15 06:57:52,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [694286101] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:57:52,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:57:52,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-15 06:57:52,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127368489] [2022-04-15 06:57:52,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:57:52,232 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.68) internal successors, (42), 24 states have internal predecessors, (42), 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 46 [2022-04-15 06:57:52,232 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:57:52,232 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.68) internal successors, (42), 24 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:52,278 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:57:52,278 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-15 06:57:52,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:57:52,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-15 06:57:52,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=593, Invalid=889, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 06:57:52,279 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 25 states, 25 states have (on average 1.68) internal successors, (42), 24 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:53,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:57:53,921 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2022-04-15 06:57:53,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 06:57:53,921 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.68) internal successors, (42), 24 states have internal predecessors, (42), 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 46 [2022-04-15 06:57:53,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:57:53,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.68) internal successors, (42), 24 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:53,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 72 transitions. [2022-04-15 06:57:53,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.68) internal successors, (42), 24 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:53,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 72 transitions. [2022-04-15 06:57:53,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 72 transitions. [2022-04-15 06:57:53,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:57:53,998 INFO L225 Difference]: With dead ends: 113 [2022-04-15 06:57:53,998 INFO L226 Difference]: Without dead ends: 78 [2022-04-15 06:57:54,000 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 996 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1248, Invalid=2412, Unknown=0, NotChecked=0, Total=3660 [2022-04-15 06:57:54,000 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 91 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:57:54,000 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 39 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 06:57:54,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-15 06:57:54,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 52. [2022-04-15 06:57:54,111 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:57:54,112 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 52 states, 47 states have (on average 1.0851063829787233) internal successors, (51), 47 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:54,112 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 52 states, 47 states have (on average 1.0851063829787233) internal successors, (51), 47 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:54,112 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 52 states, 47 states have (on average 1.0851063829787233) internal successors, (51), 47 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:54,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:57:54,113 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2022-04-15 06:57:54,113 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2022-04-15 06:57:54,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:57:54,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:57:54,113 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 47 states have (on average 1.0851063829787233) internal successors, (51), 47 states have internal predecessors, (51), 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 78 states. [2022-04-15 06:57:54,113 INFO L87 Difference]: Start difference. First operand has 52 states, 47 states have (on average 1.0851063829787233) internal successors, (51), 47 states have internal predecessors, (51), 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 78 states. [2022-04-15 06:57:54,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:57:54,114 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2022-04-15 06:57:54,114 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2022-04-15 06:57:54,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:57:54,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:57:54,115 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:57:54,115 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:57:54,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.0851063829787233) internal successors, (51), 47 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:54,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2022-04-15 06:57:54,115 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 46 [2022-04-15 06:57:54,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:57:54,116 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2022-04-15 06:57:54,116 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.68) internal successors, (42), 24 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:54,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 55 transitions. [2022-04-15 06:57:54,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:57:54,174 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2022-04-15 06:57:54,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-15 06:57:54,174 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:57:54,174 INFO L499 BasicCegarLoop]: trace histogram [16, 15, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:57:54,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-15 06:57:54,375 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-15 06:57:54,375 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:57:54,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:57:54,376 INFO L85 PathProgramCache]: Analyzing trace with hash 878066590, now seen corresponding path program 11 times [2022-04-15 06:57:54,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:57:54,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1417832672] [2022-04-15 06:57:54,485 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:57:54,766 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:57:54,767 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:57:54,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1720356830, now seen corresponding path program 1 times [2022-04-15 06:57:54,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:57:54,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846427126] [2022-04-15 06:57:54,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:57:54,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:57:54,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:57:54,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:57:54,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:57:54,972 INFO L290 TraceCheckUtils]: 0: Hoare triple {5549#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {5533#true} is VALID [2022-04-15 06:57:54,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {5533#true} assume true; {5533#true} is VALID [2022-04-15 06:57:54,973 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5533#true} {5533#true} #52#return; {5533#true} is VALID [2022-04-15 06:57:54,973 INFO L272 TraceCheckUtils]: 0: Hoare triple {5533#true} call ULTIMATE.init(); {5549#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:57:54,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {5549#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {5533#true} is VALID [2022-04-15 06:57:54,973 INFO L290 TraceCheckUtils]: 2: Hoare triple {5533#true} assume true; {5533#true} is VALID [2022-04-15 06:57:54,973 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5533#true} {5533#true} #52#return; {5533#true} is VALID [2022-04-15 06:57:54,974 INFO L272 TraceCheckUtils]: 4: Hoare triple {5533#true} call #t~ret7 := main(); {5533#true} is VALID [2022-04-15 06:57:54,979 INFO L290 TraceCheckUtils]: 5: Hoare triple {5533#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {5538#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:57:54,980 INFO L290 TraceCheckUtils]: 6: Hoare triple {5538#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} [100] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_305 v_main_~x~0_304)) (.cse1 (= |v_main_#t~post4_69| |v_main_#t~post4_68|))) (or (and .cse0 .cse1 (not (< v_main_~x~0_305 50000))) (and (< v_main_~x~0_304 50001) (< v_main_~x~0_305 v_main_~x~0_304)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_305, main_#t~post4=|v_main_#t~post4_69|} OutVars{main_~x~0=v_main_~x~0_304, main_#t~post4=|v_main_#t~post4_68|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {5539#(or (= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} is VALID [2022-04-15 06:57:54,980 INFO L290 TraceCheckUtils]: 7: Hoare triple {5539#(or (= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} [101] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5539#(or (= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} is VALID [2022-04-15 06:57:54,982 INFO L290 TraceCheckUtils]: 8: Hoare triple {5539#(or (= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} [102] L10-2-->L17-1_primed: Formula: (let ((.cse2 (= v_main_~x~0_307 v_main_~x~0_306)) (.cse3 (= v_main_~y~0_252 v_main_~y~0_251)) (.cse1 (<= 50000 v_main_~x~0_307))) (or (let ((.cse0 (div (+ (* v_main_~x~0_306 (- 1)) v_main_~x~0_307) (- 2)))) (and (< .cse0 (+ 2 (div (+ (* v_main_~x~0_307 (- 1)) 999999) 2))) .cse1 (= (+ v_main_~y~0_252 (* .cse0 2)) v_main_~y~0_251) (< 0 .cse0) (= (mod (+ v_main_~x~0_307 v_main_~x~0_306) 2) 0))) (and .cse2 .cse3) (and .cse2 .cse3 (or (not (< v_main_~x~0_307 1000000)) (not .cse1))))) InVars {main_~x~0=v_main_~x~0_307, main_~y~0=v_main_~y~0_252} OutVars{main_~x~0=v_main_~x~0_306, main_~y~0=v_main_~y~0_251} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {5540#(or (and (= main_~z~0 0) (<= main_~x~0 main_~y~0)) (<= main_~x~0 50000))} is VALID [2022-04-15 06:57:54,982 INFO L290 TraceCheckUtils]: 9: Hoare triple {5540#(or (and (= main_~z~0 0) (<= main_~x~0 main_~y~0)) (<= main_~x~0 50000))} [99] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {5541#(and (= main_~z~0 0) (<= 1000000 main_~y~0))} is VALID [2022-04-15 06:57:54,983 INFO L290 TraceCheckUtils]: 10: Hoare triple {5541#(and (= main_~z~0 0) (<= 1000000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5542#(and (= main_~z~0 0) (<= 999999 main_~y~0))} is VALID [2022-04-15 06:57:54,984 INFO L290 TraceCheckUtils]: 11: Hoare triple {5542#(and (= main_~z~0 0) (<= 999999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5543#(and (= main_~z~0 0) (<= 999998 main_~y~0))} is VALID [2022-04-15 06:57:54,984 INFO L290 TraceCheckUtils]: 12: Hoare triple {5543#(and (= main_~z~0 0) (<= 999998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5544#(and (= main_~z~0 0) (<= 999997 main_~y~0))} is VALID [2022-04-15 06:57:54,985 INFO L290 TraceCheckUtils]: 13: Hoare triple {5544#(and (= main_~z~0 0) (<= 999997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5545#(and (<= 999996 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 06:57:54,985 INFO L290 TraceCheckUtils]: 14: Hoare triple {5545#(and (<= 999996 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5546#(and (= main_~z~0 0) (<= 999995 main_~y~0))} is VALID [2022-04-15 06:57:54,986 INFO L290 TraceCheckUtils]: 15: Hoare triple {5546#(and (= main_~z~0 0) (<= 999995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5547#(and (= main_~z~0 0) (<= 999994 main_~y~0))} is VALID [2022-04-15 06:57:54,987 INFO L290 TraceCheckUtils]: 16: Hoare triple {5547#(and (= main_~z~0 0) (<= 999994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5548#(and (= main_~z~0 0) (<= 999993 main_~y~0))} is VALID [2022-04-15 06:57:54,987 INFO L290 TraceCheckUtils]: 17: Hoare triple {5548#(and (= main_~z~0 0) (<= 999993 main_~y~0))} assume !(~y~0 > ~z~0); {5534#false} is VALID [2022-04-15 06:57:54,987 INFO L272 TraceCheckUtils]: 18: Hoare triple {5534#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {5534#false} is VALID [2022-04-15 06:57:54,987 INFO L290 TraceCheckUtils]: 19: Hoare triple {5534#false} ~cond := #in~cond; {5534#false} is VALID [2022-04-15 06:57:54,987 INFO L290 TraceCheckUtils]: 20: Hoare triple {5534#false} assume 0 == ~cond; {5534#false} is VALID [2022-04-15 06:57:54,987 INFO L290 TraceCheckUtils]: 21: Hoare triple {5534#false} assume !false; {5534#false} is VALID [2022-04-15 06:57:54,988 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:57:54,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:57:54,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846427126] [2022-04-15 06:57:54,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846427126] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:57:54,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275660513] [2022-04-15 06:57:54,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:57:54,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:57:54,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:57:54,989 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:57:54,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-15 06:57:55,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:57:55,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 06:57:55,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:57:55,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:58:20,183 INFO L272 TraceCheckUtils]: 0: Hoare triple {5533#true} call ULTIMATE.init(); {5533#true} is VALID [2022-04-15 06:58:20,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {5533#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {5533#true} is VALID [2022-04-15 06:58:20,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {5533#true} assume true; {5533#true} is VALID [2022-04-15 06:58:20,183 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5533#true} {5533#true} #52#return; {5533#true} is VALID [2022-04-15 06:58:20,183 INFO L272 TraceCheckUtils]: 4: Hoare triple {5533#true} call #t~ret7 := main(); {5533#true} is VALID [2022-04-15 06:58:20,184 INFO L290 TraceCheckUtils]: 5: Hoare triple {5533#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {5568#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:58:20,184 INFO L290 TraceCheckUtils]: 6: Hoare triple {5568#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [100] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_305 v_main_~x~0_304)) (.cse1 (= |v_main_#t~post4_69| |v_main_#t~post4_68|))) (or (and .cse0 .cse1 (not (< v_main_~x~0_305 50000))) (and (< v_main_~x~0_304 50001) (< v_main_~x~0_305 v_main_~x~0_304)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_305, main_#t~post4=|v_main_#t~post4_69|} OutVars{main_~x~0=v_main_~x~0_304, main_#t~post4=|v_main_#t~post4_68|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {5568#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:58:20,185 INFO L290 TraceCheckUtils]: 7: Hoare triple {5568#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [101] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5568#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:58:20,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {5568#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [102] L10-2-->L17-1_primed: Formula: (let ((.cse2 (= v_main_~x~0_307 v_main_~x~0_306)) (.cse3 (= v_main_~y~0_252 v_main_~y~0_251)) (.cse1 (<= 50000 v_main_~x~0_307))) (or (let ((.cse0 (div (+ (* v_main_~x~0_306 (- 1)) v_main_~x~0_307) (- 2)))) (and (< .cse0 (+ 2 (div (+ (* v_main_~x~0_307 (- 1)) 999999) 2))) .cse1 (= (+ v_main_~y~0_252 (* .cse0 2)) v_main_~y~0_251) (< 0 .cse0) (= (mod (+ v_main_~x~0_307 v_main_~x~0_306) 2) 0))) (and .cse2 .cse3) (and .cse2 .cse3 (or (not (< v_main_~x~0_307 1000000)) (not .cse1))))) InVars {main_~x~0=v_main_~x~0_307, main_~y~0=v_main_~y~0_252} OutVars{main_~x~0=v_main_~x~0_306, main_~y~0=v_main_~y~0_251} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {5568#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:58:20,186 INFO L290 TraceCheckUtils]: 9: Hoare triple {5568#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [99] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {5568#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:58:20,187 INFO L290 TraceCheckUtils]: 10: Hoare triple {5568#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5584#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-15 06:58:20,188 INFO L290 TraceCheckUtils]: 11: Hoare triple {5584#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5588#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-15 06:58:20,188 INFO L290 TraceCheckUtils]: 12: Hoare triple {5588#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5592#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-15 06:58:20,189 INFO L290 TraceCheckUtils]: 13: Hoare triple {5592#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5596#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-15 06:58:20,189 INFO L290 TraceCheckUtils]: 14: Hoare triple {5596#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5600#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-15 06:58:20,190 INFO L290 TraceCheckUtils]: 15: Hoare triple {5600#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5604#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-15 06:58:20,190 INFO L290 TraceCheckUtils]: 16: Hoare triple {5604#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5608#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-15 06:58:20,191 INFO L290 TraceCheckUtils]: 17: Hoare triple {5608#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} assume !(~y~0 > ~z~0); {5534#false} is VALID [2022-04-15 06:58:20,191 INFO L272 TraceCheckUtils]: 18: Hoare triple {5534#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {5534#false} is VALID [2022-04-15 06:58:20,191 INFO L290 TraceCheckUtils]: 19: Hoare triple {5534#false} ~cond := #in~cond; {5534#false} is VALID [2022-04-15 06:58:20,191 INFO L290 TraceCheckUtils]: 20: Hoare triple {5534#false} assume 0 == ~cond; {5534#false} is VALID [2022-04-15 06:58:20,191 INFO L290 TraceCheckUtils]: 21: Hoare triple {5534#false} assume !false; {5534#false} is VALID [2022-04-15 06:58:20,191 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:58:20,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:58:45,164 INFO L290 TraceCheckUtils]: 21: Hoare triple {5534#false} assume !false; {5534#false} is VALID [2022-04-15 06:58:45,164 INFO L290 TraceCheckUtils]: 20: Hoare triple {5534#false} assume 0 == ~cond; {5534#false} is VALID [2022-04-15 06:58:45,164 INFO L290 TraceCheckUtils]: 19: Hoare triple {5534#false} ~cond := #in~cond; {5534#false} is VALID [2022-04-15 06:58:45,164 INFO L272 TraceCheckUtils]: 18: Hoare triple {5534#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {5534#false} is VALID [2022-04-15 06:58:45,165 INFO L290 TraceCheckUtils]: 17: Hoare triple {5636#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {5534#false} is VALID [2022-04-15 06:58:45,166 INFO L290 TraceCheckUtils]: 16: Hoare triple {5640#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5636#(< main_~z~0 main_~y~0)} is VALID [2022-04-15 06:58:45,166 INFO L290 TraceCheckUtils]: 15: Hoare triple {5644#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5640#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-15 06:58:45,167 INFO L290 TraceCheckUtils]: 14: Hoare triple {5648#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5644#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-15 06:58:45,168 INFO L290 TraceCheckUtils]: 13: Hoare triple {5652#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5648#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-15 06:58:45,168 INFO L290 TraceCheckUtils]: 12: Hoare triple {5656#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5652#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-15 06:58:45,169 INFO L290 TraceCheckUtils]: 11: Hoare triple {5660#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5656#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-15 06:58:45,170 INFO L290 TraceCheckUtils]: 10: Hoare triple {5664#(< (+ 7 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5660#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-15 06:58:45,170 INFO L290 TraceCheckUtils]: 9: Hoare triple {5664#(< (+ 7 main_~z~0) main_~y~0)} [99] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {5664#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-15 06:58:45,172 INFO L290 TraceCheckUtils]: 8: Hoare triple {5664#(< (+ 7 main_~z~0) main_~y~0)} [102] L10-2-->L17-1_primed: Formula: (let ((.cse2 (= v_main_~x~0_307 v_main_~x~0_306)) (.cse3 (= v_main_~y~0_252 v_main_~y~0_251)) (.cse1 (<= 50000 v_main_~x~0_307))) (or (let ((.cse0 (div (+ (* v_main_~x~0_306 (- 1)) v_main_~x~0_307) (- 2)))) (and (< .cse0 (+ 2 (div (+ (* v_main_~x~0_307 (- 1)) 999999) 2))) .cse1 (= (+ v_main_~y~0_252 (* .cse0 2)) v_main_~y~0_251) (< 0 .cse0) (= (mod (+ v_main_~x~0_307 v_main_~x~0_306) 2) 0))) (and .cse2 .cse3) (and .cse2 .cse3 (or (not (< v_main_~x~0_307 1000000)) (not .cse1))))) InVars {main_~x~0=v_main_~x~0_307, main_~y~0=v_main_~y~0_252} OutVars{main_~x~0=v_main_~x~0_306, main_~y~0=v_main_~y~0_251} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {5664#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-15 06:58:45,172 INFO L290 TraceCheckUtils]: 7: Hoare triple {5664#(< (+ 7 main_~z~0) main_~y~0)} [101] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5664#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-15 06:58:45,173 INFO L290 TraceCheckUtils]: 6: Hoare triple {5664#(< (+ 7 main_~z~0) main_~y~0)} [100] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_305 v_main_~x~0_304)) (.cse1 (= |v_main_#t~post4_69| |v_main_#t~post4_68|))) (or (and .cse0 .cse1 (not (< v_main_~x~0_305 50000))) (and (< v_main_~x~0_304 50001) (< v_main_~x~0_305 v_main_~x~0_304)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_305, main_#t~post4=|v_main_#t~post4_69|} OutVars{main_~x~0=v_main_~x~0_304, main_#t~post4=|v_main_#t~post4_68|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {5664#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-15 06:58:45,173 INFO L290 TraceCheckUtils]: 5: Hoare triple {5533#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {5664#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-15 06:58:45,173 INFO L272 TraceCheckUtils]: 4: Hoare triple {5533#true} call #t~ret7 := main(); {5533#true} is VALID [2022-04-15 06:58:45,174 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5533#true} {5533#true} #52#return; {5533#true} is VALID [2022-04-15 06:58:45,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {5533#true} assume true; {5533#true} is VALID [2022-04-15 06:58:45,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {5533#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {5533#true} is VALID [2022-04-15 06:58:45,174 INFO L272 TraceCheckUtils]: 0: Hoare triple {5533#true} call ULTIMATE.init(); {5533#true} is VALID [2022-04-15 06:58:45,174 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:58:45,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275660513] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:58:45,174 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:58:45,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 30 [2022-04-15 06:58:45,897 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:58:45,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1417832672] [2022-04-15 06:58:45,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1417832672] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:58:45,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:58:45,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-15 06:58:45,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777676620] [2022-04-15 06:58:45,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:58:45,898 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 27 states have internal predecessors, (47), 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 51 [2022-04-15 06:58:45,898 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:58:45,898 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 27 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:45,939 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:58:45,939 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-15 06:58:45,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:58:45,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-15 06:58:45,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=679, Invalid=1483, Unknown=0, NotChecked=0, Total=2162 [2022-04-15 06:58:45,940 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 28 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 27 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:48,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:58:48,229 INFO L93 Difference]: Finished difference Result 128 states and 138 transitions. [2022-04-15 06:58:48,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 06:58:48,229 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 27 states have internal predecessors, (47), 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 51 [2022-04-15 06:58:48,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:58:48,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 27 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:48,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 64 transitions. [2022-04-15 06:58:48,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 27 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:48,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 64 transitions. [2022-04-15 06:58:48,231 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 64 transitions. [2022-04-15 06:58:48,309 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:58:48,310 INFO L225 Difference]: With dead ends: 128 [2022-04-15 06:58:48,311 INFO L226 Difference]: Without dead ends: 84 [2022-04-15 06:58:48,312 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 973 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1040, Invalid=2992, Unknown=0, NotChecked=0, Total=4032 [2022-04-15 06:58:48,312 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 27 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-15 06:58:48,313 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 110 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-15 06:58:48,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-15 06:58:48,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-04-15 06:58:48,534 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:58:48,535 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 84 states, 79 states have (on average 1.0632911392405062) internal successors, (84), 79 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:48,535 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 84 states, 79 states have (on average 1.0632911392405062) internal successors, (84), 79 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:48,535 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 84 states, 79 states have (on average 1.0632911392405062) internal successors, (84), 79 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:48,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:58:48,536 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2022-04-15 06:58:48,536 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2022-04-15 06:58:48,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:58:48,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:58:48,537 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 79 states have (on average 1.0632911392405062) internal successors, (84), 79 states have internal predecessors, (84), 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 84 states. [2022-04-15 06:58:48,537 INFO L87 Difference]: Start difference. First operand has 84 states, 79 states have (on average 1.0632911392405062) internal successors, (84), 79 states have internal predecessors, (84), 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 84 states. [2022-04-15 06:58:48,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:58:48,538 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2022-04-15 06:58:48,539 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2022-04-15 06:58:48,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:58:48,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:58:48,539 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:58:48,539 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:58:48,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 79 states have (on average 1.0632911392405062) internal successors, (84), 79 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:48,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2022-04-15 06:58:48,541 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 51 [2022-04-15 06:58:48,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:58:48,541 INFO L478 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2022-04-15 06:58:48,541 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 27 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:48,541 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 88 transitions. [2022-04-15 06:58:48,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:58:48,635 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2022-04-15 06:58:48,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-15 06:58:48,635 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:58:48,636 INFO L499 BasicCegarLoop]: trace histogram [17, 16, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:58:48,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-15 06:58:48,836 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-15 06:58:48,836 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:58:48,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:58:48,837 INFO L85 PathProgramCache]: Analyzing trace with hash 622206457, now seen corresponding path program 12 times [2022-04-15 06:58:48,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:58:48,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [670663977] [2022-04-15 06:58:48,956 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:58:49,287 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:58:49,288 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:58:49,290 INFO L85 PathProgramCache]: Analyzing trace with hash -928132830, now seen corresponding path program 1 times [2022-04-15 06:58:49,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:58:49,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20773590] [2022-04-15 06:58:49,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:58:49,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:58:49,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:58:49,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:58:49,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:58:49,501 INFO L290 TraceCheckUtils]: 0: Hoare triple {6356#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {6340#true} is VALID [2022-04-15 06:58:49,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {6340#true} assume true; {6340#true} is VALID [2022-04-15 06:58:49,501 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6340#true} {6340#true} #52#return; {6340#true} is VALID [2022-04-15 06:58:49,502 INFO L272 TraceCheckUtils]: 0: Hoare triple {6340#true} call ULTIMATE.init(); {6356#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:58:49,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {6356#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {6340#true} is VALID [2022-04-15 06:58:49,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {6340#true} assume true; {6340#true} is VALID [2022-04-15 06:58:49,502 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6340#true} {6340#true} #52#return; {6340#true} is VALID [2022-04-15 06:58:49,502 INFO L272 TraceCheckUtils]: 4: Hoare triple {6340#true} call #t~ret7 := main(); {6340#true} is VALID [2022-04-15 06:58:49,502 INFO L290 TraceCheckUtils]: 5: Hoare triple {6340#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {6345#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:58:49,503 INFO L290 TraceCheckUtils]: 6: Hoare triple {6345#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} [104] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_344 v_main_~x~0_343)) (.cse1 (= |v_main_#t~post4_75| |v_main_#t~post4_74|))) (or (and (< v_main_~x~0_343 50001) (< v_main_~x~0_344 v_main_~x~0_343)) (and .cse0 .cse1) (and .cse0 (not (< v_main_~x~0_344 50000)) .cse1))) InVars {main_~x~0=v_main_~x~0_344, main_#t~post4=|v_main_#t~post4_75|} OutVars{main_~x~0=v_main_~x~0_343, main_#t~post4=|v_main_#t~post4_74|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {6346#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} is VALID [2022-04-15 06:58:49,504 INFO L290 TraceCheckUtils]: 7: Hoare triple {6346#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} [105] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6346#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} is VALID [2022-04-15 06:58:49,505 INFO L290 TraceCheckUtils]: 8: Hoare triple {6346#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} [106] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_346 v_main_~x~0_345)) (.cse1 (<= 50000 v_main_~x~0_346))) (or (and .cse0 (or (not (< v_main_~x~0_346 1000000)) (not .cse1)) (= v_main_~y~0_289 v_main_~y~0_290)) (and (= v_main_~y~0_290 v_main_~y~0_289) .cse0) (let ((.cse2 (div (+ v_main_~x~0_346 (* v_main_~x~0_345 (- 1))) (- 2)))) (and (= (mod (+ v_main_~x~0_346 v_main_~x~0_345) 2) 0) (< 0 .cse2) (< .cse2 (+ (div (+ 999999 (* v_main_~x~0_346 (- 1))) 2) 2)) (= v_main_~y~0_289 (+ v_main_~y~0_290 (* 2 .cse2))) .cse1)))) InVars {main_~x~0=v_main_~x~0_346, main_~y~0=v_main_~y~0_290} OutVars{main_~x~0=v_main_~x~0_345, main_~y~0=v_main_~y~0_289} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {6347#(or (and (= main_~z~0 0) (<= main_~x~0 main_~y~0)) (<= main_~x~0 50000))} is VALID [2022-04-15 06:58:49,505 INFO L290 TraceCheckUtils]: 9: Hoare triple {6347#(or (and (= main_~z~0 0) (<= main_~x~0 main_~y~0)) (<= main_~x~0 50000))} [103] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {6348#(and (= main_~z~0 0) (<= 1000000 main_~y~0))} is VALID [2022-04-15 06:58:49,506 INFO L290 TraceCheckUtils]: 10: Hoare triple {6348#(and (= main_~z~0 0) (<= 1000000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6349#(and (= main_~z~0 0) (<= 999999 main_~y~0))} is VALID [2022-04-15 06:58:49,507 INFO L290 TraceCheckUtils]: 11: Hoare triple {6349#(and (= main_~z~0 0) (<= 999999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6350#(and (= main_~z~0 0) (<= 999998 main_~y~0))} is VALID [2022-04-15 06:58:49,507 INFO L290 TraceCheckUtils]: 12: Hoare triple {6350#(and (= main_~z~0 0) (<= 999998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6351#(and (= main_~z~0 0) (<= 999997 main_~y~0))} is VALID [2022-04-15 06:58:49,508 INFO L290 TraceCheckUtils]: 13: Hoare triple {6351#(and (= main_~z~0 0) (<= 999997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6352#(and (<= 999996 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 06:58:49,508 INFO L290 TraceCheckUtils]: 14: Hoare triple {6352#(and (<= 999996 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6353#(and (= main_~z~0 0) (<= 999995 main_~y~0))} is VALID [2022-04-15 06:58:49,509 INFO L290 TraceCheckUtils]: 15: Hoare triple {6353#(and (= main_~z~0 0) (<= 999995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6354#(and (= main_~z~0 0) (<= 999994 main_~y~0))} is VALID [2022-04-15 06:58:49,509 INFO L290 TraceCheckUtils]: 16: Hoare triple {6354#(and (= main_~z~0 0) (<= 999994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6355#(and (= main_~z~0 0) (<= 999993 main_~y~0))} is VALID [2022-04-15 06:58:49,510 INFO L290 TraceCheckUtils]: 17: Hoare triple {6355#(and (= main_~z~0 0) (<= 999993 main_~y~0))} assume !(~y~0 > ~z~0); {6341#false} is VALID [2022-04-15 06:58:49,510 INFO L272 TraceCheckUtils]: 18: Hoare triple {6341#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {6341#false} is VALID [2022-04-15 06:58:49,510 INFO L290 TraceCheckUtils]: 19: Hoare triple {6341#false} ~cond := #in~cond; {6341#false} is VALID [2022-04-15 06:58:49,510 INFO L290 TraceCheckUtils]: 20: Hoare triple {6341#false} assume 0 == ~cond; {6341#false} is VALID [2022-04-15 06:58:49,510 INFO L290 TraceCheckUtils]: 21: Hoare triple {6341#false} assume !false; {6341#false} is VALID [2022-04-15 06:58:49,510 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:58:49,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:58:49,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20773590] [2022-04-15 06:58:49,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20773590] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:58:49,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369888273] [2022-04-15 06:58:49,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:58:49,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:58:49,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:58:49,512 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:58:49,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-15 06:58:49,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:58:49,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 06:58:49,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:58:49,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:59:34,678 INFO L272 TraceCheckUtils]: 0: Hoare triple {6340#true} call ULTIMATE.init(); {6340#true} is VALID [2022-04-15 06:59:34,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {6340#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {6340#true} is VALID [2022-04-15 06:59:34,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {6340#true} assume true; {6340#true} is VALID [2022-04-15 06:59:34,679 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6340#true} {6340#true} #52#return; {6340#true} is VALID [2022-04-15 06:59:34,679 INFO L272 TraceCheckUtils]: 4: Hoare triple {6340#true} call #t~ret7 := main(); {6340#true} is VALID [2022-04-15 06:59:34,679 INFO L290 TraceCheckUtils]: 5: Hoare triple {6340#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {6375#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:59:34,680 INFO L290 TraceCheckUtils]: 6: Hoare triple {6375#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [104] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_344 v_main_~x~0_343)) (.cse1 (= |v_main_#t~post4_75| |v_main_#t~post4_74|))) (or (and (< v_main_~x~0_343 50001) (< v_main_~x~0_344 v_main_~x~0_343)) (and .cse0 .cse1) (and .cse0 (not (< v_main_~x~0_344 50000)) .cse1))) InVars {main_~x~0=v_main_~x~0_344, main_#t~post4=|v_main_#t~post4_75|} OutVars{main_~x~0=v_main_~x~0_343, main_#t~post4=|v_main_#t~post4_74|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {6375#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:59:34,680 INFO L290 TraceCheckUtils]: 7: Hoare triple {6375#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [105] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6375#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:59:34,681 INFO L290 TraceCheckUtils]: 8: Hoare triple {6375#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [106] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_346 v_main_~x~0_345)) (.cse1 (<= 50000 v_main_~x~0_346))) (or (and .cse0 (or (not (< v_main_~x~0_346 1000000)) (not .cse1)) (= v_main_~y~0_289 v_main_~y~0_290)) (and (= v_main_~y~0_290 v_main_~y~0_289) .cse0) (let ((.cse2 (div (+ v_main_~x~0_346 (* v_main_~x~0_345 (- 1))) (- 2)))) (and (= (mod (+ v_main_~x~0_346 v_main_~x~0_345) 2) 0) (< 0 .cse2) (< .cse2 (+ (div (+ 999999 (* v_main_~x~0_346 (- 1))) 2) 2)) (= v_main_~y~0_289 (+ v_main_~y~0_290 (* 2 .cse2))) .cse1)))) InVars {main_~x~0=v_main_~x~0_346, main_~y~0=v_main_~y~0_290} OutVars{main_~x~0=v_main_~x~0_345, main_~y~0=v_main_~y~0_289} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {6375#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:59:34,682 INFO L290 TraceCheckUtils]: 9: Hoare triple {6375#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [103] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {6375#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:59:34,682 INFO L290 TraceCheckUtils]: 10: Hoare triple {6375#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6391#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-15 06:59:34,683 INFO L290 TraceCheckUtils]: 11: Hoare triple {6391#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6395#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-15 06:59:34,684 INFO L290 TraceCheckUtils]: 12: Hoare triple {6395#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6399#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-15 06:59:34,684 INFO L290 TraceCheckUtils]: 13: Hoare triple {6399#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6403#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-15 06:59:34,685 INFO L290 TraceCheckUtils]: 14: Hoare triple {6403#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6407#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-15 06:59:34,685 INFO L290 TraceCheckUtils]: 15: Hoare triple {6407#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6411#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-15 06:59:34,686 INFO L290 TraceCheckUtils]: 16: Hoare triple {6411#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6415#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-15 06:59:34,686 INFO L290 TraceCheckUtils]: 17: Hoare triple {6415#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} assume !(~y~0 > ~z~0); {6341#false} is VALID [2022-04-15 06:59:34,686 INFO L272 TraceCheckUtils]: 18: Hoare triple {6341#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {6341#false} is VALID [2022-04-15 06:59:34,686 INFO L290 TraceCheckUtils]: 19: Hoare triple {6341#false} ~cond := #in~cond; {6341#false} is VALID [2022-04-15 06:59:34,687 INFO L290 TraceCheckUtils]: 20: Hoare triple {6341#false} assume 0 == ~cond; {6341#false} is VALID [2022-04-15 06:59:34,687 INFO L290 TraceCheckUtils]: 21: Hoare triple {6341#false} assume !false; {6341#false} is VALID [2022-04-15 06:59:34,687 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:59:34,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:59:51,204 INFO L290 TraceCheckUtils]: 21: Hoare triple {6341#false} assume !false; {6341#false} is VALID [2022-04-15 06:59:51,205 INFO L290 TraceCheckUtils]: 20: Hoare triple {6341#false} assume 0 == ~cond; {6341#false} is VALID [2022-04-15 06:59:51,205 INFO L290 TraceCheckUtils]: 19: Hoare triple {6341#false} ~cond := #in~cond; {6341#false} is VALID [2022-04-15 06:59:51,205 INFO L272 TraceCheckUtils]: 18: Hoare triple {6341#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {6341#false} is VALID [2022-04-15 06:59:51,207 INFO L290 TraceCheckUtils]: 17: Hoare triple {6443#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {6341#false} is VALID [2022-04-15 06:59:51,208 INFO L290 TraceCheckUtils]: 16: Hoare triple {6447#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6443#(< main_~z~0 main_~y~0)} is VALID [2022-04-15 06:59:51,209 INFO L290 TraceCheckUtils]: 15: Hoare triple {6451#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6447#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-15 06:59:51,210 INFO L290 TraceCheckUtils]: 14: Hoare triple {6455#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6451#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-15 06:59:51,211 INFO L290 TraceCheckUtils]: 13: Hoare triple {6459#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6455#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-15 06:59:51,212 INFO L290 TraceCheckUtils]: 12: Hoare triple {6463#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6459#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-15 06:59:51,212 INFO L290 TraceCheckUtils]: 11: Hoare triple {6467#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6463#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-15 06:59:51,213 INFO L290 TraceCheckUtils]: 10: Hoare triple {6471#(< (+ 7 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6467#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-15 06:59:51,214 INFO L290 TraceCheckUtils]: 9: Hoare triple {6471#(< (+ 7 main_~z~0) main_~y~0)} [103] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {6471#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-15 06:59:51,217 INFO L290 TraceCheckUtils]: 8: Hoare triple {6471#(< (+ 7 main_~z~0) main_~y~0)} [106] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_346 v_main_~x~0_345)) (.cse1 (<= 50000 v_main_~x~0_346))) (or (and .cse0 (or (not (< v_main_~x~0_346 1000000)) (not .cse1)) (= v_main_~y~0_289 v_main_~y~0_290)) (and (= v_main_~y~0_290 v_main_~y~0_289) .cse0) (let ((.cse2 (div (+ v_main_~x~0_346 (* v_main_~x~0_345 (- 1))) (- 2)))) (and (= (mod (+ v_main_~x~0_346 v_main_~x~0_345) 2) 0) (< 0 .cse2) (< .cse2 (+ (div (+ 999999 (* v_main_~x~0_346 (- 1))) 2) 2)) (= v_main_~y~0_289 (+ v_main_~y~0_290 (* 2 .cse2))) .cse1)))) InVars {main_~x~0=v_main_~x~0_346, main_~y~0=v_main_~y~0_290} OutVars{main_~x~0=v_main_~x~0_345, main_~y~0=v_main_~y~0_289} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {6471#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-15 06:59:51,217 INFO L290 TraceCheckUtils]: 7: Hoare triple {6471#(< (+ 7 main_~z~0) main_~y~0)} [105] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6471#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-15 06:59:51,218 INFO L290 TraceCheckUtils]: 6: Hoare triple {6471#(< (+ 7 main_~z~0) main_~y~0)} [104] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_344 v_main_~x~0_343)) (.cse1 (= |v_main_#t~post4_75| |v_main_#t~post4_74|))) (or (and (< v_main_~x~0_343 50001) (< v_main_~x~0_344 v_main_~x~0_343)) (and .cse0 .cse1) (and .cse0 (not (< v_main_~x~0_344 50000)) .cse1))) InVars {main_~x~0=v_main_~x~0_344, main_#t~post4=|v_main_#t~post4_75|} OutVars{main_~x~0=v_main_~x~0_343, main_#t~post4=|v_main_#t~post4_74|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {6471#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-15 06:59:51,218 INFO L290 TraceCheckUtils]: 5: Hoare triple {6340#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {6471#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-15 06:59:51,218 INFO L272 TraceCheckUtils]: 4: Hoare triple {6340#true} call #t~ret7 := main(); {6340#true} is VALID [2022-04-15 06:59:51,219 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6340#true} {6340#true} #52#return; {6340#true} is VALID [2022-04-15 06:59:51,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {6340#true} assume true; {6340#true} is VALID [2022-04-15 06:59:51,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {6340#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {6340#true} is VALID [2022-04-15 06:59:51,219 INFO L272 TraceCheckUtils]: 0: Hoare triple {6340#true} call ULTIMATE.init(); {6340#true} is VALID [2022-04-15 06:59:51,219 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:59:51,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369888273] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:59:51,219 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:59:51,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 30 [2022-04-15 06:59:52,023 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:59:52,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [670663977] [2022-04-15 06:59:52,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [670663977] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:59:52,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:59:52,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-15 06:59:52,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078782309] [2022-04-15 06:59:52,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:59:52,024 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 28 states have internal predecessors, (49), 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 53 [2022-04-15 06:59:52,024 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:59:52,024 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 28 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:52,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:59:52,067 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-15 06:59:52,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:59:52,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-15 06:59:52,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=698, Invalid=1558, Unknown=0, NotChecked=0, Total=2256 [2022-04-15 06:59:52,068 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand has 29 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 28 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:54,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:59:54,799 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2022-04-15 06:59:54,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 06:59:54,800 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 28 states have internal predecessors, (49), 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 53 [2022-04-15 06:59:54,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:59:54,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 28 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:54,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 65 transitions. [2022-04-15 06:59:54,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 28 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:54,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 65 transitions. [2022-04-15 06:59:54,802 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 65 transitions. [2022-04-15 06:59:54,871 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:59:54,872 INFO L225 Difference]: With dead ends: 130 [2022-04-15 06:59:54,872 INFO L226 Difference]: Without dead ends: 86 [2022-04-15 06:59:54,874 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1080, Invalid=3210, Unknown=0, NotChecked=0, Total=4290 [2022-04-15 06:59:54,874 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 28 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 855 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:59:54,874 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 110 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 855 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-15 06:59:54,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-15 06:59:55,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-04-15 06:59:55,131 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:59:55,131 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 86 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 81 states have internal predecessors, (86), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:55,131 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 86 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 81 states have internal predecessors, (86), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:55,131 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 86 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 81 states have internal predecessors, (86), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:55,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:59:55,133 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2022-04-15 06:59:55,133 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2022-04-15 06:59:55,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:59:55,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:59:55,133 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 81 states have internal predecessors, (86), 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 86 states. [2022-04-15 06:59:55,133 INFO L87 Difference]: Start difference. First operand has 86 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 81 states have internal predecessors, (86), 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 86 states. [2022-04-15 06:59:55,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:59:55,135 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2022-04-15 06:59:55,135 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2022-04-15 06:59:55,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:59:55,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:59:55,135 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:59:55,135 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:59:55,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 81 states have internal predecessors, (86), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:55,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2022-04-15 06:59:55,137 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 53 [2022-04-15 06:59:55,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:59:55,137 INFO L478 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2022-04-15 06:59:55,137 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 28 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:55,137 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 90 transitions. [2022-04-15 06:59:55,246 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:59:55,246 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2022-04-15 06:59:55,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-15 06:59:55,246 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:59:55,246 INFO L499 BasicCegarLoop]: trace histogram [18, 17, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:59:55,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-15 06:59:55,447 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-15 06:59:55,447 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:59:55,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:59:55,448 INFO L85 PathProgramCache]: Analyzing trace with hash -446245484, now seen corresponding path program 13 times [2022-04-15 06:59:55,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:59:55,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1020208106] [2022-04-15 06:59:55,572 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:59:55,912 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:59:55,913 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:59:55,917 INFO L85 PathProgramCache]: Analyzing trace with hash -135908830, now seen corresponding path program 1 times [2022-04-15 06:59:55,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:59:55,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078931829] [2022-04-15 06:59:55,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:59:55,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:59:55,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:59:56,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:59:56,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:59:56,157 INFO L290 TraceCheckUtils]: 0: Hoare triple {7178#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {7162#true} is VALID [2022-04-15 06:59:56,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {7162#true} assume true; {7162#true} is VALID [2022-04-15 06:59:56,157 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7162#true} {7162#true} #52#return; {7162#true} is VALID [2022-04-15 06:59:56,158 INFO L272 TraceCheckUtils]: 0: Hoare triple {7162#true} call ULTIMATE.init(); {7178#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:59:56,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {7178#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {7162#true} is VALID [2022-04-15 06:59:56,158 INFO L290 TraceCheckUtils]: 2: Hoare triple {7162#true} assume true; {7162#true} is VALID [2022-04-15 06:59:56,158 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7162#true} {7162#true} #52#return; {7162#true} is VALID [2022-04-15 06:59:56,158 INFO L272 TraceCheckUtils]: 4: Hoare triple {7162#true} call #t~ret7 := main(); {7162#true} is VALID [2022-04-15 06:59:56,159 INFO L290 TraceCheckUtils]: 5: Hoare triple {7162#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {7167#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:59:56,160 INFO L290 TraceCheckUtils]: 6: Hoare triple {7167#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} [108] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_384 v_main_~x~0_383)) (.cse1 (= |v_main_#t~post4_81| |v_main_#t~post4_80|))) (or (and .cse0 .cse1) (and (<= 50000 v_main_~x~0_384) .cse0 .cse1) (and (< v_main_~x~0_383 50001) (< v_main_~x~0_384 v_main_~x~0_383)))) InVars {main_~x~0=v_main_~x~0_384, main_#t~post4=|v_main_#t~post4_81|} OutVars{main_~x~0=v_main_~x~0_383, main_#t~post4=|v_main_#t~post4_80|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {7168#(and (<= main_~x~0 999999) (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:59:56,160 INFO L290 TraceCheckUtils]: 7: Hoare triple {7168#(and (<= main_~x~0 999999) (= main_~z~0 0) (<= 50000 main_~y~0))} [109] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7168#(and (<= main_~x~0 999999) (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:59:56,162 INFO L290 TraceCheckUtils]: 8: Hoare triple {7168#(and (<= main_~x~0 999999) (= main_~z~0 0) (<= 50000 main_~y~0))} [110] L10-2-->L17-1_primed: Formula: (let ((.cse0 (<= 50000 v_main_~x~0_386)) (.cse2 (= v_main_~y~0_329 v_main_~y~0_328)) (.cse3 (= v_main_~x~0_386 v_main_~x~0_385))) (or (let ((.cse1 (div (+ (* (- 1) v_main_~y~0_328) v_main_~y~0_329) (- 2)))) (and .cse0 (= (mod (+ v_main_~y~0_329 v_main_~y~0_328) 2) 0) (< 0 .cse1) (< .cse1 (+ 2 (div (+ 999999 (* v_main_~x~0_386 (- 1))) 2))) (= v_main_~x~0_385 (+ v_main_~x~0_386 (* 2 .cse1))))) (and .cse2 .cse3 (or (not (< v_main_~x~0_386 1000000)) (not .cse0))) (and .cse2 .cse3))) InVars {main_~x~0=v_main_~x~0_386, main_~y~0=v_main_~y~0_329} OutVars{main_~x~0=v_main_~x~0_385, main_~y~0=v_main_~y~0_328} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {7169#(or (<= main_~x~0 999999) (and (= main_~z~0 0) (<= 50001 main_~y~0)))} is VALID [2022-04-15 06:59:56,162 INFO L290 TraceCheckUtils]: 9: Hoare triple {7169#(or (<= main_~x~0 999999) (and (= main_~z~0 0) (<= 50001 main_~y~0)))} [107] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {7170#(and (= main_~z~0 0) (<= 50001 main_~y~0))} is VALID [2022-04-15 06:59:56,163 INFO L290 TraceCheckUtils]: 10: Hoare triple {7170#(and (= main_~z~0 0) (<= 50001 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7171#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:59:56,164 INFO L290 TraceCheckUtils]: 11: Hoare triple {7171#(and (= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7172#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-15 06:59:56,165 INFO L290 TraceCheckUtils]: 12: Hoare triple {7172#(and (= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7173#(and (<= 49998 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 06:59:56,165 INFO L290 TraceCheckUtils]: 13: Hoare triple {7173#(and (<= 49998 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7174#(and (= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-15 06:59:56,166 INFO L290 TraceCheckUtils]: 14: Hoare triple {7174#(and (= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7175#(and (= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-15 06:59:56,167 INFO L290 TraceCheckUtils]: 15: Hoare triple {7175#(and (= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7176#(and (= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-15 06:59:56,168 INFO L290 TraceCheckUtils]: 16: Hoare triple {7176#(and (= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7177#(and (= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-15 06:59:56,168 INFO L290 TraceCheckUtils]: 17: Hoare triple {7177#(and (= main_~z~0 0) (<= 49994 main_~y~0))} assume !(~y~0 > ~z~0); {7163#false} is VALID [2022-04-15 06:59:56,168 INFO L272 TraceCheckUtils]: 18: Hoare triple {7163#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {7163#false} is VALID [2022-04-15 06:59:56,169 INFO L290 TraceCheckUtils]: 19: Hoare triple {7163#false} ~cond := #in~cond; {7163#false} is VALID [2022-04-15 06:59:56,169 INFO L290 TraceCheckUtils]: 20: Hoare triple {7163#false} assume 0 == ~cond; {7163#false} is VALID [2022-04-15 06:59:56,169 INFO L290 TraceCheckUtils]: 21: Hoare triple {7163#false} assume !false; {7163#false} is VALID [2022-04-15 06:59:56,169 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:59:56,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:59:56,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078931829] [2022-04-15 06:59:56,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078931829] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:59:56,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090652716] [2022-04-15 06:59:56,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:59:56,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:59:56,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:59:56,171 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:59:56,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-15 06:59:56,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:59:56,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 06:59:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:59:56,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:00:20,870 INFO L272 TraceCheckUtils]: 0: Hoare triple {7162#true} call ULTIMATE.init(); {7162#true} is VALID [2022-04-15 07:00:20,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {7162#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {7162#true} is VALID [2022-04-15 07:00:20,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {7162#true} assume true; {7162#true} is VALID [2022-04-15 07:00:20,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7162#true} {7162#true} #52#return; {7162#true} is VALID [2022-04-15 07:00:20,870 INFO L272 TraceCheckUtils]: 4: Hoare triple {7162#true} call #t~ret7 := main(); {7162#true} is VALID [2022-04-15 07:00:20,871 INFO L290 TraceCheckUtils]: 5: Hoare triple {7162#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {7197#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 07:00:20,871 INFO L290 TraceCheckUtils]: 6: Hoare triple {7197#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [108] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_384 v_main_~x~0_383)) (.cse1 (= |v_main_#t~post4_81| |v_main_#t~post4_80|))) (or (and .cse0 .cse1) (and (<= 50000 v_main_~x~0_384) .cse0 .cse1) (and (< v_main_~x~0_383 50001) (< v_main_~x~0_384 v_main_~x~0_383)))) InVars {main_~x~0=v_main_~x~0_384, main_#t~post4=|v_main_#t~post4_81|} OutVars{main_~x~0=v_main_~x~0_383, main_#t~post4=|v_main_#t~post4_80|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {7197#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 07:00:20,871 INFO L290 TraceCheckUtils]: 7: Hoare triple {7197#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [109] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7197#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 07:00:20,873 INFO L290 TraceCheckUtils]: 8: Hoare triple {7197#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [110] L10-2-->L17-1_primed: Formula: (let ((.cse0 (<= 50000 v_main_~x~0_386)) (.cse2 (= v_main_~y~0_329 v_main_~y~0_328)) (.cse3 (= v_main_~x~0_386 v_main_~x~0_385))) (or (let ((.cse1 (div (+ (* (- 1) v_main_~y~0_328) v_main_~y~0_329) (- 2)))) (and .cse0 (= (mod (+ v_main_~y~0_329 v_main_~y~0_328) 2) 0) (< 0 .cse1) (< .cse1 (+ 2 (div (+ 999999 (* v_main_~x~0_386 (- 1))) 2))) (= v_main_~x~0_385 (+ v_main_~x~0_386 (* 2 .cse1))))) (and .cse2 .cse3 (or (not (< v_main_~x~0_386 1000000)) (not .cse0))) (and .cse2 .cse3))) InVars {main_~x~0=v_main_~x~0_386, main_~y~0=v_main_~y~0_329} OutVars{main_~x~0=v_main_~x~0_385, main_~y~0=v_main_~y~0_328} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {7197#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 07:00:20,873 INFO L290 TraceCheckUtils]: 9: Hoare triple {7197#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [107] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {7197#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 07:00:20,874 INFO L290 TraceCheckUtils]: 10: Hoare triple {7197#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7213#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-15 07:00:20,874 INFO L290 TraceCheckUtils]: 11: Hoare triple {7213#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7217#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-15 07:00:20,875 INFO L290 TraceCheckUtils]: 12: Hoare triple {7217#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7221#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-15 07:00:20,876 INFO L290 TraceCheckUtils]: 13: Hoare triple {7221#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7225#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-15 07:00:20,876 INFO L290 TraceCheckUtils]: 14: Hoare triple {7225#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7229#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-15 07:00:20,877 INFO L290 TraceCheckUtils]: 15: Hoare triple {7229#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7233#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-15 07:00:20,877 INFO L290 TraceCheckUtils]: 16: Hoare triple {7233#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7237#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-15 07:00:20,878 INFO L290 TraceCheckUtils]: 17: Hoare triple {7237#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} assume !(~y~0 > ~z~0); {7163#false} is VALID [2022-04-15 07:00:20,878 INFO L272 TraceCheckUtils]: 18: Hoare triple {7163#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {7163#false} is VALID [2022-04-15 07:00:20,878 INFO L290 TraceCheckUtils]: 19: Hoare triple {7163#false} ~cond := #in~cond; {7163#false} is VALID [2022-04-15 07:00:20,878 INFO L290 TraceCheckUtils]: 20: Hoare triple {7163#false} assume 0 == ~cond; {7163#false} is VALID [2022-04-15 07:00:20,878 INFO L290 TraceCheckUtils]: 21: Hoare triple {7163#false} assume !false; {7163#false} is VALID [2022-04-15 07:00:20,878 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 07:00:20,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:00:45,724 INFO L290 TraceCheckUtils]: 21: Hoare triple {7163#false} assume !false; {7163#false} is VALID [2022-04-15 07:00:45,724 INFO L290 TraceCheckUtils]: 20: Hoare triple {7163#false} assume 0 == ~cond; {7163#false} is VALID [2022-04-15 07:00:45,724 INFO L290 TraceCheckUtils]: 19: Hoare triple {7163#false} ~cond := #in~cond; {7163#false} is VALID [2022-04-15 07:00:45,724 INFO L272 TraceCheckUtils]: 18: Hoare triple {7163#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {7163#false} is VALID [2022-04-15 07:00:45,724 INFO L290 TraceCheckUtils]: 17: Hoare triple {7265#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {7163#false} is VALID [2022-04-15 07:00:45,725 INFO L290 TraceCheckUtils]: 16: Hoare triple {7269#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7265#(< main_~z~0 main_~y~0)} is VALID [2022-04-15 07:00:45,725 INFO L290 TraceCheckUtils]: 15: Hoare triple {7273#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7269#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-15 07:00:45,726 INFO L290 TraceCheckUtils]: 14: Hoare triple {7277#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7273#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-15 07:00:45,727 INFO L290 TraceCheckUtils]: 13: Hoare triple {7281#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7277#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-15 07:00:45,727 INFO L290 TraceCheckUtils]: 12: Hoare triple {7285#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7281#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-15 07:00:45,728 INFO L290 TraceCheckUtils]: 11: Hoare triple {7289#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7285#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-15 07:00:45,728 INFO L290 TraceCheckUtils]: 10: Hoare triple {7293#(< (+ 7 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7289#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-15 07:00:45,729 INFO L290 TraceCheckUtils]: 9: Hoare triple {7293#(< (+ 7 main_~z~0) main_~y~0)} [107] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {7293#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-15 07:00:45,730 INFO L290 TraceCheckUtils]: 8: Hoare triple {7293#(< (+ 7 main_~z~0) main_~y~0)} [110] L10-2-->L17-1_primed: Formula: (let ((.cse0 (<= 50000 v_main_~x~0_386)) (.cse2 (= v_main_~y~0_329 v_main_~y~0_328)) (.cse3 (= v_main_~x~0_386 v_main_~x~0_385))) (or (let ((.cse1 (div (+ (* (- 1) v_main_~y~0_328) v_main_~y~0_329) (- 2)))) (and .cse0 (= (mod (+ v_main_~y~0_329 v_main_~y~0_328) 2) 0) (< 0 .cse1) (< .cse1 (+ 2 (div (+ 999999 (* v_main_~x~0_386 (- 1))) 2))) (= v_main_~x~0_385 (+ v_main_~x~0_386 (* 2 .cse1))))) (and .cse2 .cse3 (or (not (< v_main_~x~0_386 1000000)) (not .cse0))) (and .cse2 .cse3))) InVars {main_~x~0=v_main_~x~0_386, main_~y~0=v_main_~y~0_329} OutVars{main_~x~0=v_main_~x~0_385, main_~y~0=v_main_~y~0_328} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {7293#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-15 07:00:45,730 INFO L290 TraceCheckUtils]: 7: Hoare triple {7293#(< (+ 7 main_~z~0) main_~y~0)} [109] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7293#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-15 07:00:45,730 INFO L290 TraceCheckUtils]: 6: Hoare triple {7293#(< (+ 7 main_~z~0) main_~y~0)} [108] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_384 v_main_~x~0_383)) (.cse1 (= |v_main_#t~post4_81| |v_main_#t~post4_80|))) (or (and .cse0 .cse1) (and (<= 50000 v_main_~x~0_384) .cse0 .cse1) (and (< v_main_~x~0_383 50001) (< v_main_~x~0_384 v_main_~x~0_383)))) InVars {main_~x~0=v_main_~x~0_384, main_#t~post4=|v_main_#t~post4_81|} OutVars{main_~x~0=v_main_~x~0_383, main_#t~post4=|v_main_#t~post4_80|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {7293#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-15 07:00:45,731 INFO L290 TraceCheckUtils]: 5: Hoare triple {7162#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {7293#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-15 07:00:45,731 INFO L272 TraceCheckUtils]: 4: Hoare triple {7162#true} call #t~ret7 := main(); {7162#true} is VALID [2022-04-15 07:00:45,731 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7162#true} {7162#true} #52#return; {7162#true} is VALID [2022-04-15 07:00:45,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {7162#true} assume true; {7162#true} is VALID [2022-04-15 07:00:45,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {7162#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {7162#true} is VALID [2022-04-15 07:00:45,731 INFO L272 TraceCheckUtils]: 0: Hoare triple {7162#true} call ULTIMATE.init(); {7162#true} is VALID [2022-04-15 07:00:45,731 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 07:00:45,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090652716] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:00:45,732 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 07:00:45,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 30 [2022-04-15 07:00:46,497 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:00:46,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1020208106] [2022-04-15 07:00:46,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1020208106] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:00:46,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:00:46,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-15 07:00:46,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446536694] [2022-04-15 07:00:46,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:00:46,498 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.7) internal successors, (51), 29 states have internal predecessors, (51), 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 55 [2022-04-15 07:00:46,499 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:00:46,499 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 1.7) internal successors, (51), 29 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:46,556 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:00:46,556 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-15 07:00:46,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:00:46,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-15 07:00:46,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=894, Invalid=1458, Unknown=0, NotChecked=0, Total=2352 [2022-04-15 07:00:46,557 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand has 30 states, 30 states have (on average 1.7) internal successors, (51), 29 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:49,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:00:49,499 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2022-04-15 07:00:49,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-15 07:00:49,499 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.7) internal successors, (51), 29 states have internal predecessors, (51), 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 55 [2022-04-15 07:00:49,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:00:49,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.7) internal successors, (51), 29 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:49,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 76 transitions. [2022-04-15 07:00:49,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.7) internal successors, (51), 29 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:49,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 76 transitions. [2022-04-15 07:00:49,502 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 76 transitions. [2022-04-15 07:00:49,571 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:00:49,572 INFO L225 Difference]: With dead ends: 133 [2022-04-15 07:00:49,572 INFO L226 Difference]: Without dead ends: 89 [2022-04-15 07:00:49,573 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1630 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1810, Invalid=3890, Unknown=0, NotChecked=0, Total=5700 [2022-04-15 07:00:49,574 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 110 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:00:49,574 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 35 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 849 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-15 07:00:49,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-15 07:00:49,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-04-15 07:00:49,819 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:00:49,820 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 89 states, 84 states have (on average 1.0595238095238095) internal successors, (89), 84 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:49,820 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 89 states, 84 states have (on average 1.0595238095238095) internal successors, (89), 84 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:49,820 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 89 states, 84 states have (on average 1.0595238095238095) internal successors, (89), 84 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:49,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:00:49,822 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2022-04-15 07:00:49,822 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2022-04-15 07:00:49,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:00:49,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:00:49,822 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 84 states have (on average 1.0595238095238095) internal successors, (89), 84 states have internal predecessors, (89), 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 89 states. [2022-04-15 07:00:49,822 INFO L87 Difference]: Start difference. First operand has 89 states, 84 states have (on average 1.0595238095238095) internal successors, (89), 84 states have internal predecessors, (89), 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 89 states. [2022-04-15 07:00:49,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:00:49,824 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2022-04-15 07:00:49,824 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2022-04-15 07:00:49,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:00:49,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:00:49,824 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:00:49,824 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:00:49,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 84 states have (on average 1.0595238095238095) internal successors, (89), 84 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:49,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2022-04-15 07:00:49,826 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 55 [2022-04-15 07:00:49,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:00:49,826 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2022-04-15 07:00:49,826 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.7) internal successors, (51), 29 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:49,827 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 89 states and 93 transitions. [2022-04-15 07:00:49,932 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:00:49,933 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2022-04-15 07:00:49,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-15 07:00:49,933 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:00:49,933 INFO L499 BasicCegarLoop]: trace histogram [19, 18, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:00:49,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-15 07:00:50,134 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-15 07:00:50,134 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:00:50,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:00:50,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1162314028, now seen corresponding path program 14 times [2022-04-15 07:00:50,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:00:50,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2111424615] [2022-04-15 07:00:50,290 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:00:50,648 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:00:50,649 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:00:50,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1093528447, now seen corresponding path program 1 times [2022-04-15 07:00:50,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:00:50,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923118072] [2022-04-15 07:00:50,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:00:50,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:00:50,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:00:50,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:00:50,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:00:50,937 INFO L290 TraceCheckUtils]: 0: Hoare triple {8038#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {8021#true} is VALID [2022-04-15 07:00:50,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {8021#true} assume true; {8021#true} is VALID [2022-04-15 07:00:50,937 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8021#true} {8021#true} #52#return; {8021#true} is VALID [2022-04-15 07:00:50,937 INFO L272 TraceCheckUtils]: 0: Hoare triple {8021#true} call ULTIMATE.init(); {8038#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:00:50,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {8038#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {8021#true} is VALID [2022-04-15 07:00:50,937 INFO L290 TraceCheckUtils]: 2: Hoare triple {8021#true} assume true; {8021#true} is VALID [2022-04-15 07:00:50,938 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8021#true} {8021#true} #52#return; {8021#true} is VALID [2022-04-15 07:00:50,938 INFO L272 TraceCheckUtils]: 4: Hoare triple {8021#true} call #t~ret7 := main(); {8021#true} is VALID [2022-04-15 07:00:50,938 INFO L290 TraceCheckUtils]: 5: Hoare triple {8021#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {8026#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 07:00:50,939 INFO L290 TraceCheckUtils]: 6: Hoare triple {8026#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} [112] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_425 v_main_~x~0_424)) (.cse1 (= |v_main_#t~post4_87| |v_main_#t~post4_86|))) (or (and (< v_main_~x~0_425 v_main_~x~0_424) (< v_main_~x~0_424 50001)) (and .cse0 .cse1) (and (<= 50000 v_main_~x~0_425) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_425, main_#t~post4=|v_main_#t~post4_87|} OutVars{main_~x~0=v_main_~x~0_424, main_#t~post4=|v_main_#t~post4_86|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {8027#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} is VALID [2022-04-15 07:00:50,939 INFO L290 TraceCheckUtils]: 7: Hoare triple {8027#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} [113] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8027#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} is VALID [2022-04-15 07:00:50,941 INFO L290 TraceCheckUtils]: 8: Hoare triple {8027#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} [114] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_369 v_main_~y~0_368)) (.cse2 (= v_main_~x~0_427 v_main_~x~0_426)) (.cse1 (<= 50000 v_main_~x~0_427))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_427 1000000))) .cse2) (and .cse0 .cse2) (let ((.cse3 (div (+ v_main_~x~0_427 (* v_main_~x~0_426 (- 1))) (- 2)))) (and (= (mod (+ v_main_~x~0_427 v_main_~x~0_426) 2) 0) (< .cse3 (+ (div (+ 999999 (* v_main_~x~0_427 (- 1))) 2) 2)) (< 0 .cse3) .cse1 (= v_main_~y~0_368 (+ v_main_~y~0_369 (* .cse3 2))))))) InVars {main_~x~0=v_main_~x~0_427, main_~y~0=v_main_~y~0_369} OutVars{main_~x~0=v_main_~x~0_426, main_~y~0=v_main_~y~0_368} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {8028#(or (and (= main_~z~0 0) (<= main_~x~0 main_~y~0)) (<= main_~x~0 50000))} is VALID [2022-04-15 07:00:50,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {8028#(or (and (= main_~z~0 0) (<= main_~x~0 main_~y~0)) (<= main_~x~0 50000))} [111] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {8029#(and (= main_~z~0 0) (<= 1000000 main_~y~0))} is VALID [2022-04-15 07:00:50,942 INFO L290 TraceCheckUtils]: 10: Hoare triple {8029#(and (= main_~z~0 0) (<= 1000000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8030#(and (= main_~z~0 0) (<= 999999 main_~y~0))} is VALID [2022-04-15 07:00:50,943 INFO L290 TraceCheckUtils]: 11: Hoare triple {8030#(and (= main_~z~0 0) (<= 999999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8031#(and (= main_~z~0 0) (<= 999998 main_~y~0))} is VALID [2022-04-15 07:00:50,943 INFO L290 TraceCheckUtils]: 12: Hoare triple {8031#(and (= main_~z~0 0) (<= 999998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8032#(and (= main_~z~0 0) (<= 999997 main_~y~0))} is VALID [2022-04-15 07:00:50,944 INFO L290 TraceCheckUtils]: 13: Hoare triple {8032#(and (= main_~z~0 0) (<= 999997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8033#(and (<= 999996 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 07:00:50,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {8033#(and (<= 999996 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8034#(and (= main_~z~0 0) (<= 999995 main_~y~0))} is VALID [2022-04-15 07:00:50,946 INFO L290 TraceCheckUtils]: 15: Hoare triple {8034#(and (= main_~z~0 0) (<= 999995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8035#(and (= main_~z~0 0) (<= 999994 main_~y~0))} is VALID [2022-04-15 07:00:50,946 INFO L290 TraceCheckUtils]: 16: Hoare triple {8035#(and (= main_~z~0 0) (<= 999994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8036#(and (= main_~z~0 0) (<= 999993 main_~y~0))} is VALID [2022-04-15 07:00:50,947 INFO L290 TraceCheckUtils]: 17: Hoare triple {8036#(and (= main_~z~0 0) (<= 999993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8037#(and (= main_~z~0 0) (<= 999992 main_~y~0))} is VALID [2022-04-15 07:00:50,947 INFO L290 TraceCheckUtils]: 18: Hoare triple {8037#(and (= main_~z~0 0) (<= 999992 main_~y~0))} assume !(~y~0 > ~z~0); {8022#false} is VALID [2022-04-15 07:00:50,947 INFO L272 TraceCheckUtils]: 19: Hoare triple {8022#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {8022#false} is VALID [2022-04-15 07:00:50,948 INFO L290 TraceCheckUtils]: 20: Hoare triple {8022#false} ~cond := #in~cond; {8022#false} is VALID [2022-04-15 07:00:50,948 INFO L290 TraceCheckUtils]: 21: Hoare triple {8022#false} assume 0 == ~cond; {8022#false} is VALID [2022-04-15 07:00:50,948 INFO L290 TraceCheckUtils]: 22: Hoare triple {8022#false} assume !false; {8022#false} is VALID [2022-04-15 07:00:50,948 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 07:00:50,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:00:50,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923118072] [2022-04-15 07:00:50,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923118072] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 07:00:50,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774066095] [2022-04-15 07:00:50,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:00:50,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:00:50,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:00:50,951 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:00:50,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-15 07:00:50,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:00:50,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 07:00:50,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:00:50,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:01:08,066 INFO L272 TraceCheckUtils]: 0: Hoare triple {8021#true} call ULTIMATE.init(); {8021#true} is VALID [2022-04-15 07:01:08,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {8021#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {8021#true} is VALID [2022-04-15 07:01:08,066 INFO L290 TraceCheckUtils]: 2: Hoare triple {8021#true} assume true; {8021#true} is VALID [2022-04-15 07:01:08,066 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8021#true} {8021#true} #52#return; {8021#true} is VALID [2022-04-15 07:01:08,066 INFO L272 TraceCheckUtils]: 4: Hoare triple {8021#true} call #t~ret7 := main(); {8021#true} is VALID [2022-04-15 07:01:08,067 INFO L290 TraceCheckUtils]: 5: Hoare triple {8021#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {8057#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 07:01:08,067 INFO L290 TraceCheckUtils]: 6: Hoare triple {8057#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [112] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_425 v_main_~x~0_424)) (.cse1 (= |v_main_#t~post4_87| |v_main_#t~post4_86|))) (or (and (< v_main_~x~0_425 v_main_~x~0_424) (< v_main_~x~0_424 50001)) (and .cse0 .cse1) (and (<= 50000 v_main_~x~0_425) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_425, main_#t~post4=|v_main_#t~post4_87|} OutVars{main_~x~0=v_main_~x~0_424, main_#t~post4=|v_main_#t~post4_86|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {8057#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 07:01:08,068 INFO L290 TraceCheckUtils]: 7: Hoare triple {8057#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [113] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8057#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 07:01:08,069 INFO L290 TraceCheckUtils]: 8: Hoare triple {8057#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [114] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_369 v_main_~y~0_368)) (.cse2 (= v_main_~x~0_427 v_main_~x~0_426)) (.cse1 (<= 50000 v_main_~x~0_427))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_427 1000000))) .cse2) (and .cse0 .cse2) (let ((.cse3 (div (+ v_main_~x~0_427 (* v_main_~x~0_426 (- 1))) (- 2)))) (and (= (mod (+ v_main_~x~0_427 v_main_~x~0_426) 2) 0) (< .cse3 (+ (div (+ 999999 (* v_main_~x~0_427 (- 1))) 2) 2)) (< 0 .cse3) .cse1 (= v_main_~y~0_368 (+ v_main_~y~0_369 (* .cse3 2))))))) InVars {main_~x~0=v_main_~x~0_427, main_~y~0=v_main_~y~0_369} OutVars{main_~x~0=v_main_~x~0_426, main_~y~0=v_main_~y~0_368} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {8057#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 07:01:08,069 INFO L290 TraceCheckUtils]: 9: Hoare triple {8057#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [111] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {8057#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 07:01:08,070 INFO L290 TraceCheckUtils]: 10: Hoare triple {8057#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8073#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-15 07:01:08,071 INFO L290 TraceCheckUtils]: 11: Hoare triple {8073#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8077#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-15 07:01:08,071 INFO L290 TraceCheckUtils]: 12: Hoare triple {8077#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8081#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-15 07:01:08,072 INFO L290 TraceCheckUtils]: 13: Hoare triple {8081#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8085#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-15 07:01:08,072 INFO L290 TraceCheckUtils]: 14: Hoare triple {8085#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8089#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-15 07:01:08,073 INFO L290 TraceCheckUtils]: 15: Hoare triple {8089#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8093#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-15 07:01:08,073 INFO L290 TraceCheckUtils]: 16: Hoare triple {8093#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8097#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-15 07:01:08,074 INFO L290 TraceCheckUtils]: 17: Hoare triple {8097#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8101#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-15 07:01:08,074 INFO L290 TraceCheckUtils]: 18: Hoare triple {8101#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} assume !(~y~0 > ~z~0); {8022#false} is VALID [2022-04-15 07:01:08,075 INFO L272 TraceCheckUtils]: 19: Hoare triple {8022#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {8022#false} is VALID [2022-04-15 07:01:08,075 INFO L290 TraceCheckUtils]: 20: Hoare triple {8022#false} ~cond := #in~cond; {8022#false} is VALID [2022-04-15 07:01:08,075 INFO L290 TraceCheckUtils]: 21: Hoare triple {8022#false} assume 0 == ~cond; {8022#false} is VALID [2022-04-15 07:01:08,075 INFO L290 TraceCheckUtils]: 22: Hoare triple {8022#false} assume !false; {8022#false} is VALID [2022-04-15 07:01:08,075 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 07:01:08,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:01:32,656 INFO L290 TraceCheckUtils]: 22: Hoare triple {8022#false} assume !false; {8022#false} is VALID [2022-04-15 07:01:32,657 INFO L290 TraceCheckUtils]: 21: Hoare triple {8022#false} assume 0 == ~cond; {8022#false} is VALID [2022-04-15 07:01:32,657 INFO L290 TraceCheckUtils]: 20: Hoare triple {8022#false} ~cond := #in~cond; {8022#false} is VALID [2022-04-15 07:01:32,657 INFO L272 TraceCheckUtils]: 19: Hoare triple {8022#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {8022#false} is VALID [2022-04-15 07:01:32,657 INFO L290 TraceCheckUtils]: 18: Hoare triple {8129#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {8022#false} is VALID [2022-04-15 07:01:32,658 INFO L290 TraceCheckUtils]: 17: Hoare triple {8133#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8129#(< main_~z~0 main_~y~0)} is VALID [2022-04-15 07:01:32,658 INFO L290 TraceCheckUtils]: 16: Hoare triple {8137#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8133#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-15 07:01:32,659 INFO L290 TraceCheckUtils]: 15: Hoare triple {8141#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8137#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-15 07:01:32,660 INFO L290 TraceCheckUtils]: 14: Hoare triple {8145#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8141#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-15 07:01:32,660 INFO L290 TraceCheckUtils]: 13: Hoare triple {8149#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8145#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-15 07:01:32,661 INFO L290 TraceCheckUtils]: 12: Hoare triple {8153#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8149#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-15 07:01:32,662 INFO L290 TraceCheckUtils]: 11: Hoare triple {8157#(< (+ 7 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8153#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-15 07:01:32,663 INFO L290 TraceCheckUtils]: 10: Hoare triple {8161#(< (+ main_~z~0 8) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8157#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-15 07:01:32,663 INFO L290 TraceCheckUtils]: 9: Hoare triple {8161#(< (+ main_~z~0 8) main_~y~0)} [111] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {8161#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-15 07:01:32,664 INFO L290 TraceCheckUtils]: 8: Hoare triple {8161#(< (+ main_~z~0 8) main_~y~0)} [114] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_369 v_main_~y~0_368)) (.cse2 (= v_main_~x~0_427 v_main_~x~0_426)) (.cse1 (<= 50000 v_main_~x~0_427))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_427 1000000))) .cse2) (and .cse0 .cse2) (let ((.cse3 (div (+ v_main_~x~0_427 (* v_main_~x~0_426 (- 1))) (- 2)))) (and (= (mod (+ v_main_~x~0_427 v_main_~x~0_426) 2) 0) (< .cse3 (+ (div (+ 999999 (* v_main_~x~0_427 (- 1))) 2) 2)) (< 0 .cse3) .cse1 (= v_main_~y~0_368 (+ v_main_~y~0_369 (* .cse3 2))))))) InVars {main_~x~0=v_main_~x~0_427, main_~y~0=v_main_~y~0_369} OutVars{main_~x~0=v_main_~x~0_426, main_~y~0=v_main_~y~0_368} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {8161#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-15 07:01:32,665 INFO L290 TraceCheckUtils]: 7: Hoare triple {8161#(< (+ main_~z~0 8) main_~y~0)} [113] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8161#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-15 07:01:32,665 INFO L290 TraceCheckUtils]: 6: Hoare triple {8161#(< (+ main_~z~0 8) main_~y~0)} [112] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_425 v_main_~x~0_424)) (.cse1 (= |v_main_#t~post4_87| |v_main_#t~post4_86|))) (or (and (< v_main_~x~0_425 v_main_~x~0_424) (< v_main_~x~0_424 50001)) (and .cse0 .cse1) (and (<= 50000 v_main_~x~0_425) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_425, main_#t~post4=|v_main_#t~post4_87|} OutVars{main_~x~0=v_main_~x~0_424, main_#t~post4=|v_main_#t~post4_86|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {8161#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-15 07:01:32,666 INFO L290 TraceCheckUtils]: 5: Hoare triple {8021#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {8161#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-15 07:01:32,666 INFO L272 TraceCheckUtils]: 4: Hoare triple {8021#true} call #t~ret7 := main(); {8021#true} is VALID [2022-04-15 07:01:32,666 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8021#true} {8021#true} #52#return; {8021#true} is VALID [2022-04-15 07:01:32,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {8021#true} assume true; {8021#true} is VALID [2022-04-15 07:01:32,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {8021#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {8021#true} is VALID [2022-04-15 07:01:32,666 INFO L272 TraceCheckUtils]: 0: Hoare triple {8021#true} call ULTIMATE.init(); {8021#true} is VALID [2022-04-15 07:01:32,666 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 07:01:32,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774066095] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:01:32,666 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 07:01:32,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 33 [2022-04-15 07:01:33,601 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:01:33,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2111424615] [2022-04-15 07:01:33,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2111424615] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:01:33,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:01:33,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-15 07:01:33,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690319716] [2022-04-15 07:01:33,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:01:33,602 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.6875) internal successors, (54), 31 states have internal predecessors, (54), 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 58 [2022-04-15 07:01:33,602 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:01:33,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 1.6875) internal successors, (54), 31 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:01:33,657 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:01:33,657 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-15 07:01:33,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:01:33,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-15 07:01:33,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=859, Invalid=1897, Unknown=0, NotChecked=0, Total=2756 [2022-04-15 07:01:33,658 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand has 32 states, 32 states have (on average 1.6875) internal successors, (54), 31 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:01:36,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:01:36,736 INFO L93 Difference]: Finished difference Result 136 states and 145 transitions. [2022-04-15 07:01:36,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 07:01:36,736 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.6875) internal successors, (54), 31 states have internal predecessors, (54), 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 58 [2022-04-15 07:01:36,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:01:36,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.6875) internal successors, (54), 31 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:01:36,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 69 transitions. [2022-04-15 07:01:36,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.6875) internal successors, (54), 31 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:01:36,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 69 transitions. [2022-04-15 07:01:36,738 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 69 transitions. [2022-04-15 07:01:36,798 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:01:36,799 INFO L225 Difference]: With dead ends: 136 [2022-04-15 07:01:36,799 INFO L226 Difference]: Without dead ends: 91 [2022-04-15 07:01:36,800 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1272 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1323, Invalid=3933, Unknown=0, NotChecked=0, Total=5256 [2022-04-15 07:01:36,801 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 30 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 1058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:01:36,801 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 120 Invalid, 1058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1033 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-15 07:01:36,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-15 07:01:37,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-04-15 07:01:37,033 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:01:37,033 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 91 states, 86 states have (on average 1.058139534883721) internal successors, (91), 86 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:01:37,034 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 91 states, 86 states have (on average 1.058139534883721) internal successors, (91), 86 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:01:37,034 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 91 states, 86 states have (on average 1.058139534883721) internal successors, (91), 86 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:01:37,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:01:37,035 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2022-04-15 07:01:37,036 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2022-04-15 07:01:37,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:01:37,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:01:37,036 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 86 states have (on average 1.058139534883721) internal successors, (91), 86 states have internal predecessors, (91), 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 91 states. [2022-04-15 07:01:37,036 INFO L87 Difference]: Start difference. First operand has 91 states, 86 states have (on average 1.058139534883721) internal successors, (91), 86 states have internal predecessors, (91), 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 91 states. [2022-04-15 07:01:37,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:01:37,038 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2022-04-15 07:01:37,038 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2022-04-15 07:01:37,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:01:37,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:01:37,038 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:01:37,038 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:01:37,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 86 states have (on average 1.058139534883721) internal successors, (91), 86 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:01:37,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2022-04-15 07:01:37,040 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 58 [2022-04-15 07:01:37,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:01:37,040 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2022-04-15 07:01:37,041 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.6875) internal successors, (54), 31 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:01:37,041 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 95 transitions. [2022-04-15 07:01:37,147 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:01:37,147 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2022-04-15 07:01:37,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-15 07:01:37,148 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:01:37,148 INFO L499 BasicCegarLoop]: trace histogram [20, 19, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:01:37,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-04-15 07:01:37,348 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:01:37,349 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:01:37,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:01:37,349 INFO L85 PathProgramCache]: Analyzing trace with hash -71217127, now seen corresponding path program 15 times [2022-04-15 07:01:37,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:01:37,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1073029803] [2022-04-15 07:01:37,482 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:01:37,758 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:01:37,760 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:01:37,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1990579073, now seen corresponding path program 1 times [2022-04-15 07:01:37,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:01:37,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285481847] [2022-04-15 07:01:37,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:01:37,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:01:37,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:01:37,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:01:37,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:01:37,964 INFO L290 TraceCheckUtils]: 0: Hoare triple {8904#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {8890#true} is VALID [2022-04-15 07:01:37,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {8890#true} assume true; {8890#true} is VALID [2022-04-15 07:01:37,965 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8890#true} {8890#true} #52#return; {8890#true} is VALID [2022-04-15 07:01:37,965 INFO L272 TraceCheckUtils]: 0: Hoare triple {8890#true} call ULTIMATE.init(); {8904#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:01:37,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {8904#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {8890#true} is VALID [2022-04-15 07:01:37,966 INFO L290 TraceCheckUtils]: 2: Hoare triple {8890#true} assume true; {8890#true} is VALID [2022-04-15 07:01:37,966 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8890#true} {8890#true} #52#return; {8890#true} is VALID [2022-04-15 07:01:37,966 INFO L272 TraceCheckUtils]: 4: Hoare triple {8890#true} call #t~ret7 := main(); {8890#true} is VALID [2022-04-15 07:01:37,966 INFO L290 TraceCheckUtils]: 5: Hoare triple {8890#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {8895#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 07:01:37,967 INFO L290 TraceCheckUtils]: 6: Hoare triple {8895#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [116] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_93| |v_main_#t~post4_92|))) (or (and .cse0 (<= 50000 v_main_~x~0_468) (= v_main_~x~0_467 v_main_~x~0_468)) (and .cse0 (= v_main_~x~0_468 v_main_~x~0_467)) (and (< v_main_~x~0_467 50001) (< v_main_~x~0_468 v_main_~x~0_467)))) InVars {main_~x~0=v_main_~x~0_468, main_#t~post4=|v_main_#t~post4_93|} OutVars{main_~x~0=v_main_~x~0_467, main_#t~post4=|v_main_#t~post4_92|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {8895#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 07:01:37,971 INFO L290 TraceCheckUtils]: 7: Hoare triple {8895#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [117] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8895#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 07:01:37,973 INFO L290 TraceCheckUtils]: 8: Hoare triple {8895#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [118] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_412 v_main_~y~0_411)) (.cse1 (<= 50000 v_main_~x~0_470))) (or (and .cse0 (= v_main_~x~0_470 v_main_~x~0_469)) (and .cse0 (or (not (< v_main_~x~0_470 1000000)) (not .cse1)) (= v_main_~x~0_469 v_main_~x~0_470)) (let ((.cse2 (div (+ v_main_~y~0_411 (* (- 1) v_main_~y~0_412)) 2))) (and (= (mod (+ v_main_~y~0_412 v_main_~y~0_411) 2) 0) (< .cse2 (+ (div (+ 999999 (* v_main_~x~0_470 (- 1))) 2) 2)) (< 0 .cse2) .cse1 (= v_main_~x~0_469 (+ v_main_~x~0_470 (* 2 .cse2))))))) InVars {main_~x~0=v_main_~x~0_470, main_~y~0=v_main_~y~0_412} OutVars{main_~x~0=v_main_~x~0_469, main_~y~0=v_main_~y~0_411} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {8895#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 07:01:37,974 INFO L290 TraceCheckUtils]: 9: Hoare triple {8895#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [115] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {8895#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 07:01:37,975 INFO L290 TraceCheckUtils]: 10: Hoare triple {8895#(and (= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8896#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-15 07:01:37,976 INFO L290 TraceCheckUtils]: 11: Hoare triple {8896#(and (= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8897#(and (<= 49998 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 07:01:37,976 INFO L290 TraceCheckUtils]: 12: Hoare triple {8897#(and (<= 49998 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8898#(and (= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-15 07:01:37,977 INFO L290 TraceCheckUtils]: 13: Hoare triple {8898#(and (= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8899#(and (= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-15 07:01:37,978 INFO L290 TraceCheckUtils]: 14: Hoare triple {8899#(and (= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8900#(and (= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-15 07:01:37,978 INFO L290 TraceCheckUtils]: 15: Hoare triple {8900#(and (= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8901#(and (= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-15 07:01:37,979 INFO L290 TraceCheckUtils]: 16: Hoare triple {8901#(and (= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8902#(and (= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-15 07:01:37,980 INFO L290 TraceCheckUtils]: 17: Hoare triple {8902#(and (= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8903#(and (= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-15 07:01:37,980 INFO L290 TraceCheckUtils]: 18: Hoare triple {8903#(and (= main_~z~0 0) (<= 49992 main_~y~0))} assume !(~y~0 > ~z~0); {8891#false} is VALID [2022-04-15 07:01:37,981 INFO L272 TraceCheckUtils]: 19: Hoare triple {8891#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {8891#false} is VALID [2022-04-15 07:01:37,981 INFO L290 TraceCheckUtils]: 20: Hoare triple {8891#false} ~cond := #in~cond; {8891#false} is VALID [2022-04-15 07:01:37,981 INFO L290 TraceCheckUtils]: 21: Hoare triple {8891#false} assume 0 == ~cond; {8891#false} is VALID [2022-04-15 07:01:37,981 INFO L290 TraceCheckUtils]: 22: Hoare triple {8891#false} assume !false; {8891#false} is VALID [2022-04-15 07:01:37,981 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 07:01:37,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:01:37,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285481847] [2022-04-15 07:01:37,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285481847] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 07:01:37,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773714565] [2022-04-15 07:01:37,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:01:37,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:01:37,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:01:37,984 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:01:37,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-15 07:01:38,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:01:38,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 07:01:38,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:01:38,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:02:02,777 INFO L272 TraceCheckUtils]: 0: Hoare triple {8890#true} call ULTIMATE.init(); {8890#true} is VALID [2022-04-15 07:02:02,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {8890#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {8890#true} is VALID [2022-04-15 07:02:02,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {8890#true} assume true; {8890#true} is VALID [2022-04-15 07:02:02,778 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8890#true} {8890#true} #52#return; {8890#true} is VALID [2022-04-15 07:02:02,778 INFO L272 TraceCheckUtils]: 4: Hoare triple {8890#true} call #t~ret7 := main(); {8890#true} is VALID [2022-04-15 07:02:02,778 INFO L290 TraceCheckUtils]: 5: Hoare triple {8890#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {8923#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 07:02:02,779 INFO L290 TraceCheckUtils]: 6: Hoare triple {8923#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [116] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_93| |v_main_#t~post4_92|))) (or (and .cse0 (<= 50000 v_main_~x~0_468) (= v_main_~x~0_467 v_main_~x~0_468)) (and .cse0 (= v_main_~x~0_468 v_main_~x~0_467)) (and (< v_main_~x~0_467 50001) (< v_main_~x~0_468 v_main_~x~0_467)))) InVars {main_~x~0=v_main_~x~0_468, main_#t~post4=|v_main_#t~post4_93|} OutVars{main_~x~0=v_main_~x~0_467, main_#t~post4=|v_main_#t~post4_92|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {8923#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 07:02:02,779 INFO L290 TraceCheckUtils]: 7: Hoare triple {8923#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [117] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8923#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 07:02:02,780 INFO L290 TraceCheckUtils]: 8: Hoare triple {8923#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [118] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_412 v_main_~y~0_411)) (.cse1 (<= 50000 v_main_~x~0_470))) (or (and .cse0 (= v_main_~x~0_470 v_main_~x~0_469)) (and .cse0 (or (not (< v_main_~x~0_470 1000000)) (not .cse1)) (= v_main_~x~0_469 v_main_~x~0_470)) (let ((.cse2 (div (+ v_main_~y~0_411 (* (- 1) v_main_~y~0_412)) 2))) (and (= (mod (+ v_main_~y~0_412 v_main_~y~0_411) 2) 0) (< .cse2 (+ (div (+ 999999 (* v_main_~x~0_470 (- 1))) 2) 2)) (< 0 .cse2) .cse1 (= v_main_~x~0_469 (+ v_main_~x~0_470 (* 2 .cse2))))))) InVars {main_~x~0=v_main_~x~0_470, main_~y~0=v_main_~y~0_412} OutVars{main_~x~0=v_main_~x~0_469, main_~y~0=v_main_~y~0_411} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {8923#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 07:02:02,781 INFO L290 TraceCheckUtils]: 9: Hoare triple {8923#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [115] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {8923#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 07:02:02,781 INFO L290 TraceCheckUtils]: 10: Hoare triple {8923#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8939#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-15 07:02:02,782 INFO L290 TraceCheckUtils]: 11: Hoare triple {8939#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8943#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-15 07:02:02,783 INFO L290 TraceCheckUtils]: 12: Hoare triple {8943#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8947#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-15 07:02:02,784 INFO L290 TraceCheckUtils]: 13: Hoare triple {8947#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8951#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-15 07:02:02,784 INFO L290 TraceCheckUtils]: 14: Hoare triple {8951#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8955#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-15 07:02:02,785 INFO L290 TraceCheckUtils]: 15: Hoare triple {8955#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8959#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-15 07:02:02,786 INFO L290 TraceCheckUtils]: 16: Hoare triple {8959#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8963#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-15 07:02:02,787 INFO L290 TraceCheckUtils]: 17: Hoare triple {8963#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8967#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-15 07:02:02,787 INFO L290 TraceCheckUtils]: 18: Hoare triple {8967#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} assume !(~y~0 > ~z~0); {8891#false} is VALID [2022-04-15 07:02:02,788 INFO L272 TraceCheckUtils]: 19: Hoare triple {8891#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {8891#false} is VALID [2022-04-15 07:02:02,788 INFO L290 TraceCheckUtils]: 20: Hoare triple {8891#false} ~cond := #in~cond; {8891#false} is VALID [2022-04-15 07:02:02,788 INFO L290 TraceCheckUtils]: 21: Hoare triple {8891#false} assume 0 == ~cond; {8891#false} is VALID [2022-04-15 07:02:02,788 INFO L290 TraceCheckUtils]: 22: Hoare triple {8891#false} assume !false; {8891#false} is VALID [2022-04-15 07:02:02,788 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 07:02:02,788 INFO L328 TraceCheckSpWp]: Computing backward predicates...