/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/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_valuebound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 12:31:03,824 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 12:31:03,826 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 12:31:03,862 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 12:31:03,863 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 12:31:03,864 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 12:31:03,866 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 12:31:03,869 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 12:31:03,870 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 12:31:03,873 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 12:31:03,874 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 12:31:03,875 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 12:31:03,875 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 12:31:03,876 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 12:31:03,877 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 12:31:03,879 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 12:31:03,879 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 12:31:03,880 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 12:31:03,881 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 12:31:03,884 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 12:31:03,884 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 12:31:03,887 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 12:31:03,888 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 12:31:03,888 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 12:31:03,889 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 12:31:03,894 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 12:31:03,894 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 12:31:03,894 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 12:31:03,894 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 12:31:03,895 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 12:31:03,895 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 12:31:03,895 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 12:31:03,896 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 12:31:03,896 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 12:31:03,896 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 12:31:03,897 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 12:31:03,897 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 12:31:03,897 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 12:31:03,897 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 12:31:03,898 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 12:31:03,898 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 12:31:03,901 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 12:31:03,902 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 12:31:03,909 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 12:31:03,910 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 12:31:03,910 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 12:31:03,910 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 12:31:03,911 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 12:31:03,911 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 12:31:03,911 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 12:31:03,911 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 12:31:03,911 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 12:31:03,911 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 12:31:03,912 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 12:31:03,912 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 12:31:03,912 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 12:31:03,912 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 12:31:03,912 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 12:31:03,912 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 12:31:03,912 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 12:31:03,912 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 12:31:03,912 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 12:31:03,912 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 12:31:03,912 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 12:31:03,912 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 12:31:03,913 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 12:31:04,087 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 12:31:04,102 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 12:31:04,104 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 12:31:04,104 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 12:31:04,105 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 12:31:04,105 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_valuebound2.c [2022-04-28 12:31:04,153 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d577bed2c/507bda2a60c84933a5574800a31961c5/FLAGd41cde3d2 [2022-04-28 12:31:04,485 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 12:31:04,485 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_valuebound2.c [2022-04-28 12:31:04,489 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d577bed2c/507bda2a60c84933a5574800a31961c5/FLAGd41cde3d2 [2022-04-28 12:31:04,497 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d577bed2c/507bda2a60c84933a5574800a31961c5 [2022-04-28 12:31:04,498 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 12:31:04,499 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 12:31:04,500 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 12:31:04,500 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 12:31:04,502 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 12:31:04,503 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 12:31:04" (1/1) ... [2022-04-28 12:31:04,503 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7512054e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:31:04, skipping insertion in model container [2022-04-28 12:31:04,503 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 12:31:04" (1/1) ... [2022-04-28 12:31:04,507 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 12:31:04,516 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 12:31:04,614 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_valuebound2.c[490,503] [2022-04-28 12:31:04,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 12:31:04,644 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 12:31:04,652 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_valuebound2.c[490,503] [2022-04-28 12:31:04,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 12:31:04,668 INFO L208 MainTranslator]: Completed translation [2022-04-28 12:31:04,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:31:04 WrapperNode [2022-04-28 12:31:04,669 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 12:31:04,669 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 12:31:04,670 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 12:31:04,670 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 12:31:04,676 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:31:04" (1/1) ... [2022-04-28 12:31:04,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:31:04" (1/1) ... [2022-04-28 12:31:04,679 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:31:04" (1/1) ... [2022-04-28 12:31:04,679 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:31:04" (1/1) ... [2022-04-28 12:31:04,683 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:31:04" (1/1) ... [2022-04-28 12:31:04,686 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:31:04" (1/1) ... [2022-04-28 12:31:04,687 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:31:04" (1/1) ... [2022-04-28 12:31:04,688 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 12:31:04,688 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 12:31:04,689 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 12:31:04,689 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 12:31:04,689 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:31:04" (1/1) ... [2022-04-28 12:31:04,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 12:31:04,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:31:04,707 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 12:31:04,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 12:31:04,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 12:31:04,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 12:31:04,735 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 12:31:04,735 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 12:31:04,735 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 12:31:04,736 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 12:31:04,736 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 12:31:04,736 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 12:31:04,736 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 12:31:04,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 12:31:04,739 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 12:31:04,739 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 12:31:04,739 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 12:31:04,739 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 12:31:04,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 12:31:04,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 12:31:04,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 12:31:04,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 12:31:04,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 12:31:04,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 12:31:04,777 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 12:31:04,778 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 12:31:04,944 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 12:31:04,950 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 12:31:04,950 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-28 12:31:04,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 12:31:04 BoogieIcfgContainer [2022-04-28 12:31:04,952 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 12:31:04,953 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 12:31:04,953 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 12:31:04,955 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 12:31:04,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 12:31:04" (1/3) ... [2022-04-28 12:31:04,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68cbdff3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 12:31:04, skipping insertion in model container [2022-04-28 12:31:04,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:31:04" (2/3) ... [2022-04-28 12:31:04,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68cbdff3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 12:31:04, skipping insertion in model container [2022-04-28 12:31:04,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 12:31:04" (3/3) ... [2022-04-28 12:31:04,961 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd3-ll_valuebound2.c [2022-04-28 12:31:04,970 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 12:31:04,970 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 12:31:05,002 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 12:31:05,010 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6c85c842, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@18d2087b [2022-04-28 12:31:05,010 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 12:31:05,018 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 12:31:05,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 12:31:05,026 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:31:05,026 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:31:05,027 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:31:05,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:31:05,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1237885594, now seen corresponding path program 1 times [2022-04-28 12:31:05,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:31:05,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1721357911] [2022-04-28 12:31:05,044 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:31:05,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1237885594, now seen corresponding path program 2 times [2022-04-28 12:31:05,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:31:05,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26629924] [2022-04-28 12:31:05,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:31:05,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:31:05,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:31:05,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 12:31:05,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:31:05,192 INFO L290 TraceCheckUtils]: 0: Hoare triple {64#(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(11, 2);call #Ultimate.allocInit(12, 3); {43#true} is VALID [2022-04-28 12:31:05,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume true; {43#true} is VALID [2022-04-28 12:31:05,193 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43#true} {43#true} #112#return; {43#true} is VALID [2022-04-28 12:31:05,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 12:31:05,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:31:05,217 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 12:31:05,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 12:31:05,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 12:31:05,218 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {43#true} #94#return; {44#false} is VALID [2022-04-28 12:31:05,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 12:31:05,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:31:05,229 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 12:31:05,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 12:31:05,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 12:31:05,230 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #96#return; {44#false} is VALID [2022-04-28 12:31:05,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-28 12:31:05,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:31:05,235 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 12:31:05,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 12:31:05,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 12:31:05,236 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #98#return; {44#false} is VALID [2022-04-28 12:31:05,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-28 12:31:05,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:31:05,241 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 12:31:05,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 12:31:05,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 12:31:05,241 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #100#return; {44#false} is VALID [2022-04-28 12:31:05,242 INFO L272 TraceCheckUtils]: 0: Hoare triple {43#true} call ULTIMATE.init(); {64#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 12:31:05,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {64#(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(11, 2);call #Ultimate.allocInit(12, 3); {43#true} is VALID [2022-04-28 12:31:05,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#true} assume true; {43#true} is VALID [2022-04-28 12:31:05,243 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#true} {43#true} #112#return; {43#true} is VALID [2022-04-28 12:31:05,243 INFO L272 TraceCheckUtils]: 4: Hoare triple {43#true} call #t~ret6 := main(); {43#true} is VALID [2022-04-28 12:31:05,243 INFO L290 TraceCheckUtils]: 5: Hoare triple {43#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {43#true} is VALID [2022-04-28 12:31:05,243 INFO L272 TraceCheckUtils]: 6: Hoare triple {43#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {43#true} is VALID [2022-04-28 12:31:05,243 INFO L290 TraceCheckUtils]: 7: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 12:31:05,244 INFO L290 TraceCheckUtils]: 8: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 12:31:05,244 INFO L290 TraceCheckUtils]: 9: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 12:31:05,244 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {44#false} {43#true} #94#return; {44#false} is VALID [2022-04-28 12:31:05,244 INFO L290 TraceCheckUtils]: 11: Hoare triple {44#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {44#false} is VALID [2022-04-28 12:31:05,244 INFO L272 TraceCheckUtils]: 12: Hoare triple {44#false} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {43#true} is VALID [2022-04-28 12:31:05,245 INFO L290 TraceCheckUtils]: 13: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 12:31:05,245 INFO L290 TraceCheckUtils]: 14: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 12:31:05,245 INFO L290 TraceCheckUtils]: 15: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 12:31:05,245 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {44#false} {44#false} #96#return; {44#false} is VALID [2022-04-28 12:31:05,245 INFO L272 TraceCheckUtils]: 17: Hoare triple {44#false} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {43#true} is VALID [2022-04-28 12:31:05,246 INFO L290 TraceCheckUtils]: 18: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 12:31:05,246 INFO L290 TraceCheckUtils]: 19: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 12:31:05,247 INFO L290 TraceCheckUtils]: 20: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 12:31:05,247 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {44#false} {44#false} #98#return; {44#false} is VALID [2022-04-28 12:31:05,247 INFO L272 TraceCheckUtils]: 22: Hoare triple {44#false} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {43#true} is VALID [2022-04-28 12:31:05,248 INFO L290 TraceCheckUtils]: 23: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 12:31:05,249 INFO L290 TraceCheckUtils]: 24: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 12:31:05,249 INFO L290 TraceCheckUtils]: 25: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 12:31:05,249 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {44#false} {44#false} #100#return; {44#false} is VALID [2022-04-28 12:31:05,250 INFO L290 TraceCheckUtils]: 27: Hoare triple {44#false} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {44#false} is VALID [2022-04-28 12:31:05,250 INFO L290 TraceCheckUtils]: 28: Hoare triple {44#false} assume false; {44#false} is VALID [2022-04-28 12:31:05,255 INFO L272 TraceCheckUtils]: 29: Hoare triple {44#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {44#false} is VALID [2022-04-28 12:31:05,255 INFO L290 TraceCheckUtils]: 30: Hoare triple {44#false} ~cond := #in~cond; {44#false} is VALID [2022-04-28 12:31:05,257 INFO L290 TraceCheckUtils]: 31: Hoare triple {44#false} assume 0 == ~cond; {44#false} is VALID [2022-04-28 12:31:05,257 INFO L290 TraceCheckUtils]: 32: Hoare triple {44#false} assume !false; {44#false} is VALID [2022-04-28 12:31:05,257 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 12:31:05,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:31:05,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26629924] [2022-04-28 12:31:05,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26629924] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:31:05,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:31:05,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 12:31:05,261 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:31:05,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1721357911] [2022-04-28 12:31:05,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1721357911] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:31:05,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:31:05,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 12:31:05,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402616979] [2022-04-28 12:31:05,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:31:05,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-28 12:31:05,269 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:31:05,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 12:31:05,306 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:31:05,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 12:31:05,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:31:05,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 12:31:05,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 12:31:05,338 INFO L87 Difference]: Start difference. First operand has 40 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 12:31:05,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:31:05,535 INFO L93 Difference]: Finished difference Result 73 states and 115 transitions. [2022-04-28 12:31:05,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 12:31:05,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-28 12:31:05,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:31:05,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 12:31:05,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2022-04-28 12:31:05,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 12:31:05,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2022-04-28 12:31:05,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 115 transitions. [2022-04-28 12:31:05,658 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:31:05,666 INFO L225 Difference]: With dead ends: 73 [2022-04-28 12:31:05,666 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 12:31:05,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 12:31:05,671 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 24 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:31:05,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 43 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:31:05,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 12:31:05,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-28 12:31:05,693 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:31:05,694 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 12:31:05,695 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 12:31:05,695 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 12:31:05,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:31:05,703 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-28 12:31:05,703 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-28 12:31:05,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:31:05,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:31:05,705 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 35 states. [2022-04-28 12:31:05,706 INFO L87 Difference]: Start difference. First operand has 35 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 35 states. [2022-04-28 12:31:05,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:31:05,713 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-28 12:31:05,713 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-28 12:31:05,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:31:05,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:31:05,714 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:31:05,714 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:31:05,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 12:31:05,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2022-04-28 12:31:05,720 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 33 [2022-04-28 12:31:05,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:31:05,721 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2022-04-28 12:31:05,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 12:31:05,721 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 44 transitions. [2022-04-28 12:31:05,762 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-28 12:31:05,762 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-28 12:31:05,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 12:31:05,764 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:31:05,764 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:31:05,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 12:31:05,764 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:31:05,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:31:05,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1569470122, now seen corresponding path program 1 times [2022-04-28 12:31:05,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:31:05,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1206828369] [2022-04-28 12:31:05,767 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:31:05,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1569470122, now seen corresponding path program 2 times [2022-04-28 12:31:05,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:31:05,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340844385] [2022-04-28 12:31:05,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:31:05,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:31:05,801 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:31:05,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [390936958] [2022-04-28 12:31:05,802 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:31:05,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:31:05,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:31:05,805 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:31:05,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 12:31:05,863 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 12:31:05,864 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:31:05,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 12:31:05,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:31:05,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:31:06,185 INFO L272 TraceCheckUtils]: 0: Hoare triple {353#true} call ULTIMATE.init(); {353#true} is VALID [2022-04-28 12:31:06,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {353#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(11, 2);call #Ultimate.allocInit(12, 3); {353#true} is VALID [2022-04-28 12:31:06,185 INFO L290 TraceCheckUtils]: 2: Hoare triple {353#true} assume true; {353#true} is VALID [2022-04-28 12:31:06,185 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {353#true} {353#true} #112#return; {353#true} is VALID [2022-04-28 12:31:06,185 INFO L272 TraceCheckUtils]: 4: Hoare triple {353#true} call #t~ret6 := main(); {353#true} is VALID [2022-04-28 12:31:06,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {353#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {353#true} is VALID [2022-04-28 12:31:06,185 INFO L272 TraceCheckUtils]: 6: Hoare triple {353#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {353#true} is VALID [2022-04-28 12:31:06,186 INFO L290 TraceCheckUtils]: 7: Hoare triple {353#true} ~cond := #in~cond; {353#true} is VALID [2022-04-28 12:31:06,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {353#true} assume !(0 == ~cond); {353#true} is VALID [2022-04-28 12:31:06,186 INFO L290 TraceCheckUtils]: 9: Hoare triple {353#true} assume true; {353#true} is VALID [2022-04-28 12:31:06,186 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {353#true} {353#true} #94#return; {353#true} is VALID [2022-04-28 12:31:06,186 INFO L290 TraceCheckUtils]: 11: Hoare triple {353#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {353#true} is VALID [2022-04-28 12:31:06,186 INFO L272 TraceCheckUtils]: 12: Hoare triple {353#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {353#true} is VALID [2022-04-28 12:31:06,186 INFO L290 TraceCheckUtils]: 13: Hoare triple {353#true} ~cond := #in~cond; {353#true} is VALID [2022-04-28 12:31:06,186 INFO L290 TraceCheckUtils]: 14: Hoare triple {353#true} assume !(0 == ~cond); {353#true} is VALID [2022-04-28 12:31:06,186 INFO L290 TraceCheckUtils]: 15: Hoare triple {353#true} assume true; {353#true} is VALID [2022-04-28 12:31:06,187 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {353#true} {353#true} #96#return; {353#true} is VALID [2022-04-28 12:31:06,187 INFO L272 TraceCheckUtils]: 17: Hoare triple {353#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {353#true} is VALID [2022-04-28 12:31:06,187 INFO L290 TraceCheckUtils]: 18: Hoare triple {353#true} ~cond := #in~cond; {353#true} is VALID [2022-04-28 12:31:06,187 INFO L290 TraceCheckUtils]: 19: Hoare triple {353#true} assume !(0 == ~cond); {353#true} is VALID [2022-04-28 12:31:06,187 INFO L290 TraceCheckUtils]: 20: Hoare triple {353#true} assume true; {353#true} is VALID [2022-04-28 12:31:06,187 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {353#true} {353#true} #98#return; {353#true} is VALID [2022-04-28 12:31:06,187 INFO L272 TraceCheckUtils]: 22: Hoare triple {353#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {353#true} is VALID [2022-04-28 12:31:06,187 INFO L290 TraceCheckUtils]: 23: Hoare triple {353#true} ~cond := #in~cond; {353#true} is VALID [2022-04-28 12:31:06,187 INFO L290 TraceCheckUtils]: 24: Hoare triple {353#true} assume !(0 == ~cond); {353#true} is VALID [2022-04-28 12:31:06,187 INFO L290 TraceCheckUtils]: 25: Hoare triple {353#true} assume true; {353#true} is VALID [2022-04-28 12:31:06,188 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {353#true} {353#true} #100#return; {353#true} is VALID [2022-04-28 12:31:06,188 INFO L290 TraceCheckUtils]: 27: Hoare triple {353#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {439#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:31:06,189 INFO L290 TraceCheckUtils]: 28: Hoare triple {439#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {439#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:31:06,189 INFO L290 TraceCheckUtils]: 29: Hoare triple {439#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(0 != ~b~0); {446#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:31:06,190 INFO L272 TraceCheckUtils]: 30: Hoare triple {446#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {450#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:31:06,190 INFO L290 TraceCheckUtils]: 31: Hoare triple {450#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {454#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:31:06,191 INFO L290 TraceCheckUtils]: 32: Hoare triple {454#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {354#false} is VALID [2022-04-28 12:31:06,191 INFO L290 TraceCheckUtils]: 33: Hoare triple {354#false} assume !false; {354#false} is VALID [2022-04-28 12:31:06,191 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 12:31:06,191 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:31:06,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:31:06,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340844385] [2022-04-28 12:31:06,192 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:31:06,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390936958] [2022-04-28 12:31:06,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390936958] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:31:06,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:31:06,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 12:31:06,192 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:31:06,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1206828369] [2022-04-28 12:31:06,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1206828369] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:31:06,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:31:06,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 12:31:06,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202930408] [2022-04-28 12:31:06,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:31:06,193 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 34 [2022-04-28 12:31:06,194 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:31:06,194 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-28 12:31:06,210 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:31:06,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 12:31:06,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:31:06,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 12:31:06,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 12:31:06,211 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-28 12:31:06,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:31:06,484 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2022-04-28 12:31:06,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 12:31:06,484 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 34 [2022-04-28 12:31:06,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:31:06,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-28 12:31:06,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-04-28 12:31:06,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-28 12:31:06,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-04-28 12:31:06,488 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 69 transitions. [2022-04-28 12:31:06,539 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-28 12:31:06,541 INFO L225 Difference]: With dead ends: 54 [2022-04-28 12:31:06,542 INFO L226 Difference]: Without dead ends: 51 [2022-04-28 12:31:06,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 12:31:06,543 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 14 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 12:31:06,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 158 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 12:31:06,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-28 12:31:06,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-04-28 12:31:06,555 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:31:06,555 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 50 states, 30 states have (on average 1.2) internal successors, (36), 31 states have internal predecessors, (36), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 12:31:06,556 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 50 states, 30 states have (on average 1.2) internal successors, (36), 31 states have internal predecessors, (36), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 12:31:06,556 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 50 states, 30 states have (on average 1.2) internal successors, (36), 31 states have internal predecessors, (36), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 12:31:06,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:31:06,558 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2022-04-28 12:31:06,558 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2022-04-28 12:31:06,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:31:06,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:31:06,559 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 30 states have (on average 1.2) internal successors, (36), 31 states have internal predecessors, (36), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 51 states. [2022-04-28 12:31:06,560 INFO L87 Difference]: Start difference. First operand has 50 states, 30 states have (on average 1.2) internal successors, (36), 31 states have internal predecessors, (36), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 51 states. [2022-04-28 12:31:06,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:31:06,562 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2022-04-28 12:31:06,562 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2022-04-28 12:31:06,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:31:06,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:31:06,563 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:31:06,563 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:31:06,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 30 states have (on average 1.2) internal successors, (36), 31 states have internal predecessors, (36), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 12:31:06,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2022-04-28 12:31:06,565 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 34 [2022-04-28 12:31:06,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:31:06,565 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2022-04-28 12:31:06,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-28 12:31:06,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 64 transitions. [2022-04-28 12:31:06,618 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-28 12:31:06,619 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-28 12:31:06,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 12:31:06,619 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:31:06,619 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:31:06,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 12:31:06,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:31:06,836 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:31:06,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:31:06,836 INFO L85 PathProgramCache]: Analyzing trace with hash 584996456, now seen corresponding path program 1 times [2022-04-28 12:31:06,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:31:06,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [727213293] [2022-04-28 12:31:06,837 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:31:06,837 INFO L85 PathProgramCache]: Analyzing trace with hash 584996456, now seen corresponding path program 2 times [2022-04-28 12:31:06,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:31:06,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566677006] [2022-04-28 12:31:06,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:31:06,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:31:06,853 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:31:06,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1752623140] [2022-04-28 12:31:06,854 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:31:06,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:31:06,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:31:06,855 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:31:06,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 12:31:06,894 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:31:06,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:31:06,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 12:31:06,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:31:06,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:31:07,062 INFO L272 TraceCheckUtils]: 0: Hoare triple {774#true} call ULTIMATE.init(); {774#true} is VALID [2022-04-28 12:31:07,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {774#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(11, 2);call #Ultimate.allocInit(12, 3); {774#true} is VALID [2022-04-28 12:31:07,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-28 12:31:07,063 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {774#true} {774#true} #112#return; {774#true} is VALID [2022-04-28 12:31:07,063 INFO L272 TraceCheckUtils]: 4: Hoare triple {774#true} call #t~ret6 := main(); {774#true} is VALID [2022-04-28 12:31:07,063 INFO L290 TraceCheckUtils]: 5: Hoare triple {774#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {774#true} is VALID [2022-04-28 12:31:07,063 INFO L272 TraceCheckUtils]: 6: Hoare triple {774#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {774#true} is VALID [2022-04-28 12:31:07,063 INFO L290 TraceCheckUtils]: 7: Hoare triple {774#true} ~cond := #in~cond; {774#true} is VALID [2022-04-28 12:31:07,063 INFO L290 TraceCheckUtils]: 8: Hoare triple {774#true} assume !(0 == ~cond); {774#true} is VALID [2022-04-28 12:31:07,063 INFO L290 TraceCheckUtils]: 9: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-28 12:31:07,063 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {774#true} {774#true} #94#return; {774#true} is VALID [2022-04-28 12:31:07,064 INFO L290 TraceCheckUtils]: 11: Hoare triple {774#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {774#true} is VALID [2022-04-28 12:31:07,064 INFO L272 TraceCheckUtils]: 12: Hoare triple {774#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {774#true} is VALID [2022-04-28 12:31:07,064 INFO L290 TraceCheckUtils]: 13: Hoare triple {774#true} ~cond := #in~cond; {774#true} is VALID [2022-04-28 12:31:07,064 INFO L290 TraceCheckUtils]: 14: Hoare triple {774#true} assume !(0 == ~cond); {774#true} is VALID [2022-04-28 12:31:07,066 INFO L290 TraceCheckUtils]: 15: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-28 12:31:07,066 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {774#true} {774#true} #96#return; {774#true} is VALID [2022-04-28 12:31:07,066 INFO L272 TraceCheckUtils]: 17: Hoare triple {774#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {774#true} is VALID [2022-04-28 12:31:07,067 INFO L290 TraceCheckUtils]: 18: Hoare triple {774#true} ~cond := #in~cond; {833#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 12:31:07,067 INFO L290 TraceCheckUtils]: 19: Hoare triple {833#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {837#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:31:07,068 INFO L290 TraceCheckUtils]: 20: Hoare triple {837#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {837#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:31:07,072 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {837#(not (= |assume_abort_if_not_#in~cond| 0))} {774#true} #98#return; {844#(<= 1 main_~x~0)} is VALID [2022-04-28 12:31:07,072 INFO L272 TraceCheckUtils]: 22: Hoare triple {844#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {774#true} is VALID [2022-04-28 12:31:07,072 INFO L290 TraceCheckUtils]: 23: Hoare triple {774#true} ~cond := #in~cond; {774#true} is VALID [2022-04-28 12:31:07,072 INFO L290 TraceCheckUtils]: 24: Hoare triple {774#true} assume !(0 == ~cond); {774#true} is VALID [2022-04-28 12:31:07,072 INFO L290 TraceCheckUtils]: 25: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-28 12:31:07,073 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {774#true} {844#(<= 1 main_~x~0)} #100#return; {844#(<= 1 main_~x~0)} is VALID [2022-04-28 12:31:07,073 INFO L290 TraceCheckUtils]: 27: Hoare triple {844#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {863#(<= 1 main_~a~0)} is VALID [2022-04-28 12:31:07,075 INFO L290 TraceCheckUtils]: 28: Hoare triple {863#(<= 1 main_~a~0)} assume !false; {863#(<= 1 main_~a~0)} is VALID [2022-04-28 12:31:07,075 INFO L290 TraceCheckUtils]: 29: Hoare triple {863#(<= 1 main_~a~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {870#(<= 1 main_~c~0)} is VALID [2022-04-28 12:31:07,075 INFO L290 TraceCheckUtils]: 30: Hoare triple {870#(<= 1 main_~c~0)} assume !false; {870#(<= 1 main_~c~0)} is VALID [2022-04-28 12:31:07,077 INFO L290 TraceCheckUtils]: 31: Hoare triple {870#(<= 1 main_~c~0)} assume !(~c~0 >= ~b~0); {870#(<= 1 main_~c~0)} is VALID [2022-04-28 12:31:07,078 INFO L290 TraceCheckUtils]: 32: Hoare triple {870#(<= 1 main_~c~0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {880#(<= 1 main_~b~0)} is VALID [2022-04-28 12:31:07,087 INFO L290 TraceCheckUtils]: 33: Hoare triple {880#(<= 1 main_~b~0)} assume !false; {880#(<= 1 main_~b~0)} is VALID [2022-04-28 12:31:07,088 INFO L290 TraceCheckUtils]: 34: Hoare triple {880#(<= 1 main_~b~0)} assume !(0 != ~b~0); {775#false} is VALID [2022-04-28 12:31:07,088 INFO L272 TraceCheckUtils]: 35: Hoare triple {775#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {775#false} is VALID [2022-04-28 12:31:07,088 INFO L290 TraceCheckUtils]: 36: Hoare triple {775#false} ~cond := #in~cond; {775#false} is VALID [2022-04-28 12:31:07,088 INFO L290 TraceCheckUtils]: 37: Hoare triple {775#false} assume 0 == ~cond; {775#false} is VALID [2022-04-28 12:31:07,088 INFO L290 TraceCheckUtils]: 38: Hoare triple {775#false} assume !false; {775#false} is VALID [2022-04-28 12:31:07,089 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 12:31:07,089 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:31:07,330 INFO L290 TraceCheckUtils]: 38: Hoare triple {775#false} assume !false; {775#false} is VALID [2022-04-28 12:31:07,330 INFO L290 TraceCheckUtils]: 37: Hoare triple {775#false} assume 0 == ~cond; {775#false} is VALID [2022-04-28 12:31:07,330 INFO L290 TraceCheckUtils]: 36: Hoare triple {775#false} ~cond := #in~cond; {775#false} is VALID [2022-04-28 12:31:07,330 INFO L272 TraceCheckUtils]: 35: Hoare triple {775#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {775#false} is VALID [2022-04-28 12:31:07,331 INFO L290 TraceCheckUtils]: 34: Hoare triple {880#(<= 1 main_~b~0)} assume !(0 != ~b~0); {775#false} is VALID [2022-04-28 12:31:07,331 INFO L290 TraceCheckUtils]: 33: Hoare triple {880#(<= 1 main_~b~0)} assume !false; {880#(<= 1 main_~b~0)} is VALID [2022-04-28 12:31:07,331 INFO L290 TraceCheckUtils]: 32: Hoare triple {870#(<= 1 main_~c~0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {880#(<= 1 main_~b~0)} is VALID [2022-04-28 12:31:07,332 INFO L290 TraceCheckUtils]: 31: Hoare triple {870#(<= 1 main_~c~0)} assume !(~c~0 >= ~b~0); {870#(<= 1 main_~c~0)} is VALID [2022-04-28 12:31:07,332 INFO L290 TraceCheckUtils]: 30: Hoare triple {870#(<= 1 main_~c~0)} assume !false; {870#(<= 1 main_~c~0)} is VALID [2022-04-28 12:31:07,332 INFO L290 TraceCheckUtils]: 29: Hoare triple {863#(<= 1 main_~a~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {870#(<= 1 main_~c~0)} is VALID [2022-04-28 12:31:07,333 INFO L290 TraceCheckUtils]: 28: Hoare triple {863#(<= 1 main_~a~0)} assume !false; {863#(<= 1 main_~a~0)} is VALID [2022-04-28 12:31:07,333 INFO L290 TraceCheckUtils]: 27: Hoare triple {844#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {863#(<= 1 main_~a~0)} is VALID [2022-04-28 12:31:07,334 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {774#true} {844#(<= 1 main_~x~0)} #100#return; {844#(<= 1 main_~x~0)} is VALID [2022-04-28 12:31:07,334 INFO L290 TraceCheckUtils]: 25: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-28 12:31:07,334 INFO L290 TraceCheckUtils]: 24: Hoare triple {774#true} assume !(0 == ~cond); {774#true} is VALID [2022-04-28 12:31:07,334 INFO L290 TraceCheckUtils]: 23: Hoare triple {774#true} ~cond := #in~cond; {774#true} is VALID [2022-04-28 12:31:07,334 INFO L272 TraceCheckUtils]: 22: Hoare triple {844#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {774#true} is VALID [2022-04-28 12:31:07,336 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {837#(not (= |assume_abort_if_not_#in~cond| 0))} {774#true} #98#return; {844#(<= 1 main_~x~0)} is VALID [2022-04-28 12:31:07,336 INFO L290 TraceCheckUtils]: 20: Hoare triple {837#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {837#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:31:07,336 INFO L290 TraceCheckUtils]: 19: Hoare triple {959#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {837#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:31:07,337 INFO L290 TraceCheckUtils]: 18: Hoare triple {774#true} ~cond := #in~cond; {959#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-28 12:31:07,337 INFO L272 TraceCheckUtils]: 17: Hoare triple {774#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {774#true} is VALID [2022-04-28 12:31:07,337 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {774#true} {774#true} #96#return; {774#true} is VALID [2022-04-28 12:31:07,337 INFO L290 TraceCheckUtils]: 15: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-28 12:31:07,337 INFO L290 TraceCheckUtils]: 14: Hoare triple {774#true} assume !(0 == ~cond); {774#true} is VALID [2022-04-28 12:31:07,337 INFO L290 TraceCheckUtils]: 13: Hoare triple {774#true} ~cond := #in~cond; {774#true} is VALID [2022-04-28 12:31:07,337 INFO L272 TraceCheckUtils]: 12: Hoare triple {774#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {774#true} is VALID [2022-04-28 12:31:07,337 INFO L290 TraceCheckUtils]: 11: Hoare triple {774#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {774#true} is VALID [2022-04-28 12:31:07,337 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {774#true} {774#true} #94#return; {774#true} is VALID [2022-04-28 12:31:07,337 INFO L290 TraceCheckUtils]: 9: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-28 12:31:07,337 INFO L290 TraceCheckUtils]: 8: Hoare triple {774#true} assume !(0 == ~cond); {774#true} is VALID [2022-04-28 12:31:07,338 INFO L290 TraceCheckUtils]: 7: Hoare triple {774#true} ~cond := #in~cond; {774#true} is VALID [2022-04-28 12:31:07,338 INFO L272 TraceCheckUtils]: 6: Hoare triple {774#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {774#true} is VALID [2022-04-28 12:31:07,338 INFO L290 TraceCheckUtils]: 5: Hoare triple {774#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {774#true} is VALID [2022-04-28 12:31:07,338 INFO L272 TraceCheckUtils]: 4: Hoare triple {774#true} call #t~ret6 := main(); {774#true} is VALID [2022-04-28 12:31:07,338 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {774#true} {774#true} #112#return; {774#true} is VALID [2022-04-28 12:31:07,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-28 12:31:07,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {774#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(11, 2);call #Ultimate.allocInit(12, 3); {774#true} is VALID [2022-04-28 12:31:07,338 INFO L272 TraceCheckUtils]: 0: Hoare triple {774#true} call ULTIMATE.init(); {774#true} is VALID [2022-04-28 12:31:07,338 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 12:31:07,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:31:07,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566677006] [2022-04-28 12:31:07,339 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:31:07,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752623140] [2022-04-28 12:31:07,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752623140] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:31:07,339 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:31:07,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-28 12:31:07,339 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:31:07,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [727213293] [2022-04-28 12:31:07,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [727213293] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:31:07,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:31:07,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 12:31:07,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178395638] [2022-04-28 12:31:07,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:31:07,340 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2022-04-28 12:31:07,340 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:31:07,340 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 12:31:07,362 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:31:07,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 12:31:07,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:31:07,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 12:31:07,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-28 12:31:07,363 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 12:31:07,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:31:07,911 INFO L93 Difference]: Finished difference Result 103 states and 143 transitions. [2022-04-28 12:31:07,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 12:31:07,911 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2022-04-28 12:31:07,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:31:07,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 12:31:07,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2022-04-28 12:31:07,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 12:31:07,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2022-04-28 12:31:07,916 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 108 transitions. [2022-04-28 12:31:08,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:31:08,004 INFO L225 Difference]: With dead ends: 103 [2022-04-28 12:31:08,004 INFO L226 Difference]: Without dead ends: 96 [2022-04-28 12:31:08,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-04-28 12:31:08,005 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 68 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 12:31:08,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 232 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 12:31:08,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-28 12:31:08,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 71. [2022-04-28 12:31:08,066 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:31:08,066 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 71 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 48 states have internal predecessors, (59), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 12:31:08,067 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 71 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 48 states have internal predecessors, (59), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 12:31:08,067 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 71 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 48 states have internal predecessors, (59), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 12:31:08,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:31:08,071 INFO L93 Difference]: Finished difference Result 96 states and 136 transitions. [2022-04-28 12:31:08,071 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 136 transitions. [2022-04-28 12:31:08,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:31:08,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:31:08,072 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 48 states have internal predecessors, (59), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 96 states. [2022-04-28 12:31:08,072 INFO L87 Difference]: Start difference. First operand has 71 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 48 states have internal predecessors, (59), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 96 states. [2022-04-28 12:31:08,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:31:08,076 INFO L93 Difference]: Finished difference Result 96 states and 136 transitions. [2022-04-28 12:31:08,076 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 136 transitions. [2022-04-28 12:31:08,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:31:08,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:31:08,077 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:31:08,077 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:31:08,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 48 states have internal predecessors, (59), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 12:31:08,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 95 transitions. [2022-04-28 12:31:08,079 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 95 transitions. Word has length 39 [2022-04-28 12:31:08,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:31:08,079 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 95 transitions. [2022-04-28 12:31:08,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 12:31:08,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 95 transitions. [2022-04-28 12:31:08,172 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-28 12:31:08,173 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 95 transitions. [2022-04-28 12:31:08,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 12:31:08,173 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:31:08,173 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:31:08,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 12:31:08,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-28 12:31:08,389 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:31:08,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:31:08,390 INFO L85 PathProgramCache]: Analyzing trace with hash -974923140, now seen corresponding path program 1 times [2022-04-28 12:31:08,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:31:08,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2055547143] [2022-04-28 12:31:08,390 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:31:08,390 INFO L85 PathProgramCache]: Analyzing trace with hash -974923140, now seen corresponding path program 2 times [2022-04-28 12:31:08,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:31:08,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079108173] [2022-04-28 12:31:08,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:31:08,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:31:08,406 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:31:08,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1166701178] [2022-04-28 12:31:08,406 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:31:08,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:31:08,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:31:08,407 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:31:08,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 12:31:08,439 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:31:08,439 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:31:08,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-28 12:31:08,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:31:08,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:31:08,959 INFO L272 TraceCheckUtils]: 0: Hoare triple {1566#true} call ULTIMATE.init(); {1566#true} is VALID [2022-04-28 12:31:08,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {1566#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(11, 2);call #Ultimate.allocInit(12, 3); {1566#true} is VALID [2022-04-28 12:31:08,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-28 12:31:08,960 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1566#true} {1566#true} #112#return; {1566#true} is VALID [2022-04-28 12:31:08,960 INFO L272 TraceCheckUtils]: 4: Hoare triple {1566#true} call #t~ret6 := main(); {1566#true} is VALID [2022-04-28 12:31:08,960 INFO L290 TraceCheckUtils]: 5: Hoare triple {1566#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1566#true} is VALID [2022-04-28 12:31:08,960 INFO L272 TraceCheckUtils]: 6: Hoare triple {1566#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {1566#true} is VALID [2022-04-28 12:31:08,960 INFO L290 TraceCheckUtils]: 7: Hoare triple {1566#true} ~cond := #in~cond; {1566#true} is VALID [2022-04-28 12:31:08,960 INFO L290 TraceCheckUtils]: 8: Hoare triple {1566#true} assume !(0 == ~cond); {1566#true} is VALID [2022-04-28 12:31:08,960 INFO L290 TraceCheckUtils]: 9: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-28 12:31:08,960 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1566#true} {1566#true} #94#return; {1566#true} is VALID [2022-04-28 12:31:08,960 INFO L290 TraceCheckUtils]: 11: Hoare triple {1566#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1566#true} is VALID [2022-04-28 12:31:08,961 INFO L272 TraceCheckUtils]: 12: Hoare triple {1566#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {1566#true} is VALID [2022-04-28 12:31:08,962 INFO L290 TraceCheckUtils]: 13: Hoare triple {1566#true} ~cond := #in~cond; {1610#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 12:31:08,962 INFO L290 TraceCheckUtils]: 14: Hoare triple {1610#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1614#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:31:08,962 INFO L290 TraceCheckUtils]: 15: Hoare triple {1614#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1614#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:31:08,963 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1614#(not (= |assume_abort_if_not_#in~cond| 0))} {1566#true} #96#return; {1621#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 12:31:08,963 INFO L272 TraceCheckUtils]: 17: Hoare triple {1621#(and (<= 0 main_~y~0) (<= main_~y~0 2))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1566#true} is VALID [2022-04-28 12:31:08,963 INFO L290 TraceCheckUtils]: 18: Hoare triple {1566#true} ~cond := #in~cond; {1610#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 12:31:08,964 INFO L290 TraceCheckUtils]: 19: Hoare triple {1610#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1614#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:31:08,964 INFO L290 TraceCheckUtils]: 20: Hoare triple {1614#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1614#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:31:08,964 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1614#(not (= |assume_abort_if_not_#in~cond| 0))} {1621#(and (<= 0 main_~y~0) (<= main_~y~0 2))} #98#return; {1637#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2))} is VALID [2022-04-28 12:31:08,964 INFO L272 TraceCheckUtils]: 22: Hoare triple {1637#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1566#true} is VALID [2022-04-28 12:31:08,965 INFO L290 TraceCheckUtils]: 23: Hoare triple {1566#true} ~cond := #in~cond; {1566#true} is VALID [2022-04-28 12:31:08,965 INFO L290 TraceCheckUtils]: 24: Hoare triple {1566#true} assume !(0 == ~cond); {1566#true} is VALID [2022-04-28 12:31:08,965 INFO L290 TraceCheckUtils]: 25: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-28 12:31:08,965 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1566#true} {1637#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2))} #100#return; {1637#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2))} is VALID [2022-04-28 12:31:08,965 INFO L290 TraceCheckUtils]: 27: Hoare triple {1637#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {1656#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 12:31:08,966 INFO L290 TraceCheckUtils]: 28: Hoare triple {1656#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !false; {1656#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 12:31:08,966 INFO L290 TraceCheckUtils]: 29: Hoare triple {1656#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {1663#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 12:31:08,967 INFO L290 TraceCheckUtils]: 30: Hoare triple {1663#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} assume !false; {1663#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 12:31:08,967 INFO L290 TraceCheckUtils]: 31: Hoare triple {1663#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} assume !(~c~0 >= ~b~0); {1663#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 12:31:08,968 INFO L290 TraceCheckUtils]: 32: Hoare triple {1663#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {1673#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 12:31:08,968 INFO L290 TraceCheckUtils]: 33: Hoare triple {1673#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !false; {1673#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 12:31:08,968 INFO L290 TraceCheckUtils]: 34: Hoare triple {1673#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {1680#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 12:31:08,972 INFO L290 TraceCheckUtils]: 35: Hoare triple {1680#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !false; {1680#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 12:31:08,972 INFO L290 TraceCheckUtils]: 36: Hoare triple {1680#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {1687#(and (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (<= main_~x~0 main_~a~0))} is VALID [2022-04-28 12:31:08,973 INFO L290 TraceCheckUtils]: 37: Hoare triple {1687#(and (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (<= main_~x~0 main_~a~0))} assume !false; {1687#(and (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (<= main_~x~0 main_~a~0))} is VALID [2022-04-28 12:31:08,973 INFO L272 TraceCheckUtils]: 38: Hoare triple {1687#(and (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (<= main_~x~0 main_~a~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {1694#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:31:08,974 INFO L290 TraceCheckUtils]: 39: Hoare triple {1694#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1698#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:31:08,974 INFO L290 TraceCheckUtils]: 40: Hoare triple {1698#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1567#false} is VALID [2022-04-28 12:31:08,974 INFO L290 TraceCheckUtils]: 41: Hoare triple {1567#false} assume !false; {1567#false} is VALID [2022-04-28 12:31:08,974 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 12:31:08,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:31:09,305 INFO L290 TraceCheckUtils]: 41: Hoare triple {1567#false} assume !false; {1567#false} is VALID [2022-04-28 12:31:09,306 INFO L290 TraceCheckUtils]: 40: Hoare triple {1698#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1567#false} is VALID [2022-04-28 12:31:09,306 INFO L290 TraceCheckUtils]: 39: Hoare triple {1694#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1698#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:31:09,307 INFO L272 TraceCheckUtils]: 38: Hoare triple {1714#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {1694#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:31:09,307 INFO L290 TraceCheckUtils]: 37: Hoare triple {1714#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {1714#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:31:09,307 INFO L290 TraceCheckUtils]: 36: Hoare triple {1721#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (<= main_~b~0 main_~c~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {1714#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:31:09,308 INFO L290 TraceCheckUtils]: 35: Hoare triple {1721#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (<= main_~b~0 main_~c~0)))} assume !false; {1721#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (<= main_~b~0 main_~c~0)))} is VALID [2022-04-28 12:31:09,308 INFO L290 TraceCheckUtils]: 34: Hoare triple {1728#(or (not (<= main_~b~0 main_~a~0)) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {1721#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (<= main_~b~0 main_~c~0)))} is VALID [2022-04-28 12:31:09,309 INFO L290 TraceCheckUtils]: 33: Hoare triple {1728#(or (not (<= main_~b~0 main_~a~0)) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !false; {1728#(or (not (<= main_~b~0 main_~a~0)) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:31:09,309 INFO L290 TraceCheckUtils]: 32: Hoare triple {1735#(or (not (<= main_~c~0 main_~b~0)) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {1728#(or (not (<= main_~b~0 main_~a~0)) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:31:09,309 INFO L290 TraceCheckUtils]: 31: Hoare triple {1735#(or (not (<= main_~c~0 main_~b~0)) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= ~b~0); {1735#(or (not (<= main_~c~0 main_~b~0)) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:31:09,310 INFO L290 TraceCheckUtils]: 30: Hoare triple {1735#(or (not (<= main_~c~0 main_~b~0)) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !false; {1735#(or (not (<= main_~c~0 main_~b~0)) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:31:09,310 INFO L290 TraceCheckUtils]: 29: Hoare triple {1745#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (<= main_~a~0 main_~b~0)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {1735#(or (not (<= main_~c~0 main_~b~0)) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:31:09,311 INFO L290 TraceCheckUtils]: 28: Hoare triple {1745#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (<= main_~a~0 main_~b~0)))} assume !false; {1745#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (<= main_~a~0 main_~b~0)))} is VALID [2022-04-28 12:31:09,311 INFO L290 TraceCheckUtils]: 27: Hoare triple {1566#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {1745#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (<= main_~a~0 main_~b~0)))} is VALID [2022-04-28 12:31:09,311 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1566#true} {1566#true} #100#return; {1566#true} is VALID [2022-04-28 12:31:09,311 INFO L290 TraceCheckUtils]: 25: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-28 12:31:09,311 INFO L290 TraceCheckUtils]: 24: Hoare triple {1566#true} assume !(0 == ~cond); {1566#true} is VALID [2022-04-28 12:31:09,311 INFO L290 TraceCheckUtils]: 23: Hoare triple {1566#true} ~cond := #in~cond; {1566#true} is VALID [2022-04-28 12:31:09,311 INFO L272 TraceCheckUtils]: 22: Hoare triple {1566#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1566#true} is VALID [2022-04-28 12:31:09,311 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1566#true} {1566#true} #98#return; {1566#true} is VALID [2022-04-28 12:31:09,312 INFO L290 TraceCheckUtils]: 20: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-28 12:31:09,312 INFO L290 TraceCheckUtils]: 19: Hoare triple {1566#true} assume !(0 == ~cond); {1566#true} is VALID [2022-04-28 12:31:09,312 INFO L290 TraceCheckUtils]: 18: Hoare triple {1566#true} ~cond := #in~cond; {1566#true} is VALID [2022-04-28 12:31:09,312 INFO L272 TraceCheckUtils]: 17: Hoare triple {1566#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1566#true} is VALID [2022-04-28 12:31:09,312 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1566#true} {1566#true} #96#return; {1566#true} is VALID [2022-04-28 12:31:09,312 INFO L290 TraceCheckUtils]: 15: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-28 12:31:09,312 INFO L290 TraceCheckUtils]: 14: Hoare triple {1566#true} assume !(0 == ~cond); {1566#true} is VALID [2022-04-28 12:31:09,312 INFO L290 TraceCheckUtils]: 13: Hoare triple {1566#true} ~cond := #in~cond; {1566#true} is VALID [2022-04-28 12:31:09,312 INFO L272 TraceCheckUtils]: 12: Hoare triple {1566#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {1566#true} is VALID [2022-04-28 12:31:09,312 INFO L290 TraceCheckUtils]: 11: Hoare triple {1566#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1566#true} is VALID [2022-04-28 12:31:09,312 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1566#true} {1566#true} #94#return; {1566#true} is VALID [2022-04-28 12:31:09,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-28 12:31:09,312 INFO L290 TraceCheckUtils]: 8: Hoare triple {1566#true} assume !(0 == ~cond); {1566#true} is VALID [2022-04-28 12:31:09,313 INFO L290 TraceCheckUtils]: 7: Hoare triple {1566#true} ~cond := #in~cond; {1566#true} is VALID [2022-04-28 12:31:09,313 INFO L272 TraceCheckUtils]: 6: Hoare triple {1566#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {1566#true} is VALID [2022-04-28 12:31:09,313 INFO L290 TraceCheckUtils]: 5: Hoare triple {1566#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1566#true} is VALID [2022-04-28 12:31:09,313 INFO L272 TraceCheckUtils]: 4: Hoare triple {1566#true} call #t~ret6 := main(); {1566#true} is VALID [2022-04-28 12:31:09,313 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1566#true} {1566#true} #112#return; {1566#true} is VALID [2022-04-28 12:31:09,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-28 12:31:09,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {1566#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(11, 2);call #Ultimate.allocInit(12, 3); {1566#true} is VALID [2022-04-28 12:31:09,313 INFO L272 TraceCheckUtils]: 0: Hoare triple {1566#true} call ULTIMATE.init(); {1566#true} is VALID [2022-04-28 12:31:09,313 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 12:31:09,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:31:09,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079108173] [2022-04-28 12:31:09,314 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:31:09,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166701178] [2022-04-28 12:31:09,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166701178] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:31:09,314 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:31:09,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 18 [2022-04-28 12:31:09,314 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:31:09,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2055547143] [2022-04-28 12:31:09,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2055547143] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:31:09,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:31:09,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 12:31:09,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412443923] [2022-04-28 12:31:09,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:31:09,315 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 10 states have internal predecessors, (24), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 42 [2022-04-28 12:31:09,315 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:31:09,315 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.0) internal successors, (24), 10 states have internal predecessors, (24), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 12:31:09,340 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:31:09,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 12:31:09,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:31:09,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 12:31:09,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2022-04-28 12:31:09,342 INFO L87 Difference]: Start difference. First operand 71 states and 95 transitions. Second operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 10 states have internal predecessors, (24), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 12:31:10,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:31:10,569 INFO L93 Difference]: Finished difference Result 112 states and 151 transitions. [2022-04-28 12:31:10,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 12:31:10,570 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 10 states have internal predecessors, (24), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 42 [2022-04-28 12:31:10,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:31:10,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 10 states have internal predecessors, (24), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 12:31:10,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 117 transitions. [2022-04-28 12:31:10,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 10 states have internal predecessors, (24), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 12:31:10,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 117 transitions. [2022-04-28 12:31:10,574 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 117 transitions. [2022-04-28 12:31:10,690 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:31:10,693 INFO L225 Difference]: With dead ends: 112 [2022-04-28 12:31:10,694 INFO L226 Difference]: Without dead ends: 110 [2022-04-28 12:31:10,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2022-04-28 12:31:10,694 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 89 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 12:31:10,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 245 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 12:31:10,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-28 12:31:10,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 93. [2022-04-28 12:31:10,844 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:31:10,844 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand has 93 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 64 states have internal predecessors, (78), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 12:31:10,845 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand has 93 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 64 states have internal predecessors, (78), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 12:31:10,845 INFO L87 Difference]: Start difference. First operand 110 states. Second operand has 93 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 64 states have internal predecessors, (78), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 12:31:10,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:31:10,848 INFO L93 Difference]: Finished difference Result 110 states and 149 transitions. [2022-04-28 12:31:10,848 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 149 transitions. [2022-04-28 12:31:10,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:31:10,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:31:10,849 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 64 states have internal predecessors, (78), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 110 states. [2022-04-28 12:31:10,849 INFO L87 Difference]: Start difference. First operand has 93 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 64 states have internal predecessors, (78), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 110 states. [2022-04-28 12:31:10,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:31:10,852 INFO L93 Difference]: Finished difference Result 110 states and 149 transitions. [2022-04-28 12:31:10,852 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 149 transitions. [2022-04-28 12:31:10,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:31:10,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:31:10,853 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:31:10,853 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:31:10,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 64 states have internal predecessors, (78), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 12:31:10,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 122 transitions. [2022-04-28 12:31:10,856 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 122 transitions. Word has length 42 [2022-04-28 12:31:10,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:31:10,856 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 122 transitions. [2022-04-28 12:31:10,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 10 states have internal predecessors, (24), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 12:31:10,856 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 93 states and 122 transitions. [2022-04-28 12:31:11,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:31:11,003 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 122 transitions. [2022-04-28 12:31:11,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-28 12:31:11,003 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:31:11,003 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:31:11,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 12:31:11,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:31:11,204 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:31:11,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:31:11,205 INFO L85 PathProgramCache]: Analyzing trace with hash 81990170, now seen corresponding path program 1 times [2022-04-28 12:31:11,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:31:11,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [240392403] [2022-04-28 12:31:11,205 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:31:11,205 INFO L85 PathProgramCache]: Analyzing trace with hash 81990170, now seen corresponding path program 2 times [2022-04-28 12:31:11,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:31:11,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055722800] [2022-04-28 12:31:11,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:31:11,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:31:11,218 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:31:11,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [231503137] [2022-04-28 12:31:11,218 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:31:11,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:31:11,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:31:11,219 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:31:11,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 12:31:11,256 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:31:11,256 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:31:11,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 12:31:11,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:31:11,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:31:11,515 INFO L272 TraceCheckUtils]: 0: Hoare triple {2475#true} call ULTIMATE.init(); {2475#true} is VALID [2022-04-28 12:31:11,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {2475#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(11, 2);call #Ultimate.allocInit(12, 3); {2475#true} is VALID [2022-04-28 12:31:11,515 INFO L290 TraceCheckUtils]: 2: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-28 12:31:11,515 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2475#true} {2475#true} #112#return; {2475#true} is VALID [2022-04-28 12:31:11,515 INFO L272 TraceCheckUtils]: 4: Hoare triple {2475#true} call #t~ret6 := main(); {2475#true} is VALID [2022-04-28 12:31:11,515 INFO L290 TraceCheckUtils]: 5: Hoare triple {2475#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2475#true} is VALID [2022-04-28 12:31:11,516 INFO L272 TraceCheckUtils]: 6: Hoare triple {2475#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {2475#true} is VALID [2022-04-28 12:31:11,516 INFO L290 TraceCheckUtils]: 7: Hoare triple {2475#true} ~cond := #in~cond; {2475#true} is VALID [2022-04-28 12:31:11,516 INFO L290 TraceCheckUtils]: 8: Hoare triple {2475#true} assume !(0 == ~cond); {2475#true} is VALID [2022-04-28 12:31:11,516 INFO L290 TraceCheckUtils]: 9: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-28 12:31:11,516 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2475#true} {2475#true} #94#return; {2475#true} is VALID [2022-04-28 12:31:11,516 INFO L290 TraceCheckUtils]: 11: Hoare triple {2475#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2475#true} is VALID [2022-04-28 12:31:11,516 INFO L272 TraceCheckUtils]: 12: Hoare triple {2475#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {2475#true} is VALID [2022-04-28 12:31:11,516 INFO L290 TraceCheckUtils]: 13: Hoare triple {2475#true} ~cond := #in~cond; {2519#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 12:31:11,517 INFO L290 TraceCheckUtils]: 14: Hoare triple {2519#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2523#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:31:11,517 INFO L290 TraceCheckUtils]: 15: Hoare triple {2523#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2523#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:31:11,518 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2523#(not (= |assume_abort_if_not_#in~cond| 0))} {2475#true} #96#return; {2530#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 12:31:11,518 INFO L272 TraceCheckUtils]: 17: Hoare triple {2530#(and (<= 0 main_~y~0) (<= main_~y~0 2))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2475#true} is VALID [2022-04-28 12:31:11,518 INFO L290 TraceCheckUtils]: 18: Hoare triple {2475#true} ~cond := #in~cond; {2475#true} is VALID [2022-04-28 12:31:11,518 INFO L290 TraceCheckUtils]: 19: Hoare triple {2475#true} assume !(0 == ~cond); {2475#true} is VALID [2022-04-28 12:31:11,518 INFO L290 TraceCheckUtils]: 20: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-28 12:31:11,518 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2475#true} {2530#(and (<= 0 main_~y~0) (<= main_~y~0 2))} #98#return; {2530#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 12:31:11,518 INFO L272 TraceCheckUtils]: 22: Hoare triple {2530#(and (<= 0 main_~y~0) (<= main_~y~0 2))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2475#true} is VALID [2022-04-28 12:31:11,518 INFO L290 TraceCheckUtils]: 23: Hoare triple {2475#true} ~cond := #in~cond; {2475#true} is VALID [2022-04-28 12:31:11,519 INFO L290 TraceCheckUtils]: 24: Hoare triple {2475#true} assume !(0 == ~cond); {2475#true} is VALID [2022-04-28 12:31:11,519 INFO L290 TraceCheckUtils]: 25: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-28 12:31:11,519 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2475#true} {2530#(and (<= 0 main_~y~0) (<= main_~y~0 2))} #100#return; {2530#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 12:31:11,519 INFO L290 TraceCheckUtils]: 27: Hoare triple {2530#(and (<= 0 main_~y~0) (<= main_~y~0 2))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {2564#(<= 0 main_~b~0)} is VALID [2022-04-28 12:31:11,520 INFO L290 TraceCheckUtils]: 28: Hoare triple {2564#(<= 0 main_~b~0)} assume !false; {2564#(<= 0 main_~b~0)} is VALID [2022-04-28 12:31:11,520 INFO L290 TraceCheckUtils]: 29: Hoare triple {2564#(<= 0 main_~b~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {2571#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-28 12:31:11,520 INFO L290 TraceCheckUtils]: 30: Hoare triple {2571#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} assume !false; {2571#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-28 12:31:11,521 INFO L290 TraceCheckUtils]: 31: Hoare triple {2571#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {2571#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-28 12:31:11,521 INFO L290 TraceCheckUtils]: 32: Hoare triple {2571#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} assume !false; {2571#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-28 12:31:11,521 INFO L272 TraceCheckUtils]: 33: Hoare triple {2571#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2475#true} is VALID [2022-04-28 12:31:11,521 INFO L290 TraceCheckUtils]: 34: Hoare triple {2475#true} ~cond := #in~cond; {2475#true} is VALID [2022-04-28 12:31:11,521 INFO L290 TraceCheckUtils]: 35: Hoare triple {2475#true} assume !(0 == ~cond); {2475#true} is VALID [2022-04-28 12:31:11,522 INFO L290 TraceCheckUtils]: 36: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-28 12:31:11,522 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2475#true} {2571#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} #102#return; {2571#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-28 12:31:11,522 INFO L272 TraceCheckUtils]: 38: Hoare triple {2571#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {2475#true} is VALID [2022-04-28 12:31:11,522 INFO L290 TraceCheckUtils]: 39: Hoare triple {2475#true} ~cond := #in~cond; {2475#true} is VALID [2022-04-28 12:31:11,522 INFO L290 TraceCheckUtils]: 40: Hoare triple {2475#true} assume !(0 == ~cond); {2475#true} is VALID [2022-04-28 12:31:11,522 INFO L290 TraceCheckUtils]: 41: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-28 12:31:11,523 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2475#true} {2571#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} #104#return; {2571#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-28 12:31:11,524 INFO L272 TraceCheckUtils]: 43: Hoare triple {2571#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {2614#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:31:11,524 INFO L290 TraceCheckUtils]: 44: Hoare triple {2614#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2618#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:31:11,524 INFO L290 TraceCheckUtils]: 45: Hoare triple {2618#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2476#false} is VALID [2022-04-28 12:31:11,524 INFO L290 TraceCheckUtils]: 46: Hoare triple {2476#false} assume !false; {2476#false} is VALID [2022-04-28 12:31:11,524 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-28 12:31:11,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:31:11,709 INFO L290 TraceCheckUtils]: 46: Hoare triple {2476#false} assume !false; {2476#false} is VALID [2022-04-28 12:31:11,709 INFO L290 TraceCheckUtils]: 45: Hoare triple {2618#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2476#false} is VALID [2022-04-28 12:31:11,710 INFO L290 TraceCheckUtils]: 44: Hoare triple {2614#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2618#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:31:11,710 INFO L272 TraceCheckUtils]: 43: Hoare triple {2634#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {2614#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:31:11,711 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2475#true} {2634#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #104#return; {2634#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 12:31:11,711 INFO L290 TraceCheckUtils]: 41: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-28 12:31:11,711 INFO L290 TraceCheckUtils]: 40: Hoare triple {2475#true} assume !(0 == ~cond); {2475#true} is VALID [2022-04-28 12:31:11,711 INFO L290 TraceCheckUtils]: 39: Hoare triple {2475#true} ~cond := #in~cond; {2475#true} is VALID [2022-04-28 12:31:11,711 INFO L272 TraceCheckUtils]: 38: Hoare triple {2634#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {2475#true} is VALID [2022-04-28 12:31:11,713 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2475#true} {2634#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #102#return; {2634#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 12:31:11,713 INFO L290 TraceCheckUtils]: 36: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-28 12:31:11,713 INFO L290 TraceCheckUtils]: 35: Hoare triple {2475#true} assume !(0 == ~cond); {2475#true} is VALID [2022-04-28 12:31:11,713 INFO L290 TraceCheckUtils]: 34: Hoare triple {2475#true} ~cond := #in~cond; {2475#true} is VALID [2022-04-28 12:31:11,713 INFO L272 TraceCheckUtils]: 33: Hoare triple {2634#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2475#true} is VALID [2022-04-28 12:31:11,714 INFO L290 TraceCheckUtils]: 32: Hoare triple {2634#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !false; {2634#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 12:31:11,714 INFO L290 TraceCheckUtils]: 31: Hoare triple {2634#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {2634#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 12:31:11,714 INFO L290 TraceCheckUtils]: 30: Hoare triple {2634#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !false; {2634#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 12:31:11,715 INFO L290 TraceCheckUtils]: 29: Hoare triple {2475#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {2634#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 12:31:11,715 INFO L290 TraceCheckUtils]: 28: Hoare triple {2475#true} assume !false; {2475#true} is VALID [2022-04-28 12:31:11,715 INFO L290 TraceCheckUtils]: 27: Hoare triple {2475#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {2475#true} is VALID [2022-04-28 12:31:11,715 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2475#true} {2475#true} #100#return; {2475#true} is VALID [2022-04-28 12:31:11,715 INFO L290 TraceCheckUtils]: 25: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-28 12:31:11,715 INFO L290 TraceCheckUtils]: 24: Hoare triple {2475#true} assume !(0 == ~cond); {2475#true} is VALID [2022-04-28 12:31:11,715 INFO L290 TraceCheckUtils]: 23: Hoare triple {2475#true} ~cond := #in~cond; {2475#true} is VALID [2022-04-28 12:31:11,715 INFO L272 TraceCheckUtils]: 22: Hoare triple {2475#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2475#true} is VALID [2022-04-28 12:31:11,715 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2475#true} {2475#true} #98#return; {2475#true} is VALID [2022-04-28 12:31:11,715 INFO L290 TraceCheckUtils]: 20: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-28 12:31:11,715 INFO L290 TraceCheckUtils]: 19: Hoare triple {2475#true} assume !(0 == ~cond); {2475#true} is VALID [2022-04-28 12:31:11,715 INFO L290 TraceCheckUtils]: 18: Hoare triple {2475#true} ~cond := #in~cond; {2475#true} is VALID [2022-04-28 12:31:11,715 INFO L272 TraceCheckUtils]: 17: Hoare triple {2475#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2475#true} is VALID [2022-04-28 12:31:11,716 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2475#true} {2475#true} #96#return; {2475#true} is VALID [2022-04-28 12:31:11,716 INFO L290 TraceCheckUtils]: 15: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-28 12:31:11,716 INFO L290 TraceCheckUtils]: 14: Hoare triple {2475#true} assume !(0 == ~cond); {2475#true} is VALID [2022-04-28 12:31:11,716 INFO L290 TraceCheckUtils]: 13: Hoare triple {2475#true} ~cond := #in~cond; {2475#true} is VALID [2022-04-28 12:31:11,716 INFO L272 TraceCheckUtils]: 12: Hoare triple {2475#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {2475#true} is VALID [2022-04-28 12:31:11,716 INFO L290 TraceCheckUtils]: 11: Hoare triple {2475#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2475#true} is VALID [2022-04-28 12:31:11,716 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2475#true} {2475#true} #94#return; {2475#true} is VALID [2022-04-28 12:31:11,716 INFO L290 TraceCheckUtils]: 9: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-28 12:31:11,716 INFO L290 TraceCheckUtils]: 8: Hoare triple {2475#true} assume !(0 == ~cond); {2475#true} is VALID [2022-04-28 12:31:11,716 INFO L290 TraceCheckUtils]: 7: Hoare triple {2475#true} ~cond := #in~cond; {2475#true} is VALID [2022-04-28 12:31:11,716 INFO L272 TraceCheckUtils]: 6: Hoare triple {2475#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {2475#true} is VALID [2022-04-28 12:31:11,716 INFO L290 TraceCheckUtils]: 5: Hoare triple {2475#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2475#true} is VALID [2022-04-28 12:31:11,716 INFO L272 TraceCheckUtils]: 4: Hoare triple {2475#true} call #t~ret6 := main(); {2475#true} is VALID [2022-04-28 12:31:11,716 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2475#true} {2475#true} #112#return; {2475#true} is VALID [2022-04-28 12:31:11,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-28 12:31:11,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {2475#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(11, 2);call #Ultimate.allocInit(12, 3); {2475#true} is VALID [2022-04-28 12:31:11,717 INFO L272 TraceCheckUtils]: 0: Hoare triple {2475#true} call ULTIMATE.init(); {2475#true} is VALID [2022-04-28 12:31:11,717 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 12:31:11,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:31:11,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055722800] [2022-04-28 12:31:11,717 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:31:11,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231503137] [2022-04-28 12:31:11,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231503137] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 12:31:11,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 12:31:11,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2022-04-28 12:31:11,718 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:31:11,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [240392403] [2022-04-28 12:31:11,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [240392403] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:31:11,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:31:11,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:31:11,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15589751] [2022-04-28 12:31:11,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:31:11,718 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 47 [2022-04-28 12:31:11,718 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:31:11,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 12:31:11,740 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:31:11,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 12:31:11,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:31:11,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 12:31:11,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-04-28 12:31:11,741 INFO L87 Difference]: Start difference. First operand 93 states and 122 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 12:31:12,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:31:12,117 INFO L93 Difference]: Finished difference Result 130 states and 179 transitions. [2022-04-28 12:31:12,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 12:31:12,117 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 47 [2022-04-28 12:31:12,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:31:12,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 12:31:12,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-28 12:31:12,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 12:31:12,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-28 12:31:12,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-28 12:31:12,160 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-28 12:31:12,162 INFO L225 Difference]: With dead ends: 130 [2022-04-28 12:31:12,162 INFO L226 Difference]: Without dead ends: 128 [2022-04-28 12:31:12,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-28 12:31:12,163 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 8 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:31:12,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 141 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:31:12,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-04-28 12:31:12,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 123. [2022-04-28 12:31:12,370 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:31:12,371 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand has 123 states, 76 states have (on average 1.263157894736842) internal successors, (96), 77 states have internal predecessors, (96), 39 states have call successors, (39), 8 states have call predecessors, (39), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 12:31:12,371 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand has 123 states, 76 states have (on average 1.263157894736842) internal successors, (96), 77 states have internal predecessors, (96), 39 states have call successors, (39), 8 states have call predecessors, (39), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 12:31:12,371 INFO L87 Difference]: Start difference. First operand 128 states. Second operand has 123 states, 76 states have (on average 1.263157894736842) internal successors, (96), 77 states have internal predecessors, (96), 39 states have call successors, (39), 8 states have call predecessors, (39), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 12:31:12,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:31:12,375 INFO L93 Difference]: Finished difference Result 128 states and 177 transitions. [2022-04-28 12:31:12,375 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 177 transitions. [2022-04-28 12:31:12,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:31:12,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:31:12,376 INFO L74 IsIncluded]: Start isIncluded. First operand has 123 states, 76 states have (on average 1.263157894736842) internal successors, (96), 77 states have internal predecessors, (96), 39 states have call successors, (39), 8 states have call predecessors, (39), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand 128 states. [2022-04-28 12:31:12,376 INFO L87 Difference]: Start difference. First operand has 123 states, 76 states have (on average 1.263157894736842) internal successors, (96), 77 states have internal predecessors, (96), 39 states have call successors, (39), 8 states have call predecessors, (39), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand 128 states. [2022-04-28 12:31:12,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:31:12,380 INFO L93 Difference]: Finished difference Result 128 states and 177 transitions. [2022-04-28 12:31:12,380 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 177 transitions. [2022-04-28 12:31:12,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:31:12,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:31:12,380 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:31:12,380 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:31:12,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 76 states have (on average 1.263157894736842) internal successors, (96), 77 states have internal predecessors, (96), 39 states have call successors, (39), 8 states have call predecessors, (39), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 12:31:12,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 172 transitions. [2022-04-28 12:31:12,384 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 172 transitions. Word has length 47 [2022-04-28 12:31:12,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:31:12,384 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 172 transitions. [2022-04-28 12:31:12,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 12:31:12,384 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 123 states and 172 transitions. [2022-04-28 12:31:12,581 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:31:12,582 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 172 transitions. [2022-04-28 12:31:12,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-28 12:31:12,582 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:31:12,582 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:31:12,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 12:31:12,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:31:12,783 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:31:12,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:31:12,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1524769911, now seen corresponding path program 1 times [2022-04-28 12:31:12,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:31:12,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1190295440] [2022-04-28 12:31:12,783 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:31:12,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1524769911, now seen corresponding path program 2 times [2022-04-28 12:31:12,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:31:12,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452389562] [2022-04-28 12:31:12,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:31:12,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:31:12,797 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:31:12,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1379122939] [2022-04-28 12:31:12,797 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:31:12,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:31:12,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:31:12,798 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:31:12,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 12:31:12,840 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:31:12,840 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:31:12,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-28 12:31:12,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:31:12,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:31:13,388 INFO L272 TraceCheckUtils]: 0: Hoare triple {3530#true} call ULTIMATE.init(); {3530#true} is VALID [2022-04-28 12:31:13,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {3530#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(11, 2);call #Ultimate.allocInit(12, 3); {3530#true} is VALID [2022-04-28 12:31:13,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {3530#true} assume true; {3530#true} is VALID [2022-04-28 12:31:13,389 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3530#true} {3530#true} #112#return; {3530#true} is VALID [2022-04-28 12:31:13,389 INFO L272 TraceCheckUtils]: 4: Hoare triple {3530#true} call #t~ret6 := main(); {3530#true} is VALID [2022-04-28 12:31:13,389 INFO L290 TraceCheckUtils]: 5: Hoare triple {3530#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {3530#true} is VALID [2022-04-28 12:31:13,389 INFO L272 TraceCheckUtils]: 6: Hoare triple {3530#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {3530#true} is VALID [2022-04-28 12:31:13,389 INFO L290 TraceCheckUtils]: 7: Hoare triple {3530#true} ~cond := #in~cond; {3530#true} is VALID [2022-04-28 12:31:13,389 INFO L290 TraceCheckUtils]: 8: Hoare triple {3530#true} assume !(0 == ~cond); {3530#true} is VALID [2022-04-28 12:31:13,389 INFO L290 TraceCheckUtils]: 9: Hoare triple {3530#true} assume true; {3530#true} is VALID [2022-04-28 12:31:13,389 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3530#true} {3530#true} #94#return; {3530#true} is VALID [2022-04-28 12:31:13,389 INFO L290 TraceCheckUtils]: 11: Hoare triple {3530#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3530#true} is VALID [2022-04-28 12:31:13,389 INFO L272 TraceCheckUtils]: 12: Hoare triple {3530#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {3530#true} is VALID [2022-04-28 12:31:13,395 INFO L290 TraceCheckUtils]: 13: Hoare triple {3530#true} ~cond := #in~cond; {3574#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 12:31:13,396 INFO L290 TraceCheckUtils]: 14: Hoare triple {3574#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3578#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:31:13,396 INFO L290 TraceCheckUtils]: 15: Hoare triple {3578#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3578#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:31:13,397 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3578#(not (= |assume_abort_if_not_#in~cond| 0))} {3530#true} #96#return; {3585#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 12:31:13,397 INFO L272 TraceCheckUtils]: 17: Hoare triple {3585#(and (<= 0 main_~y~0) (<= main_~y~0 2))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3530#true} is VALID [2022-04-28 12:31:13,397 INFO L290 TraceCheckUtils]: 18: Hoare triple {3530#true} ~cond := #in~cond; {3574#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 12:31:13,397 INFO L290 TraceCheckUtils]: 19: Hoare triple {3574#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3578#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:31:13,398 INFO L290 TraceCheckUtils]: 20: Hoare triple {3578#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3578#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:31:13,398 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3578#(not (= |assume_abort_if_not_#in~cond| 0))} {3585#(and (<= 0 main_~y~0) (<= main_~y~0 2))} #98#return; {3601#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2))} is VALID [2022-04-28 12:31:13,398 INFO L272 TraceCheckUtils]: 22: Hoare triple {3601#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3530#true} is VALID [2022-04-28 12:31:13,399 INFO L290 TraceCheckUtils]: 23: Hoare triple {3530#true} ~cond := #in~cond; {3574#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 12:31:13,399 INFO L290 TraceCheckUtils]: 24: Hoare triple {3574#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3578#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:31:13,399 INFO L290 TraceCheckUtils]: 25: Hoare triple {3578#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3578#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:31:13,400 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3578#(not (= |assume_abort_if_not_#in~cond| 0))} {3601#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2))} #100#return; {3617#(and (<= 1 main_~x~0) (<= main_~y~0 2) (<= 1 main_~y~0))} is VALID [2022-04-28 12:31:13,400 INFO L290 TraceCheckUtils]: 27: Hoare triple {3617#(and (<= 1 main_~x~0) (<= main_~y~0 2) (<= 1 main_~y~0))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {3621#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:31:13,401 INFO L290 TraceCheckUtils]: 28: Hoare triple {3621#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {3621#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:31:13,401 INFO L290 TraceCheckUtils]: 29: Hoare triple {3621#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {3628#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:31:13,402 INFO L290 TraceCheckUtils]: 30: Hoare triple {3628#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !false; {3628#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:31:13,403 INFO L290 TraceCheckUtils]: 31: Hoare triple {3628#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {3635#(and (= main_~r~0 0) (<= 1 main_~x~0) (< main_~c~0 main_~y~0) (<= main_~y~0 2) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:31:13,403 INFO L290 TraceCheckUtils]: 32: Hoare triple {3635#(and (= main_~r~0 0) (<= 1 main_~x~0) (< main_~c~0 main_~y~0) (<= main_~y~0 2) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {3639#(and (= main_~s~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-28 12:31:13,404 INFO L290 TraceCheckUtils]: 33: Hoare triple {3639#(and (= main_~s~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !false; {3639#(and (= main_~s~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-28 12:31:13,404 INFO L290 TraceCheckUtils]: 34: Hoare triple {3639#(and (= main_~s~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {3639#(and (= main_~s~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-28 12:31:13,404 INFO L290 TraceCheckUtils]: 35: Hoare triple {3639#(and (= main_~s~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !false; {3639#(and (= main_~s~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-28 12:31:13,405 INFO L290 TraceCheckUtils]: 36: Hoare triple {3639#(and (= main_~s~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {3639#(and (= main_~s~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-28 12:31:13,405 INFO L290 TraceCheckUtils]: 37: Hoare triple {3639#(and (= main_~s~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !false; {3639#(and (= main_~s~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-28 12:31:13,405 INFO L272 TraceCheckUtils]: 38: Hoare triple {3639#(and (= main_~s~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3530#true} is VALID [2022-04-28 12:31:13,405 INFO L290 TraceCheckUtils]: 39: Hoare triple {3530#true} ~cond := #in~cond; {3530#true} is VALID [2022-04-28 12:31:13,406 INFO L290 TraceCheckUtils]: 40: Hoare triple {3530#true} assume !(0 == ~cond); {3530#true} is VALID [2022-04-28 12:31:13,406 INFO L290 TraceCheckUtils]: 41: Hoare triple {3530#true} assume true; {3530#true} is VALID [2022-04-28 12:31:13,406 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {3530#true} {3639#(and (= main_~s~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #102#return; {3639#(and (= main_~s~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-28 12:31:13,407 INFO L272 TraceCheckUtils]: 43: Hoare triple {3639#(and (= main_~s~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3673#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:31:13,408 INFO L290 TraceCheckUtils]: 44: Hoare triple {3673#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3677#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:31:13,408 INFO L290 TraceCheckUtils]: 45: Hoare triple {3677#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3531#false} is VALID [2022-04-28 12:31:13,408 INFO L290 TraceCheckUtils]: 46: Hoare triple {3531#false} assume !false; {3531#false} is VALID [2022-04-28 12:31:13,408 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 12:31:13,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:31:13,774 INFO L290 TraceCheckUtils]: 46: Hoare triple {3531#false} assume !false; {3531#false} is VALID [2022-04-28 12:31:13,775 INFO L290 TraceCheckUtils]: 45: Hoare triple {3677#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3531#false} is VALID [2022-04-28 12:31:13,775 INFO L290 TraceCheckUtils]: 44: Hoare triple {3673#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3677#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:31:13,776 INFO L272 TraceCheckUtils]: 43: Hoare triple {3693#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3673#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:31:13,776 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {3530#true} {3693#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #102#return; {3693#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:31:13,776 INFO L290 TraceCheckUtils]: 41: Hoare triple {3530#true} assume true; {3530#true} is VALID [2022-04-28 12:31:13,776 INFO L290 TraceCheckUtils]: 40: Hoare triple {3530#true} assume !(0 == ~cond); {3530#true} is VALID [2022-04-28 12:31:13,777 INFO L290 TraceCheckUtils]: 39: Hoare triple {3530#true} ~cond := #in~cond; {3530#true} is VALID [2022-04-28 12:31:13,777 INFO L272 TraceCheckUtils]: 38: Hoare triple {3693#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3530#true} is VALID [2022-04-28 12:31:13,780 INFO L290 TraceCheckUtils]: 37: Hoare triple {3693#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {3693#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:31:13,780 INFO L290 TraceCheckUtils]: 36: Hoare triple {3693#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {3693#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:31:13,781 INFO L290 TraceCheckUtils]: 35: Hoare triple {3693#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {3693#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:31:13,781 INFO L290 TraceCheckUtils]: 34: Hoare triple {3693#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {3693#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:31:13,781 INFO L290 TraceCheckUtils]: 33: Hoare triple {3693#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {3693#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:31:15,782 WARN L290 TraceCheckUtils]: 32: Hoare triple {3727#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {3693#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is UNKNOWN [2022-04-28 12:31:15,789 INFO L290 TraceCheckUtils]: 31: Hoare triple {3731#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} assume !(~c~0 >= ~b~0); {3727#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} is VALID [2022-04-28 12:31:15,790 INFO L290 TraceCheckUtils]: 30: Hoare triple {3731#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} assume !false; {3731#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} is VALID [2022-04-28 12:31:15,790 INFO L290 TraceCheckUtils]: 29: Hoare triple {3738#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 main_~a~0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {3731#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} is VALID [2022-04-28 12:31:15,790 INFO L290 TraceCheckUtils]: 28: Hoare triple {3738#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 main_~a~0))} assume !false; {3738#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 main_~a~0))} is VALID [2022-04-28 12:31:15,791 INFO L290 TraceCheckUtils]: 27: Hoare triple {3530#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {3738#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 main_~a~0))} is VALID [2022-04-28 12:31:15,791 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3530#true} {3530#true} #100#return; {3530#true} is VALID [2022-04-28 12:31:15,791 INFO L290 TraceCheckUtils]: 25: Hoare triple {3530#true} assume true; {3530#true} is VALID [2022-04-28 12:31:15,791 INFO L290 TraceCheckUtils]: 24: Hoare triple {3530#true} assume !(0 == ~cond); {3530#true} is VALID [2022-04-28 12:31:15,791 INFO L290 TraceCheckUtils]: 23: Hoare triple {3530#true} ~cond := #in~cond; {3530#true} is VALID [2022-04-28 12:31:15,791 INFO L272 TraceCheckUtils]: 22: Hoare triple {3530#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3530#true} is VALID [2022-04-28 12:31:15,791 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3530#true} {3530#true} #98#return; {3530#true} is VALID [2022-04-28 12:31:15,791 INFO L290 TraceCheckUtils]: 20: Hoare triple {3530#true} assume true; {3530#true} is VALID [2022-04-28 12:31:15,791 INFO L290 TraceCheckUtils]: 19: Hoare triple {3530#true} assume !(0 == ~cond); {3530#true} is VALID [2022-04-28 12:31:15,791 INFO L290 TraceCheckUtils]: 18: Hoare triple {3530#true} ~cond := #in~cond; {3530#true} is VALID [2022-04-28 12:31:15,791 INFO L272 TraceCheckUtils]: 17: Hoare triple {3530#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3530#true} is VALID [2022-04-28 12:31:15,791 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3530#true} {3530#true} #96#return; {3530#true} is VALID [2022-04-28 12:31:15,791 INFO L290 TraceCheckUtils]: 15: Hoare triple {3530#true} assume true; {3530#true} is VALID [2022-04-28 12:31:15,792 INFO L290 TraceCheckUtils]: 14: Hoare triple {3530#true} assume !(0 == ~cond); {3530#true} is VALID [2022-04-28 12:31:15,792 INFO L290 TraceCheckUtils]: 13: Hoare triple {3530#true} ~cond := #in~cond; {3530#true} is VALID [2022-04-28 12:31:15,792 INFO L272 TraceCheckUtils]: 12: Hoare triple {3530#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {3530#true} is VALID [2022-04-28 12:31:15,792 INFO L290 TraceCheckUtils]: 11: Hoare triple {3530#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3530#true} is VALID [2022-04-28 12:31:15,792 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3530#true} {3530#true} #94#return; {3530#true} is VALID [2022-04-28 12:31:15,792 INFO L290 TraceCheckUtils]: 9: Hoare triple {3530#true} assume true; {3530#true} is VALID [2022-04-28 12:31:15,792 INFO L290 TraceCheckUtils]: 8: Hoare triple {3530#true} assume !(0 == ~cond); {3530#true} is VALID [2022-04-28 12:31:15,792 INFO L290 TraceCheckUtils]: 7: Hoare triple {3530#true} ~cond := #in~cond; {3530#true} is VALID [2022-04-28 12:31:15,792 INFO L272 TraceCheckUtils]: 6: Hoare triple {3530#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {3530#true} is VALID [2022-04-28 12:31:15,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {3530#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {3530#true} is VALID [2022-04-28 12:31:15,792 INFO L272 TraceCheckUtils]: 4: Hoare triple {3530#true} call #t~ret6 := main(); {3530#true} is VALID [2022-04-28 12:31:15,792 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3530#true} {3530#true} #112#return; {3530#true} is VALID [2022-04-28 12:31:15,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {3530#true} assume true; {3530#true} is VALID [2022-04-28 12:31:15,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {3530#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(11, 2);call #Ultimate.allocInit(12, 3); {3530#true} is VALID [2022-04-28 12:31:15,792 INFO L272 TraceCheckUtils]: 0: Hoare triple {3530#true} call ULTIMATE.init(); {3530#true} is VALID [2022-04-28 12:31:15,793 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 12:31:15,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:31:15,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452389562] [2022-04-28 12:31:15,793 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:31:15,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379122939] [2022-04-28 12:31:15,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379122939] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:31:15,793 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:31:15,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 17 [2022-04-28 12:31:15,793 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:31:15,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1190295440] [2022-04-28 12:31:15,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1190295440] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:31:15,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:31:15,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 12:31:15,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431509563] [2022-04-28 12:31:15,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:31:15,794 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 9 states have internal predecessors, (27), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 47 [2022-04-28 12:31:15,794 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:31:15,794 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 9 states have internal predecessors, (27), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 12:31:15,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:31:15,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 12:31:15,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:31:15,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 12:31:15,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2022-04-28 12:31:15,839 INFO L87 Difference]: Start difference. First operand 123 states and 172 transitions. Second operand has 13 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 9 states have internal predecessors, (27), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 12:31:17,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:31:17,039 INFO L93 Difference]: Finished difference Result 137 states and 184 transitions. [2022-04-28 12:31:17,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 12:31:17,039 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 9 states have internal predecessors, (27), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 47 [2022-04-28 12:31:17,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:31:17,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 9 states have internal predecessors, (27), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 12:31:17,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 101 transitions. [2022-04-28 12:31:17,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 9 states have internal predecessors, (27), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 12:31:17,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 101 transitions. [2022-04-28 12:31:17,043 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 101 transitions. [2022-04-28 12:31:17,132 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:31:17,135 INFO L225 Difference]: With dead ends: 137 [2022-04-28 12:31:17,135 INFO L226 Difference]: Without dead ends: 135 [2022-04-28 12:31:17,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2022-04-28 12:31:17,135 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 50 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 12:31:17,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 259 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 12:31:17,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-04-28 12:31:17,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 131. [2022-04-28 12:31:17,381 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:31:17,382 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand has 131 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 83 states have internal predecessors, (102), 39 states have call successors, (39), 10 states have call predecessors, (39), 9 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 12:31:17,382 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand has 131 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 83 states have internal predecessors, (102), 39 states have call successors, (39), 10 states have call predecessors, (39), 9 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 12:31:17,382 INFO L87 Difference]: Start difference. First operand 135 states. Second operand has 131 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 83 states have internal predecessors, (102), 39 states have call successors, (39), 10 states have call predecessors, (39), 9 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 12:31:17,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:31:17,407 INFO L93 Difference]: Finished difference Result 135 states and 182 transitions. [2022-04-28 12:31:17,407 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 182 transitions. [2022-04-28 12:31:17,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:31:17,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:31:17,408 INFO L74 IsIncluded]: Start isIncluded. First operand has 131 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 83 states have internal predecessors, (102), 39 states have call successors, (39), 10 states have call predecessors, (39), 9 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand 135 states. [2022-04-28 12:31:17,408 INFO L87 Difference]: Start difference. First operand has 131 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 83 states have internal predecessors, (102), 39 states have call successors, (39), 10 states have call predecessors, (39), 9 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand 135 states. [2022-04-28 12:31:17,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:31:17,412 INFO L93 Difference]: Finished difference Result 135 states and 182 transitions. [2022-04-28 12:31:17,412 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 182 transitions. [2022-04-28 12:31:17,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:31:17,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:31:17,412 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:31:17,412 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:31:17,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 83 states have internal predecessors, (102), 39 states have call successors, (39), 10 states have call predecessors, (39), 9 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 12:31:17,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 178 transitions. [2022-04-28 12:31:17,416 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 178 transitions. Word has length 47 [2022-04-28 12:31:17,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:31:17,416 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 178 transitions. [2022-04-28 12:31:17,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 9 states have internal predecessors, (27), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 12:31:17,416 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 131 states and 178 transitions. [2022-04-28 12:31:17,607 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:31:17,607 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 178 transitions. [2022-04-28 12:31:17,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-28 12:31:17,608 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:31:17,608 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:31:17,624 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-28 12:31:17,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:31:17,819 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:31:17,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:31:17,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1836145722, now seen corresponding path program 3 times [2022-04-28 12:31:17,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:31:17,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1593518127] [2022-04-28 12:31:17,820 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:31:17,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1836145722, now seen corresponding path program 4 times [2022-04-28 12:31:17,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:31:17,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048672585] [2022-04-28 12:31:17,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:31:17,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:31:17,837 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:31:17,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [568596114] [2022-04-28 12:31:17,837 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 12:31:17,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:31:17,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:31:17,838 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:31:17,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 12:31:17,871 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 12:31:17,871 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:31:17,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 12:31:17,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:31:17,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:31:18,014 INFO L272 TraceCheckUtils]: 0: Hoare triple {4642#true} call ULTIMATE.init(); {4642#true} is VALID [2022-04-28 12:31:18,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {4642#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(11, 2);call #Ultimate.allocInit(12, 3); {4642#true} is VALID [2022-04-28 12:31:18,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {4642#true} assume true; {4642#true} is VALID [2022-04-28 12:31:18,014 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4642#true} {4642#true} #112#return; {4642#true} is VALID [2022-04-28 12:31:18,014 INFO L272 TraceCheckUtils]: 4: Hoare triple {4642#true} call #t~ret6 := main(); {4642#true} is VALID [2022-04-28 12:31:18,014 INFO L290 TraceCheckUtils]: 5: Hoare triple {4642#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {4642#true} is VALID [2022-04-28 12:31:18,015 INFO L272 TraceCheckUtils]: 6: Hoare triple {4642#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {4642#true} is VALID [2022-04-28 12:31:18,015 INFO L290 TraceCheckUtils]: 7: Hoare triple {4642#true} ~cond := #in~cond; {4642#true} is VALID [2022-04-28 12:31:18,015 INFO L290 TraceCheckUtils]: 8: Hoare triple {4642#true} assume !(0 == ~cond); {4642#true} is VALID [2022-04-28 12:31:18,015 INFO L290 TraceCheckUtils]: 9: Hoare triple {4642#true} assume true; {4642#true} is VALID [2022-04-28 12:31:18,015 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4642#true} {4642#true} #94#return; {4642#true} is VALID [2022-04-28 12:31:18,015 INFO L290 TraceCheckUtils]: 11: Hoare triple {4642#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4642#true} is VALID [2022-04-28 12:31:18,015 INFO L272 TraceCheckUtils]: 12: Hoare triple {4642#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {4642#true} is VALID [2022-04-28 12:31:18,015 INFO L290 TraceCheckUtils]: 13: Hoare triple {4642#true} ~cond := #in~cond; {4642#true} is VALID [2022-04-28 12:31:18,015 INFO L290 TraceCheckUtils]: 14: Hoare triple {4642#true} assume !(0 == ~cond); {4642#true} is VALID [2022-04-28 12:31:18,015 INFO L290 TraceCheckUtils]: 15: Hoare triple {4642#true} assume true; {4642#true} is VALID [2022-04-28 12:31:18,015 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4642#true} {4642#true} #96#return; {4642#true} is VALID [2022-04-28 12:31:18,015 INFO L272 TraceCheckUtils]: 17: Hoare triple {4642#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4642#true} is VALID [2022-04-28 12:31:18,015 INFO L290 TraceCheckUtils]: 18: Hoare triple {4642#true} ~cond := #in~cond; {4642#true} is VALID [2022-04-28 12:31:18,015 INFO L290 TraceCheckUtils]: 19: Hoare triple {4642#true} assume !(0 == ~cond); {4642#true} is VALID [2022-04-28 12:31:18,015 INFO L290 TraceCheckUtils]: 20: Hoare triple {4642#true} assume true; {4642#true} is VALID [2022-04-28 12:31:18,015 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4642#true} {4642#true} #98#return; {4642#true} is VALID [2022-04-28 12:31:18,016 INFO L272 TraceCheckUtils]: 22: Hoare triple {4642#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4642#true} is VALID [2022-04-28 12:31:18,016 INFO L290 TraceCheckUtils]: 23: Hoare triple {4642#true} ~cond := #in~cond; {4642#true} is VALID [2022-04-28 12:31:18,016 INFO L290 TraceCheckUtils]: 24: Hoare triple {4642#true} assume !(0 == ~cond); {4642#true} is VALID [2022-04-28 12:31:18,016 INFO L290 TraceCheckUtils]: 25: Hoare triple {4642#true} assume true; {4642#true} is VALID [2022-04-28 12:31:18,016 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4642#true} {4642#true} #100#return; {4642#true} is VALID [2022-04-28 12:31:18,016 INFO L290 TraceCheckUtils]: 27: Hoare triple {4642#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {4642#true} is VALID [2022-04-28 12:31:18,016 INFO L290 TraceCheckUtils]: 28: Hoare triple {4642#true} assume !false; {4642#true} is VALID [2022-04-28 12:31:18,016 INFO L290 TraceCheckUtils]: 29: Hoare triple {4642#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {4642#true} is VALID [2022-04-28 12:31:18,016 INFO L290 TraceCheckUtils]: 30: Hoare triple {4642#true} assume !false; {4642#true} is VALID [2022-04-28 12:31:18,017 INFO L290 TraceCheckUtils]: 31: Hoare triple {4642#true} assume !(~c~0 >= ~b~0); {4740#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-28 12:31:18,018 INFO L290 TraceCheckUtils]: 32: Hoare triple {4740#(not (<= main_~b~0 main_~c~0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {4744#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 12:31:18,018 INFO L290 TraceCheckUtils]: 33: Hoare triple {4744#(< main_~b~0 main_~a~0)} assume !false; {4744#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 12:31:18,018 INFO L290 TraceCheckUtils]: 34: Hoare triple {4744#(< main_~b~0 main_~a~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {4751#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 12:31:18,019 INFO L290 TraceCheckUtils]: 35: Hoare triple {4751#(< main_~b~0 main_~c~0)} assume !false; {4751#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 12:31:18,019 INFO L290 TraceCheckUtils]: 36: Hoare triple {4751#(< main_~b~0 main_~c~0)} assume !(~c~0 >= ~b~0); {4643#false} is VALID [2022-04-28 12:31:18,019 INFO L290 TraceCheckUtils]: 37: Hoare triple {4643#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {4643#false} is VALID [2022-04-28 12:31:18,019 INFO L290 TraceCheckUtils]: 38: Hoare triple {4643#false} assume !false; {4643#false} is VALID [2022-04-28 12:31:18,019 INFO L290 TraceCheckUtils]: 39: Hoare triple {4643#false} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {4643#false} is VALID [2022-04-28 12:31:18,019 INFO L290 TraceCheckUtils]: 40: Hoare triple {4643#false} assume !false; {4643#false} is VALID [2022-04-28 12:31:18,020 INFO L290 TraceCheckUtils]: 41: Hoare triple {4643#false} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {4643#false} is VALID [2022-04-28 12:31:18,020 INFO L290 TraceCheckUtils]: 42: Hoare triple {4643#false} assume !false; {4643#false} is VALID [2022-04-28 12:31:18,020 INFO L272 TraceCheckUtils]: 43: Hoare triple {4643#false} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4643#false} is VALID [2022-04-28 12:31:18,020 INFO L290 TraceCheckUtils]: 44: Hoare triple {4643#false} ~cond := #in~cond; {4643#false} is VALID [2022-04-28 12:31:18,020 INFO L290 TraceCheckUtils]: 45: Hoare triple {4643#false} assume 0 == ~cond; {4643#false} is VALID [2022-04-28 12:31:18,020 INFO L290 TraceCheckUtils]: 46: Hoare triple {4643#false} assume !false; {4643#false} is VALID [2022-04-28 12:31:18,020 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 12:31:18,020 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:31:18,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:31:18,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048672585] [2022-04-28 12:31:18,020 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:31:18,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568596114] [2022-04-28 12:31:18,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568596114] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:31:18,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:31:18,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:31:18,021 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:31:18,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1593518127] [2022-04-28 12:31:18,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1593518127] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:31:18,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:31:18,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:31:18,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290414794] [2022-04-28 12:31:18,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:31:18,021 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 47 [2022-04-28 12:31:18,021 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:31:18,021 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-28 12:31:18,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:31:18,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 12:31:18,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:31:18,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 12:31:18,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 12:31:18,044 INFO L87 Difference]: Start difference. First operand 131 states and 178 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-28 12:31:18,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:31:18,493 INFO L93 Difference]: Finished difference Result 170 states and 230 transitions. [2022-04-28 12:31:18,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 12:31:18,494 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 47 [2022-04-28 12:31:18,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:31:18,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-28 12:31:18,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2022-04-28 12:31:18,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-28 12:31:18,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2022-04-28 12:31:18,497 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 102 transitions. [2022-04-28 12:31:18,562 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:31:18,564 INFO L225 Difference]: With dead ends: 170 [2022-04-28 12:31:18,564 INFO L226 Difference]: Without dead ends: 114 [2022-04-28 12:31:18,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-28 12:31:18,565 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 18 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 12:31:18,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 155 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 12:31:18,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-04-28 12:31:18,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 106. [2022-04-28 12:31:18,771 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:31:18,771 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand has 106 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 66 states have internal predecessors, (77), 31 states have call successors, (31), 10 states have call predecessors, (31), 9 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 12:31:18,772 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand has 106 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 66 states have internal predecessors, (77), 31 states have call successors, (31), 10 states have call predecessors, (31), 9 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 12:31:18,772 INFO L87 Difference]: Start difference. First operand 114 states. Second operand has 106 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 66 states have internal predecessors, (77), 31 states have call successors, (31), 10 states have call predecessors, (31), 9 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 12:31:18,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:31:18,774 INFO L93 Difference]: Finished difference Result 114 states and 146 transitions. [2022-04-28 12:31:18,774 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 146 transitions. [2022-04-28 12:31:18,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:31:18,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:31:18,775 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 66 states have internal predecessors, (77), 31 states have call successors, (31), 10 states have call predecessors, (31), 9 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand 114 states. [2022-04-28 12:31:18,775 INFO L87 Difference]: Start difference. First operand has 106 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 66 states have internal predecessors, (77), 31 states have call successors, (31), 10 states have call predecessors, (31), 9 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand 114 states. [2022-04-28 12:31:18,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:31:18,778 INFO L93 Difference]: Finished difference Result 114 states and 146 transitions. [2022-04-28 12:31:18,778 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 146 transitions. [2022-04-28 12:31:18,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:31:18,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:31:18,778 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:31:18,778 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:31:18,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 66 states have internal predecessors, (77), 31 states have call successors, (31), 10 states have call predecessors, (31), 9 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 12:31:18,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 137 transitions. [2022-04-28 12:31:18,781 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 137 transitions. Word has length 47 [2022-04-28 12:31:18,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:31:18,781 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 137 transitions. [2022-04-28 12:31:18,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-28 12:31:18,781 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 106 states and 137 transitions. [2022-04-28 12:31:18,951 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:31:18,951 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 137 transitions. [2022-04-28 12:31:18,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-28 12:31:18,951 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:31:18,951 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:31:18,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 12:31:19,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:31:19,155 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:31:19,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:31:19,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1952108775, now seen corresponding path program 1 times [2022-04-28 12:31:19,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:31:19,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1941202480] [2022-04-28 12:31:19,156 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:31:19,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1952108775, now seen corresponding path program 2 times [2022-04-28 12:31:19,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:31:19,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042841713] [2022-04-28 12:31:19,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:31:19,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:31:19,176 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:31:19,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1832063389] [2022-04-28 12:31:19,177 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:31:19,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:31:19,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:31:19,186 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-28 12:31:19,187 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-28 12:31:19,220 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:31:19,220 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:31:19,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 12:31:19,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:31:19,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:31:19,333 INFO L272 TraceCheckUtils]: 0: Hoare triple {5572#true} call ULTIMATE.init(); {5572#true} is VALID [2022-04-28 12:31:19,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {5572#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(11, 2);call #Ultimate.allocInit(12, 3); {5572#true} is VALID [2022-04-28 12:31:19,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {5572#true} assume true; {5572#true} is VALID [2022-04-28 12:31:19,334 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5572#true} {5572#true} #112#return; {5572#true} is VALID [2022-04-28 12:31:19,334 INFO L272 TraceCheckUtils]: 4: Hoare triple {5572#true} call #t~ret6 := main(); {5572#true} is VALID [2022-04-28 12:31:19,334 INFO L290 TraceCheckUtils]: 5: Hoare triple {5572#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {5572#true} is VALID [2022-04-28 12:31:19,334 INFO L272 TraceCheckUtils]: 6: Hoare triple {5572#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {5572#true} is VALID [2022-04-28 12:31:19,334 INFO L290 TraceCheckUtils]: 7: Hoare triple {5572#true} ~cond := #in~cond; {5572#true} is VALID [2022-04-28 12:31:19,334 INFO L290 TraceCheckUtils]: 8: Hoare triple {5572#true} assume !(0 == ~cond); {5572#true} is VALID [2022-04-28 12:31:19,334 INFO L290 TraceCheckUtils]: 9: Hoare triple {5572#true} assume true; {5572#true} is VALID [2022-04-28 12:31:19,334 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5572#true} {5572#true} #94#return; {5572#true} is VALID [2022-04-28 12:31:19,334 INFO L290 TraceCheckUtils]: 11: Hoare triple {5572#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {5572#true} is VALID [2022-04-28 12:31:19,334 INFO L272 TraceCheckUtils]: 12: Hoare triple {5572#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {5572#true} is VALID [2022-04-28 12:31:19,334 INFO L290 TraceCheckUtils]: 13: Hoare triple {5572#true} ~cond := #in~cond; {5572#true} is VALID [2022-04-28 12:31:19,334 INFO L290 TraceCheckUtils]: 14: Hoare triple {5572#true} assume !(0 == ~cond); {5572#true} is VALID [2022-04-28 12:31:19,334 INFO L290 TraceCheckUtils]: 15: Hoare triple {5572#true} assume true; {5572#true} is VALID [2022-04-28 12:31:19,334 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5572#true} {5572#true} #96#return; {5572#true} is VALID [2022-04-28 12:31:19,334 INFO L272 TraceCheckUtils]: 17: Hoare triple {5572#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {5572#true} is VALID [2022-04-28 12:31:19,335 INFO L290 TraceCheckUtils]: 18: Hoare triple {5572#true} ~cond := #in~cond; {5572#true} is VALID [2022-04-28 12:31:19,336 INFO L290 TraceCheckUtils]: 19: Hoare triple {5572#true} assume !(0 == ~cond); {5572#true} is VALID [2022-04-28 12:31:19,336 INFO L290 TraceCheckUtils]: 20: Hoare triple {5572#true} assume true; {5572#true} is VALID [2022-04-28 12:31:19,337 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5572#true} {5572#true} #98#return; {5572#true} is VALID [2022-04-28 12:31:19,337 INFO L272 TraceCheckUtils]: 22: Hoare triple {5572#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {5572#true} is VALID [2022-04-28 12:31:19,337 INFO L290 TraceCheckUtils]: 23: Hoare triple {5572#true} ~cond := #in~cond; {5572#true} is VALID [2022-04-28 12:31:19,337 INFO L290 TraceCheckUtils]: 24: Hoare triple {5572#true} assume !(0 == ~cond); {5572#true} is VALID [2022-04-28 12:31:19,337 INFO L290 TraceCheckUtils]: 25: Hoare triple {5572#true} assume true; {5572#true} is VALID [2022-04-28 12:31:19,337 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5572#true} {5572#true} #100#return; {5572#true} is VALID [2022-04-28 12:31:19,337 INFO L290 TraceCheckUtils]: 27: Hoare triple {5572#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {5572#true} is VALID [2022-04-28 12:31:19,340 INFO L290 TraceCheckUtils]: 28: Hoare triple {5572#true} assume !false; {5572#true} is VALID [2022-04-28 12:31:19,340 INFO L290 TraceCheckUtils]: 29: Hoare triple {5572#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {5572#true} is VALID [2022-04-28 12:31:19,340 INFO L290 TraceCheckUtils]: 30: Hoare triple {5572#true} assume !false; {5572#true} is VALID [2022-04-28 12:31:19,340 INFO L290 TraceCheckUtils]: 31: Hoare triple {5572#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {5670#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-28 12:31:19,341 INFO L290 TraceCheckUtils]: 32: Hoare triple {5670#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} assume !false; {5670#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-28 12:31:19,341 INFO L272 TraceCheckUtils]: 33: Hoare triple {5670#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {5572#true} is VALID [2022-04-28 12:31:19,341 INFO L290 TraceCheckUtils]: 34: Hoare triple {5572#true} ~cond := #in~cond; {5572#true} is VALID [2022-04-28 12:31:19,341 INFO L290 TraceCheckUtils]: 35: Hoare triple {5572#true} assume !(0 == ~cond); {5572#true} is VALID [2022-04-28 12:31:19,341 INFO L290 TraceCheckUtils]: 36: Hoare triple {5572#true} assume true; {5572#true} is VALID [2022-04-28 12:31:19,341 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5572#true} {5670#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} #102#return; {5670#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-28 12:31:19,342 INFO L272 TraceCheckUtils]: 38: Hoare triple {5670#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {5572#true} is VALID [2022-04-28 12:31:19,342 INFO L290 TraceCheckUtils]: 39: Hoare triple {5572#true} ~cond := #in~cond; {5572#true} is VALID [2022-04-28 12:31:19,342 INFO L290 TraceCheckUtils]: 40: Hoare triple {5572#true} assume !(0 == ~cond); {5572#true} is VALID [2022-04-28 12:31:19,342 INFO L290 TraceCheckUtils]: 41: Hoare triple {5572#true} assume true; {5572#true} is VALID [2022-04-28 12:31:19,342 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {5572#true} {5670#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} #104#return; {5670#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-28 12:31:19,342 INFO L272 TraceCheckUtils]: 43: Hoare triple {5670#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {5572#true} is VALID [2022-04-28 12:31:19,342 INFO L290 TraceCheckUtils]: 44: Hoare triple {5572#true} ~cond := #in~cond; {5572#true} is VALID [2022-04-28 12:31:19,342 INFO L290 TraceCheckUtils]: 45: Hoare triple {5572#true} assume !(0 == ~cond); {5572#true} is VALID [2022-04-28 12:31:19,342 INFO L290 TraceCheckUtils]: 46: Hoare triple {5572#true} assume true; {5572#true} is VALID [2022-04-28 12:31:19,343 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {5572#true} {5670#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} #106#return; {5670#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-28 12:31:19,343 INFO L272 TraceCheckUtils]: 48: Hoare triple {5670#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {5722#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:31:19,344 INFO L290 TraceCheckUtils]: 49: Hoare triple {5722#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5726#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:31:19,344 INFO L290 TraceCheckUtils]: 50: Hoare triple {5726#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5573#false} is VALID [2022-04-28 12:31:19,344 INFO L290 TraceCheckUtils]: 51: Hoare triple {5573#false} assume !false; {5573#false} is VALID [2022-04-28 12:31:19,344 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 12:31:19,344 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:31:19,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:31:19,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042841713] [2022-04-28 12:31:19,344 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:31:19,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832063389] [2022-04-28 12:31:19,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832063389] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:31:19,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:31:19,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:31:19,345 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:31:19,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1941202480] [2022-04-28 12:31:19,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1941202480] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:31:19,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:31:19,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:31:19,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836990198] [2022-04-28 12:31:19,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:31:19,346 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 52 [2022-04-28 12:31:19,347 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:31:19,347 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 12:31:19,367 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:31:19,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 12:31:19,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:31:19,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 12:31:19,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 12:31:19,368 INFO L87 Difference]: Start difference. First operand 106 states and 137 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 12:31:19,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:31:19,848 INFO L93 Difference]: Finished difference Result 158 states and 221 transitions. [2022-04-28 12:31:19,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 12:31:19,848 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 52 [2022-04-28 12:31:19,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:31:19,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 12:31:19,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-28 12:31:19,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 12:31:19,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-28 12:31:19,850 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-28 12:31:19,890 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-28 12:31:19,893 INFO L225 Difference]: With dead ends: 158 [2022-04-28 12:31:19,893 INFO L226 Difference]: Without dead ends: 156 [2022-04-28 12:31:19,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 12:31:19,893 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 9 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:31:19,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 156 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:31:19,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-04-28 12:31:20,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 140. [2022-04-28 12:31:20,185 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:31:20,185 INFO L82 GeneralOperation]: Start isEquivalent. First operand 156 states. Second operand has 140 states, 74 states have (on average 1.162162162162162) internal successors, (86), 81 states have internal predecessors, (86), 55 states have call successors, (55), 11 states have call predecessors, (55), 10 states have return successors, (53), 47 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-28 12:31:20,185 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand has 140 states, 74 states have (on average 1.162162162162162) internal successors, (86), 81 states have internal predecessors, (86), 55 states have call successors, (55), 11 states have call predecessors, (55), 10 states have return successors, (53), 47 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-28 12:31:20,186 INFO L87 Difference]: Start difference. First operand 156 states. Second operand has 140 states, 74 states have (on average 1.162162162162162) internal successors, (86), 81 states have internal predecessors, (86), 55 states have call successors, (55), 11 states have call predecessors, (55), 10 states have return successors, (53), 47 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-28 12:31:20,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:31:20,190 INFO L93 Difference]: Finished difference Result 156 states and 219 transitions. [2022-04-28 12:31:20,190 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 219 transitions. [2022-04-28 12:31:20,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:31:20,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:31:20,190 INFO L74 IsIncluded]: Start isIncluded. First operand has 140 states, 74 states have (on average 1.162162162162162) internal successors, (86), 81 states have internal predecessors, (86), 55 states have call successors, (55), 11 states have call predecessors, (55), 10 states have return successors, (53), 47 states have call predecessors, (53), 53 states have call successors, (53) Second operand 156 states. [2022-04-28 12:31:20,191 INFO L87 Difference]: Start difference. First operand has 140 states, 74 states have (on average 1.162162162162162) internal successors, (86), 81 states have internal predecessors, (86), 55 states have call successors, (55), 11 states have call predecessors, (55), 10 states have return successors, (53), 47 states have call predecessors, (53), 53 states have call successors, (53) Second operand 156 states. [2022-04-28 12:31:20,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:31:20,203 INFO L93 Difference]: Finished difference Result 156 states and 219 transitions. [2022-04-28 12:31:20,203 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 219 transitions. [2022-04-28 12:31:20,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:31:20,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:31:20,205 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:31:20,205 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:31:20,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 74 states have (on average 1.162162162162162) internal successors, (86), 81 states have internal predecessors, (86), 55 states have call successors, (55), 11 states have call predecessors, (55), 10 states have return successors, (53), 47 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-28 12:31:20,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 194 transitions. [2022-04-28 12:31:20,212 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 194 transitions. Word has length 52 [2022-04-28 12:31:20,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:31:20,212 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 194 transitions. [2022-04-28 12:31:20,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 12:31:20,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 140 states and 194 transitions. [2022-04-28 12:31:20,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:31:20,483 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 194 transitions. [2022-04-28 12:31:20,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-28 12:31:20,484 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:31:20,484 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:31:20,500 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-28 12:31:20,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:31:20,693 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:31:20,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:31:20,693 INFO L85 PathProgramCache]: Analyzing trace with hash 188363668, now seen corresponding path program 1 times [2022-04-28 12:31:20,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:31:20,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1948951083] [2022-04-28 12:31:20,693 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:31:20,693 INFO L85 PathProgramCache]: Analyzing trace with hash 188363668, now seen corresponding path program 2 times [2022-04-28 12:31:20,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:31:20,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956085132] [2022-04-28 12:31:20,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:31:20,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:31:20,705 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:31:20,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [462000692] [2022-04-28 12:31:20,705 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:31:20,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:31:20,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:31:20,706 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-28 12:31:20,707 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-28 12:31:20,746 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:31:20,746 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:31:20,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 57 conjunts are in the unsatisfiable core [2022-04-28 12:31:20,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:31:20,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:31:21,402 INFO L272 TraceCheckUtils]: 0: Hoare triple {6642#true} call ULTIMATE.init(); {6642#true} is VALID [2022-04-28 12:31:21,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {6642#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(11, 2);call #Ultimate.allocInit(12, 3); {6642#true} is VALID [2022-04-28 12:31:21,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {6642#true} assume true; {6642#true} is VALID [2022-04-28 12:31:21,402 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6642#true} {6642#true} #112#return; {6642#true} is VALID [2022-04-28 12:31:21,402 INFO L272 TraceCheckUtils]: 4: Hoare triple {6642#true} call #t~ret6 := main(); {6642#true} is VALID [2022-04-28 12:31:21,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {6642#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {6642#true} is VALID [2022-04-28 12:31:21,402 INFO L272 TraceCheckUtils]: 6: Hoare triple {6642#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {6642#true} is VALID [2022-04-28 12:31:21,402 INFO L290 TraceCheckUtils]: 7: Hoare triple {6642#true} ~cond := #in~cond; {6642#true} is VALID [2022-04-28 12:31:21,402 INFO L290 TraceCheckUtils]: 8: Hoare triple {6642#true} assume !(0 == ~cond); {6642#true} is VALID [2022-04-28 12:31:21,402 INFO L290 TraceCheckUtils]: 9: Hoare triple {6642#true} assume true; {6642#true} is VALID [2022-04-28 12:31:21,402 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6642#true} {6642#true} #94#return; {6642#true} is VALID [2022-04-28 12:31:21,402 INFO L290 TraceCheckUtils]: 11: Hoare triple {6642#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {6642#true} is VALID [2022-04-28 12:31:21,402 INFO L272 TraceCheckUtils]: 12: Hoare triple {6642#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {6642#true} is VALID [2022-04-28 12:31:21,403 INFO L290 TraceCheckUtils]: 13: Hoare triple {6642#true} ~cond := #in~cond; {6642#true} is VALID [2022-04-28 12:31:21,403 INFO L290 TraceCheckUtils]: 14: Hoare triple {6642#true} assume !(0 == ~cond); {6642#true} is VALID [2022-04-28 12:31:21,403 INFO L290 TraceCheckUtils]: 15: Hoare triple {6642#true} assume true; {6642#true} is VALID [2022-04-28 12:31:21,403 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6642#true} {6642#true} #96#return; {6642#true} is VALID [2022-04-28 12:31:21,403 INFO L272 TraceCheckUtils]: 17: Hoare triple {6642#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {6642#true} is VALID [2022-04-28 12:31:21,403 INFO L290 TraceCheckUtils]: 18: Hoare triple {6642#true} ~cond := #in~cond; {6642#true} is VALID [2022-04-28 12:31:21,403 INFO L290 TraceCheckUtils]: 19: Hoare triple {6642#true} assume !(0 == ~cond); {6642#true} is VALID [2022-04-28 12:31:21,403 INFO L290 TraceCheckUtils]: 20: Hoare triple {6642#true} assume true; {6642#true} is VALID [2022-04-28 12:31:21,403 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6642#true} {6642#true} #98#return; {6642#true} is VALID [2022-04-28 12:31:21,403 INFO L272 TraceCheckUtils]: 22: Hoare triple {6642#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6642#true} is VALID [2022-04-28 12:31:21,403 INFO L290 TraceCheckUtils]: 23: Hoare triple {6642#true} ~cond := #in~cond; {6642#true} is VALID [2022-04-28 12:31:21,403 INFO L290 TraceCheckUtils]: 24: Hoare triple {6642#true} assume !(0 == ~cond); {6642#true} is VALID [2022-04-28 12:31:21,403 INFO L290 TraceCheckUtils]: 25: Hoare triple {6642#true} assume true; {6642#true} is VALID [2022-04-28 12:31:21,403 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6642#true} {6642#true} #100#return; {6642#true} is VALID [2022-04-28 12:31:21,404 INFO L290 TraceCheckUtils]: 27: Hoare triple {6642#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {6728#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:31:21,405 INFO L290 TraceCheckUtils]: 28: Hoare triple {6728#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {6728#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:31:21,405 INFO L290 TraceCheckUtils]: 29: Hoare triple {6728#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {6735#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:31:21,405 INFO L290 TraceCheckUtils]: 30: Hoare triple {6735#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {6735#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:31:21,406 INFO L290 TraceCheckUtils]: 31: Hoare triple {6735#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {6742#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:31:21,406 INFO L290 TraceCheckUtils]: 32: Hoare triple {6742#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {6742#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:31:21,406 INFO L272 TraceCheckUtils]: 33: Hoare triple {6742#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {6642#true} is VALID [2022-04-28 12:31:21,407 INFO L290 TraceCheckUtils]: 34: Hoare triple {6642#true} ~cond := #in~cond; {6752#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:31:21,407 INFO L290 TraceCheckUtils]: 35: Hoare triple {6752#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6756#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:31:21,407 INFO L290 TraceCheckUtils]: 36: Hoare triple {6756#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6756#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:31:21,408 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {6756#(not (= |__VERIFIER_assert_#in~cond| 0))} {6742#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #102#return; {6763#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:31:21,408 INFO L272 TraceCheckUtils]: 38: Hoare triple {6763#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {6642#true} is VALID [2022-04-28 12:31:21,408 INFO L290 TraceCheckUtils]: 39: Hoare triple {6642#true} ~cond := #in~cond; {6752#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:31:21,409 INFO L290 TraceCheckUtils]: 40: Hoare triple {6752#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6756#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:31:21,409 INFO L290 TraceCheckUtils]: 41: Hoare triple {6756#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6756#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:31:21,409 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {6756#(not (= |__VERIFIER_assert_#in~cond| 0))} {6763#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #104#return; {6763#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:31:21,410 INFO L272 TraceCheckUtils]: 43: Hoare triple {6763#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {6642#true} is VALID [2022-04-28 12:31:21,410 INFO L290 TraceCheckUtils]: 44: Hoare triple {6642#true} ~cond := #in~cond; {6642#true} is VALID [2022-04-28 12:31:21,410 INFO L290 TraceCheckUtils]: 45: Hoare triple {6642#true} assume !(0 == ~cond); {6642#true} is VALID [2022-04-28 12:31:21,410 INFO L290 TraceCheckUtils]: 46: Hoare triple {6642#true} assume true; {6642#true} is VALID [2022-04-28 12:31:21,410 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6642#true} {6763#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #106#return; {6763#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:31:21,410 INFO L272 TraceCheckUtils]: 48: Hoare triple {6763#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {6642#true} is VALID [2022-04-28 12:31:21,411 INFO L290 TraceCheckUtils]: 49: Hoare triple {6642#true} ~cond := #in~cond; {6642#true} is VALID [2022-04-28 12:31:21,411 INFO L290 TraceCheckUtils]: 50: Hoare triple {6642#true} assume !(0 == ~cond); {6642#true} is VALID [2022-04-28 12:31:21,411 INFO L290 TraceCheckUtils]: 51: Hoare triple {6642#true} assume true; {6642#true} is VALID [2022-04-28 12:31:21,411 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6642#true} {6763#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #108#return; {6763#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:31:21,412 INFO L290 TraceCheckUtils]: 53: Hoare triple {6763#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= 2 * ~v~0); {6763#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:31:21,412 INFO L290 TraceCheckUtils]: 54: Hoare triple {6763#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {6815#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 12:31:21,413 INFO L290 TraceCheckUtils]: 55: Hoare triple {6815#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !false; {6815#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 12:31:21,413 INFO L290 TraceCheckUtils]: 56: Hoare triple {6815#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {6815#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 12:31:21,414 INFO L290 TraceCheckUtils]: 57: Hoare triple {6815#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {6825#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (+ main_~s~0 1) 0))} is VALID [2022-04-28 12:31:21,414 INFO L290 TraceCheckUtils]: 58: Hoare triple {6825#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (+ main_~s~0 1) 0))} assume !false; {6825#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (+ main_~s~0 1) 0))} is VALID [2022-04-28 12:31:21,414 INFO L290 TraceCheckUtils]: 59: Hoare triple {6825#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (+ main_~s~0 1) 0))} assume !(0 != ~b~0); {6832#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ main_~s~0 1) 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0))} is VALID [2022-04-28 12:31:21,415 INFO L272 TraceCheckUtils]: 60: Hoare triple {6832#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ main_~s~0 1) 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {6836#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:31:21,415 INFO L290 TraceCheckUtils]: 61: Hoare triple {6836#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6840#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:31:21,416 INFO L290 TraceCheckUtils]: 62: Hoare triple {6840#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6643#false} is VALID [2022-04-28 12:31:21,416 INFO L290 TraceCheckUtils]: 63: Hoare triple {6643#false} assume !false; {6643#false} is VALID [2022-04-28 12:31:21,416 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 12:31:21,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:32:04,494 INFO L290 TraceCheckUtils]: 63: Hoare triple {6643#false} assume !false; {6643#false} is VALID [2022-04-28 12:32:04,494 INFO L290 TraceCheckUtils]: 62: Hoare triple {6840#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6643#false} is VALID [2022-04-28 12:32:04,495 INFO L290 TraceCheckUtils]: 61: Hoare triple {6836#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6840#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:32:04,495 INFO L272 TraceCheckUtils]: 60: Hoare triple {6856#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {6836#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:32:04,496 INFO L290 TraceCheckUtils]: 59: Hoare triple {6860#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} assume !(0 != ~b~0); {6856#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:32:04,496 INFO L290 TraceCheckUtils]: 58: Hoare triple {6860#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} assume !false; {6860#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-28 12:32:04,612 INFO L290 TraceCheckUtils]: 57: Hoare triple {6867#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {6860#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-28 12:32:04,613 INFO L290 TraceCheckUtils]: 56: Hoare triple {6867#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= ~b~0); {6867#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:32:04,613 INFO L290 TraceCheckUtils]: 55: Hoare triple {6867#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !false; {6867#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:32:04,662 INFO L290 TraceCheckUtils]: 54: Hoare triple {6877#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {6867#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:32:04,662 INFO L290 TraceCheckUtils]: 53: Hoare triple {6877#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= 2 * ~v~0); {6877#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:32:04,663 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6642#true} {6877#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #108#return; {6877#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:32:04,663 INFO L290 TraceCheckUtils]: 51: Hoare triple {6642#true} assume true; {6642#true} is VALID [2022-04-28 12:32:04,663 INFO L290 TraceCheckUtils]: 50: Hoare triple {6642#true} assume !(0 == ~cond); {6642#true} is VALID [2022-04-28 12:32:04,663 INFO L290 TraceCheckUtils]: 49: Hoare triple {6642#true} ~cond := #in~cond; {6642#true} is VALID [2022-04-28 12:32:04,663 INFO L272 TraceCheckUtils]: 48: Hoare triple {6877#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {6642#true} is VALID [2022-04-28 12:32:04,664 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6642#true} {6877#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #106#return; {6877#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:32:04,664 INFO L290 TraceCheckUtils]: 46: Hoare triple {6642#true} assume true; {6642#true} is VALID [2022-04-28 12:32:04,664 INFO L290 TraceCheckUtils]: 45: Hoare triple {6642#true} assume !(0 == ~cond); {6642#true} is VALID [2022-04-28 12:32:04,664 INFO L290 TraceCheckUtils]: 44: Hoare triple {6642#true} ~cond := #in~cond; {6642#true} is VALID [2022-04-28 12:32:04,664 INFO L272 TraceCheckUtils]: 43: Hoare triple {6877#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {6642#true} is VALID [2022-04-28 12:32:04,665 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {6756#(not (= |__VERIFIER_assert_#in~cond| 0))} {6914#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #104#return; {6877#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:32:04,665 INFO L290 TraceCheckUtils]: 41: Hoare triple {6756#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6756#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:32:04,666 INFO L290 TraceCheckUtils]: 40: Hoare triple {6924#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {6756#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:32:04,666 INFO L290 TraceCheckUtils]: 39: Hoare triple {6642#true} ~cond := #in~cond; {6924#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 12:32:04,666 INFO L272 TraceCheckUtils]: 38: Hoare triple {6914#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {6642#true} is VALID [2022-04-28 12:32:04,667 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {6756#(not (= |__VERIFIER_assert_#in~cond| 0))} {6931#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #102#return; {6914#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:32:04,667 INFO L290 TraceCheckUtils]: 36: Hoare triple {6756#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6756#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:32:04,668 INFO L290 TraceCheckUtils]: 35: Hoare triple {6924#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {6756#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:32:04,668 INFO L290 TraceCheckUtils]: 34: Hoare triple {6642#true} ~cond := #in~cond; {6924#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 12:32:04,668 INFO L272 TraceCheckUtils]: 33: Hoare triple {6931#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {6642#true} is VALID [2022-04-28 12:32:04,668 INFO L290 TraceCheckUtils]: 32: Hoare triple {6931#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !false; {6931#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:32:04,669 INFO L290 TraceCheckUtils]: 31: Hoare triple {6950#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~c~0 main_~b~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {6931#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:32:04,670 INFO L290 TraceCheckUtils]: 30: Hoare triple {6950#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~c~0 main_~b~0)))} assume !false; {6950#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~c~0 main_~b~0)))} is VALID [2022-04-28 12:32:04,671 INFO L290 TraceCheckUtils]: 29: Hoare triple {6642#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {6950#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~c~0 main_~b~0)))} is VALID [2022-04-28 12:32:04,671 INFO L290 TraceCheckUtils]: 28: Hoare triple {6642#true} assume !false; {6642#true} is VALID [2022-04-28 12:32:04,671 INFO L290 TraceCheckUtils]: 27: Hoare triple {6642#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {6642#true} is VALID [2022-04-28 12:32:04,671 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6642#true} {6642#true} #100#return; {6642#true} is VALID [2022-04-28 12:32:04,671 INFO L290 TraceCheckUtils]: 25: Hoare triple {6642#true} assume true; {6642#true} is VALID [2022-04-28 12:32:04,671 INFO L290 TraceCheckUtils]: 24: Hoare triple {6642#true} assume !(0 == ~cond); {6642#true} is VALID [2022-04-28 12:32:04,671 INFO L290 TraceCheckUtils]: 23: Hoare triple {6642#true} ~cond := #in~cond; {6642#true} is VALID [2022-04-28 12:32:04,671 INFO L272 TraceCheckUtils]: 22: Hoare triple {6642#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6642#true} is VALID [2022-04-28 12:32:04,671 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6642#true} {6642#true} #98#return; {6642#true} is VALID [2022-04-28 12:32:04,671 INFO L290 TraceCheckUtils]: 20: Hoare triple {6642#true} assume true; {6642#true} is VALID [2022-04-28 12:32:04,671 INFO L290 TraceCheckUtils]: 19: Hoare triple {6642#true} assume !(0 == ~cond); {6642#true} is VALID [2022-04-28 12:32:04,671 INFO L290 TraceCheckUtils]: 18: Hoare triple {6642#true} ~cond := #in~cond; {6642#true} is VALID [2022-04-28 12:32:04,671 INFO L272 TraceCheckUtils]: 17: Hoare triple {6642#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {6642#true} is VALID [2022-04-28 12:32:04,671 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6642#true} {6642#true} #96#return; {6642#true} is VALID [2022-04-28 12:32:04,671 INFO L290 TraceCheckUtils]: 15: Hoare triple {6642#true} assume true; {6642#true} is VALID [2022-04-28 12:32:04,672 INFO L290 TraceCheckUtils]: 14: Hoare triple {6642#true} assume !(0 == ~cond); {6642#true} is VALID [2022-04-28 12:32:04,672 INFO L290 TraceCheckUtils]: 13: Hoare triple {6642#true} ~cond := #in~cond; {6642#true} is VALID [2022-04-28 12:32:04,672 INFO L272 TraceCheckUtils]: 12: Hoare triple {6642#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {6642#true} is VALID [2022-04-28 12:32:04,672 INFO L290 TraceCheckUtils]: 11: Hoare triple {6642#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {6642#true} is VALID [2022-04-28 12:32:04,672 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6642#true} {6642#true} #94#return; {6642#true} is VALID [2022-04-28 12:32:04,672 INFO L290 TraceCheckUtils]: 9: Hoare triple {6642#true} assume true; {6642#true} is VALID [2022-04-28 12:32:04,672 INFO L290 TraceCheckUtils]: 8: Hoare triple {6642#true} assume !(0 == ~cond); {6642#true} is VALID [2022-04-28 12:32:04,672 INFO L290 TraceCheckUtils]: 7: Hoare triple {6642#true} ~cond := #in~cond; {6642#true} is VALID [2022-04-28 12:32:04,672 INFO L272 TraceCheckUtils]: 6: Hoare triple {6642#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {6642#true} is VALID [2022-04-28 12:32:04,672 INFO L290 TraceCheckUtils]: 5: Hoare triple {6642#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {6642#true} is VALID [2022-04-28 12:32:04,672 INFO L272 TraceCheckUtils]: 4: Hoare triple {6642#true} call #t~ret6 := main(); {6642#true} is VALID [2022-04-28 12:32:04,672 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6642#true} {6642#true} #112#return; {6642#true} is VALID [2022-04-28 12:32:04,672 INFO L290 TraceCheckUtils]: 2: Hoare triple {6642#true} assume true; {6642#true} is VALID [2022-04-28 12:32:04,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {6642#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(11, 2);call #Ultimate.allocInit(12, 3); {6642#true} is VALID [2022-04-28 12:32:04,672 INFO L272 TraceCheckUtils]: 0: Hoare triple {6642#true} call ULTIMATE.init(); {6642#true} is VALID [2022-04-28 12:32:04,673 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 12:32:04,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:32:04,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956085132] [2022-04-28 12:32:04,673 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:32:04,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462000692] [2022-04-28 12:32:04,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462000692] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:32:04,673 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:32:04,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2022-04-28 12:32:04,673 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:32:04,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1948951083] [2022-04-28 12:32:04,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1948951083] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:32:04,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:32:04,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 12:32:04,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045450712] [2022-04-28 12:32:04,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:32:04,674 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 64 [2022-04-28 12:32:04,674 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:32:04,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 12:32:04,709 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-28 12:32:04,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 12:32:04,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:32:04,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 12:32:04,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2022-04-28 12:32:04,710 INFO L87 Difference]: Start difference. First operand 140 states and 194 transitions. Second operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 12:32:06,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:32:06,745 INFO L93 Difference]: Finished difference Result 200 states and 283 transitions. [2022-04-28 12:32:06,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 12:32:06,745 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 64 [2022-04-28 12:32:06,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:32:06,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 12:32:06,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 131 transitions. [2022-04-28 12:32:06,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 12:32:06,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 131 transitions. [2022-04-28 12:32:06,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 131 transitions. [2022-04-28 12:32:06,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:32:06,872 INFO L225 Difference]: With dead ends: 200 [2022-04-28 12:32:06,872 INFO L226 Difference]: Without dead ends: 197 [2022-04-28 12:32:06,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2022-04-28 12:32:06,873 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 48 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 12:32:06,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 306 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 12:32:06,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-04-28 12:32:07,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 193. [2022-04-28 12:32:07,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:32:07,320 INFO L82 GeneralOperation]: Start isEquivalent. First operand 197 states. Second operand has 193 states, 101 states have (on average 1.1782178217821782) internal successors, (119), 110 states have internal predecessors, (119), 79 states have call successors, (79), 13 states have call predecessors, (79), 12 states have return successors, (77), 69 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-28 12:32:07,321 INFO L74 IsIncluded]: Start isIncluded. First operand 197 states. Second operand has 193 states, 101 states have (on average 1.1782178217821782) internal successors, (119), 110 states have internal predecessors, (119), 79 states have call successors, (79), 13 states have call predecessors, (79), 12 states have return successors, (77), 69 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-28 12:32:07,321 INFO L87 Difference]: Start difference. First operand 197 states. Second operand has 193 states, 101 states have (on average 1.1782178217821782) internal successors, (119), 110 states have internal predecessors, (119), 79 states have call successors, (79), 13 states have call predecessors, (79), 12 states have return successors, (77), 69 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-28 12:32:07,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:32:07,327 INFO L93 Difference]: Finished difference Result 197 states and 279 transitions. [2022-04-28 12:32:07,327 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 279 transitions. [2022-04-28 12:32:07,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:32:07,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:32:07,328 INFO L74 IsIncluded]: Start isIncluded. First operand has 193 states, 101 states have (on average 1.1782178217821782) internal successors, (119), 110 states have internal predecessors, (119), 79 states have call successors, (79), 13 states have call predecessors, (79), 12 states have return successors, (77), 69 states have call predecessors, (77), 77 states have call successors, (77) Second operand 197 states. [2022-04-28 12:32:07,328 INFO L87 Difference]: Start difference. First operand has 193 states, 101 states have (on average 1.1782178217821782) internal successors, (119), 110 states have internal predecessors, (119), 79 states have call successors, (79), 13 states have call predecessors, (79), 12 states have return successors, (77), 69 states have call predecessors, (77), 77 states have call successors, (77) Second operand 197 states. [2022-04-28 12:32:07,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:32:07,334 INFO L93 Difference]: Finished difference Result 197 states and 279 transitions. [2022-04-28 12:32:07,334 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 279 transitions. [2022-04-28 12:32:07,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:32:07,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:32:07,334 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:32:07,334 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:32:07,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 101 states have (on average 1.1782178217821782) internal successors, (119), 110 states have internal predecessors, (119), 79 states have call successors, (79), 13 states have call predecessors, (79), 12 states have return successors, (77), 69 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-28 12:32:07,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 275 transitions. [2022-04-28 12:32:07,341 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 275 transitions. Word has length 64 [2022-04-28 12:32:07,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:32:07,341 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 275 transitions. [2022-04-28 12:32:07,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 12:32:07,341 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 193 states and 275 transitions. [2022-04-28 12:32:07,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 275 edges. 275 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:32:07,747 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 275 transitions. [2022-04-28 12:32:07,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-28 12:32:07,754 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:32:07,754 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:32:07,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 12:32:07,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-28 12:32:07,958 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:32:07,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:32:07,958 INFO L85 PathProgramCache]: Analyzing trace with hash -368004398, now seen corresponding path program 3 times [2022-04-28 12:32:07,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:32:07,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [751871779] [2022-04-28 12:32:07,959 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:32:07,959 INFO L85 PathProgramCache]: Analyzing trace with hash -368004398, now seen corresponding path program 4 times [2022-04-28 12:32:07,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:32:07,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686901011] [2022-04-28 12:32:07,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:32:07,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:32:07,981 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:32:07,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [568291244] [2022-04-28 12:32:07,981 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 12:32:07,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:32:07,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:32:07,982 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-28 12:32:07,983 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-28 12:32:08,022 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 12:32:08,023 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:32:08,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 12:32:08,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:32:08,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:32:08,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {8234#true} call ULTIMATE.init(); {8234#true} is VALID [2022-04-28 12:32:08,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {8234#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(11, 2);call #Ultimate.allocInit(12, 3); {8234#true} is VALID [2022-04-28 12:32:08,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-28 12:32:08,229 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8234#true} {8234#true} #112#return; {8234#true} is VALID [2022-04-28 12:32:08,229 INFO L272 TraceCheckUtils]: 4: Hoare triple {8234#true} call #t~ret6 := main(); {8234#true} is VALID [2022-04-28 12:32:08,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {8234#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {8234#true} is VALID [2022-04-28 12:32:08,229 INFO L272 TraceCheckUtils]: 6: Hoare triple {8234#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {8234#true} is VALID [2022-04-28 12:32:08,229 INFO L290 TraceCheckUtils]: 7: Hoare triple {8234#true} ~cond := #in~cond; {8234#true} is VALID [2022-04-28 12:32:08,229 INFO L290 TraceCheckUtils]: 8: Hoare triple {8234#true} assume !(0 == ~cond); {8234#true} is VALID [2022-04-28 12:32:08,229 INFO L290 TraceCheckUtils]: 9: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-28 12:32:08,229 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8234#true} {8234#true} #94#return; {8234#true} is VALID [2022-04-28 12:32:08,229 INFO L290 TraceCheckUtils]: 11: Hoare triple {8234#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8234#true} is VALID [2022-04-28 12:32:08,229 INFO L272 TraceCheckUtils]: 12: Hoare triple {8234#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {8234#true} is VALID [2022-04-28 12:32:08,229 INFO L290 TraceCheckUtils]: 13: Hoare triple {8234#true} ~cond := #in~cond; {8234#true} is VALID [2022-04-28 12:32:08,229 INFO L290 TraceCheckUtils]: 14: Hoare triple {8234#true} assume !(0 == ~cond); {8234#true} is VALID [2022-04-28 12:32:08,229 INFO L290 TraceCheckUtils]: 15: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-28 12:32:08,229 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8234#true} {8234#true} #96#return; {8234#true} is VALID [2022-04-28 12:32:08,230 INFO L272 TraceCheckUtils]: 17: Hoare triple {8234#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {8234#true} is VALID [2022-04-28 12:32:08,230 INFO L290 TraceCheckUtils]: 18: Hoare triple {8234#true} ~cond := #in~cond; {8234#true} is VALID [2022-04-28 12:32:08,230 INFO L290 TraceCheckUtils]: 19: Hoare triple {8234#true} assume !(0 == ~cond); {8234#true} is VALID [2022-04-28 12:32:08,230 INFO L290 TraceCheckUtils]: 20: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-28 12:32:08,230 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8234#true} {8234#true} #98#return; {8234#true} is VALID [2022-04-28 12:32:08,230 INFO L272 TraceCheckUtils]: 22: Hoare triple {8234#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8234#true} is VALID [2022-04-28 12:32:08,230 INFO L290 TraceCheckUtils]: 23: Hoare triple {8234#true} ~cond := #in~cond; {8234#true} is VALID [2022-04-28 12:32:08,230 INFO L290 TraceCheckUtils]: 24: Hoare triple {8234#true} assume !(0 == ~cond); {8234#true} is VALID [2022-04-28 12:32:08,230 INFO L290 TraceCheckUtils]: 25: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-28 12:32:08,230 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8234#true} {8234#true} #100#return; {8234#true} is VALID [2022-04-28 12:32:08,230 INFO L290 TraceCheckUtils]: 27: Hoare triple {8234#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {8234#true} is VALID [2022-04-28 12:32:08,230 INFO L290 TraceCheckUtils]: 28: Hoare triple {8234#true} assume !false; {8234#true} is VALID [2022-04-28 12:32:08,230 INFO L290 TraceCheckUtils]: 29: Hoare triple {8234#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {8234#true} is VALID [2022-04-28 12:32:08,230 INFO L290 TraceCheckUtils]: 30: Hoare triple {8234#true} assume !false; {8234#true} is VALID [2022-04-28 12:32:08,230 INFO L290 TraceCheckUtils]: 31: Hoare triple {8234#true} assume !(~c~0 >= ~b~0); {8332#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-28 12:32:08,231 INFO L290 TraceCheckUtils]: 32: Hoare triple {8332#(not (<= main_~b~0 main_~c~0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {8336#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 12:32:08,231 INFO L290 TraceCheckUtils]: 33: Hoare triple {8336#(< main_~b~0 main_~a~0)} assume !false; {8336#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 12:32:08,231 INFO L290 TraceCheckUtils]: 34: Hoare triple {8336#(< main_~b~0 main_~a~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {8343#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 12:32:08,232 INFO L290 TraceCheckUtils]: 35: Hoare triple {8343#(< main_~b~0 main_~c~0)} assume !false; {8343#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 12:32:08,232 INFO L290 TraceCheckUtils]: 36: Hoare triple {8343#(< main_~b~0 main_~c~0)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {8350#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 12:32:08,232 INFO L290 TraceCheckUtils]: 37: Hoare triple {8350#(< main_~v~0 main_~c~0)} assume !false; {8350#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 12:32:08,232 INFO L272 TraceCheckUtils]: 38: Hoare triple {8350#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8234#true} is VALID [2022-04-28 12:32:08,232 INFO L290 TraceCheckUtils]: 39: Hoare triple {8234#true} ~cond := #in~cond; {8234#true} is VALID [2022-04-28 12:32:08,232 INFO L290 TraceCheckUtils]: 40: Hoare triple {8234#true} assume !(0 == ~cond); {8234#true} is VALID [2022-04-28 12:32:08,232 INFO L290 TraceCheckUtils]: 41: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-28 12:32:08,233 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {8234#true} {8350#(< main_~v~0 main_~c~0)} #102#return; {8350#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 12:32:08,233 INFO L272 TraceCheckUtils]: 43: Hoare triple {8350#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8234#true} is VALID [2022-04-28 12:32:08,233 INFO L290 TraceCheckUtils]: 44: Hoare triple {8234#true} ~cond := #in~cond; {8234#true} is VALID [2022-04-28 12:32:08,233 INFO L290 TraceCheckUtils]: 45: Hoare triple {8234#true} assume !(0 == ~cond); {8234#true} is VALID [2022-04-28 12:32:08,233 INFO L290 TraceCheckUtils]: 46: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-28 12:32:08,234 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8234#true} {8350#(< main_~v~0 main_~c~0)} #104#return; {8350#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 12:32:08,234 INFO L272 TraceCheckUtils]: 48: Hoare triple {8350#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {8234#true} is VALID [2022-04-28 12:32:08,234 INFO L290 TraceCheckUtils]: 49: Hoare triple {8234#true} ~cond := #in~cond; {8234#true} is VALID [2022-04-28 12:32:08,234 INFO L290 TraceCheckUtils]: 50: Hoare triple {8234#true} assume !(0 == ~cond); {8234#true} is VALID [2022-04-28 12:32:08,234 INFO L290 TraceCheckUtils]: 51: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-28 12:32:08,234 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8234#true} {8350#(< main_~v~0 main_~c~0)} #106#return; {8350#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 12:32:08,234 INFO L272 TraceCheckUtils]: 53: Hoare triple {8350#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {8234#true} is VALID [2022-04-28 12:32:08,234 INFO L290 TraceCheckUtils]: 54: Hoare triple {8234#true} ~cond := #in~cond; {8234#true} is VALID [2022-04-28 12:32:08,235 INFO L290 TraceCheckUtils]: 55: Hoare triple {8234#true} assume !(0 == ~cond); {8234#true} is VALID [2022-04-28 12:32:08,235 INFO L290 TraceCheckUtils]: 56: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-28 12:32:08,235 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {8234#true} {8350#(< main_~v~0 main_~c~0)} #108#return; {8350#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 12:32:08,235 INFO L290 TraceCheckUtils]: 58: Hoare triple {8350#(< main_~v~0 main_~c~0)} assume !(~c~0 >= 2 * ~v~0); {8350#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 12:32:08,236 INFO L290 TraceCheckUtils]: 59: Hoare triple {8350#(< main_~v~0 main_~c~0)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {8420#(< 0 main_~c~0)} is VALID [2022-04-28 12:32:08,236 INFO L290 TraceCheckUtils]: 60: Hoare triple {8420#(< 0 main_~c~0)} assume !false; {8420#(< 0 main_~c~0)} is VALID [2022-04-28 12:32:08,237 INFO L290 TraceCheckUtils]: 61: Hoare triple {8420#(< 0 main_~c~0)} assume !(~c~0 >= ~b~0); {8420#(< 0 main_~c~0)} is VALID [2022-04-28 12:32:08,237 INFO L290 TraceCheckUtils]: 62: Hoare triple {8420#(< 0 main_~c~0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {8430#(< 0 main_~b~0)} is VALID [2022-04-28 12:32:08,237 INFO L290 TraceCheckUtils]: 63: Hoare triple {8430#(< 0 main_~b~0)} assume !false; {8430#(< 0 main_~b~0)} is VALID [2022-04-28 12:32:08,237 INFO L290 TraceCheckUtils]: 64: Hoare triple {8430#(< 0 main_~b~0)} assume !(0 != ~b~0); {8235#false} is VALID [2022-04-28 12:32:08,238 INFO L272 TraceCheckUtils]: 65: Hoare triple {8235#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {8235#false} is VALID [2022-04-28 12:32:08,238 INFO L290 TraceCheckUtils]: 66: Hoare triple {8235#false} ~cond := #in~cond; {8235#false} is VALID [2022-04-28 12:32:08,238 INFO L290 TraceCheckUtils]: 67: Hoare triple {8235#false} assume 0 == ~cond; {8235#false} is VALID [2022-04-28 12:32:08,238 INFO L290 TraceCheckUtils]: 68: Hoare triple {8235#false} assume !false; {8235#false} is VALID [2022-04-28 12:32:08,238 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-28 12:32:08,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:32:08,443 INFO L290 TraceCheckUtils]: 68: Hoare triple {8235#false} assume !false; {8235#false} is VALID [2022-04-28 12:32:08,443 INFO L290 TraceCheckUtils]: 67: Hoare triple {8235#false} assume 0 == ~cond; {8235#false} is VALID [2022-04-28 12:32:08,443 INFO L290 TraceCheckUtils]: 66: Hoare triple {8235#false} ~cond := #in~cond; {8235#false} is VALID [2022-04-28 12:32:08,443 INFO L272 TraceCheckUtils]: 65: Hoare triple {8235#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {8235#false} is VALID [2022-04-28 12:32:08,443 INFO L290 TraceCheckUtils]: 64: Hoare triple {8430#(< 0 main_~b~0)} assume !(0 != ~b~0); {8235#false} is VALID [2022-04-28 12:32:08,444 INFO L290 TraceCheckUtils]: 63: Hoare triple {8430#(< 0 main_~b~0)} assume !false; {8430#(< 0 main_~b~0)} is VALID [2022-04-28 12:32:08,444 INFO L290 TraceCheckUtils]: 62: Hoare triple {8420#(< 0 main_~c~0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {8430#(< 0 main_~b~0)} is VALID [2022-04-28 12:32:08,444 INFO L290 TraceCheckUtils]: 61: Hoare triple {8420#(< 0 main_~c~0)} assume !(~c~0 >= ~b~0); {8420#(< 0 main_~c~0)} is VALID [2022-04-28 12:32:08,444 INFO L290 TraceCheckUtils]: 60: Hoare triple {8420#(< 0 main_~c~0)} assume !false; {8420#(< 0 main_~c~0)} is VALID [2022-04-28 12:32:08,445 INFO L290 TraceCheckUtils]: 59: Hoare triple {8350#(< main_~v~0 main_~c~0)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {8420#(< 0 main_~c~0)} is VALID [2022-04-28 12:32:08,445 INFO L290 TraceCheckUtils]: 58: Hoare triple {8350#(< main_~v~0 main_~c~0)} assume !(~c~0 >= 2 * ~v~0); {8350#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 12:32:08,445 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {8234#true} {8350#(< main_~v~0 main_~c~0)} #108#return; {8350#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 12:32:08,446 INFO L290 TraceCheckUtils]: 56: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-28 12:32:08,446 INFO L290 TraceCheckUtils]: 55: Hoare triple {8234#true} assume !(0 == ~cond); {8234#true} is VALID [2022-04-28 12:32:08,446 INFO L290 TraceCheckUtils]: 54: Hoare triple {8234#true} ~cond := #in~cond; {8234#true} is VALID [2022-04-28 12:32:08,446 INFO L272 TraceCheckUtils]: 53: Hoare triple {8350#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {8234#true} is VALID [2022-04-28 12:32:08,446 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8234#true} {8350#(< main_~v~0 main_~c~0)} #106#return; {8350#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 12:32:08,446 INFO L290 TraceCheckUtils]: 51: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-28 12:32:08,446 INFO L290 TraceCheckUtils]: 50: Hoare triple {8234#true} assume !(0 == ~cond); {8234#true} is VALID [2022-04-28 12:32:08,446 INFO L290 TraceCheckUtils]: 49: Hoare triple {8234#true} ~cond := #in~cond; {8234#true} is VALID [2022-04-28 12:32:08,446 INFO L272 TraceCheckUtils]: 48: Hoare triple {8350#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {8234#true} is VALID [2022-04-28 12:32:08,447 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8234#true} {8350#(< main_~v~0 main_~c~0)} #104#return; {8350#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 12:32:08,447 INFO L290 TraceCheckUtils]: 46: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-28 12:32:08,447 INFO L290 TraceCheckUtils]: 45: Hoare triple {8234#true} assume !(0 == ~cond); {8234#true} is VALID [2022-04-28 12:32:08,447 INFO L290 TraceCheckUtils]: 44: Hoare triple {8234#true} ~cond := #in~cond; {8234#true} is VALID [2022-04-28 12:32:08,447 INFO L272 TraceCheckUtils]: 43: Hoare triple {8350#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8234#true} is VALID [2022-04-28 12:32:08,448 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {8234#true} {8350#(< main_~v~0 main_~c~0)} #102#return; {8350#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 12:32:08,448 INFO L290 TraceCheckUtils]: 41: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-28 12:32:08,448 INFO L290 TraceCheckUtils]: 40: Hoare triple {8234#true} assume !(0 == ~cond); {8234#true} is VALID [2022-04-28 12:32:08,448 INFO L290 TraceCheckUtils]: 39: Hoare triple {8234#true} ~cond := #in~cond; {8234#true} is VALID [2022-04-28 12:32:08,448 INFO L272 TraceCheckUtils]: 38: Hoare triple {8350#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8234#true} is VALID [2022-04-28 12:32:08,467 INFO L290 TraceCheckUtils]: 37: Hoare triple {8350#(< main_~v~0 main_~c~0)} assume !false; {8350#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 12:32:08,468 INFO L290 TraceCheckUtils]: 36: Hoare triple {8343#(< main_~b~0 main_~c~0)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {8350#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 12:32:08,468 INFO L290 TraceCheckUtils]: 35: Hoare triple {8343#(< main_~b~0 main_~c~0)} assume !false; {8343#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 12:32:08,469 INFO L290 TraceCheckUtils]: 34: Hoare triple {8336#(< main_~b~0 main_~a~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {8343#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 12:32:08,469 INFO L290 TraceCheckUtils]: 33: Hoare triple {8336#(< main_~b~0 main_~a~0)} assume !false; {8336#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 12:32:08,469 INFO L290 TraceCheckUtils]: 32: Hoare triple {8332#(not (<= main_~b~0 main_~c~0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {8336#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 12:32:08,470 INFO L290 TraceCheckUtils]: 31: Hoare triple {8234#true} assume !(~c~0 >= ~b~0); {8332#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-28 12:32:08,470 INFO L290 TraceCheckUtils]: 30: Hoare triple {8234#true} assume !false; {8234#true} is VALID [2022-04-28 12:32:08,470 INFO L290 TraceCheckUtils]: 29: Hoare triple {8234#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {8234#true} is VALID [2022-04-28 12:32:08,470 INFO L290 TraceCheckUtils]: 28: Hoare triple {8234#true} assume !false; {8234#true} is VALID [2022-04-28 12:32:08,470 INFO L290 TraceCheckUtils]: 27: Hoare triple {8234#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {8234#true} is VALID [2022-04-28 12:32:08,470 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8234#true} {8234#true} #100#return; {8234#true} is VALID [2022-04-28 12:32:08,470 INFO L290 TraceCheckUtils]: 25: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-28 12:32:08,470 INFO L290 TraceCheckUtils]: 24: Hoare triple {8234#true} assume !(0 == ~cond); {8234#true} is VALID [2022-04-28 12:32:08,470 INFO L290 TraceCheckUtils]: 23: Hoare triple {8234#true} ~cond := #in~cond; {8234#true} is VALID [2022-04-28 12:32:08,470 INFO L272 TraceCheckUtils]: 22: Hoare triple {8234#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8234#true} is VALID [2022-04-28 12:32:08,470 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8234#true} {8234#true} #98#return; {8234#true} is VALID [2022-04-28 12:32:08,470 INFO L290 TraceCheckUtils]: 20: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-28 12:32:08,470 INFO L290 TraceCheckUtils]: 19: Hoare triple {8234#true} assume !(0 == ~cond); {8234#true} is VALID [2022-04-28 12:32:08,470 INFO L290 TraceCheckUtils]: 18: Hoare triple {8234#true} ~cond := #in~cond; {8234#true} is VALID [2022-04-28 12:32:08,471 INFO L272 TraceCheckUtils]: 17: Hoare triple {8234#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {8234#true} is VALID [2022-04-28 12:32:08,471 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8234#true} {8234#true} #96#return; {8234#true} is VALID [2022-04-28 12:32:08,471 INFO L290 TraceCheckUtils]: 15: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-28 12:32:08,471 INFO L290 TraceCheckUtils]: 14: Hoare triple {8234#true} assume !(0 == ~cond); {8234#true} is VALID [2022-04-28 12:32:08,471 INFO L290 TraceCheckUtils]: 13: Hoare triple {8234#true} ~cond := #in~cond; {8234#true} is VALID [2022-04-28 12:32:08,471 INFO L272 TraceCheckUtils]: 12: Hoare triple {8234#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {8234#true} is VALID [2022-04-28 12:32:08,471 INFO L290 TraceCheckUtils]: 11: Hoare triple {8234#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8234#true} is VALID [2022-04-28 12:32:08,471 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8234#true} {8234#true} #94#return; {8234#true} is VALID [2022-04-28 12:32:08,471 INFO L290 TraceCheckUtils]: 9: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-28 12:32:08,471 INFO L290 TraceCheckUtils]: 8: Hoare triple {8234#true} assume !(0 == ~cond); {8234#true} is VALID [2022-04-28 12:32:08,471 INFO L290 TraceCheckUtils]: 7: Hoare triple {8234#true} ~cond := #in~cond; {8234#true} is VALID [2022-04-28 12:32:08,471 INFO L272 TraceCheckUtils]: 6: Hoare triple {8234#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {8234#true} is VALID [2022-04-28 12:32:08,471 INFO L290 TraceCheckUtils]: 5: Hoare triple {8234#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {8234#true} is VALID [2022-04-28 12:32:08,471 INFO L272 TraceCheckUtils]: 4: Hoare triple {8234#true} call #t~ret6 := main(); {8234#true} is VALID [2022-04-28 12:32:08,471 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8234#true} {8234#true} #112#return; {8234#true} is VALID [2022-04-28 12:32:08,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {8234#true} assume true; {8234#true} is VALID [2022-04-28 12:32:08,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {8234#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(11, 2);call #Ultimate.allocInit(12, 3); {8234#true} is VALID [2022-04-28 12:32:08,471 INFO L272 TraceCheckUtils]: 0: Hoare triple {8234#true} call ULTIMATE.init(); {8234#true} is VALID [2022-04-28 12:32:08,472 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-28 12:32:08,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:32:08,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686901011] [2022-04-28 12:32:08,472 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:32:08,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568291244] [2022-04-28 12:32:08,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568291244] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:32:08,472 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:32:08,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-04-28 12:32:08,472 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:32:08,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [751871779] [2022-04-28 12:32:08,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [751871779] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:32:08,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:32:08,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 12:32:08,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246502242] [2022-04-28 12:32:08,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:32:08,473 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 69 [2022-04-28 12:32:08,473 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:32:08,473 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-28 12:32:08,505 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-28 12:32:08,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 12:32:08,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:32:08,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 12:32:08,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-28 12:32:08,506 INFO L87 Difference]: Start difference. First operand 193 states and 275 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-28 12:32:10,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:32:10,228 INFO L93 Difference]: Finished difference Result 288 states and 424 transitions. [2022-04-28 12:32:10,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 12:32:10,228 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 69 [2022-04-28 12:32:10,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:32:10,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-28 12:32:10,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 158 transitions. [2022-04-28 12:32:10,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-28 12:32:10,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 158 transitions. [2022-04-28 12:32:10,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 158 transitions. [2022-04-28 12:32:10,354 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:32:10,359 INFO L225 Difference]: With dead ends: 288 [2022-04-28 12:32:10,359 INFO L226 Difference]: Without dead ends: 281 [2022-04-28 12:32:10,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 134 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2022-04-28 12:32:10,360 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 48 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 12:32:10,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 318 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 12:32:10,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-04-28 12:32:10,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 208. [2022-04-28 12:32:10,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:32:10,870 INFO L82 GeneralOperation]: Start isEquivalent. First operand 281 states. Second operand has 208 states, 116 states have (on average 1.206896551724138) internal successors, (140), 122 states have internal predecessors, (140), 79 states have call successors, (79), 13 states have call predecessors, (79), 12 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-28 12:32:10,870 INFO L74 IsIncluded]: Start isIncluded. First operand 281 states. Second operand has 208 states, 116 states have (on average 1.206896551724138) internal successors, (140), 122 states have internal predecessors, (140), 79 states have call successors, (79), 13 states have call predecessors, (79), 12 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-28 12:32:10,870 INFO L87 Difference]: Start difference. First operand 281 states. Second operand has 208 states, 116 states have (on average 1.206896551724138) internal successors, (140), 122 states have internal predecessors, (140), 79 states have call successors, (79), 13 states have call predecessors, (79), 12 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-28 12:32:10,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:32:10,878 INFO L93 Difference]: Finished difference Result 281 states and 417 transitions. [2022-04-28 12:32:10,878 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 417 transitions. [2022-04-28 12:32:10,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:32:10,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:32:10,880 INFO L74 IsIncluded]: Start isIncluded. First operand has 208 states, 116 states have (on average 1.206896551724138) internal successors, (140), 122 states have internal predecessors, (140), 79 states have call successors, (79), 13 states have call predecessors, (79), 12 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) Second operand 281 states. [2022-04-28 12:32:10,880 INFO L87 Difference]: Start difference. First operand has 208 states, 116 states have (on average 1.206896551724138) internal successors, (140), 122 states have internal predecessors, (140), 79 states have call successors, (79), 13 states have call predecessors, (79), 12 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) Second operand 281 states. [2022-04-28 12:32:10,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:32:10,887 INFO L93 Difference]: Finished difference Result 281 states and 417 transitions. [2022-04-28 12:32:10,887 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 417 transitions. [2022-04-28 12:32:10,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:32:10,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:32:10,888 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:32:10,888 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:32:10,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 116 states have (on average 1.206896551724138) internal successors, (140), 122 states have internal predecessors, (140), 79 states have call successors, (79), 13 states have call predecessors, (79), 12 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-28 12:32:10,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 296 transitions. [2022-04-28 12:32:10,894 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 296 transitions. Word has length 69 [2022-04-28 12:32:10,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:32:10,894 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 296 transitions. [2022-04-28 12:32:10,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-28 12:32:10,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 208 states and 296 transitions. [2022-04-28 12:32:11,322 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 296 edges. 296 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:32:11,323 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 296 transitions. [2022-04-28 12:32:11,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-28 12:32:11,323 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:32:11,323 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:32:11,339 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-28 12:32:11,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-28 12:32:11,532 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:32:11,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:32:11,532 INFO L85 PathProgramCache]: Analyzing trace with hash -298771846, now seen corresponding path program 1 times [2022-04-28 12:32:11,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:32:11,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1387576126] [2022-04-28 12:32:11,533 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:32:11,533 INFO L85 PathProgramCache]: Analyzing trace with hash -298771846, now seen corresponding path program 2 times [2022-04-28 12:32:11,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:32:11,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047042609] [2022-04-28 12:32:11,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:32:11,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:32:11,546 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:32:11,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [898750021] [2022-04-28 12:32:11,546 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:32:11,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:32:11,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:32:11,554 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-28 12:32:11,555 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-28 12:32:11,594 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:32:11,595 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:32:11,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 12:32:11,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:32:11,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:32:12,563 INFO L272 TraceCheckUtils]: 0: Hoare triple {10236#true} call ULTIMATE.init(); {10236#true} is VALID [2022-04-28 12:32:12,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {10236#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(11, 2);call #Ultimate.allocInit(12, 3); {10236#true} is VALID [2022-04-28 12:32:12,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-28 12:32:12,563 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10236#true} {10236#true} #112#return; {10236#true} is VALID [2022-04-28 12:32:12,563 INFO L272 TraceCheckUtils]: 4: Hoare triple {10236#true} call #t~ret6 := main(); {10236#true} is VALID [2022-04-28 12:32:12,563 INFO L290 TraceCheckUtils]: 5: Hoare triple {10236#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {10236#true} is VALID [2022-04-28 12:32:12,563 INFO L272 TraceCheckUtils]: 6: Hoare triple {10236#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {10236#true} is VALID [2022-04-28 12:32:12,564 INFO L290 TraceCheckUtils]: 7: Hoare triple {10236#true} ~cond := #in~cond; {10262#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 12:32:12,564 INFO L290 TraceCheckUtils]: 8: Hoare triple {10262#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {10266#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:32:12,564 INFO L290 TraceCheckUtils]: 9: Hoare triple {10266#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {10266#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:32:12,565 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10266#(not (= |assume_abort_if_not_#in~cond| 0))} {10236#true} #94#return; {10273#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 12:32:12,565 INFO L290 TraceCheckUtils]: 11: Hoare triple {10273#(and (<= 0 main_~x~0) (<= main_~x~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {10273#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 12:32:12,565 INFO L272 TraceCheckUtils]: 12: Hoare triple {10273#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {10236#true} is VALID [2022-04-28 12:32:12,565 INFO L290 TraceCheckUtils]: 13: Hoare triple {10236#true} ~cond := #in~cond; {10262#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 12:32:12,566 INFO L290 TraceCheckUtils]: 14: Hoare triple {10262#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {10266#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:32:12,566 INFO L290 TraceCheckUtils]: 15: Hoare triple {10266#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {10266#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:32:12,566 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10266#(not (= |assume_abort_if_not_#in~cond| 0))} {10273#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #96#return; {10292#(and (<= 0 main_~y~0) (<= main_~y~0 2) (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 12:32:12,566 INFO L272 TraceCheckUtils]: 17: Hoare triple {10292#(and (<= 0 main_~y~0) (<= main_~y~0 2) (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {10236#true} is VALID [2022-04-28 12:32:12,566 INFO L290 TraceCheckUtils]: 18: Hoare triple {10236#true} ~cond := #in~cond; {10236#true} is VALID [2022-04-28 12:32:12,567 INFO L290 TraceCheckUtils]: 19: Hoare triple {10236#true} assume !(0 == ~cond); {10236#true} is VALID [2022-04-28 12:32:12,567 INFO L290 TraceCheckUtils]: 20: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-28 12:32:12,567 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {10236#true} {10292#(and (<= 0 main_~y~0) (<= main_~y~0 2) (<= 0 main_~x~0) (<= main_~x~0 2))} #98#return; {10292#(and (<= 0 main_~y~0) (<= main_~y~0 2) (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 12:32:12,567 INFO L272 TraceCheckUtils]: 22: Hoare triple {10292#(and (<= 0 main_~y~0) (<= main_~y~0 2) (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {10236#true} is VALID [2022-04-28 12:32:12,567 INFO L290 TraceCheckUtils]: 23: Hoare triple {10236#true} ~cond := #in~cond; {10236#true} is VALID [2022-04-28 12:32:12,567 INFO L290 TraceCheckUtils]: 24: Hoare triple {10236#true} assume !(0 == ~cond); {10236#true} is VALID [2022-04-28 12:32:12,567 INFO L290 TraceCheckUtils]: 25: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-28 12:32:12,567 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10236#true} {10292#(and (<= 0 main_~y~0) (<= main_~y~0 2) (<= 0 main_~x~0) (<= main_~x~0 2))} #100#return; {10292#(and (<= 0 main_~y~0) (<= main_~y~0 2) (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 12:32:12,568 INFO L290 TraceCheckUtils]: 27: Hoare triple {10292#(and (<= 0 main_~y~0) (<= main_~y~0 2) (<= 0 main_~x~0) (<= main_~x~0 2))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {10326#(and (<= main_~b~0 2) (<= main_~a~0 2) (<= 0 main_~b~0))} is VALID [2022-04-28 12:32:12,568 INFO L290 TraceCheckUtils]: 28: Hoare triple {10326#(and (<= main_~b~0 2) (<= main_~a~0 2) (<= 0 main_~b~0))} assume !false; {10326#(and (<= main_~b~0 2) (<= main_~a~0 2) (<= 0 main_~b~0))} is VALID [2022-04-28 12:32:12,568 INFO L290 TraceCheckUtils]: 29: Hoare triple {10326#(and (<= main_~b~0 2) (<= main_~a~0 2) (<= 0 main_~b~0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {10333#(and (<= main_~b~0 2) (<= main_~c~0 2) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-28 12:32:12,569 INFO L290 TraceCheckUtils]: 30: Hoare triple {10333#(and (<= main_~b~0 2) (<= main_~c~0 2) (not (= main_~b~0 0)) (<= 0 main_~b~0))} assume !false; {10333#(and (<= main_~b~0 2) (<= main_~c~0 2) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-28 12:32:12,575 INFO L290 TraceCheckUtils]: 31: Hoare triple {10333#(and (<= main_~b~0 2) (<= main_~c~0 2) (not (= main_~b~0 0)) (<= 0 main_~b~0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {10340#(and (= main_~b~0 main_~v~0) (<= main_~b~0 2) (<= main_~c~0 2) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-28 12:32:12,575 INFO L290 TraceCheckUtils]: 32: Hoare triple {10340#(and (= main_~b~0 main_~v~0) (<= main_~b~0 2) (<= main_~c~0 2) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} assume !false; {10340#(and (= main_~b~0 main_~v~0) (<= main_~b~0 2) (<= main_~c~0 2) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-28 12:32:12,575 INFO L272 TraceCheckUtils]: 33: Hoare triple {10340#(and (= main_~b~0 main_~v~0) (<= main_~b~0 2) (<= main_~c~0 2) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {10236#true} is VALID [2022-04-28 12:32:12,575 INFO L290 TraceCheckUtils]: 34: Hoare triple {10236#true} ~cond := #in~cond; {10236#true} is VALID [2022-04-28 12:32:12,575 INFO L290 TraceCheckUtils]: 35: Hoare triple {10236#true} assume !(0 == ~cond); {10236#true} is VALID [2022-04-28 12:32:12,575 INFO L290 TraceCheckUtils]: 36: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-28 12:32:12,576 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {10236#true} {10340#(and (= main_~b~0 main_~v~0) (<= main_~b~0 2) (<= main_~c~0 2) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} #102#return; {10340#(and (= main_~b~0 main_~v~0) (<= main_~b~0 2) (<= main_~c~0 2) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-28 12:32:12,576 INFO L272 TraceCheckUtils]: 38: Hoare triple {10340#(and (= main_~b~0 main_~v~0) (<= main_~b~0 2) (<= main_~c~0 2) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {10236#true} is VALID [2022-04-28 12:32:12,576 INFO L290 TraceCheckUtils]: 39: Hoare triple {10236#true} ~cond := #in~cond; {10236#true} is VALID [2022-04-28 12:32:12,576 INFO L290 TraceCheckUtils]: 40: Hoare triple {10236#true} assume !(0 == ~cond); {10236#true} is VALID [2022-04-28 12:32:12,577 INFO L290 TraceCheckUtils]: 41: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-28 12:32:12,577 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {10236#true} {10340#(and (= main_~b~0 main_~v~0) (<= main_~b~0 2) (<= main_~c~0 2) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} #104#return; {10340#(and (= main_~b~0 main_~v~0) (<= main_~b~0 2) (<= main_~c~0 2) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-28 12:32:12,577 INFO L272 TraceCheckUtils]: 43: Hoare triple {10340#(and (= main_~b~0 main_~v~0) (<= main_~b~0 2) (<= main_~c~0 2) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {10236#true} is VALID [2022-04-28 12:32:12,577 INFO L290 TraceCheckUtils]: 44: Hoare triple {10236#true} ~cond := #in~cond; {10236#true} is VALID [2022-04-28 12:32:12,577 INFO L290 TraceCheckUtils]: 45: Hoare triple {10236#true} assume !(0 == ~cond); {10236#true} is VALID [2022-04-28 12:32:12,577 INFO L290 TraceCheckUtils]: 46: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-28 12:32:12,578 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {10236#true} {10340#(and (= main_~b~0 main_~v~0) (<= main_~b~0 2) (<= main_~c~0 2) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} #106#return; {10340#(and (= main_~b~0 main_~v~0) (<= main_~b~0 2) (<= main_~c~0 2) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-28 12:32:12,578 INFO L272 TraceCheckUtils]: 48: Hoare triple {10340#(and (= main_~b~0 main_~v~0) (<= main_~b~0 2) (<= main_~c~0 2) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {10236#true} is VALID [2022-04-28 12:32:12,578 INFO L290 TraceCheckUtils]: 49: Hoare triple {10236#true} ~cond := #in~cond; {10236#true} is VALID [2022-04-28 12:32:12,578 INFO L290 TraceCheckUtils]: 50: Hoare triple {10236#true} assume !(0 == ~cond); {10236#true} is VALID [2022-04-28 12:32:12,578 INFO L290 TraceCheckUtils]: 51: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-28 12:32:12,579 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {10236#true} {10340#(and (= main_~b~0 main_~v~0) (<= main_~b~0 2) (<= main_~c~0 2) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} #108#return; {10340#(and (= main_~b~0 main_~v~0) (<= main_~b~0 2) (<= main_~c~0 2) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-28 12:32:12,580 INFO L290 TraceCheckUtils]: 53: Hoare triple {10340#(and (= main_~b~0 main_~v~0) (<= main_~b~0 2) (<= main_~c~0 2) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {10407#(and (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) 2) (= main_~d~0 2) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-28 12:32:12,580 INFO L290 TraceCheckUtils]: 54: Hoare triple {10407#(and (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) 2) (= main_~d~0 2) (not (= main_~b~0 0)) (<= 0 main_~b~0))} assume !false; {10407#(and (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) 2) (= main_~d~0 2) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-28 12:32:12,580 INFO L272 TraceCheckUtils]: 55: Hoare triple {10407#(and (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) 2) (= main_~d~0 2) (not (= main_~b~0 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {10236#true} is VALID [2022-04-28 12:32:12,580 INFO L290 TraceCheckUtils]: 56: Hoare triple {10236#true} ~cond := #in~cond; {10236#true} is VALID [2022-04-28 12:32:12,580 INFO L290 TraceCheckUtils]: 57: Hoare triple {10236#true} assume !(0 == ~cond); {10236#true} is VALID [2022-04-28 12:32:12,580 INFO L290 TraceCheckUtils]: 58: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-28 12:32:12,581 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {10236#true} {10407#(and (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) 2) (= main_~d~0 2) (not (= main_~b~0 0)) (<= 0 main_~b~0))} #102#return; {10407#(and (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) 2) (= main_~d~0 2) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-28 12:32:12,581 INFO L272 TraceCheckUtils]: 60: Hoare triple {10407#(and (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) 2) (= main_~d~0 2) (not (= main_~b~0 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {10236#true} is VALID [2022-04-28 12:32:12,581 INFO L290 TraceCheckUtils]: 61: Hoare triple {10236#true} ~cond := #in~cond; {10236#true} is VALID [2022-04-28 12:32:12,581 INFO L290 TraceCheckUtils]: 62: Hoare triple {10236#true} assume !(0 == ~cond); {10236#true} is VALID [2022-04-28 12:32:12,581 INFO L290 TraceCheckUtils]: 63: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-28 12:32:12,582 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {10236#true} {10407#(and (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) 2) (= main_~d~0 2) (not (= main_~b~0 0)) (<= 0 main_~b~0))} #104#return; {10407#(and (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) 2) (= main_~d~0 2) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-28 12:32:12,582 INFO L272 TraceCheckUtils]: 65: Hoare triple {10407#(and (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) 2) (= main_~d~0 2) (not (= main_~b~0 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {10236#true} is VALID [2022-04-28 12:32:12,582 INFO L290 TraceCheckUtils]: 66: Hoare triple {10236#true} ~cond := #in~cond; {10236#true} is VALID [2022-04-28 12:32:12,582 INFO L290 TraceCheckUtils]: 67: Hoare triple {10236#true} assume !(0 == ~cond); {10236#true} is VALID [2022-04-28 12:32:12,582 INFO L290 TraceCheckUtils]: 68: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-28 12:32:12,583 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {10236#true} {10407#(and (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) 2) (= main_~d~0 2) (not (= main_~b~0 0)) (<= 0 main_~b~0))} #106#return; {10407#(and (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) 2) (= main_~d~0 2) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-28 12:32:12,584 INFO L272 TraceCheckUtils]: 70: Hoare triple {10407#(and (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) 2) (= main_~d~0 2) (not (= main_~b~0 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {10459#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:32:12,584 INFO L290 TraceCheckUtils]: 71: Hoare triple {10459#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10463#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:32:12,584 INFO L290 TraceCheckUtils]: 72: Hoare triple {10463#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10237#false} is VALID [2022-04-28 12:32:12,584 INFO L290 TraceCheckUtils]: 73: Hoare triple {10237#false} assume !false; {10237#false} is VALID [2022-04-28 12:32:12,585 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 14 proven. 17 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-04-28 12:32:12,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:32:12,919 INFO L290 TraceCheckUtils]: 73: Hoare triple {10237#false} assume !false; {10237#false} is VALID [2022-04-28 12:32:12,919 INFO L290 TraceCheckUtils]: 72: Hoare triple {10463#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10237#false} is VALID [2022-04-28 12:32:12,919 INFO L290 TraceCheckUtils]: 71: Hoare triple {10459#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10463#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:32:12,920 INFO L272 TraceCheckUtils]: 70: Hoare triple {10479#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {10459#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:32:12,920 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {10236#true} {10479#(= main_~v~0 (* main_~d~0 main_~b~0))} #106#return; {10479#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-28 12:32:12,920 INFO L290 TraceCheckUtils]: 68: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-28 12:32:12,920 INFO L290 TraceCheckUtils]: 67: Hoare triple {10236#true} assume !(0 == ~cond); {10236#true} is VALID [2022-04-28 12:32:12,920 INFO L290 TraceCheckUtils]: 66: Hoare triple {10236#true} ~cond := #in~cond; {10236#true} is VALID [2022-04-28 12:32:12,921 INFO L272 TraceCheckUtils]: 65: Hoare triple {10479#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {10236#true} is VALID [2022-04-28 12:32:12,923 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {10236#true} {10479#(= main_~v~0 (* main_~d~0 main_~b~0))} #104#return; {10479#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-28 12:32:12,923 INFO L290 TraceCheckUtils]: 63: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-28 12:32:12,923 INFO L290 TraceCheckUtils]: 62: Hoare triple {10236#true} assume !(0 == ~cond); {10236#true} is VALID [2022-04-28 12:32:12,923 INFO L290 TraceCheckUtils]: 61: Hoare triple {10236#true} ~cond := #in~cond; {10236#true} is VALID [2022-04-28 12:32:12,923 INFO L272 TraceCheckUtils]: 60: Hoare triple {10479#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {10236#true} is VALID [2022-04-28 12:32:12,924 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {10236#true} {10479#(= main_~v~0 (* main_~d~0 main_~b~0))} #102#return; {10479#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-28 12:32:12,924 INFO L290 TraceCheckUtils]: 58: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-28 12:32:12,924 INFO L290 TraceCheckUtils]: 57: Hoare triple {10236#true} assume !(0 == ~cond); {10236#true} is VALID [2022-04-28 12:32:12,924 INFO L290 TraceCheckUtils]: 56: Hoare triple {10236#true} ~cond := #in~cond; {10236#true} is VALID [2022-04-28 12:32:12,924 INFO L272 TraceCheckUtils]: 55: Hoare triple {10479#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {10236#true} is VALID [2022-04-28 12:32:12,924 INFO L290 TraceCheckUtils]: 54: Hoare triple {10479#(= main_~v~0 (* main_~d~0 main_~b~0))} assume !false; {10479#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-28 12:32:12,926 INFO L290 TraceCheckUtils]: 53: Hoare triple {10531#(or (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2))) (not (<= (* main_~v~0 2) main_~c~0)))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {10479#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-28 12:32:12,927 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {10236#true} {10531#(or (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2))) (not (<= (* main_~v~0 2) main_~c~0)))} #108#return; {10531#(or (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2))) (not (<= (* main_~v~0 2) main_~c~0)))} is VALID [2022-04-28 12:32:12,927 INFO L290 TraceCheckUtils]: 51: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-28 12:32:12,927 INFO L290 TraceCheckUtils]: 50: Hoare triple {10236#true} assume !(0 == ~cond); {10236#true} is VALID [2022-04-28 12:32:12,927 INFO L290 TraceCheckUtils]: 49: Hoare triple {10236#true} ~cond := #in~cond; {10236#true} is VALID [2022-04-28 12:32:12,927 INFO L272 TraceCheckUtils]: 48: Hoare triple {10531#(or (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2))) (not (<= (* main_~v~0 2) main_~c~0)))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {10236#true} is VALID [2022-04-28 12:32:12,928 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {10236#true} {10531#(or (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2))) (not (<= (* main_~v~0 2) main_~c~0)))} #106#return; {10531#(or (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2))) (not (<= (* main_~v~0 2) main_~c~0)))} is VALID [2022-04-28 12:32:12,928 INFO L290 TraceCheckUtils]: 46: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-28 12:32:12,928 INFO L290 TraceCheckUtils]: 45: Hoare triple {10236#true} assume !(0 == ~cond); {10236#true} is VALID [2022-04-28 12:32:12,928 INFO L290 TraceCheckUtils]: 44: Hoare triple {10236#true} ~cond := #in~cond; {10236#true} is VALID [2022-04-28 12:32:12,928 INFO L272 TraceCheckUtils]: 43: Hoare triple {10531#(or (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2))) (not (<= (* main_~v~0 2) main_~c~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {10236#true} is VALID [2022-04-28 12:32:12,928 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {10236#true} {10531#(or (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2))) (not (<= (* main_~v~0 2) main_~c~0)))} #104#return; {10531#(or (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2))) (not (<= (* main_~v~0 2) main_~c~0)))} is VALID [2022-04-28 12:32:12,928 INFO L290 TraceCheckUtils]: 41: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-28 12:32:12,928 INFO L290 TraceCheckUtils]: 40: Hoare triple {10236#true} assume !(0 == ~cond); {10236#true} is VALID [2022-04-28 12:32:12,928 INFO L290 TraceCheckUtils]: 39: Hoare triple {10236#true} ~cond := #in~cond; {10236#true} is VALID [2022-04-28 12:32:12,929 INFO L272 TraceCheckUtils]: 38: Hoare triple {10531#(or (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2))) (not (<= (* main_~v~0 2) main_~c~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {10236#true} is VALID [2022-04-28 12:32:12,929 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {10236#true} {10531#(or (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2))) (not (<= (* main_~v~0 2) main_~c~0)))} #102#return; {10531#(or (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2))) (not (<= (* main_~v~0 2) main_~c~0)))} is VALID [2022-04-28 12:32:12,929 INFO L290 TraceCheckUtils]: 36: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-28 12:32:12,929 INFO L290 TraceCheckUtils]: 35: Hoare triple {10236#true} assume !(0 == ~cond); {10236#true} is VALID [2022-04-28 12:32:12,929 INFO L290 TraceCheckUtils]: 34: Hoare triple {10236#true} ~cond := #in~cond; {10236#true} is VALID [2022-04-28 12:32:12,929 INFO L272 TraceCheckUtils]: 33: Hoare triple {10531#(or (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2))) (not (<= (* main_~v~0 2) main_~c~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {10236#true} is VALID [2022-04-28 12:32:12,930 INFO L290 TraceCheckUtils]: 32: Hoare triple {10531#(or (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2))) (not (<= (* main_~v~0 2) main_~c~0)))} assume !false; {10531#(or (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2))) (not (<= (* main_~v~0 2) main_~c~0)))} is VALID [2022-04-28 12:32:12,930 INFO L290 TraceCheckUtils]: 31: Hoare triple {10236#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {10531#(or (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2))) (not (<= (* main_~v~0 2) main_~c~0)))} is VALID [2022-04-28 12:32:12,930 INFO L290 TraceCheckUtils]: 30: Hoare triple {10236#true} assume !false; {10236#true} is VALID [2022-04-28 12:32:12,930 INFO L290 TraceCheckUtils]: 29: Hoare triple {10236#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {10236#true} is VALID [2022-04-28 12:32:12,930 INFO L290 TraceCheckUtils]: 28: Hoare triple {10236#true} assume !false; {10236#true} is VALID [2022-04-28 12:32:12,930 INFO L290 TraceCheckUtils]: 27: Hoare triple {10236#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {10236#true} is VALID [2022-04-28 12:32:12,930 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10236#true} {10236#true} #100#return; {10236#true} is VALID [2022-04-28 12:32:12,930 INFO L290 TraceCheckUtils]: 25: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-28 12:32:12,930 INFO L290 TraceCheckUtils]: 24: Hoare triple {10236#true} assume !(0 == ~cond); {10236#true} is VALID [2022-04-28 12:32:12,930 INFO L290 TraceCheckUtils]: 23: Hoare triple {10236#true} ~cond := #in~cond; {10236#true} is VALID [2022-04-28 12:32:12,930 INFO L272 TraceCheckUtils]: 22: Hoare triple {10236#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {10236#true} is VALID [2022-04-28 12:32:12,931 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {10236#true} {10236#true} #98#return; {10236#true} is VALID [2022-04-28 12:32:12,931 INFO L290 TraceCheckUtils]: 20: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-28 12:32:12,931 INFO L290 TraceCheckUtils]: 19: Hoare triple {10236#true} assume !(0 == ~cond); {10236#true} is VALID [2022-04-28 12:32:12,931 INFO L290 TraceCheckUtils]: 18: Hoare triple {10236#true} ~cond := #in~cond; {10236#true} is VALID [2022-04-28 12:32:12,931 INFO L272 TraceCheckUtils]: 17: Hoare triple {10236#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {10236#true} is VALID [2022-04-28 12:32:12,931 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10236#true} {10236#true} #96#return; {10236#true} is VALID [2022-04-28 12:32:12,931 INFO L290 TraceCheckUtils]: 15: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-28 12:32:12,931 INFO L290 TraceCheckUtils]: 14: Hoare triple {10236#true} assume !(0 == ~cond); {10236#true} is VALID [2022-04-28 12:32:12,931 INFO L290 TraceCheckUtils]: 13: Hoare triple {10236#true} ~cond := #in~cond; {10236#true} is VALID [2022-04-28 12:32:12,931 INFO L272 TraceCheckUtils]: 12: Hoare triple {10236#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {10236#true} is VALID [2022-04-28 12:32:12,931 INFO L290 TraceCheckUtils]: 11: Hoare triple {10236#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {10236#true} is VALID [2022-04-28 12:32:12,931 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10236#true} {10236#true} #94#return; {10236#true} is VALID [2022-04-28 12:32:12,931 INFO L290 TraceCheckUtils]: 9: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-28 12:32:12,931 INFO L290 TraceCheckUtils]: 8: Hoare triple {10236#true} assume !(0 == ~cond); {10236#true} is VALID [2022-04-28 12:32:12,931 INFO L290 TraceCheckUtils]: 7: Hoare triple {10236#true} ~cond := #in~cond; {10236#true} is VALID [2022-04-28 12:32:12,931 INFO L272 TraceCheckUtils]: 6: Hoare triple {10236#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {10236#true} is VALID [2022-04-28 12:32:12,931 INFO L290 TraceCheckUtils]: 5: Hoare triple {10236#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {10236#true} is VALID [2022-04-28 12:32:12,931 INFO L272 TraceCheckUtils]: 4: Hoare triple {10236#true} call #t~ret6 := main(); {10236#true} is VALID [2022-04-28 12:32:12,932 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10236#true} {10236#true} #112#return; {10236#true} is VALID [2022-04-28 12:32:12,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {10236#true} assume true; {10236#true} is VALID [2022-04-28 12:32:12,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {10236#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(11, 2);call #Ultimate.allocInit(12, 3); {10236#true} is VALID [2022-04-28 12:32:12,932 INFO L272 TraceCheckUtils]: 0: Hoare triple {10236#true} call ULTIMATE.init(); {10236#true} is VALID [2022-04-28 12:32:12,932 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-04-28 12:32:12,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:32:12,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047042609] [2022-04-28 12:32:12,932 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:32:12,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898750021] [2022-04-28 12:32:12,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898750021] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 12:32:12,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 12:32:12,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 14 [2022-04-28 12:32:12,932 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:32:12,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1387576126] [2022-04-28 12:32:12,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1387576126] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:32:12,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:32:12,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 12:32:12,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982462783] [2022-04-28 12:32:12,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:32:12,933 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 74 [2022-04-28 12:32:12,933 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:32:12,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-04-28 12:32:12,974 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:32:12,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 12:32:12,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:32:12,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 12:32:12,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-04-28 12:32:12,975 INFO L87 Difference]: Start difference. First operand 208 states and 296 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-04-28 12:32:13,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:32:13,663 INFO L93 Difference]: Finished difference Result 214 states and 301 transitions. [2022-04-28 12:32:13,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 12:32:13,664 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 74 [2022-04-28 12:32:13,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:32:13,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-04-28 12:32:13,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-28 12:32:13,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-04-28 12:32:13,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-28 12:32:13,665 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2022-04-28 12:32:13,711 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-28 12:32:13,714 INFO L225 Difference]: With dead ends: 214 [2022-04-28 12:32:13,714 INFO L226 Difference]: Without dead ends: 212 [2022-04-28 12:32:13,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 134 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-04-28 12:32:13,715 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 9 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:32:13,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 166 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:32:13,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-04-28 12:32:14,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2022-04-28 12:32:14,211 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:32:14,211 INFO L82 GeneralOperation]: Start isEquivalent. First operand 212 states. Second operand has 212 states, 119 states have (on average 1.2016806722689075) internal successors, (143), 125 states have internal predecessors, (143), 79 states have call successors, (79), 14 states have call predecessors, (79), 13 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-28 12:32:14,212 INFO L74 IsIncluded]: Start isIncluded. First operand 212 states. Second operand has 212 states, 119 states have (on average 1.2016806722689075) internal successors, (143), 125 states have internal predecessors, (143), 79 states have call successors, (79), 14 states have call predecessors, (79), 13 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-28 12:32:14,212 INFO L87 Difference]: Start difference. First operand 212 states. Second operand has 212 states, 119 states have (on average 1.2016806722689075) internal successors, (143), 125 states have internal predecessors, (143), 79 states have call successors, (79), 14 states have call predecessors, (79), 13 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-28 12:32:14,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:32:14,216 INFO L93 Difference]: Finished difference Result 212 states and 299 transitions. [2022-04-28 12:32:14,216 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 299 transitions. [2022-04-28 12:32:14,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:32:14,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:32:14,217 INFO L74 IsIncluded]: Start isIncluded. First operand has 212 states, 119 states have (on average 1.2016806722689075) internal successors, (143), 125 states have internal predecessors, (143), 79 states have call successors, (79), 14 states have call predecessors, (79), 13 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) Second operand 212 states. [2022-04-28 12:32:14,217 INFO L87 Difference]: Start difference. First operand has 212 states, 119 states have (on average 1.2016806722689075) internal successors, (143), 125 states have internal predecessors, (143), 79 states have call successors, (79), 14 states have call predecessors, (79), 13 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) Second operand 212 states. [2022-04-28 12:32:14,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:32:14,221 INFO L93 Difference]: Finished difference Result 212 states and 299 transitions. [2022-04-28 12:32:14,221 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 299 transitions. [2022-04-28 12:32:14,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:32:14,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:32:14,222 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:32:14,222 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:32:14,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 119 states have (on average 1.2016806722689075) internal successors, (143), 125 states have internal predecessors, (143), 79 states have call successors, (79), 14 states have call predecessors, (79), 13 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-28 12:32:14,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 299 transitions. [2022-04-28 12:32:14,227 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 299 transitions. Word has length 74 [2022-04-28 12:32:14,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:32:14,227 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 299 transitions. [2022-04-28 12:32:14,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-04-28 12:32:14,227 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 212 states and 299 transitions. [2022-04-28 12:32:14,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 299 edges. 299 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:32:14,749 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 299 transitions. [2022-04-28 12:32:14,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-04-28 12:32:14,749 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:32:14,749 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:32:14,767 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-28 12:32:14,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-28 12:32:14,950 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:32:14,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:32:14,950 INFO L85 PathProgramCache]: Analyzing trace with hash -2089538094, now seen corresponding path program 1 times [2022-04-28 12:32:14,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:32:14,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1463313340] [2022-04-28 12:32:14,951 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:32:14,951 INFO L85 PathProgramCache]: Analyzing trace with hash -2089538094, now seen corresponding path program 2 times [2022-04-28 12:32:14,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:32:14,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719765449] [2022-04-28 12:32:14,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:32:14,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:32:14,961 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:32:14,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2091970916] [2022-04-28 12:32:14,962 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:32:14,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:32:14,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:32:14,962 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-28 12:32:14,963 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-28 12:32:15,005 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:32:15,005 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:32:15,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 12:32:15,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:32:15,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:32:15,353 INFO L272 TraceCheckUtils]: 0: Hoare triple {11971#true} call ULTIMATE.init(); {11971#true} is VALID [2022-04-28 12:32:15,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {11971#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(11, 2);call #Ultimate.allocInit(12, 3); {11971#true} is VALID [2022-04-28 12:32:15,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {11971#true} assume true; {11971#true} is VALID [2022-04-28 12:32:15,354 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11971#true} {11971#true} #112#return; {11971#true} is VALID [2022-04-28 12:32:15,354 INFO L272 TraceCheckUtils]: 4: Hoare triple {11971#true} call #t~ret6 := main(); {11971#true} is VALID [2022-04-28 12:32:15,354 INFO L290 TraceCheckUtils]: 5: Hoare triple {11971#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {11971#true} is VALID [2022-04-28 12:32:15,354 INFO L272 TraceCheckUtils]: 6: Hoare triple {11971#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {11971#true} is VALID [2022-04-28 12:32:15,354 INFO L290 TraceCheckUtils]: 7: Hoare triple {11971#true} ~cond := #in~cond; {11971#true} is VALID [2022-04-28 12:32:15,354 INFO L290 TraceCheckUtils]: 8: Hoare triple {11971#true} assume !(0 == ~cond); {11971#true} is VALID [2022-04-28 12:32:15,354 INFO L290 TraceCheckUtils]: 9: Hoare triple {11971#true} assume true; {11971#true} is VALID [2022-04-28 12:32:15,354 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11971#true} {11971#true} #94#return; {11971#true} is VALID [2022-04-28 12:32:15,354 INFO L290 TraceCheckUtils]: 11: Hoare triple {11971#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {11971#true} is VALID [2022-04-28 12:32:15,354 INFO L272 TraceCheckUtils]: 12: Hoare triple {11971#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {11971#true} is VALID [2022-04-28 12:32:15,355 INFO L290 TraceCheckUtils]: 13: Hoare triple {11971#true} ~cond := #in~cond; {12015#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 12:32:15,355 INFO L290 TraceCheckUtils]: 14: Hoare triple {12015#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {12019#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:32:15,355 INFO L290 TraceCheckUtils]: 15: Hoare triple {12019#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {12019#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:32:15,355 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {12019#(not (= |assume_abort_if_not_#in~cond| 0))} {11971#true} #96#return; {12026#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 12:32:15,356 INFO L272 TraceCheckUtils]: 17: Hoare triple {12026#(and (<= 0 main_~y~0) (<= main_~y~0 2))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {11971#true} is VALID [2022-04-28 12:32:15,356 INFO L290 TraceCheckUtils]: 18: Hoare triple {11971#true} ~cond := #in~cond; {11971#true} is VALID [2022-04-28 12:32:15,356 INFO L290 TraceCheckUtils]: 19: Hoare triple {11971#true} assume !(0 == ~cond); {11971#true} is VALID [2022-04-28 12:32:15,356 INFO L290 TraceCheckUtils]: 20: Hoare triple {11971#true} assume true; {11971#true} is VALID [2022-04-28 12:32:15,356 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {11971#true} {12026#(and (<= 0 main_~y~0) (<= main_~y~0 2))} #98#return; {12026#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 12:32:15,356 INFO L272 TraceCheckUtils]: 22: Hoare triple {12026#(and (<= 0 main_~y~0) (<= main_~y~0 2))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11971#true} is VALID [2022-04-28 12:32:15,356 INFO L290 TraceCheckUtils]: 23: Hoare triple {11971#true} ~cond := #in~cond; {11971#true} is VALID [2022-04-28 12:32:15,356 INFO L290 TraceCheckUtils]: 24: Hoare triple {11971#true} assume !(0 == ~cond); {11971#true} is VALID [2022-04-28 12:32:15,356 INFO L290 TraceCheckUtils]: 25: Hoare triple {11971#true} assume true; {11971#true} is VALID [2022-04-28 12:32:15,357 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {11971#true} {12026#(and (<= 0 main_~y~0) (<= main_~y~0 2))} #100#return; {12026#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 12:32:15,357 INFO L290 TraceCheckUtils]: 27: Hoare triple {12026#(and (<= 0 main_~y~0) (<= main_~y~0 2))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {12060#(<= main_~b~0 2)} is VALID [2022-04-28 12:32:15,357 INFO L290 TraceCheckUtils]: 28: Hoare triple {12060#(<= main_~b~0 2)} assume !false; {12060#(<= main_~b~0 2)} is VALID [2022-04-28 12:32:15,357 INFO L290 TraceCheckUtils]: 29: Hoare triple {12060#(<= main_~b~0 2)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {12060#(<= main_~b~0 2)} is VALID [2022-04-28 12:32:15,358 INFO L290 TraceCheckUtils]: 30: Hoare triple {12060#(<= main_~b~0 2)} assume !false; {12060#(<= main_~b~0 2)} is VALID [2022-04-28 12:32:15,358 INFO L290 TraceCheckUtils]: 31: Hoare triple {12060#(<= main_~b~0 2)} assume !(~c~0 >= ~b~0); {12073#(and (<= main_~b~0 2) (not (<= main_~b~0 main_~c~0)))} is VALID [2022-04-28 12:32:15,359 INFO L290 TraceCheckUtils]: 32: Hoare triple {12073#(and (<= main_~b~0 2) (not (<= main_~b~0 main_~c~0)))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {12077#(and (< main_~b~0 main_~a~0) (< main_~b~0 2))} is VALID [2022-04-28 12:32:15,359 INFO L290 TraceCheckUtils]: 33: Hoare triple {12077#(and (< main_~b~0 main_~a~0) (< main_~b~0 2))} assume !false; {12077#(and (< main_~b~0 main_~a~0) (< main_~b~0 2))} is VALID [2022-04-28 12:32:15,359 INFO L290 TraceCheckUtils]: 34: Hoare triple {12077#(and (< main_~b~0 main_~a~0) (< main_~b~0 2))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {12084#(and (< main_~b~0 main_~c~0) (< main_~b~0 2))} is VALID [2022-04-28 12:32:15,359 INFO L290 TraceCheckUtils]: 35: Hoare triple {12084#(and (< main_~b~0 main_~c~0) (< main_~b~0 2))} assume !false; {12084#(and (< main_~b~0 main_~c~0) (< main_~b~0 2))} is VALID [2022-04-28 12:32:15,360 INFO L290 TraceCheckUtils]: 36: Hoare triple {12084#(and (< main_~b~0 main_~c~0) (< main_~b~0 2))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {12091#(and (< main_~v~0 main_~c~0) (< main_~v~0 2))} is VALID [2022-04-28 12:32:15,360 INFO L290 TraceCheckUtils]: 37: Hoare triple {12091#(and (< main_~v~0 main_~c~0) (< main_~v~0 2))} assume !false; {12091#(and (< main_~v~0 main_~c~0) (< main_~v~0 2))} is VALID [2022-04-28 12:32:15,360 INFO L272 TraceCheckUtils]: 38: Hoare triple {12091#(and (< main_~v~0 main_~c~0) (< main_~v~0 2))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11971#true} is VALID [2022-04-28 12:32:15,360 INFO L290 TraceCheckUtils]: 39: Hoare triple {11971#true} ~cond := #in~cond; {11971#true} is VALID [2022-04-28 12:32:15,360 INFO L290 TraceCheckUtils]: 40: Hoare triple {11971#true} assume !(0 == ~cond); {11971#true} is VALID [2022-04-28 12:32:15,360 INFO L290 TraceCheckUtils]: 41: Hoare triple {11971#true} assume true; {11971#true} is VALID [2022-04-28 12:32:15,361 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {11971#true} {12091#(and (< main_~v~0 main_~c~0) (< main_~v~0 2))} #102#return; {12091#(and (< main_~v~0 main_~c~0) (< main_~v~0 2))} is VALID [2022-04-28 12:32:15,361 INFO L272 TraceCheckUtils]: 43: Hoare triple {12091#(and (< main_~v~0 main_~c~0) (< main_~v~0 2))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11971#true} is VALID [2022-04-28 12:32:15,361 INFO L290 TraceCheckUtils]: 44: Hoare triple {11971#true} ~cond := #in~cond; {11971#true} is VALID [2022-04-28 12:32:15,361 INFO L290 TraceCheckUtils]: 45: Hoare triple {11971#true} assume !(0 == ~cond); {11971#true} is VALID [2022-04-28 12:32:15,361 INFO L290 TraceCheckUtils]: 46: Hoare triple {11971#true} assume true; {11971#true} is VALID [2022-04-28 12:32:15,373 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {11971#true} {12091#(and (< main_~v~0 main_~c~0) (< main_~v~0 2))} #104#return; {12091#(and (< main_~v~0 main_~c~0) (< main_~v~0 2))} is VALID [2022-04-28 12:32:15,373 INFO L272 TraceCheckUtils]: 48: Hoare triple {12091#(and (< main_~v~0 main_~c~0) (< main_~v~0 2))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {11971#true} is VALID [2022-04-28 12:32:15,373 INFO L290 TraceCheckUtils]: 49: Hoare triple {11971#true} ~cond := #in~cond; {11971#true} is VALID [2022-04-28 12:32:15,373 INFO L290 TraceCheckUtils]: 50: Hoare triple {11971#true} assume !(0 == ~cond); {11971#true} is VALID [2022-04-28 12:32:15,373 INFO L290 TraceCheckUtils]: 51: Hoare triple {11971#true} assume true; {11971#true} is VALID [2022-04-28 12:32:15,373 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {11971#true} {12091#(and (< main_~v~0 main_~c~0) (< main_~v~0 2))} #106#return; {12091#(and (< main_~v~0 main_~c~0) (< main_~v~0 2))} is VALID [2022-04-28 12:32:15,373 INFO L272 TraceCheckUtils]: 53: Hoare triple {12091#(and (< main_~v~0 main_~c~0) (< main_~v~0 2))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {11971#true} is VALID [2022-04-28 12:32:15,373 INFO L290 TraceCheckUtils]: 54: Hoare triple {11971#true} ~cond := #in~cond; {11971#true} is VALID [2022-04-28 12:32:15,373 INFO L290 TraceCheckUtils]: 55: Hoare triple {11971#true} assume !(0 == ~cond); {11971#true} is VALID [2022-04-28 12:32:15,374 INFO L290 TraceCheckUtils]: 56: Hoare triple {11971#true} assume true; {11971#true} is VALID [2022-04-28 12:32:15,374 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {11971#true} {12091#(and (< main_~v~0 main_~c~0) (< main_~v~0 2))} #108#return; {12091#(and (< main_~v~0 main_~c~0) (< main_~v~0 2))} is VALID [2022-04-28 12:32:15,375 INFO L290 TraceCheckUtils]: 58: Hoare triple {12091#(and (< main_~v~0 main_~c~0) (< main_~v~0 2))} assume !(~c~0 >= 2 * ~v~0); {11972#false} is VALID [2022-04-28 12:32:15,375 INFO L290 TraceCheckUtils]: 59: Hoare triple {11972#false} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {11972#false} is VALID [2022-04-28 12:32:15,375 INFO L290 TraceCheckUtils]: 60: Hoare triple {11972#false} assume !false; {11972#false} is VALID [2022-04-28 12:32:15,375 INFO L290 TraceCheckUtils]: 61: Hoare triple {11972#false} assume !(~c~0 >= ~b~0); {11972#false} is VALID [2022-04-28 12:32:15,375 INFO L290 TraceCheckUtils]: 62: Hoare triple {11972#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {11972#false} is VALID [2022-04-28 12:32:15,375 INFO L290 TraceCheckUtils]: 63: Hoare triple {11972#false} assume !false; {11972#false} is VALID [2022-04-28 12:32:15,375 INFO L290 TraceCheckUtils]: 64: Hoare triple {11972#false} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {11972#false} is VALID [2022-04-28 12:32:15,375 INFO L290 TraceCheckUtils]: 65: Hoare triple {11972#false} assume !false; {11972#false} is VALID [2022-04-28 12:32:15,375 INFO L290 TraceCheckUtils]: 66: Hoare triple {11972#false} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {11972#false} is VALID [2022-04-28 12:32:15,375 INFO L290 TraceCheckUtils]: 67: Hoare triple {11972#false} assume !false; {11972#false} is VALID [2022-04-28 12:32:15,375 INFO L272 TraceCheckUtils]: 68: Hoare triple {11972#false} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11972#false} is VALID [2022-04-28 12:32:15,375 INFO L290 TraceCheckUtils]: 69: Hoare triple {11972#false} ~cond := #in~cond; {11972#false} is VALID [2022-04-28 12:32:15,375 INFO L290 TraceCheckUtils]: 70: Hoare triple {11972#false} assume 0 == ~cond; {11972#false} is VALID [2022-04-28 12:32:15,375 INFO L290 TraceCheckUtils]: 71: Hoare triple {11972#false} assume !false; {11972#false} is VALID [2022-04-28 12:32:15,376 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-04-28 12:32:15,376 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:32:15,961 INFO L290 TraceCheckUtils]: 71: Hoare triple {11972#false} assume !false; {11972#false} is VALID [2022-04-28 12:32:15,961 INFO L290 TraceCheckUtils]: 70: Hoare triple {11972#false} assume 0 == ~cond; {11972#false} is VALID [2022-04-28 12:32:15,961 INFO L290 TraceCheckUtils]: 69: Hoare triple {11972#false} ~cond := #in~cond; {11972#false} is VALID [2022-04-28 12:32:15,961 INFO L272 TraceCheckUtils]: 68: Hoare triple {11972#false} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11972#false} is VALID [2022-04-28 12:32:15,961 INFO L290 TraceCheckUtils]: 67: Hoare triple {11972#false} assume !false; {11972#false} is VALID [2022-04-28 12:32:15,961 INFO L290 TraceCheckUtils]: 66: Hoare triple {11972#false} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {11972#false} is VALID [2022-04-28 12:32:15,961 INFO L290 TraceCheckUtils]: 65: Hoare triple {11972#false} assume !false; {11972#false} is VALID [2022-04-28 12:32:15,961 INFO L290 TraceCheckUtils]: 64: Hoare triple {11972#false} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {11972#false} is VALID [2022-04-28 12:32:15,961 INFO L290 TraceCheckUtils]: 63: Hoare triple {11972#false} assume !false; {11972#false} is VALID [2022-04-28 12:32:15,961 INFO L290 TraceCheckUtils]: 62: Hoare triple {11972#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {11972#false} is VALID [2022-04-28 12:32:15,961 INFO L290 TraceCheckUtils]: 61: Hoare triple {11972#false} assume !(~c~0 >= ~b~0); {11972#false} is VALID [2022-04-28 12:32:15,961 INFO L290 TraceCheckUtils]: 60: Hoare triple {11972#false} assume !false; {11972#false} is VALID [2022-04-28 12:32:15,961 INFO L290 TraceCheckUtils]: 59: Hoare triple {11972#false} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {11972#false} is VALID [2022-04-28 12:32:15,962 INFO L290 TraceCheckUtils]: 58: Hoare triple {12236#(<= (* main_~v~0 2) main_~c~0)} assume !(~c~0 >= 2 * ~v~0); {11972#false} is VALID [2022-04-28 12:32:15,962 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {11971#true} {12236#(<= (* main_~v~0 2) main_~c~0)} #108#return; {12236#(<= (* main_~v~0 2) main_~c~0)} is VALID [2022-04-28 12:32:15,962 INFO L290 TraceCheckUtils]: 56: Hoare triple {11971#true} assume true; {11971#true} is VALID [2022-04-28 12:32:15,962 INFO L290 TraceCheckUtils]: 55: Hoare triple {11971#true} assume !(0 == ~cond); {11971#true} is VALID [2022-04-28 12:32:15,962 INFO L290 TraceCheckUtils]: 54: Hoare triple {11971#true} ~cond := #in~cond; {11971#true} is VALID [2022-04-28 12:32:15,962 INFO L272 TraceCheckUtils]: 53: Hoare triple {12236#(<= (* main_~v~0 2) main_~c~0)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {11971#true} is VALID [2022-04-28 12:32:15,963 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {11971#true} {12236#(<= (* main_~v~0 2) main_~c~0)} #106#return; {12236#(<= (* main_~v~0 2) main_~c~0)} is VALID [2022-04-28 12:32:15,963 INFO L290 TraceCheckUtils]: 51: Hoare triple {11971#true} assume true; {11971#true} is VALID [2022-04-28 12:32:15,963 INFO L290 TraceCheckUtils]: 50: Hoare triple {11971#true} assume !(0 == ~cond); {11971#true} is VALID [2022-04-28 12:32:15,963 INFO L290 TraceCheckUtils]: 49: Hoare triple {11971#true} ~cond := #in~cond; {11971#true} is VALID [2022-04-28 12:32:15,963 INFO L272 TraceCheckUtils]: 48: Hoare triple {12236#(<= (* main_~v~0 2) main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {11971#true} is VALID [2022-04-28 12:32:15,964 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {11971#true} {12236#(<= (* main_~v~0 2) main_~c~0)} #104#return; {12236#(<= (* main_~v~0 2) main_~c~0)} is VALID [2022-04-28 12:32:15,964 INFO L290 TraceCheckUtils]: 46: Hoare triple {11971#true} assume true; {11971#true} is VALID [2022-04-28 12:32:15,964 INFO L290 TraceCheckUtils]: 45: Hoare triple {11971#true} assume !(0 == ~cond); {11971#true} is VALID [2022-04-28 12:32:15,964 INFO L290 TraceCheckUtils]: 44: Hoare triple {11971#true} ~cond := #in~cond; {11971#true} is VALID [2022-04-28 12:32:15,964 INFO L272 TraceCheckUtils]: 43: Hoare triple {12236#(<= (* main_~v~0 2) main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11971#true} is VALID [2022-04-28 12:32:15,965 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {11971#true} {12236#(<= (* main_~v~0 2) main_~c~0)} #102#return; {12236#(<= (* main_~v~0 2) main_~c~0)} is VALID [2022-04-28 12:32:15,965 INFO L290 TraceCheckUtils]: 41: Hoare triple {11971#true} assume true; {11971#true} is VALID [2022-04-28 12:32:15,965 INFO L290 TraceCheckUtils]: 40: Hoare triple {11971#true} assume !(0 == ~cond); {11971#true} is VALID [2022-04-28 12:32:15,965 INFO L290 TraceCheckUtils]: 39: Hoare triple {11971#true} ~cond := #in~cond; {11971#true} is VALID [2022-04-28 12:32:15,965 INFO L272 TraceCheckUtils]: 38: Hoare triple {12236#(<= (* main_~v~0 2) main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11971#true} is VALID [2022-04-28 12:32:15,965 INFO L290 TraceCheckUtils]: 37: Hoare triple {12236#(<= (* main_~v~0 2) main_~c~0)} assume !false; {12236#(<= (* main_~v~0 2) main_~c~0)} is VALID [2022-04-28 12:32:15,966 INFO L290 TraceCheckUtils]: 36: Hoare triple {12303#(<= main_~b~0 (div main_~c~0 2))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {12236#(<= (* main_~v~0 2) main_~c~0)} is VALID [2022-04-28 12:32:15,966 INFO L290 TraceCheckUtils]: 35: Hoare triple {12303#(<= main_~b~0 (div main_~c~0 2))} assume !false; {12303#(<= main_~b~0 (div main_~c~0 2))} is VALID [2022-04-28 12:32:15,967 INFO L290 TraceCheckUtils]: 34: Hoare triple {12310#(<= main_~b~0 (+ (div (+ (- 2) main_~a~0) 2) 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {12303#(<= main_~b~0 (div main_~c~0 2))} is VALID [2022-04-28 12:32:15,967 INFO L290 TraceCheckUtils]: 33: Hoare triple {12310#(<= main_~b~0 (+ (div (+ (- 2) main_~a~0) 2) 1))} assume !false; {12310#(<= main_~b~0 (+ (div (+ (- 2) main_~a~0) 2) 1))} is VALID [2022-04-28 12:32:15,968 INFO L290 TraceCheckUtils]: 32: Hoare triple {12317#(<= main_~c~0 (+ (div (+ main_~b~0 (- 4)) 2) 2))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {12310#(<= main_~b~0 (+ (div (+ (- 2) main_~a~0) 2) 1))} is VALID [2022-04-28 12:32:15,968 INFO L290 TraceCheckUtils]: 31: Hoare triple {12060#(<= main_~b~0 2)} assume !(~c~0 >= ~b~0); {12317#(<= main_~c~0 (+ (div (+ main_~b~0 (- 4)) 2) 2))} is VALID [2022-04-28 12:32:15,969 INFO L290 TraceCheckUtils]: 30: Hoare triple {12060#(<= main_~b~0 2)} assume !false; {12060#(<= main_~b~0 2)} is VALID [2022-04-28 12:32:15,969 INFO L290 TraceCheckUtils]: 29: Hoare triple {12060#(<= main_~b~0 2)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {12060#(<= main_~b~0 2)} is VALID [2022-04-28 12:32:15,969 INFO L290 TraceCheckUtils]: 28: Hoare triple {12060#(<= main_~b~0 2)} assume !false; {12060#(<= main_~b~0 2)} is VALID [2022-04-28 12:32:15,969 INFO L290 TraceCheckUtils]: 27: Hoare triple {12333#(<= main_~y~0 2)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {12060#(<= main_~b~0 2)} is VALID [2022-04-28 12:32:15,970 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {11971#true} {12333#(<= main_~y~0 2)} #100#return; {12333#(<= main_~y~0 2)} is VALID [2022-04-28 12:32:15,970 INFO L290 TraceCheckUtils]: 25: Hoare triple {11971#true} assume true; {11971#true} is VALID [2022-04-28 12:32:15,970 INFO L290 TraceCheckUtils]: 24: Hoare triple {11971#true} assume !(0 == ~cond); {11971#true} is VALID [2022-04-28 12:32:15,970 INFO L290 TraceCheckUtils]: 23: Hoare triple {11971#true} ~cond := #in~cond; {11971#true} is VALID [2022-04-28 12:32:15,970 INFO L272 TraceCheckUtils]: 22: Hoare triple {12333#(<= main_~y~0 2)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11971#true} is VALID [2022-04-28 12:32:15,970 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {11971#true} {12333#(<= main_~y~0 2)} #98#return; {12333#(<= main_~y~0 2)} is VALID [2022-04-28 12:32:15,970 INFO L290 TraceCheckUtils]: 20: Hoare triple {11971#true} assume true; {11971#true} is VALID [2022-04-28 12:32:15,971 INFO L290 TraceCheckUtils]: 19: Hoare triple {11971#true} assume !(0 == ~cond); {11971#true} is VALID [2022-04-28 12:32:15,971 INFO L290 TraceCheckUtils]: 18: Hoare triple {11971#true} ~cond := #in~cond; {11971#true} is VALID [2022-04-28 12:32:15,971 INFO L272 TraceCheckUtils]: 17: Hoare triple {12333#(<= main_~y~0 2)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {11971#true} is VALID [2022-04-28 12:32:15,971 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {12019#(not (= |assume_abort_if_not_#in~cond| 0))} {11971#true} #96#return; {12333#(<= main_~y~0 2)} is VALID [2022-04-28 12:32:15,971 INFO L290 TraceCheckUtils]: 15: Hoare triple {12019#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {12019#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:32:15,972 INFO L290 TraceCheckUtils]: 14: Hoare triple {12376#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {12019#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:32:15,972 INFO L290 TraceCheckUtils]: 13: Hoare triple {11971#true} ~cond := #in~cond; {12376#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-28 12:32:15,972 INFO L272 TraceCheckUtils]: 12: Hoare triple {11971#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {11971#true} is VALID [2022-04-28 12:32:15,972 INFO L290 TraceCheckUtils]: 11: Hoare triple {11971#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {11971#true} is VALID [2022-04-28 12:32:15,972 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11971#true} {11971#true} #94#return; {11971#true} is VALID [2022-04-28 12:32:15,972 INFO L290 TraceCheckUtils]: 9: Hoare triple {11971#true} assume true; {11971#true} is VALID [2022-04-28 12:32:15,972 INFO L290 TraceCheckUtils]: 8: Hoare triple {11971#true} assume !(0 == ~cond); {11971#true} is VALID [2022-04-28 12:32:15,972 INFO L290 TraceCheckUtils]: 7: Hoare triple {11971#true} ~cond := #in~cond; {11971#true} is VALID [2022-04-28 12:32:15,972 INFO L272 TraceCheckUtils]: 6: Hoare triple {11971#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {11971#true} is VALID [2022-04-28 12:32:15,972 INFO L290 TraceCheckUtils]: 5: Hoare triple {11971#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {11971#true} is VALID [2022-04-28 12:32:15,972 INFO L272 TraceCheckUtils]: 4: Hoare triple {11971#true} call #t~ret6 := main(); {11971#true} is VALID [2022-04-28 12:32:15,972 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11971#true} {11971#true} #112#return; {11971#true} is VALID [2022-04-28 12:32:15,972 INFO L290 TraceCheckUtils]: 2: Hoare triple {11971#true} assume true; {11971#true} is VALID [2022-04-28 12:32:15,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {11971#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(11, 2);call #Ultimate.allocInit(12, 3); {11971#true} is VALID [2022-04-28 12:32:15,973 INFO L272 TraceCheckUtils]: 0: Hoare triple {11971#true} call ULTIMATE.init(); {11971#true} is VALID [2022-04-28 12:32:15,973 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 26 proven. 10 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-04-28 12:32:15,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:32:15,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719765449] [2022-04-28 12:32:15,973 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:32:15,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091970916] [2022-04-28 12:32:15,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091970916] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:32:15,973 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:32:15,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-04-28 12:32:15,973 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:32:15,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1463313340] [2022-04-28 12:32:15,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1463313340] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:32:15,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:32:15,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 12:32:15,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635533862] [2022-04-28 12:32:15,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:32:15,974 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 72 [2022-04-28 12:32:15,974 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:32:15,974 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 12:32:16,031 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-28 12:32:16,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 12:32:16,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:32:16,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 12:32:16,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-04-28 12:32:16,032 INFO L87 Difference]: Start difference. First operand 212 states and 299 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 12:32:17,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:32:17,319 INFO L93 Difference]: Finished difference Result 306 states and 427 transitions. [2022-04-28 12:32:17,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 12:32:17,319 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 72 [2022-04-28 12:32:17,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:32:17,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 12:32:17,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 112 transitions. [2022-04-28 12:32:17,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 12:32:17,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 112 transitions. [2022-04-28 12:32:17,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 112 transitions. [2022-04-28 12:32:17,416 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:32:17,420 INFO L225 Difference]: With dead ends: 306 [2022-04-28 12:32:17,420 INFO L226 Difference]: Without dead ends: 204 [2022-04-28 12:32:17,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2022-04-28 12:32:17,421 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 39 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 12:32:17,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 253 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 12:32:17,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-04-28 12:32:17,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 200. [2022-04-28 12:32:17,960 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:32:17,961 INFO L82 GeneralOperation]: Start isEquivalent. First operand 204 states. Second operand has 200 states, 107 states have (on average 1.1682242990654206) internal successors, (125), 113 states have internal predecessors, (125), 79 states have call successors, (79), 14 states have call predecessors, (79), 13 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-28 12:32:17,961 INFO L74 IsIncluded]: Start isIncluded. First operand 204 states. Second operand has 200 states, 107 states have (on average 1.1682242990654206) internal successors, (125), 113 states have internal predecessors, (125), 79 states have call successors, (79), 14 states have call predecessors, (79), 13 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-28 12:32:17,961 INFO L87 Difference]: Start difference. First operand 204 states. Second operand has 200 states, 107 states have (on average 1.1682242990654206) internal successors, (125), 113 states have internal predecessors, (125), 79 states have call successors, (79), 14 states have call predecessors, (79), 13 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-28 12:32:17,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:32:17,965 INFO L93 Difference]: Finished difference Result 204 states and 285 transitions. [2022-04-28 12:32:17,965 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 285 transitions. [2022-04-28 12:32:17,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:32:17,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:32:17,966 INFO L74 IsIncluded]: Start isIncluded. First operand has 200 states, 107 states have (on average 1.1682242990654206) internal successors, (125), 113 states have internal predecessors, (125), 79 states have call successors, (79), 14 states have call predecessors, (79), 13 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) Second operand 204 states. [2022-04-28 12:32:17,966 INFO L87 Difference]: Start difference. First operand has 200 states, 107 states have (on average 1.1682242990654206) internal successors, (125), 113 states have internal predecessors, (125), 79 states have call successors, (79), 14 states have call predecessors, (79), 13 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) Second operand 204 states. [2022-04-28 12:32:17,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:32:17,970 INFO L93 Difference]: Finished difference Result 204 states and 285 transitions. [2022-04-28 12:32:17,970 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 285 transitions. [2022-04-28 12:32:17,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:32:17,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:32:17,971 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:32:17,971 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:32:17,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 107 states have (on average 1.1682242990654206) internal successors, (125), 113 states have internal predecessors, (125), 79 states have call successors, (79), 14 states have call predecessors, (79), 13 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-28 12:32:17,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 281 transitions. [2022-04-28 12:32:17,976 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 281 transitions. Word has length 72 [2022-04-28 12:32:17,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:32:17,976 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 281 transitions. [2022-04-28 12:32:17,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 12:32:17,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 200 states and 281 transitions. [2022-04-28 12:32:18,434 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 281 edges. 281 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:32:18,434 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 281 transitions. [2022-04-28 12:32:18,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-28 12:32:18,435 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:32:18,435 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:32:18,451 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-28 12:32:18,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-28 12:32:18,639 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:32:18,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:32:18,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1679616651, now seen corresponding path program 1 times [2022-04-28 12:32:18,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:32:18,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1123525176] [2022-04-28 12:32:18,640 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:32:18,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1679616651, now seen corresponding path program 2 times [2022-04-28 12:32:18,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:32:18,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501763556] [2022-04-28 12:32:18,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:32:18,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:32:18,651 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:32:18,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1068483422] [2022-04-28 12:32:18,651 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:32:18,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:32:18,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:32:18,652 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-28 12:32:18,653 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-28 12:32:18,698 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:32:18,698 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:32:18,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 63 conjunts are in the unsatisfiable core [2022-04-28 12:32:18,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:32:18,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:32:19,969 INFO L272 TraceCheckUtils]: 0: Hoare triple {13852#true} call ULTIMATE.init(); {13852#true} is VALID [2022-04-28 12:32:19,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {13852#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(11, 2);call #Ultimate.allocInit(12, 3); {13852#true} is VALID [2022-04-28 12:32:19,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-28 12:32:19,969 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13852#true} {13852#true} #112#return; {13852#true} is VALID [2022-04-28 12:32:19,969 INFO L272 TraceCheckUtils]: 4: Hoare triple {13852#true} call #t~ret6 := main(); {13852#true} is VALID [2022-04-28 12:32:19,969 INFO L290 TraceCheckUtils]: 5: Hoare triple {13852#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {13852#true} is VALID [2022-04-28 12:32:19,969 INFO L272 TraceCheckUtils]: 6: Hoare triple {13852#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {13852#true} is VALID [2022-04-28 12:32:19,970 INFO L290 TraceCheckUtils]: 7: Hoare triple {13852#true} ~cond := #in~cond; {13878#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 12:32:19,970 INFO L290 TraceCheckUtils]: 8: Hoare triple {13878#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {13882#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:32:19,970 INFO L290 TraceCheckUtils]: 9: Hoare triple {13882#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {13882#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:32:19,971 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13882#(not (= |assume_abort_if_not_#in~cond| 0))} {13852#true} #94#return; {13889#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 12:32:19,971 INFO L290 TraceCheckUtils]: 11: Hoare triple {13889#(and (<= 0 main_~x~0) (<= main_~x~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {13889#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 12:32:19,971 INFO L272 TraceCheckUtils]: 12: Hoare triple {13889#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {13852#true} is VALID [2022-04-28 12:32:19,971 INFO L290 TraceCheckUtils]: 13: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-28 12:32:19,971 INFO L290 TraceCheckUtils]: 14: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-28 12:32:19,971 INFO L290 TraceCheckUtils]: 15: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-28 12:32:19,971 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13852#true} {13889#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #96#return; {13889#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 12:32:19,972 INFO L272 TraceCheckUtils]: 17: Hoare triple {13889#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {13852#true} is VALID [2022-04-28 12:32:19,972 INFO L290 TraceCheckUtils]: 18: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-28 12:32:19,972 INFO L290 TraceCheckUtils]: 19: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-28 12:32:19,972 INFO L290 TraceCheckUtils]: 20: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-28 12:32:19,972 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {13852#true} {13889#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #98#return; {13889#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 12:32:19,972 INFO L272 TraceCheckUtils]: 22: Hoare triple {13889#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {13852#true} is VALID [2022-04-28 12:32:19,972 INFO L290 TraceCheckUtils]: 23: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-28 12:32:19,972 INFO L290 TraceCheckUtils]: 24: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-28 12:32:19,972 INFO L290 TraceCheckUtils]: 25: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-28 12:32:19,973 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {13852#true} {13889#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #100#return; {13889#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 12:32:19,973 INFO L290 TraceCheckUtils]: 27: Hoare triple {13889#(and (<= 0 main_~x~0) (<= main_~x~0 2))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {13941#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-28 12:32:19,973 INFO L290 TraceCheckUtils]: 28: Hoare triple {13941#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} assume !false; {13941#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-28 12:32:19,974 INFO L290 TraceCheckUtils]: 29: Hoare triple {13941#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {13948#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-28 12:32:19,974 INFO L290 TraceCheckUtils]: 30: Hoare triple {13948#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} assume !false; {13948#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-28 12:32:19,974 INFO L290 TraceCheckUtils]: 31: Hoare triple {13948#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {13955#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-28 12:32:19,975 INFO L290 TraceCheckUtils]: 32: Hoare triple {13955#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} assume !false; {13955#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-28 12:32:19,975 INFO L272 TraceCheckUtils]: 33: Hoare triple {13955#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {13852#true} is VALID [2022-04-28 12:32:19,975 INFO L290 TraceCheckUtils]: 34: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-28 12:32:19,975 INFO L290 TraceCheckUtils]: 35: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-28 12:32:19,975 INFO L290 TraceCheckUtils]: 36: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-28 12:32:19,976 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {13852#true} {13955#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #102#return; {13955#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-28 12:32:19,976 INFO L272 TraceCheckUtils]: 38: Hoare triple {13955#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {13852#true} is VALID [2022-04-28 12:32:19,976 INFO L290 TraceCheckUtils]: 39: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-28 12:32:19,976 INFO L290 TraceCheckUtils]: 40: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-28 12:32:19,976 INFO L290 TraceCheckUtils]: 41: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-28 12:32:19,977 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {13852#true} {13955#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #104#return; {13955#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-28 12:32:19,977 INFO L272 TraceCheckUtils]: 43: Hoare triple {13955#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {13852#true} is VALID [2022-04-28 12:32:19,977 INFO L290 TraceCheckUtils]: 44: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-28 12:32:19,977 INFO L290 TraceCheckUtils]: 45: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-28 12:32:19,977 INFO L290 TraceCheckUtils]: 46: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-28 12:32:19,978 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {13852#true} {13955#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #106#return; {13955#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-28 12:32:19,978 INFO L272 TraceCheckUtils]: 48: Hoare triple {13955#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {13852#true} is VALID [2022-04-28 12:32:19,978 INFO L290 TraceCheckUtils]: 49: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-28 12:32:19,978 INFO L290 TraceCheckUtils]: 50: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-28 12:32:19,978 INFO L290 TraceCheckUtils]: 51: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-28 12:32:19,978 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {13852#true} {13955#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #108#return; {13955#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-28 12:32:19,979 INFO L290 TraceCheckUtils]: 53: Hoare triple {13955#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {14022#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-28 12:32:19,979 INFO L290 TraceCheckUtils]: 54: Hoare triple {14022#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} assume !false; {14022#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-28 12:32:19,979 INFO L272 TraceCheckUtils]: 55: Hoare triple {14022#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {13852#true} is VALID [2022-04-28 12:32:19,980 INFO L290 TraceCheckUtils]: 56: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-28 12:32:19,980 INFO L290 TraceCheckUtils]: 57: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-28 12:32:19,980 INFO L290 TraceCheckUtils]: 58: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-28 12:32:19,980 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {13852#true} {14022#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #102#return; {14022#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-28 12:32:19,980 INFO L272 TraceCheckUtils]: 60: Hoare triple {14022#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {13852#true} is VALID [2022-04-28 12:32:19,981 INFO L290 TraceCheckUtils]: 61: Hoare triple {13852#true} ~cond := #in~cond; {14047#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:32:19,981 INFO L290 TraceCheckUtils]: 62: Hoare triple {14047#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {14051#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:32:19,981 INFO L290 TraceCheckUtils]: 63: Hoare triple {14051#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {14051#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:32:19,982 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {14051#(not (= |__VERIFIER_assert_#in~cond| 0))} {14022#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #104#return; {14022#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-28 12:32:19,982 INFO L272 TraceCheckUtils]: 65: Hoare triple {14022#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {13852#true} is VALID [2022-04-28 12:32:19,982 INFO L290 TraceCheckUtils]: 66: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-28 12:32:19,982 INFO L290 TraceCheckUtils]: 67: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-28 12:32:19,982 INFO L290 TraceCheckUtils]: 68: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-28 12:32:19,983 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {13852#true} {14022#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #106#return; {14022#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-28 12:32:19,983 INFO L272 TraceCheckUtils]: 70: Hoare triple {14022#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {13852#true} is VALID [2022-04-28 12:32:19,983 INFO L290 TraceCheckUtils]: 71: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-28 12:32:19,983 INFO L290 TraceCheckUtils]: 72: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-28 12:32:19,983 INFO L290 TraceCheckUtils]: 73: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-28 12:32:19,984 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {13852#true} {14022#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #108#return; {14022#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-28 12:32:19,984 INFO L290 TraceCheckUtils]: 75: Hoare triple {14022#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} assume !(~c~0 >= 2 * ~v~0); {14022#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-28 12:32:19,985 INFO L290 TraceCheckUtils]: 76: Hoare triple {14022#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {14094#(and (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 2) (= main_~q~0 0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-28 12:32:19,985 INFO L290 TraceCheckUtils]: 77: Hoare triple {14094#(and (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 2) (= main_~q~0 0) (<= main_~x~0 2) (= main_~p~0 1))} assume !false; {14094#(and (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 2) (= main_~q~0 0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-28 12:32:19,986 INFO L290 TraceCheckUtils]: 78: Hoare triple {14094#(and (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 2) (= main_~q~0 0) (<= main_~x~0 2) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {14101#(and (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 2) (= main_~q~0 0) (< main_~c~0 main_~b~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-28 12:32:19,987 INFO L290 TraceCheckUtils]: 79: Hoare triple {14101#(and (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 2) (= main_~q~0 0) (< main_~c~0 main_~b~0) (<= main_~x~0 2) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {14105#(and (<= (* main_~y~0 2) main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ (* main_~p~0 2) main_~q~0) 1) (< main_~x~0 (* main_~y~0 3)) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))) (<= main_~x~0 2) (= (+ main_~s~0 (* main_~r~0 2)) 0))} is VALID [2022-04-28 12:32:19,987 INFO L290 TraceCheckUtils]: 80: Hoare triple {14105#(and (<= (* main_~y~0 2) main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ (* main_~p~0 2) main_~q~0) 1) (< main_~x~0 (* main_~y~0 3)) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))) (<= main_~x~0 2) (= (+ main_~s~0 (* main_~r~0 2)) 0))} assume !false; {14105#(and (<= (* main_~y~0 2) main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ (* main_~p~0 2) main_~q~0) 1) (< main_~x~0 (* main_~y~0 3)) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))) (<= main_~x~0 2) (= (+ main_~s~0 (* main_~r~0 2)) 0))} is VALID [2022-04-28 12:32:19,987 INFO L290 TraceCheckUtils]: 81: Hoare triple {14105#(and (<= (* main_~y~0 2) main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ (* main_~p~0 2) main_~q~0) 1) (< main_~x~0 (* main_~y~0 3)) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))) (<= main_~x~0 2) (= (+ main_~s~0 (* main_~r~0 2)) 0))} assume !(0 != ~b~0); {14112#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ (* main_~p~0 2) main_~q~0) 1) (= main_~x~0 (* main_~y~0 2)) (< main_~x~0 (* main_~y~0 3)) (<= main_~x~0 2) (= (+ main_~s~0 (* main_~r~0 2)) 0))} is VALID [2022-04-28 12:32:19,988 INFO L272 TraceCheckUtils]: 82: Hoare triple {14112#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ (* main_~p~0 2) main_~q~0) 1) (= main_~x~0 (* main_~y~0 2)) (< main_~x~0 (* main_~y~0 3)) (<= main_~x~0 2) (= (+ main_~s~0 (* main_~r~0 2)) 0))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {14116#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:32:19,988 INFO L290 TraceCheckUtils]: 83: Hoare triple {14116#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14120#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:32:19,989 INFO L290 TraceCheckUtils]: 84: Hoare triple {14120#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13853#false} is VALID [2022-04-28 12:32:19,989 INFO L290 TraceCheckUtils]: 85: Hoare triple {13853#false} assume !false; {13853#false} is VALID [2022-04-28 12:32:19,989 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 30 proven. 26 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-04-28 12:32:19,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:32:45,342 INFO L290 TraceCheckUtils]: 85: Hoare triple {13853#false} assume !false; {13853#false} is VALID [2022-04-28 12:32:45,342 INFO L290 TraceCheckUtils]: 84: Hoare triple {14120#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13853#false} is VALID [2022-04-28 12:32:45,343 INFO L290 TraceCheckUtils]: 83: Hoare triple {14116#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14120#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:32:45,343 INFO L272 TraceCheckUtils]: 82: Hoare triple {14136#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {14116#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:32:45,344 INFO L290 TraceCheckUtils]: 81: Hoare triple {14140#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} assume !(0 != ~b~0); {14136#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:32:45,344 INFO L290 TraceCheckUtils]: 80: Hoare triple {14140#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} assume !false; {14140#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-28 12:32:45,949 INFO L290 TraceCheckUtils]: 79: Hoare triple {14147#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {14140#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-28 12:32:45,950 INFO L290 TraceCheckUtils]: 78: Hoare triple {14151#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= ~b~0); {14147#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:32:45,951 INFO L290 TraceCheckUtils]: 77: Hoare triple {14151#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !false; {14151#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:32:46,104 INFO L290 TraceCheckUtils]: 76: Hoare triple {14158#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {14151#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:32:46,104 INFO L290 TraceCheckUtils]: 75: Hoare triple {14158#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= 2 * ~v~0); {14158#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:32:46,105 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {13852#true} {14158#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #108#return; {14158#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:32:46,105 INFO L290 TraceCheckUtils]: 73: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-28 12:32:46,105 INFO L290 TraceCheckUtils]: 72: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-28 12:32:46,105 INFO L290 TraceCheckUtils]: 71: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-28 12:32:46,105 INFO L272 TraceCheckUtils]: 70: Hoare triple {14158#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {13852#true} is VALID [2022-04-28 12:32:46,106 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {13852#true} {14158#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #106#return; {14158#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:32:46,106 INFO L290 TraceCheckUtils]: 68: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-28 12:32:46,106 INFO L290 TraceCheckUtils]: 67: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-28 12:32:46,106 INFO L290 TraceCheckUtils]: 66: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-28 12:32:46,106 INFO L272 TraceCheckUtils]: 65: Hoare triple {14158#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {13852#true} is VALID [2022-04-28 12:32:46,107 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {14051#(not (= |__VERIFIER_assert_#in~cond| 0))} {14195#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #104#return; {14158#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:32:46,107 INFO L290 TraceCheckUtils]: 63: Hoare triple {14051#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {14051#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:32:46,108 INFO L290 TraceCheckUtils]: 62: Hoare triple {14205#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {14051#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:32:46,108 INFO L290 TraceCheckUtils]: 61: Hoare triple {13852#true} ~cond := #in~cond; {14205#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 12:32:46,108 INFO L272 TraceCheckUtils]: 60: Hoare triple {14195#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {13852#true} is VALID [2022-04-28 12:32:46,109 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {13852#true} {14195#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #102#return; {14195#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:32:46,109 INFO L290 TraceCheckUtils]: 58: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-28 12:32:46,109 INFO L290 TraceCheckUtils]: 57: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-28 12:32:46,109 INFO L290 TraceCheckUtils]: 56: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-28 12:32:46,109 INFO L272 TraceCheckUtils]: 55: Hoare triple {14195#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {13852#true} is VALID [2022-04-28 12:32:46,109 INFO L290 TraceCheckUtils]: 54: Hoare triple {14195#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !false; {14195#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:32:46,114 INFO L290 TraceCheckUtils]: 53: Hoare triple {14230#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {14195#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:32:46,114 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {13852#true} {14230#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0))} #108#return; {14230#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0))} is VALID [2022-04-28 12:32:46,114 INFO L290 TraceCheckUtils]: 51: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-28 12:32:46,114 INFO L290 TraceCheckUtils]: 50: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-28 12:32:46,115 INFO L290 TraceCheckUtils]: 49: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-28 12:32:46,115 INFO L272 TraceCheckUtils]: 48: Hoare triple {14230#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {13852#true} is VALID [2022-04-28 12:32:46,115 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {13852#true} {14230#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0))} #106#return; {14230#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0))} is VALID [2022-04-28 12:32:46,115 INFO L290 TraceCheckUtils]: 46: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-28 12:32:46,115 INFO L290 TraceCheckUtils]: 45: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-28 12:32:46,115 INFO L290 TraceCheckUtils]: 44: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-28 12:32:46,115 INFO L272 TraceCheckUtils]: 43: Hoare triple {14230#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {13852#true} is VALID [2022-04-28 12:32:46,116 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {13852#true} {14230#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0))} #104#return; {14230#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0))} is VALID [2022-04-28 12:32:46,116 INFO L290 TraceCheckUtils]: 41: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-28 12:32:46,116 INFO L290 TraceCheckUtils]: 40: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-28 12:32:46,116 INFO L290 TraceCheckUtils]: 39: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-28 12:32:46,116 INFO L272 TraceCheckUtils]: 38: Hoare triple {14230#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {13852#true} is VALID [2022-04-28 12:32:46,117 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {13852#true} {14230#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0))} #102#return; {14230#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0))} is VALID [2022-04-28 12:32:46,117 INFO L290 TraceCheckUtils]: 36: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-28 12:32:46,117 INFO L290 TraceCheckUtils]: 35: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-28 12:32:46,117 INFO L290 TraceCheckUtils]: 34: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-28 12:32:46,117 INFO L272 TraceCheckUtils]: 33: Hoare triple {14230#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {13852#true} is VALID [2022-04-28 12:32:46,118 INFO L290 TraceCheckUtils]: 32: Hoare triple {14230#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0))} assume !false; {14230#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0))} is VALID [2022-04-28 12:32:46,118 INFO L290 TraceCheckUtils]: 31: Hoare triple {14297#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* 2 (* main_~y~0 main_~s~0 1)) (* 2 (* main_~q~0 main_~x~0 1)) (* main_~y~0 main_~s~0))) (not (= main_~c~0 (* main_~b~0 2))) (<= main_~b~0 0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {14230#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0))} is VALID [2022-04-28 12:32:46,119 INFO L290 TraceCheckUtils]: 30: Hoare triple {14297#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* 2 (* main_~y~0 main_~s~0 1)) (* 2 (* main_~q~0 main_~x~0 1)) (* main_~y~0 main_~s~0))) (not (= main_~c~0 (* main_~b~0 2))) (<= main_~b~0 0))} assume !false; {14297#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* 2 (* main_~y~0 main_~s~0 1)) (* 2 (* main_~q~0 main_~x~0 1)) (* main_~y~0 main_~s~0))) (not (= main_~c~0 (* main_~b~0 2))) (<= main_~b~0 0))} is VALID [2022-04-28 12:32:46,119 INFO L290 TraceCheckUtils]: 29: Hoare triple {14304#(or (not (= main_~a~0 (* main_~b~0 2))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 0) (* 2 (* main_~y~0 main_~s~0 1)) (* 2 (* main_~q~0 main_~x~0 1)) (* main_~y~0 main_~s~0 0) (* main_~y~0 main_~s~0))))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {14297#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* 2 (* main_~y~0 main_~s~0 1)) (* 2 (* main_~q~0 main_~x~0 1)) (* main_~y~0 main_~s~0))) (not (= main_~c~0 (* main_~b~0 2))) (<= main_~b~0 0))} is VALID [2022-04-28 12:32:46,120 INFO L290 TraceCheckUtils]: 28: Hoare triple {14304#(or (not (= main_~a~0 (* main_~b~0 2))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 0) (* 2 (* main_~y~0 main_~s~0 1)) (* 2 (* main_~q~0 main_~x~0 1)) (* main_~y~0 main_~s~0 0) (* main_~y~0 main_~s~0))))} assume !false; {14304#(or (not (= main_~a~0 (* main_~b~0 2))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 0) (* 2 (* main_~y~0 main_~s~0 1)) (* 2 (* main_~q~0 main_~x~0 1)) (* main_~y~0 main_~s~0 0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:32:46,120 INFO L290 TraceCheckUtils]: 27: Hoare triple {13852#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {14304#(or (not (= main_~a~0 (* main_~b~0 2))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 0) (* 2 (* main_~y~0 main_~s~0 1)) (* 2 (* main_~q~0 main_~x~0 1)) (* main_~y~0 main_~s~0 0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:32:46,120 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {13852#true} {13852#true} #100#return; {13852#true} is VALID [2022-04-28 12:32:46,120 INFO L290 TraceCheckUtils]: 25: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-28 12:32:46,120 INFO L290 TraceCheckUtils]: 24: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-28 12:32:46,120 INFO L290 TraceCheckUtils]: 23: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-28 12:32:46,120 INFO L272 TraceCheckUtils]: 22: Hoare triple {13852#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {13852#true} is VALID [2022-04-28 12:32:46,121 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {13852#true} {13852#true} #98#return; {13852#true} is VALID [2022-04-28 12:32:46,121 INFO L290 TraceCheckUtils]: 20: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-28 12:32:46,121 INFO L290 TraceCheckUtils]: 19: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-28 12:32:46,121 INFO L290 TraceCheckUtils]: 18: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-28 12:32:46,121 INFO L272 TraceCheckUtils]: 17: Hoare triple {13852#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {13852#true} is VALID [2022-04-28 12:32:46,121 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13852#true} {13852#true} #96#return; {13852#true} is VALID [2022-04-28 12:32:46,121 INFO L290 TraceCheckUtils]: 15: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-28 12:32:46,121 INFO L290 TraceCheckUtils]: 14: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-28 12:32:46,121 INFO L290 TraceCheckUtils]: 13: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-28 12:32:46,121 INFO L272 TraceCheckUtils]: 12: Hoare triple {13852#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {13852#true} is VALID [2022-04-28 12:32:46,121 INFO L290 TraceCheckUtils]: 11: Hoare triple {13852#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {13852#true} is VALID [2022-04-28 12:32:46,121 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13852#true} {13852#true} #94#return; {13852#true} is VALID [2022-04-28 12:32:46,121 INFO L290 TraceCheckUtils]: 9: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-28 12:32:46,121 INFO L290 TraceCheckUtils]: 8: Hoare triple {13852#true} assume !(0 == ~cond); {13852#true} is VALID [2022-04-28 12:32:46,121 INFO L290 TraceCheckUtils]: 7: Hoare triple {13852#true} ~cond := #in~cond; {13852#true} is VALID [2022-04-28 12:32:46,121 INFO L272 TraceCheckUtils]: 6: Hoare triple {13852#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {13852#true} is VALID [2022-04-28 12:32:46,121 INFO L290 TraceCheckUtils]: 5: Hoare triple {13852#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {13852#true} is VALID [2022-04-28 12:32:46,121 INFO L272 TraceCheckUtils]: 4: Hoare triple {13852#true} call #t~ret6 := main(); {13852#true} is VALID [2022-04-28 12:32:46,121 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13852#true} {13852#true} #112#return; {13852#true} is VALID [2022-04-28 12:32:46,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {13852#true} assume true; {13852#true} is VALID [2022-04-28 12:32:46,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {13852#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(11, 2);call #Ultimate.allocInit(12, 3); {13852#true} is VALID [2022-04-28 12:32:46,122 INFO L272 TraceCheckUtils]: 0: Hoare triple {13852#true} call ULTIMATE.init(); {13852#true} is VALID [2022-04-28 12:32:46,122 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 30 proven. 17 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-04-28 12:32:46,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:32:46,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501763556] [2022-04-28 12:32:46,122 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:32:46,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068483422] [2022-04-28 12:32:46,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068483422] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:32:46,122 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:32:46,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 27 [2022-04-28 12:32:46,123 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:32:46,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1123525176] [2022-04-28 12:32:46,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1123525176] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:32:46,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:32:46,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 12:32:46,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317338904] [2022-04-28 12:32:46,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:32:46,123 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 86 [2022-04-28 12:32:46,124 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:32:46,124 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 12:32:46,173 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:32:46,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 12:32:46,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:32:46,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 12:32:46,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=591, Unknown=0, NotChecked=0, Total=702 [2022-04-28 12:32:46,174 INFO L87 Difference]: Start difference. First operand 200 states and 281 transitions. Second operand has 17 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 12:32:48,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:32:48,938 INFO L93 Difference]: Finished difference Result 285 states and 397 transitions. [2022-04-28 12:32:48,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 12:32:48,938 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 86 [2022-04-28 12:32:48,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:32:48,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 12:32:48,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 151 transitions. [2022-04-28 12:32:48,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 12:32:48,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 151 transitions. [2022-04-28 12:32:48,941 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 151 transitions. [2022-04-28 12:32:49,093 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:32:49,097 INFO L225 Difference]: With dead ends: 285 [2022-04-28 12:32:49,097 INFO L226 Difference]: Without dead ends: 231 [2022-04-28 12:32:49,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 145 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=190, Invalid=1000, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 12:32:49,099 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 59 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 12:32:49,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 196 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 12:32:49,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-04-28 12:32:49,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 228. [2022-04-28 12:32:49,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:32:49,803 INFO L82 GeneralOperation]: Start isEquivalent. First operand 231 states. Second operand has 228 states, 121 states have (on average 1.165289256198347) internal successors, (141), 128 states have internal predecessors, (141), 91 states have call successors, (91), 16 states have call predecessors, (91), 15 states have return successors, (89), 83 states have call predecessors, (89), 89 states have call successors, (89) [2022-04-28 12:32:49,804 INFO L74 IsIncluded]: Start isIncluded. First operand 231 states. Second operand has 228 states, 121 states have (on average 1.165289256198347) internal successors, (141), 128 states have internal predecessors, (141), 91 states have call successors, (91), 16 states have call predecessors, (91), 15 states have return successors, (89), 83 states have call predecessors, (89), 89 states have call successors, (89) [2022-04-28 12:32:49,804 INFO L87 Difference]: Start difference. First operand 231 states. Second operand has 228 states, 121 states have (on average 1.165289256198347) internal successors, (141), 128 states have internal predecessors, (141), 91 states have call successors, (91), 16 states have call predecessors, (91), 15 states have return successors, (89), 83 states have call predecessors, (89), 89 states have call successors, (89) [2022-04-28 12:32:49,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:32:49,809 INFO L93 Difference]: Finished difference Result 231 states and 324 transitions. [2022-04-28 12:32:49,809 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 324 transitions. [2022-04-28 12:32:49,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:32:49,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:32:49,810 INFO L74 IsIncluded]: Start isIncluded. First operand has 228 states, 121 states have (on average 1.165289256198347) internal successors, (141), 128 states have internal predecessors, (141), 91 states have call successors, (91), 16 states have call predecessors, (91), 15 states have return successors, (89), 83 states have call predecessors, (89), 89 states have call successors, (89) Second operand 231 states. [2022-04-28 12:32:49,810 INFO L87 Difference]: Start difference. First operand has 228 states, 121 states have (on average 1.165289256198347) internal successors, (141), 128 states have internal predecessors, (141), 91 states have call successors, (91), 16 states have call predecessors, (91), 15 states have return successors, (89), 83 states have call predecessors, (89), 89 states have call successors, (89) Second operand 231 states. [2022-04-28 12:32:49,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:32:49,814 INFO L93 Difference]: Finished difference Result 231 states and 324 transitions. [2022-04-28 12:32:49,814 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 324 transitions. [2022-04-28 12:32:49,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:32:49,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:32:49,815 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:32:49,815 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:32:49,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 121 states have (on average 1.165289256198347) internal successors, (141), 128 states have internal predecessors, (141), 91 states have call successors, (91), 16 states have call predecessors, (91), 15 states have return successors, (89), 83 states have call predecessors, (89), 89 states have call successors, (89) [2022-04-28 12:32:49,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 321 transitions. [2022-04-28 12:32:49,820 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 321 transitions. Word has length 86 [2022-04-28 12:32:49,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:32:49,821 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 321 transitions. [2022-04-28 12:32:49,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 12:32:49,821 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 228 states and 321 transitions. [2022-04-28 12:32:50,353 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 321 edges. 321 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:32:50,353 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 321 transitions. [2022-04-28 12:32:50,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-28 12:32:50,354 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:32:50,354 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:32:50,376 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-28 12:32:50,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 12:32:50,555 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:32:50,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:32:50,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1654964248, now seen corresponding path program 5 times [2022-04-28 12:32:50,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:32:50,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [972220402] [2022-04-28 12:32:50,556 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:32:50,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1654964248, now seen corresponding path program 6 times [2022-04-28 12:32:50,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:32:50,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237582548] [2022-04-28 12:32:50,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:32:50,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:32:50,577 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:32:50,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1457801405] [2022-04-28 12:32:50,577 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 12:32:50,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:32:50,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:32:50,578 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-28 12:32:50,579 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-28 12:32:50,632 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 12:32:50,633 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:32:50,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 12:32:50,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:32:50,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:32:50,884 INFO L272 TraceCheckUtils]: 0: Hoare triple {15898#true} call ULTIMATE.init(); {15898#true} is VALID [2022-04-28 12:32:50,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {15898#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(11, 2);call #Ultimate.allocInit(12, 3); {15898#true} is VALID [2022-04-28 12:32:50,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-28 12:32:50,885 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15898#true} {15898#true} #112#return; {15898#true} is VALID [2022-04-28 12:32:50,885 INFO L272 TraceCheckUtils]: 4: Hoare triple {15898#true} call #t~ret6 := main(); {15898#true} is VALID [2022-04-28 12:32:50,885 INFO L290 TraceCheckUtils]: 5: Hoare triple {15898#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {15898#true} is VALID [2022-04-28 12:32:50,885 INFO L272 TraceCheckUtils]: 6: Hoare triple {15898#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {15898#true} is VALID [2022-04-28 12:32:50,885 INFO L290 TraceCheckUtils]: 7: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-28 12:32:50,885 INFO L290 TraceCheckUtils]: 8: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-28 12:32:50,885 INFO L290 TraceCheckUtils]: 9: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-28 12:32:50,885 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15898#true} {15898#true} #94#return; {15898#true} is VALID [2022-04-28 12:32:50,885 INFO L290 TraceCheckUtils]: 11: Hoare triple {15898#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {15898#true} is VALID [2022-04-28 12:32:50,885 INFO L272 TraceCheckUtils]: 12: Hoare triple {15898#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {15898#true} is VALID [2022-04-28 12:32:50,885 INFO L290 TraceCheckUtils]: 13: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-28 12:32:50,885 INFO L290 TraceCheckUtils]: 14: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-28 12:32:50,885 INFO L290 TraceCheckUtils]: 15: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-28 12:32:50,885 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {15898#true} {15898#true} #96#return; {15898#true} is VALID [2022-04-28 12:32:50,885 INFO L272 TraceCheckUtils]: 17: Hoare triple {15898#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {15898#true} is VALID [2022-04-28 12:32:50,886 INFO L290 TraceCheckUtils]: 18: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-28 12:32:50,886 INFO L290 TraceCheckUtils]: 19: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-28 12:32:50,886 INFO L290 TraceCheckUtils]: 20: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-28 12:32:50,886 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {15898#true} {15898#true} #98#return; {15898#true} is VALID [2022-04-28 12:32:50,886 INFO L272 TraceCheckUtils]: 22: Hoare triple {15898#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {15898#true} is VALID [2022-04-28 12:32:50,886 INFO L290 TraceCheckUtils]: 23: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-28 12:32:50,886 INFO L290 TraceCheckUtils]: 24: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-28 12:32:50,886 INFO L290 TraceCheckUtils]: 25: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-28 12:32:50,886 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {15898#true} {15898#true} #100#return; {15898#true} is VALID [2022-04-28 12:32:50,886 INFO L290 TraceCheckUtils]: 27: Hoare triple {15898#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {15898#true} is VALID [2022-04-28 12:32:50,886 INFO L290 TraceCheckUtils]: 28: Hoare triple {15898#true} assume !false; {15898#true} is VALID [2022-04-28 12:32:50,886 INFO L290 TraceCheckUtils]: 29: Hoare triple {15898#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {15898#true} is VALID [2022-04-28 12:32:50,886 INFO L290 TraceCheckUtils]: 30: Hoare triple {15898#true} assume !false; {15898#true} is VALID [2022-04-28 12:32:50,886 INFO L290 TraceCheckUtils]: 31: Hoare triple {15898#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {15996#(<= main_~v~0 main_~b~0)} is VALID [2022-04-28 12:32:50,887 INFO L290 TraceCheckUtils]: 32: Hoare triple {15996#(<= main_~v~0 main_~b~0)} assume !false; {15996#(<= main_~v~0 main_~b~0)} is VALID [2022-04-28 12:32:50,887 INFO L272 TraceCheckUtils]: 33: Hoare triple {15996#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {15898#true} is VALID [2022-04-28 12:32:50,887 INFO L290 TraceCheckUtils]: 34: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-28 12:32:50,887 INFO L290 TraceCheckUtils]: 35: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-28 12:32:50,887 INFO L290 TraceCheckUtils]: 36: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-28 12:32:50,887 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {15898#true} {15996#(<= main_~v~0 main_~b~0)} #102#return; {15996#(<= main_~v~0 main_~b~0)} is VALID [2022-04-28 12:32:50,888 INFO L272 TraceCheckUtils]: 38: Hoare triple {15996#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {15898#true} is VALID [2022-04-28 12:32:50,888 INFO L290 TraceCheckUtils]: 39: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-28 12:32:50,888 INFO L290 TraceCheckUtils]: 40: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-28 12:32:50,888 INFO L290 TraceCheckUtils]: 41: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-28 12:32:50,888 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {15898#true} {15996#(<= main_~v~0 main_~b~0)} #104#return; {15996#(<= main_~v~0 main_~b~0)} is VALID [2022-04-28 12:32:50,888 INFO L272 TraceCheckUtils]: 43: Hoare triple {15996#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {15898#true} is VALID [2022-04-28 12:32:50,888 INFO L290 TraceCheckUtils]: 44: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-28 12:32:50,888 INFO L290 TraceCheckUtils]: 45: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-28 12:32:50,888 INFO L290 TraceCheckUtils]: 46: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-28 12:32:50,889 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {15898#true} {15996#(<= main_~v~0 main_~b~0)} #106#return; {15996#(<= main_~v~0 main_~b~0)} is VALID [2022-04-28 12:32:50,889 INFO L272 TraceCheckUtils]: 48: Hoare triple {15996#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {15898#true} is VALID [2022-04-28 12:32:50,889 INFO L290 TraceCheckUtils]: 49: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-28 12:32:50,889 INFO L290 TraceCheckUtils]: 50: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-28 12:32:50,889 INFO L290 TraceCheckUtils]: 51: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-28 12:32:50,889 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {15898#true} {15996#(<= main_~v~0 main_~b~0)} #108#return; {15996#(<= main_~v~0 main_~b~0)} is VALID [2022-04-28 12:32:50,890 INFO L290 TraceCheckUtils]: 53: Hoare triple {15996#(<= main_~v~0 main_~b~0)} assume !(~c~0 >= 2 * ~v~0); {16063#(and (<= main_~v~0 main_~b~0) (not (<= (* main_~v~0 2) main_~c~0)))} is VALID [2022-04-28 12:32:50,890 INFO L290 TraceCheckUtils]: 54: Hoare triple {16063#(and (<= main_~v~0 main_~b~0) (not (<= (* main_~v~0 2) main_~c~0)))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {16067#(< main_~c~0 main_~b~0)} is VALID [2022-04-28 12:32:50,891 INFO L290 TraceCheckUtils]: 55: Hoare triple {16067#(< main_~c~0 main_~b~0)} assume !false; {16067#(< main_~c~0 main_~b~0)} is VALID [2022-04-28 12:32:50,891 INFO L290 TraceCheckUtils]: 56: Hoare triple {16067#(< main_~c~0 main_~b~0)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {16074#(< main_~c~0 main_~v~0)} is VALID [2022-04-28 12:32:50,891 INFO L290 TraceCheckUtils]: 57: Hoare triple {16074#(< main_~c~0 main_~v~0)} assume !false; {16074#(< main_~c~0 main_~v~0)} is VALID [2022-04-28 12:32:50,891 INFO L272 TraceCheckUtils]: 58: Hoare triple {16074#(< main_~c~0 main_~v~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {15898#true} is VALID [2022-04-28 12:32:50,891 INFO L290 TraceCheckUtils]: 59: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-28 12:32:50,891 INFO L290 TraceCheckUtils]: 60: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-28 12:32:50,891 INFO L290 TraceCheckUtils]: 61: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-28 12:32:50,892 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {15898#true} {16074#(< main_~c~0 main_~v~0)} #102#return; {16074#(< main_~c~0 main_~v~0)} is VALID [2022-04-28 12:32:50,892 INFO L272 TraceCheckUtils]: 63: Hoare triple {16074#(< main_~c~0 main_~v~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {15898#true} is VALID [2022-04-28 12:32:50,892 INFO L290 TraceCheckUtils]: 64: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-28 12:32:50,892 INFO L290 TraceCheckUtils]: 65: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-28 12:32:50,892 INFO L290 TraceCheckUtils]: 66: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-28 12:32:50,892 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {15898#true} {16074#(< main_~c~0 main_~v~0)} #104#return; {16074#(< main_~c~0 main_~v~0)} is VALID [2022-04-28 12:32:50,893 INFO L272 TraceCheckUtils]: 68: Hoare triple {16074#(< main_~c~0 main_~v~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {15898#true} is VALID [2022-04-28 12:32:50,893 INFO L290 TraceCheckUtils]: 69: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-28 12:32:50,893 INFO L290 TraceCheckUtils]: 70: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-28 12:32:50,893 INFO L290 TraceCheckUtils]: 71: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-28 12:32:50,907 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {15898#true} {16074#(< main_~c~0 main_~v~0)} #106#return; {16074#(< main_~c~0 main_~v~0)} is VALID [2022-04-28 12:32:50,908 INFO L272 TraceCheckUtils]: 73: Hoare triple {16074#(< main_~c~0 main_~v~0)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {15898#true} is VALID [2022-04-28 12:32:50,908 INFO L290 TraceCheckUtils]: 74: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-28 12:32:50,908 INFO L290 TraceCheckUtils]: 75: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-28 12:32:50,908 INFO L290 TraceCheckUtils]: 76: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-28 12:32:50,908 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {15898#true} {16074#(< main_~c~0 main_~v~0)} #108#return; {16074#(< main_~c~0 main_~v~0)} is VALID [2022-04-28 12:32:50,908 INFO L290 TraceCheckUtils]: 78: Hoare triple {16074#(< main_~c~0 main_~v~0)} assume !(~c~0 >= 2 * ~v~0); {16074#(< main_~c~0 main_~v~0)} is VALID [2022-04-28 12:32:50,909 INFO L290 TraceCheckUtils]: 79: Hoare triple {16074#(< main_~c~0 main_~v~0)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {16144#(< main_~c~0 0)} is VALID [2022-04-28 12:32:50,909 INFO L290 TraceCheckUtils]: 80: Hoare triple {16144#(< main_~c~0 0)} assume !false; {16144#(< main_~c~0 0)} is VALID [2022-04-28 12:32:50,910 INFO L290 TraceCheckUtils]: 81: Hoare triple {16144#(< main_~c~0 0)} assume !(~c~0 >= ~b~0); {16144#(< main_~c~0 0)} is VALID [2022-04-28 12:32:50,910 INFO L290 TraceCheckUtils]: 82: Hoare triple {16144#(< main_~c~0 0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {16154#(< main_~b~0 0)} is VALID [2022-04-28 12:32:50,910 INFO L290 TraceCheckUtils]: 83: Hoare triple {16154#(< main_~b~0 0)} assume !false; {16154#(< main_~b~0 0)} is VALID [2022-04-28 12:32:50,910 INFO L290 TraceCheckUtils]: 84: Hoare triple {16154#(< main_~b~0 0)} assume !(0 != ~b~0); {15899#false} is VALID [2022-04-28 12:32:50,910 INFO L272 TraceCheckUtils]: 85: Hoare triple {15899#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {15899#false} is VALID [2022-04-28 12:32:50,911 INFO L290 TraceCheckUtils]: 86: Hoare triple {15899#false} ~cond := #in~cond; {15899#false} is VALID [2022-04-28 12:32:50,911 INFO L290 TraceCheckUtils]: 87: Hoare triple {15899#false} assume 0 == ~cond; {15899#false} is VALID [2022-04-28 12:32:50,911 INFO L290 TraceCheckUtils]: 88: Hoare triple {15899#false} assume !false; {15899#false} is VALID [2022-04-28 12:32:50,911 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-04-28 12:32:50,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:32:51,165 INFO L290 TraceCheckUtils]: 88: Hoare triple {15899#false} assume !false; {15899#false} is VALID [2022-04-28 12:32:51,165 INFO L290 TraceCheckUtils]: 87: Hoare triple {15899#false} assume 0 == ~cond; {15899#false} is VALID [2022-04-28 12:32:51,165 INFO L290 TraceCheckUtils]: 86: Hoare triple {15899#false} ~cond := #in~cond; {15899#false} is VALID [2022-04-28 12:32:51,165 INFO L272 TraceCheckUtils]: 85: Hoare triple {15899#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {15899#false} is VALID [2022-04-28 12:32:51,165 INFO L290 TraceCheckUtils]: 84: Hoare triple {16154#(< main_~b~0 0)} assume !(0 != ~b~0); {15899#false} is VALID [2022-04-28 12:32:51,166 INFO L290 TraceCheckUtils]: 83: Hoare triple {16154#(< main_~b~0 0)} assume !false; {16154#(< main_~b~0 0)} is VALID [2022-04-28 12:32:51,166 INFO L290 TraceCheckUtils]: 82: Hoare triple {16144#(< main_~c~0 0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {16154#(< main_~b~0 0)} is VALID [2022-04-28 12:32:51,166 INFO L290 TraceCheckUtils]: 81: Hoare triple {16144#(< main_~c~0 0)} assume !(~c~0 >= ~b~0); {16144#(< main_~c~0 0)} is VALID [2022-04-28 12:32:51,166 INFO L290 TraceCheckUtils]: 80: Hoare triple {16144#(< main_~c~0 0)} assume !false; {16144#(< main_~c~0 0)} is VALID [2022-04-28 12:32:51,167 INFO L290 TraceCheckUtils]: 79: Hoare triple {16074#(< main_~c~0 main_~v~0)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {16144#(< main_~c~0 0)} is VALID [2022-04-28 12:32:51,167 INFO L290 TraceCheckUtils]: 78: Hoare triple {16074#(< main_~c~0 main_~v~0)} assume !(~c~0 >= 2 * ~v~0); {16074#(< main_~c~0 main_~v~0)} is VALID [2022-04-28 12:32:51,168 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {15898#true} {16074#(< main_~c~0 main_~v~0)} #108#return; {16074#(< main_~c~0 main_~v~0)} is VALID [2022-04-28 12:32:51,168 INFO L290 TraceCheckUtils]: 76: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-28 12:32:51,168 INFO L290 TraceCheckUtils]: 75: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-28 12:32:51,168 INFO L290 TraceCheckUtils]: 74: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-28 12:32:51,168 INFO L272 TraceCheckUtils]: 73: Hoare triple {16074#(< main_~c~0 main_~v~0)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {15898#true} is VALID [2022-04-28 12:32:51,168 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {15898#true} {16074#(< main_~c~0 main_~v~0)} #106#return; {16074#(< main_~c~0 main_~v~0)} is VALID [2022-04-28 12:32:51,168 INFO L290 TraceCheckUtils]: 71: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-28 12:32:51,168 INFO L290 TraceCheckUtils]: 70: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-28 12:32:51,169 INFO L290 TraceCheckUtils]: 69: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-28 12:32:51,169 INFO L272 TraceCheckUtils]: 68: Hoare triple {16074#(< main_~c~0 main_~v~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {15898#true} is VALID [2022-04-28 12:32:51,170 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {15898#true} {16074#(< main_~c~0 main_~v~0)} #104#return; {16074#(< main_~c~0 main_~v~0)} is VALID [2022-04-28 12:32:51,170 INFO L290 TraceCheckUtils]: 66: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-28 12:32:51,170 INFO L290 TraceCheckUtils]: 65: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-28 12:32:51,170 INFO L290 TraceCheckUtils]: 64: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-28 12:32:51,170 INFO L272 TraceCheckUtils]: 63: Hoare triple {16074#(< main_~c~0 main_~v~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {15898#true} is VALID [2022-04-28 12:32:51,170 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {15898#true} {16074#(< main_~c~0 main_~v~0)} #102#return; {16074#(< main_~c~0 main_~v~0)} is VALID [2022-04-28 12:32:51,170 INFO L290 TraceCheckUtils]: 61: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-28 12:32:51,170 INFO L290 TraceCheckUtils]: 60: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-28 12:32:51,170 INFO L290 TraceCheckUtils]: 59: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-28 12:32:51,171 INFO L272 TraceCheckUtils]: 58: Hoare triple {16074#(< main_~c~0 main_~v~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {15898#true} is VALID [2022-04-28 12:32:51,171 INFO L290 TraceCheckUtils]: 57: Hoare triple {16074#(< main_~c~0 main_~v~0)} assume !false; {16074#(< main_~c~0 main_~v~0)} is VALID [2022-04-28 12:32:51,171 INFO L290 TraceCheckUtils]: 56: Hoare triple {16067#(< main_~c~0 main_~b~0)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {16074#(< main_~c~0 main_~v~0)} is VALID [2022-04-28 12:32:51,171 INFO L290 TraceCheckUtils]: 55: Hoare triple {16067#(< main_~c~0 main_~b~0)} assume !false; {16067#(< main_~c~0 main_~b~0)} is VALID [2022-04-28 12:32:51,172 INFO L290 TraceCheckUtils]: 54: Hoare triple {16275#(< main_~c~0 (+ main_~b~0 main_~v~0))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {16067#(< main_~c~0 main_~b~0)} is VALID [2022-04-28 12:32:51,173 INFO L290 TraceCheckUtils]: 53: Hoare triple {15996#(<= main_~v~0 main_~b~0)} assume !(~c~0 >= 2 * ~v~0); {16275#(< main_~c~0 (+ main_~b~0 main_~v~0))} is VALID [2022-04-28 12:32:51,173 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {15898#true} {15996#(<= main_~v~0 main_~b~0)} #108#return; {15996#(<= main_~v~0 main_~b~0)} is VALID [2022-04-28 12:32:51,173 INFO L290 TraceCheckUtils]: 51: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-28 12:32:51,173 INFO L290 TraceCheckUtils]: 50: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-28 12:32:51,173 INFO L290 TraceCheckUtils]: 49: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-28 12:32:51,173 INFO L272 TraceCheckUtils]: 48: Hoare triple {15996#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {15898#true} is VALID [2022-04-28 12:32:51,174 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {15898#true} {15996#(<= main_~v~0 main_~b~0)} #106#return; {15996#(<= main_~v~0 main_~b~0)} is VALID [2022-04-28 12:32:51,174 INFO L290 TraceCheckUtils]: 46: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-28 12:32:51,174 INFO L290 TraceCheckUtils]: 45: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-28 12:32:51,174 INFO L290 TraceCheckUtils]: 44: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-28 12:32:51,174 INFO L272 TraceCheckUtils]: 43: Hoare triple {15996#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {15898#true} is VALID [2022-04-28 12:32:51,174 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {15898#true} {15996#(<= main_~v~0 main_~b~0)} #104#return; {15996#(<= main_~v~0 main_~b~0)} is VALID [2022-04-28 12:32:51,174 INFO L290 TraceCheckUtils]: 41: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-28 12:32:51,174 INFO L290 TraceCheckUtils]: 40: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-28 12:32:51,174 INFO L290 TraceCheckUtils]: 39: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-28 12:32:51,174 INFO L272 TraceCheckUtils]: 38: Hoare triple {15996#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {15898#true} is VALID [2022-04-28 12:32:51,175 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {15898#true} {15996#(<= main_~v~0 main_~b~0)} #102#return; {15996#(<= main_~v~0 main_~b~0)} is VALID [2022-04-28 12:32:51,175 INFO L290 TraceCheckUtils]: 36: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-28 12:32:51,175 INFO L290 TraceCheckUtils]: 35: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-28 12:32:51,175 INFO L290 TraceCheckUtils]: 34: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-28 12:32:51,175 INFO L272 TraceCheckUtils]: 33: Hoare triple {15996#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {15898#true} is VALID [2022-04-28 12:32:51,175 INFO L290 TraceCheckUtils]: 32: Hoare triple {15996#(<= main_~v~0 main_~b~0)} assume !false; {15996#(<= main_~v~0 main_~b~0)} is VALID [2022-04-28 12:32:51,176 INFO L290 TraceCheckUtils]: 31: Hoare triple {15898#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {15996#(<= main_~v~0 main_~b~0)} is VALID [2022-04-28 12:32:51,176 INFO L290 TraceCheckUtils]: 30: Hoare triple {15898#true} assume !false; {15898#true} is VALID [2022-04-28 12:32:51,176 INFO L290 TraceCheckUtils]: 29: Hoare triple {15898#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {15898#true} is VALID [2022-04-28 12:32:51,176 INFO L290 TraceCheckUtils]: 28: Hoare triple {15898#true} assume !false; {15898#true} is VALID [2022-04-28 12:32:51,176 INFO L290 TraceCheckUtils]: 27: Hoare triple {15898#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {15898#true} is VALID [2022-04-28 12:32:51,176 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {15898#true} {15898#true} #100#return; {15898#true} is VALID [2022-04-28 12:32:51,176 INFO L290 TraceCheckUtils]: 25: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-28 12:32:51,176 INFO L290 TraceCheckUtils]: 24: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-28 12:32:51,176 INFO L290 TraceCheckUtils]: 23: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-28 12:32:51,176 INFO L272 TraceCheckUtils]: 22: Hoare triple {15898#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {15898#true} is VALID [2022-04-28 12:32:51,176 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {15898#true} {15898#true} #98#return; {15898#true} is VALID [2022-04-28 12:32:51,176 INFO L290 TraceCheckUtils]: 20: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-28 12:32:51,176 INFO L290 TraceCheckUtils]: 19: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-28 12:32:51,176 INFO L290 TraceCheckUtils]: 18: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-28 12:32:51,176 INFO L272 TraceCheckUtils]: 17: Hoare triple {15898#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {15898#true} is VALID [2022-04-28 12:32:51,177 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {15898#true} {15898#true} #96#return; {15898#true} is VALID [2022-04-28 12:32:51,177 INFO L290 TraceCheckUtils]: 15: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-28 12:32:51,177 INFO L290 TraceCheckUtils]: 14: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-28 12:32:51,177 INFO L290 TraceCheckUtils]: 13: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-28 12:32:51,177 INFO L272 TraceCheckUtils]: 12: Hoare triple {15898#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {15898#true} is VALID [2022-04-28 12:32:51,177 INFO L290 TraceCheckUtils]: 11: Hoare triple {15898#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {15898#true} is VALID [2022-04-28 12:32:51,177 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15898#true} {15898#true} #94#return; {15898#true} is VALID [2022-04-28 12:32:51,177 INFO L290 TraceCheckUtils]: 9: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-28 12:32:51,177 INFO L290 TraceCheckUtils]: 8: Hoare triple {15898#true} assume !(0 == ~cond); {15898#true} is VALID [2022-04-28 12:32:51,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {15898#true} ~cond := #in~cond; {15898#true} is VALID [2022-04-28 12:32:51,177 INFO L272 TraceCheckUtils]: 6: Hoare triple {15898#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {15898#true} is VALID [2022-04-28 12:32:51,177 INFO L290 TraceCheckUtils]: 5: Hoare triple {15898#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {15898#true} is VALID [2022-04-28 12:32:51,177 INFO L272 TraceCheckUtils]: 4: Hoare triple {15898#true} call #t~ret6 := main(); {15898#true} is VALID [2022-04-28 12:32:51,177 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15898#true} {15898#true} #112#return; {15898#true} is VALID [2022-04-28 12:32:51,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {15898#true} assume true; {15898#true} is VALID [2022-04-28 12:32:51,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {15898#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(11, 2);call #Ultimate.allocInit(12, 3); {15898#true} is VALID [2022-04-28 12:32:51,177 INFO L272 TraceCheckUtils]: 0: Hoare triple {15898#true} call ULTIMATE.init(); {15898#true} is VALID [2022-04-28 12:32:51,178 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-04-28 12:32:51,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:32:51,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237582548] [2022-04-28 12:32:51,178 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:32:51,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457801405] [2022-04-28 12:32:51,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457801405] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:32:51,178 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:32:51,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-28 12:32:51,178 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:32:51,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [972220402] [2022-04-28 12:32:51,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [972220402] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:32:51,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:32:51,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 12:32:51,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662258573] [2022-04-28 12:32:51,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:32:51,179 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 89 [2022-04-28 12:32:51,179 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:32:51,179 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-28 12:32:51,228 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:32:51,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 12:32:51,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:32:51,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 12:32:51,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-28 12:32:51,229 INFO L87 Difference]: Start difference. First operand 228 states and 321 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-28 12:32:52,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:32:52,329 INFO L93 Difference]: Finished difference Result 361 states and 505 transitions. [2022-04-28 12:32:52,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 12:32:52,330 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 89 [2022-04-28 12:32:52,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:32:52,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-28 12:32:52,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 89 transitions. [2022-04-28 12:32:52,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-28 12:32:52,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 89 transitions. [2022-04-28 12:32:52,331 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 89 transitions. [2022-04-28 12:32:52,403 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:32:52,407 INFO L225 Difference]: With dead ends: 361 [2022-04-28 12:32:52,407 INFO L226 Difference]: Without dead ends: 238 [2022-04-28 12:32:52,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 170 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-28 12:32:52,408 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 7 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 12:32:52,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 260 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 12:32:52,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-04-28 12:32:53,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 225. [2022-04-28 12:32:53,204 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:32:53,205 INFO L82 GeneralOperation]: Start isEquivalent. First operand 238 states. Second operand has 225 states, 126 states have (on average 1.1825396825396826) internal successors, (149), 127 states have internal predecessors, (149), 83 states have call successors, (83), 16 states have call predecessors, (83), 15 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2022-04-28 12:32:53,205 INFO L74 IsIncluded]: Start isIncluded. First operand 238 states. Second operand has 225 states, 126 states have (on average 1.1825396825396826) internal successors, (149), 127 states have internal predecessors, (149), 83 states have call successors, (83), 16 states have call predecessors, (83), 15 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2022-04-28 12:32:53,205 INFO L87 Difference]: Start difference. First operand 238 states. Second operand has 225 states, 126 states have (on average 1.1825396825396826) internal successors, (149), 127 states have internal predecessors, (149), 83 states have call successors, (83), 16 states have call predecessors, (83), 15 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2022-04-28 12:32:53,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:32:53,209 INFO L93 Difference]: Finished difference Result 238 states and 327 transitions. [2022-04-28 12:32:53,210 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 327 transitions. [2022-04-28 12:32:53,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:32:53,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:32:53,210 INFO L74 IsIncluded]: Start isIncluded. First operand has 225 states, 126 states have (on average 1.1825396825396826) internal successors, (149), 127 states have internal predecessors, (149), 83 states have call successors, (83), 16 states have call predecessors, (83), 15 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) Second operand 238 states. [2022-04-28 12:32:53,211 INFO L87 Difference]: Start difference. First operand has 225 states, 126 states have (on average 1.1825396825396826) internal successors, (149), 127 states have internal predecessors, (149), 83 states have call successors, (83), 16 states have call predecessors, (83), 15 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) Second operand 238 states. [2022-04-28 12:32:53,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:32:53,215 INFO L93 Difference]: Finished difference Result 238 states and 327 transitions. [2022-04-28 12:32:53,215 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 327 transitions. [2022-04-28 12:32:53,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:32:53,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:32:53,216 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:32:53,216 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:32:53,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 126 states have (on average 1.1825396825396826) internal successors, (149), 127 states have internal predecessors, (149), 83 states have call successors, (83), 16 states have call predecessors, (83), 15 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2022-04-28 12:32:53,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 313 transitions. [2022-04-28 12:32:53,220 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 313 transitions. Word has length 89 [2022-04-28 12:32:53,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:32:53,221 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 313 transitions. [2022-04-28 12:32:53,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-28 12:32:53,221 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 225 states and 313 transitions. [2022-04-28 12:32:53,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 313 edges. 313 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:32:53,769 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 313 transitions. [2022-04-28 12:32:53,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-28 12:32:53,770 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:32:53,770 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:32:53,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-04-28 12:32:53,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-28 12:32:53,980 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:32:53,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:32:53,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1455197645, now seen corresponding path program 3 times [2022-04-28 12:32:53,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:32:53,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1332421671] [2022-04-28 12:32:53,981 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:32:53,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1455197645, now seen corresponding path program 4 times [2022-04-28 12:32:53,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:32:53,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822834140] [2022-04-28 12:32:53,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:32:53,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:32:53,992 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:32:53,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1149050638] [2022-04-28 12:32:53,992 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 12:32:53,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:32:53,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:32:53,993 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-28 12:32:53,994 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-28 12:32:54,038 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 12:32:54,038 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:32:54,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 88 conjunts are in the unsatisfiable core [2022-04-28 12:32:54,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:32:54,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:33:02,272 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 12:33:06,694 INFO L272 TraceCheckUtils]: 0: Hoare triple {18091#true} call ULTIMATE.init(); {18091#true} is VALID [2022-04-28 12:33:06,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {18091#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(11, 2);call #Ultimate.allocInit(12, 3); {18091#true} is VALID [2022-04-28 12:33:06,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {18091#true} assume true; {18091#true} is VALID [2022-04-28 12:33:06,694 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18091#true} {18091#true} #112#return; {18091#true} is VALID [2022-04-28 12:33:06,694 INFO L272 TraceCheckUtils]: 4: Hoare triple {18091#true} call #t~ret6 := main(); {18091#true} is VALID [2022-04-28 12:33:06,694 INFO L290 TraceCheckUtils]: 5: Hoare triple {18091#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {18091#true} is VALID [2022-04-28 12:33:06,694 INFO L272 TraceCheckUtils]: 6: Hoare triple {18091#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {18091#true} is VALID [2022-04-28 12:33:06,694 INFO L290 TraceCheckUtils]: 7: Hoare triple {18091#true} ~cond := #in~cond; {18091#true} is VALID [2022-04-28 12:33:06,694 INFO L290 TraceCheckUtils]: 8: Hoare triple {18091#true} assume !(0 == ~cond); {18091#true} is VALID [2022-04-28 12:33:06,694 INFO L290 TraceCheckUtils]: 9: Hoare triple {18091#true} assume true; {18091#true} is VALID [2022-04-28 12:33:06,694 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18091#true} {18091#true} #94#return; {18091#true} is VALID [2022-04-28 12:33:06,694 INFO L290 TraceCheckUtils]: 11: Hoare triple {18091#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {18091#true} is VALID [2022-04-28 12:33:06,694 INFO L272 TraceCheckUtils]: 12: Hoare triple {18091#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {18091#true} is VALID [2022-04-28 12:33:06,695 INFO L290 TraceCheckUtils]: 13: Hoare triple {18091#true} ~cond := #in~cond; {18135#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 12:33:06,695 INFO L290 TraceCheckUtils]: 14: Hoare triple {18135#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {18139#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:33:06,695 INFO L290 TraceCheckUtils]: 15: Hoare triple {18139#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {18139#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:33:06,696 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {18139#(not (= |assume_abort_if_not_#in~cond| 0))} {18091#true} #96#return; {18146#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 12:33:06,696 INFO L272 TraceCheckUtils]: 17: Hoare triple {18146#(and (<= 0 main_~y~0) (<= main_~y~0 2))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {18091#true} is VALID [2022-04-28 12:33:06,696 INFO L290 TraceCheckUtils]: 18: Hoare triple {18091#true} ~cond := #in~cond; {18091#true} is VALID [2022-04-28 12:33:06,696 INFO L290 TraceCheckUtils]: 19: Hoare triple {18091#true} assume !(0 == ~cond); {18091#true} is VALID [2022-04-28 12:33:06,696 INFO L290 TraceCheckUtils]: 20: Hoare triple {18091#true} assume true; {18091#true} is VALID [2022-04-28 12:33:06,696 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {18091#true} {18146#(and (<= 0 main_~y~0) (<= main_~y~0 2))} #98#return; {18146#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 12:33:06,696 INFO L272 TraceCheckUtils]: 22: Hoare triple {18146#(and (<= 0 main_~y~0) (<= main_~y~0 2))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {18091#true} is VALID [2022-04-28 12:33:06,696 INFO L290 TraceCheckUtils]: 23: Hoare triple {18091#true} ~cond := #in~cond; {18091#true} is VALID [2022-04-28 12:33:06,696 INFO L290 TraceCheckUtils]: 24: Hoare triple {18091#true} assume !(0 == ~cond); {18091#true} is VALID [2022-04-28 12:33:06,696 INFO L290 TraceCheckUtils]: 25: Hoare triple {18091#true} assume true; {18091#true} is VALID [2022-04-28 12:33:06,697 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {18091#true} {18146#(and (<= 0 main_~y~0) (<= main_~y~0 2))} #100#return; {18146#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 12:33:06,697 INFO L290 TraceCheckUtils]: 27: Hoare triple {18146#(and (<= 0 main_~y~0) (<= main_~y~0 2))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {18180#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 12:33:06,697 INFO L290 TraceCheckUtils]: 28: Hoare triple {18180#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !false; {18180#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 12:33:06,698 INFO L290 TraceCheckUtils]: 29: Hoare triple {18180#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {18187#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~y~0 2) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 12:33:06,698 INFO L290 TraceCheckUtils]: 30: Hoare triple {18187#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~y~0 2) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} assume !false; {18187#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~y~0 2) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 12:33:06,699 INFO L290 TraceCheckUtils]: 31: Hoare triple {18187#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~y~0 2) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} assume !(~c~0 >= ~b~0); {18194#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~y~0 2) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (<= main_~b~0 main_~c~0)) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 12:33:06,699 INFO L290 TraceCheckUtils]: 32: Hoare triple {18194#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~y~0 2) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (<= main_~b~0 main_~c~0)) (= main_~q~0 0) (= main_~c~0 main_~x~0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {18198#(and (<= 0 main_~y~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 12:33:06,699 INFO L290 TraceCheckUtils]: 33: Hoare triple {18198#(and (<= 0 main_~y~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !false; {18198#(and (<= 0 main_~y~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 12:33:06,700 INFO L290 TraceCheckUtils]: 34: Hoare triple {18198#(and (<= 0 main_~y~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {18205#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 12:33:06,700 INFO L290 TraceCheckUtils]: 35: Hoare triple {18205#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !false; {18205#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 12:33:06,701 INFO L290 TraceCheckUtils]: 36: Hoare triple {18205#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {18212#(and (= main_~b~0 main_~v~0) (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 12:33:06,701 INFO L290 TraceCheckUtils]: 37: Hoare triple {18212#(and (= main_~b~0 main_~v~0) (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !false; {18212#(and (= main_~b~0 main_~v~0) (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 12:33:06,701 INFO L272 TraceCheckUtils]: 38: Hoare triple {18212#(and (= main_~b~0 main_~v~0) (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18091#true} is VALID [2022-04-28 12:33:06,701 INFO L290 TraceCheckUtils]: 39: Hoare triple {18091#true} ~cond := #in~cond; {18091#true} is VALID [2022-04-28 12:33:06,701 INFO L290 TraceCheckUtils]: 40: Hoare triple {18091#true} assume !(0 == ~cond); {18091#true} is VALID [2022-04-28 12:33:06,701 INFO L290 TraceCheckUtils]: 41: Hoare triple {18091#true} assume true; {18091#true} is VALID [2022-04-28 12:33:06,702 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {18091#true} {18212#(and (= main_~b~0 main_~v~0) (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #102#return; {18212#(and (= main_~b~0 main_~v~0) (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 12:33:06,702 INFO L272 TraceCheckUtils]: 43: Hoare triple {18212#(and (= main_~b~0 main_~v~0) (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18091#true} is VALID [2022-04-28 12:33:06,702 INFO L290 TraceCheckUtils]: 44: Hoare triple {18091#true} ~cond := #in~cond; {18091#true} is VALID [2022-04-28 12:33:06,702 INFO L290 TraceCheckUtils]: 45: Hoare triple {18091#true} assume !(0 == ~cond); {18091#true} is VALID [2022-04-28 12:33:06,702 INFO L290 TraceCheckUtils]: 46: Hoare triple {18091#true} assume true; {18091#true} is VALID [2022-04-28 12:33:06,703 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {18091#true} {18212#(and (= main_~b~0 main_~v~0) (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #104#return; {18212#(and (= main_~b~0 main_~v~0) (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 12:33:06,703 INFO L272 TraceCheckUtils]: 48: Hoare triple {18212#(and (= main_~b~0 main_~v~0) (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {18091#true} is VALID [2022-04-28 12:33:06,703 INFO L290 TraceCheckUtils]: 49: Hoare triple {18091#true} ~cond := #in~cond; {18091#true} is VALID [2022-04-28 12:33:06,703 INFO L290 TraceCheckUtils]: 50: Hoare triple {18091#true} assume !(0 == ~cond); {18091#true} is VALID [2022-04-28 12:33:06,703 INFO L290 TraceCheckUtils]: 51: Hoare triple {18091#true} assume true; {18091#true} is VALID [2022-04-28 12:33:06,704 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {18091#true} {18212#(and (= main_~b~0 main_~v~0) (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #106#return; {18212#(and (= main_~b~0 main_~v~0) (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 12:33:06,704 INFO L272 TraceCheckUtils]: 53: Hoare triple {18212#(and (= main_~b~0 main_~v~0) (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {18091#true} is VALID [2022-04-28 12:33:06,704 INFO L290 TraceCheckUtils]: 54: Hoare triple {18091#true} ~cond := #in~cond; {18091#true} is VALID [2022-04-28 12:33:06,704 INFO L290 TraceCheckUtils]: 55: Hoare triple {18091#true} assume !(0 == ~cond); {18091#true} is VALID [2022-04-28 12:33:06,704 INFO L290 TraceCheckUtils]: 56: Hoare triple {18091#true} assume true; {18091#true} is VALID [2022-04-28 12:33:06,705 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {18091#true} {18212#(and (= main_~b~0 main_~v~0) (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #108#return; {18212#(and (= main_~b~0 main_~v~0) (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 12:33:06,706 INFO L290 TraceCheckUtils]: 58: Hoare triple {18212#(and (= main_~b~0 main_~v~0) (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {18279#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0))} is VALID [2022-04-28 12:33:06,707 INFO L290 TraceCheckUtils]: 59: Hoare triple {18279#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0))} assume !false; {18279#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0))} is VALID [2022-04-28 12:33:06,707 INFO L272 TraceCheckUtils]: 60: Hoare triple {18279#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18091#true} is VALID [2022-04-28 12:33:06,707 INFO L290 TraceCheckUtils]: 61: Hoare triple {18091#true} ~cond := #in~cond; {18289#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:33:06,707 INFO L290 TraceCheckUtils]: 62: Hoare triple {18289#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:33:06,707 INFO L290 TraceCheckUtils]: 63: Hoare triple {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:33:06,708 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} {18279#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0))} #102#return; {18279#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0))} is VALID [2022-04-28 12:33:06,708 INFO L272 TraceCheckUtils]: 65: Hoare triple {18279#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18091#true} is VALID [2022-04-28 12:33:06,708 INFO L290 TraceCheckUtils]: 66: Hoare triple {18091#true} ~cond := #in~cond; {18289#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:33:06,709 INFO L290 TraceCheckUtils]: 67: Hoare triple {18289#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:33:06,709 INFO L290 TraceCheckUtils]: 68: Hoare triple {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:33:06,710 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} {18279#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0))} #104#return; {18315#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0))} is VALID [2022-04-28 12:33:06,710 INFO L272 TraceCheckUtils]: 70: Hoare triple {18315#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {18091#true} is VALID [2022-04-28 12:33:06,710 INFO L290 TraceCheckUtils]: 71: Hoare triple {18091#true} ~cond := #in~cond; {18289#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:33:06,710 INFO L290 TraceCheckUtils]: 72: Hoare triple {18289#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:33:06,711 INFO L290 TraceCheckUtils]: 73: Hoare triple {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:33:06,712 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} {18315#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0))} #106#return; {18331#(and (<= 0 main_~y~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0))} is VALID [2022-04-28 12:33:06,712 INFO L272 TraceCheckUtils]: 75: Hoare triple {18331#(and (<= 0 main_~y~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {18091#true} is VALID [2022-04-28 12:33:06,712 INFO L290 TraceCheckUtils]: 76: Hoare triple {18091#true} ~cond := #in~cond; {18289#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:33:06,712 INFO L290 TraceCheckUtils]: 77: Hoare triple {18289#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:33:06,713 INFO L290 TraceCheckUtils]: 78: Hoare triple {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:33:06,713 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} {18331#(and (<= 0 main_~y~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0))} #108#return; {18347#(and (= main_~v~0 (* main_~d~0 main_~b~0)) (<= 0 main_~y~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0))} is VALID [2022-04-28 12:33:06,714 INFO L290 TraceCheckUtils]: 80: Hoare triple {18347#(and (= main_~v~0 (* main_~d~0 main_~b~0)) (<= 0 main_~y~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0))} assume !(~c~0 >= 2 * ~v~0); {18347#(and (= main_~v~0 (* main_~d~0 main_~b~0)) (<= 0 main_~y~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0))} is VALID [2022-04-28 12:33:06,716 INFO L290 TraceCheckUtils]: 81: Hoare triple {18347#(and (= main_~v~0 (* main_~d~0 main_~b~0)) (<= 0 main_~y~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= main_~y~0 2) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {18354#(and (<= 0 main_~y~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~y~0 2) (= main_~p~0 0) (= (+ main_~c~0 (* main_~b~0 2)) main_~y~0) (= main_~r~0 1) (= (mod main_~k~0 2) 0) (< main_~x~0 (+ main_~c~0 (* main_~b~0 2))) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)))} is VALID [2022-04-28 12:33:06,717 INFO L290 TraceCheckUtils]: 82: Hoare triple {18354#(and (<= 0 main_~y~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~y~0 2) (= main_~p~0 0) (= (+ main_~c~0 (* main_~b~0 2)) main_~y~0) (= main_~r~0 1) (= (mod main_~k~0 2) 0) (< main_~x~0 (+ main_~c~0 (* main_~b~0 2))) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)))} assume !false; {18354#(and (<= 0 main_~y~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~y~0 2) (= main_~p~0 0) (= (+ main_~c~0 (* main_~b~0 2)) main_~y~0) (= main_~r~0 1) (= (mod main_~k~0 2) 0) (< main_~x~0 (+ main_~c~0 (* main_~b~0 2))) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)))} is VALID [2022-04-28 12:33:06,717 INFO L290 TraceCheckUtils]: 83: Hoare triple {18354#(and (<= 0 main_~y~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~y~0 2) (= main_~p~0 0) (= (+ main_~c~0 (* main_~b~0 2)) main_~y~0) (= main_~r~0 1) (= (mod main_~k~0 2) 0) (< main_~x~0 (+ main_~c~0 (* main_~b~0 2))) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)))} assume !(~c~0 >= ~b~0); {18361#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~y~0 2) (= main_~p~0 0) (= (+ main_~c~0 (* main_~b~0 2)) main_~y~0) (= main_~r~0 1) (< main_~x~0 (+ main_~c~0 (* main_~b~0 2))) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (< main_~c~0 main_~b~0))} is VALID [2022-04-28 12:33:06,720 INFO L290 TraceCheckUtils]: 84: Hoare triple {18361#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~y~0 2) (= main_~p~0 0) (= (+ main_~c~0 (* main_~b~0 2)) main_~y~0) (= main_~r~0 1) (< main_~x~0 (+ main_~c~0 (* main_~b~0 2))) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (< main_~c~0 main_~b~0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {18365#(and (= main_~r~0 0) (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (<= main_~y~0 2) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= main_~x~0 (* main_~p~0 main_~x~0)) (= (+ main_~q~0 (* main_~p~0 (div (* main_~x~0 2) main_~x~0))) 0) (= main_~a~0 main_~x~0) (< main_~y~0 (* main_~x~0 3)))} is VALID [2022-04-28 12:33:06,720 INFO L290 TraceCheckUtils]: 85: Hoare triple {18365#(and (= main_~r~0 0) (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (<= main_~y~0 2) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= main_~x~0 (* main_~p~0 main_~x~0)) (= (+ main_~q~0 (* main_~p~0 (div (* main_~x~0 2) main_~x~0))) 0) (= main_~a~0 main_~x~0) (< main_~y~0 (* main_~x~0 3)))} assume !false; {18365#(and (= main_~r~0 0) (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (<= main_~y~0 2) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= main_~x~0 (* main_~p~0 main_~x~0)) (= (+ main_~q~0 (* main_~p~0 (div (* main_~x~0 2) main_~x~0))) 0) (= main_~a~0 main_~x~0) (< main_~y~0 (* main_~x~0 3)))} is VALID [2022-04-28 12:33:06,721 INFO L290 TraceCheckUtils]: 86: Hoare triple {18365#(and (= main_~r~0 0) (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (<= main_~y~0 2) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= main_~x~0 (* main_~p~0 main_~x~0)) (= (+ main_~q~0 (* main_~p~0 (div (* main_~x~0 2) main_~x~0))) 0) (= main_~a~0 main_~x~0) (< main_~y~0 (* main_~x~0 3)))} assume !(0 != ~b~0); {18372#(and (= main_~r~0 0) (= (* main_~x~0 2) main_~y~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~x~0 (* main_~p~0 main_~x~0)) (= (+ main_~q~0 (* main_~p~0 (div (* main_~x~0 2) main_~x~0))) 0) (= main_~a~0 main_~x~0) (< main_~y~0 (* main_~x~0 3)))} is VALID [2022-04-28 12:33:06,723 INFO L272 TraceCheckUtils]: 87: Hoare triple {18372#(and (= main_~r~0 0) (= (* main_~x~0 2) main_~y~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~x~0 (* main_~p~0 main_~x~0)) (= (+ main_~q~0 (* main_~p~0 (div (* main_~x~0 2) main_~x~0))) 0) (= main_~a~0 main_~x~0) (< main_~y~0 (* main_~x~0 3)))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {18376#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:33:06,723 INFO L290 TraceCheckUtils]: 88: Hoare triple {18376#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18380#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:33:06,723 INFO L290 TraceCheckUtils]: 89: Hoare triple {18380#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18092#false} is VALID [2022-04-28 12:33:06,723 INFO L290 TraceCheckUtils]: 90: Hoare triple {18092#false} assume !false; {18092#false} is VALID [2022-04-28 12:33:06,724 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 63 proven. 29 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-04-28 12:33:06,724 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:34:03,705 INFO L290 TraceCheckUtils]: 90: Hoare triple {18092#false} assume !false; {18092#false} is VALID [2022-04-28 12:34:03,705 INFO L290 TraceCheckUtils]: 89: Hoare triple {18380#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18092#false} is VALID [2022-04-28 12:34:03,706 INFO L290 TraceCheckUtils]: 88: Hoare triple {18376#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18380#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:34:03,706 INFO L272 TraceCheckUtils]: 87: Hoare triple {18396#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {18376#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:34:03,707 INFO L290 TraceCheckUtils]: 86: Hoare triple {18400#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} assume !(0 != ~b~0); {18396#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:34:03,707 INFO L290 TraceCheckUtils]: 85: Hoare triple {18400#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} assume !false; {18400#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-28 12:34:03,834 INFO L290 TraceCheckUtils]: 84: Hoare triple {18407#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {18400#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-28 12:34:03,835 INFO L290 TraceCheckUtils]: 83: Hoare triple {18411#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= ~b~0); {18407#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:34:03,836 INFO L290 TraceCheckUtils]: 82: Hoare triple {18411#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !false; {18411#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:34:04,045 INFO L290 TraceCheckUtils]: 81: Hoare triple {18418#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {18411#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:34:04,046 INFO L290 TraceCheckUtils]: 80: Hoare triple {18418#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= 2 * ~v~0); {18418#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:34:04,047 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} {18425#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #108#return; {18418#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:34:04,047 INFO L290 TraceCheckUtils]: 78: Hoare triple {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:34:04,048 INFO L290 TraceCheckUtils]: 77: Hoare triple {18435#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:34:04,048 INFO L290 TraceCheckUtils]: 76: Hoare triple {18091#true} ~cond := #in~cond; {18435#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 12:34:04,048 INFO L272 TraceCheckUtils]: 75: Hoare triple {18425#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {18091#true} is VALID [2022-04-28 12:34:04,049 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} {18442#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #106#return; {18425#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:34:04,049 INFO L290 TraceCheckUtils]: 73: Hoare triple {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:34:04,050 INFO L290 TraceCheckUtils]: 72: Hoare triple {18435#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:34:04,050 INFO L290 TraceCheckUtils]: 71: Hoare triple {18091#true} ~cond := #in~cond; {18435#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 12:34:04,050 INFO L272 TraceCheckUtils]: 70: Hoare triple {18442#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {18091#true} is VALID [2022-04-28 12:34:04,051 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} {18458#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #104#return; {18442#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:34:04,051 INFO L290 TraceCheckUtils]: 68: Hoare triple {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:34:04,051 INFO L290 TraceCheckUtils]: 67: Hoare triple {18435#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:34:04,052 INFO L290 TraceCheckUtils]: 66: Hoare triple {18091#true} ~cond := #in~cond; {18435#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 12:34:04,052 INFO L272 TraceCheckUtils]: 65: Hoare triple {18458#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18091#true} is VALID [2022-04-28 12:34:06,054 WARN L284 TraceCheckUtils]: 64: Hoare quadruple {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} {18091#true} #102#return; {18458#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is UNKNOWN [2022-04-28 12:34:06,055 INFO L290 TraceCheckUtils]: 63: Hoare triple {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:34:06,055 INFO L290 TraceCheckUtils]: 62: Hoare triple {18435#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {18293#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:34:06,055 INFO L290 TraceCheckUtils]: 61: Hoare triple {18091#true} ~cond := #in~cond; {18435#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 12:34:06,056 INFO L272 TraceCheckUtils]: 60: Hoare triple {18091#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18091#true} is VALID [2022-04-28 12:34:06,056 INFO L290 TraceCheckUtils]: 59: Hoare triple {18091#true} assume !false; {18091#true} is VALID [2022-04-28 12:34:06,056 INFO L290 TraceCheckUtils]: 58: Hoare triple {18091#true} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {18091#true} is VALID [2022-04-28 12:34:06,056 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {18091#true} {18091#true} #108#return; {18091#true} is VALID [2022-04-28 12:34:06,056 INFO L290 TraceCheckUtils]: 56: Hoare triple {18091#true} assume true; {18091#true} is VALID [2022-04-28 12:34:06,056 INFO L290 TraceCheckUtils]: 55: Hoare triple {18091#true} assume !(0 == ~cond); {18091#true} is VALID [2022-04-28 12:34:06,056 INFO L290 TraceCheckUtils]: 54: Hoare triple {18091#true} ~cond := #in~cond; {18091#true} is VALID [2022-04-28 12:34:06,056 INFO L272 TraceCheckUtils]: 53: Hoare triple {18091#true} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {18091#true} is VALID [2022-04-28 12:34:06,056 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {18091#true} {18091#true} #106#return; {18091#true} is VALID [2022-04-28 12:34:06,056 INFO L290 TraceCheckUtils]: 51: Hoare triple {18091#true} assume true; {18091#true} is VALID [2022-04-28 12:34:06,056 INFO L290 TraceCheckUtils]: 50: Hoare triple {18091#true} assume !(0 == ~cond); {18091#true} is VALID [2022-04-28 12:34:06,056 INFO L290 TraceCheckUtils]: 49: Hoare triple {18091#true} ~cond := #in~cond; {18091#true} is VALID [2022-04-28 12:34:06,056 INFO L272 TraceCheckUtils]: 48: Hoare triple {18091#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {18091#true} is VALID [2022-04-28 12:34:06,056 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {18091#true} {18091#true} #104#return; {18091#true} is VALID [2022-04-28 12:34:06,056 INFO L290 TraceCheckUtils]: 46: Hoare triple {18091#true} assume true; {18091#true} is VALID [2022-04-28 12:34:06,056 INFO L290 TraceCheckUtils]: 45: Hoare triple {18091#true} assume !(0 == ~cond); {18091#true} is VALID [2022-04-28 12:34:06,056 INFO L290 TraceCheckUtils]: 44: Hoare triple {18091#true} ~cond := #in~cond; {18091#true} is VALID [2022-04-28 12:34:06,056 INFO L272 TraceCheckUtils]: 43: Hoare triple {18091#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18091#true} is VALID [2022-04-28 12:34:06,056 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {18091#true} {18091#true} #102#return; {18091#true} is VALID [2022-04-28 12:34:06,057 INFO L290 TraceCheckUtils]: 41: Hoare triple {18091#true} assume true; {18091#true} is VALID [2022-04-28 12:34:06,057 INFO L290 TraceCheckUtils]: 40: Hoare triple {18091#true} assume !(0 == ~cond); {18091#true} is VALID [2022-04-28 12:34:06,057 INFO L290 TraceCheckUtils]: 39: Hoare triple {18091#true} ~cond := #in~cond; {18091#true} is VALID [2022-04-28 12:34:06,057 INFO L272 TraceCheckUtils]: 38: Hoare triple {18091#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18091#true} is VALID [2022-04-28 12:34:06,057 INFO L290 TraceCheckUtils]: 37: Hoare triple {18091#true} assume !false; {18091#true} is VALID [2022-04-28 12:34:06,057 INFO L290 TraceCheckUtils]: 36: Hoare triple {18091#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {18091#true} is VALID [2022-04-28 12:34:06,057 INFO L290 TraceCheckUtils]: 35: Hoare triple {18091#true} assume !false; {18091#true} is VALID [2022-04-28 12:34:06,057 INFO L290 TraceCheckUtils]: 34: Hoare triple {18091#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {18091#true} is VALID [2022-04-28 12:34:06,057 INFO L290 TraceCheckUtils]: 33: Hoare triple {18091#true} assume !false; {18091#true} is VALID [2022-04-28 12:34:06,057 INFO L290 TraceCheckUtils]: 32: Hoare triple {18091#true} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {18091#true} is VALID [2022-04-28 12:34:06,057 INFO L290 TraceCheckUtils]: 31: Hoare triple {18091#true} assume !(~c~0 >= ~b~0); {18091#true} is VALID [2022-04-28 12:34:06,057 INFO L290 TraceCheckUtils]: 30: Hoare triple {18091#true} assume !false; {18091#true} is VALID [2022-04-28 12:34:06,057 INFO L290 TraceCheckUtils]: 29: Hoare triple {18091#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {18091#true} is VALID [2022-04-28 12:34:06,057 INFO L290 TraceCheckUtils]: 28: Hoare triple {18091#true} assume !false; {18091#true} is VALID [2022-04-28 12:34:06,057 INFO L290 TraceCheckUtils]: 27: Hoare triple {18091#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {18091#true} is VALID [2022-04-28 12:34:06,057 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {18091#true} {18091#true} #100#return; {18091#true} is VALID [2022-04-28 12:34:06,057 INFO L290 TraceCheckUtils]: 25: Hoare triple {18091#true} assume true; {18091#true} is VALID [2022-04-28 12:34:06,057 INFO L290 TraceCheckUtils]: 24: Hoare triple {18091#true} assume !(0 == ~cond); {18091#true} is VALID [2022-04-28 12:34:06,057 INFO L290 TraceCheckUtils]: 23: Hoare triple {18091#true} ~cond := #in~cond; {18091#true} is VALID [2022-04-28 12:34:06,057 INFO L272 TraceCheckUtils]: 22: Hoare triple {18091#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {18091#true} is VALID [2022-04-28 12:34:06,058 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {18091#true} {18091#true} #98#return; {18091#true} is VALID [2022-04-28 12:34:06,058 INFO L290 TraceCheckUtils]: 20: Hoare triple {18091#true} assume true; {18091#true} is VALID [2022-04-28 12:34:06,058 INFO L290 TraceCheckUtils]: 19: Hoare triple {18091#true} assume !(0 == ~cond); {18091#true} is VALID [2022-04-28 12:34:06,058 INFO L290 TraceCheckUtils]: 18: Hoare triple {18091#true} ~cond := #in~cond; {18091#true} is VALID [2022-04-28 12:34:06,058 INFO L272 TraceCheckUtils]: 17: Hoare triple {18091#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {18091#true} is VALID [2022-04-28 12:34:06,058 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {18091#true} {18091#true} #96#return; {18091#true} is VALID [2022-04-28 12:34:06,058 INFO L290 TraceCheckUtils]: 15: Hoare triple {18091#true} assume true; {18091#true} is VALID [2022-04-28 12:34:06,058 INFO L290 TraceCheckUtils]: 14: Hoare triple {18091#true} assume !(0 == ~cond); {18091#true} is VALID [2022-04-28 12:34:06,058 INFO L290 TraceCheckUtils]: 13: Hoare triple {18091#true} ~cond := #in~cond; {18091#true} is VALID [2022-04-28 12:34:06,058 INFO L272 TraceCheckUtils]: 12: Hoare triple {18091#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {18091#true} is VALID [2022-04-28 12:34:06,058 INFO L290 TraceCheckUtils]: 11: Hoare triple {18091#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {18091#true} is VALID [2022-04-28 12:34:06,058 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18091#true} {18091#true} #94#return; {18091#true} is VALID [2022-04-28 12:34:06,058 INFO L290 TraceCheckUtils]: 9: Hoare triple {18091#true} assume true; {18091#true} is VALID [2022-04-28 12:34:06,058 INFO L290 TraceCheckUtils]: 8: Hoare triple {18091#true} assume !(0 == ~cond); {18091#true} is VALID [2022-04-28 12:34:06,058 INFO L290 TraceCheckUtils]: 7: Hoare triple {18091#true} ~cond := #in~cond; {18091#true} is VALID [2022-04-28 12:34:06,058 INFO L272 TraceCheckUtils]: 6: Hoare triple {18091#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {18091#true} is VALID [2022-04-28 12:34:06,058 INFO L290 TraceCheckUtils]: 5: Hoare triple {18091#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {18091#true} is VALID [2022-04-28 12:34:06,058 INFO L272 TraceCheckUtils]: 4: Hoare triple {18091#true} call #t~ret6 := main(); {18091#true} is VALID [2022-04-28 12:34:06,058 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18091#true} {18091#true} #112#return; {18091#true} is VALID [2022-04-28 12:34:06,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {18091#true} assume true; {18091#true} is VALID [2022-04-28 12:34:06,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {18091#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(11, 2);call #Ultimate.allocInit(12, 3); {18091#true} is VALID [2022-04-28 12:34:06,059 INFO L272 TraceCheckUtils]: 0: Hoare triple {18091#true} call ULTIMATE.init(); {18091#true} is VALID [2022-04-28 12:34:06,059 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 73 proven. 4 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-04-28 12:34:06,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:34:06,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822834140] [2022-04-28 12:34:06,059 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:34:06,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149050638] [2022-04-28 12:34:06,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149050638] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:34:06,059 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:34:06,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 14] total 32 [2022-04-28 12:34:06,060 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:34:06,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1332421671] [2022-04-28 12:34:06,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1332421671] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:34:06,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:34:06,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 12:34:06,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178639813] [2022-04-28 12:34:06,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:34:06,060 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 7 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) Word has length 91 [2022-04-28 12:34:06,060 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:34:06,061 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 7 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-28 12:34:06,147 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:34:06,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 12:34:06,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:34:06,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 12:34:06,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2022-04-28 12:34:06,148 INFO L87 Difference]: Start difference. First operand 225 states and 313 transitions. Second operand has 23 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 7 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-28 12:34:11,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:34:11,567 INFO L93 Difference]: Finished difference Result 328 states and 448 transitions. [2022-04-28 12:34:11,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 12:34:11,567 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 7 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) Word has length 91 [2022-04-28 12:34:11,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:34:11,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 7 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-28 12:34:11,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 181 transitions. [2022-04-28 12:34:11,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 7 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-28 12:34:11,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 181 transitions. [2022-04-28 12:34:11,579 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 181 transitions. [2022-04-28 12:34:11,787 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:34:11,804 INFO L225 Difference]: With dead ends: 328 [2022-04-28 12:34:11,804 INFO L226 Difference]: Without dead ends: 270 [2022-04-28 12:34:11,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 149 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=229, Invalid=1331, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 12:34:11,808 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 101 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 1158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-28 12:34:11,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 283 Invalid, 1158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-28 12:34:11,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-04-28 12:34:12,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 258. [2022-04-28 12:34:12,714 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:34:12,714 INFO L82 GeneralOperation]: Start isEquivalent. First operand 270 states. Second operand has 258 states, 144 states have (on average 1.1805555555555556) internal successors, (170), 145 states have internal predecessors, (170), 95 states have call successors, (95), 19 states have call predecessors, (95), 18 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2022-04-28 12:34:12,715 INFO L74 IsIncluded]: Start isIncluded. First operand 270 states. Second operand has 258 states, 144 states have (on average 1.1805555555555556) internal successors, (170), 145 states have internal predecessors, (170), 95 states have call successors, (95), 19 states have call predecessors, (95), 18 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2022-04-28 12:34:12,715 INFO L87 Difference]: Start difference. First operand 270 states. Second operand has 258 states, 144 states have (on average 1.1805555555555556) internal successors, (170), 145 states have internal predecessors, (170), 95 states have call successors, (95), 19 states have call predecessors, (95), 18 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2022-04-28 12:34:12,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:34:12,720 INFO L93 Difference]: Finished difference Result 270 states and 370 transitions. [2022-04-28 12:34:12,720 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 370 transitions. [2022-04-28 12:34:12,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:34:12,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:34:12,721 INFO L74 IsIncluded]: Start isIncluded. First operand has 258 states, 144 states have (on average 1.1805555555555556) internal successors, (170), 145 states have internal predecessors, (170), 95 states have call successors, (95), 19 states have call predecessors, (95), 18 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) Second operand 270 states. [2022-04-28 12:34:12,722 INFO L87 Difference]: Start difference. First operand has 258 states, 144 states have (on average 1.1805555555555556) internal successors, (170), 145 states have internal predecessors, (170), 95 states have call successors, (95), 19 states have call predecessors, (95), 18 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) Second operand 270 states. [2022-04-28 12:34:12,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:34:12,727 INFO L93 Difference]: Finished difference Result 270 states and 370 transitions. [2022-04-28 12:34:12,727 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 370 transitions. [2022-04-28 12:34:12,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:34:12,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:34:12,728 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:34:12,728 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:34:12,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 144 states have (on average 1.1805555555555556) internal successors, (170), 145 states have internal predecessors, (170), 95 states have call successors, (95), 19 states have call predecessors, (95), 18 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2022-04-28 12:34:12,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 358 transitions. [2022-04-28 12:34:12,734 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 358 transitions. Word has length 91 [2022-04-28 12:34:12,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:34:12,734 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 358 transitions. [2022-04-28 12:34:12,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 7 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-28 12:34:12,734 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 258 states and 358 transitions. [2022-04-28 12:34:13,411 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 358 edges. 358 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:34:13,412 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 358 transitions. [2022-04-28 12:34:13,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-04-28 12:34:13,416 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:34:13,416 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:34:13,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-28 12:34:13,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:34:13,632 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:34:13,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:34:13,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1948981098, now seen corresponding path program 5 times [2022-04-28 12:34:13,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:34:13,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1818794023] [2022-04-28 12:34:13,633 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:34:13,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1948981098, now seen corresponding path program 6 times [2022-04-28 12:34:13,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:34:13,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572832440] [2022-04-28 12:34:13,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:34:13,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:34:13,643 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:34:13,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1590122823] [2022-04-28 12:34:13,643 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 12:34:13,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:34:13,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:34:13,644 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-28 12:34:13,645 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-28 12:34:13,697 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 12:34:13,697 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:34:13,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 59 conjunts are in the unsatisfiable core [2022-04-28 12:34:13,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:34:13,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:34:15,500 INFO L272 TraceCheckUtils]: 0: Hoare triple {20396#true} call ULTIMATE.init(); {20396#true} is VALID [2022-04-28 12:34:15,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {20396#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(11, 2);call #Ultimate.allocInit(12, 3); {20396#true} is VALID [2022-04-28 12:34:15,500 INFO L290 TraceCheckUtils]: 2: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-28 12:34:15,500 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20396#true} {20396#true} #112#return; {20396#true} is VALID [2022-04-28 12:34:15,500 INFO L272 TraceCheckUtils]: 4: Hoare triple {20396#true} call #t~ret6 := main(); {20396#true} is VALID [2022-04-28 12:34:15,500 INFO L290 TraceCheckUtils]: 5: Hoare triple {20396#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {20396#true} is VALID [2022-04-28 12:34:15,500 INFO L272 TraceCheckUtils]: 6: Hoare triple {20396#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {20396#true} is VALID [2022-04-28 12:34:15,501 INFO L290 TraceCheckUtils]: 7: Hoare triple {20396#true} ~cond := #in~cond; {20422#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 12:34:15,501 INFO L290 TraceCheckUtils]: 8: Hoare triple {20422#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {20426#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:34:15,501 INFO L290 TraceCheckUtils]: 9: Hoare triple {20426#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {20426#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:34:15,502 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20426#(not (= |assume_abort_if_not_#in~cond| 0))} {20396#true} #94#return; {20433#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 12:34:15,502 INFO L290 TraceCheckUtils]: 11: Hoare triple {20433#(and (<= 0 main_~x~0) (<= main_~x~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {20433#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 12:34:15,502 INFO L272 TraceCheckUtils]: 12: Hoare triple {20433#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {20396#true} is VALID [2022-04-28 12:34:15,502 INFO L290 TraceCheckUtils]: 13: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-28 12:34:15,502 INFO L290 TraceCheckUtils]: 14: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-28 12:34:15,502 INFO L290 TraceCheckUtils]: 15: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-28 12:34:15,502 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {20396#true} {20433#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #96#return; {20433#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 12:34:15,503 INFO L272 TraceCheckUtils]: 17: Hoare triple {20433#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {20396#true} is VALID [2022-04-28 12:34:15,503 INFO L290 TraceCheckUtils]: 18: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-28 12:34:15,503 INFO L290 TraceCheckUtils]: 19: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-28 12:34:15,503 INFO L290 TraceCheckUtils]: 20: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-28 12:34:15,503 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {20396#true} {20433#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #98#return; {20433#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 12:34:15,503 INFO L272 TraceCheckUtils]: 22: Hoare triple {20433#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {20396#true} is VALID [2022-04-28 12:34:15,503 INFO L290 TraceCheckUtils]: 23: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-28 12:34:15,503 INFO L290 TraceCheckUtils]: 24: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-28 12:34:15,503 INFO L290 TraceCheckUtils]: 25: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-28 12:34:15,504 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {20396#true} {20433#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #100#return; {20433#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 12:34:15,504 INFO L290 TraceCheckUtils]: 27: Hoare triple {20433#(and (<= 0 main_~x~0) (<= main_~x~0 2))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {20485#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-28 12:34:15,504 INFO L290 TraceCheckUtils]: 28: Hoare triple {20485#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} assume !false; {20485#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-28 12:34:15,505 INFO L290 TraceCheckUtils]: 29: Hoare triple {20485#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {20492#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-28 12:34:15,505 INFO L290 TraceCheckUtils]: 30: Hoare triple {20492#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} assume !false; {20492#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-28 12:34:15,506 INFO L290 TraceCheckUtils]: 31: Hoare triple {20492#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {20492#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-28 12:34:15,506 INFO L290 TraceCheckUtils]: 32: Hoare triple {20492#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} assume !false; {20492#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-28 12:34:15,506 INFO L272 TraceCheckUtils]: 33: Hoare triple {20492#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {20396#true} is VALID [2022-04-28 12:34:15,506 INFO L290 TraceCheckUtils]: 34: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-28 12:34:15,506 INFO L290 TraceCheckUtils]: 35: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-28 12:34:15,506 INFO L290 TraceCheckUtils]: 36: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-28 12:34:15,507 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {20396#true} {20492#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #102#return; {20492#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-28 12:34:15,507 INFO L272 TraceCheckUtils]: 38: Hoare triple {20492#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {20396#true} is VALID [2022-04-28 12:34:15,507 INFO L290 TraceCheckUtils]: 39: Hoare triple {20396#true} ~cond := #in~cond; {20523#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:34:15,507 INFO L290 TraceCheckUtils]: 40: Hoare triple {20523#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {20527#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:34:15,508 INFO L290 TraceCheckUtils]: 41: Hoare triple {20527#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {20527#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:34:15,517 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {20527#(not (= |__VERIFIER_assert_#in~cond| 0))} {20492#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #104#return; {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-28 12:34:15,517 INFO L272 TraceCheckUtils]: 43: Hoare triple {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {20396#true} is VALID [2022-04-28 12:34:15,517 INFO L290 TraceCheckUtils]: 44: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-28 12:34:15,517 INFO L290 TraceCheckUtils]: 45: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-28 12:34:15,517 INFO L290 TraceCheckUtils]: 46: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-28 12:34:15,517 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {20396#true} {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #106#return; {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-28 12:34:15,517 INFO L272 TraceCheckUtils]: 48: Hoare triple {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {20396#true} is VALID [2022-04-28 12:34:15,518 INFO L290 TraceCheckUtils]: 49: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-28 12:34:15,518 INFO L290 TraceCheckUtils]: 50: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-28 12:34:15,518 INFO L290 TraceCheckUtils]: 51: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-28 12:34:15,518 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {20396#true} {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #108#return; {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-28 12:34:15,519 INFO L290 TraceCheckUtils]: 53: Hoare triple {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-28 12:34:15,519 INFO L290 TraceCheckUtils]: 54: Hoare triple {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} assume !false; {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-28 12:34:15,519 INFO L272 TraceCheckUtils]: 55: Hoare triple {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {20396#true} is VALID [2022-04-28 12:34:15,519 INFO L290 TraceCheckUtils]: 56: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-28 12:34:15,519 INFO L290 TraceCheckUtils]: 57: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-28 12:34:15,519 INFO L290 TraceCheckUtils]: 58: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-28 12:34:15,520 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {20396#true} {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #102#return; {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-28 12:34:15,520 INFO L272 TraceCheckUtils]: 60: Hoare triple {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {20396#true} is VALID [2022-04-28 12:34:15,520 INFO L290 TraceCheckUtils]: 61: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-28 12:34:15,520 INFO L290 TraceCheckUtils]: 62: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-28 12:34:15,520 INFO L290 TraceCheckUtils]: 63: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-28 12:34:15,521 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {20396#true} {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #104#return; {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-28 12:34:15,521 INFO L272 TraceCheckUtils]: 65: Hoare triple {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {20396#true} is VALID [2022-04-28 12:34:15,521 INFO L290 TraceCheckUtils]: 66: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-28 12:34:15,521 INFO L290 TraceCheckUtils]: 67: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-28 12:34:15,521 INFO L290 TraceCheckUtils]: 68: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-28 12:34:15,522 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {20396#true} {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #106#return; {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-28 12:34:15,522 INFO L272 TraceCheckUtils]: 70: Hoare triple {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {20396#true} is VALID [2022-04-28 12:34:15,522 INFO L290 TraceCheckUtils]: 71: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-28 12:34:15,522 INFO L290 TraceCheckUtils]: 72: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-28 12:34:15,522 INFO L290 TraceCheckUtils]: 73: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-28 12:34:15,523 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {20396#true} {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #108#return; {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-28 12:34:15,523 INFO L290 TraceCheckUtils]: 75: Hoare triple {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-28 12:34:15,523 INFO L290 TraceCheckUtils]: 76: Hoare triple {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} assume !false; {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-28 12:34:15,523 INFO L272 TraceCheckUtils]: 77: Hoare triple {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {20396#true} is VALID [2022-04-28 12:34:15,524 INFO L290 TraceCheckUtils]: 78: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-28 12:34:15,524 INFO L290 TraceCheckUtils]: 79: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-28 12:34:15,524 INFO L290 TraceCheckUtils]: 80: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-28 12:34:15,524 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {20396#true} {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #102#return; {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-28 12:34:15,524 INFO L272 TraceCheckUtils]: 82: Hoare triple {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {20396#true} is VALID [2022-04-28 12:34:15,524 INFO L290 TraceCheckUtils]: 83: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-28 12:34:15,524 INFO L290 TraceCheckUtils]: 84: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-28 12:34:15,524 INFO L290 TraceCheckUtils]: 85: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-28 12:34:15,525 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {20396#true} {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #104#return; {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-28 12:34:15,525 INFO L272 TraceCheckUtils]: 87: Hoare triple {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {20396#true} is VALID [2022-04-28 12:34:15,525 INFO L290 TraceCheckUtils]: 88: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-28 12:34:15,525 INFO L290 TraceCheckUtils]: 89: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-28 12:34:15,525 INFO L290 TraceCheckUtils]: 90: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-28 12:34:15,526 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {20396#true} {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #106#return; {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-28 12:34:15,526 INFO L272 TraceCheckUtils]: 92: Hoare triple {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {20396#true} is VALID [2022-04-28 12:34:15,526 INFO L290 TraceCheckUtils]: 93: Hoare triple {20396#true} ~cond := #in~cond; {20523#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:34:15,526 INFO L290 TraceCheckUtils]: 94: Hoare triple {20523#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {20527#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:34:15,527 INFO L290 TraceCheckUtils]: 95: Hoare triple {20527#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {20527#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:34:15,528 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {20527#(not (= |__VERIFIER_assert_#in~cond| 0))} {20534#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #108#return; {20697#(and (= main_~v~0 (* main_~d~0 main_~b~0)) (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-28 12:34:15,528 INFO L290 TraceCheckUtils]: 97: Hoare triple {20697#(and (= main_~v~0 (* main_~d~0 main_~b~0)) (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} assume !(~c~0 >= 2 * ~v~0); {20701#(and (= main_~v~0 (* main_~d~0 main_~b~0)) (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (not (<= (* main_~v~0 2) main_~c~0)) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-28 12:34:15,530 INFO L290 TraceCheckUtils]: 98: Hoare triple {20701#(and (= main_~v~0 (* main_~d~0 main_~b~0)) (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (not (<= (* main_~v~0 2) main_~c~0)) (= main_~c~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {20705#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (not (<= (* main_~b~0 main_~k~0) main_~c~0)) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-28 12:34:15,530 INFO L290 TraceCheckUtils]: 99: Hoare triple {20705#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (not (<= (* main_~b~0 main_~k~0) main_~c~0)) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (<= main_~x~0 2) (= main_~p~0 1))} assume !false; {20705#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (not (<= (* main_~b~0 main_~k~0) main_~c~0)) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-28 12:34:15,531 INFO L290 TraceCheckUtils]: 100: Hoare triple {20705#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (not (<= (* main_~b~0 main_~k~0) main_~c~0)) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~q~0 0) (<= main_~x~0 2) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {20712#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (not (<= (* main_~b~0 main_~k~0) main_~c~0)) (= main_~s~0 1) (<= 0 main_~x~0) (not (<= main_~b~0 main_~c~0)) (= main_~q~0 0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-28 12:34:15,533 INFO L290 TraceCheckUtils]: 101: Hoare triple {20712#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (not (<= (* main_~b~0 main_~k~0) main_~c~0)) (= main_~s~0 1) (<= 0 main_~x~0) (not (<= main_~b~0 main_~c~0)) (= main_~q~0 0) (<= main_~x~0 2) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {20716#(and (= (+ main_~y~0 (* main_~p~0 main_~x~0)) main_~a~0) (= main_~p~0 0) (= main_~b~0 (+ main_~x~0 (* main_~a~0 main_~s~0))) (<= 0 main_~x~0) (= main_~r~0 1) (= (+ main_~q~0 (* main_~p~0 (* (- 1) main_~s~0))) 1) (not (<= 0 (+ main_~x~0 (* 2 (* main_~a~0 main_~s~0))))) (not (<= main_~a~0 (+ main_~x~0 (* main_~a~0 main_~s~0)))) (<= main_~x~0 2))} is VALID [2022-04-28 12:34:15,533 INFO L290 TraceCheckUtils]: 102: Hoare triple {20716#(and (= (+ main_~y~0 (* main_~p~0 main_~x~0)) main_~a~0) (= main_~p~0 0) (= main_~b~0 (+ main_~x~0 (* main_~a~0 main_~s~0))) (<= 0 main_~x~0) (= main_~r~0 1) (= (+ main_~q~0 (* main_~p~0 (* (- 1) main_~s~0))) 1) (not (<= 0 (+ main_~x~0 (* 2 (* main_~a~0 main_~s~0))))) (not (<= main_~a~0 (+ main_~x~0 (* main_~a~0 main_~s~0)))) (<= main_~x~0 2))} assume !false; {20716#(and (= (+ main_~y~0 (* main_~p~0 main_~x~0)) main_~a~0) (= main_~p~0 0) (= main_~b~0 (+ main_~x~0 (* main_~a~0 main_~s~0))) (<= 0 main_~x~0) (= main_~r~0 1) (= (+ main_~q~0 (* main_~p~0 (* (- 1) main_~s~0))) 1) (not (<= 0 (+ main_~x~0 (* 2 (* main_~a~0 main_~s~0))))) (not (<= main_~a~0 (+ main_~x~0 (* main_~a~0 main_~s~0)))) (<= main_~x~0 2))} is VALID [2022-04-28 12:34:15,534 INFO L290 TraceCheckUtils]: 103: Hoare triple {20716#(and (= (+ main_~y~0 (* main_~p~0 main_~x~0)) main_~a~0) (= main_~p~0 0) (= main_~b~0 (+ main_~x~0 (* main_~a~0 main_~s~0))) (<= 0 main_~x~0) (= main_~r~0 1) (= (+ main_~q~0 (* main_~p~0 (* (- 1) main_~s~0))) 1) (not (<= 0 (+ main_~x~0 (* 2 (* main_~a~0 main_~s~0))))) (not (<= main_~a~0 (+ main_~x~0 (* main_~a~0 main_~s~0)))) (<= main_~x~0 2))} assume !(0 != ~b~0); {20723#(and (= (+ main_~y~0 (* main_~p~0 main_~x~0)) main_~a~0) (= (+ main_~x~0 (* main_~a~0 main_~s~0)) 0) (< (+ main_~x~0 (* 2 (* main_~a~0 main_~s~0))) 0) (= main_~p~0 0) (< (+ main_~x~0 (* main_~a~0 main_~s~0)) main_~a~0) (= main_~r~0 1) (= main_~q~0 (+ (* main_~p~0 main_~s~0) 1)) (<= main_~x~0 2))} is VALID [2022-04-28 12:34:15,536 INFO L272 TraceCheckUtils]: 104: Hoare triple {20723#(and (= (+ main_~y~0 (* main_~p~0 main_~x~0)) main_~a~0) (= (+ main_~x~0 (* main_~a~0 main_~s~0)) 0) (< (+ main_~x~0 (* 2 (* main_~a~0 main_~s~0))) 0) (= main_~p~0 0) (< (+ main_~x~0 (* main_~a~0 main_~s~0)) main_~a~0) (= main_~r~0 1) (= main_~q~0 (+ (* main_~p~0 main_~s~0) 1)) (<= main_~x~0 2))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {20727#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:34:15,536 INFO L290 TraceCheckUtils]: 105: Hoare triple {20727#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20731#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:34:15,537 INFO L290 TraceCheckUtils]: 106: Hoare triple {20731#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20397#false} is VALID [2022-04-28 12:34:15,537 INFO L290 TraceCheckUtils]: 107: Hoare triple {20397#false} assume !false; {20397#false} is VALID [2022-04-28 12:34:15,537 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 63 proven. 42 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2022-04-28 12:34:15,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:34:34,235 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 12:42:59,092 INFO L290 TraceCheckUtils]: 107: Hoare triple {20397#false} assume !false; {20397#false} is VALID [2022-04-28 12:42:59,093 INFO L290 TraceCheckUtils]: 106: Hoare triple {20731#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20397#false} is VALID [2022-04-28 12:42:59,093 INFO L290 TraceCheckUtils]: 105: Hoare triple {20727#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20731#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:42:59,094 INFO L272 TraceCheckUtils]: 104: Hoare triple {20747#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {20727#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:42:59,094 INFO L290 TraceCheckUtils]: 103: Hoare triple {20751#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} assume !(0 != ~b~0); {20747#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:42:59,094 INFO L290 TraceCheckUtils]: 102: Hoare triple {20751#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} assume !false; {20751#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-28 12:42:59,139 INFO L290 TraceCheckUtils]: 101: Hoare triple {20758#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {20751#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-28 12:42:59,139 INFO L290 TraceCheckUtils]: 100: Hoare triple {20762#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= ~b~0); {20758#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:42:59,140 INFO L290 TraceCheckUtils]: 99: Hoare triple {20762#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !false; {20762#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:42:59,558 INFO L290 TraceCheckUtils]: 98: Hoare triple {20769#(or (<= (+ main_~b~0 main_~v~0) main_~c~0) (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {20762#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:42:59,559 INFO L290 TraceCheckUtils]: 97: Hoare triple {20773#(or (<= (* main_~v~0 2) main_~c~0) (<= (+ main_~b~0 main_~v~0) main_~c~0) (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= 2 * ~v~0); {20769#(or (<= (+ main_~b~0 main_~v~0) main_~c~0) (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:43:01,562 WARN L284 TraceCheckUtils]: 96: Hoare quadruple {20527#(not (= |__VERIFIER_assert_#in~cond| 0))} {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} #108#return; {20773#(or (<= (* main_~v~0 2) main_~c~0) (<= (+ main_~b~0 main_~v~0) main_~c~0) (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is UNKNOWN [2022-04-28 12:43:01,562 INFO L290 TraceCheckUtils]: 95: Hoare triple {20527#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {20527#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:43:01,563 INFO L290 TraceCheckUtils]: 94: Hoare triple {20787#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {20527#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:43:01,563 INFO L290 TraceCheckUtils]: 93: Hoare triple {20396#true} ~cond := #in~cond; {20787#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 12:43:01,563 INFO L272 TraceCheckUtils]: 92: Hoare triple {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {20396#true} is VALID [2022-04-28 12:43:01,564 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {20396#true} {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} #106#return; {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:43:01,564 INFO L290 TraceCheckUtils]: 90: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-28 12:43:01,564 INFO L290 TraceCheckUtils]: 89: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-28 12:43:01,564 INFO L290 TraceCheckUtils]: 88: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-28 12:43:01,564 INFO L272 TraceCheckUtils]: 87: Hoare triple {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {20396#true} is VALID [2022-04-28 12:43:01,565 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {20396#true} {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} #104#return; {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:43:01,565 INFO L290 TraceCheckUtils]: 85: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-28 12:43:01,565 INFO L290 TraceCheckUtils]: 84: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-28 12:43:01,565 INFO L290 TraceCheckUtils]: 83: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-28 12:43:01,565 INFO L272 TraceCheckUtils]: 82: Hoare triple {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {20396#true} is VALID [2022-04-28 12:43:01,566 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {20396#true} {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} #102#return; {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:43:01,566 INFO L290 TraceCheckUtils]: 80: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-28 12:43:01,566 INFO L290 TraceCheckUtils]: 79: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-28 12:43:01,566 INFO L290 TraceCheckUtils]: 78: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-28 12:43:01,566 INFO L272 TraceCheckUtils]: 77: Hoare triple {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {20396#true} is VALID [2022-04-28 12:43:01,567 INFO L290 TraceCheckUtils]: 76: Hoare triple {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !false; {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:43:01,567 INFO L290 TraceCheckUtils]: 75: Hoare triple {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:43:01,568 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {20396#true} {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} #108#return; {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:43:01,568 INFO L290 TraceCheckUtils]: 73: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-28 12:43:01,568 INFO L290 TraceCheckUtils]: 72: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-28 12:43:01,568 INFO L290 TraceCheckUtils]: 71: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-28 12:43:01,568 INFO L272 TraceCheckUtils]: 70: Hoare triple {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {20396#true} is VALID [2022-04-28 12:43:01,569 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {20396#true} {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} #106#return; {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:43:01,569 INFO L290 TraceCheckUtils]: 68: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-28 12:43:01,569 INFO L290 TraceCheckUtils]: 67: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-28 12:43:01,569 INFO L290 TraceCheckUtils]: 66: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-28 12:43:01,569 INFO L272 TraceCheckUtils]: 65: Hoare triple {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {20396#true} is VALID [2022-04-28 12:43:01,569 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {20396#true} {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} #104#return; {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:43:01,570 INFO L290 TraceCheckUtils]: 63: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-28 12:43:01,570 INFO L290 TraceCheckUtils]: 62: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-28 12:43:01,570 INFO L290 TraceCheckUtils]: 61: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-28 12:43:01,570 INFO L272 TraceCheckUtils]: 60: Hoare triple {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {20396#true} is VALID [2022-04-28 12:43:01,570 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {20396#true} {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} #102#return; {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:43:01,570 INFO L290 TraceCheckUtils]: 58: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-28 12:43:01,570 INFO L290 TraceCheckUtils]: 57: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-28 12:43:01,570 INFO L290 TraceCheckUtils]: 56: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-28 12:43:01,571 INFO L272 TraceCheckUtils]: 55: Hoare triple {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {20396#true} is VALID [2022-04-28 12:43:01,571 INFO L290 TraceCheckUtils]: 54: Hoare triple {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !false; {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:43:01,571 INFO L290 TraceCheckUtils]: 53: Hoare triple {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:43:01,572 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {20396#true} {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} #108#return; {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:43:01,572 INFO L290 TraceCheckUtils]: 51: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-28 12:43:01,572 INFO L290 TraceCheckUtils]: 50: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-28 12:43:01,572 INFO L290 TraceCheckUtils]: 49: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-28 12:43:01,572 INFO L272 TraceCheckUtils]: 48: Hoare triple {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {20396#true} is VALID [2022-04-28 12:43:01,573 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {20396#true} {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} #106#return; {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:43:01,573 INFO L290 TraceCheckUtils]: 46: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-28 12:43:01,573 INFO L290 TraceCheckUtils]: 45: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-28 12:43:01,573 INFO L290 TraceCheckUtils]: 44: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-28 12:43:01,573 INFO L272 TraceCheckUtils]: 43: Hoare triple {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {20396#true} is VALID [2022-04-28 12:43:01,574 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {20527#(not (= |__VERIFIER_assert_#in~cond| 0))} {20941#(or (not (= (mod main_~c~0 main_~b~0) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} #104#return; {20777#(or (not (= (mod main_~c~0 main_~b~0) 0)) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:43:01,575 INFO L290 TraceCheckUtils]: 41: Hoare triple {20527#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {20527#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:43:01,575 INFO L290 TraceCheckUtils]: 40: Hoare triple {20787#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {20527#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:43:01,575 INFO L290 TraceCheckUtils]: 39: Hoare triple {20396#true} ~cond := #in~cond; {20787#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 12:43:01,575 INFO L272 TraceCheckUtils]: 38: Hoare triple {20941#(or (not (= (mod main_~c~0 main_~b~0) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {20396#true} is VALID [2022-04-28 12:43:01,576 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {20396#true} {20941#(or (not (= (mod main_~c~0 main_~b~0) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} #102#return; {20941#(or (not (= (mod main_~c~0 main_~b~0) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:43:01,576 INFO L290 TraceCheckUtils]: 36: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-28 12:43:01,576 INFO L290 TraceCheckUtils]: 35: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-28 12:43:01,576 INFO L290 TraceCheckUtils]: 34: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-28 12:43:01,576 INFO L272 TraceCheckUtils]: 33: Hoare triple {20941#(or (not (= (mod main_~c~0 main_~b~0) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {20396#true} is VALID [2022-04-28 12:43:01,577 INFO L290 TraceCheckUtils]: 32: Hoare triple {20941#(or (not (= (mod main_~c~0 main_~b~0) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !false; {20941#(or (not (= (mod main_~c~0 main_~b~0) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:43:01,577 INFO L290 TraceCheckUtils]: 31: Hoare triple {20941#(or (not (= (mod main_~c~0 main_~b~0) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {20941#(or (not (= (mod main_~c~0 main_~b~0) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:43:01,578 INFO L290 TraceCheckUtils]: 30: Hoare triple {20941#(or (not (= (mod main_~c~0 main_~b~0) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !false; {20941#(or (not (= (mod main_~c~0 main_~b~0) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:43:01,578 INFO L290 TraceCheckUtils]: 29: Hoare triple {20981#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 0) (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~y~0 main_~s~0 0) (* main_~y~0 main_~s~0) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0)))) (<= main_~a~0 0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {20941#(or (not (= (mod main_~c~0 main_~b~0) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (<= main_~c~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~y~0 main_~s~0 (div main_~c~0 main_~b~0)) (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 (div main_~c~0 main_~b~0)) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:43:01,579 INFO L290 TraceCheckUtils]: 28: Hoare triple {20981#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 0) (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~y~0 main_~s~0 0) (* main_~y~0 main_~s~0) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0)))) (<= main_~a~0 0))} assume !false; {20981#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 0) (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~y~0 main_~s~0 0) (* main_~y~0 main_~s~0) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0)))) (<= main_~a~0 0))} is VALID [2022-04-28 12:43:01,580 INFO L290 TraceCheckUtils]: 27: Hoare triple {20396#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {20981#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~q~0 main_~x~0 0) (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~y~0 main_~s~0 0) (* main_~y~0 main_~s~0) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0)))) (<= main_~a~0 0))} is VALID [2022-04-28 12:43:01,580 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {20396#true} {20396#true} #100#return; {20396#true} is VALID [2022-04-28 12:43:01,580 INFO L290 TraceCheckUtils]: 25: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-28 12:43:01,580 INFO L290 TraceCheckUtils]: 24: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-28 12:43:01,580 INFO L290 TraceCheckUtils]: 23: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-28 12:43:01,580 INFO L272 TraceCheckUtils]: 22: Hoare triple {20396#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {20396#true} is VALID [2022-04-28 12:43:01,580 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {20396#true} {20396#true} #98#return; {20396#true} is VALID [2022-04-28 12:43:01,580 INFO L290 TraceCheckUtils]: 20: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-28 12:43:01,580 INFO L290 TraceCheckUtils]: 19: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-28 12:43:01,580 INFO L290 TraceCheckUtils]: 18: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-28 12:43:01,580 INFO L272 TraceCheckUtils]: 17: Hoare triple {20396#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {20396#true} is VALID [2022-04-28 12:43:01,580 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {20396#true} {20396#true} #96#return; {20396#true} is VALID [2022-04-28 12:43:01,580 INFO L290 TraceCheckUtils]: 15: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-28 12:43:01,580 INFO L290 TraceCheckUtils]: 14: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-28 12:43:01,580 INFO L290 TraceCheckUtils]: 13: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-28 12:43:01,580 INFO L272 TraceCheckUtils]: 12: Hoare triple {20396#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {20396#true} is VALID [2022-04-28 12:43:01,581 INFO L290 TraceCheckUtils]: 11: Hoare triple {20396#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {20396#true} is VALID [2022-04-28 12:43:01,581 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20396#true} {20396#true} #94#return; {20396#true} is VALID [2022-04-28 12:43:01,581 INFO L290 TraceCheckUtils]: 9: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-28 12:43:01,581 INFO L290 TraceCheckUtils]: 8: Hoare triple {20396#true} assume !(0 == ~cond); {20396#true} is VALID [2022-04-28 12:43:01,581 INFO L290 TraceCheckUtils]: 7: Hoare triple {20396#true} ~cond := #in~cond; {20396#true} is VALID [2022-04-28 12:43:01,581 INFO L272 TraceCheckUtils]: 6: Hoare triple {20396#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {20396#true} is VALID [2022-04-28 12:43:01,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {20396#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {20396#true} is VALID [2022-04-28 12:43:01,581 INFO L272 TraceCheckUtils]: 4: Hoare triple {20396#true} call #t~ret6 := main(); {20396#true} is VALID [2022-04-28 12:43:01,581 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20396#true} {20396#true} #112#return; {20396#true} is VALID [2022-04-28 12:43:01,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {20396#true} assume true; {20396#true} is VALID [2022-04-28 12:43:01,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {20396#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(11, 2);call #Ultimate.allocInit(12, 3); {20396#true} is VALID [2022-04-28 12:43:01,581 INFO L272 TraceCheckUtils]: 0: Hoare triple {20396#true} call ULTIMATE.init(); {20396#true} is VALID [2022-04-28 12:43:01,582 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 61 proven. 35 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-04-28 12:43:01,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:43:01,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572832440] [2022-04-28 12:43:01,582 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:43:01,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590122823] [2022-04-28 12:43:01,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590122823] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:43:01,582 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:43:01,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 28 [2022-04-28 12:43:01,582 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:43:01,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1818794023] [2022-04-28 12:43:01,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1818794023] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:43:01,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:43:01,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 12:43:01,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232927817] [2022-04-28 12:43:01,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:43:01,583 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 5 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) Word has length 108 [2022-04-28 12:43:01,583 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:43:01,588 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 5 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 12:43:01,646 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:43:01,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 12:43:01,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:43:01,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 12:43:01,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2022-04-28 12:43:01,647 INFO L87 Difference]: Start difference. First operand 258 states and 358 transitions. Second operand has 18 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 5 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 12:43:06,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:43:06,500 INFO L93 Difference]: Finished difference Result 330 states and 459 transitions. [2022-04-28 12:43:06,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 12:43:06,500 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 5 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) Word has length 108 [2022-04-28 12:43:06,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:43:06,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 5 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 12:43:06,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 128 transitions. [2022-04-28 12:43:06,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 5 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 12:43:06,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 128 transitions. [2022-04-28 12:43:06,504 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 128 transitions. [2022-04-28 12:43:06,666 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:43:06,672 INFO L225 Difference]: With dead ends: 330 [2022-04-28 12:43:06,673 INFO L226 Difference]: Without dead ends: 327 [2022-04-28 12:43:06,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 188 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=231, Invalid=1175, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 12:43:06,674 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 70 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-28 12:43:06,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 256 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-28 12:43:06,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2022-04-28 12:43:07,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 317. [2022-04-28 12:43:07,863 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:43:07,863 INFO L82 GeneralOperation]: Start isEquivalent. First operand 327 states. Second operand has 317 states, 176 states have (on average 1.1875) internal successors, (209), 177 states have internal predecessors, (209), 119 states have call successors, (119), 22 states have call predecessors, (119), 21 states have return successors, (117), 117 states have call predecessors, (117), 117 states have call successors, (117) [2022-04-28 12:43:07,863 INFO L74 IsIncluded]: Start isIncluded. First operand 327 states. Second operand has 317 states, 176 states have (on average 1.1875) internal successors, (209), 177 states have internal predecessors, (209), 119 states have call successors, (119), 22 states have call predecessors, (119), 21 states have return successors, (117), 117 states have call predecessors, (117), 117 states have call successors, (117) [2022-04-28 12:43:07,864 INFO L87 Difference]: Start difference. First operand 327 states. Second operand has 317 states, 176 states have (on average 1.1875) internal successors, (209), 177 states have internal predecessors, (209), 119 states have call successors, (119), 22 states have call predecessors, (119), 21 states have return successors, (117), 117 states have call predecessors, (117), 117 states have call successors, (117) [2022-04-28 12:43:07,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:43:07,870 INFO L93 Difference]: Finished difference Result 327 states and 455 transitions. [2022-04-28 12:43:07,870 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 455 transitions. [2022-04-28 12:43:07,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:43:07,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:43:07,871 INFO L74 IsIncluded]: Start isIncluded. First operand has 317 states, 176 states have (on average 1.1875) internal successors, (209), 177 states have internal predecessors, (209), 119 states have call successors, (119), 22 states have call predecessors, (119), 21 states have return successors, (117), 117 states have call predecessors, (117), 117 states have call successors, (117) Second operand 327 states. [2022-04-28 12:43:07,872 INFO L87 Difference]: Start difference. First operand has 317 states, 176 states have (on average 1.1875) internal successors, (209), 177 states have internal predecessors, (209), 119 states have call successors, (119), 22 states have call predecessors, (119), 21 states have return successors, (117), 117 states have call predecessors, (117), 117 states have call successors, (117) Second operand 327 states. [2022-04-28 12:43:07,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:43:07,878 INFO L93 Difference]: Finished difference Result 327 states and 455 transitions. [2022-04-28 12:43:07,878 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 455 transitions. [2022-04-28 12:43:07,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:43:07,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:43:07,879 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:43:07,879 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:43:07,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 176 states have (on average 1.1875) internal successors, (209), 177 states have internal predecessors, (209), 119 states have call successors, (119), 22 states have call predecessors, (119), 21 states have return successors, (117), 117 states have call predecessors, (117), 117 states have call successors, (117) [2022-04-28 12:43:07,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 445 transitions. [2022-04-28 12:43:07,887 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 445 transitions. Word has length 108 [2022-04-28 12:43:07,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:43:07,887 INFO L495 AbstractCegarLoop]: Abstraction has 317 states and 445 transitions. [2022-04-28 12:43:07,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 5 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 12:43:07,887 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 317 states and 445 transitions. [2022-04-28 12:43:08,850 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 445 edges. 445 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:43:08,850 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 445 transitions. [2022-04-28 12:43:08,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-04-28 12:43:08,852 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:43:08,852 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:43:08,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-28 12:43:09,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-28 12:43:09,070 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:43:09,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:43:09,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1002671399, now seen corresponding path program 7 times [2022-04-28 12:43:09,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:43:09,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1883374215] [2022-04-28 12:43:09,070 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:43:09,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1002671399, now seen corresponding path program 8 times [2022-04-28 12:43:09,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:43:09,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463751082] [2022-04-28 12:43:09,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:43:09,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:43:09,080 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:43:09,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [785027083] [2022-04-28 12:43:09,080 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:43:09,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:43:09,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:43:09,081 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:43:09,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-28 12:43:09,131 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:43:09,131 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:43:09,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 12:43:09,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:43:09,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:43:09,884 INFO L272 TraceCheckUtils]: 0: Hoare triple {23039#true} call ULTIMATE.init(); {23039#true} is VALID [2022-04-28 12:43:09,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {23039#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(11, 2);call #Ultimate.allocInit(12, 3); {23039#true} is VALID [2022-04-28 12:43:09,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-28 12:43:09,884 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23039#true} {23039#true} #112#return; {23039#true} is VALID [2022-04-28 12:43:09,884 INFO L272 TraceCheckUtils]: 4: Hoare triple {23039#true} call #t~ret6 := main(); {23039#true} is VALID [2022-04-28 12:43:09,884 INFO L290 TraceCheckUtils]: 5: Hoare triple {23039#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {23039#true} is VALID [2022-04-28 12:43:09,885 INFO L272 TraceCheckUtils]: 6: Hoare triple {23039#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {23039#true} is VALID [2022-04-28 12:43:09,885 INFO L290 TraceCheckUtils]: 7: Hoare triple {23039#true} ~cond := #in~cond; {23065#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 12:43:09,885 INFO L290 TraceCheckUtils]: 8: Hoare triple {23065#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {23069#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:43:09,885 INFO L290 TraceCheckUtils]: 9: Hoare triple {23069#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {23069#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:43:09,886 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23069#(not (= |assume_abort_if_not_#in~cond| 0))} {23039#true} #94#return; {23076#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 12:43:09,886 INFO L290 TraceCheckUtils]: 11: Hoare triple {23076#(and (<= 0 main_~x~0) (<= main_~x~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {23076#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 12:43:09,886 INFO L272 TraceCheckUtils]: 12: Hoare triple {23076#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {23039#true} is VALID [2022-04-28 12:43:09,886 INFO L290 TraceCheckUtils]: 13: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-28 12:43:09,886 INFO L290 TraceCheckUtils]: 14: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-28 12:43:09,886 INFO L290 TraceCheckUtils]: 15: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-28 12:43:09,887 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {23039#true} {23076#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #96#return; {23076#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 12:43:09,887 INFO L272 TraceCheckUtils]: 17: Hoare triple {23076#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {23039#true} is VALID [2022-04-28 12:43:09,887 INFO L290 TraceCheckUtils]: 18: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-28 12:43:09,887 INFO L290 TraceCheckUtils]: 19: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-28 12:43:09,887 INFO L290 TraceCheckUtils]: 20: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-28 12:43:09,887 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {23039#true} {23076#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #98#return; {23076#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 12:43:09,887 INFO L272 TraceCheckUtils]: 22: Hoare triple {23076#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {23039#true} is VALID [2022-04-28 12:43:09,887 INFO L290 TraceCheckUtils]: 23: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-28 12:43:09,887 INFO L290 TraceCheckUtils]: 24: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-28 12:43:09,887 INFO L290 TraceCheckUtils]: 25: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-28 12:43:09,888 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {23039#true} {23076#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #100#return; {23076#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 12:43:09,888 INFO L290 TraceCheckUtils]: 27: Hoare triple {23076#(and (<= 0 main_~x~0) (<= main_~x~0 2))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {23128#(<= main_~a~0 2)} is VALID [2022-04-28 12:43:09,888 INFO L290 TraceCheckUtils]: 28: Hoare triple {23128#(<= main_~a~0 2)} assume !false; {23128#(<= main_~a~0 2)} is VALID [2022-04-28 12:43:09,889 INFO L290 TraceCheckUtils]: 29: Hoare triple {23128#(<= main_~a~0 2)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {23135#(<= main_~c~0 2)} is VALID [2022-04-28 12:43:09,889 INFO L290 TraceCheckUtils]: 30: Hoare triple {23135#(<= main_~c~0 2)} assume !false; {23135#(<= main_~c~0 2)} is VALID [2022-04-28 12:43:09,889 INFO L290 TraceCheckUtils]: 31: Hoare triple {23135#(<= main_~c~0 2)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {23142#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} is VALID [2022-04-28 12:43:09,889 INFO L290 TraceCheckUtils]: 32: Hoare triple {23142#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} assume !false; {23142#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} is VALID [2022-04-28 12:43:09,889 INFO L272 TraceCheckUtils]: 33: Hoare triple {23142#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {23039#true} is VALID [2022-04-28 12:43:09,890 INFO L290 TraceCheckUtils]: 34: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-28 12:43:09,890 INFO L290 TraceCheckUtils]: 35: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-28 12:43:09,890 INFO L290 TraceCheckUtils]: 36: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-28 12:43:09,890 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {23039#true} {23142#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} #102#return; {23142#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} is VALID [2022-04-28 12:43:09,890 INFO L272 TraceCheckUtils]: 38: Hoare triple {23142#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {23039#true} is VALID [2022-04-28 12:43:09,890 INFO L290 TraceCheckUtils]: 39: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-28 12:43:09,890 INFO L290 TraceCheckUtils]: 40: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-28 12:43:09,890 INFO L290 TraceCheckUtils]: 41: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-28 12:43:09,891 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {23039#true} {23142#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} #104#return; {23142#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} is VALID [2022-04-28 12:43:09,891 INFO L272 TraceCheckUtils]: 43: Hoare triple {23142#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {23039#true} is VALID [2022-04-28 12:43:09,891 INFO L290 TraceCheckUtils]: 44: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-28 12:43:09,891 INFO L290 TraceCheckUtils]: 45: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-28 12:43:09,891 INFO L290 TraceCheckUtils]: 46: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-28 12:43:09,892 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {23039#true} {23142#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} #106#return; {23142#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} is VALID [2022-04-28 12:43:09,892 INFO L272 TraceCheckUtils]: 48: Hoare triple {23142#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {23039#true} is VALID [2022-04-28 12:43:09,892 INFO L290 TraceCheckUtils]: 49: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-28 12:43:09,892 INFO L290 TraceCheckUtils]: 50: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-28 12:43:09,892 INFO L290 TraceCheckUtils]: 51: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-28 12:43:09,892 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {23039#true} {23142#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} #108#return; {23142#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} is VALID [2022-04-28 12:43:09,893 INFO L290 TraceCheckUtils]: 53: Hoare triple {23142#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {23209#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-28 12:43:09,893 INFO L290 TraceCheckUtils]: 54: Hoare triple {23209#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} assume !false; {23209#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-28 12:43:09,893 INFO L272 TraceCheckUtils]: 55: Hoare triple {23209#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {23039#true} is VALID [2022-04-28 12:43:09,893 INFO L290 TraceCheckUtils]: 56: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-28 12:43:09,893 INFO L290 TraceCheckUtils]: 57: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-28 12:43:09,893 INFO L290 TraceCheckUtils]: 58: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-28 12:43:09,894 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {23039#true} {23209#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} #102#return; {23209#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-28 12:43:09,894 INFO L272 TraceCheckUtils]: 60: Hoare triple {23209#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {23039#true} is VALID [2022-04-28 12:43:09,894 INFO L290 TraceCheckUtils]: 61: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-28 12:43:09,894 INFO L290 TraceCheckUtils]: 62: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-28 12:43:09,894 INFO L290 TraceCheckUtils]: 63: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-28 12:43:09,895 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {23039#true} {23209#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} #104#return; {23209#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-28 12:43:09,895 INFO L272 TraceCheckUtils]: 65: Hoare triple {23209#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {23039#true} is VALID [2022-04-28 12:43:09,895 INFO L290 TraceCheckUtils]: 66: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-28 12:43:09,895 INFO L290 TraceCheckUtils]: 67: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-28 12:43:09,895 INFO L290 TraceCheckUtils]: 68: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-28 12:43:09,895 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {23039#true} {23209#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} #106#return; {23209#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-28 12:43:09,895 INFO L272 TraceCheckUtils]: 70: Hoare triple {23209#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {23039#true} is VALID [2022-04-28 12:43:09,895 INFO L290 TraceCheckUtils]: 71: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-28 12:43:09,895 INFO L290 TraceCheckUtils]: 72: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-28 12:43:09,895 INFO L290 TraceCheckUtils]: 73: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-28 12:43:09,896 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {23039#true} {23209#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} #108#return; {23209#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-28 12:43:09,896 INFO L290 TraceCheckUtils]: 75: Hoare triple {23209#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} assume !(~c~0 >= 2 * ~v~0); {23276#(and (<= main_~c~0 2) (not (<= (* main_~v~0 2) main_~c~0)) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-28 12:43:09,897 INFO L290 TraceCheckUtils]: 76: Hoare triple {23276#(and (<= main_~c~0 2) (not (<= (* main_~v~0 2) main_~c~0)) (<= (div (- main_~v~0) (- 2)) main_~b~0))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {23280#(and (< (* main_~c~0 2) 2) (< (div (+ (- 1) (* (- 1) main_~c~0)) (- 2)) (+ main_~b~0 1)))} is VALID [2022-04-28 12:43:09,897 INFO L290 TraceCheckUtils]: 77: Hoare triple {23280#(and (< (* main_~c~0 2) 2) (< (div (+ (- 1) (* (- 1) main_~c~0)) (- 2)) (+ main_~b~0 1)))} assume !false; {23280#(and (< (* main_~c~0 2) 2) (< (div (+ (- 1) (* (- 1) main_~c~0)) (- 2)) (+ main_~b~0 1)))} is VALID [2022-04-28 12:43:09,899 INFO L290 TraceCheckUtils]: 78: Hoare triple {23280#(and (< (* main_~c~0 2) 2) (< (div (+ (- 1) (* (- 1) main_~c~0)) (- 2)) (+ main_~b~0 1)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {23040#false} is VALID [2022-04-28 12:43:09,899 INFO L290 TraceCheckUtils]: 79: Hoare triple {23040#false} assume !false; {23040#false} is VALID [2022-04-28 12:43:09,899 INFO L272 TraceCheckUtils]: 80: Hoare triple {23040#false} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {23040#false} is VALID [2022-04-28 12:43:09,899 INFO L290 TraceCheckUtils]: 81: Hoare triple {23040#false} ~cond := #in~cond; {23040#false} is VALID [2022-04-28 12:43:09,899 INFO L290 TraceCheckUtils]: 82: Hoare triple {23040#false} assume !(0 == ~cond); {23040#false} is VALID [2022-04-28 12:43:09,899 INFO L290 TraceCheckUtils]: 83: Hoare triple {23040#false} assume true; {23040#false} is VALID [2022-04-28 12:43:09,899 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {23040#false} {23040#false} #102#return; {23040#false} is VALID [2022-04-28 12:43:09,899 INFO L272 TraceCheckUtils]: 85: Hoare triple {23040#false} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {23040#false} is VALID [2022-04-28 12:43:09,899 INFO L290 TraceCheckUtils]: 86: Hoare triple {23040#false} ~cond := #in~cond; {23040#false} is VALID [2022-04-28 12:43:09,899 INFO L290 TraceCheckUtils]: 87: Hoare triple {23040#false} assume !(0 == ~cond); {23040#false} is VALID [2022-04-28 12:43:09,899 INFO L290 TraceCheckUtils]: 88: Hoare triple {23040#false} assume true; {23040#false} is VALID [2022-04-28 12:43:09,899 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {23040#false} {23040#false} #104#return; {23040#false} is VALID [2022-04-28 12:43:09,899 INFO L272 TraceCheckUtils]: 90: Hoare triple {23040#false} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {23040#false} is VALID [2022-04-28 12:43:09,899 INFO L290 TraceCheckUtils]: 91: Hoare triple {23040#false} ~cond := #in~cond; {23040#false} is VALID [2022-04-28 12:43:09,899 INFO L290 TraceCheckUtils]: 92: Hoare triple {23040#false} assume !(0 == ~cond); {23040#false} is VALID [2022-04-28 12:43:09,899 INFO L290 TraceCheckUtils]: 93: Hoare triple {23040#false} assume true; {23040#false} is VALID [2022-04-28 12:43:09,899 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {23040#false} {23040#false} #106#return; {23040#false} is VALID [2022-04-28 12:43:09,899 INFO L272 TraceCheckUtils]: 95: Hoare triple {23040#false} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {23040#false} is VALID [2022-04-28 12:43:09,900 INFO L290 TraceCheckUtils]: 96: Hoare triple {23040#false} ~cond := #in~cond; {23040#false} is VALID [2022-04-28 12:43:09,900 INFO L290 TraceCheckUtils]: 97: Hoare triple {23040#false} assume !(0 == ~cond); {23040#false} is VALID [2022-04-28 12:43:09,900 INFO L290 TraceCheckUtils]: 98: Hoare triple {23040#false} assume true; {23040#false} is VALID [2022-04-28 12:43:09,900 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {23040#false} {23040#false} #108#return; {23040#false} is VALID [2022-04-28 12:43:09,900 INFO L290 TraceCheckUtils]: 100: Hoare triple {23040#false} assume !(~c~0 >= 2 * ~v~0); {23040#false} is VALID [2022-04-28 12:43:09,900 INFO L290 TraceCheckUtils]: 101: Hoare triple {23040#false} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {23040#false} is VALID [2022-04-28 12:43:09,900 INFO L290 TraceCheckUtils]: 102: Hoare triple {23040#false} assume !false; {23040#false} is VALID [2022-04-28 12:43:09,900 INFO L290 TraceCheckUtils]: 103: Hoare triple {23040#false} assume !(~c~0 >= ~b~0); {23040#false} is VALID [2022-04-28 12:43:09,900 INFO L290 TraceCheckUtils]: 104: Hoare triple {23040#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {23040#false} is VALID [2022-04-28 12:43:09,900 INFO L290 TraceCheckUtils]: 105: Hoare triple {23040#false} assume !false; {23040#false} is VALID [2022-04-28 12:43:09,900 INFO L290 TraceCheckUtils]: 106: Hoare triple {23040#false} assume !(0 != ~b~0); {23040#false} is VALID [2022-04-28 12:43:09,900 INFO L272 TraceCheckUtils]: 107: Hoare triple {23040#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {23040#false} is VALID [2022-04-28 12:43:09,900 INFO L290 TraceCheckUtils]: 108: Hoare triple {23040#false} ~cond := #in~cond; {23040#false} is VALID [2022-04-28 12:43:09,900 INFO L290 TraceCheckUtils]: 109: Hoare triple {23040#false} assume 0 == ~cond; {23040#false} is VALID [2022-04-28 12:43:09,900 INFO L290 TraceCheckUtils]: 110: Hoare triple {23040#false} assume !false; {23040#false} is VALID [2022-04-28 12:43:09,901 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 165 proven. 15 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2022-04-28 12:43:09,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:43:10,593 INFO L290 TraceCheckUtils]: 110: Hoare triple {23040#false} assume !false; {23040#false} is VALID [2022-04-28 12:43:10,593 INFO L290 TraceCheckUtils]: 109: Hoare triple {23040#false} assume 0 == ~cond; {23040#false} is VALID [2022-04-28 12:43:10,593 INFO L290 TraceCheckUtils]: 108: Hoare triple {23040#false} ~cond := #in~cond; {23040#false} is VALID [2022-04-28 12:43:10,594 INFO L272 TraceCheckUtils]: 107: Hoare triple {23040#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {23040#false} is VALID [2022-04-28 12:43:10,594 INFO L290 TraceCheckUtils]: 106: Hoare triple {23040#false} assume !(0 != ~b~0); {23040#false} is VALID [2022-04-28 12:43:10,594 INFO L290 TraceCheckUtils]: 105: Hoare triple {23040#false} assume !false; {23040#false} is VALID [2022-04-28 12:43:10,594 INFO L290 TraceCheckUtils]: 104: Hoare triple {23040#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {23040#false} is VALID [2022-04-28 12:43:10,594 INFO L290 TraceCheckUtils]: 103: Hoare triple {23040#false} assume !(~c~0 >= ~b~0); {23040#false} is VALID [2022-04-28 12:43:10,594 INFO L290 TraceCheckUtils]: 102: Hoare triple {23040#false} assume !false; {23040#false} is VALID [2022-04-28 12:43:10,594 INFO L290 TraceCheckUtils]: 101: Hoare triple {23040#false} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {23040#false} is VALID [2022-04-28 12:43:10,594 INFO L290 TraceCheckUtils]: 100: Hoare triple {23040#false} assume !(~c~0 >= 2 * ~v~0); {23040#false} is VALID [2022-04-28 12:43:10,594 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {23039#true} {23040#false} #108#return; {23040#false} is VALID [2022-04-28 12:43:10,594 INFO L290 TraceCheckUtils]: 98: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-28 12:43:10,594 INFO L290 TraceCheckUtils]: 97: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-28 12:43:10,594 INFO L290 TraceCheckUtils]: 96: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-28 12:43:10,594 INFO L272 TraceCheckUtils]: 95: Hoare triple {23040#false} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {23039#true} is VALID [2022-04-28 12:43:10,594 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {23039#true} {23040#false} #106#return; {23040#false} is VALID [2022-04-28 12:43:10,594 INFO L290 TraceCheckUtils]: 93: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-28 12:43:10,594 INFO L290 TraceCheckUtils]: 92: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-28 12:43:10,594 INFO L290 TraceCheckUtils]: 91: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-28 12:43:10,594 INFO L272 TraceCheckUtils]: 90: Hoare triple {23040#false} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {23039#true} is VALID [2022-04-28 12:43:10,594 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {23039#true} {23040#false} #104#return; {23040#false} is VALID [2022-04-28 12:43:10,595 INFO L290 TraceCheckUtils]: 88: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-28 12:43:10,595 INFO L290 TraceCheckUtils]: 87: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-28 12:43:10,595 INFO L290 TraceCheckUtils]: 86: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-28 12:43:10,595 INFO L272 TraceCheckUtils]: 85: Hoare triple {23040#false} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {23039#true} is VALID [2022-04-28 12:43:10,595 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {23039#true} {23040#false} #102#return; {23040#false} is VALID [2022-04-28 12:43:10,595 INFO L290 TraceCheckUtils]: 83: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-28 12:43:10,595 INFO L290 TraceCheckUtils]: 82: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-28 12:43:10,595 INFO L290 TraceCheckUtils]: 81: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-28 12:43:10,595 INFO L272 TraceCheckUtils]: 80: Hoare triple {23040#false} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {23039#true} is VALID [2022-04-28 12:43:10,595 INFO L290 TraceCheckUtils]: 79: Hoare triple {23040#false} assume !false; {23040#false} is VALID [2022-04-28 12:43:10,595 INFO L290 TraceCheckUtils]: 78: Hoare triple {23479#(not (<= main_~b~0 main_~c~0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {23040#false} is VALID [2022-04-28 12:43:10,596 INFO L290 TraceCheckUtils]: 77: Hoare triple {23479#(not (<= main_~b~0 main_~c~0))} assume !false; {23479#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-28 12:43:10,596 INFO L290 TraceCheckUtils]: 76: Hoare triple {23486#(< main_~c~0 (+ main_~b~0 main_~v~0))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {23479#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-28 12:43:10,596 INFO L290 TraceCheckUtils]: 75: Hoare triple {23490#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} assume !(~c~0 >= 2 * ~v~0); {23486#(< main_~c~0 (+ main_~b~0 main_~v~0))} is VALID [2022-04-28 12:43:10,597 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {23039#true} {23490#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} #108#return; {23490#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} is VALID [2022-04-28 12:43:10,597 INFO L290 TraceCheckUtils]: 73: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-28 12:43:10,597 INFO L290 TraceCheckUtils]: 72: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-28 12:43:10,597 INFO L290 TraceCheckUtils]: 71: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-28 12:43:10,597 INFO L272 TraceCheckUtils]: 70: Hoare triple {23490#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {23039#true} is VALID [2022-04-28 12:43:10,598 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {23039#true} {23490#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} #106#return; {23490#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} is VALID [2022-04-28 12:43:10,598 INFO L290 TraceCheckUtils]: 68: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-28 12:43:10,598 INFO L290 TraceCheckUtils]: 67: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-28 12:43:10,598 INFO L290 TraceCheckUtils]: 66: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-28 12:43:10,598 INFO L272 TraceCheckUtils]: 65: Hoare triple {23490#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {23039#true} is VALID [2022-04-28 12:43:10,598 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {23039#true} {23490#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} #104#return; {23490#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} is VALID [2022-04-28 12:43:10,598 INFO L290 TraceCheckUtils]: 63: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-28 12:43:10,598 INFO L290 TraceCheckUtils]: 62: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-28 12:43:10,598 INFO L290 TraceCheckUtils]: 61: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-28 12:43:10,598 INFO L272 TraceCheckUtils]: 60: Hoare triple {23490#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {23039#true} is VALID [2022-04-28 12:43:10,599 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {23039#true} {23490#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} #102#return; {23490#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} is VALID [2022-04-28 12:43:10,599 INFO L290 TraceCheckUtils]: 58: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-28 12:43:10,599 INFO L290 TraceCheckUtils]: 57: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-28 12:43:10,599 INFO L290 TraceCheckUtils]: 56: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-28 12:43:10,599 INFO L272 TraceCheckUtils]: 55: Hoare triple {23490#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {23039#true} is VALID [2022-04-28 12:43:10,600 INFO L290 TraceCheckUtils]: 54: Hoare triple {23490#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} assume !false; {23490#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} is VALID [2022-04-28 12:43:10,600 INFO L290 TraceCheckUtils]: 53: Hoare triple {23557#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {23490#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} is VALID [2022-04-28 12:43:10,601 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {23039#true} {23557#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} #108#return; {23557#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} is VALID [2022-04-28 12:43:10,601 INFO L290 TraceCheckUtils]: 51: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-28 12:43:10,601 INFO L290 TraceCheckUtils]: 50: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-28 12:43:10,601 INFO L290 TraceCheckUtils]: 49: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-28 12:43:10,601 INFO L272 TraceCheckUtils]: 48: Hoare triple {23557#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {23039#true} is VALID [2022-04-28 12:43:10,601 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {23039#true} {23557#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} #106#return; {23557#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} is VALID [2022-04-28 12:43:10,602 INFO L290 TraceCheckUtils]: 46: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-28 12:43:10,602 INFO L290 TraceCheckUtils]: 45: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-28 12:43:10,602 INFO L290 TraceCheckUtils]: 44: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-28 12:43:10,602 INFO L272 TraceCheckUtils]: 43: Hoare triple {23557#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {23039#true} is VALID [2022-04-28 12:43:10,602 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {23039#true} {23557#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} #104#return; {23557#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} is VALID [2022-04-28 12:43:10,602 INFO L290 TraceCheckUtils]: 41: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-28 12:43:10,602 INFO L290 TraceCheckUtils]: 40: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-28 12:43:10,602 INFO L290 TraceCheckUtils]: 39: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-28 12:43:10,602 INFO L272 TraceCheckUtils]: 38: Hoare triple {23557#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {23039#true} is VALID [2022-04-28 12:43:10,603 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {23039#true} {23557#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} #102#return; {23557#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} is VALID [2022-04-28 12:43:10,603 INFO L290 TraceCheckUtils]: 36: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-28 12:43:10,603 INFO L290 TraceCheckUtils]: 35: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-28 12:43:10,603 INFO L290 TraceCheckUtils]: 34: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-28 12:43:10,603 INFO L272 TraceCheckUtils]: 33: Hoare triple {23557#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {23039#true} is VALID [2022-04-28 12:43:10,603 INFO L290 TraceCheckUtils]: 32: Hoare triple {23557#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} assume !false; {23557#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} is VALID [2022-04-28 12:43:10,604 INFO L290 TraceCheckUtils]: 31: Hoare triple {23624#(<= main_~c~0 (+ (div main_~c~0 2) (div (div main_~c~0 2) 2) 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {23557#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} is VALID [2022-04-28 12:43:10,604 INFO L290 TraceCheckUtils]: 30: Hoare triple {23624#(<= main_~c~0 (+ (div main_~c~0 2) (div (div main_~c~0 2) 2) 1))} assume !false; {23624#(<= main_~c~0 (+ (div main_~c~0 2) (div (div main_~c~0 2) 2) 1))} is VALID [2022-04-28 12:43:10,605 INFO L290 TraceCheckUtils]: 29: Hoare triple {23128#(<= main_~a~0 2)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {23624#(<= main_~c~0 (+ (div main_~c~0 2) (div (div main_~c~0 2) 2) 1))} is VALID [2022-04-28 12:43:10,605 INFO L290 TraceCheckUtils]: 28: Hoare triple {23128#(<= main_~a~0 2)} assume !false; {23128#(<= main_~a~0 2)} is VALID [2022-04-28 12:43:10,605 INFO L290 TraceCheckUtils]: 27: Hoare triple {23637#(<= main_~x~0 2)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {23128#(<= main_~a~0 2)} is VALID [2022-04-28 12:43:10,606 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {23039#true} {23637#(<= main_~x~0 2)} #100#return; {23637#(<= main_~x~0 2)} is VALID [2022-04-28 12:43:10,606 INFO L290 TraceCheckUtils]: 25: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-28 12:43:10,606 INFO L290 TraceCheckUtils]: 24: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-28 12:43:10,606 INFO L290 TraceCheckUtils]: 23: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-28 12:43:10,606 INFO L272 TraceCheckUtils]: 22: Hoare triple {23637#(<= main_~x~0 2)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {23039#true} is VALID [2022-04-28 12:43:10,606 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {23039#true} {23637#(<= main_~x~0 2)} #98#return; {23637#(<= main_~x~0 2)} is VALID [2022-04-28 12:43:10,606 INFO L290 TraceCheckUtils]: 20: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-28 12:43:10,606 INFO L290 TraceCheckUtils]: 19: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-28 12:43:10,606 INFO L290 TraceCheckUtils]: 18: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-28 12:43:10,607 INFO L272 TraceCheckUtils]: 17: Hoare triple {23637#(<= main_~x~0 2)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {23039#true} is VALID [2022-04-28 12:43:10,607 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {23039#true} {23637#(<= main_~x~0 2)} #96#return; {23637#(<= main_~x~0 2)} is VALID [2022-04-28 12:43:10,607 INFO L290 TraceCheckUtils]: 15: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-28 12:43:10,607 INFO L290 TraceCheckUtils]: 14: Hoare triple {23039#true} assume !(0 == ~cond); {23039#true} is VALID [2022-04-28 12:43:10,607 INFO L290 TraceCheckUtils]: 13: Hoare triple {23039#true} ~cond := #in~cond; {23039#true} is VALID [2022-04-28 12:43:10,607 INFO L272 TraceCheckUtils]: 12: Hoare triple {23637#(<= main_~x~0 2)} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {23039#true} is VALID [2022-04-28 12:43:10,607 INFO L290 TraceCheckUtils]: 11: Hoare triple {23637#(<= main_~x~0 2)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {23637#(<= main_~x~0 2)} is VALID [2022-04-28 12:43:10,608 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23069#(not (= |assume_abort_if_not_#in~cond| 0))} {23039#true} #94#return; {23637#(<= main_~x~0 2)} is VALID [2022-04-28 12:43:10,608 INFO L290 TraceCheckUtils]: 9: Hoare triple {23069#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {23069#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:43:10,608 INFO L290 TraceCheckUtils]: 8: Hoare triple {23698#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {23069#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:43:10,609 INFO L290 TraceCheckUtils]: 7: Hoare triple {23039#true} ~cond := #in~cond; {23698#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-28 12:43:10,609 INFO L272 TraceCheckUtils]: 6: Hoare triple {23039#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {23039#true} is VALID [2022-04-28 12:43:10,609 INFO L290 TraceCheckUtils]: 5: Hoare triple {23039#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {23039#true} is VALID [2022-04-28 12:43:10,609 INFO L272 TraceCheckUtils]: 4: Hoare triple {23039#true} call #t~ret6 := main(); {23039#true} is VALID [2022-04-28 12:43:10,609 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23039#true} {23039#true} #112#return; {23039#true} is VALID [2022-04-28 12:43:10,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {23039#true} assume true; {23039#true} is VALID [2022-04-28 12:43:10,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {23039#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(11, 2);call #Ultimate.allocInit(12, 3); {23039#true} is VALID [2022-04-28 12:43:10,609 INFO L272 TraceCheckUtils]: 0: Hoare triple {23039#true} call ULTIMATE.init(); {23039#true} is VALID [2022-04-28 12:43:10,609 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 43 proven. 17 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2022-04-28 12:43:10,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:43:10,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463751082] [2022-04-28 12:43:10,609 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:43:10,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785027083] [2022-04-28 12:43:10,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785027083] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:43:10,609 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:43:10,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2022-04-28 12:43:10,610 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:43:10,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1883374215] [2022-04-28 12:43:10,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1883374215] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:43:10,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:43:10,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 12:43:10,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396088459] [2022-04-28 12:43:10,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:43:10,610 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 5 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 111 [2022-04-28 12:43:10,610 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:43:10,611 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 5 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 12:43:10,678 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:43:10,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 12:43:10,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:43:10,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 12:43:10,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2022-04-28 12:43:10,678 INFO L87 Difference]: Start difference. First operand 317 states and 445 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 5 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 12:43:12,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:43:12,542 INFO L93 Difference]: Finished difference Result 387 states and 528 transitions. [2022-04-28 12:43:12,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 12:43:12,542 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 5 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 111 [2022-04-28 12:43:12,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:43:12,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 5 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 12:43:12,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 108 transitions. [2022-04-28 12:43:12,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 5 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 12:43:12,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 108 transitions. [2022-04-28 12:43:12,544 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 108 transitions. [2022-04-28 12:43:12,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:43:12,646 INFO L225 Difference]: With dead ends: 387 [2022-04-28 12:43:12,646 INFO L226 Difference]: Without dead ends: 271 [2022-04-28 12:43:12,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 204 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=510, Unknown=0, NotChecked=0, Total=650 [2022-04-28 12:43:12,647 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 47 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 12:43:12,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 239 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 12:43:12,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-04-28 12:43:13,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 232. [2022-04-28 12:43:13,495 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:43:13,496 INFO L82 GeneralOperation]: Start isEquivalent. First operand 271 states. Second operand has 232 states, 133 states have (on average 1.150375939849624) internal successors, (153), 134 states have internal predecessors, (153), 79 states have call successors, (79), 20 states have call predecessors, (79), 19 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-28 12:43:13,496 INFO L74 IsIncluded]: Start isIncluded. First operand 271 states. Second operand has 232 states, 133 states have (on average 1.150375939849624) internal successors, (153), 134 states have internal predecessors, (153), 79 states have call successors, (79), 20 states have call predecessors, (79), 19 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-28 12:43:13,496 INFO L87 Difference]: Start difference. First operand 271 states. Second operand has 232 states, 133 states have (on average 1.150375939849624) internal successors, (153), 134 states have internal predecessors, (153), 79 states have call successors, (79), 20 states have call predecessors, (79), 19 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-28 12:43:13,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:43:13,502 INFO L93 Difference]: Finished difference Result 271 states and 367 transitions. [2022-04-28 12:43:13,502 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 367 transitions. [2022-04-28 12:43:13,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:43:13,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:43:13,503 INFO L74 IsIncluded]: Start isIncluded. First operand has 232 states, 133 states have (on average 1.150375939849624) internal successors, (153), 134 states have internal predecessors, (153), 79 states have call successors, (79), 20 states have call predecessors, (79), 19 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) Second operand 271 states. [2022-04-28 12:43:13,503 INFO L87 Difference]: Start difference. First operand has 232 states, 133 states have (on average 1.150375939849624) internal successors, (153), 134 states have internal predecessors, (153), 79 states have call successors, (79), 20 states have call predecessors, (79), 19 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) Second operand 271 states. [2022-04-28 12:43:13,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:43:13,507 INFO L93 Difference]: Finished difference Result 271 states and 367 transitions. [2022-04-28 12:43:13,507 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 367 transitions. [2022-04-28 12:43:13,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:43:13,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:43:13,508 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:43:13,508 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:43:13,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 133 states have (on average 1.150375939849624) internal successors, (153), 134 states have internal predecessors, (153), 79 states have call successors, (79), 20 states have call predecessors, (79), 19 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-28 12:43:13,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 309 transitions. [2022-04-28 12:43:13,513 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 309 transitions. Word has length 111 [2022-04-28 12:43:13,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:43:13,513 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 309 transitions. [2022-04-28 12:43:13,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 5 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 12:43:13,513 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 232 states and 309 transitions. [2022-04-28 12:43:14,216 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 309 edges. 309 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:43:14,216 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 309 transitions. [2022-04-28 12:43:14,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-28 12:43:14,224 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:43:14,224 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:43:14,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-28 12:43:14,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-28 12:43:14,424 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:43:14,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:43:14,425 INFO L85 PathProgramCache]: Analyzing trace with hash 890766036, now seen corresponding path program 9 times [2022-04-28 12:43:14,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:43:14,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1408010847] [2022-04-28 12:43:14,425 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:43:14,425 INFO L85 PathProgramCache]: Analyzing trace with hash 890766036, now seen corresponding path program 10 times [2022-04-28 12:43:14,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:43:14,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130012944] [2022-04-28 12:43:14,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:43:14,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:43:14,435 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:43:14,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2114153350] [2022-04-28 12:43:14,435 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 12:43:14,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:43:14,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:43:14,436 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:43:14,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-28 12:43:14,487 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 12:43:14,487 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:43:14,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 12:43:14,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:43:14,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:43:17,602 INFO L272 TraceCheckUtils]: 0: Hoare triple {25518#true} call ULTIMATE.init(); {25518#true} is VALID [2022-04-28 12:43:17,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {25518#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(11, 2);call #Ultimate.allocInit(12, 3); {25518#true} is VALID [2022-04-28 12:43:17,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {25518#true} assume true; {25518#true} is VALID [2022-04-28 12:43:17,602 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25518#true} {25518#true} #112#return; {25518#true} is VALID [2022-04-28 12:43:17,602 INFO L272 TraceCheckUtils]: 4: Hoare triple {25518#true} call #t~ret6 := main(); {25518#true} is VALID [2022-04-28 12:43:17,602 INFO L290 TraceCheckUtils]: 5: Hoare triple {25518#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {25518#true} is VALID [2022-04-28 12:43:17,602 INFO L272 TraceCheckUtils]: 6: Hoare triple {25518#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {25518#true} is VALID [2022-04-28 12:43:17,603 INFO L290 TraceCheckUtils]: 7: Hoare triple {25518#true} ~cond := #in~cond; {25518#true} is VALID [2022-04-28 12:43:17,603 INFO L290 TraceCheckUtils]: 8: Hoare triple {25518#true} assume !(0 == ~cond); {25518#true} is VALID [2022-04-28 12:43:17,603 INFO L290 TraceCheckUtils]: 9: Hoare triple {25518#true} assume true; {25518#true} is VALID [2022-04-28 12:43:17,603 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {25518#true} {25518#true} #94#return; {25518#true} is VALID [2022-04-28 12:43:17,603 INFO L290 TraceCheckUtils]: 11: Hoare triple {25518#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {25518#true} is VALID [2022-04-28 12:43:17,603 INFO L272 TraceCheckUtils]: 12: Hoare triple {25518#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {25518#true} is VALID [2022-04-28 12:43:17,603 INFO L290 TraceCheckUtils]: 13: Hoare triple {25518#true} ~cond := #in~cond; {25562#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 12:43:17,603 INFO L290 TraceCheckUtils]: 14: Hoare triple {25562#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {25566#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:43:17,604 INFO L290 TraceCheckUtils]: 15: Hoare triple {25566#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {25566#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:43:17,604 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {25566#(not (= |assume_abort_if_not_#in~cond| 0))} {25518#true} #96#return; {25573#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 12:43:17,604 INFO L272 TraceCheckUtils]: 17: Hoare triple {25573#(and (<= 0 main_~y~0) (<= main_~y~0 2))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {25518#true} is VALID [2022-04-28 12:43:17,604 INFO L290 TraceCheckUtils]: 18: Hoare triple {25518#true} ~cond := #in~cond; {25518#true} is VALID [2022-04-28 12:43:17,604 INFO L290 TraceCheckUtils]: 19: Hoare triple {25518#true} assume !(0 == ~cond); {25518#true} is VALID [2022-04-28 12:43:17,604 INFO L290 TraceCheckUtils]: 20: Hoare triple {25518#true} assume true; {25518#true} is VALID [2022-04-28 12:43:17,605 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {25518#true} {25573#(and (<= 0 main_~y~0) (<= main_~y~0 2))} #98#return; {25573#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 12:43:17,605 INFO L272 TraceCheckUtils]: 22: Hoare triple {25573#(and (<= 0 main_~y~0) (<= main_~y~0 2))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {25518#true} is VALID [2022-04-28 12:43:17,605 INFO L290 TraceCheckUtils]: 23: Hoare triple {25518#true} ~cond := #in~cond; {25518#true} is VALID [2022-04-28 12:43:17,605 INFO L290 TraceCheckUtils]: 24: Hoare triple {25518#true} assume !(0 == ~cond); {25518#true} is VALID [2022-04-28 12:43:17,605 INFO L290 TraceCheckUtils]: 25: Hoare triple {25518#true} assume true; {25518#true} is VALID [2022-04-28 12:43:17,605 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {25518#true} {25573#(and (<= 0 main_~y~0) (<= main_~y~0 2))} #100#return; {25573#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 12:43:17,605 INFO L290 TraceCheckUtils]: 27: Hoare triple {25573#(and (<= 0 main_~y~0) (<= main_~y~0 2))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {25607#(<= main_~b~0 2)} is VALID [2022-04-28 12:43:17,606 INFO L290 TraceCheckUtils]: 28: Hoare triple {25607#(<= main_~b~0 2)} assume !false; {25607#(<= main_~b~0 2)} is VALID [2022-04-28 12:43:17,606 INFO L290 TraceCheckUtils]: 29: Hoare triple {25607#(<= main_~b~0 2)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {25607#(<= main_~b~0 2)} is VALID [2022-04-28 12:43:17,606 INFO L290 TraceCheckUtils]: 30: Hoare triple {25607#(<= main_~b~0 2)} assume !false; {25607#(<= main_~b~0 2)} is VALID [2022-04-28 12:43:17,606 INFO L290 TraceCheckUtils]: 31: Hoare triple {25607#(<= main_~b~0 2)} assume !(~c~0 >= ~b~0); {25607#(<= main_~b~0 2)} is VALID [2022-04-28 12:43:17,607 INFO L290 TraceCheckUtils]: 32: Hoare triple {25607#(<= main_~b~0 2)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {25623#(<= main_~a~0 2)} is VALID [2022-04-28 12:43:17,607 INFO L290 TraceCheckUtils]: 33: Hoare triple {25623#(<= main_~a~0 2)} assume !false; {25623#(<= main_~a~0 2)} is VALID [2022-04-28 12:43:17,607 INFO L290 TraceCheckUtils]: 34: Hoare triple {25623#(<= main_~a~0 2)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {25630#(<= main_~c~0 2)} is VALID [2022-04-28 12:43:17,607 INFO L290 TraceCheckUtils]: 35: Hoare triple {25630#(<= main_~c~0 2)} assume !false; {25630#(<= main_~c~0 2)} is VALID [2022-04-28 12:43:17,608 INFO L290 TraceCheckUtils]: 36: Hoare triple {25630#(<= main_~c~0 2)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {25637#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} is VALID [2022-04-28 12:43:17,608 INFO L290 TraceCheckUtils]: 37: Hoare triple {25637#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} assume !false; {25637#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} is VALID [2022-04-28 12:43:17,608 INFO L272 TraceCheckUtils]: 38: Hoare triple {25637#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {25518#true} is VALID [2022-04-28 12:43:17,608 INFO L290 TraceCheckUtils]: 39: Hoare triple {25518#true} ~cond := #in~cond; {25518#true} is VALID [2022-04-28 12:43:17,608 INFO L290 TraceCheckUtils]: 40: Hoare triple {25518#true} assume !(0 == ~cond); {25518#true} is VALID [2022-04-28 12:43:17,608 INFO L290 TraceCheckUtils]: 41: Hoare triple {25518#true} assume true; {25518#true} is VALID [2022-04-28 12:43:17,609 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {25518#true} {25637#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} #102#return; {25637#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} is VALID [2022-04-28 12:43:17,609 INFO L272 TraceCheckUtils]: 43: Hoare triple {25637#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {25518#true} is VALID [2022-04-28 12:43:17,609 INFO L290 TraceCheckUtils]: 44: Hoare triple {25518#true} ~cond := #in~cond; {25518#true} is VALID [2022-04-28 12:43:17,609 INFO L290 TraceCheckUtils]: 45: Hoare triple {25518#true} assume !(0 == ~cond); {25518#true} is VALID [2022-04-28 12:43:17,609 INFO L290 TraceCheckUtils]: 46: Hoare triple {25518#true} assume true; {25518#true} is VALID [2022-04-28 12:43:17,609 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {25518#true} {25637#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} #104#return; {25637#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} is VALID [2022-04-28 12:43:17,610 INFO L272 TraceCheckUtils]: 48: Hoare triple {25637#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {25518#true} is VALID [2022-04-28 12:43:17,610 INFO L290 TraceCheckUtils]: 49: Hoare triple {25518#true} ~cond := #in~cond; {25518#true} is VALID [2022-04-28 12:43:17,610 INFO L290 TraceCheckUtils]: 50: Hoare triple {25518#true} assume !(0 == ~cond); {25518#true} is VALID [2022-04-28 12:43:17,610 INFO L290 TraceCheckUtils]: 51: Hoare triple {25518#true} assume true; {25518#true} is VALID [2022-04-28 12:43:17,610 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {25518#true} {25637#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} #106#return; {25637#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} is VALID [2022-04-28 12:43:17,610 INFO L272 TraceCheckUtils]: 53: Hoare triple {25637#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {25518#true} is VALID [2022-04-28 12:43:17,610 INFO L290 TraceCheckUtils]: 54: Hoare triple {25518#true} ~cond := #in~cond; {25518#true} is VALID [2022-04-28 12:43:17,610 INFO L290 TraceCheckUtils]: 55: Hoare triple {25518#true} assume !(0 == ~cond); {25518#true} is VALID [2022-04-28 12:43:17,610 INFO L290 TraceCheckUtils]: 56: Hoare triple {25518#true} assume true; {25518#true} is VALID [2022-04-28 12:43:17,611 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {25518#true} {25637#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} #108#return; {25637#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} is VALID [2022-04-28 12:43:17,611 INFO L290 TraceCheckUtils]: 58: Hoare triple {25637#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {25704#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} is VALID [2022-04-28 12:43:17,612 INFO L290 TraceCheckUtils]: 59: Hoare triple {25704#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} assume !false; {25704#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} is VALID [2022-04-28 12:43:17,612 INFO L272 TraceCheckUtils]: 60: Hoare triple {25704#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {25518#true} is VALID [2022-04-28 12:43:17,612 INFO L290 TraceCheckUtils]: 61: Hoare triple {25518#true} ~cond := #in~cond; {25518#true} is VALID [2022-04-28 12:43:17,612 INFO L290 TraceCheckUtils]: 62: Hoare triple {25518#true} assume !(0 == ~cond); {25518#true} is VALID [2022-04-28 12:43:17,612 INFO L290 TraceCheckUtils]: 63: Hoare triple {25518#true} assume true; {25518#true} is VALID [2022-04-28 12:43:17,612 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {25518#true} {25704#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} #102#return; {25704#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} is VALID [2022-04-28 12:43:17,612 INFO L272 TraceCheckUtils]: 65: Hoare triple {25704#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {25518#true} is VALID [2022-04-28 12:43:17,613 INFO L290 TraceCheckUtils]: 66: Hoare triple {25518#true} ~cond := #in~cond; {25518#true} is VALID [2022-04-28 12:43:17,613 INFO L290 TraceCheckUtils]: 67: Hoare triple {25518#true} assume !(0 == ~cond); {25518#true} is VALID [2022-04-28 12:43:17,613 INFO L290 TraceCheckUtils]: 68: Hoare triple {25518#true} assume true; {25518#true} is VALID [2022-04-28 12:43:17,613 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {25518#true} {25704#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} #104#return; {25704#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} is VALID [2022-04-28 12:43:17,613 INFO L272 TraceCheckUtils]: 70: Hoare triple {25704#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {25518#true} is VALID [2022-04-28 12:43:17,613 INFO L290 TraceCheckUtils]: 71: Hoare triple {25518#true} ~cond := #in~cond; {25518#true} is VALID [2022-04-28 12:43:17,613 INFO L290 TraceCheckUtils]: 72: Hoare triple {25518#true} assume !(0 == ~cond); {25518#true} is VALID [2022-04-28 12:43:17,613 INFO L290 TraceCheckUtils]: 73: Hoare triple {25518#true} assume true; {25518#true} is VALID [2022-04-28 12:43:17,614 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {25518#true} {25704#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} #106#return; {25704#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} is VALID [2022-04-28 12:43:17,614 INFO L272 TraceCheckUtils]: 75: Hoare triple {25704#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {25518#true} is VALID [2022-04-28 12:43:17,614 INFO L290 TraceCheckUtils]: 76: Hoare triple {25518#true} ~cond := #in~cond; {25518#true} is VALID [2022-04-28 12:43:17,614 INFO L290 TraceCheckUtils]: 77: Hoare triple {25518#true} assume !(0 == ~cond); {25518#true} is VALID [2022-04-28 12:43:17,614 INFO L290 TraceCheckUtils]: 78: Hoare triple {25518#true} assume true; {25518#true} is VALID [2022-04-28 12:43:17,614 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {25518#true} {25704#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} #108#return; {25704#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} is VALID [2022-04-28 12:43:17,616 INFO L290 TraceCheckUtils]: 80: Hoare triple {25704#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {25771#(and (<= (div (* (- 1) main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~c~0 2) (<= main_~b~0 (div (div main_~c~0 2) 2)))} is VALID [2022-04-28 12:43:17,616 INFO L290 TraceCheckUtils]: 81: Hoare triple {25771#(and (<= (div (* (- 1) main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~c~0 2) (<= main_~b~0 (div (div main_~c~0 2) 2)))} assume !false; {25771#(and (<= (div (* (- 1) main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~c~0 2) (<= main_~b~0 (div (div main_~c~0 2) 2)))} is VALID [2022-04-28 12:43:17,616 INFO L272 TraceCheckUtils]: 82: Hoare triple {25771#(and (<= (div (* (- 1) main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~c~0 2) (<= main_~b~0 (div (div main_~c~0 2) 2)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {25518#true} is VALID [2022-04-28 12:43:17,616 INFO L290 TraceCheckUtils]: 83: Hoare triple {25518#true} ~cond := #in~cond; {25518#true} is VALID [2022-04-28 12:43:17,616 INFO L290 TraceCheckUtils]: 84: Hoare triple {25518#true} assume !(0 == ~cond); {25518#true} is VALID [2022-04-28 12:43:17,616 INFO L290 TraceCheckUtils]: 85: Hoare triple {25518#true} assume true; {25518#true} is VALID [2022-04-28 12:43:17,617 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {25518#true} {25771#(and (<= (div (* (- 1) main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~c~0 2) (<= main_~b~0 (div (div main_~c~0 2) 2)))} #102#return; {25771#(and (<= (div (* (- 1) main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~c~0 2) (<= main_~b~0 (div (div main_~c~0 2) 2)))} is VALID [2022-04-28 12:43:17,617 INFO L272 TraceCheckUtils]: 87: Hoare triple {25771#(and (<= (div (* (- 1) main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~c~0 2) (<= main_~b~0 (div (div main_~c~0 2) 2)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {25518#true} is VALID [2022-04-28 12:43:17,617 INFO L290 TraceCheckUtils]: 88: Hoare triple {25518#true} ~cond := #in~cond; {25518#true} is VALID [2022-04-28 12:43:17,617 INFO L290 TraceCheckUtils]: 89: Hoare triple {25518#true} assume !(0 == ~cond); {25518#true} is VALID [2022-04-28 12:43:17,617 INFO L290 TraceCheckUtils]: 90: Hoare triple {25518#true} assume true; {25518#true} is VALID [2022-04-28 12:43:17,617 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {25518#true} {25771#(and (<= (div (* (- 1) main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~c~0 2) (<= main_~b~0 (div (div main_~c~0 2) 2)))} #104#return; {25771#(and (<= (div (* (- 1) main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~c~0 2) (<= main_~b~0 (div (div main_~c~0 2) 2)))} is VALID [2022-04-28 12:43:17,617 INFO L272 TraceCheckUtils]: 92: Hoare triple {25771#(and (<= (div (* (- 1) main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~c~0 2) (<= main_~b~0 (div (div main_~c~0 2) 2)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {25518#true} is VALID [2022-04-28 12:43:17,617 INFO L290 TraceCheckUtils]: 93: Hoare triple {25518#true} ~cond := #in~cond; {25518#true} is VALID [2022-04-28 12:43:17,617 INFO L290 TraceCheckUtils]: 94: Hoare triple {25518#true} assume !(0 == ~cond); {25518#true} is VALID [2022-04-28 12:43:17,618 INFO L290 TraceCheckUtils]: 95: Hoare triple {25518#true} assume true; {25518#true} is VALID [2022-04-28 12:43:17,618 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {25518#true} {25771#(and (<= (div (* (- 1) main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~c~0 2) (<= main_~b~0 (div (div main_~c~0 2) 2)))} #106#return; {25771#(and (<= (div (* (- 1) main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~c~0 2) (<= main_~b~0 (div (div main_~c~0 2) 2)))} is VALID [2022-04-28 12:43:17,618 INFO L272 TraceCheckUtils]: 97: Hoare triple {25771#(and (<= (div (* (- 1) main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~c~0 2) (<= main_~b~0 (div (div main_~c~0 2) 2)))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {25518#true} is VALID [2022-04-28 12:43:17,618 INFO L290 TraceCheckUtils]: 98: Hoare triple {25518#true} ~cond := #in~cond; {25518#true} is VALID [2022-04-28 12:43:17,618 INFO L290 TraceCheckUtils]: 99: Hoare triple {25518#true} assume !(0 == ~cond); {25518#true} is VALID [2022-04-28 12:43:17,618 INFO L290 TraceCheckUtils]: 100: Hoare triple {25518#true} assume true; {25518#true} is VALID [2022-04-28 12:43:17,619 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {25518#true} {25771#(and (<= (div (* (- 1) main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~c~0 2) (<= main_~b~0 (div (div main_~c~0 2) 2)))} #108#return; {25771#(and (<= (div (* (- 1) main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~c~0 2) (<= main_~b~0 (div (div main_~c~0 2) 2)))} is VALID [2022-04-28 12:43:17,619 INFO L290 TraceCheckUtils]: 102: Hoare triple {25771#(and (<= (div (* (- 1) main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~c~0 2) (<= main_~b~0 (div (div main_~c~0 2) 2)))} assume !(~c~0 >= 2 * ~v~0); {25771#(and (<= (div (* (- 1) main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~c~0 2) (<= main_~b~0 (div (div main_~c~0 2) 2)))} is VALID [2022-04-28 12:43:17,620 INFO L290 TraceCheckUtils]: 103: Hoare triple {25771#(and (<= (div (* (- 1) main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~c~0 2) (<= main_~b~0 (div (div main_~c~0 2) 2)))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {25841#(and (<= main_~b~0 0) (< 0 (+ (div main_~c~0 2) 1)))} is VALID [2022-04-28 12:43:17,620 INFO L290 TraceCheckUtils]: 104: Hoare triple {25841#(and (<= main_~b~0 0) (< 0 (+ (div main_~c~0 2) 1)))} assume !false; {25841#(and (<= main_~b~0 0) (< 0 (+ (div main_~c~0 2) 1)))} is VALID [2022-04-28 12:43:17,621 INFO L290 TraceCheckUtils]: 105: Hoare triple {25841#(and (<= main_~b~0 0) (< 0 (+ (div main_~c~0 2) 1)))} assume !(~c~0 >= ~b~0); {25519#false} is VALID [2022-04-28 12:43:17,621 INFO L290 TraceCheckUtils]: 106: Hoare triple {25519#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {25519#false} is VALID [2022-04-28 12:43:17,621 INFO L290 TraceCheckUtils]: 107: Hoare triple {25519#false} assume !false; {25519#false} is VALID [2022-04-28 12:43:17,621 INFO L290 TraceCheckUtils]: 108: Hoare triple {25519#false} assume !(0 != ~b~0); {25519#false} is VALID [2022-04-28 12:43:17,621 INFO L272 TraceCheckUtils]: 109: Hoare triple {25519#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {25519#false} is VALID [2022-04-28 12:43:17,621 INFO L290 TraceCheckUtils]: 110: Hoare triple {25519#false} ~cond := #in~cond; {25519#false} is VALID [2022-04-28 12:43:17,621 INFO L290 TraceCheckUtils]: 111: Hoare triple {25519#false} assume 0 == ~cond; {25519#false} is VALID [2022-04-28 12:43:17,621 INFO L290 TraceCheckUtils]: 112: Hoare triple {25519#false} assume !false; {25519#false} is VALID [2022-04-28 12:43:17,621 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 34 proven. 30 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2022-04-28 12:43:17,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:43:21,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:43:21,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130012944] [2022-04-28 12:43:21,876 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:43:21,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114153350] [2022-04-28 12:43:21,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114153350] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 12:43:21,876 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 12:43:21,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-28 12:43:21,877 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:43:21,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1408010847] [2022-04-28 12:43:21,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1408010847] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:43:21,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:43:21,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 12:43:21,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709125328] [2022-04-28 12:43:21,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:43:21,878 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 113 [2022-04-28 12:43:21,878 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:43:21,878 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 12:43:21,959 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:43:21,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 12:43:21,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:43:21,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 12:43:21,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2022-04-28 12:43:21,960 INFO L87 Difference]: Start difference. First operand 232 states and 309 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 12:43:24,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:43:24,711 INFO L93 Difference]: Finished difference Result 349 states and 486 transitions. [2022-04-28 12:43:24,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 12:43:24,711 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 113 [2022-04-28 12:43:24,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:43:24,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 12:43:24,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 138 transitions. [2022-04-28 12:43:24,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 12:43:24,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 138 transitions. [2022-04-28 12:43:24,715 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 138 transitions. [2022-04-28 12:43:24,832 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:43:24,837 INFO L225 Difference]: With dead ends: 349 [2022-04-28 12:43:24,837 INFO L226 Difference]: Without dead ends: 295 [2022-04-28 12:43:24,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=192, Invalid=678, Unknown=0, NotChecked=0, Total=870 [2022-04-28 12:43:24,838 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 45 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 12:43:24,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 303 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 12:43:24,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-04-28 12:43:25,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 253. [2022-04-28 12:43:25,956 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:43:25,957 INFO L82 GeneralOperation]: Start isEquivalent. First operand 295 states. Second operand has 253 states, 146 states have (on average 1.1506849315068493) internal successors, (168), 147 states have internal predecessors, (168), 87 states have call successors, (87), 20 states have call predecessors, (87), 19 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-04-28 12:43:25,957 INFO L74 IsIncluded]: Start isIncluded. First operand 295 states. Second operand has 253 states, 146 states have (on average 1.1506849315068493) internal successors, (168), 147 states have internal predecessors, (168), 87 states have call successors, (87), 20 states have call predecessors, (87), 19 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-04-28 12:43:25,957 INFO L87 Difference]: Start difference. First operand 295 states. Second operand has 253 states, 146 states have (on average 1.1506849315068493) internal successors, (168), 147 states have internal predecessors, (168), 87 states have call successors, (87), 20 states have call predecessors, (87), 19 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-04-28 12:43:25,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:43:25,962 INFO L93 Difference]: Finished difference Result 295 states and 412 transitions. [2022-04-28 12:43:25,962 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 412 transitions. [2022-04-28 12:43:25,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:43:25,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:43:25,963 INFO L74 IsIncluded]: Start isIncluded. First operand has 253 states, 146 states have (on average 1.1506849315068493) internal successors, (168), 147 states have internal predecessors, (168), 87 states have call successors, (87), 20 states have call predecessors, (87), 19 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) Second operand 295 states. [2022-04-28 12:43:25,964 INFO L87 Difference]: Start difference. First operand has 253 states, 146 states have (on average 1.1506849315068493) internal successors, (168), 147 states have internal predecessors, (168), 87 states have call successors, (87), 20 states have call predecessors, (87), 19 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) Second operand 295 states. [2022-04-28 12:43:25,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:43:25,969 INFO L93 Difference]: Finished difference Result 295 states and 412 transitions. [2022-04-28 12:43:25,969 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 412 transitions. [2022-04-28 12:43:25,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:43:25,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:43:25,969 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:43:25,969 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:43:25,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 146 states have (on average 1.1506849315068493) internal successors, (168), 147 states have internal predecessors, (168), 87 states have call successors, (87), 20 states have call predecessors, (87), 19 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-04-28 12:43:25,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 340 transitions. [2022-04-28 12:43:25,974 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 340 transitions. Word has length 113 [2022-04-28 12:43:25,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:43:25,975 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 340 transitions. [2022-04-28 12:43:25,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 12:43:25,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 253 states and 340 transitions. [2022-04-28 12:43:26,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 340 edges. 340 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:43:26,833 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 340 transitions. [2022-04-28 12:43:26,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-04-28 12:43:26,833 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:43:26,834 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:43:26,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-28 12:43:27,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-28 12:43:27,034 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:43:27,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:43:27,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1938711081, now seen corresponding path program 11 times [2022-04-28 12:43:27,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:43:27,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1779837140] [2022-04-28 12:43:27,036 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:43:27,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1938711081, now seen corresponding path program 12 times [2022-04-28 12:43:27,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:43:27,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937677336] [2022-04-28 12:43:27,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:43:27,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:43:27,049 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:43:27,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1012802989] [2022-04-28 12:43:27,049 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 12:43:27,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:43:27,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:43:27,050 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:43:27,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-28 12:43:27,111 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 12:43:27,111 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:43:27,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 12:43:27,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:43:27,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:43:27,499 INFO L272 TraceCheckUtils]: 0: Hoare triple {27951#true} call ULTIMATE.init(); {27951#true} is VALID [2022-04-28 12:43:27,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {27951#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(11, 2);call #Ultimate.allocInit(12, 3); {27951#true} is VALID [2022-04-28 12:43:27,499 INFO L290 TraceCheckUtils]: 2: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-28 12:43:27,499 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27951#true} {27951#true} #112#return; {27951#true} is VALID [2022-04-28 12:43:27,499 INFO L272 TraceCheckUtils]: 4: Hoare triple {27951#true} call #t~ret6 := main(); {27951#true} is VALID [2022-04-28 12:43:27,499 INFO L290 TraceCheckUtils]: 5: Hoare triple {27951#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {27951#true} is VALID [2022-04-28 12:43:27,499 INFO L272 TraceCheckUtils]: 6: Hoare triple {27951#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {27951#true} is VALID [2022-04-28 12:43:27,499 INFO L290 TraceCheckUtils]: 7: Hoare triple {27951#true} ~cond := #in~cond; {27951#true} is VALID [2022-04-28 12:43:27,499 INFO L290 TraceCheckUtils]: 8: Hoare triple {27951#true} assume !(0 == ~cond); {27951#true} is VALID [2022-04-28 12:43:27,499 INFO L290 TraceCheckUtils]: 9: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-28 12:43:27,499 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {27951#true} {27951#true} #94#return; {27951#true} is VALID [2022-04-28 12:43:27,500 INFO L290 TraceCheckUtils]: 11: Hoare triple {27951#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {27951#true} is VALID [2022-04-28 12:43:27,500 INFO L272 TraceCheckUtils]: 12: Hoare triple {27951#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {27951#true} is VALID [2022-04-28 12:43:27,500 INFO L290 TraceCheckUtils]: 13: Hoare triple {27951#true} ~cond := #in~cond; {27995#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 12:43:27,500 INFO L290 TraceCheckUtils]: 14: Hoare triple {27995#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {27999#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:43:27,500 INFO L290 TraceCheckUtils]: 15: Hoare triple {27999#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {27999#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:43:27,501 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {27999#(not (= |assume_abort_if_not_#in~cond| 0))} {27951#true} #96#return; {28006#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 12:43:27,501 INFO L272 TraceCheckUtils]: 17: Hoare triple {28006#(and (<= 0 main_~y~0) (<= main_~y~0 2))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {27951#true} is VALID [2022-04-28 12:43:27,501 INFO L290 TraceCheckUtils]: 18: Hoare triple {27951#true} ~cond := #in~cond; {27951#true} is VALID [2022-04-28 12:43:27,501 INFO L290 TraceCheckUtils]: 19: Hoare triple {27951#true} assume !(0 == ~cond); {27951#true} is VALID [2022-04-28 12:43:27,501 INFO L290 TraceCheckUtils]: 20: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-28 12:43:27,501 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {27951#true} {28006#(and (<= 0 main_~y~0) (<= main_~y~0 2))} #98#return; {28006#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 12:43:27,501 INFO L272 TraceCheckUtils]: 22: Hoare triple {28006#(and (<= 0 main_~y~0) (<= main_~y~0 2))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {27951#true} is VALID [2022-04-28 12:43:27,501 INFO L290 TraceCheckUtils]: 23: Hoare triple {27951#true} ~cond := #in~cond; {27951#true} is VALID [2022-04-28 12:43:27,501 INFO L290 TraceCheckUtils]: 24: Hoare triple {27951#true} assume !(0 == ~cond); {27951#true} is VALID [2022-04-28 12:43:27,502 INFO L290 TraceCheckUtils]: 25: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-28 12:43:27,502 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {27951#true} {28006#(and (<= 0 main_~y~0) (<= main_~y~0 2))} #100#return; {28006#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 12:43:27,502 INFO L290 TraceCheckUtils]: 27: Hoare triple {28006#(and (<= 0 main_~y~0) (<= main_~y~0 2))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {28040#(<= main_~b~0 2)} is VALID [2022-04-28 12:43:27,502 INFO L290 TraceCheckUtils]: 28: Hoare triple {28040#(<= main_~b~0 2)} assume !false; {28040#(<= main_~b~0 2)} is VALID [2022-04-28 12:43:27,503 INFO L290 TraceCheckUtils]: 29: Hoare triple {28040#(<= main_~b~0 2)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {28040#(<= main_~b~0 2)} is VALID [2022-04-28 12:43:27,503 INFO L290 TraceCheckUtils]: 30: Hoare triple {28040#(<= main_~b~0 2)} assume !false; {28040#(<= main_~b~0 2)} is VALID [2022-04-28 12:43:27,503 INFO L290 TraceCheckUtils]: 31: Hoare triple {28040#(<= main_~b~0 2)} assume !(~c~0 >= ~b~0); {28040#(<= main_~b~0 2)} is VALID [2022-04-28 12:43:27,503 INFO L290 TraceCheckUtils]: 32: Hoare triple {28040#(<= main_~b~0 2)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {28056#(<= main_~a~0 2)} is VALID [2022-04-28 12:43:27,504 INFO L290 TraceCheckUtils]: 33: Hoare triple {28056#(<= main_~a~0 2)} assume !false; {28056#(<= main_~a~0 2)} is VALID [2022-04-28 12:43:27,504 INFO L290 TraceCheckUtils]: 34: Hoare triple {28056#(<= main_~a~0 2)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {28063#(<= main_~c~0 2)} is VALID [2022-04-28 12:43:27,504 INFO L290 TraceCheckUtils]: 35: Hoare triple {28063#(<= main_~c~0 2)} assume !false; {28063#(<= main_~c~0 2)} is VALID [2022-04-28 12:43:27,504 INFO L290 TraceCheckUtils]: 36: Hoare triple {28063#(<= main_~c~0 2)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {28063#(<= main_~c~0 2)} is VALID [2022-04-28 12:43:27,505 INFO L290 TraceCheckUtils]: 37: Hoare triple {28063#(<= main_~c~0 2)} assume !false; {28063#(<= main_~c~0 2)} is VALID [2022-04-28 12:43:27,505 INFO L272 TraceCheckUtils]: 38: Hoare triple {28063#(<= main_~c~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {27951#true} is VALID [2022-04-28 12:43:27,505 INFO L290 TraceCheckUtils]: 39: Hoare triple {27951#true} ~cond := #in~cond; {27951#true} is VALID [2022-04-28 12:43:27,505 INFO L290 TraceCheckUtils]: 40: Hoare triple {27951#true} assume !(0 == ~cond); {27951#true} is VALID [2022-04-28 12:43:27,505 INFO L290 TraceCheckUtils]: 41: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-28 12:43:27,505 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {27951#true} {28063#(<= main_~c~0 2)} #102#return; {28063#(<= main_~c~0 2)} is VALID [2022-04-28 12:43:27,505 INFO L272 TraceCheckUtils]: 43: Hoare triple {28063#(<= main_~c~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {27951#true} is VALID [2022-04-28 12:43:27,506 INFO L290 TraceCheckUtils]: 44: Hoare triple {27951#true} ~cond := #in~cond; {27951#true} is VALID [2022-04-28 12:43:27,506 INFO L290 TraceCheckUtils]: 45: Hoare triple {27951#true} assume !(0 == ~cond); {27951#true} is VALID [2022-04-28 12:43:27,506 INFO L290 TraceCheckUtils]: 46: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-28 12:43:27,506 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {27951#true} {28063#(<= main_~c~0 2)} #104#return; {28063#(<= main_~c~0 2)} is VALID [2022-04-28 12:43:27,506 INFO L272 TraceCheckUtils]: 48: Hoare triple {28063#(<= main_~c~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {27951#true} is VALID [2022-04-28 12:43:27,506 INFO L290 TraceCheckUtils]: 49: Hoare triple {27951#true} ~cond := #in~cond; {27951#true} is VALID [2022-04-28 12:43:27,506 INFO L290 TraceCheckUtils]: 50: Hoare triple {27951#true} assume !(0 == ~cond); {27951#true} is VALID [2022-04-28 12:43:27,506 INFO L290 TraceCheckUtils]: 51: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-28 12:43:27,507 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {27951#true} {28063#(<= main_~c~0 2)} #106#return; {28063#(<= main_~c~0 2)} is VALID [2022-04-28 12:43:27,507 INFO L272 TraceCheckUtils]: 53: Hoare triple {28063#(<= main_~c~0 2)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {27951#true} is VALID [2022-04-28 12:43:27,507 INFO L290 TraceCheckUtils]: 54: Hoare triple {27951#true} ~cond := #in~cond; {27951#true} is VALID [2022-04-28 12:43:27,507 INFO L290 TraceCheckUtils]: 55: Hoare triple {27951#true} assume !(0 == ~cond); {27951#true} is VALID [2022-04-28 12:43:27,507 INFO L290 TraceCheckUtils]: 56: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-28 12:43:27,507 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {27951#true} {28063#(<= main_~c~0 2)} #108#return; {28063#(<= main_~c~0 2)} is VALID [2022-04-28 12:43:27,508 INFO L290 TraceCheckUtils]: 58: Hoare triple {28063#(<= main_~c~0 2)} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {28063#(<= main_~c~0 2)} is VALID [2022-04-28 12:43:27,508 INFO L290 TraceCheckUtils]: 59: Hoare triple {28063#(<= main_~c~0 2)} assume !false; {28063#(<= main_~c~0 2)} is VALID [2022-04-28 12:43:27,508 INFO L272 TraceCheckUtils]: 60: Hoare triple {28063#(<= main_~c~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {27951#true} is VALID [2022-04-28 12:43:27,508 INFO L290 TraceCheckUtils]: 61: Hoare triple {27951#true} ~cond := #in~cond; {27951#true} is VALID [2022-04-28 12:43:27,508 INFO L290 TraceCheckUtils]: 62: Hoare triple {27951#true} assume !(0 == ~cond); {27951#true} is VALID [2022-04-28 12:43:27,508 INFO L290 TraceCheckUtils]: 63: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-28 12:43:27,508 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {27951#true} {28063#(<= main_~c~0 2)} #102#return; {28063#(<= main_~c~0 2)} is VALID [2022-04-28 12:43:27,509 INFO L272 TraceCheckUtils]: 65: Hoare triple {28063#(<= main_~c~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {27951#true} is VALID [2022-04-28 12:43:27,509 INFO L290 TraceCheckUtils]: 66: Hoare triple {27951#true} ~cond := #in~cond; {27951#true} is VALID [2022-04-28 12:43:27,509 INFO L290 TraceCheckUtils]: 67: Hoare triple {27951#true} assume !(0 == ~cond); {27951#true} is VALID [2022-04-28 12:43:27,509 INFO L290 TraceCheckUtils]: 68: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-28 12:43:27,509 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {27951#true} {28063#(<= main_~c~0 2)} #104#return; {28063#(<= main_~c~0 2)} is VALID [2022-04-28 12:43:27,509 INFO L272 TraceCheckUtils]: 70: Hoare triple {28063#(<= main_~c~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {27951#true} is VALID [2022-04-28 12:43:27,509 INFO L290 TraceCheckUtils]: 71: Hoare triple {27951#true} ~cond := #in~cond; {27951#true} is VALID [2022-04-28 12:43:27,509 INFO L290 TraceCheckUtils]: 72: Hoare triple {27951#true} assume !(0 == ~cond); {27951#true} is VALID [2022-04-28 12:43:27,509 INFO L290 TraceCheckUtils]: 73: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-28 12:43:27,510 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {27951#true} {28063#(<= main_~c~0 2)} #106#return; {28063#(<= main_~c~0 2)} is VALID [2022-04-28 12:43:27,510 INFO L272 TraceCheckUtils]: 75: Hoare triple {28063#(<= main_~c~0 2)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {27951#true} is VALID [2022-04-28 12:43:27,510 INFO L290 TraceCheckUtils]: 76: Hoare triple {27951#true} ~cond := #in~cond; {27951#true} is VALID [2022-04-28 12:43:27,510 INFO L290 TraceCheckUtils]: 77: Hoare triple {27951#true} assume !(0 == ~cond); {27951#true} is VALID [2022-04-28 12:43:27,510 INFO L290 TraceCheckUtils]: 78: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-28 12:43:27,510 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {27951#true} {28063#(<= main_~c~0 2)} #108#return; {28063#(<= main_~c~0 2)} is VALID [2022-04-28 12:43:27,511 INFO L290 TraceCheckUtils]: 80: Hoare triple {28063#(<= main_~c~0 2)} assume !(~c~0 >= 2 * ~v~0); {28202#(and (<= main_~c~0 2) (not (<= (* main_~v~0 2) main_~c~0)))} is VALID [2022-04-28 12:43:27,511 INFO L290 TraceCheckUtils]: 81: Hoare triple {28202#(and (<= main_~c~0 2) (not (<= (* main_~v~0 2) main_~c~0)))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {28206#(< (* main_~c~0 2) 2)} is VALID [2022-04-28 12:43:27,511 INFO L290 TraceCheckUtils]: 82: Hoare triple {28206#(< (* main_~c~0 2) 2)} assume !false; {28206#(< (* main_~c~0 2) 2)} is VALID [2022-04-28 12:43:27,513 INFO L290 TraceCheckUtils]: 83: Hoare triple {28206#(< (* main_~c~0 2) 2)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {28213#(< main_~b~0 1)} is VALID [2022-04-28 12:43:27,513 INFO L290 TraceCheckUtils]: 84: Hoare triple {28213#(< main_~b~0 1)} assume !false; {28213#(< main_~b~0 1)} is VALID [2022-04-28 12:43:27,513 INFO L272 TraceCheckUtils]: 85: Hoare triple {28213#(< main_~b~0 1)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {27951#true} is VALID [2022-04-28 12:43:27,513 INFO L290 TraceCheckUtils]: 86: Hoare triple {27951#true} ~cond := #in~cond; {27951#true} is VALID [2022-04-28 12:43:27,513 INFO L290 TraceCheckUtils]: 87: Hoare triple {27951#true} assume !(0 == ~cond); {27951#true} is VALID [2022-04-28 12:43:27,513 INFO L290 TraceCheckUtils]: 88: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-28 12:43:27,514 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {27951#true} {28213#(< main_~b~0 1)} #102#return; {28213#(< main_~b~0 1)} is VALID [2022-04-28 12:43:27,514 INFO L272 TraceCheckUtils]: 90: Hoare triple {28213#(< main_~b~0 1)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {27951#true} is VALID [2022-04-28 12:43:27,514 INFO L290 TraceCheckUtils]: 91: Hoare triple {27951#true} ~cond := #in~cond; {27951#true} is VALID [2022-04-28 12:43:27,514 INFO L290 TraceCheckUtils]: 92: Hoare triple {27951#true} assume !(0 == ~cond); {27951#true} is VALID [2022-04-28 12:43:27,514 INFO L290 TraceCheckUtils]: 93: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-28 12:43:27,514 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {27951#true} {28213#(< main_~b~0 1)} #104#return; {28213#(< main_~b~0 1)} is VALID [2022-04-28 12:43:27,514 INFO L272 TraceCheckUtils]: 95: Hoare triple {28213#(< main_~b~0 1)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {27951#true} is VALID [2022-04-28 12:43:27,514 INFO L290 TraceCheckUtils]: 96: Hoare triple {27951#true} ~cond := #in~cond; {27951#true} is VALID [2022-04-28 12:43:27,514 INFO L290 TraceCheckUtils]: 97: Hoare triple {27951#true} assume !(0 == ~cond); {27951#true} is VALID [2022-04-28 12:43:27,514 INFO L290 TraceCheckUtils]: 98: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-28 12:43:27,515 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {27951#true} {28213#(< main_~b~0 1)} #106#return; {28213#(< main_~b~0 1)} is VALID [2022-04-28 12:43:27,515 INFO L272 TraceCheckUtils]: 100: Hoare triple {28213#(< main_~b~0 1)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {27951#true} is VALID [2022-04-28 12:43:27,515 INFO L290 TraceCheckUtils]: 101: Hoare triple {27951#true} ~cond := #in~cond; {27951#true} is VALID [2022-04-28 12:43:27,515 INFO L290 TraceCheckUtils]: 102: Hoare triple {27951#true} assume !(0 == ~cond); {27951#true} is VALID [2022-04-28 12:43:27,515 INFO L290 TraceCheckUtils]: 103: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-28 12:43:27,515 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {27951#true} {28213#(< main_~b~0 1)} #108#return; {28213#(< main_~b~0 1)} is VALID [2022-04-28 12:43:27,516 INFO L290 TraceCheckUtils]: 105: Hoare triple {28213#(< main_~b~0 1)} assume !(~c~0 >= 2 * ~v~0); {28213#(< main_~b~0 1)} is VALID [2022-04-28 12:43:27,516 INFO L290 TraceCheckUtils]: 106: Hoare triple {28213#(< main_~b~0 1)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {28213#(< main_~b~0 1)} is VALID [2022-04-28 12:43:27,516 INFO L290 TraceCheckUtils]: 107: Hoare triple {28213#(< main_~b~0 1)} assume !false; {28213#(< main_~b~0 1)} is VALID [2022-04-28 12:43:27,517 INFO L290 TraceCheckUtils]: 108: Hoare triple {28213#(< main_~b~0 1)} assume !(~c~0 >= ~b~0); {28289#(< main_~c~0 0)} is VALID [2022-04-28 12:43:27,517 INFO L290 TraceCheckUtils]: 109: Hoare triple {28289#(< main_~c~0 0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {28293#(< main_~b~0 0)} is VALID [2022-04-28 12:43:27,517 INFO L290 TraceCheckUtils]: 110: Hoare triple {28293#(< main_~b~0 0)} assume !false; {28293#(< main_~b~0 0)} is VALID [2022-04-28 12:43:27,517 INFO L290 TraceCheckUtils]: 111: Hoare triple {28293#(< main_~b~0 0)} assume !(0 != ~b~0); {27952#false} is VALID [2022-04-28 12:43:27,518 INFO L272 TraceCheckUtils]: 112: Hoare triple {27952#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {27952#false} is VALID [2022-04-28 12:43:27,518 INFO L290 TraceCheckUtils]: 113: Hoare triple {27952#false} ~cond := #in~cond; {27952#false} is VALID [2022-04-28 12:43:27,518 INFO L290 TraceCheckUtils]: 114: Hoare triple {27952#false} assume 0 == ~cond; {27952#false} is VALID [2022-04-28 12:43:27,518 INFO L290 TraceCheckUtils]: 115: Hoare triple {27952#false} assume !false; {27952#false} is VALID [2022-04-28 12:43:27,518 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 33 proven. 32 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2022-04-28 12:43:27,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:43:28,432 INFO L290 TraceCheckUtils]: 115: Hoare triple {27952#false} assume !false; {27952#false} is VALID [2022-04-28 12:43:28,432 INFO L290 TraceCheckUtils]: 114: Hoare triple {27952#false} assume 0 == ~cond; {27952#false} is VALID [2022-04-28 12:43:28,432 INFO L290 TraceCheckUtils]: 113: Hoare triple {27952#false} ~cond := #in~cond; {27952#false} is VALID [2022-04-28 12:43:28,432 INFO L272 TraceCheckUtils]: 112: Hoare triple {27952#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {27952#false} is VALID [2022-04-28 12:43:28,433 INFO L290 TraceCheckUtils]: 111: Hoare triple {28293#(< main_~b~0 0)} assume !(0 != ~b~0); {27952#false} is VALID [2022-04-28 12:43:28,433 INFO L290 TraceCheckUtils]: 110: Hoare triple {28293#(< main_~b~0 0)} assume !false; {28293#(< main_~b~0 0)} is VALID [2022-04-28 12:43:28,433 INFO L290 TraceCheckUtils]: 109: Hoare triple {28289#(< main_~c~0 0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {28293#(< main_~b~0 0)} is VALID [2022-04-28 12:43:28,435 INFO L290 TraceCheckUtils]: 108: Hoare triple {28213#(< main_~b~0 1)} assume !(~c~0 >= ~b~0); {28289#(< main_~c~0 0)} is VALID [2022-04-28 12:43:28,435 INFO L290 TraceCheckUtils]: 107: Hoare triple {28213#(< main_~b~0 1)} assume !false; {28213#(< main_~b~0 1)} is VALID [2022-04-28 12:43:28,435 INFO L290 TraceCheckUtils]: 106: Hoare triple {28213#(< main_~b~0 1)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {28213#(< main_~b~0 1)} is VALID [2022-04-28 12:43:28,435 INFO L290 TraceCheckUtils]: 105: Hoare triple {28213#(< main_~b~0 1)} assume !(~c~0 >= 2 * ~v~0); {28213#(< main_~b~0 1)} is VALID [2022-04-28 12:43:28,436 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {27951#true} {28213#(< main_~b~0 1)} #108#return; {28213#(< main_~b~0 1)} is VALID [2022-04-28 12:43:28,436 INFO L290 TraceCheckUtils]: 103: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-28 12:43:28,436 INFO L290 TraceCheckUtils]: 102: Hoare triple {27951#true} assume !(0 == ~cond); {27951#true} is VALID [2022-04-28 12:43:28,436 INFO L290 TraceCheckUtils]: 101: Hoare triple {27951#true} ~cond := #in~cond; {27951#true} is VALID [2022-04-28 12:43:28,436 INFO L272 TraceCheckUtils]: 100: Hoare triple {28213#(< main_~b~0 1)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {27951#true} is VALID [2022-04-28 12:43:28,437 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {27951#true} {28213#(< main_~b~0 1)} #106#return; {28213#(< main_~b~0 1)} is VALID [2022-04-28 12:43:28,437 INFO L290 TraceCheckUtils]: 98: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-28 12:43:28,437 INFO L290 TraceCheckUtils]: 97: Hoare triple {27951#true} assume !(0 == ~cond); {27951#true} is VALID [2022-04-28 12:43:28,437 INFO L290 TraceCheckUtils]: 96: Hoare triple {27951#true} ~cond := #in~cond; {27951#true} is VALID [2022-04-28 12:43:28,437 INFO L272 TraceCheckUtils]: 95: Hoare triple {28213#(< main_~b~0 1)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {27951#true} is VALID [2022-04-28 12:43:28,437 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {27951#true} {28213#(< main_~b~0 1)} #104#return; {28213#(< main_~b~0 1)} is VALID [2022-04-28 12:43:28,437 INFO L290 TraceCheckUtils]: 93: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-28 12:43:28,437 INFO L290 TraceCheckUtils]: 92: Hoare triple {27951#true} assume !(0 == ~cond); {27951#true} is VALID [2022-04-28 12:43:28,437 INFO L290 TraceCheckUtils]: 91: Hoare triple {27951#true} ~cond := #in~cond; {27951#true} is VALID [2022-04-28 12:43:28,437 INFO L272 TraceCheckUtils]: 90: Hoare triple {28213#(< main_~b~0 1)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {27951#true} is VALID [2022-04-28 12:43:28,438 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {27951#true} {28213#(< main_~b~0 1)} #102#return; {28213#(< main_~b~0 1)} is VALID [2022-04-28 12:43:28,438 INFO L290 TraceCheckUtils]: 88: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-28 12:43:28,438 INFO L290 TraceCheckUtils]: 87: Hoare triple {27951#true} assume !(0 == ~cond); {27951#true} is VALID [2022-04-28 12:43:28,438 INFO L290 TraceCheckUtils]: 86: Hoare triple {27951#true} ~cond := #in~cond; {27951#true} is VALID [2022-04-28 12:43:28,438 INFO L272 TraceCheckUtils]: 85: Hoare triple {28213#(< main_~b~0 1)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {27951#true} is VALID [2022-04-28 12:43:28,438 INFO L290 TraceCheckUtils]: 84: Hoare triple {28213#(< main_~b~0 1)} assume !false; {28213#(< main_~b~0 1)} is VALID [2022-04-28 12:43:28,439 INFO L290 TraceCheckUtils]: 83: Hoare triple {28408#(or (< main_~b~0 1) (not (<= main_~b~0 main_~c~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {28213#(< main_~b~0 1)} is VALID [2022-04-28 12:43:28,439 INFO L290 TraceCheckUtils]: 82: Hoare triple {28408#(or (< main_~b~0 1) (not (<= main_~b~0 main_~c~0)))} assume !false; {28408#(or (< main_~b~0 1) (not (<= main_~b~0 main_~c~0)))} is VALID [2022-04-28 12:43:28,440 INFO L290 TraceCheckUtils]: 81: Hoare triple {28415#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (< main_~b~0 1))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {28408#(or (< main_~b~0 1) (not (<= main_~b~0 main_~c~0)))} is VALID [2022-04-28 12:43:28,440 INFO L290 TraceCheckUtils]: 80: Hoare triple {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} assume !(~c~0 >= 2 * ~v~0); {28415#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (< main_~b~0 1))} is VALID [2022-04-28 12:43:28,441 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {27951#true} {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} #108#return; {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} is VALID [2022-04-28 12:43:28,441 INFO L290 TraceCheckUtils]: 78: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-28 12:43:28,441 INFO L290 TraceCheckUtils]: 77: Hoare triple {27951#true} assume !(0 == ~cond); {27951#true} is VALID [2022-04-28 12:43:28,441 INFO L290 TraceCheckUtils]: 76: Hoare triple {27951#true} ~cond := #in~cond; {27951#true} is VALID [2022-04-28 12:43:28,441 INFO L272 TraceCheckUtils]: 75: Hoare triple {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {27951#true} is VALID [2022-04-28 12:43:28,442 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {27951#true} {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} #106#return; {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} is VALID [2022-04-28 12:43:28,442 INFO L290 TraceCheckUtils]: 73: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-28 12:43:28,442 INFO L290 TraceCheckUtils]: 72: Hoare triple {27951#true} assume !(0 == ~cond); {27951#true} is VALID [2022-04-28 12:43:28,442 INFO L290 TraceCheckUtils]: 71: Hoare triple {27951#true} ~cond := #in~cond; {27951#true} is VALID [2022-04-28 12:43:28,442 INFO L272 TraceCheckUtils]: 70: Hoare triple {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {27951#true} is VALID [2022-04-28 12:43:28,442 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {27951#true} {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} #104#return; {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} is VALID [2022-04-28 12:43:28,442 INFO L290 TraceCheckUtils]: 68: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-28 12:43:28,442 INFO L290 TraceCheckUtils]: 67: Hoare triple {27951#true} assume !(0 == ~cond); {27951#true} is VALID [2022-04-28 12:43:28,442 INFO L290 TraceCheckUtils]: 66: Hoare triple {27951#true} ~cond := #in~cond; {27951#true} is VALID [2022-04-28 12:43:28,442 INFO L272 TraceCheckUtils]: 65: Hoare triple {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {27951#true} is VALID [2022-04-28 12:43:28,443 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {27951#true} {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} #102#return; {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} is VALID [2022-04-28 12:43:28,443 INFO L290 TraceCheckUtils]: 63: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-28 12:43:28,443 INFO L290 TraceCheckUtils]: 62: Hoare triple {27951#true} assume !(0 == ~cond); {27951#true} is VALID [2022-04-28 12:43:28,443 INFO L290 TraceCheckUtils]: 61: Hoare triple {27951#true} ~cond := #in~cond; {27951#true} is VALID [2022-04-28 12:43:28,443 INFO L272 TraceCheckUtils]: 60: Hoare triple {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {27951#true} is VALID [2022-04-28 12:43:28,443 INFO L290 TraceCheckUtils]: 59: Hoare triple {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} assume !false; {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} is VALID [2022-04-28 12:43:28,444 INFO L290 TraceCheckUtils]: 58: Hoare triple {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} is VALID [2022-04-28 12:43:28,444 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {27951#true} {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} #108#return; {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} is VALID [2022-04-28 12:43:28,444 INFO L290 TraceCheckUtils]: 56: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-28 12:43:28,444 INFO L290 TraceCheckUtils]: 55: Hoare triple {27951#true} assume !(0 == ~cond); {27951#true} is VALID [2022-04-28 12:43:28,444 INFO L290 TraceCheckUtils]: 54: Hoare triple {27951#true} ~cond := #in~cond; {27951#true} is VALID [2022-04-28 12:43:28,444 INFO L272 TraceCheckUtils]: 53: Hoare triple {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {27951#true} is VALID [2022-04-28 12:43:28,445 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {27951#true} {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} #106#return; {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} is VALID [2022-04-28 12:43:28,445 INFO L290 TraceCheckUtils]: 51: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-28 12:43:28,445 INFO L290 TraceCheckUtils]: 50: Hoare triple {27951#true} assume !(0 == ~cond); {27951#true} is VALID [2022-04-28 12:43:28,445 INFO L290 TraceCheckUtils]: 49: Hoare triple {27951#true} ~cond := #in~cond; {27951#true} is VALID [2022-04-28 12:43:28,445 INFO L272 TraceCheckUtils]: 48: Hoare triple {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {27951#true} is VALID [2022-04-28 12:43:28,446 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {27951#true} {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} #104#return; {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} is VALID [2022-04-28 12:43:28,446 INFO L290 TraceCheckUtils]: 46: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-28 12:43:28,446 INFO L290 TraceCheckUtils]: 45: Hoare triple {27951#true} assume !(0 == ~cond); {27951#true} is VALID [2022-04-28 12:43:28,446 INFO L290 TraceCheckUtils]: 44: Hoare triple {27951#true} ~cond := #in~cond; {27951#true} is VALID [2022-04-28 12:43:28,446 INFO L272 TraceCheckUtils]: 43: Hoare triple {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {27951#true} is VALID [2022-04-28 12:43:28,446 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {27951#true} {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} #102#return; {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} is VALID [2022-04-28 12:43:28,446 INFO L290 TraceCheckUtils]: 41: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-28 12:43:28,446 INFO L290 TraceCheckUtils]: 40: Hoare triple {27951#true} assume !(0 == ~cond); {27951#true} is VALID [2022-04-28 12:43:28,446 INFO L290 TraceCheckUtils]: 39: Hoare triple {27951#true} ~cond := #in~cond; {27951#true} is VALID [2022-04-28 12:43:28,447 INFO L272 TraceCheckUtils]: 38: Hoare triple {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {27951#true} is VALID [2022-04-28 12:43:28,447 INFO L290 TraceCheckUtils]: 37: Hoare triple {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} assume !false; {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} is VALID [2022-04-28 12:43:28,447 INFO L290 TraceCheckUtils]: 36: Hoare triple {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} is VALID [2022-04-28 12:43:28,447 INFO L290 TraceCheckUtils]: 35: Hoare triple {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} assume !false; {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} is VALID [2022-04-28 12:43:28,448 INFO L290 TraceCheckUtils]: 34: Hoare triple {28558#(or (< main_~b~0 1) (<= main_~a~0 (* main_~b~0 2)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {28419#(or (< main_~b~0 1) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} is VALID [2022-04-28 12:43:28,448 INFO L290 TraceCheckUtils]: 33: Hoare triple {28558#(or (< main_~b~0 1) (<= main_~a~0 (* main_~b~0 2)))} assume !false; {28558#(or (< main_~b~0 1) (<= main_~a~0 (* main_~b~0 2)))} is VALID [2022-04-28 12:43:28,449 INFO L290 TraceCheckUtils]: 32: Hoare triple {28565#(or (< main_~c~0 1) (<= main_~b~0 (* main_~c~0 2)))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {28558#(or (< main_~b~0 1) (<= main_~a~0 (* main_~b~0 2)))} is VALID [2022-04-28 12:43:28,449 INFO L290 TraceCheckUtils]: 31: Hoare triple {28565#(or (< main_~c~0 1) (<= main_~b~0 (* main_~c~0 2)))} assume !(~c~0 >= ~b~0); {28565#(or (< main_~c~0 1) (<= main_~b~0 (* main_~c~0 2)))} is VALID [2022-04-28 12:43:28,449 INFO L290 TraceCheckUtils]: 30: Hoare triple {28565#(or (< main_~c~0 1) (<= main_~b~0 (* main_~c~0 2)))} assume !false; {28565#(or (< main_~c~0 1) (<= main_~b~0 (* main_~c~0 2)))} is VALID [2022-04-28 12:43:28,450 INFO L290 TraceCheckUtils]: 29: Hoare triple {28575#(or (< main_~a~0 1) (<= main_~b~0 (* main_~a~0 2)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {28565#(or (< main_~c~0 1) (<= main_~b~0 (* main_~c~0 2)))} is VALID [2022-04-28 12:43:28,450 INFO L290 TraceCheckUtils]: 28: Hoare triple {28575#(or (< main_~a~0 1) (<= main_~b~0 (* main_~a~0 2)))} assume !false; {28575#(or (< main_~a~0 1) (<= main_~b~0 (* main_~a~0 2)))} is VALID [2022-04-28 12:43:28,451 INFO L290 TraceCheckUtils]: 27: Hoare triple {28582#(<= (div (- main_~y~0) (- 2)) 1)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {28575#(or (< main_~a~0 1) (<= main_~b~0 (* main_~a~0 2)))} is VALID [2022-04-28 12:43:28,451 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {27951#true} {28582#(<= (div (- main_~y~0) (- 2)) 1)} #100#return; {28582#(<= (div (- main_~y~0) (- 2)) 1)} is VALID [2022-04-28 12:43:28,451 INFO L290 TraceCheckUtils]: 25: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-28 12:43:28,451 INFO L290 TraceCheckUtils]: 24: Hoare triple {27951#true} assume !(0 == ~cond); {27951#true} is VALID [2022-04-28 12:43:28,451 INFO L290 TraceCheckUtils]: 23: Hoare triple {27951#true} ~cond := #in~cond; {27951#true} is VALID [2022-04-28 12:43:28,451 INFO L272 TraceCheckUtils]: 22: Hoare triple {28582#(<= (div (- main_~y~0) (- 2)) 1)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {27951#true} is VALID [2022-04-28 12:43:28,451 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {27951#true} {28582#(<= (div (- main_~y~0) (- 2)) 1)} #98#return; {28582#(<= (div (- main_~y~0) (- 2)) 1)} is VALID [2022-04-28 12:43:28,452 INFO L290 TraceCheckUtils]: 20: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-28 12:43:28,452 INFO L290 TraceCheckUtils]: 19: Hoare triple {27951#true} assume !(0 == ~cond); {27951#true} is VALID [2022-04-28 12:43:28,452 INFO L290 TraceCheckUtils]: 18: Hoare triple {27951#true} ~cond := #in~cond; {27951#true} is VALID [2022-04-28 12:43:28,452 INFO L272 TraceCheckUtils]: 17: Hoare triple {28582#(<= (div (- main_~y~0) (- 2)) 1)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {27951#true} is VALID [2022-04-28 12:43:28,452 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {27999#(not (= |assume_abort_if_not_#in~cond| 0))} {27951#true} #96#return; {28582#(<= (div (- main_~y~0) (- 2)) 1)} is VALID [2022-04-28 12:43:28,453 INFO L290 TraceCheckUtils]: 15: Hoare triple {27999#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {27999#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:43:28,453 INFO L290 TraceCheckUtils]: 14: Hoare triple {28625#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {27999#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:43:28,453 INFO L290 TraceCheckUtils]: 13: Hoare triple {27951#true} ~cond := #in~cond; {28625#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-28 12:43:28,453 INFO L272 TraceCheckUtils]: 12: Hoare triple {27951#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {27951#true} is VALID [2022-04-28 12:43:28,453 INFO L290 TraceCheckUtils]: 11: Hoare triple {27951#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {27951#true} is VALID [2022-04-28 12:43:28,453 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {27951#true} {27951#true} #94#return; {27951#true} is VALID [2022-04-28 12:43:28,453 INFO L290 TraceCheckUtils]: 9: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-28 12:43:28,453 INFO L290 TraceCheckUtils]: 8: Hoare triple {27951#true} assume !(0 == ~cond); {27951#true} is VALID [2022-04-28 12:43:28,453 INFO L290 TraceCheckUtils]: 7: Hoare triple {27951#true} ~cond := #in~cond; {27951#true} is VALID [2022-04-28 12:43:28,454 INFO L272 TraceCheckUtils]: 6: Hoare triple {27951#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {27951#true} is VALID [2022-04-28 12:43:28,454 INFO L290 TraceCheckUtils]: 5: Hoare triple {27951#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {27951#true} is VALID [2022-04-28 12:43:28,454 INFO L272 TraceCheckUtils]: 4: Hoare triple {27951#true} call #t~ret6 := main(); {27951#true} is VALID [2022-04-28 12:43:28,454 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27951#true} {27951#true} #112#return; {27951#true} is VALID [2022-04-28 12:43:28,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {27951#true} assume true; {27951#true} is VALID [2022-04-28 12:43:28,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {27951#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(11, 2);call #Ultimate.allocInit(12, 3); {27951#true} is VALID [2022-04-28 12:43:28,454 INFO L272 TraceCheckUtils]: 0: Hoare triple {27951#true} call ULTIMATE.init(); {27951#true} is VALID [2022-04-28 12:43:28,454 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 53 proven. 12 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2022-04-28 12:43:28,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:43:28,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937677336] [2022-04-28 12:43:28,454 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:43:28,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012802989] [2022-04-28 12:43:28,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012802989] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:43:28,454 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:43:28,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 21 [2022-04-28 12:43:28,455 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:43:28,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1779837140] [2022-04-28 12:43:28,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1779837140] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:43:28,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:43:28,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 12:43:28,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666797695] [2022-04-28 12:43:28,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:43:28,455 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 12 states have internal predecessors, (40), 5 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 116 [2022-04-28 12:43:28,456 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:43:28,456 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 12 states have internal predecessors, (40), 5 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 12:43:28,508 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:43:28,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 12:43:28,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:43:28,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 12:43:28,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2022-04-28 12:43:28,509 INFO L87 Difference]: Start difference. First operand 253 states and 340 transitions. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 12 states have internal predecessors, (40), 5 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 12:43:31,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:43:31,502 INFO L93 Difference]: Finished difference Result 317 states and 438 transitions. [2022-04-28 12:43:31,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 12:43:31,502 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 12 states have internal predecessors, (40), 5 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 116 [2022-04-28 12:43:31,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:43:31,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 12 states have internal predecessors, (40), 5 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 12:43:31,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 136 transitions. [2022-04-28 12:43:31,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 12 states have internal predecessors, (40), 5 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 12:43:31,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 136 transitions. [2022-04-28 12:43:31,505 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 136 transitions. [2022-04-28 12:43:31,642 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:43:31,648 INFO L225 Difference]: With dead ends: 317 [2022-04-28 12:43:31,648 INFO L226 Difference]: Without dead ends: 310 [2022-04-28 12:43:31,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 210 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=347, Invalid=913, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 12:43:31,649 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 57 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 12:43:31,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 344 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 12:43:31,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-04-28 12:43:32,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 259. [2022-04-28 12:43:32,899 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:43:32,899 INFO L82 GeneralOperation]: Start isEquivalent. First operand 310 states. Second operand has 259 states, 152 states have (on average 1.1513157894736843) internal successors, (175), 153 states have internal predecessors, (175), 87 states have call successors, (87), 20 states have call predecessors, (87), 19 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-04-28 12:43:32,899 INFO L74 IsIncluded]: Start isIncluded. First operand 310 states. Second operand has 259 states, 152 states have (on average 1.1513157894736843) internal successors, (175), 153 states have internal predecessors, (175), 87 states have call successors, (87), 20 states have call predecessors, (87), 19 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-04-28 12:43:32,903 INFO L87 Difference]: Start difference. First operand 310 states. Second operand has 259 states, 152 states have (on average 1.1513157894736843) internal successors, (175), 153 states have internal predecessors, (175), 87 states have call successors, (87), 20 states have call predecessors, (87), 19 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-04-28 12:43:32,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:43:32,909 INFO L93 Difference]: Finished difference Result 310 states and 431 transitions. [2022-04-28 12:43:32,909 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 431 transitions. [2022-04-28 12:43:32,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:43:32,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:43:32,910 INFO L74 IsIncluded]: Start isIncluded. First operand has 259 states, 152 states have (on average 1.1513157894736843) internal successors, (175), 153 states have internal predecessors, (175), 87 states have call successors, (87), 20 states have call predecessors, (87), 19 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) Second operand 310 states. [2022-04-28 12:43:32,910 INFO L87 Difference]: Start difference. First operand has 259 states, 152 states have (on average 1.1513157894736843) internal successors, (175), 153 states have internal predecessors, (175), 87 states have call successors, (87), 20 states have call predecessors, (87), 19 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) Second operand 310 states. [2022-04-28 12:43:32,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:43:32,915 INFO L93 Difference]: Finished difference Result 310 states and 431 transitions. [2022-04-28 12:43:32,915 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 431 transitions. [2022-04-28 12:43:32,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:43:32,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:43:32,916 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:43:32,916 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:43:32,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 152 states have (on average 1.1513157894736843) internal successors, (175), 153 states have internal predecessors, (175), 87 states have call successors, (87), 20 states have call predecessors, (87), 19 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-04-28 12:43:32,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 347 transitions. [2022-04-28 12:43:32,922 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 347 transitions. Word has length 116 [2022-04-28 12:43:32,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:43:32,922 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 347 transitions. [2022-04-28 12:43:32,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 12 states have internal predecessors, (40), 5 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-28 12:43:32,922 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 259 states and 347 transitions. [2022-04-28 12:43:33,757 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 347 edges. 347 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:43:33,758 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 347 transitions. [2022-04-28 12:43:33,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-04-28 12:43:33,758 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:43:33,758 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:43:33,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-04-28 12:43:33,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:43:33,967 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:43:33,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:43:33,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1687072417, now seen corresponding path program 13 times [2022-04-28 12:43:33,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:43:33,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [276846843] [2022-04-28 12:43:33,968 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:43:33,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1687072417, now seen corresponding path program 14 times [2022-04-28 12:43:33,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:43:33,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860940214] [2022-04-28 12:43:33,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:43:33,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:43:33,978 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:43:33,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1200211118] [2022-04-28 12:43:33,979 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:43:33,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:43:33,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:43:33,980 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:43:33,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-28 12:43:34,033 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:43:34,034 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:43:34,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 12:43:34,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:43:34,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:43:35,622 INFO L272 TraceCheckUtils]: 0: Hoare triple {30469#true} call ULTIMATE.init(); {30469#true} is VALID [2022-04-28 12:43:35,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {30469#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(11, 2);call #Ultimate.allocInit(12, 3); {30469#true} is VALID [2022-04-28 12:43:35,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-28 12:43:35,622 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30469#true} {30469#true} #112#return; {30469#true} is VALID [2022-04-28 12:43:35,622 INFO L272 TraceCheckUtils]: 4: Hoare triple {30469#true} call #t~ret6 := main(); {30469#true} is VALID [2022-04-28 12:43:35,622 INFO L290 TraceCheckUtils]: 5: Hoare triple {30469#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {30469#true} is VALID [2022-04-28 12:43:35,622 INFO L272 TraceCheckUtils]: 6: Hoare triple {30469#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {30469#true} is VALID [2022-04-28 12:43:35,622 INFO L290 TraceCheckUtils]: 7: Hoare triple {30469#true} ~cond := #in~cond; {30495#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 12:43:35,623 INFO L290 TraceCheckUtils]: 8: Hoare triple {30495#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {30499#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:43:35,623 INFO L290 TraceCheckUtils]: 9: Hoare triple {30499#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {30499#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:43:35,633 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {30499#(not (= |assume_abort_if_not_#in~cond| 0))} {30469#true} #94#return; {30506#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 12:43:35,634 INFO L290 TraceCheckUtils]: 11: Hoare triple {30506#(and (<= 0 main_~x~0) (<= main_~x~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {30506#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 12:43:35,634 INFO L272 TraceCheckUtils]: 12: Hoare triple {30506#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {30469#true} is VALID [2022-04-28 12:43:35,634 INFO L290 TraceCheckUtils]: 13: Hoare triple {30469#true} ~cond := #in~cond; {30469#true} is VALID [2022-04-28 12:43:35,634 INFO L290 TraceCheckUtils]: 14: Hoare triple {30469#true} assume !(0 == ~cond); {30469#true} is VALID [2022-04-28 12:43:35,634 INFO L290 TraceCheckUtils]: 15: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-28 12:43:35,634 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {30469#true} {30506#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #96#return; {30506#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 12:43:35,634 INFO L272 TraceCheckUtils]: 17: Hoare triple {30506#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {30469#true} is VALID [2022-04-28 12:43:35,634 INFO L290 TraceCheckUtils]: 18: Hoare triple {30469#true} ~cond := #in~cond; {30469#true} is VALID [2022-04-28 12:43:35,634 INFO L290 TraceCheckUtils]: 19: Hoare triple {30469#true} assume !(0 == ~cond); {30469#true} is VALID [2022-04-28 12:43:35,634 INFO L290 TraceCheckUtils]: 20: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-28 12:43:35,635 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {30469#true} {30506#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #98#return; {30506#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 12:43:35,635 INFO L272 TraceCheckUtils]: 22: Hoare triple {30506#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {30469#true} is VALID [2022-04-28 12:43:35,635 INFO L290 TraceCheckUtils]: 23: Hoare triple {30469#true} ~cond := #in~cond; {30469#true} is VALID [2022-04-28 12:43:35,635 INFO L290 TraceCheckUtils]: 24: Hoare triple {30469#true} assume !(0 == ~cond); {30469#true} is VALID [2022-04-28 12:43:35,635 INFO L290 TraceCheckUtils]: 25: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-28 12:43:35,635 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {30469#true} {30506#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #100#return; {30506#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 12:43:35,636 INFO L290 TraceCheckUtils]: 27: Hoare triple {30506#(and (<= 0 main_~x~0) (<= main_~x~0 2))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {30558#(<= main_~a~0 2)} is VALID [2022-04-28 12:43:35,636 INFO L290 TraceCheckUtils]: 28: Hoare triple {30558#(<= main_~a~0 2)} assume !false; {30558#(<= main_~a~0 2)} is VALID [2022-04-28 12:43:35,636 INFO L290 TraceCheckUtils]: 29: Hoare triple {30558#(<= main_~a~0 2)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {30565#(<= main_~c~0 2)} is VALID [2022-04-28 12:43:35,636 INFO L290 TraceCheckUtils]: 30: Hoare triple {30565#(<= main_~c~0 2)} assume !false; {30565#(<= main_~c~0 2)} is VALID [2022-04-28 12:43:35,637 INFO L290 TraceCheckUtils]: 31: Hoare triple {30565#(<= main_~c~0 2)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {30572#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} is VALID [2022-04-28 12:43:35,637 INFO L290 TraceCheckUtils]: 32: Hoare triple {30572#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} assume !false; {30572#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} is VALID [2022-04-28 12:43:35,637 INFO L272 TraceCheckUtils]: 33: Hoare triple {30572#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {30469#true} is VALID [2022-04-28 12:43:35,637 INFO L290 TraceCheckUtils]: 34: Hoare triple {30469#true} ~cond := #in~cond; {30469#true} is VALID [2022-04-28 12:43:35,637 INFO L290 TraceCheckUtils]: 35: Hoare triple {30469#true} assume !(0 == ~cond); {30469#true} is VALID [2022-04-28 12:43:35,637 INFO L290 TraceCheckUtils]: 36: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-28 12:43:35,638 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {30469#true} {30572#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} #102#return; {30572#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} is VALID [2022-04-28 12:43:35,638 INFO L272 TraceCheckUtils]: 38: Hoare triple {30572#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {30469#true} is VALID [2022-04-28 12:43:35,638 INFO L290 TraceCheckUtils]: 39: Hoare triple {30469#true} ~cond := #in~cond; {30469#true} is VALID [2022-04-28 12:43:35,638 INFO L290 TraceCheckUtils]: 40: Hoare triple {30469#true} assume !(0 == ~cond); {30469#true} is VALID [2022-04-28 12:43:35,638 INFO L290 TraceCheckUtils]: 41: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-28 12:43:35,638 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {30469#true} {30572#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} #104#return; {30572#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} is VALID [2022-04-28 12:43:35,638 INFO L272 TraceCheckUtils]: 43: Hoare triple {30572#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {30469#true} is VALID [2022-04-28 12:43:35,638 INFO L290 TraceCheckUtils]: 44: Hoare triple {30469#true} ~cond := #in~cond; {30469#true} is VALID [2022-04-28 12:43:35,639 INFO L290 TraceCheckUtils]: 45: Hoare triple {30469#true} assume !(0 == ~cond); {30469#true} is VALID [2022-04-28 12:43:35,639 INFO L290 TraceCheckUtils]: 46: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-28 12:43:35,639 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {30469#true} {30572#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} #106#return; {30572#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} is VALID [2022-04-28 12:43:35,639 INFO L272 TraceCheckUtils]: 48: Hoare triple {30572#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {30469#true} is VALID [2022-04-28 12:43:35,639 INFO L290 TraceCheckUtils]: 49: Hoare triple {30469#true} ~cond := #in~cond; {30469#true} is VALID [2022-04-28 12:43:35,639 INFO L290 TraceCheckUtils]: 50: Hoare triple {30469#true} assume !(0 == ~cond); {30469#true} is VALID [2022-04-28 12:43:35,639 INFO L290 TraceCheckUtils]: 51: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-28 12:43:35,640 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {30469#true} {30572#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} #108#return; {30572#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} is VALID [2022-04-28 12:43:35,640 INFO L290 TraceCheckUtils]: 53: Hoare triple {30572#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} assume !(~c~0 >= 2 * ~v~0); {30639#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2) (not (<= (* main_~v~0 2) main_~c~0)))} is VALID [2022-04-28 12:43:35,641 INFO L290 TraceCheckUtils]: 54: Hoare triple {30639#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2) (not (<= (* main_~v~0 2) main_~c~0)))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {30643#(and (< (* main_~c~0 2) 2) (< main_~c~0 main_~b~0))} is VALID [2022-04-28 12:43:35,641 INFO L290 TraceCheckUtils]: 55: Hoare triple {30643#(and (< (* main_~c~0 2) 2) (< main_~c~0 main_~b~0))} assume !false; {30643#(and (< (* main_~c~0 2) 2) (< main_~c~0 main_~b~0))} is VALID [2022-04-28 12:43:35,641 INFO L290 TraceCheckUtils]: 56: Hoare triple {30643#(and (< (* main_~c~0 2) 2) (< main_~c~0 main_~b~0))} assume !(~c~0 >= ~b~0); {30643#(and (< (* main_~c~0 2) 2) (< main_~c~0 main_~b~0))} is VALID [2022-04-28 12:43:35,642 INFO L290 TraceCheckUtils]: 57: Hoare triple {30643#(and (< (* main_~c~0 2) 2) (< main_~c~0 main_~b~0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {30653#(and (< main_~b~0 main_~a~0) (< main_~b~0 1))} is VALID [2022-04-28 12:43:35,642 INFO L290 TraceCheckUtils]: 58: Hoare triple {30653#(and (< main_~b~0 main_~a~0) (< main_~b~0 1))} assume !false; {30653#(and (< main_~b~0 main_~a~0) (< main_~b~0 1))} is VALID [2022-04-28 12:43:35,642 INFO L290 TraceCheckUtils]: 59: Hoare triple {30653#(and (< main_~b~0 main_~a~0) (< main_~b~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {30660#(and (< main_~b~0 1) (< main_~b~0 main_~c~0))} is VALID [2022-04-28 12:43:35,643 INFO L290 TraceCheckUtils]: 60: Hoare triple {30660#(and (< main_~b~0 1) (< main_~b~0 main_~c~0))} assume !false; {30660#(and (< main_~b~0 1) (< main_~b~0 main_~c~0))} is VALID [2022-04-28 12:43:35,643 INFO L290 TraceCheckUtils]: 61: Hoare triple {30660#(and (< main_~b~0 1) (< main_~b~0 main_~c~0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {30667#(and (<= main_~v~0 main_~b~0) (< main_~b~0 1) (< main_~b~0 main_~c~0))} is VALID [2022-04-28 12:43:35,643 INFO L290 TraceCheckUtils]: 62: Hoare triple {30667#(and (<= main_~v~0 main_~b~0) (< main_~b~0 1) (< main_~b~0 main_~c~0))} assume !false; {30667#(and (<= main_~v~0 main_~b~0) (< main_~b~0 1) (< main_~b~0 main_~c~0))} is VALID [2022-04-28 12:43:35,643 INFO L272 TraceCheckUtils]: 63: Hoare triple {30667#(and (<= main_~v~0 main_~b~0) (< main_~b~0 1) (< main_~b~0 main_~c~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {30469#true} is VALID [2022-04-28 12:43:35,643 INFO L290 TraceCheckUtils]: 64: Hoare triple {30469#true} ~cond := #in~cond; {30469#true} is VALID [2022-04-28 12:43:35,644 INFO L290 TraceCheckUtils]: 65: Hoare triple {30469#true} assume !(0 == ~cond); {30469#true} is VALID [2022-04-28 12:43:35,644 INFO L290 TraceCheckUtils]: 66: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-28 12:43:35,644 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {30469#true} {30667#(and (<= main_~v~0 main_~b~0) (< main_~b~0 1) (< main_~b~0 main_~c~0))} #102#return; {30667#(and (<= main_~v~0 main_~b~0) (< main_~b~0 1) (< main_~b~0 main_~c~0))} is VALID [2022-04-28 12:43:35,644 INFO L272 TraceCheckUtils]: 68: Hoare triple {30667#(and (<= main_~v~0 main_~b~0) (< main_~b~0 1) (< main_~b~0 main_~c~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {30469#true} is VALID [2022-04-28 12:43:35,644 INFO L290 TraceCheckUtils]: 69: Hoare triple {30469#true} ~cond := #in~cond; {30469#true} is VALID [2022-04-28 12:43:35,644 INFO L290 TraceCheckUtils]: 70: Hoare triple {30469#true} assume !(0 == ~cond); {30469#true} is VALID [2022-04-28 12:43:35,644 INFO L290 TraceCheckUtils]: 71: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-28 12:43:35,645 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {30469#true} {30667#(and (<= main_~v~0 main_~b~0) (< main_~b~0 1) (< main_~b~0 main_~c~0))} #104#return; {30667#(and (<= main_~v~0 main_~b~0) (< main_~b~0 1) (< main_~b~0 main_~c~0))} is VALID [2022-04-28 12:43:35,645 INFO L272 TraceCheckUtils]: 73: Hoare triple {30667#(and (<= main_~v~0 main_~b~0) (< main_~b~0 1) (< main_~b~0 main_~c~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {30469#true} is VALID [2022-04-28 12:43:35,645 INFO L290 TraceCheckUtils]: 74: Hoare triple {30469#true} ~cond := #in~cond; {30469#true} is VALID [2022-04-28 12:43:35,645 INFO L290 TraceCheckUtils]: 75: Hoare triple {30469#true} assume !(0 == ~cond); {30469#true} is VALID [2022-04-28 12:43:35,645 INFO L290 TraceCheckUtils]: 76: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-28 12:43:35,645 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {30469#true} {30667#(and (<= main_~v~0 main_~b~0) (< main_~b~0 1) (< main_~b~0 main_~c~0))} #106#return; {30667#(and (<= main_~v~0 main_~b~0) (< main_~b~0 1) (< main_~b~0 main_~c~0))} is VALID [2022-04-28 12:43:35,645 INFO L272 TraceCheckUtils]: 78: Hoare triple {30667#(and (<= main_~v~0 main_~b~0) (< main_~b~0 1) (< main_~b~0 main_~c~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {30469#true} is VALID [2022-04-28 12:43:35,646 INFO L290 TraceCheckUtils]: 79: Hoare triple {30469#true} ~cond := #in~cond; {30469#true} is VALID [2022-04-28 12:43:35,646 INFO L290 TraceCheckUtils]: 80: Hoare triple {30469#true} assume !(0 == ~cond); {30469#true} is VALID [2022-04-28 12:43:35,646 INFO L290 TraceCheckUtils]: 81: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-28 12:43:35,646 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {30469#true} {30667#(and (<= main_~v~0 main_~b~0) (< main_~b~0 1) (< main_~b~0 main_~c~0))} #108#return; {30667#(and (<= main_~v~0 main_~b~0) (< main_~b~0 1) (< main_~b~0 main_~c~0))} is VALID [2022-04-28 12:43:35,647 INFO L290 TraceCheckUtils]: 83: Hoare triple {30667#(and (<= main_~v~0 main_~b~0) (< main_~b~0 1) (< main_~b~0 main_~c~0))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {30734#(and (< main_~b~0 1) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-28 12:43:35,648 INFO L290 TraceCheckUtils]: 84: Hoare triple {30734#(and (< main_~b~0 1) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} assume !false; {30734#(and (< main_~b~0 1) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-28 12:43:35,648 INFO L272 TraceCheckUtils]: 85: Hoare triple {30734#(and (< main_~b~0 1) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {30469#true} is VALID [2022-04-28 12:43:35,648 INFO L290 TraceCheckUtils]: 86: Hoare triple {30469#true} ~cond := #in~cond; {30469#true} is VALID [2022-04-28 12:43:35,648 INFO L290 TraceCheckUtils]: 87: Hoare triple {30469#true} assume !(0 == ~cond); {30469#true} is VALID [2022-04-28 12:43:35,648 INFO L290 TraceCheckUtils]: 88: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-28 12:43:35,649 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {30469#true} {30734#(and (< main_~b~0 1) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} #102#return; {30734#(and (< main_~b~0 1) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-28 12:43:35,649 INFO L272 TraceCheckUtils]: 90: Hoare triple {30734#(and (< main_~b~0 1) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {30469#true} is VALID [2022-04-28 12:43:35,649 INFO L290 TraceCheckUtils]: 91: Hoare triple {30469#true} ~cond := #in~cond; {30469#true} is VALID [2022-04-28 12:43:35,649 INFO L290 TraceCheckUtils]: 92: Hoare triple {30469#true} assume !(0 == ~cond); {30469#true} is VALID [2022-04-28 12:43:35,649 INFO L290 TraceCheckUtils]: 93: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-28 12:43:35,649 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {30469#true} {30734#(and (< main_~b~0 1) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} #104#return; {30734#(and (< main_~b~0 1) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-28 12:43:35,649 INFO L272 TraceCheckUtils]: 95: Hoare triple {30734#(and (< main_~b~0 1) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {30469#true} is VALID [2022-04-28 12:43:35,649 INFO L290 TraceCheckUtils]: 96: Hoare triple {30469#true} ~cond := #in~cond; {30469#true} is VALID [2022-04-28 12:43:35,649 INFO L290 TraceCheckUtils]: 97: Hoare triple {30469#true} assume !(0 == ~cond); {30469#true} is VALID [2022-04-28 12:43:35,650 INFO L290 TraceCheckUtils]: 98: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-28 12:43:35,667 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {30469#true} {30734#(and (< main_~b~0 1) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} #106#return; {30734#(and (< main_~b~0 1) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-28 12:43:35,667 INFO L272 TraceCheckUtils]: 100: Hoare triple {30734#(and (< main_~b~0 1) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {30469#true} is VALID [2022-04-28 12:43:35,668 INFO L290 TraceCheckUtils]: 101: Hoare triple {30469#true} ~cond := #in~cond; {30469#true} is VALID [2022-04-28 12:43:35,668 INFO L290 TraceCheckUtils]: 102: Hoare triple {30469#true} assume !(0 == ~cond); {30469#true} is VALID [2022-04-28 12:43:35,668 INFO L290 TraceCheckUtils]: 103: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-28 12:43:35,668 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {30469#true} {30734#(and (< main_~b~0 1) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} #108#return; {30734#(and (< main_~b~0 1) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-28 12:43:35,669 INFO L290 TraceCheckUtils]: 105: Hoare triple {30734#(and (< main_~b~0 1) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} assume !(~c~0 >= 2 * ~v~0); {30734#(and (< main_~b~0 1) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-28 12:43:35,670 INFO L290 TraceCheckUtils]: 106: Hoare triple {30734#(and (< main_~b~0 1) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {30804#(and (< main_~b~0 1) (< (div (+ (- 1) main_~c~0 (* (- 1) main_~b~0)) (- 2)) (+ main_~b~0 1)))} is VALID [2022-04-28 12:43:35,670 INFO L290 TraceCheckUtils]: 107: Hoare triple {30804#(and (< main_~b~0 1) (< (div (+ (- 1) main_~c~0 (* (- 1) main_~b~0)) (- 2)) (+ main_~b~0 1)))} assume !false; {30804#(and (< main_~b~0 1) (< (div (+ (- 1) main_~c~0 (* (- 1) main_~b~0)) (- 2)) (+ main_~b~0 1)))} is VALID [2022-04-28 12:43:35,671 INFO L290 TraceCheckUtils]: 108: Hoare triple {30804#(and (< main_~b~0 1) (< (div (+ (- 1) main_~c~0 (* (- 1) main_~b~0)) (- 2)) (+ main_~b~0 1)))} assume !(~c~0 >= ~b~0); {30470#false} is VALID [2022-04-28 12:43:35,672 INFO L290 TraceCheckUtils]: 109: Hoare triple {30470#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {30470#false} is VALID [2022-04-28 12:43:35,672 INFO L290 TraceCheckUtils]: 110: Hoare triple {30470#false} assume !false; {30470#false} is VALID [2022-04-28 12:43:35,672 INFO L290 TraceCheckUtils]: 111: Hoare triple {30470#false} assume !(0 != ~b~0); {30470#false} is VALID [2022-04-28 12:43:35,672 INFO L272 TraceCheckUtils]: 112: Hoare triple {30470#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {30470#false} is VALID [2022-04-28 12:43:35,672 INFO L290 TraceCheckUtils]: 113: Hoare triple {30470#false} ~cond := #in~cond; {30470#false} is VALID [2022-04-28 12:43:35,672 INFO L290 TraceCheckUtils]: 114: Hoare triple {30470#false} assume 0 == ~cond; {30470#false} is VALID [2022-04-28 12:43:35,672 INFO L290 TraceCheckUtils]: 115: Hoare triple {30470#false} assume !false; {30470#false} is VALID [2022-04-28 12:43:35,672 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 39 proven. 32 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2022-04-28 12:43:35,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:43:41,134 INFO L290 TraceCheckUtils]: 115: Hoare triple {30470#false} assume !false; {30470#false} is VALID [2022-04-28 12:43:41,134 INFO L290 TraceCheckUtils]: 114: Hoare triple {30470#false} assume 0 == ~cond; {30470#false} is VALID [2022-04-28 12:43:41,134 INFO L290 TraceCheckUtils]: 113: Hoare triple {30470#false} ~cond := #in~cond; {30470#false} is VALID [2022-04-28 12:43:41,134 INFO L272 TraceCheckUtils]: 112: Hoare triple {30470#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {30470#false} is VALID [2022-04-28 12:43:41,134 INFO L290 TraceCheckUtils]: 111: Hoare triple {30470#false} assume !(0 != ~b~0); {30470#false} is VALID [2022-04-28 12:43:41,134 INFO L290 TraceCheckUtils]: 110: Hoare triple {30470#false} assume !false; {30470#false} is VALID [2022-04-28 12:43:41,134 INFO L290 TraceCheckUtils]: 109: Hoare triple {30470#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {30470#false} is VALID [2022-04-28 12:43:41,134 INFO L290 TraceCheckUtils]: 108: Hoare triple {30853#(<= main_~b~0 main_~c~0)} assume !(~c~0 >= ~b~0); {30470#false} is VALID [2022-04-28 12:43:41,135 INFO L290 TraceCheckUtils]: 107: Hoare triple {30853#(<= main_~b~0 main_~c~0)} assume !false; {30853#(<= main_~b~0 main_~c~0)} is VALID [2022-04-28 12:43:41,135 INFO L290 TraceCheckUtils]: 106: Hoare triple {30860#(<= (+ main_~b~0 main_~v~0) main_~c~0)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {30853#(<= main_~b~0 main_~c~0)} is VALID [2022-04-28 12:43:41,136 INFO L290 TraceCheckUtils]: 105: Hoare triple {30860#(<= (+ main_~b~0 main_~v~0) main_~c~0)} assume !(~c~0 >= 2 * ~v~0); {30860#(<= (+ main_~b~0 main_~v~0) main_~c~0)} is VALID [2022-04-28 12:43:41,136 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {30469#true} {30860#(<= (+ main_~b~0 main_~v~0) main_~c~0)} #108#return; {30860#(<= (+ main_~b~0 main_~v~0) main_~c~0)} is VALID [2022-04-28 12:43:41,136 INFO L290 TraceCheckUtils]: 103: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-28 12:43:41,136 INFO L290 TraceCheckUtils]: 102: Hoare triple {30469#true} assume !(0 == ~cond); {30469#true} is VALID [2022-04-28 12:43:41,136 INFO L290 TraceCheckUtils]: 101: Hoare triple {30469#true} ~cond := #in~cond; {30469#true} is VALID [2022-04-28 12:43:41,136 INFO L272 TraceCheckUtils]: 100: Hoare triple {30860#(<= (+ main_~b~0 main_~v~0) main_~c~0)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {30469#true} is VALID [2022-04-28 12:43:41,137 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {30469#true} {30860#(<= (+ main_~b~0 main_~v~0) main_~c~0)} #106#return; {30860#(<= (+ main_~b~0 main_~v~0) main_~c~0)} is VALID [2022-04-28 12:43:41,137 INFO L290 TraceCheckUtils]: 98: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-28 12:43:41,137 INFO L290 TraceCheckUtils]: 97: Hoare triple {30469#true} assume !(0 == ~cond); {30469#true} is VALID [2022-04-28 12:43:41,137 INFO L290 TraceCheckUtils]: 96: Hoare triple {30469#true} ~cond := #in~cond; {30469#true} is VALID [2022-04-28 12:43:41,137 INFO L272 TraceCheckUtils]: 95: Hoare triple {30860#(<= (+ main_~b~0 main_~v~0) main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {30469#true} is VALID [2022-04-28 12:43:41,137 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {30469#true} {30860#(<= (+ main_~b~0 main_~v~0) main_~c~0)} #104#return; {30860#(<= (+ main_~b~0 main_~v~0) main_~c~0)} is VALID [2022-04-28 12:43:41,138 INFO L290 TraceCheckUtils]: 93: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-28 12:43:41,138 INFO L290 TraceCheckUtils]: 92: Hoare triple {30469#true} assume !(0 == ~cond); {30469#true} is VALID [2022-04-28 12:43:41,138 INFO L290 TraceCheckUtils]: 91: Hoare triple {30469#true} ~cond := #in~cond; {30469#true} is VALID [2022-04-28 12:43:41,138 INFO L272 TraceCheckUtils]: 90: Hoare triple {30860#(<= (+ main_~b~0 main_~v~0) main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {30469#true} is VALID [2022-04-28 12:43:41,138 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {30469#true} {30860#(<= (+ main_~b~0 main_~v~0) main_~c~0)} #102#return; {30860#(<= (+ main_~b~0 main_~v~0) main_~c~0)} is VALID [2022-04-28 12:43:41,138 INFO L290 TraceCheckUtils]: 88: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-28 12:43:41,138 INFO L290 TraceCheckUtils]: 87: Hoare triple {30469#true} assume !(0 == ~cond); {30469#true} is VALID [2022-04-28 12:43:41,138 INFO L290 TraceCheckUtils]: 86: Hoare triple {30469#true} ~cond := #in~cond; {30469#true} is VALID [2022-04-28 12:43:41,138 INFO L272 TraceCheckUtils]: 85: Hoare triple {30860#(<= (+ main_~b~0 main_~v~0) main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {30469#true} is VALID [2022-04-28 12:43:41,139 INFO L290 TraceCheckUtils]: 84: Hoare triple {30860#(<= (+ main_~b~0 main_~v~0) main_~c~0)} assume !false; {30860#(<= (+ main_~b~0 main_~v~0) main_~c~0)} is VALID [2022-04-28 12:43:41,139 INFO L290 TraceCheckUtils]: 83: Hoare triple {30930#(<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {30860#(<= (+ main_~b~0 main_~v~0) main_~c~0)} is VALID [2022-04-28 12:43:41,140 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {30469#true} {30930#(<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)} #108#return; {30930#(<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)} is VALID [2022-04-28 12:43:41,140 INFO L290 TraceCheckUtils]: 81: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-28 12:43:41,140 INFO L290 TraceCheckUtils]: 80: Hoare triple {30469#true} assume !(0 == ~cond); {30469#true} is VALID [2022-04-28 12:43:41,140 INFO L290 TraceCheckUtils]: 79: Hoare triple {30469#true} ~cond := #in~cond; {30469#true} is VALID [2022-04-28 12:43:41,140 INFO L272 TraceCheckUtils]: 78: Hoare triple {30930#(<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {30469#true} is VALID [2022-04-28 12:43:41,141 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {30469#true} {30930#(<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)} #106#return; {30930#(<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)} is VALID [2022-04-28 12:43:41,141 INFO L290 TraceCheckUtils]: 76: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-28 12:43:41,141 INFO L290 TraceCheckUtils]: 75: Hoare triple {30469#true} assume !(0 == ~cond); {30469#true} is VALID [2022-04-28 12:43:41,141 INFO L290 TraceCheckUtils]: 74: Hoare triple {30469#true} ~cond := #in~cond; {30469#true} is VALID [2022-04-28 12:43:41,141 INFO L272 TraceCheckUtils]: 73: Hoare triple {30930#(<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {30469#true} is VALID [2022-04-28 12:43:41,141 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {30469#true} {30930#(<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)} #104#return; {30930#(<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)} is VALID [2022-04-28 12:43:41,141 INFO L290 TraceCheckUtils]: 71: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-28 12:43:41,141 INFO L290 TraceCheckUtils]: 70: Hoare triple {30469#true} assume !(0 == ~cond); {30469#true} is VALID [2022-04-28 12:43:41,141 INFO L290 TraceCheckUtils]: 69: Hoare triple {30469#true} ~cond := #in~cond; {30469#true} is VALID [2022-04-28 12:43:41,141 INFO L272 TraceCheckUtils]: 68: Hoare triple {30930#(<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {30469#true} is VALID [2022-04-28 12:43:41,142 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {30469#true} {30930#(<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)} #102#return; {30930#(<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)} is VALID [2022-04-28 12:43:41,142 INFO L290 TraceCheckUtils]: 66: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-28 12:43:41,142 INFO L290 TraceCheckUtils]: 65: Hoare triple {30469#true} assume !(0 == ~cond); {30469#true} is VALID [2022-04-28 12:43:41,142 INFO L290 TraceCheckUtils]: 64: Hoare triple {30469#true} ~cond := #in~cond; {30469#true} is VALID [2022-04-28 12:43:41,142 INFO L272 TraceCheckUtils]: 63: Hoare triple {30930#(<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {30469#true} is VALID [2022-04-28 12:43:41,143 INFO L290 TraceCheckUtils]: 62: Hoare triple {30930#(<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)} assume !false; {30930#(<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)} is VALID [2022-04-28 12:43:41,144 INFO L290 TraceCheckUtils]: 61: Hoare triple {30997#(<= main_~b~0 (div (+ main_~c~0 (* (- 1) main_~b~0)) 2))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {30930#(<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)} is VALID [2022-04-28 12:43:41,144 INFO L290 TraceCheckUtils]: 60: Hoare triple {30997#(<= main_~b~0 (div (+ main_~c~0 (* (- 1) main_~b~0)) 2))} assume !false; {30997#(<= main_~b~0 (div (+ main_~c~0 (* (- 1) main_~b~0)) 2))} is VALID [2022-04-28 12:43:41,145 INFO L290 TraceCheckUtils]: 59: Hoare triple {31004#(<= main_~b~0 (+ (div (+ (- 2) main_~a~0 (* (- 1) main_~b~0)) 2) 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {30997#(<= main_~b~0 (div (+ main_~c~0 (* (- 1) main_~b~0)) 2))} is VALID [2022-04-28 12:43:41,145 INFO L290 TraceCheckUtils]: 58: Hoare triple {31004#(<= main_~b~0 (+ (div (+ (- 2) main_~a~0 (* (- 1) main_~b~0)) 2) 1))} assume !false; {31004#(<= main_~b~0 (+ (div (+ (- 2) main_~a~0 (* (- 1) main_~b~0)) 2) 1))} is VALID [2022-04-28 12:43:41,146 INFO L290 TraceCheckUtils]: 57: Hoare triple {31011#(<= main_~c~0 (+ 2 (div (+ (* (- 1) main_~c~0) main_~b~0 (- 4)) 2)))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {31004#(<= main_~b~0 (+ (div (+ (- 2) main_~a~0 (* (- 1) main_~b~0)) 2) 1))} is VALID [2022-04-28 12:43:41,147 INFO L290 TraceCheckUtils]: 56: Hoare triple {31011#(<= main_~c~0 (+ 2 (div (+ (* (- 1) main_~c~0) main_~b~0 (- 4)) 2)))} assume !(~c~0 >= ~b~0); {31011#(<= main_~c~0 (+ 2 (div (+ (* (- 1) main_~c~0) main_~b~0 (- 4)) 2)))} is VALID [2022-04-28 12:43:41,147 INFO L290 TraceCheckUtils]: 55: Hoare triple {31011#(<= main_~c~0 (+ 2 (div (+ (* (- 1) main_~c~0) main_~b~0 (- 4)) 2)))} assume !false; {31011#(<= main_~c~0 (+ 2 (div (+ (* (- 1) main_~c~0) main_~b~0 (- 4)) 2)))} is VALID [2022-04-28 12:43:41,148 INFO L290 TraceCheckUtils]: 54: Hoare triple {31021#(<= main_~c~0 (+ (div (+ (* (- 1) main_~c~0) main_~b~0 main_~v~0 (- 6)) 2) main_~v~0 3))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {31011#(<= main_~c~0 (+ 2 (div (+ (* (- 1) main_~c~0) main_~b~0 (- 4)) 2)))} is VALID [2022-04-28 12:43:41,148 INFO L290 TraceCheckUtils]: 53: Hoare triple {31025#(or (<= (* main_~v~0 2) main_~c~0) (<= main_~c~0 (+ (div (+ (* (- 1) main_~c~0) main_~b~0 main_~v~0 (- 6)) 2) main_~v~0 3)))} assume !(~c~0 >= 2 * ~v~0); {31021#(<= main_~c~0 (+ (div (+ (* (- 1) main_~c~0) main_~b~0 main_~v~0 (- 6)) 2) main_~v~0 3))} is VALID [2022-04-28 12:43:41,148 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {30469#true} {31025#(or (<= (* main_~v~0 2) main_~c~0) (<= main_~c~0 (+ (div (+ (* (- 1) main_~c~0) main_~b~0 main_~v~0 (- 6)) 2) main_~v~0 3)))} #108#return; {31025#(or (<= (* main_~v~0 2) main_~c~0) (<= main_~c~0 (+ (div (+ (* (- 1) main_~c~0) main_~b~0 main_~v~0 (- 6)) 2) main_~v~0 3)))} is VALID [2022-04-28 12:43:41,148 INFO L290 TraceCheckUtils]: 51: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-28 12:43:41,148 INFO L290 TraceCheckUtils]: 50: Hoare triple {30469#true} assume !(0 == ~cond); {30469#true} is VALID [2022-04-28 12:43:41,149 INFO L290 TraceCheckUtils]: 49: Hoare triple {30469#true} ~cond := #in~cond; {30469#true} is VALID [2022-04-28 12:43:41,149 INFO L272 TraceCheckUtils]: 48: Hoare triple {31025#(or (<= (* main_~v~0 2) main_~c~0) (<= main_~c~0 (+ (div (+ (* (- 1) main_~c~0) main_~b~0 main_~v~0 (- 6)) 2) main_~v~0 3)))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {30469#true} is VALID [2022-04-28 12:43:41,149 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {30469#true} {31025#(or (<= (* main_~v~0 2) main_~c~0) (<= main_~c~0 (+ (div (+ (* (- 1) main_~c~0) main_~b~0 main_~v~0 (- 6)) 2) main_~v~0 3)))} #106#return; {31025#(or (<= (* main_~v~0 2) main_~c~0) (<= main_~c~0 (+ (div (+ (* (- 1) main_~c~0) main_~b~0 main_~v~0 (- 6)) 2) main_~v~0 3)))} is VALID [2022-04-28 12:43:41,149 INFO L290 TraceCheckUtils]: 46: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-28 12:43:41,149 INFO L290 TraceCheckUtils]: 45: Hoare triple {30469#true} assume !(0 == ~cond); {30469#true} is VALID [2022-04-28 12:43:41,149 INFO L290 TraceCheckUtils]: 44: Hoare triple {30469#true} ~cond := #in~cond; {30469#true} is VALID [2022-04-28 12:43:41,149 INFO L272 TraceCheckUtils]: 43: Hoare triple {31025#(or (<= (* main_~v~0 2) main_~c~0) (<= main_~c~0 (+ (div (+ (* (- 1) main_~c~0) main_~b~0 main_~v~0 (- 6)) 2) main_~v~0 3)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {30469#true} is VALID [2022-04-28 12:43:41,150 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {30469#true} {31025#(or (<= (* main_~v~0 2) main_~c~0) (<= main_~c~0 (+ (div (+ (* (- 1) main_~c~0) main_~b~0 main_~v~0 (- 6)) 2) main_~v~0 3)))} #104#return; {31025#(or (<= (* main_~v~0 2) main_~c~0) (<= main_~c~0 (+ (div (+ (* (- 1) main_~c~0) main_~b~0 main_~v~0 (- 6)) 2) main_~v~0 3)))} is VALID [2022-04-28 12:43:41,150 INFO L290 TraceCheckUtils]: 41: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-28 12:43:41,150 INFO L290 TraceCheckUtils]: 40: Hoare triple {30469#true} assume !(0 == ~cond); {30469#true} is VALID [2022-04-28 12:43:41,150 INFO L290 TraceCheckUtils]: 39: Hoare triple {30469#true} ~cond := #in~cond; {30469#true} is VALID [2022-04-28 12:43:41,150 INFO L272 TraceCheckUtils]: 38: Hoare triple {31025#(or (<= (* main_~v~0 2) main_~c~0) (<= main_~c~0 (+ (div (+ (* (- 1) main_~c~0) main_~b~0 main_~v~0 (- 6)) 2) main_~v~0 3)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {30469#true} is VALID [2022-04-28 12:43:41,150 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {30469#true} {31025#(or (<= (* main_~v~0 2) main_~c~0) (<= main_~c~0 (+ (div (+ (* (- 1) main_~c~0) main_~b~0 main_~v~0 (- 6)) 2) main_~v~0 3)))} #102#return; {31025#(or (<= (* main_~v~0 2) main_~c~0) (<= main_~c~0 (+ (div (+ (* (- 1) main_~c~0) main_~b~0 main_~v~0 (- 6)) 2) main_~v~0 3)))} is VALID [2022-04-28 12:43:41,151 INFO L290 TraceCheckUtils]: 36: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-28 12:43:41,151 INFO L290 TraceCheckUtils]: 35: Hoare triple {30469#true} assume !(0 == ~cond); {30469#true} is VALID [2022-04-28 12:43:41,151 INFO L290 TraceCheckUtils]: 34: Hoare triple {30469#true} ~cond := #in~cond; {30469#true} is VALID [2022-04-28 12:43:41,151 INFO L272 TraceCheckUtils]: 33: Hoare triple {31025#(or (<= (* main_~v~0 2) main_~c~0) (<= main_~c~0 (+ (div (+ (* (- 1) main_~c~0) main_~b~0 main_~v~0 (- 6)) 2) main_~v~0 3)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {30469#true} is VALID [2022-04-28 12:43:41,151 INFO L290 TraceCheckUtils]: 32: Hoare triple {31025#(or (<= (* main_~v~0 2) main_~c~0) (<= main_~c~0 (+ (div (+ (* (- 1) main_~c~0) main_~b~0 main_~v~0 (- 6)) 2) main_~v~0 3)))} assume !false; {31025#(or (<= (* main_~v~0 2) main_~c~0) (<= main_~c~0 (+ (div (+ (* (- 1) main_~c~0) main_~b~0 main_~v~0 (- 6)) 2) main_~v~0 3)))} is VALID [2022-04-28 12:43:41,152 INFO L290 TraceCheckUtils]: 31: Hoare triple {31092#(<= 0 (+ (* (div (+ (* (- 1) main_~c~0) (- 12)) 2) 2) (div (+ main_~c~0 6) 2) 11))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {31025#(or (<= (* main_~v~0 2) main_~c~0) (<= main_~c~0 (+ (div (+ (* (- 1) main_~c~0) main_~b~0 main_~v~0 (- 6)) 2) main_~v~0 3)))} is VALID [2022-04-28 12:43:41,152 INFO L290 TraceCheckUtils]: 30: Hoare triple {31092#(<= 0 (+ (* (div (+ (* (- 1) main_~c~0) (- 12)) 2) 2) (div (+ main_~c~0 6) 2) 11))} assume !false; {31092#(<= 0 (+ (* (div (+ (* (- 1) main_~c~0) (- 12)) 2) 2) (div (+ main_~c~0 6) 2) 11))} is VALID [2022-04-28 12:43:41,153 INFO L290 TraceCheckUtils]: 29: Hoare triple {30558#(<= main_~a~0 2)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {31092#(<= 0 (+ (* (div (+ (* (- 1) main_~c~0) (- 12)) 2) 2) (div (+ main_~c~0 6) 2) 11))} is VALID [2022-04-28 12:43:41,153 INFO L290 TraceCheckUtils]: 28: Hoare triple {30558#(<= main_~a~0 2)} assume !false; {30558#(<= main_~a~0 2)} is VALID [2022-04-28 12:43:41,153 INFO L290 TraceCheckUtils]: 27: Hoare triple {31105#(<= main_~x~0 2)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {30558#(<= main_~a~0 2)} is VALID [2022-04-28 12:43:41,154 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {30469#true} {31105#(<= main_~x~0 2)} #100#return; {31105#(<= main_~x~0 2)} is VALID [2022-04-28 12:43:41,154 INFO L290 TraceCheckUtils]: 25: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-28 12:43:41,154 INFO L290 TraceCheckUtils]: 24: Hoare triple {30469#true} assume !(0 == ~cond); {30469#true} is VALID [2022-04-28 12:43:41,154 INFO L290 TraceCheckUtils]: 23: Hoare triple {30469#true} ~cond := #in~cond; {30469#true} is VALID [2022-04-28 12:43:41,154 INFO L272 TraceCheckUtils]: 22: Hoare triple {31105#(<= main_~x~0 2)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {30469#true} is VALID [2022-04-28 12:43:41,154 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {30469#true} {31105#(<= main_~x~0 2)} #98#return; {31105#(<= main_~x~0 2)} is VALID [2022-04-28 12:43:41,154 INFO L290 TraceCheckUtils]: 20: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-28 12:43:41,154 INFO L290 TraceCheckUtils]: 19: Hoare triple {30469#true} assume !(0 == ~cond); {30469#true} is VALID [2022-04-28 12:43:41,154 INFO L290 TraceCheckUtils]: 18: Hoare triple {30469#true} ~cond := #in~cond; {30469#true} is VALID [2022-04-28 12:43:41,154 INFO L272 TraceCheckUtils]: 17: Hoare triple {31105#(<= main_~x~0 2)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {30469#true} is VALID [2022-04-28 12:43:41,155 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {30469#true} {31105#(<= main_~x~0 2)} #96#return; {31105#(<= main_~x~0 2)} is VALID [2022-04-28 12:43:41,155 INFO L290 TraceCheckUtils]: 15: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-28 12:43:41,155 INFO L290 TraceCheckUtils]: 14: Hoare triple {30469#true} assume !(0 == ~cond); {30469#true} is VALID [2022-04-28 12:43:41,155 INFO L290 TraceCheckUtils]: 13: Hoare triple {30469#true} ~cond := #in~cond; {30469#true} is VALID [2022-04-28 12:43:41,155 INFO L272 TraceCheckUtils]: 12: Hoare triple {31105#(<= main_~x~0 2)} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {30469#true} is VALID [2022-04-28 12:43:41,155 INFO L290 TraceCheckUtils]: 11: Hoare triple {31105#(<= main_~x~0 2)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {31105#(<= main_~x~0 2)} is VALID [2022-04-28 12:43:41,156 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {30499#(not (= |assume_abort_if_not_#in~cond| 0))} {30469#true} #94#return; {31105#(<= main_~x~0 2)} is VALID [2022-04-28 12:43:41,156 INFO L290 TraceCheckUtils]: 9: Hoare triple {30499#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {30499#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:43:41,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {31166#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {30499#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:43:41,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {30469#true} ~cond := #in~cond; {31166#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-28 12:43:41,156 INFO L272 TraceCheckUtils]: 6: Hoare triple {30469#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {30469#true} is VALID [2022-04-28 12:43:41,156 INFO L290 TraceCheckUtils]: 5: Hoare triple {30469#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {30469#true} is VALID [2022-04-28 12:43:41,157 INFO L272 TraceCheckUtils]: 4: Hoare triple {30469#true} call #t~ret6 := main(); {30469#true} is VALID [2022-04-28 12:43:41,157 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30469#true} {30469#true} #112#return; {30469#true} is VALID [2022-04-28 12:43:41,157 INFO L290 TraceCheckUtils]: 2: Hoare triple {30469#true} assume true; {30469#true} is VALID [2022-04-28 12:43:41,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {30469#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(11, 2);call #Ultimate.allocInit(12, 3); {30469#true} is VALID [2022-04-28 12:43:41,157 INFO L272 TraceCheckUtils]: 0: Hoare triple {30469#true} call ULTIMATE.init(); {30469#true} is VALID [2022-04-28 12:43:41,157 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 29 proven. 42 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2022-04-28 12:43:41,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:43:41,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860940214] [2022-04-28 12:43:41,157 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:43:41,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200211118] [2022-04-28 12:43:41,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200211118] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:43:41,157 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:43:41,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 26 [2022-04-28 12:43:41,158 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:43:41,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [276846843] [2022-04-28 12:43:41,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [276846843] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:43:41,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:43:41,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 12:43:41,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100342277] [2022-04-28 12:43:41,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:43:41,158 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 116 [2022-04-28 12:43:41,158 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:43:41,159 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 12:43:41,224 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:43:41,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 12:43:41,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:43:41,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 12:43:41,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=565, Unknown=0, NotChecked=0, Total=650 [2022-04-28 12:43:41,225 INFO L87 Difference]: Start difference. First operand 259 states and 347 transitions. Second operand has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 12:43:44,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:43:44,120 INFO L93 Difference]: Finished difference Result 376 states and 511 transitions. [2022-04-28 12:43:44,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 12:43:44,121 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 116 [2022-04-28 12:43:44,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:43:44,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 12:43:44,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 132 transitions. [2022-04-28 12:43:44,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 12:43:44,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 132 transitions. [2022-04-28 12:43:44,123 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 132 transitions. [2022-04-28 12:43:44,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:43:44,252 INFO L225 Difference]: With dead ends: 376 [2022-04-28 12:43:44,253 INFO L226 Difference]: Without dead ends: 259 [2022-04-28 12:43:44,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 206 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=200, Invalid=1132, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 12:43:44,254 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 52 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 12:43:44,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 346 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 12:43:44,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-04-28 12:43:45,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2022-04-28 12:43:45,551 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:43:45,552 INFO L82 GeneralOperation]: Start isEquivalent. First operand 259 states. Second operand has 259 states, 152 states have (on average 1.144736842105263) internal successors, (174), 153 states have internal predecessors, (174), 87 states have call successors, (87), 20 states have call predecessors, (87), 19 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-04-28 12:43:45,560 INFO L74 IsIncluded]: Start isIncluded. First operand 259 states. Second operand has 259 states, 152 states have (on average 1.144736842105263) internal successors, (174), 153 states have internal predecessors, (174), 87 states have call successors, (87), 20 states have call predecessors, (87), 19 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-04-28 12:43:45,561 INFO L87 Difference]: Start difference. First operand 259 states. Second operand has 259 states, 152 states have (on average 1.144736842105263) internal successors, (174), 153 states have internal predecessors, (174), 87 states have call successors, (87), 20 states have call predecessors, (87), 19 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-04-28 12:43:45,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:43:45,565 INFO L93 Difference]: Finished difference Result 259 states and 346 transitions. [2022-04-28 12:43:45,565 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 346 transitions. [2022-04-28 12:43:45,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:43:45,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:43:45,566 INFO L74 IsIncluded]: Start isIncluded. First operand has 259 states, 152 states have (on average 1.144736842105263) internal successors, (174), 153 states have internal predecessors, (174), 87 states have call successors, (87), 20 states have call predecessors, (87), 19 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) Second operand 259 states. [2022-04-28 12:43:45,566 INFO L87 Difference]: Start difference. First operand has 259 states, 152 states have (on average 1.144736842105263) internal successors, (174), 153 states have internal predecessors, (174), 87 states have call successors, (87), 20 states have call predecessors, (87), 19 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) Second operand 259 states. [2022-04-28 12:43:45,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:43:45,570 INFO L93 Difference]: Finished difference Result 259 states and 346 transitions. [2022-04-28 12:43:45,570 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 346 transitions. [2022-04-28 12:43:45,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:43:45,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:43:45,570 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:43:45,570 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:43:45,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 152 states have (on average 1.144736842105263) internal successors, (174), 153 states have internal predecessors, (174), 87 states have call successors, (87), 20 states have call predecessors, (87), 19 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-04-28 12:43:45,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 346 transitions. [2022-04-28 12:43:45,575 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 346 transitions. Word has length 116 [2022-04-28 12:43:45,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:43:45,576 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 346 transitions. [2022-04-28 12:43:45,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 12:43:45,576 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 259 states and 346 transitions. [2022-04-28 12:43:46,476 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 346 edges. 346 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:43:46,476 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 346 transitions. [2022-04-28 12:43:46,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-28 12:43:46,477 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:43:46,477 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:43:46,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-28 12:43:46,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:43:46,677 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:43:46,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:43:46,678 INFO L85 PathProgramCache]: Analyzing trace with hash 2089528091, now seen corresponding path program 1 times [2022-04-28 12:43:46,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:43:46,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2068165956] [2022-04-28 12:43:46,678 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:43:46,678 INFO L85 PathProgramCache]: Analyzing trace with hash 2089528091, now seen corresponding path program 2 times [2022-04-28 12:43:46,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:43:46,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925682818] [2022-04-28 12:43:46,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:43:46,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:43:46,693 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:43:46,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [521057788] [2022-04-28 12:43:46,693 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:43:46,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:43:46,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:43:46,704 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:43:46,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-28 12:43:46,757 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:43:46,758 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:43:46,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 12:43:46,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:43:46,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:43:47,542 INFO L272 TraceCheckUtils]: 0: Hoare triple {33000#true} call ULTIMATE.init(); {33000#true} is VALID [2022-04-28 12:43:47,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {33000#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(11, 2);call #Ultimate.allocInit(12, 3); {33000#true} is VALID [2022-04-28 12:43:47,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {33000#true} assume true; {33000#true} is VALID [2022-04-28 12:43:47,542 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33000#true} {33000#true} #112#return; {33000#true} is VALID [2022-04-28 12:43:47,542 INFO L272 TraceCheckUtils]: 4: Hoare triple {33000#true} call #t~ret6 := main(); {33000#true} is VALID [2022-04-28 12:43:47,542 INFO L290 TraceCheckUtils]: 5: Hoare triple {33000#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {33000#true} is VALID [2022-04-28 12:43:47,543 INFO L272 TraceCheckUtils]: 6: Hoare triple {33000#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {33000#true} is VALID [2022-04-28 12:43:47,543 INFO L290 TraceCheckUtils]: 7: Hoare triple {33000#true} ~cond := #in~cond; {33000#true} is VALID [2022-04-28 12:43:47,543 INFO L290 TraceCheckUtils]: 8: Hoare triple {33000#true} assume !(0 == ~cond); {33000#true} is VALID [2022-04-28 12:43:47,543 INFO L290 TraceCheckUtils]: 9: Hoare triple {33000#true} assume true; {33000#true} is VALID [2022-04-28 12:43:47,543 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33000#true} {33000#true} #94#return; {33000#true} is VALID [2022-04-28 12:43:47,543 INFO L290 TraceCheckUtils]: 11: Hoare triple {33000#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {33000#true} is VALID [2022-04-28 12:43:47,543 INFO L272 TraceCheckUtils]: 12: Hoare triple {33000#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {33000#true} is VALID [2022-04-28 12:43:47,543 INFO L290 TraceCheckUtils]: 13: Hoare triple {33000#true} ~cond := #in~cond; {33044#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 12:43:47,543 INFO L290 TraceCheckUtils]: 14: Hoare triple {33044#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {33048#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:43:47,544 INFO L290 TraceCheckUtils]: 15: Hoare triple {33048#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {33048#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:43:47,544 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {33048#(not (= |assume_abort_if_not_#in~cond| 0))} {33000#true} #96#return; {33055#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 12:43:47,544 INFO L272 TraceCheckUtils]: 17: Hoare triple {33055#(and (<= 0 main_~y~0) (<= main_~y~0 2))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {33000#true} is VALID [2022-04-28 12:43:47,544 INFO L290 TraceCheckUtils]: 18: Hoare triple {33000#true} ~cond := #in~cond; {33000#true} is VALID [2022-04-28 12:43:47,544 INFO L290 TraceCheckUtils]: 19: Hoare triple {33000#true} assume !(0 == ~cond); {33000#true} is VALID [2022-04-28 12:43:47,544 INFO L290 TraceCheckUtils]: 20: Hoare triple {33000#true} assume true; {33000#true} is VALID [2022-04-28 12:43:47,545 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {33000#true} {33055#(and (<= 0 main_~y~0) (<= main_~y~0 2))} #98#return; {33055#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 12:43:47,545 INFO L272 TraceCheckUtils]: 22: Hoare triple {33055#(and (<= 0 main_~y~0) (<= main_~y~0 2))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {33000#true} is VALID [2022-04-28 12:43:47,545 INFO L290 TraceCheckUtils]: 23: Hoare triple {33000#true} ~cond := #in~cond; {33000#true} is VALID [2022-04-28 12:43:47,545 INFO L290 TraceCheckUtils]: 24: Hoare triple {33000#true} assume !(0 == ~cond); {33000#true} is VALID [2022-04-28 12:43:47,545 INFO L290 TraceCheckUtils]: 25: Hoare triple {33000#true} assume true; {33000#true} is VALID [2022-04-28 12:43:47,545 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {33000#true} {33055#(and (<= 0 main_~y~0) (<= main_~y~0 2))} #100#return; {33055#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 12:43:47,545 INFO L290 TraceCheckUtils]: 27: Hoare triple {33055#(and (<= 0 main_~y~0) (<= main_~y~0 2))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {33089#(<= main_~b~0 2)} is VALID [2022-04-28 12:43:47,546 INFO L290 TraceCheckUtils]: 28: Hoare triple {33089#(<= main_~b~0 2)} assume !false; {33089#(<= main_~b~0 2)} is VALID [2022-04-28 12:43:47,546 INFO L290 TraceCheckUtils]: 29: Hoare triple {33089#(<= main_~b~0 2)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {33089#(<= main_~b~0 2)} is VALID [2022-04-28 12:43:47,546 INFO L290 TraceCheckUtils]: 30: Hoare triple {33089#(<= main_~b~0 2)} assume !false; {33089#(<= main_~b~0 2)} is VALID [2022-04-28 12:43:47,546 INFO L290 TraceCheckUtils]: 31: Hoare triple {33089#(<= main_~b~0 2)} assume !(~c~0 >= ~b~0); {33089#(<= main_~b~0 2)} is VALID [2022-04-28 12:43:47,547 INFO L290 TraceCheckUtils]: 32: Hoare triple {33089#(<= main_~b~0 2)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {33105#(<= main_~a~0 2)} is VALID [2022-04-28 12:43:47,547 INFO L290 TraceCheckUtils]: 33: Hoare triple {33105#(<= main_~a~0 2)} assume !false; {33105#(<= main_~a~0 2)} is VALID [2022-04-28 12:43:47,547 INFO L290 TraceCheckUtils]: 34: Hoare triple {33105#(<= main_~a~0 2)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {33112#(<= main_~c~0 2)} is VALID [2022-04-28 12:43:47,551 INFO L290 TraceCheckUtils]: 35: Hoare triple {33112#(<= main_~c~0 2)} assume !false; {33112#(<= main_~c~0 2)} is VALID [2022-04-28 12:43:47,552 INFO L290 TraceCheckUtils]: 36: Hoare triple {33112#(<= main_~c~0 2)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {33119#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} is VALID [2022-04-28 12:43:47,552 INFO L290 TraceCheckUtils]: 37: Hoare triple {33119#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} assume !false; {33119#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} is VALID [2022-04-28 12:43:47,552 INFO L272 TraceCheckUtils]: 38: Hoare triple {33119#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {33000#true} is VALID [2022-04-28 12:43:47,552 INFO L290 TraceCheckUtils]: 39: Hoare triple {33000#true} ~cond := #in~cond; {33000#true} is VALID [2022-04-28 12:43:47,552 INFO L290 TraceCheckUtils]: 40: Hoare triple {33000#true} assume !(0 == ~cond); {33000#true} is VALID [2022-04-28 12:43:47,552 INFO L290 TraceCheckUtils]: 41: Hoare triple {33000#true} assume true; {33000#true} is VALID [2022-04-28 12:43:47,553 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {33000#true} {33119#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} #102#return; {33119#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} is VALID [2022-04-28 12:43:47,553 INFO L272 TraceCheckUtils]: 43: Hoare triple {33119#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {33000#true} is VALID [2022-04-28 12:43:47,553 INFO L290 TraceCheckUtils]: 44: Hoare triple {33000#true} ~cond := #in~cond; {33000#true} is VALID [2022-04-28 12:43:47,554 INFO L290 TraceCheckUtils]: 45: Hoare triple {33000#true} assume !(0 == ~cond); {33000#true} is VALID [2022-04-28 12:43:47,554 INFO L290 TraceCheckUtils]: 46: Hoare triple {33000#true} assume true; {33000#true} is VALID [2022-04-28 12:43:47,555 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {33000#true} {33119#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} #104#return; {33119#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} is VALID [2022-04-28 12:43:47,555 INFO L272 TraceCheckUtils]: 48: Hoare triple {33119#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {33000#true} is VALID [2022-04-28 12:43:47,555 INFO L290 TraceCheckUtils]: 49: Hoare triple {33000#true} ~cond := #in~cond; {33000#true} is VALID [2022-04-28 12:43:47,555 INFO L290 TraceCheckUtils]: 50: Hoare triple {33000#true} assume !(0 == ~cond); {33000#true} is VALID [2022-04-28 12:43:47,555 INFO L290 TraceCheckUtils]: 51: Hoare triple {33000#true} assume true; {33000#true} is VALID [2022-04-28 12:43:47,555 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {33000#true} {33119#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} #106#return; {33119#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} is VALID [2022-04-28 12:43:47,556 INFO L272 TraceCheckUtils]: 53: Hoare triple {33119#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {33000#true} is VALID [2022-04-28 12:43:47,556 INFO L290 TraceCheckUtils]: 54: Hoare triple {33000#true} ~cond := #in~cond; {33000#true} is VALID [2022-04-28 12:43:47,556 INFO L290 TraceCheckUtils]: 55: Hoare triple {33000#true} assume !(0 == ~cond); {33000#true} is VALID [2022-04-28 12:43:47,556 INFO L290 TraceCheckUtils]: 56: Hoare triple {33000#true} assume true; {33000#true} is VALID [2022-04-28 12:43:47,556 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {33000#true} {33119#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} #108#return; {33119#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} is VALID [2022-04-28 12:43:47,557 INFO L290 TraceCheckUtils]: 58: Hoare triple {33119#(and (<= main_~v~0 main_~b~0) (<= main_~c~0 2))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {33186#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-28 12:43:47,557 INFO L290 TraceCheckUtils]: 59: Hoare triple {33186#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} assume !false; {33186#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-28 12:43:47,557 INFO L272 TraceCheckUtils]: 60: Hoare triple {33186#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {33000#true} is VALID [2022-04-28 12:43:47,557 INFO L290 TraceCheckUtils]: 61: Hoare triple {33000#true} ~cond := #in~cond; {33000#true} is VALID [2022-04-28 12:43:47,557 INFO L290 TraceCheckUtils]: 62: Hoare triple {33000#true} assume !(0 == ~cond); {33000#true} is VALID [2022-04-28 12:43:47,557 INFO L290 TraceCheckUtils]: 63: Hoare triple {33000#true} assume true; {33000#true} is VALID [2022-04-28 12:43:47,558 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {33000#true} {33186#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} #102#return; {33186#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-28 12:43:47,558 INFO L272 TraceCheckUtils]: 65: Hoare triple {33186#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {33000#true} is VALID [2022-04-28 12:43:47,558 INFO L290 TraceCheckUtils]: 66: Hoare triple {33000#true} ~cond := #in~cond; {33000#true} is VALID [2022-04-28 12:43:47,558 INFO L290 TraceCheckUtils]: 67: Hoare triple {33000#true} assume !(0 == ~cond); {33000#true} is VALID [2022-04-28 12:43:47,558 INFO L290 TraceCheckUtils]: 68: Hoare triple {33000#true} assume true; {33000#true} is VALID [2022-04-28 12:43:47,559 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {33000#true} {33186#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} #104#return; {33186#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-28 12:43:47,559 INFO L272 TraceCheckUtils]: 70: Hoare triple {33186#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {33000#true} is VALID [2022-04-28 12:43:47,559 INFO L290 TraceCheckUtils]: 71: Hoare triple {33000#true} ~cond := #in~cond; {33000#true} is VALID [2022-04-28 12:43:47,559 INFO L290 TraceCheckUtils]: 72: Hoare triple {33000#true} assume !(0 == ~cond); {33000#true} is VALID [2022-04-28 12:43:47,559 INFO L290 TraceCheckUtils]: 73: Hoare triple {33000#true} assume true; {33000#true} is VALID [2022-04-28 12:43:47,559 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {33000#true} {33186#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} #106#return; {33186#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-28 12:43:47,559 INFO L272 TraceCheckUtils]: 75: Hoare triple {33186#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {33000#true} is VALID [2022-04-28 12:43:47,559 INFO L290 TraceCheckUtils]: 76: Hoare triple {33000#true} ~cond := #in~cond; {33000#true} is VALID [2022-04-28 12:43:47,559 INFO L290 TraceCheckUtils]: 77: Hoare triple {33000#true} assume !(0 == ~cond); {33000#true} is VALID [2022-04-28 12:43:47,560 INFO L290 TraceCheckUtils]: 78: Hoare triple {33000#true} assume true; {33000#true} is VALID [2022-04-28 12:43:47,560 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {33000#true} {33186#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} #108#return; {33186#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-28 12:43:47,560 INFO L290 TraceCheckUtils]: 80: Hoare triple {33186#(and (<= main_~c~0 2) (<= (div (- main_~v~0) (- 2)) main_~b~0))} assume !(~c~0 >= 2 * ~v~0); {33253#(and (<= main_~c~0 2) (not (<= (* main_~v~0 2) main_~c~0)) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-28 12:43:47,561 INFO L290 TraceCheckUtils]: 81: Hoare triple {33253#(and (<= main_~c~0 2) (not (<= (* main_~v~0 2) main_~c~0)) (<= (div (- main_~v~0) (- 2)) main_~b~0))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {33257#(and (< (* main_~c~0 2) 2) (< (div (+ (- 1) (* (- 1) main_~c~0)) (- 2)) (+ main_~b~0 1)))} is VALID [2022-04-28 12:43:47,562 INFO L290 TraceCheckUtils]: 82: Hoare triple {33257#(and (< (* main_~c~0 2) 2) (< (div (+ (- 1) (* (- 1) main_~c~0)) (- 2)) (+ main_~b~0 1)))} assume !false; {33257#(and (< (* main_~c~0 2) 2) (< (div (+ (- 1) (* (- 1) main_~c~0)) (- 2)) (+ main_~b~0 1)))} is VALID [2022-04-28 12:43:47,563 INFO L290 TraceCheckUtils]: 83: Hoare triple {33257#(and (< (* main_~c~0 2) 2) (< (div (+ (- 1) (* (- 1) main_~c~0)) (- 2)) (+ main_~b~0 1)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {33001#false} is VALID [2022-04-28 12:43:47,563 INFO L290 TraceCheckUtils]: 84: Hoare triple {33001#false} assume !false; {33001#false} is VALID [2022-04-28 12:43:47,563 INFO L272 TraceCheckUtils]: 85: Hoare triple {33001#false} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {33001#false} is VALID [2022-04-28 12:43:47,563 INFO L290 TraceCheckUtils]: 86: Hoare triple {33001#false} ~cond := #in~cond; {33001#false} is VALID [2022-04-28 12:43:47,563 INFO L290 TraceCheckUtils]: 87: Hoare triple {33001#false} assume !(0 == ~cond); {33001#false} is VALID [2022-04-28 12:43:47,563 INFO L290 TraceCheckUtils]: 88: Hoare triple {33001#false} assume true; {33001#false} is VALID [2022-04-28 12:43:47,563 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {33001#false} {33001#false} #102#return; {33001#false} is VALID [2022-04-28 12:43:47,563 INFO L272 TraceCheckUtils]: 90: Hoare triple {33001#false} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {33001#false} is VALID [2022-04-28 12:43:47,563 INFO L290 TraceCheckUtils]: 91: Hoare triple {33001#false} ~cond := #in~cond; {33001#false} is VALID [2022-04-28 12:43:47,564 INFO L290 TraceCheckUtils]: 92: Hoare triple {33001#false} assume !(0 == ~cond); {33001#false} is VALID [2022-04-28 12:43:47,564 INFO L290 TraceCheckUtils]: 93: Hoare triple {33001#false} assume true; {33001#false} is VALID [2022-04-28 12:43:47,564 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {33001#false} {33001#false} #104#return; {33001#false} is VALID [2022-04-28 12:43:47,564 INFO L272 TraceCheckUtils]: 95: Hoare triple {33001#false} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {33001#false} is VALID [2022-04-28 12:43:47,564 INFO L290 TraceCheckUtils]: 96: Hoare triple {33001#false} ~cond := #in~cond; {33001#false} is VALID [2022-04-28 12:43:47,564 INFO L290 TraceCheckUtils]: 97: Hoare triple {33001#false} assume !(0 == ~cond); {33001#false} is VALID [2022-04-28 12:43:47,564 INFO L290 TraceCheckUtils]: 98: Hoare triple {33001#false} assume true; {33001#false} is VALID [2022-04-28 12:43:47,564 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {33001#false} {33001#false} #106#return; {33001#false} is VALID [2022-04-28 12:43:47,564 INFO L272 TraceCheckUtils]: 100: Hoare triple {33001#false} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {33001#false} is VALID [2022-04-28 12:43:47,564 INFO L290 TraceCheckUtils]: 101: Hoare triple {33001#false} ~cond := #in~cond; {33001#false} is VALID [2022-04-28 12:43:47,564 INFO L290 TraceCheckUtils]: 102: Hoare triple {33001#false} assume !(0 == ~cond); {33001#false} is VALID [2022-04-28 12:43:47,564 INFO L290 TraceCheckUtils]: 103: Hoare triple {33001#false} assume true; {33001#false} is VALID [2022-04-28 12:43:47,564 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {33001#false} {33001#false} #108#return; {33001#false} is VALID [2022-04-28 12:43:47,564 INFO L290 TraceCheckUtils]: 105: Hoare triple {33001#false} assume !(~c~0 >= 2 * ~v~0); {33001#false} is VALID [2022-04-28 12:43:47,564 INFO L290 TraceCheckUtils]: 106: Hoare triple {33001#false} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {33001#false} is VALID [2022-04-28 12:43:47,564 INFO L290 TraceCheckUtils]: 107: Hoare triple {33001#false} assume !false; {33001#false} is VALID [2022-04-28 12:43:47,564 INFO L290 TraceCheckUtils]: 108: Hoare triple {33001#false} assume !(~c~0 >= ~b~0); {33001#false} is VALID [2022-04-28 12:43:47,564 INFO L290 TraceCheckUtils]: 109: Hoare triple {33001#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {33001#false} is VALID [2022-04-28 12:43:47,564 INFO L290 TraceCheckUtils]: 110: Hoare triple {33001#false} assume !false; {33001#false} is VALID [2022-04-28 12:43:47,564 INFO L290 TraceCheckUtils]: 111: Hoare triple {33001#false} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {33001#false} is VALID [2022-04-28 12:43:47,564 INFO L290 TraceCheckUtils]: 112: Hoare triple {33001#false} assume !false; {33001#false} is VALID [2022-04-28 12:43:47,565 INFO L290 TraceCheckUtils]: 113: Hoare triple {33001#false} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {33001#false} is VALID [2022-04-28 12:43:47,565 INFO L290 TraceCheckUtils]: 114: Hoare triple {33001#false} assume !false; {33001#false} is VALID [2022-04-28 12:43:47,565 INFO L272 TraceCheckUtils]: 115: Hoare triple {33001#false} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {33001#false} is VALID [2022-04-28 12:43:47,565 INFO L290 TraceCheckUtils]: 116: Hoare triple {33001#false} ~cond := #in~cond; {33001#false} is VALID [2022-04-28 12:43:47,565 INFO L290 TraceCheckUtils]: 117: Hoare triple {33001#false} assume 0 == ~cond; {33001#false} is VALID [2022-04-28 12:43:47,565 INFO L290 TraceCheckUtils]: 118: Hoare triple {33001#false} assume !false; {33001#false} is VALID [2022-04-28 12:43:47,565 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 183 proven. 18 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2022-04-28 12:43:47,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:43:48,233 INFO L290 TraceCheckUtils]: 118: Hoare triple {33001#false} assume !false; {33001#false} is VALID [2022-04-28 12:43:48,233 INFO L290 TraceCheckUtils]: 117: Hoare triple {33001#false} assume 0 == ~cond; {33001#false} is VALID [2022-04-28 12:43:48,233 INFO L290 TraceCheckUtils]: 116: Hoare triple {33001#false} ~cond := #in~cond; {33001#false} is VALID [2022-04-28 12:43:48,233 INFO L272 TraceCheckUtils]: 115: Hoare triple {33001#false} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {33001#false} is VALID [2022-04-28 12:43:48,233 INFO L290 TraceCheckUtils]: 114: Hoare triple {33001#false} assume !false; {33001#false} is VALID [2022-04-28 12:43:48,233 INFO L290 TraceCheckUtils]: 113: Hoare triple {33001#false} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {33001#false} is VALID [2022-04-28 12:43:48,233 INFO L290 TraceCheckUtils]: 112: Hoare triple {33001#false} assume !false; {33001#false} is VALID [2022-04-28 12:43:48,233 INFO L290 TraceCheckUtils]: 111: Hoare triple {33001#false} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {33001#false} is VALID [2022-04-28 12:43:48,233 INFO L290 TraceCheckUtils]: 110: Hoare triple {33001#false} assume !false; {33001#false} is VALID [2022-04-28 12:43:48,234 INFO L290 TraceCheckUtils]: 109: Hoare triple {33001#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {33001#false} is VALID [2022-04-28 12:43:48,234 INFO L290 TraceCheckUtils]: 108: Hoare triple {33001#false} assume !(~c~0 >= ~b~0); {33001#false} is VALID [2022-04-28 12:43:48,234 INFO L290 TraceCheckUtils]: 107: Hoare triple {33001#false} assume !false; {33001#false} is VALID [2022-04-28 12:43:48,234 INFO L290 TraceCheckUtils]: 106: Hoare triple {33001#false} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {33001#false} is VALID [2022-04-28 12:43:48,234 INFO L290 TraceCheckUtils]: 105: Hoare triple {33001#false} assume !(~c~0 >= 2 * ~v~0); {33001#false} is VALID [2022-04-28 12:43:48,234 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {33000#true} {33001#false} #108#return; {33001#false} is VALID [2022-04-28 12:43:48,234 INFO L290 TraceCheckUtils]: 103: Hoare triple {33000#true} assume true; {33000#true} is VALID [2022-04-28 12:43:48,234 INFO L290 TraceCheckUtils]: 102: Hoare triple {33000#true} assume !(0 == ~cond); {33000#true} is VALID [2022-04-28 12:43:48,234 INFO L290 TraceCheckUtils]: 101: Hoare triple {33000#true} ~cond := #in~cond; {33000#true} is VALID [2022-04-28 12:43:48,234 INFO L272 TraceCheckUtils]: 100: Hoare triple {33001#false} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {33000#true} is VALID [2022-04-28 12:43:48,234 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {33000#true} {33001#false} #106#return; {33001#false} is VALID [2022-04-28 12:43:48,234 INFO L290 TraceCheckUtils]: 98: Hoare triple {33000#true} assume true; {33000#true} is VALID [2022-04-28 12:43:48,234 INFO L290 TraceCheckUtils]: 97: Hoare triple {33000#true} assume !(0 == ~cond); {33000#true} is VALID [2022-04-28 12:43:48,234 INFO L290 TraceCheckUtils]: 96: Hoare triple {33000#true} ~cond := #in~cond; {33000#true} is VALID [2022-04-28 12:43:48,234 INFO L272 TraceCheckUtils]: 95: Hoare triple {33001#false} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {33000#true} is VALID [2022-04-28 12:43:48,234 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {33000#true} {33001#false} #104#return; {33001#false} is VALID [2022-04-28 12:43:48,234 INFO L290 TraceCheckUtils]: 93: Hoare triple {33000#true} assume true; {33000#true} is VALID [2022-04-28 12:43:48,234 INFO L290 TraceCheckUtils]: 92: Hoare triple {33000#true} assume !(0 == ~cond); {33000#true} is VALID [2022-04-28 12:43:48,234 INFO L290 TraceCheckUtils]: 91: Hoare triple {33000#true} ~cond := #in~cond; {33000#true} is VALID [2022-04-28 12:43:48,235 INFO L272 TraceCheckUtils]: 90: Hoare triple {33001#false} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {33000#true} is VALID [2022-04-28 12:43:48,235 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {33000#true} {33001#false} #102#return; {33001#false} is VALID [2022-04-28 12:43:48,235 INFO L290 TraceCheckUtils]: 88: Hoare triple {33000#true} assume true; {33000#true} is VALID [2022-04-28 12:43:48,235 INFO L290 TraceCheckUtils]: 87: Hoare triple {33000#true} assume !(0 == ~cond); {33000#true} is VALID [2022-04-28 12:43:48,235 INFO L290 TraceCheckUtils]: 86: Hoare triple {33000#true} ~cond := #in~cond; {33000#true} is VALID [2022-04-28 12:43:48,235 INFO L272 TraceCheckUtils]: 85: Hoare triple {33001#false} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {33000#true} is VALID [2022-04-28 12:43:48,235 INFO L290 TraceCheckUtils]: 84: Hoare triple {33001#false} assume !false; {33001#false} is VALID [2022-04-28 12:43:48,255 INFO L290 TraceCheckUtils]: 83: Hoare triple {33474#(not (<= main_~b~0 main_~c~0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {33001#false} is VALID [2022-04-28 12:43:48,256 INFO L290 TraceCheckUtils]: 82: Hoare triple {33474#(not (<= main_~b~0 main_~c~0))} assume !false; {33474#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-28 12:43:48,257 INFO L290 TraceCheckUtils]: 81: Hoare triple {33481#(< main_~c~0 (+ main_~b~0 main_~v~0))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {33474#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-28 12:43:48,257 INFO L290 TraceCheckUtils]: 80: Hoare triple {33485#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} assume !(~c~0 >= 2 * ~v~0); {33481#(< main_~c~0 (+ main_~b~0 main_~v~0))} is VALID [2022-04-28 12:43:48,257 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {33000#true} {33485#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} #108#return; {33485#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} is VALID [2022-04-28 12:43:48,257 INFO L290 TraceCheckUtils]: 78: Hoare triple {33000#true} assume true; {33000#true} is VALID [2022-04-28 12:43:48,258 INFO L290 TraceCheckUtils]: 77: Hoare triple {33000#true} assume !(0 == ~cond); {33000#true} is VALID [2022-04-28 12:43:48,258 INFO L290 TraceCheckUtils]: 76: Hoare triple {33000#true} ~cond := #in~cond; {33000#true} is VALID [2022-04-28 12:43:48,258 INFO L272 TraceCheckUtils]: 75: Hoare triple {33485#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {33000#true} is VALID [2022-04-28 12:43:48,258 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {33000#true} {33485#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} #106#return; {33485#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} is VALID [2022-04-28 12:43:48,258 INFO L290 TraceCheckUtils]: 73: Hoare triple {33000#true} assume true; {33000#true} is VALID [2022-04-28 12:43:48,258 INFO L290 TraceCheckUtils]: 72: Hoare triple {33000#true} assume !(0 == ~cond); {33000#true} is VALID [2022-04-28 12:43:48,258 INFO L290 TraceCheckUtils]: 71: Hoare triple {33000#true} ~cond := #in~cond; {33000#true} is VALID [2022-04-28 12:43:48,258 INFO L272 TraceCheckUtils]: 70: Hoare triple {33485#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {33000#true} is VALID [2022-04-28 12:43:48,259 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {33000#true} {33485#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} #104#return; {33485#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} is VALID [2022-04-28 12:43:48,259 INFO L290 TraceCheckUtils]: 68: Hoare triple {33000#true} assume true; {33000#true} is VALID [2022-04-28 12:43:48,259 INFO L290 TraceCheckUtils]: 67: Hoare triple {33000#true} assume !(0 == ~cond); {33000#true} is VALID [2022-04-28 12:43:48,259 INFO L290 TraceCheckUtils]: 66: Hoare triple {33000#true} ~cond := #in~cond; {33000#true} is VALID [2022-04-28 12:43:48,259 INFO L272 TraceCheckUtils]: 65: Hoare triple {33485#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {33000#true} is VALID [2022-04-28 12:43:48,260 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {33000#true} {33485#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} #102#return; {33485#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} is VALID [2022-04-28 12:43:48,260 INFO L290 TraceCheckUtils]: 63: Hoare triple {33000#true} assume true; {33000#true} is VALID [2022-04-28 12:43:48,260 INFO L290 TraceCheckUtils]: 62: Hoare triple {33000#true} assume !(0 == ~cond); {33000#true} is VALID [2022-04-28 12:43:48,260 INFO L290 TraceCheckUtils]: 61: Hoare triple {33000#true} ~cond := #in~cond; {33000#true} is VALID [2022-04-28 12:43:48,260 INFO L272 TraceCheckUtils]: 60: Hoare triple {33485#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {33000#true} is VALID [2022-04-28 12:43:48,260 INFO L290 TraceCheckUtils]: 59: Hoare triple {33485#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} assume !false; {33485#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} is VALID [2022-04-28 12:43:48,261 INFO L290 TraceCheckUtils]: 58: Hoare triple {33552#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {33485#(or (< main_~c~0 (+ main_~b~0 main_~v~0)) (<= (* main_~v~0 2) main_~c~0))} is VALID [2022-04-28 12:43:48,262 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {33000#true} {33552#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} #108#return; {33552#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} is VALID [2022-04-28 12:43:48,262 INFO L290 TraceCheckUtils]: 56: Hoare triple {33000#true} assume true; {33000#true} is VALID [2022-04-28 12:43:48,262 INFO L290 TraceCheckUtils]: 55: Hoare triple {33000#true} assume !(0 == ~cond); {33000#true} is VALID [2022-04-28 12:43:48,262 INFO L290 TraceCheckUtils]: 54: Hoare triple {33000#true} ~cond := #in~cond; {33000#true} is VALID [2022-04-28 12:43:48,262 INFO L272 TraceCheckUtils]: 53: Hoare triple {33552#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {33000#true} is VALID [2022-04-28 12:43:48,262 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {33000#true} {33552#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} #106#return; {33552#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} is VALID [2022-04-28 12:43:48,262 INFO L290 TraceCheckUtils]: 51: Hoare triple {33000#true} assume true; {33000#true} is VALID [2022-04-28 12:43:48,262 INFO L290 TraceCheckUtils]: 50: Hoare triple {33000#true} assume !(0 == ~cond); {33000#true} is VALID [2022-04-28 12:43:48,262 INFO L290 TraceCheckUtils]: 49: Hoare triple {33000#true} ~cond := #in~cond; {33000#true} is VALID [2022-04-28 12:43:48,263 INFO L272 TraceCheckUtils]: 48: Hoare triple {33552#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {33000#true} is VALID [2022-04-28 12:43:48,263 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {33000#true} {33552#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} #104#return; {33552#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} is VALID [2022-04-28 12:43:48,263 INFO L290 TraceCheckUtils]: 46: Hoare triple {33000#true} assume true; {33000#true} is VALID [2022-04-28 12:43:48,263 INFO L290 TraceCheckUtils]: 45: Hoare triple {33000#true} assume !(0 == ~cond); {33000#true} is VALID [2022-04-28 12:43:48,263 INFO L290 TraceCheckUtils]: 44: Hoare triple {33000#true} ~cond := #in~cond; {33000#true} is VALID [2022-04-28 12:43:48,263 INFO L272 TraceCheckUtils]: 43: Hoare triple {33552#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {33000#true} is VALID [2022-04-28 12:43:48,264 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {33000#true} {33552#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} #102#return; {33552#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} is VALID [2022-04-28 12:43:48,264 INFO L290 TraceCheckUtils]: 41: Hoare triple {33000#true} assume true; {33000#true} is VALID [2022-04-28 12:43:48,264 INFO L290 TraceCheckUtils]: 40: Hoare triple {33000#true} assume !(0 == ~cond); {33000#true} is VALID [2022-04-28 12:43:48,264 INFO L290 TraceCheckUtils]: 39: Hoare triple {33000#true} ~cond := #in~cond; {33000#true} is VALID [2022-04-28 12:43:48,264 INFO L272 TraceCheckUtils]: 38: Hoare triple {33552#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {33000#true} is VALID [2022-04-28 12:43:48,264 INFO L290 TraceCheckUtils]: 37: Hoare triple {33552#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} assume !false; {33552#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} is VALID [2022-04-28 12:43:48,265 INFO L290 TraceCheckUtils]: 36: Hoare triple {33619#(<= main_~c~0 (+ (div main_~c~0 2) (div (div main_~c~0 2) 2) 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {33552#(or (<= (* main_~v~0 2) (div main_~c~0 2)) (<= main_~c~0 (+ main_~b~0 (div main_~c~0 2))))} is VALID [2022-04-28 12:43:48,265 INFO L290 TraceCheckUtils]: 35: Hoare triple {33619#(<= main_~c~0 (+ (div main_~c~0 2) (div (div main_~c~0 2) 2) 1))} assume !false; {33619#(<= main_~c~0 (+ (div main_~c~0 2) (div (div main_~c~0 2) 2) 1))} is VALID [2022-04-28 12:43:48,266 INFO L290 TraceCheckUtils]: 34: Hoare triple {33105#(<= main_~a~0 2)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {33619#(<= main_~c~0 (+ (div main_~c~0 2) (div (div main_~c~0 2) 2) 1))} is VALID [2022-04-28 12:43:48,266 INFO L290 TraceCheckUtils]: 33: Hoare triple {33105#(<= main_~a~0 2)} assume !false; {33105#(<= main_~a~0 2)} is VALID [2022-04-28 12:43:48,266 INFO L290 TraceCheckUtils]: 32: Hoare triple {33089#(<= main_~b~0 2)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {33105#(<= main_~a~0 2)} is VALID [2022-04-28 12:43:48,267 INFO L290 TraceCheckUtils]: 31: Hoare triple {33089#(<= main_~b~0 2)} assume !(~c~0 >= ~b~0); {33089#(<= main_~b~0 2)} is VALID [2022-04-28 12:43:48,267 INFO L290 TraceCheckUtils]: 30: Hoare triple {33089#(<= main_~b~0 2)} assume !false; {33089#(<= main_~b~0 2)} is VALID [2022-04-28 12:43:48,267 INFO L290 TraceCheckUtils]: 29: Hoare triple {33089#(<= main_~b~0 2)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {33089#(<= main_~b~0 2)} is VALID [2022-04-28 12:43:48,267 INFO L290 TraceCheckUtils]: 28: Hoare triple {33089#(<= main_~b~0 2)} assume !false; {33089#(<= main_~b~0 2)} is VALID [2022-04-28 12:43:48,268 INFO L290 TraceCheckUtils]: 27: Hoare triple {33647#(<= main_~y~0 2)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {33089#(<= main_~b~0 2)} is VALID [2022-04-28 12:43:48,268 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {33000#true} {33647#(<= main_~y~0 2)} #100#return; {33647#(<= main_~y~0 2)} is VALID [2022-04-28 12:43:48,268 INFO L290 TraceCheckUtils]: 25: Hoare triple {33000#true} assume true; {33000#true} is VALID [2022-04-28 12:43:48,268 INFO L290 TraceCheckUtils]: 24: Hoare triple {33000#true} assume !(0 == ~cond); {33000#true} is VALID [2022-04-28 12:43:48,268 INFO L290 TraceCheckUtils]: 23: Hoare triple {33000#true} ~cond := #in~cond; {33000#true} is VALID [2022-04-28 12:43:48,268 INFO L272 TraceCheckUtils]: 22: Hoare triple {33647#(<= main_~y~0 2)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {33000#true} is VALID [2022-04-28 12:43:48,268 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {33000#true} {33647#(<= main_~y~0 2)} #98#return; {33647#(<= main_~y~0 2)} is VALID [2022-04-28 12:43:48,268 INFO L290 TraceCheckUtils]: 20: Hoare triple {33000#true} assume true; {33000#true} is VALID [2022-04-28 12:43:48,269 INFO L290 TraceCheckUtils]: 19: Hoare triple {33000#true} assume !(0 == ~cond); {33000#true} is VALID [2022-04-28 12:43:48,269 INFO L290 TraceCheckUtils]: 18: Hoare triple {33000#true} ~cond := #in~cond; {33000#true} is VALID [2022-04-28 12:43:48,269 INFO L272 TraceCheckUtils]: 17: Hoare triple {33647#(<= main_~y~0 2)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {33000#true} is VALID [2022-04-28 12:43:48,269 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {33048#(not (= |assume_abort_if_not_#in~cond| 0))} {33000#true} #96#return; {33647#(<= main_~y~0 2)} is VALID [2022-04-28 12:43:48,269 INFO L290 TraceCheckUtils]: 15: Hoare triple {33048#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {33048#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:43:48,269 INFO L290 TraceCheckUtils]: 14: Hoare triple {33690#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {33048#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:43:48,270 INFO L290 TraceCheckUtils]: 13: Hoare triple {33000#true} ~cond := #in~cond; {33690#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-28 12:43:48,270 INFO L272 TraceCheckUtils]: 12: Hoare triple {33000#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {33000#true} is VALID [2022-04-28 12:43:48,270 INFO L290 TraceCheckUtils]: 11: Hoare triple {33000#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {33000#true} is VALID [2022-04-28 12:43:48,270 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33000#true} {33000#true} #94#return; {33000#true} is VALID [2022-04-28 12:43:48,270 INFO L290 TraceCheckUtils]: 9: Hoare triple {33000#true} assume true; {33000#true} is VALID [2022-04-28 12:43:48,270 INFO L290 TraceCheckUtils]: 8: Hoare triple {33000#true} assume !(0 == ~cond); {33000#true} is VALID [2022-04-28 12:43:48,270 INFO L290 TraceCheckUtils]: 7: Hoare triple {33000#true} ~cond := #in~cond; {33000#true} is VALID [2022-04-28 12:43:48,270 INFO L272 TraceCheckUtils]: 6: Hoare triple {33000#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {33000#true} is VALID [2022-04-28 12:43:48,270 INFO L290 TraceCheckUtils]: 5: Hoare triple {33000#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {33000#true} is VALID [2022-04-28 12:43:48,270 INFO L272 TraceCheckUtils]: 4: Hoare triple {33000#true} call #t~ret6 := main(); {33000#true} is VALID [2022-04-28 12:43:48,270 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33000#true} {33000#true} #112#return; {33000#true} is VALID [2022-04-28 12:43:48,270 INFO L290 TraceCheckUtils]: 2: Hoare triple {33000#true} assume true; {33000#true} is VALID [2022-04-28 12:43:48,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {33000#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(11, 2);call #Ultimate.allocInit(12, 3); {33000#true} is VALID [2022-04-28 12:43:48,270 INFO L272 TraceCheckUtils]: 0: Hoare triple {33000#true} call ULTIMATE.init(); {33000#true} is VALID [2022-04-28 12:43:48,271 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 61 proven. 20 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2022-04-28 12:43:48,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:43:48,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925682818] [2022-04-28 12:43:48,271 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:43:48,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521057788] [2022-04-28 12:43:48,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521057788] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:43:48,271 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:43:48,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2022-04-28 12:43:48,271 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:43:48,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2068165956] [2022-04-28 12:43:48,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2068165956] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:43:48,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:43:48,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 12:43:48,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334760398] [2022-04-28 12:43:48,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:43:48,272 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 5 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 119 [2022-04-28 12:43:48,272 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:43:48,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 5 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 12:43:48,333 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:43:48,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 12:43:48,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:43:48,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 12:43:48,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2022-04-28 12:43:48,334 INFO L87 Difference]: Start difference. First operand 259 states and 346 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 5 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 12:43:50,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:43:50,023 INFO L93 Difference]: Finished difference Result 318 states and 413 transitions. [2022-04-28 12:43:50,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 12:43:50,024 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 5 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 119 [2022-04-28 12:43:50,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:43:50,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 5 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 12:43:50,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 97 transitions. [2022-04-28 12:43:50,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 5 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 12:43:50,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 97 transitions. [2022-04-28 12:43:50,025 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 97 transitions. [2022-04-28 12:43:50,112 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:43:50,114 INFO L225 Difference]: With dead ends: 318 [2022-04-28 12:43:50,114 INFO L226 Difference]: Without dead ends: 141 [2022-04-28 12:43:50,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 219 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=553, Unknown=0, NotChecked=0, Total=702 [2022-04-28 12:43:50,123 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 37 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 12:43:50,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 249 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 12:43:50,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-04-28 12:43:50,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2022-04-28 12:43:50,630 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:43:50,630 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand has 141 states, 87 states have (on average 1.0459770114942528) internal successors, (91), 88 states have internal predecessors, (91), 39 states have call successors, (39), 15 states have call predecessors, (39), 14 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 12:43:50,630 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand has 141 states, 87 states have (on average 1.0459770114942528) internal successors, (91), 88 states have internal predecessors, (91), 39 states have call successors, (39), 15 states have call predecessors, (39), 14 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 12:43:50,631 INFO L87 Difference]: Start difference. First operand 141 states. Second operand has 141 states, 87 states have (on average 1.0459770114942528) internal successors, (91), 88 states have internal predecessors, (91), 39 states have call successors, (39), 15 states have call predecessors, (39), 14 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 12:43:50,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:43:50,632 INFO L93 Difference]: Finished difference Result 141 states and 167 transitions. [2022-04-28 12:43:50,632 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 167 transitions. [2022-04-28 12:43:50,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:43:50,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:43:50,633 INFO L74 IsIncluded]: Start isIncluded. First operand has 141 states, 87 states have (on average 1.0459770114942528) internal successors, (91), 88 states have internal predecessors, (91), 39 states have call successors, (39), 15 states have call predecessors, (39), 14 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand 141 states. [2022-04-28 12:43:50,633 INFO L87 Difference]: Start difference. First operand has 141 states, 87 states have (on average 1.0459770114942528) internal successors, (91), 88 states have internal predecessors, (91), 39 states have call successors, (39), 15 states have call predecessors, (39), 14 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand 141 states. [2022-04-28 12:43:50,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:43:50,644 INFO L93 Difference]: Finished difference Result 141 states and 167 transitions. [2022-04-28 12:43:50,644 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 167 transitions. [2022-04-28 12:43:50,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:43:50,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:43:50,644 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:43:50,644 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:43:50,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 87 states have (on average 1.0459770114942528) internal successors, (91), 88 states have internal predecessors, (91), 39 states have call successors, (39), 15 states have call predecessors, (39), 14 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 12:43:50,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 167 transitions. [2022-04-28 12:43:50,646 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 167 transitions. Word has length 119 [2022-04-28 12:43:50,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:43:50,647 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 167 transitions. [2022-04-28 12:43:50,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 5 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 12:43:50,647 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 141 states and 167 transitions. [2022-04-28 12:43:51,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:43:51,007 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 167 transitions. [2022-04-28 12:43:51,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-04-28 12:43:51,007 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:43:51,008 INFO L195 NwaCegarLoop]: trace histogram [21, 20, 20, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:43:51,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-28 12:43:51,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-04-28 12:43:51,211 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:43:51,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:43:51,212 INFO L85 PathProgramCache]: Analyzing trace with hash 2097211745, now seen corresponding path program 15 times [2022-04-28 12:43:51,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:43:51,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2131844652] [2022-04-28 12:43:51,212 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:43:51,212 INFO L85 PathProgramCache]: Analyzing trace with hash 2097211745, now seen corresponding path program 16 times [2022-04-28 12:43:51,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:43:51,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536758283] [2022-04-28 12:43:51,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:43:51,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:43:51,224 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:43:51,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1298641360] [2022-04-28 12:43:51,225 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 12:43:51,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:43:51,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:43:51,226 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:43:51,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-28 12:43:51,290 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 12:43:51,290 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:43:51,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 12:43:51,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:43:51,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:44:00,093 INFO L272 TraceCheckUtils]: 0: Hoare triple {34948#true} call ULTIMATE.init(); {34948#true} is VALID [2022-04-28 12:44:00,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {34948#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(11, 2);call #Ultimate.allocInit(12, 3); {34948#true} is VALID [2022-04-28 12:44:00,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {34948#true} assume true; {34948#true} is VALID [2022-04-28 12:44:00,093 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34948#true} {34948#true} #112#return; {34948#true} is VALID [2022-04-28 12:44:00,093 INFO L272 TraceCheckUtils]: 4: Hoare triple {34948#true} call #t~ret6 := main(); {34948#true} is VALID [2022-04-28 12:44:00,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {34948#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {34948#true} is VALID [2022-04-28 12:44:00,094 INFO L272 TraceCheckUtils]: 6: Hoare triple {34948#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {34948#true} is VALID [2022-04-28 12:44:00,094 INFO L290 TraceCheckUtils]: 7: Hoare triple {34948#true} ~cond := #in~cond; {34974#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 12:44:00,094 INFO L290 TraceCheckUtils]: 8: Hoare triple {34974#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {34978#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:44:00,095 INFO L290 TraceCheckUtils]: 9: Hoare triple {34978#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {34978#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:44:00,095 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34978#(not (= |assume_abort_if_not_#in~cond| 0))} {34948#true} #94#return; {34985#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 12:44:00,095 INFO L290 TraceCheckUtils]: 11: Hoare triple {34985#(and (<= 0 main_~x~0) (<= main_~x~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {34985#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 12:44:00,096 INFO L272 TraceCheckUtils]: 12: Hoare triple {34985#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {34948#true} is VALID [2022-04-28 12:44:00,096 INFO L290 TraceCheckUtils]: 13: Hoare triple {34948#true} ~cond := #in~cond; {34948#true} is VALID [2022-04-28 12:44:00,096 INFO L290 TraceCheckUtils]: 14: Hoare triple {34948#true} assume !(0 == ~cond); {34948#true} is VALID [2022-04-28 12:44:00,096 INFO L290 TraceCheckUtils]: 15: Hoare triple {34948#true} assume true; {34948#true} is VALID [2022-04-28 12:44:00,096 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {34948#true} {34985#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #96#return; {34985#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 12:44:00,096 INFO L272 TraceCheckUtils]: 17: Hoare triple {34985#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {34948#true} is VALID [2022-04-28 12:44:00,096 INFO L290 TraceCheckUtils]: 18: Hoare triple {34948#true} ~cond := #in~cond; {34948#true} is VALID [2022-04-28 12:44:00,096 INFO L290 TraceCheckUtils]: 19: Hoare triple {34948#true} assume !(0 == ~cond); {34948#true} is VALID [2022-04-28 12:44:00,096 INFO L290 TraceCheckUtils]: 20: Hoare triple {34948#true} assume true; {34948#true} is VALID [2022-04-28 12:44:00,097 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {34948#true} {34985#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #98#return; {34985#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 12:44:00,097 INFO L272 TraceCheckUtils]: 22: Hoare triple {34985#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {34948#true} is VALID [2022-04-28 12:44:00,097 INFO L290 TraceCheckUtils]: 23: Hoare triple {34948#true} ~cond := #in~cond; {34948#true} is VALID [2022-04-28 12:44:00,097 INFO L290 TraceCheckUtils]: 24: Hoare triple {34948#true} assume !(0 == ~cond); {34948#true} is VALID [2022-04-28 12:44:00,097 INFO L290 TraceCheckUtils]: 25: Hoare triple {34948#true} assume true; {34948#true} is VALID [2022-04-28 12:44:00,097 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {34948#true} {34985#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #100#return; {34985#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 12:44:00,098 INFO L290 TraceCheckUtils]: 27: Hoare triple {34985#(and (<= 0 main_~x~0) (<= main_~x~0 2))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {35037#(<= main_~a~0 2)} is VALID [2022-04-28 12:44:00,098 INFO L290 TraceCheckUtils]: 28: Hoare triple {35037#(<= main_~a~0 2)} assume !false; {35037#(<= main_~a~0 2)} is VALID [2022-04-28 12:44:00,098 INFO L290 TraceCheckUtils]: 29: Hoare triple {35037#(<= main_~a~0 2)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {35044#(<= main_~c~0 2)} is VALID [2022-04-28 12:44:00,098 INFO L290 TraceCheckUtils]: 30: Hoare triple {35044#(<= main_~c~0 2)} assume !false; {35044#(<= main_~c~0 2)} is VALID [2022-04-28 12:44:00,099 INFO L290 TraceCheckUtils]: 31: Hoare triple {35044#(<= main_~c~0 2)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {35051#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} is VALID [2022-04-28 12:44:00,099 INFO L290 TraceCheckUtils]: 32: Hoare triple {35051#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} assume !false; {35051#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} is VALID [2022-04-28 12:44:00,099 INFO L272 TraceCheckUtils]: 33: Hoare triple {35051#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {34948#true} is VALID [2022-04-28 12:44:00,099 INFO L290 TraceCheckUtils]: 34: Hoare triple {34948#true} ~cond := #in~cond; {34948#true} is VALID [2022-04-28 12:44:00,099 INFO L290 TraceCheckUtils]: 35: Hoare triple {34948#true} assume !(0 == ~cond); {34948#true} is VALID [2022-04-28 12:44:00,099 INFO L290 TraceCheckUtils]: 36: Hoare triple {34948#true} assume true; {34948#true} is VALID [2022-04-28 12:44:00,100 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {34948#true} {35051#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} #102#return; {35051#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} is VALID [2022-04-28 12:44:00,100 INFO L272 TraceCheckUtils]: 38: Hoare triple {35051#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {34948#true} is VALID [2022-04-28 12:44:00,100 INFO L290 TraceCheckUtils]: 39: Hoare triple {34948#true} ~cond := #in~cond; {34948#true} is VALID [2022-04-28 12:44:00,100 INFO L290 TraceCheckUtils]: 40: Hoare triple {34948#true} assume !(0 == ~cond); {34948#true} is VALID [2022-04-28 12:44:00,100 INFO L290 TraceCheckUtils]: 41: Hoare triple {34948#true} assume true; {34948#true} is VALID [2022-04-28 12:44:00,100 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {34948#true} {35051#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} #104#return; {35051#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} is VALID [2022-04-28 12:44:00,101 INFO L272 TraceCheckUtils]: 43: Hoare triple {35051#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {34948#true} is VALID [2022-04-28 12:44:00,101 INFO L290 TraceCheckUtils]: 44: Hoare triple {34948#true} ~cond := #in~cond; {34948#true} is VALID [2022-04-28 12:44:00,101 INFO L290 TraceCheckUtils]: 45: Hoare triple {34948#true} assume !(0 == ~cond); {34948#true} is VALID [2022-04-28 12:44:00,101 INFO L290 TraceCheckUtils]: 46: Hoare triple {34948#true} assume true; {34948#true} is VALID [2022-04-28 12:44:00,101 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {34948#true} {35051#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} #106#return; {35051#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} is VALID [2022-04-28 12:44:00,101 INFO L272 TraceCheckUtils]: 48: Hoare triple {35051#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {34948#true} is VALID [2022-04-28 12:44:00,101 INFO L290 TraceCheckUtils]: 49: Hoare triple {34948#true} ~cond := #in~cond; {34948#true} is VALID [2022-04-28 12:44:00,101 INFO L290 TraceCheckUtils]: 50: Hoare triple {34948#true} assume !(0 == ~cond); {34948#true} is VALID [2022-04-28 12:44:00,101 INFO L290 TraceCheckUtils]: 51: Hoare triple {34948#true} assume true; {34948#true} is VALID [2022-04-28 12:44:00,102 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {34948#true} {35051#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} #108#return; {35051#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} is VALID [2022-04-28 12:44:00,102 INFO L290 TraceCheckUtils]: 53: Hoare triple {35051#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {35118#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} is VALID [2022-04-28 12:44:00,103 INFO L290 TraceCheckUtils]: 54: Hoare triple {35118#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} assume !false; {35118#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} is VALID [2022-04-28 12:44:00,103 INFO L272 TraceCheckUtils]: 55: Hoare triple {35118#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {34948#true} is VALID [2022-04-28 12:44:00,103 INFO L290 TraceCheckUtils]: 56: Hoare triple {34948#true} ~cond := #in~cond; {34948#true} is VALID [2022-04-28 12:44:00,103 INFO L290 TraceCheckUtils]: 57: Hoare triple {34948#true} assume !(0 == ~cond); {34948#true} is VALID [2022-04-28 12:44:00,103 INFO L290 TraceCheckUtils]: 58: Hoare triple {34948#true} assume true; {34948#true} is VALID [2022-04-28 12:44:00,103 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {34948#true} {35118#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} #102#return; {35118#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} is VALID [2022-04-28 12:44:00,104 INFO L272 TraceCheckUtils]: 60: Hoare triple {35118#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {34948#true} is VALID [2022-04-28 12:44:00,104 INFO L290 TraceCheckUtils]: 61: Hoare triple {34948#true} ~cond := #in~cond; {34948#true} is VALID [2022-04-28 12:44:00,104 INFO L290 TraceCheckUtils]: 62: Hoare triple {34948#true} assume !(0 == ~cond); {34948#true} is VALID [2022-04-28 12:44:00,104 INFO L290 TraceCheckUtils]: 63: Hoare triple {34948#true} assume true; {34948#true} is VALID [2022-04-28 12:44:00,104 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {34948#true} {35118#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} #104#return; {35118#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} is VALID [2022-04-28 12:44:00,104 INFO L272 TraceCheckUtils]: 65: Hoare triple {35118#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {34948#true} is VALID [2022-04-28 12:44:00,104 INFO L290 TraceCheckUtils]: 66: Hoare triple {34948#true} ~cond := #in~cond; {34948#true} is VALID [2022-04-28 12:44:00,104 INFO L290 TraceCheckUtils]: 67: Hoare triple {34948#true} assume !(0 == ~cond); {34948#true} is VALID [2022-04-28 12:44:00,104 INFO L290 TraceCheckUtils]: 68: Hoare triple {34948#true} assume true; {34948#true} is VALID [2022-04-28 12:44:00,105 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {34948#true} {35118#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} #106#return; {35118#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} is VALID [2022-04-28 12:44:00,105 INFO L272 TraceCheckUtils]: 70: Hoare triple {35118#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {34948#true} is VALID [2022-04-28 12:44:00,105 INFO L290 TraceCheckUtils]: 71: Hoare triple {34948#true} ~cond := #in~cond; {34948#true} is VALID [2022-04-28 12:44:00,105 INFO L290 TraceCheckUtils]: 72: Hoare triple {34948#true} assume !(0 == ~cond); {34948#true} is VALID [2022-04-28 12:44:00,105 INFO L290 TraceCheckUtils]: 73: Hoare triple {34948#true} assume true; {34948#true} is VALID [2022-04-28 12:44:00,105 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {34948#true} {35118#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} #108#return; {35118#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} is VALID [2022-04-28 12:44:00,106 INFO L290 TraceCheckUtils]: 75: Hoare triple {35118#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {35185#(and (<= main_~b~0 (div (div main_~v~0 2) 2)) (<= main_~c~0 2))} is VALID [2022-04-28 12:44:00,107 INFO L290 TraceCheckUtils]: 76: Hoare triple {35185#(and (<= main_~b~0 (div (div main_~v~0 2) 2)) (<= main_~c~0 2))} assume !false; {35185#(and (<= main_~b~0 (div (div main_~v~0 2) 2)) (<= main_~c~0 2))} is VALID [2022-04-28 12:44:00,107 INFO L272 TraceCheckUtils]: 77: Hoare triple {35185#(and (<= main_~b~0 (div (div main_~v~0 2) 2)) (<= main_~c~0 2))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {34948#true} is VALID [2022-04-28 12:44:00,107 INFO L290 TraceCheckUtils]: 78: Hoare triple {34948#true} ~cond := #in~cond; {34948#true} is VALID [2022-04-28 12:44:00,107 INFO L290 TraceCheckUtils]: 79: Hoare triple {34948#true} assume !(0 == ~cond); {34948#true} is VALID [2022-04-28 12:44:00,107 INFO L290 TraceCheckUtils]: 80: Hoare triple {34948#true} assume true; {34948#true} is VALID [2022-04-28 12:44:00,107 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {34948#true} {35185#(and (<= main_~b~0 (div (div main_~v~0 2) 2)) (<= main_~c~0 2))} #102#return; {35185#(and (<= main_~b~0 (div (div main_~v~0 2) 2)) (<= main_~c~0 2))} is VALID [2022-04-28 12:44:00,107 INFO L272 TraceCheckUtils]: 82: Hoare triple {35185#(and (<= main_~b~0 (div (div main_~v~0 2) 2)) (<= main_~c~0 2))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {34948#true} is VALID [2022-04-28 12:44:00,107 INFO L290 TraceCheckUtils]: 83: Hoare triple {34948#true} ~cond := #in~cond; {34948#true} is VALID [2022-04-28 12:44:00,107 INFO L290 TraceCheckUtils]: 84: Hoare triple {34948#true} assume !(0 == ~cond); {34948#true} is VALID [2022-04-28 12:44:00,108 INFO L290 TraceCheckUtils]: 85: Hoare triple {34948#true} assume true; {34948#true} is VALID [2022-04-28 12:44:00,108 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {34948#true} {35185#(and (<= main_~b~0 (div (div main_~v~0 2) 2)) (<= main_~c~0 2))} #104#return; {35185#(and (<= main_~b~0 (div (div main_~v~0 2) 2)) (<= main_~c~0 2))} is VALID [2022-04-28 12:44:00,108 INFO L272 TraceCheckUtils]: 87: Hoare triple {35185#(and (<= main_~b~0 (div (div main_~v~0 2) 2)) (<= main_~c~0 2))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {34948#true} is VALID [2022-04-28 12:44:00,108 INFO L290 TraceCheckUtils]: 88: Hoare triple {34948#true} ~cond := #in~cond; {34948#true} is VALID [2022-04-28 12:44:00,108 INFO L290 TraceCheckUtils]: 89: Hoare triple {34948#true} assume !(0 == ~cond); {34948#true} is VALID [2022-04-28 12:44:00,108 INFO L290 TraceCheckUtils]: 90: Hoare triple {34948#true} assume true; {34948#true} is VALID [2022-04-28 12:44:00,109 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {34948#true} {35185#(and (<= main_~b~0 (div (div main_~v~0 2) 2)) (<= main_~c~0 2))} #106#return; {35185#(and (<= main_~b~0 (div (div main_~v~0 2) 2)) (<= main_~c~0 2))} is VALID [2022-04-28 12:44:00,109 INFO L272 TraceCheckUtils]: 92: Hoare triple {35185#(and (<= main_~b~0 (div (div main_~v~0 2) 2)) (<= main_~c~0 2))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {34948#true} is VALID [2022-04-28 12:44:00,109 INFO L290 TraceCheckUtils]: 93: Hoare triple {34948#true} ~cond := #in~cond; {34948#true} is VALID [2022-04-28 12:44:00,109 INFO L290 TraceCheckUtils]: 94: Hoare triple {34948#true} assume !(0 == ~cond); {34948#true} is VALID [2022-04-28 12:44:00,109 INFO L290 TraceCheckUtils]: 95: Hoare triple {34948#true} assume true; {34948#true} is VALID [2022-04-28 12:44:00,109 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {34948#true} {35185#(and (<= main_~b~0 (div (div main_~v~0 2) 2)) (<= main_~c~0 2))} #108#return; {35185#(and (<= main_~b~0 (div (div main_~v~0 2) 2)) (<= main_~c~0 2))} is VALID [2022-04-28 12:44:00,110 INFO L290 TraceCheckUtils]: 97: Hoare triple {35185#(and (<= main_~b~0 (div (div main_~v~0 2) 2)) (<= main_~c~0 2))} assume !(~c~0 >= 2 * ~v~0); {35185#(and (<= main_~b~0 (div (div main_~v~0 2) 2)) (<= main_~c~0 2))} is VALID [2022-04-28 12:44:00,110 INFO L290 TraceCheckUtils]: 98: Hoare triple {35185#(and (<= main_~b~0 (div (div main_~v~0 2) 2)) (<= main_~c~0 2))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {35255#(<= main_~b~0 (div (div (+ (* (- 1) main_~c~0) 2) 2) 2))} is VALID [2022-04-28 12:44:00,111 INFO L290 TraceCheckUtils]: 99: Hoare triple {35255#(<= main_~b~0 (div (div (+ (* (- 1) main_~c~0) 2) 2) 2))} assume !false; {35255#(<= main_~b~0 (div (div (+ (* (- 1) main_~c~0) 2) 2) 2))} is VALID [2022-04-28 12:44:00,111 INFO L290 TraceCheckUtils]: 100: Hoare triple {35255#(<= main_~b~0 (div (div (+ (* (- 1) main_~c~0) 2) 2) 2))} assume !(~c~0 >= ~b~0); {35262#(and (<= main_~b~0 (div (div (+ (* (- 1) main_~c~0) 2) 2) 2)) (not (<= main_~b~0 main_~c~0)))} is VALID [2022-04-28 12:44:00,133 INFO L290 TraceCheckUtils]: 101: Hoare triple {35262#(and (<= main_~b~0 (div (div (+ (* (- 1) main_~c~0) 2) 2) 2)) (not (<= main_~b~0 main_~c~0)))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {35266#(and (< main_~b~0 main_~a~0) (exists ((aux_div_aux_div_main_~c~0_33_28 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (< 1 (+ (* 5 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< aux_mod_aux_div_main_~c~0_33_28 2) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< 1 (+ main_~a~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< main_~b~0 aux_div_aux_div_main_~c~0_33_28) (<= (+ main_~b~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2))))} is VALID [2022-04-28 12:44:00,135 INFO L290 TraceCheckUtils]: 102: Hoare triple {35266#(and (< main_~b~0 main_~a~0) (exists ((aux_div_aux_div_main_~c~0_33_28 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (< 1 (+ (* 5 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< aux_mod_aux_div_main_~c~0_33_28 2) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< 1 (+ main_~a~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< main_~b~0 aux_div_aux_div_main_~c~0_33_28) (<= (+ main_~b~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2))))} assume !false; {35266#(and (< main_~b~0 main_~a~0) (exists ((aux_div_aux_div_main_~c~0_33_28 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (< 1 (+ (* 5 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< aux_mod_aux_div_main_~c~0_33_28 2) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< 1 (+ main_~a~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< main_~b~0 aux_div_aux_div_main_~c~0_33_28) (<= (+ main_~b~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2))))} is VALID [2022-04-28 12:44:00,136 INFO L290 TraceCheckUtils]: 103: Hoare triple {35266#(and (< main_~b~0 main_~a~0) (exists ((aux_div_aux_div_main_~c~0_33_28 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (< 1 (+ (* 5 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< aux_mod_aux_div_main_~c~0_33_28 2) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< 1 (+ main_~a~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< main_~b~0 aux_div_aux_div_main_~c~0_33_28) (<= (+ main_~b~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2))))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {35273#(and (exists ((aux_div_aux_div_main_~c~0_33_28 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (< 1 (+ (* 5 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< aux_mod_aux_div_main_~c~0_33_28 2) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< 1 (+ main_~c~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< main_~b~0 aux_div_aux_div_main_~c~0_33_28) (<= (+ main_~b~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2))) (< main_~b~0 main_~c~0))} is VALID [2022-04-28 12:44:00,137 INFO L290 TraceCheckUtils]: 104: Hoare triple {35273#(and (exists ((aux_div_aux_div_main_~c~0_33_28 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (< 1 (+ (* 5 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< aux_mod_aux_div_main_~c~0_33_28 2) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< 1 (+ main_~c~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< main_~b~0 aux_div_aux_div_main_~c~0_33_28) (<= (+ main_~b~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2))) (< main_~b~0 main_~c~0))} assume !false; {35273#(and (exists ((aux_div_aux_div_main_~c~0_33_28 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (< 1 (+ (* 5 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< aux_mod_aux_div_main_~c~0_33_28 2) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< 1 (+ main_~c~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< main_~b~0 aux_div_aux_div_main_~c~0_33_28) (<= (+ main_~b~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2))) (< main_~b~0 main_~c~0))} is VALID [2022-04-28 12:44:00,139 INFO L290 TraceCheckUtils]: 105: Hoare triple {35273#(and (exists ((aux_div_aux_div_main_~c~0_33_28 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (< 1 (+ (* 5 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< aux_mod_aux_div_main_~c~0_33_28 2) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< 1 (+ main_~c~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< main_~b~0 aux_div_aux_div_main_~c~0_33_28) (<= (+ main_~b~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2))) (< main_~b~0 main_~c~0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {35280#(and (<= main_~v~0 main_~b~0) (exists ((aux_div_aux_div_main_~c~0_33_28 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (< 1 (+ (* 5 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< aux_mod_aux_div_main_~c~0_33_28 2) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< 1 (+ main_~c~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< main_~b~0 aux_div_aux_div_main_~c~0_33_28) (<= (+ main_~b~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2))) (< main_~b~0 main_~c~0))} is VALID [2022-04-28 12:44:00,141 INFO L290 TraceCheckUtils]: 106: Hoare triple {35280#(and (<= main_~v~0 main_~b~0) (exists ((aux_div_aux_div_main_~c~0_33_28 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (< 1 (+ (* 5 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< aux_mod_aux_div_main_~c~0_33_28 2) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< 1 (+ main_~c~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< main_~b~0 aux_div_aux_div_main_~c~0_33_28) (<= (+ main_~b~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2))) (< main_~b~0 main_~c~0))} assume !false; {35280#(and (<= main_~v~0 main_~b~0) (exists ((aux_div_aux_div_main_~c~0_33_28 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (< 1 (+ (* 5 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< aux_mod_aux_div_main_~c~0_33_28 2) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< 1 (+ main_~c~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< main_~b~0 aux_div_aux_div_main_~c~0_33_28) (<= (+ main_~b~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2))) (< main_~b~0 main_~c~0))} is VALID [2022-04-28 12:44:00,141 INFO L272 TraceCheckUtils]: 107: Hoare triple {35280#(and (<= main_~v~0 main_~b~0) (exists ((aux_div_aux_div_main_~c~0_33_28 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (< 1 (+ (* 5 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< aux_mod_aux_div_main_~c~0_33_28 2) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< 1 (+ main_~c~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< main_~b~0 aux_div_aux_div_main_~c~0_33_28) (<= (+ main_~b~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2))) (< main_~b~0 main_~c~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {34948#true} is VALID [2022-04-28 12:44:00,141 INFO L290 TraceCheckUtils]: 108: Hoare triple {34948#true} ~cond := #in~cond; {34948#true} is VALID [2022-04-28 12:44:00,141 INFO L290 TraceCheckUtils]: 109: Hoare triple {34948#true} assume !(0 == ~cond); {34948#true} is VALID [2022-04-28 12:44:00,141 INFO L290 TraceCheckUtils]: 110: Hoare triple {34948#true} assume true; {34948#true} is VALID [2022-04-28 12:44:00,141 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {34948#true} {35280#(and (<= main_~v~0 main_~b~0) (exists ((aux_div_aux_div_main_~c~0_33_28 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (< 1 (+ (* 5 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< aux_mod_aux_div_main_~c~0_33_28 2) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< 1 (+ main_~c~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< main_~b~0 aux_div_aux_div_main_~c~0_33_28) (<= (+ main_~b~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2))) (< main_~b~0 main_~c~0))} #102#return; {35280#(and (<= main_~v~0 main_~b~0) (exists ((aux_div_aux_div_main_~c~0_33_28 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (< 1 (+ (* 5 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< aux_mod_aux_div_main_~c~0_33_28 2) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< 1 (+ main_~c~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< main_~b~0 aux_div_aux_div_main_~c~0_33_28) (<= (+ main_~b~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2))) (< main_~b~0 main_~c~0))} is VALID [2022-04-28 12:44:00,142 INFO L272 TraceCheckUtils]: 112: Hoare triple {35280#(and (<= main_~v~0 main_~b~0) (exists ((aux_div_aux_div_main_~c~0_33_28 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (< 1 (+ (* 5 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< aux_mod_aux_div_main_~c~0_33_28 2) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< 1 (+ main_~c~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< main_~b~0 aux_div_aux_div_main_~c~0_33_28) (<= (+ main_~b~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2))) (< main_~b~0 main_~c~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {34948#true} is VALID [2022-04-28 12:44:00,142 INFO L290 TraceCheckUtils]: 113: Hoare triple {34948#true} ~cond := #in~cond; {34948#true} is VALID [2022-04-28 12:44:00,142 INFO L290 TraceCheckUtils]: 114: Hoare triple {34948#true} assume !(0 == ~cond); {34948#true} is VALID [2022-04-28 12:44:00,142 INFO L290 TraceCheckUtils]: 115: Hoare triple {34948#true} assume true; {34948#true} is VALID [2022-04-28 12:44:00,142 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {34948#true} {35280#(and (<= main_~v~0 main_~b~0) (exists ((aux_div_aux_div_main_~c~0_33_28 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (< 1 (+ (* 5 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< aux_mod_aux_div_main_~c~0_33_28 2) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< 1 (+ main_~c~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< main_~b~0 aux_div_aux_div_main_~c~0_33_28) (<= (+ main_~b~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2))) (< main_~b~0 main_~c~0))} #104#return; {35280#(and (<= main_~v~0 main_~b~0) (exists ((aux_div_aux_div_main_~c~0_33_28 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (< 1 (+ (* 5 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< aux_mod_aux_div_main_~c~0_33_28 2) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< 1 (+ main_~c~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< main_~b~0 aux_div_aux_div_main_~c~0_33_28) (<= (+ main_~b~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2))) (< main_~b~0 main_~c~0))} is VALID [2022-04-28 12:44:00,142 INFO L272 TraceCheckUtils]: 117: Hoare triple {35280#(and (<= main_~v~0 main_~b~0) (exists ((aux_div_aux_div_main_~c~0_33_28 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (< 1 (+ (* 5 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< aux_mod_aux_div_main_~c~0_33_28 2) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< 1 (+ main_~c~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< main_~b~0 aux_div_aux_div_main_~c~0_33_28) (<= (+ main_~b~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2))) (< main_~b~0 main_~c~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {34948#true} is VALID [2022-04-28 12:44:00,142 INFO L290 TraceCheckUtils]: 118: Hoare triple {34948#true} ~cond := #in~cond; {34948#true} is VALID [2022-04-28 12:44:00,142 INFO L290 TraceCheckUtils]: 119: Hoare triple {34948#true} assume !(0 == ~cond); {34948#true} is VALID [2022-04-28 12:44:00,142 INFO L290 TraceCheckUtils]: 120: Hoare triple {34948#true} assume true; {34948#true} is VALID [2022-04-28 12:44:00,143 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {34948#true} {35280#(and (<= main_~v~0 main_~b~0) (exists ((aux_div_aux_div_main_~c~0_33_28 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (< 1 (+ (* 5 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< aux_mod_aux_div_main_~c~0_33_28 2) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< 1 (+ main_~c~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< main_~b~0 aux_div_aux_div_main_~c~0_33_28) (<= (+ main_~b~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2))) (< main_~b~0 main_~c~0))} #106#return; {35280#(and (<= main_~v~0 main_~b~0) (exists ((aux_div_aux_div_main_~c~0_33_28 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (< 1 (+ (* 5 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< aux_mod_aux_div_main_~c~0_33_28 2) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< 1 (+ main_~c~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< main_~b~0 aux_div_aux_div_main_~c~0_33_28) (<= (+ main_~b~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2))) (< main_~b~0 main_~c~0))} is VALID [2022-04-28 12:44:00,143 INFO L272 TraceCheckUtils]: 122: Hoare triple {35280#(and (<= main_~v~0 main_~b~0) (exists ((aux_div_aux_div_main_~c~0_33_28 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (< 1 (+ (* 5 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< aux_mod_aux_div_main_~c~0_33_28 2) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< 1 (+ main_~c~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< main_~b~0 aux_div_aux_div_main_~c~0_33_28) (<= (+ main_~b~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2))) (< main_~b~0 main_~c~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {34948#true} is VALID [2022-04-28 12:44:00,143 INFO L290 TraceCheckUtils]: 123: Hoare triple {34948#true} ~cond := #in~cond; {34948#true} is VALID [2022-04-28 12:44:00,143 INFO L290 TraceCheckUtils]: 124: Hoare triple {34948#true} assume !(0 == ~cond); {34948#true} is VALID [2022-04-28 12:44:00,143 INFO L290 TraceCheckUtils]: 125: Hoare triple {34948#true} assume true; {34948#true} is VALID [2022-04-28 12:44:00,144 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {34948#true} {35280#(and (<= main_~v~0 main_~b~0) (exists ((aux_div_aux_div_main_~c~0_33_28 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (< 1 (+ (* 5 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< aux_mod_aux_div_main_~c~0_33_28 2) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< 1 (+ main_~c~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< main_~b~0 aux_div_aux_div_main_~c~0_33_28) (<= (+ main_~b~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2))) (< main_~b~0 main_~c~0))} #108#return; {35280#(and (<= main_~v~0 main_~b~0) (exists ((aux_div_aux_div_main_~c~0_33_28 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (< 1 (+ (* 5 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< aux_mod_aux_div_main_~c~0_33_28 2) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< 1 (+ main_~c~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< main_~b~0 aux_div_aux_div_main_~c~0_33_28) (<= (+ main_~b~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2))) (< main_~b~0 main_~c~0))} is VALID [2022-04-28 12:44:00,147 INFO L290 TraceCheckUtils]: 127: Hoare triple {35280#(and (<= main_~v~0 main_~b~0) (exists ((aux_div_aux_div_main_~c~0_33_28 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (< 1 (+ (* 5 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< aux_mod_aux_div_main_~c~0_33_28 2) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< 1 (+ main_~c~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< main_~b~0 aux_div_aux_div_main_~c~0_33_28) (<= (+ main_~b~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2))) (< main_~b~0 main_~c~0))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {35347#(and (exists ((aux_div_aux_div_main_~c~0_33_28 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (< 1 (+ (* 5 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< aux_mod_aux_div_main_~c~0_33_28 2) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< 1 (+ main_~c~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< main_~b~0 aux_div_aux_div_main_~c~0_33_28) (<= (+ main_~b~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2))) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-28 12:44:00,149 INFO L290 TraceCheckUtils]: 128: Hoare triple {35347#(and (exists ((aux_div_aux_div_main_~c~0_33_28 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (< 1 (+ (* 5 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< aux_mod_aux_div_main_~c~0_33_28 2) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< 1 (+ main_~c~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< main_~b~0 aux_div_aux_div_main_~c~0_33_28) (<= (+ main_~b~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2))) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} assume !false; {35347#(and (exists ((aux_div_aux_div_main_~c~0_33_28 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (< 1 (+ (* 5 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< aux_mod_aux_div_main_~c~0_33_28 2) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< 1 (+ main_~c~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< main_~b~0 aux_div_aux_div_main_~c~0_33_28) (<= (+ main_~b~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2))) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-28 12:44:00,149 INFO L272 TraceCheckUtils]: 129: Hoare triple {35347#(and (exists ((aux_div_aux_div_main_~c~0_33_28 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (< 1 (+ (* 5 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< aux_mod_aux_div_main_~c~0_33_28 2) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< 1 (+ main_~c~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< main_~b~0 aux_div_aux_div_main_~c~0_33_28) (<= (+ main_~b~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2))) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {34948#true} is VALID [2022-04-28 12:44:00,149 INFO L290 TraceCheckUtils]: 130: Hoare triple {34948#true} ~cond := #in~cond; {34948#true} is VALID [2022-04-28 12:44:00,149 INFO L290 TraceCheckUtils]: 131: Hoare triple {34948#true} assume !(0 == ~cond); {34948#true} is VALID [2022-04-28 12:44:00,149 INFO L290 TraceCheckUtils]: 132: Hoare triple {34948#true} assume true; {34948#true} is VALID [2022-04-28 12:44:00,150 INFO L284 TraceCheckUtils]: 133: Hoare quadruple {34948#true} {35347#(and (exists ((aux_div_aux_div_main_~c~0_33_28 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (< 1 (+ (* 5 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< aux_mod_aux_div_main_~c~0_33_28 2) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< 1 (+ main_~c~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< main_~b~0 aux_div_aux_div_main_~c~0_33_28) (<= (+ main_~b~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2))) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} #102#return; {35347#(and (exists ((aux_div_aux_div_main_~c~0_33_28 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (< 1 (+ (* 5 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< aux_mod_aux_div_main_~c~0_33_28 2) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< 1 (+ main_~c~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< main_~b~0 aux_div_aux_div_main_~c~0_33_28) (<= (+ main_~b~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2))) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-28 12:44:00,150 INFO L272 TraceCheckUtils]: 134: Hoare triple {35347#(and (exists ((aux_div_aux_div_main_~c~0_33_28 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (< 1 (+ (* 5 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< aux_mod_aux_div_main_~c~0_33_28 2) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< 1 (+ main_~c~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< main_~b~0 aux_div_aux_div_main_~c~0_33_28) (<= (+ main_~b~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2))) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {34948#true} is VALID [2022-04-28 12:44:00,150 INFO L290 TraceCheckUtils]: 135: Hoare triple {34948#true} ~cond := #in~cond; {34948#true} is VALID [2022-04-28 12:44:00,150 INFO L290 TraceCheckUtils]: 136: Hoare triple {34948#true} assume !(0 == ~cond); {34948#true} is VALID [2022-04-28 12:44:00,150 INFO L290 TraceCheckUtils]: 137: Hoare triple {34948#true} assume true; {34948#true} is VALID [2022-04-28 12:44:00,150 INFO L284 TraceCheckUtils]: 138: Hoare quadruple {34948#true} {35347#(and (exists ((aux_div_aux_div_main_~c~0_33_28 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (< 1 (+ (* 5 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< aux_mod_aux_div_main_~c~0_33_28 2) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< 1 (+ main_~c~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< main_~b~0 aux_div_aux_div_main_~c~0_33_28) (<= (+ main_~b~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2))) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} #104#return; {35347#(and (exists ((aux_div_aux_div_main_~c~0_33_28 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (< 1 (+ (* 5 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< aux_mod_aux_div_main_~c~0_33_28 2) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< 1 (+ main_~c~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< main_~b~0 aux_div_aux_div_main_~c~0_33_28) (<= (+ main_~b~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2))) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-28 12:44:00,150 INFO L272 TraceCheckUtils]: 139: Hoare triple {35347#(and (exists ((aux_div_aux_div_main_~c~0_33_28 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (< 1 (+ (* 5 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< aux_mod_aux_div_main_~c~0_33_28 2) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< 1 (+ main_~c~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< main_~b~0 aux_div_aux_div_main_~c~0_33_28) (<= (+ main_~b~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2))) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {34948#true} is VALID [2022-04-28 12:44:00,150 INFO L290 TraceCheckUtils]: 140: Hoare triple {34948#true} ~cond := #in~cond; {34948#true} is VALID [2022-04-28 12:44:00,150 INFO L290 TraceCheckUtils]: 141: Hoare triple {34948#true} assume !(0 == ~cond); {34948#true} is VALID [2022-04-28 12:44:00,151 INFO L290 TraceCheckUtils]: 142: Hoare triple {34948#true} assume true; {34948#true} is VALID [2022-04-28 12:44:00,151 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {34948#true} {35347#(and (exists ((aux_div_aux_div_main_~c~0_33_28 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (< 1 (+ (* 5 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< aux_mod_aux_div_main_~c~0_33_28 2) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< 1 (+ main_~c~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< main_~b~0 aux_div_aux_div_main_~c~0_33_28) (<= (+ main_~b~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2))) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} #106#return; {35347#(and (exists ((aux_div_aux_div_main_~c~0_33_28 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (< 1 (+ (* 5 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< aux_mod_aux_div_main_~c~0_33_28 2) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< 1 (+ main_~c~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< main_~b~0 aux_div_aux_div_main_~c~0_33_28) (<= (+ main_~b~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2))) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-28 12:44:00,151 INFO L272 TraceCheckUtils]: 144: Hoare triple {35347#(and (exists ((aux_div_aux_div_main_~c~0_33_28 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (< 1 (+ (* 5 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< aux_mod_aux_div_main_~c~0_33_28 2) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< 1 (+ main_~c~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< main_~b~0 aux_div_aux_div_main_~c~0_33_28) (<= (+ main_~b~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2))) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {34948#true} is VALID [2022-04-28 12:44:00,151 INFO L290 TraceCheckUtils]: 145: Hoare triple {34948#true} ~cond := #in~cond; {34948#true} is VALID [2022-04-28 12:44:00,151 INFO L290 TraceCheckUtils]: 146: Hoare triple {34948#true} assume !(0 == ~cond); {34948#true} is VALID [2022-04-28 12:44:00,151 INFO L290 TraceCheckUtils]: 147: Hoare triple {34948#true} assume true; {34948#true} is VALID [2022-04-28 12:44:00,152 INFO L284 TraceCheckUtils]: 148: Hoare quadruple {34948#true} {35347#(and (exists ((aux_div_aux_div_main_~c~0_33_28 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (< 1 (+ (* 5 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< aux_mod_aux_div_main_~c~0_33_28 2) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< 1 (+ main_~c~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< main_~b~0 aux_div_aux_div_main_~c~0_33_28) (<= (+ main_~b~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2))) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} #108#return; {35347#(and (exists ((aux_div_aux_div_main_~c~0_33_28 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (< 1 (+ (* 5 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< aux_mod_aux_div_main_~c~0_33_28 2) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< 1 (+ main_~c~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< main_~b~0 aux_div_aux_div_main_~c~0_33_28) (<= (+ main_~b~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2))) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-28 12:44:00,153 INFO L290 TraceCheckUtils]: 149: Hoare triple {35347#(and (exists ((aux_div_aux_div_main_~c~0_33_28 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (< 1 (+ (* 5 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< aux_mod_aux_div_main_~c~0_33_28 2) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< 1 (+ main_~c~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< main_~b~0 aux_div_aux_div_main_~c~0_33_28) (<= (+ main_~b~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2))) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} assume !(~c~0 >= 2 * ~v~0); {35347#(and (exists ((aux_div_aux_div_main_~c~0_33_28 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (< 1 (+ (* 5 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< aux_mod_aux_div_main_~c~0_33_28 2) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< 1 (+ main_~c~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< main_~b~0 aux_div_aux_div_main_~c~0_33_28) (<= (+ main_~b~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2))) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-28 12:44:00,155 INFO L290 TraceCheckUtils]: 150: Hoare triple {35347#(and (exists ((aux_div_aux_div_main_~c~0_33_28 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (< 1 (+ (* 5 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< aux_mod_aux_div_main_~c~0_33_28 2) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< 1 (+ main_~c~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< main_~b~0 aux_div_aux_div_main_~c~0_33_28) (<= (+ main_~b~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2))) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {35417#(and (exists ((aux_div_aux_div_main_~c~0_33_28 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (< 1 (+ (* 5 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< aux_mod_aux_div_main_~c~0_33_28 2) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< (div (+ (- 2) main_~c~0) (- 2)) (+ main_~b~0 (* 2 aux_div_aux_div_main_~c~0_33_28) aux_mod_aux_div_main_~c~0_33_28 1)) (< main_~b~0 aux_div_aux_div_main_~c~0_33_28) (<= (+ main_~b~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2))) (< (div (+ (- 1) main_~c~0 (* (- 1) main_~b~0)) (- 2)) (+ main_~b~0 1)))} is VALID [2022-04-28 12:44:00,158 INFO L290 TraceCheckUtils]: 151: Hoare triple {35417#(and (exists ((aux_div_aux_div_main_~c~0_33_28 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (< 1 (+ (* 5 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< aux_mod_aux_div_main_~c~0_33_28 2) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< (div (+ (- 2) main_~c~0) (- 2)) (+ main_~b~0 (* 2 aux_div_aux_div_main_~c~0_33_28) aux_mod_aux_div_main_~c~0_33_28 1)) (< main_~b~0 aux_div_aux_div_main_~c~0_33_28) (<= (+ main_~b~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2))) (< (div (+ (- 1) main_~c~0 (* (- 1) main_~b~0)) (- 2)) (+ main_~b~0 1)))} assume !false; {35417#(and (exists ((aux_div_aux_div_main_~c~0_33_28 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (< 1 (+ (* 5 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< aux_mod_aux_div_main_~c~0_33_28 2) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< (div (+ (- 2) main_~c~0) (- 2)) (+ main_~b~0 (* 2 aux_div_aux_div_main_~c~0_33_28) aux_mod_aux_div_main_~c~0_33_28 1)) (< main_~b~0 aux_div_aux_div_main_~c~0_33_28) (<= (+ main_~b~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2))) (< (div (+ (- 1) main_~c~0 (* (- 1) main_~b~0)) (- 2)) (+ main_~b~0 1)))} is VALID [2022-04-28 12:44:00,159 INFO L290 TraceCheckUtils]: 152: Hoare triple {35417#(and (exists ((aux_div_aux_div_main_~c~0_33_28 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (< 1 (+ (* 5 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< aux_mod_aux_div_main_~c~0_33_28 2) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< (div (+ (- 2) main_~c~0) (- 2)) (+ main_~b~0 (* 2 aux_div_aux_div_main_~c~0_33_28) aux_mod_aux_div_main_~c~0_33_28 1)) (< main_~b~0 aux_div_aux_div_main_~c~0_33_28) (<= (+ main_~b~0 (* 4 aux_div_aux_div_main_~c~0_33_28) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2))) (< (div (+ (- 1) main_~c~0 (* (- 1) main_~b~0)) (- 2)) (+ main_~b~0 1)))} assume !(~c~0 >= ~b~0); {34949#false} is VALID [2022-04-28 12:44:00,159 INFO L290 TraceCheckUtils]: 153: Hoare triple {34949#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {34949#false} is VALID [2022-04-28 12:44:00,159 INFO L290 TraceCheckUtils]: 154: Hoare triple {34949#false} assume !false; {34949#false} is VALID [2022-04-28 12:44:00,159 INFO L290 TraceCheckUtils]: 155: Hoare triple {34949#false} assume !(0 != ~b~0); {34949#false} is VALID [2022-04-28 12:44:00,159 INFO L272 TraceCheckUtils]: 156: Hoare triple {34949#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {34949#false} is VALID [2022-04-28 12:44:00,159 INFO L290 TraceCheckUtils]: 157: Hoare triple {34949#false} ~cond := #in~cond; {34949#false} is VALID [2022-04-28 12:44:00,159 INFO L290 TraceCheckUtils]: 158: Hoare triple {34949#false} assume 0 == ~cond; {34949#false} is VALID [2022-04-28 12:44:00,159 INFO L290 TraceCheckUtils]: 159: Hoare triple {34949#false} assume !false; {34949#false} is VALID [2022-04-28 12:44:00,160 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 53 proven. 76 refuted. 0 times theorem prover too weak. 775 trivial. 0 not checked. [2022-04-28 12:44:00,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:44:04,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:44:04,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536758283] [2022-04-28 12:44:04,264 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:44:04,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298641360] [2022-04-28 12:44:04,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298641360] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 12:44:04,264 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 12:44:04,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2022-04-28 12:44:04,264 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:44:04,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2131844652] [2022-04-28 12:44:04,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2131844652] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:44:04,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:44:04,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 12:44:04,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026210438] [2022-04-28 12:44:04,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:44:04,265 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 8 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) Word has length 160 [2022-04-28 12:44:04,265 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:44:04,265 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 8 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) [2022-04-28 12:44:05,226 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 96 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 12:44:05,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 12:44:05,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:44:05,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 12:44:05,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=749, Unknown=0, NotChecked=0, Total=870 [2022-04-28 12:44:05,227 INFO L87 Difference]: Start difference. First operand 141 states and 167 transitions. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 8 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) [2022-04-28 12:44:08,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:44:08,775 INFO L93 Difference]: Finished difference Result 218 states and 267 transitions. [2022-04-28 12:44:08,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 12:44:08,775 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 8 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) Word has length 160 [2022-04-28 12:44:08,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:44:08,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 8 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) [2022-04-28 12:44:08,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 150 transitions. [2022-04-28 12:44:08,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 8 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) [2022-04-28 12:44:08,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 150 transitions. [2022-04-28 12:44:08,786 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 150 transitions. [2022-04-28 12:44:08,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:44:08,973 INFO L225 Difference]: With dead ends: 218 [2022-04-28 12:44:08,973 INFO L226 Difference]: Without dead ends: 147 [2022-04-28 12:44:08,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=237, Invalid=1323, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 12:44:08,974 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 62 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 322 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 12:44:08,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 515 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 308 Invalid, 0 Unknown, 322 Unchecked, 0.9s Time] [2022-04-28 12:44:08,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-04-28 12:44:09,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2022-04-28 12:44:09,648 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:44:09,648 INFO L82 GeneralOperation]: Start isEquivalent. First operand 147 states. Second operand has 147 states, 89 states have (on average 1.0449438202247192) internal successors, (93), 90 states have internal predecessors, (93), 43 states have call successors, (43), 15 states have call predecessors, (43), 14 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-28 12:44:09,648 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand has 147 states, 89 states have (on average 1.0449438202247192) internal successors, (93), 90 states have internal predecessors, (93), 43 states have call successors, (43), 15 states have call predecessors, (43), 14 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-28 12:44:09,648 INFO L87 Difference]: Start difference. First operand 147 states. Second operand has 147 states, 89 states have (on average 1.0449438202247192) internal successors, (93), 90 states have internal predecessors, (93), 43 states have call successors, (43), 15 states have call predecessors, (43), 14 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-28 12:44:09,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:44:09,653 INFO L93 Difference]: Finished difference Result 147 states and 177 transitions. [2022-04-28 12:44:09,653 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 177 transitions. [2022-04-28 12:44:09,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:44:09,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:44:09,654 INFO L74 IsIncluded]: Start isIncluded. First operand has 147 states, 89 states have (on average 1.0449438202247192) internal successors, (93), 90 states have internal predecessors, (93), 43 states have call successors, (43), 15 states have call predecessors, (43), 14 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) Second operand 147 states. [2022-04-28 12:44:09,654 INFO L87 Difference]: Start difference. First operand has 147 states, 89 states have (on average 1.0449438202247192) internal successors, (93), 90 states have internal predecessors, (93), 43 states have call successors, (43), 15 states have call predecessors, (43), 14 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) Second operand 147 states. [2022-04-28 12:44:09,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:44:09,655 INFO L93 Difference]: Finished difference Result 147 states and 177 transitions. [2022-04-28 12:44:09,655 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 177 transitions. [2022-04-28 12:44:09,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:44:09,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:44:09,656 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:44:09,656 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:44:09,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 89 states have (on average 1.0449438202247192) internal successors, (93), 90 states have internal predecessors, (93), 43 states have call successors, (43), 15 states have call predecessors, (43), 14 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-28 12:44:09,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 177 transitions. [2022-04-28 12:44:09,658 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 177 transitions. Word has length 160 [2022-04-28 12:44:09,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:44:09,658 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 177 transitions. [2022-04-28 12:44:09,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 8 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) [2022-04-28 12:44:09,658 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 147 states and 177 transitions. [2022-04-28 12:44:10,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:44:10,060 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 177 transitions. [2022-04-28 12:44:10,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-04-28 12:44:10,061 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:44:10,061 INFO L195 NwaCegarLoop]: trace histogram [25, 24, 24, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:44:10,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-28 12:44:10,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-28 12:44:10,265 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:44:10,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:44:10,266 INFO L85 PathProgramCache]: Analyzing trace with hash 576880450, now seen corresponding path program 17 times [2022-04-28 12:44:10,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:44:10,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [127669250] [2022-04-28 12:44:10,266 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:44:10,266 INFO L85 PathProgramCache]: Analyzing trace with hash 576880450, now seen corresponding path program 18 times [2022-04-28 12:44:10,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:44:10,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405174462] [2022-04-28 12:44:10,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:44:10,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:44:10,281 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:44:10,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1756197158] [2022-04-28 12:44:10,281 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 12:44:10,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:44:10,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:44:10,282 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:44:10,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-28 12:44:10,363 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 12:44:10,363 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:44:10,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 12:44:10,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:44:10,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:44:11,038 INFO L272 TraceCheckUtils]: 0: Hoare triple {36903#true} call ULTIMATE.init(); {36903#true} is VALID [2022-04-28 12:44:11,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {36903#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(11, 2);call #Ultimate.allocInit(12, 3); {36903#true} is VALID [2022-04-28 12:44:11,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {36903#true} assume true; {36903#true} is VALID [2022-04-28 12:44:11,039 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36903#true} {36903#true} #112#return; {36903#true} is VALID [2022-04-28 12:44:11,039 INFO L272 TraceCheckUtils]: 4: Hoare triple {36903#true} call #t~ret6 := main(); {36903#true} is VALID [2022-04-28 12:44:11,039 INFO L290 TraceCheckUtils]: 5: Hoare triple {36903#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {36903#true} is VALID [2022-04-28 12:44:11,039 INFO L272 TraceCheckUtils]: 6: Hoare triple {36903#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {36903#true} is VALID [2022-04-28 12:44:11,039 INFO L290 TraceCheckUtils]: 7: Hoare triple {36903#true} ~cond := #in~cond; {36929#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 12:44:11,039 INFO L290 TraceCheckUtils]: 8: Hoare triple {36929#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {36933#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:44:11,040 INFO L290 TraceCheckUtils]: 9: Hoare triple {36933#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {36933#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:44:11,040 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36933#(not (= |assume_abort_if_not_#in~cond| 0))} {36903#true} #94#return; {36940#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 12:44:11,040 INFO L290 TraceCheckUtils]: 11: Hoare triple {36940#(and (<= 0 main_~x~0) (<= main_~x~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {36940#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 12:44:11,041 INFO L272 TraceCheckUtils]: 12: Hoare triple {36940#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {36903#true} is VALID [2022-04-28 12:44:11,041 INFO L290 TraceCheckUtils]: 13: Hoare triple {36903#true} ~cond := #in~cond; {36903#true} is VALID [2022-04-28 12:44:11,041 INFO L290 TraceCheckUtils]: 14: Hoare triple {36903#true} assume !(0 == ~cond); {36903#true} is VALID [2022-04-28 12:44:11,041 INFO L290 TraceCheckUtils]: 15: Hoare triple {36903#true} assume true; {36903#true} is VALID [2022-04-28 12:44:11,041 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {36903#true} {36940#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #96#return; {36940#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 12:44:11,041 INFO L272 TraceCheckUtils]: 17: Hoare triple {36940#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {36903#true} is VALID [2022-04-28 12:44:11,041 INFO L290 TraceCheckUtils]: 18: Hoare triple {36903#true} ~cond := #in~cond; {36903#true} is VALID [2022-04-28 12:44:11,041 INFO L290 TraceCheckUtils]: 19: Hoare triple {36903#true} assume !(0 == ~cond); {36903#true} is VALID [2022-04-28 12:44:11,041 INFO L290 TraceCheckUtils]: 20: Hoare triple {36903#true} assume true; {36903#true} is VALID [2022-04-28 12:44:11,041 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {36903#true} {36940#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #98#return; {36940#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 12:44:11,042 INFO L272 TraceCheckUtils]: 22: Hoare triple {36940#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {36903#true} is VALID [2022-04-28 12:44:11,042 INFO L290 TraceCheckUtils]: 23: Hoare triple {36903#true} ~cond := #in~cond; {36903#true} is VALID [2022-04-28 12:44:11,042 INFO L290 TraceCheckUtils]: 24: Hoare triple {36903#true} assume !(0 == ~cond); {36903#true} is VALID [2022-04-28 12:44:11,042 INFO L290 TraceCheckUtils]: 25: Hoare triple {36903#true} assume true; {36903#true} is VALID [2022-04-28 12:44:11,042 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {36903#true} {36940#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #100#return; {36940#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 12:44:11,042 INFO L290 TraceCheckUtils]: 27: Hoare triple {36940#(and (<= 0 main_~x~0) (<= main_~x~0 2))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {36992#(<= main_~a~0 2)} is VALID [2022-04-28 12:44:11,043 INFO L290 TraceCheckUtils]: 28: Hoare triple {36992#(<= main_~a~0 2)} assume !false; {36992#(<= main_~a~0 2)} is VALID [2022-04-28 12:44:11,043 INFO L290 TraceCheckUtils]: 29: Hoare triple {36992#(<= main_~a~0 2)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {36999#(<= main_~c~0 2)} is VALID [2022-04-28 12:44:11,043 INFO L290 TraceCheckUtils]: 30: Hoare triple {36999#(<= main_~c~0 2)} assume !false; {36999#(<= main_~c~0 2)} is VALID [2022-04-28 12:44:11,044 INFO L290 TraceCheckUtils]: 31: Hoare triple {36999#(<= main_~c~0 2)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {37006#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} is VALID [2022-04-28 12:44:11,044 INFO L290 TraceCheckUtils]: 32: Hoare triple {37006#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} assume !false; {37006#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} is VALID [2022-04-28 12:44:11,044 INFO L272 TraceCheckUtils]: 33: Hoare triple {37006#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {36903#true} is VALID [2022-04-28 12:44:11,044 INFO L290 TraceCheckUtils]: 34: Hoare triple {36903#true} ~cond := #in~cond; {36903#true} is VALID [2022-04-28 12:44:11,044 INFO L290 TraceCheckUtils]: 35: Hoare triple {36903#true} assume !(0 == ~cond); {36903#true} is VALID [2022-04-28 12:44:11,044 INFO L290 TraceCheckUtils]: 36: Hoare triple {36903#true} assume true; {36903#true} is VALID [2022-04-28 12:44:11,045 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {36903#true} {37006#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} #102#return; {37006#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} is VALID [2022-04-28 12:44:11,045 INFO L272 TraceCheckUtils]: 38: Hoare triple {37006#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {36903#true} is VALID [2022-04-28 12:44:11,045 INFO L290 TraceCheckUtils]: 39: Hoare triple {36903#true} ~cond := #in~cond; {36903#true} is VALID [2022-04-28 12:44:11,045 INFO L290 TraceCheckUtils]: 40: Hoare triple {36903#true} assume !(0 == ~cond); {36903#true} is VALID [2022-04-28 12:44:11,045 INFO L290 TraceCheckUtils]: 41: Hoare triple {36903#true} assume true; {36903#true} is VALID [2022-04-28 12:44:11,045 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {36903#true} {37006#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} #104#return; {37006#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} is VALID [2022-04-28 12:44:11,046 INFO L272 TraceCheckUtils]: 43: Hoare triple {37006#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {36903#true} is VALID [2022-04-28 12:44:11,046 INFO L290 TraceCheckUtils]: 44: Hoare triple {36903#true} ~cond := #in~cond; {36903#true} is VALID [2022-04-28 12:44:11,046 INFO L290 TraceCheckUtils]: 45: Hoare triple {36903#true} assume !(0 == ~cond); {36903#true} is VALID [2022-04-28 12:44:11,046 INFO L290 TraceCheckUtils]: 46: Hoare triple {36903#true} assume true; {36903#true} is VALID [2022-04-28 12:44:11,046 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {36903#true} {37006#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} #106#return; {37006#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} is VALID [2022-04-28 12:44:11,046 INFO L272 TraceCheckUtils]: 48: Hoare triple {37006#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {36903#true} is VALID [2022-04-28 12:44:11,046 INFO L290 TraceCheckUtils]: 49: Hoare triple {36903#true} ~cond := #in~cond; {36903#true} is VALID [2022-04-28 12:44:11,046 INFO L290 TraceCheckUtils]: 50: Hoare triple {36903#true} assume !(0 == ~cond); {36903#true} is VALID [2022-04-28 12:44:11,046 INFO L290 TraceCheckUtils]: 51: Hoare triple {36903#true} assume true; {36903#true} is VALID [2022-04-28 12:44:11,047 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {36903#true} {37006#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} #108#return; {37006#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} is VALID [2022-04-28 12:44:11,047 INFO L290 TraceCheckUtils]: 53: Hoare triple {37006#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {37073#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:11,048 INFO L290 TraceCheckUtils]: 54: Hoare triple {37073#(<= main_~b~0 1)} assume !false; {37073#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:11,048 INFO L272 TraceCheckUtils]: 55: Hoare triple {37073#(<= main_~b~0 1)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {36903#true} is VALID [2022-04-28 12:44:11,048 INFO L290 TraceCheckUtils]: 56: Hoare triple {36903#true} ~cond := #in~cond; {36903#true} is VALID [2022-04-28 12:44:11,048 INFO L290 TraceCheckUtils]: 57: Hoare triple {36903#true} assume !(0 == ~cond); {36903#true} is VALID [2022-04-28 12:44:11,048 INFO L290 TraceCheckUtils]: 58: Hoare triple {36903#true} assume true; {36903#true} is VALID [2022-04-28 12:44:11,048 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {36903#true} {37073#(<= main_~b~0 1)} #102#return; {37073#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:11,048 INFO L272 TraceCheckUtils]: 60: Hoare triple {37073#(<= main_~b~0 1)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {36903#true} is VALID [2022-04-28 12:44:11,048 INFO L290 TraceCheckUtils]: 61: Hoare triple {36903#true} ~cond := #in~cond; {36903#true} is VALID [2022-04-28 12:44:11,048 INFO L290 TraceCheckUtils]: 62: Hoare triple {36903#true} assume !(0 == ~cond); {36903#true} is VALID [2022-04-28 12:44:11,048 INFO L290 TraceCheckUtils]: 63: Hoare triple {36903#true} assume true; {36903#true} is VALID [2022-04-28 12:44:11,049 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {36903#true} {37073#(<= main_~b~0 1)} #104#return; {37073#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:11,049 INFO L272 TraceCheckUtils]: 65: Hoare triple {37073#(<= main_~b~0 1)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {36903#true} is VALID [2022-04-28 12:44:11,049 INFO L290 TraceCheckUtils]: 66: Hoare triple {36903#true} ~cond := #in~cond; {36903#true} is VALID [2022-04-28 12:44:11,049 INFO L290 TraceCheckUtils]: 67: Hoare triple {36903#true} assume !(0 == ~cond); {36903#true} is VALID [2022-04-28 12:44:11,049 INFO L290 TraceCheckUtils]: 68: Hoare triple {36903#true} assume true; {36903#true} is VALID [2022-04-28 12:44:11,049 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {36903#true} {37073#(<= main_~b~0 1)} #106#return; {37073#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:11,050 INFO L272 TraceCheckUtils]: 70: Hoare triple {37073#(<= main_~b~0 1)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {36903#true} is VALID [2022-04-28 12:44:11,050 INFO L290 TraceCheckUtils]: 71: Hoare triple {36903#true} ~cond := #in~cond; {36903#true} is VALID [2022-04-28 12:44:11,050 INFO L290 TraceCheckUtils]: 72: Hoare triple {36903#true} assume !(0 == ~cond); {36903#true} is VALID [2022-04-28 12:44:11,050 INFO L290 TraceCheckUtils]: 73: Hoare triple {36903#true} assume true; {36903#true} is VALID [2022-04-28 12:44:11,050 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {36903#true} {37073#(<= main_~b~0 1)} #108#return; {37073#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:11,050 INFO L290 TraceCheckUtils]: 75: Hoare triple {37073#(<= main_~b~0 1)} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {37073#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:11,050 INFO L290 TraceCheckUtils]: 76: Hoare triple {37073#(<= main_~b~0 1)} assume !false; {37073#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:11,051 INFO L272 TraceCheckUtils]: 77: Hoare triple {37073#(<= main_~b~0 1)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {36903#true} is VALID [2022-04-28 12:44:11,051 INFO L290 TraceCheckUtils]: 78: Hoare triple {36903#true} ~cond := #in~cond; {36903#true} is VALID [2022-04-28 12:44:11,051 INFO L290 TraceCheckUtils]: 79: Hoare triple {36903#true} assume !(0 == ~cond); {36903#true} is VALID [2022-04-28 12:44:11,051 INFO L290 TraceCheckUtils]: 80: Hoare triple {36903#true} assume true; {36903#true} is VALID [2022-04-28 12:44:11,051 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {36903#true} {37073#(<= main_~b~0 1)} #102#return; {37073#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:11,051 INFO L272 TraceCheckUtils]: 82: Hoare triple {37073#(<= main_~b~0 1)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {36903#true} is VALID [2022-04-28 12:44:11,051 INFO L290 TraceCheckUtils]: 83: Hoare triple {36903#true} ~cond := #in~cond; {36903#true} is VALID [2022-04-28 12:44:11,051 INFO L290 TraceCheckUtils]: 84: Hoare triple {36903#true} assume !(0 == ~cond); {36903#true} is VALID [2022-04-28 12:44:11,051 INFO L290 TraceCheckUtils]: 85: Hoare triple {36903#true} assume true; {36903#true} is VALID [2022-04-28 12:44:11,052 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {36903#true} {37073#(<= main_~b~0 1)} #104#return; {37073#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:11,052 INFO L272 TraceCheckUtils]: 87: Hoare triple {37073#(<= main_~b~0 1)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {36903#true} is VALID [2022-04-28 12:44:11,052 INFO L290 TraceCheckUtils]: 88: Hoare triple {36903#true} ~cond := #in~cond; {36903#true} is VALID [2022-04-28 12:44:11,052 INFO L290 TraceCheckUtils]: 89: Hoare triple {36903#true} assume !(0 == ~cond); {36903#true} is VALID [2022-04-28 12:44:11,052 INFO L290 TraceCheckUtils]: 90: Hoare triple {36903#true} assume true; {36903#true} is VALID [2022-04-28 12:44:11,052 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {36903#true} {37073#(<= main_~b~0 1)} #106#return; {37073#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:11,052 INFO L272 TraceCheckUtils]: 92: Hoare triple {37073#(<= main_~b~0 1)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {36903#true} is VALID [2022-04-28 12:44:11,052 INFO L290 TraceCheckUtils]: 93: Hoare triple {36903#true} ~cond := #in~cond; {36903#true} is VALID [2022-04-28 12:44:11,053 INFO L290 TraceCheckUtils]: 94: Hoare triple {36903#true} assume !(0 == ~cond); {36903#true} is VALID [2022-04-28 12:44:11,053 INFO L290 TraceCheckUtils]: 95: Hoare triple {36903#true} assume true; {36903#true} is VALID [2022-04-28 12:44:11,053 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {36903#true} {37073#(<= main_~b~0 1)} #108#return; {37073#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:11,053 INFO L290 TraceCheckUtils]: 97: Hoare triple {37073#(<= main_~b~0 1)} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {37073#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:11,053 INFO L290 TraceCheckUtils]: 98: Hoare triple {37073#(<= main_~b~0 1)} assume !false; {37073#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:11,053 INFO L272 TraceCheckUtils]: 99: Hoare triple {37073#(<= main_~b~0 1)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {36903#true} is VALID [2022-04-28 12:44:11,054 INFO L290 TraceCheckUtils]: 100: Hoare triple {36903#true} ~cond := #in~cond; {36903#true} is VALID [2022-04-28 12:44:11,054 INFO L290 TraceCheckUtils]: 101: Hoare triple {36903#true} assume !(0 == ~cond); {36903#true} is VALID [2022-04-28 12:44:11,054 INFO L290 TraceCheckUtils]: 102: Hoare triple {36903#true} assume true; {36903#true} is VALID [2022-04-28 12:44:11,054 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {36903#true} {37073#(<= main_~b~0 1)} #102#return; {37073#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:11,054 INFO L272 TraceCheckUtils]: 104: Hoare triple {37073#(<= main_~b~0 1)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {36903#true} is VALID [2022-04-28 12:44:11,054 INFO L290 TraceCheckUtils]: 105: Hoare triple {36903#true} ~cond := #in~cond; {36903#true} is VALID [2022-04-28 12:44:11,054 INFO L290 TraceCheckUtils]: 106: Hoare triple {36903#true} assume !(0 == ~cond); {36903#true} is VALID [2022-04-28 12:44:11,054 INFO L290 TraceCheckUtils]: 107: Hoare triple {36903#true} assume true; {36903#true} is VALID [2022-04-28 12:44:11,055 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {36903#true} {37073#(<= main_~b~0 1)} #104#return; {37073#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:11,055 INFO L272 TraceCheckUtils]: 109: Hoare triple {37073#(<= main_~b~0 1)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {36903#true} is VALID [2022-04-28 12:44:11,055 INFO L290 TraceCheckUtils]: 110: Hoare triple {36903#true} ~cond := #in~cond; {36903#true} is VALID [2022-04-28 12:44:11,055 INFO L290 TraceCheckUtils]: 111: Hoare triple {36903#true} assume !(0 == ~cond); {36903#true} is VALID [2022-04-28 12:44:11,055 INFO L290 TraceCheckUtils]: 112: Hoare triple {36903#true} assume true; {36903#true} is VALID [2022-04-28 12:44:11,055 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {36903#true} {37073#(<= main_~b~0 1)} #106#return; {37073#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:11,055 INFO L272 TraceCheckUtils]: 114: Hoare triple {37073#(<= main_~b~0 1)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {36903#true} is VALID [2022-04-28 12:44:11,055 INFO L290 TraceCheckUtils]: 115: Hoare triple {36903#true} ~cond := #in~cond; {36903#true} is VALID [2022-04-28 12:44:11,055 INFO L290 TraceCheckUtils]: 116: Hoare triple {36903#true} assume !(0 == ~cond); {36903#true} is VALID [2022-04-28 12:44:11,056 INFO L290 TraceCheckUtils]: 117: Hoare triple {36903#true} assume true; {36903#true} is VALID [2022-04-28 12:44:11,067 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {36903#true} {37073#(<= main_~b~0 1)} #108#return; {37073#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:11,068 INFO L290 TraceCheckUtils]: 119: Hoare triple {37073#(<= main_~b~0 1)} assume !(~c~0 >= 2 * ~v~0); {37073#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:11,068 INFO L290 TraceCheckUtils]: 120: Hoare triple {37073#(<= main_~b~0 1)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {37073#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:11,068 INFO L290 TraceCheckUtils]: 121: Hoare triple {37073#(<= main_~b~0 1)} assume !false; {37073#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:11,070 INFO L290 TraceCheckUtils]: 122: Hoare triple {37073#(<= main_~b~0 1)} assume !(~c~0 >= ~b~0); {37281#(< main_~c~0 1)} is VALID [2022-04-28 12:44:11,070 INFO L290 TraceCheckUtils]: 123: Hoare triple {37281#(< main_~c~0 1)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {37285#(< main_~b~0 1)} is VALID [2022-04-28 12:44:11,070 INFO L290 TraceCheckUtils]: 124: Hoare triple {37285#(< main_~b~0 1)} assume !false; {37285#(< main_~b~0 1)} is VALID [2022-04-28 12:44:11,071 INFO L290 TraceCheckUtils]: 125: Hoare triple {37285#(< main_~b~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {37285#(< main_~b~0 1)} is VALID [2022-04-28 12:44:11,071 INFO L290 TraceCheckUtils]: 126: Hoare triple {37285#(< main_~b~0 1)} assume !false; {37285#(< main_~b~0 1)} is VALID [2022-04-28 12:44:11,071 INFO L290 TraceCheckUtils]: 127: Hoare triple {37285#(< main_~b~0 1)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {37285#(< main_~b~0 1)} is VALID [2022-04-28 12:44:11,071 INFO L290 TraceCheckUtils]: 128: Hoare triple {37285#(< main_~b~0 1)} assume !false; {37285#(< main_~b~0 1)} is VALID [2022-04-28 12:44:11,071 INFO L272 TraceCheckUtils]: 129: Hoare triple {37285#(< main_~b~0 1)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {36903#true} is VALID [2022-04-28 12:44:11,072 INFO L290 TraceCheckUtils]: 130: Hoare triple {36903#true} ~cond := #in~cond; {36903#true} is VALID [2022-04-28 12:44:11,072 INFO L290 TraceCheckUtils]: 131: Hoare triple {36903#true} assume !(0 == ~cond); {36903#true} is VALID [2022-04-28 12:44:11,072 INFO L290 TraceCheckUtils]: 132: Hoare triple {36903#true} assume true; {36903#true} is VALID [2022-04-28 12:44:11,072 INFO L284 TraceCheckUtils]: 133: Hoare quadruple {36903#true} {37285#(< main_~b~0 1)} #102#return; {37285#(< main_~b~0 1)} is VALID [2022-04-28 12:44:11,072 INFO L272 TraceCheckUtils]: 134: Hoare triple {37285#(< main_~b~0 1)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {36903#true} is VALID [2022-04-28 12:44:11,072 INFO L290 TraceCheckUtils]: 135: Hoare triple {36903#true} ~cond := #in~cond; {36903#true} is VALID [2022-04-28 12:44:11,072 INFO L290 TraceCheckUtils]: 136: Hoare triple {36903#true} assume !(0 == ~cond); {36903#true} is VALID [2022-04-28 12:44:11,072 INFO L290 TraceCheckUtils]: 137: Hoare triple {36903#true} assume true; {36903#true} is VALID [2022-04-28 12:44:11,073 INFO L284 TraceCheckUtils]: 138: Hoare quadruple {36903#true} {37285#(< main_~b~0 1)} #104#return; {37285#(< main_~b~0 1)} is VALID [2022-04-28 12:44:11,073 INFO L272 TraceCheckUtils]: 139: Hoare triple {37285#(< main_~b~0 1)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {36903#true} is VALID [2022-04-28 12:44:11,073 INFO L290 TraceCheckUtils]: 140: Hoare triple {36903#true} ~cond := #in~cond; {36903#true} is VALID [2022-04-28 12:44:11,073 INFO L290 TraceCheckUtils]: 141: Hoare triple {36903#true} assume !(0 == ~cond); {36903#true} is VALID [2022-04-28 12:44:11,073 INFO L290 TraceCheckUtils]: 142: Hoare triple {36903#true} assume true; {36903#true} is VALID [2022-04-28 12:44:11,073 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {36903#true} {37285#(< main_~b~0 1)} #106#return; {37285#(< main_~b~0 1)} is VALID [2022-04-28 12:44:11,074 INFO L272 TraceCheckUtils]: 144: Hoare triple {37285#(< main_~b~0 1)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {36903#true} is VALID [2022-04-28 12:44:11,074 INFO L290 TraceCheckUtils]: 145: Hoare triple {36903#true} ~cond := #in~cond; {36903#true} is VALID [2022-04-28 12:44:11,074 INFO L290 TraceCheckUtils]: 146: Hoare triple {36903#true} assume !(0 == ~cond); {36903#true} is VALID [2022-04-28 12:44:11,074 INFO L290 TraceCheckUtils]: 147: Hoare triple {36903#true} assume true; {36903#true} is VALID [2022-04-28 12:44:11,074 INFO L284 TraceCheckUtils]: 148: Hoare quadruple {36903#true} {37285#(< main_~b~0 1)} #108#return; {37285#(< main_~b~0 1)} is VALID [2022-04-28 12:44:11,074 INFO L290 TraceCheckUtils]: 149: Hoare triple {37285#(< main_~b~0 1)} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {37285#(< main_~b~0 1)} is VALID [2022-04-28 12:44:11,075 INFO L290 TraceCheckUtils]: 150: Hoare triple {37285#(< main_~b~0 1)} assume !false; {37285#(< main_~b~0 1)} is VALID [2022-04-28 12:44:11,075 INFO L272 TraceCheckUtils]: 151: Hoare triple {37285#(< main_~b~0 1)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {36903#true} is VALID [2022-04-28 12:44:11,075 INFO L290 TraceCheckUtils]: 152: Hoare triple {36903#true} ~cond := #in~cond; {36903#true} is VALID [2022-04-28 12:44:11,075 INFO L290 TraceCheckUtils]: 153: Hoare triple {36903#true} assume !(0 == ~cond); {36903#true} is VALID [2022-04-28 12:44:11,075 INFO L290 TraceCheckUtils]: 154: Hoare triple {36903#true} assume true; {36903#true} is VALID [2022-04-28 12:44:11,075 INFO L284 TraceCheckUtils]: 155: Hoare quadruple {36903#true} {37285#(< main_~b~0 1)} #102#return; {37285#(< main_~b~0 1)} is VALID [2022-04-28 12:44:11,075 INFO L272 TraceCheckUtils]: 156: Hoare triple {37285#(< main_~b~0 1)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {36903#true} is VALID [2022-04-28 12:44:11,075 INFO L290 TraceCheckUtils]: 157: Hoare triple {36903#true} ~cond := #in~cond; {36903#true} is VALID [2022-04-28 12:44:11,076 INFO L290 TraceCheckUtils]: 158: Hoare triple {36903#true} assume !(0 == ~cond); {36903#true} is VALID [2022-04-28 12:44:11,076 INFO L290 TraceCheckUtils]: 159: Hoare triple {36903#true} assume true; {36903#true} is VALID [2022-04-28 12:44:11,076 INFO L284 TraceCheckUtils]: 160: Hoare quadruple {36903#true} {37285#(< main_~b~0 1)} #104#return; {37285#(< main_~b~0 1)} is VALID [2022-04-28 12:44:11,076 INFO L272 TraceCheckUtils]: 161: Hoare triple {37285#(< main_~b~0 1)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {36903#true} is VALID [2022-04-28 12:44:11,076 INFO L290 TraceCheckUtils]: 162: Hoare triple {36903#true} ~cond := #in~cond; {36903#true} is VALID [2022-04-28 12:44:11,076 INFO L290 TraceCheckUtils]: 163: Hoare triple {36903#true} assume !(0 == ~cond); {36903#true} is VALID [2022-04-28 12:44:11,076 INFO L290 TraceCheckUtils]: 164: Hoare triple {36903#true} assume true; {36903#true} is VALID [2022-04-28 12:44:11,077 INFO L284 TraceCheckUtils]: 165: Hoare quadruple {36903#true} {37285#(< main_~b~0 1)} #106#return; {37285#(< main_~b~0 1)} is VALID [2022-04-28 12:44:11,077 INFO L272 TraceCheckUtils]: 166: Hoare triple {37285#(< main_~b~0 1)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {36903#true} is VALID [2022-04-28 12:44:11,077 INFO L290 TraceCheckUtils]: 167: Hoare triple {36903#true} ~cond := #in~cond; {36903#true} is VALID [2022-04-28 12:44:11,077 INFO L290 TraceCheckUtils]: 168: Hoare triple {36903#true} assume !(0 == ~cond); {36903#true} is VALID [2022-04-28 12:44:11,077 INFO L290 TraceCheckUtils]: 169: Hoare triple {36903#true} assume true; {36903#true} is VALID [2022-04-28 12:44:11,077 INFO L284 TraceCheckUtils]: 170: Hoare quadruple {36903#true} {37285#(< main_~b~0 1)} #108#return; {37285#(< main_~b~0 1)} is VALID [2022-04-28 12:44:11,078 INFO L290 TraceCheckUtils]: 171: Hoare triple {37285#(< main_~b~0 1)} assume !(~c~0 >= 2 * ~v~0); {37285#(< main_~b~0 1)} is VALID [2022-04-28 12:44:11,078 INFO L290 TraceCheckUtils]: 172: Hoare triple {37285#(< main_~b~0 1)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {37285#(< main_~b~0 1)} is VALID [2022-04-28 12:44:11,078 INFO L290 TraceCheckUtils]: 173: Hoare triple {37285#(< main_~b~0 1)} assume !false; {37285#(< main_~b~0 1)} is VALID [2022-04-28 12:44:11,079 INFO L290 TraceCheckUtils]: 174: Hoare triple {37285#(< main_~b~0 1)} assume !(~c~0 >= ~b~0); {37439#(< main_~c~0 0)} is VALID [2022-04-28 12:44:11,080 INFO L290 TraceCheckUtils]: 175: Hoare triple {37439#(< main_~c~0 0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {37443#(< main_~b~0 0)} is VALID [2022-04-28 12:44:11,080 INFO L290 TraceCheckUtils]: 176: Hoare triple {37443#(< main_~b~0 0)} assume !false; {37443#(< main_~b~0 0)} is VALID [2022-04-28 12:44:11,080 INFO L290 TraceCheckUtils]: 177: Hoare triple {37443#(< main_~b~0 0)} assume !(0 != ~b~0); {36904#false} is VALID [2022-04-28 12:44:11,080 INFO L272 TraceCheckUtils]: 178: Hoare triple {36904#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {36904#false} is VALID [2022-04-28 12:44:11,080 INFO L290 TraceCheckUtils]: 179: Hoare triple {36904#false} ~cond := #in~cond; {36904#false} is VALID [2022-04-28 12:44:11,080 INFO L290 TraceCheckUtils]: 180: Hoare triple {36904#false} assume 0 == ~cond; {36904#false} is VALID [2022-04-28 12:44:11,080 INFO L290 TraceCheckUtils]: 181: Hoare triple {36904#false} assume !false; {36904#false} is VALID [2022-04-28 12:44:11,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1286 backedges. 92 proven. 49 refuted. 0 times theorem prover too weak. 1145 trivial. 0 not checked. [2022-04-28 12:44:11,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:44:12,023 INFO L290 TraceCheckUtils]: 181: Hoare triple {36904#false} assume !false; {36904#false} is VALID [2022-04-28 12:44:12,023 INFO L290 TraceCheckUtils]: 180: Hoare triple {36904#false} assume 0 == ~cond; {36904#false} is VALID [2022-04-28 12:44:12,024 INFO L290 TraceCheckUtils]: 179: Hoare triple {36904#false} ~cond := #in~cond; {36904#false} is VALID [2022-04-28 12:44:12,024 INFO L272 TraceCheckUtils]: 178: Hoare triple {36904#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {36904#false} is VALID [2022-04-28 12:44:12,024 INFO L290 TraceCheckUtils]: 177: Hoare triple {37443#(< main_~b~0 0)} assume !(0 != ~b~0); {36904#false} is VALID [2022-04-28 12:44:12,024 INFO L290 TraceCheckUtils]: 176: Hoare triple {37443#(< main_~b~0 0)} assume !false; {37443#(< main_~b~0 0)} is VALID [2022-04-28 12:44:12,024 INFO L290 TraceCheckUtils]: 175: Hoare triple {37439#(< main_~c~0 0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {37443#(< main_~b~0 0)} is VALID [2022-04-28 12:44:12,026 INFO L290 TraceCheckUtils]: 174: Hoare triple {37285#(< main_~b~0 1)} assume !(~c~0 >= ~b~0); {37439#(< main_~c~0 0)} is VALID [2022-04-28 12:44:12,026 INFO L290 TraceCheckUtils]: 173: Hoare triple {37285#(< main_~b~0 1)} assume !false; {37285#(< main_~b~0 1)} is VALID [2022-04-28 12:44:12,026 INFO L290 TraceCheckUtils]: 172: Hoare triple {37285#(< main_~b~0 1)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {37285#(< main_~b~0 1)} is VALID [2022-04-28 12:44:12,026 INFO L290 TraceCheckUtils]: 171: Hoare triple {37285#(< main_~b~0 1)} assume !(~c~0 >= 2 * ~v~0); {37285#(< main_~b~0 1)} is VALID [2022-04-28 12:44:12,027 INFO L284 TraceCheckUtils]: 170: Hoare quadruple {36903#true} {37285#(< main_~b~0 1)} #108#return; {37285#(< main_~b~0 1)} is VALID [2022-04-28 12:44:12,027 INFO L290 TraceCheckUtils]: 169: Hoare triple {36903#true} assume true; {36903#true} is VALID [2022-04-28 12:44:12,027 INFO L290 TraceCheckUtils]: 168: Hoare triple {36903#true} assume !(0 == ~cond); {36903#true} is VALID [2022-04-28 12:44:12,027 INFO L290 TraceCheckUtils]: 167: Hoare triple {36903#true} ~cond := #in~cond; {36903#true} is VALID [2022-04-28 12:44:12,027 INFO L272 TraceCheckUtils]: 166: Hoare triple {37285#(< main_~b~0 1)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {36903#true} is VALID [2022-04-28 12:44:12,027 INFO L284 TraceCheckUtils]: 165: Hoare quadruple {36903#true} {37285#(< main_~b~0 1)} #106#return; {37285#(< main_~b~0 1)} is VALID [2022-04-28 12:44:12,027 INFO L290 TraceCheckUtils]: 164: Hoare triple {36903#true} assume true; {36903#true} is VALID [2022-04-28 12:44:12,028 INFO L290 TraceCheckUtils]: 163: Hoare triple {36903#true} assume !(0 == ~cond); {36903#true} is VALID [2022-04-28 12:44:12,028 INFO L290 TraceCheckUtils]: 162: Hoare triple {36903#true} ~cond := #in~cond; {36903#true} is VALID [2022-04-28 12:44:12,028 INFO L272 TraceCheckUtils]: 161: Hoare triple {37285#(< main_~b~0 1)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {36903#true} is VALID [2022-04-28 12:44:12,028 INFO L284 TraceCheckUtils]: 160: Hoare quadruple {36903#true} {37285#(< main_~b~0 1)} #104#return; {37285#(< main_~b~0 1)} is VALID [2022-04-28 12:44:12,028 INFO L290 TraceCheckUtils]: 159: Hoare triple {36903#true} assume true; {36903#true} is VALID [2022-04-28 12:44:12,028 INFO L290 TraceCheckUtils]: 158: Hoare triple {36903#true} assume !(0 == ~cond); {36903#true} is VALID [2022-04-28 12:44:12,028 INFO L290 TraceCheckUtils]: 157: Hoare triple {36903#true} ~cond := #in~cond; {36903#true} is VALID [2022-04-28 12:44:12,028 INFO L272 TraceCheckUtils]: 156: Hoare triple {37285#(< main_~b~0 1)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {36903#true} is VALID [2022-04-28 12:44:12,029 INFO L284 TraceCheckUtils]: 155: Hoare quadruple {36903#true} {37285#(< main_~b~0 1)} #102#return; {37285#(< main_~b~0 1)} is VALID [2022-04-28 12:44:12,029 INFO L290 TraceCheckUtils]: 154: Hoare triple {36903#true} assume true; {36903#true} is VALID [2022-04-28 12:44:12,029 INFO L290 TraceCheckUtils]: 153: Hoare triple {36903#true} assume !(0 == ~cond); {36903#true} is VALID [2022-04-28 12:44:12,029 INFO L290 TraceCheckUtils]: 152: Hoare triple {36903#true} ~cond := #in~cond; {36903#true} is VALID [2022-04-28 12:44:12,029 INFO L272 TraceCheckUtils]: 151: Hoare triple {37285#(< main_~b~0 1)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {36903#true} is VALID [2022-04-28 12:44:12,029 INFO L290 TraceCheckUtils]: 150: Hoare triple {37285#(< main_~b~0 1)} assume !false; {37285#(< main_~b~0 1)} is VALID [2022-04-28 12:44:12,029 INFO L290 TraceCheckUtils]: 149: Hoare triple {37285#(< main_~b~0 1)} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {37285#(< main_~b~0 1)} is VALID [2022-04-28 12:44:12,030 INFO L284 TraceCheckUtils]: 148: Hoare quadruple {36903#true} {37285#(< main_~b~0 1)} #108#return; {37285#(< main_~b~0 1)} is VALID [2022-04-28 12:44:12,030 INFO L290 TraceCheckUtils]: 147: Hoare triple {36903#true} assume true; {36903#true} is VALID [2022-04-28 12:44:12,030 INFO L290 TraceCheckUtils]: 146: Hoare triple {36903#true} assume !(0 == ~cond); {36903#true} is VALID [2022-04-28 12:44:12,030 INFO L290 TraceCheckUtils]: 145: Hoare triple {36903#true} ~cond := #in~cond; {36903#true} is VALID [2022-04-28 12:44:12,030 INFO L272 TraceCheckUtils]: 144: Hoare triple {37285#(< main_~b~0 1)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {36903#true} is VALID [2022-04-28 12:44:12,030 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {36903#true} {37285#(< main_~b~0 1)} #106#return; {37285#(< main_~b~0 1)} is VALID [2022-04-28 12:44:12,030 INFO L290 TraceCheckUtils]: 142: Hoare triple {36903#true} assume true; {36903#true} is VALID [2022-04-28 12:44:12,030 INFO L290 TraceCheckUtils]: 141: Hoare triple {36903#true} assume !(0 == ~cond); {36903#true} is VALID [2022-04-28 12:44:12,031 INFO L290 TraceCheckUtils]: 140: Hoare triple {36903#true} ~cond := #in~cond; {36903#true} is VALID [2022-04-28 12:44:12,031 INFO L272 TraceCheckUtils]: 139: Hoare triple {37285#(< main_~b~0 1)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {36903#true} is VALID [2022-04-28 12:44:12,031 INFO L284 TraceCheckUtils]: 138: Hoare quadruple {36903#true} {37285#(< main_~b~0 1)} #104#return; {37285#(< main_~b~0 1)} is VALID [2022-04-28 12:44:12,031 INFO L290 TraceCheckUtils]: 137: Hoare triple {36903#true} assume true; {36903#true} is VALID [2022-04-28 12:44:12,031 INFO L290 TraceCheckUtils]: 136: Hoare triple {36903#true} assume !(0 == ~cond); {36903#true} is VALID [2022-04-28 12:44:12,031 INFO L290 TraceCheckUtils]: 135: Hoare triple {36903#true} ~cond := #in~cond; {36903#true} is VALID [2022-04-28 12:44:12,031 INFO L272 TraceCheckUtils]: 134: Hoare triple {37285#(< main_~b~0 1)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {36903#true} is VALID [2022-04-28 12:44:12,032 INFO L284 TraceCheckUtils]: 133: Hoare quadruple {36903#true} {37285#(< main_~b~0 1)} #102#return; {37285#(< main_~b~0 1)} is VALID [2022-04-28 12:44:12,032 INFO L290 TraceCheckUtils]: 132: Hoare triple {36903#true} assume true; {36903#true} is VALID [2022-04-28 12:44:12,032 INFO L290 TraceCheckUtils]: 131: Hoare triple {36903#true} assume !(0 == ~cond); {36903#true} is VALID [2022-04-28 12:44:12,032 INFO L290 TraceCheckUtils]: 130: Hoare triple {36903#true} ~cond := #in~cond; {36903#true} is VALID [2022-04-28 12:44:12,032 INFO L272 TraceCheckUtils]: 129: Hoare triple {37285#(< main_~b~0 1)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {36903#true} is VALID [2022-04-28 12:44:12,044 INFO L290 TraceCheckUtils]: 128: Hoare triple {37285#(< main_~b~0 1)} assume !false; {37285#(< main_~b~0 1)} is VALID [2022-04-28 12:44:12,044 INFO L290 TraceCheckUtils]: 127: Hoare triple {37285#(< main_~b~0 1)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {37285#(< main_~b~0 1)} is VALID [2022-04-28 12:44:12,045 INFO L290 TraceCheckUtils]: 126: Hoare triple {37285#(< main_~b~0 1)} assume !false; {37285#(< main_~b~0 1)} is VALID [2022-04-28 12:44:12,045 INFO L290 TraceCheckUtils]: 125: Hoare triple {37285#(< main_~b~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {37285#(< main_~b~0 1)} is VALID [2022-04-28 12:44:12,045 INFO L290 TraceCheckUtils]: 124: Hoare triple {37285#(< main_~b~0 1)} assume !false; {37285#(< main_~b~0 1)} is VALID [2022-04-28 12:44:12,046 INFO L290 TraceCheckUtils]: 123: Hoare triple {37281#(< main_~c~0 1)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {37285#(< main_~b~0 1)} is VALID [2022-04-28 12:44:12,047 INFO L290 TraceCheckUtils]: 122: Hoare triple {37073#(<= main_~b~0 1)} assume !(~c~0 >= ~b~0); {37281#(< main_~c~0 1)} is VALID [2022-04-28 12:44:12,047 INFO L290 TraceCheckUtils]: 121: Hoare triple {37073#(<= main_~b~0 1)} assume !false; {37073#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:12,048 INFO L290 TraceCheckUtils]: 120: Hoare triple {37073#(<= main_~b~0 1)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {37073#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:12,048 INFO L290 TraceCheckUtils]: 119: Hoare triple {37073#(<= main_~b~0 1)} assume !(~c~0 >= 2 * ~v~0); {37073#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:12,048 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {36903#true} {37073#(<= main_~b~0 1)} #108#return; {37073#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:12,048 INFO L290 TraceCheckUtils]: 117: Hoare triple {36903#true} assume true; {36903#true} is VALID [2022-04-28 12:44:12,048 INFO L290 TraceCheckUtils]: 116: Hoare triple {36903#true} assume !(0 == ~cond); {36903#true} is VALID [2022-04-28 12:44:12,048 INFO L290 TraceCheckUtils]: 115: Hoare triple {36903#true} ~cond := #in~cond; {36903#true} is VALID [2022-04-28 12:44:12,048 INFO L272 TraceCheckUtils]: 114: Hoare triple {37073#(<= main_~b~0 1)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {36903#true} is VALID [2022-04-28 12:44:12,049 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {36903#true} {37073#(<= main_~b~0 1)} #106#return; {37073#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:12,049 INFO L290 TraceCheckUtils]: 112: Hoare triple {36903#true} assume true; {36903#true} is VALID [2022-04-28 12:44:12,049 INFO L290 TraceCheckUtils]: 111: Hoare triple {36903#true} assume !(0 == ~cond); {36903#true} is VALID [2022-04-28 12:44:12,049 INFO L290 TraceCheckUtils]: 110: Hoare triple {36903#true} ~cond := #in~cond; {36903#true} is VALID [2022-04-28 12:44:12,049 INFO L272 TraceCheckUtils]: 109: Hoare triple {37073#(<= main_~b~0 1)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {36903#true} is VALID [2022-04-28 12:44:12,050 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {36903#true} {37073#(<= main_~b~0 1)} #104#return; {37073#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:12,050 INFO L290 TraceCheckUtils]: 107: Hoare triple {36903#true} assume true; {36903#true} is VALID [2022-04-28 12:44:12,050 INFO L290 TraceCheckUtils]: 106: Hoare triple {36903#true} assume !(0 == ~cond); {36903#true} is VALID [2022-04-28 12:44:12,050 INFO L290 TraceCheckUtils]: 105: Hoare triple {36903#true} ~cond := #in~cond; {36903#true} is VALID [2022-04-28 12:44:12,050 INFO L272 TraceCheckUtils]: 104: Hoare triple {37073#(<= main_~b~0 1)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {36903#true} is VALID [2022-04-28 12:44:12,050 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {36903#true} {37073#(<= main_~b~0 1)} #102#return; {37073#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:12,050 INFO L290 TraceCheckUtils]: 102: Hoare triple {36903#true} assume true; {36903#true} is VALID [2022-04-28 12:44:12,050 INFO L290 TraceCheckUtils]: 101: Hoare triple {36903#true} assume !(0 == ~cond); {36903#true} is VALID [2022-04-28 12:44:12,050 INFO L290 TraceCheckUtils]: 100: Hoare triple {36903#true} ~cond := #in~cond; {36903#true} is VALID [2022-04-28 12:44:12,050 INFO L272 TraceCheckUtils]: 99: Hoare triple {37073#(<= main_~b~0 1)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {36903#true} is VALID [2022-04-28 12:44:12,051 INFO L290 TraceCheckUtils]: 98: Hoare triple {37073#(<= main_~b~0 1)} assume !false; {37073#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:12,051 INFO L290 TraceCheckUtils]: 97: Hoare triple {37073#(<= main_~b~0 1)} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {37073#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:12,051 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {36903#true} {37073#(<= main_~b~0 1)} #108#return; {37073#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:12,051 INFO L290 TraceCheckUtils]: 95: Hoare triple {36903#true} assume true; {36903#true} is VALID [2022-04-28 12:44:12,051 INFO L290 TraceCheckUtils]: 94: Hoare triple {36903#true} assume !(0 == ~cond); {36903#true} is VALID [2022-04-28 12:44:12,051 INFO L290 TraceCheckUtils]: 93: Hoare triple {36903#true} ~cond := #in~cond; {36903#true} is VALID [2022-04-28 12:44:12,052 INFO L272 TraceCheckUtils]: 92: Hoare triple {37073#(<= main_~b~0 1)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {36903#true} is VALID [2022-04-28 12:44:12,052 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {36903#true} {37073#(<= main_~b~0 1)} #106#return; {37073#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:12,052 INFO L290 TraceCheckUtils]: 90: Hoare triple {36903#true} assume true; {36903#true} is VALID [2022-04-28 12:44:12,052 INFO L290 TraceCheckUtils]: 89: Hoare triple {36903#true} assume !(0 == ~cond); {36903#true} is VALID [2022-04-28 12:44:12,052 INFO L290 TraceCheckUtils]: 88: Hoare triple {36903#true} ~cond := #in~cond; {36903#true} is VALID [2022-04-28 12:44:12,052 INFO L272 TraceCheckUtils]: 87: Hoare triple {37073#(<= main_~b~0 1)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {36903#true} is VALID [2022-04-28 12:44:12,053 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {36903#true} {37073#(<= main_~b~0 1)} #104#return; {37073#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:12,053 INFO L290 TraceCheckUtils]: 85: Hoare triple {36903#true} assume true; {36903#true} is VALID [2022-04-28 12:44:12,053 INFO L290 TraceCheckUtils]: 84: Hoare triple {36903#true} assume !(0 == ~cond); {36903#true} is VALID [2022-04-28 12:44:12,053 INFO L290 TraceCheckUtils]: 83: Hoare triple {36903#true} ~cond := #in~cond; {36903#true} is VALID [2022-04-28 12:44:12,053 INFO L272 TraceCheckUtils]: 82: Hoare triple {37073#(<= main_~b~0 1)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {36903#true} is VALID [2022-04-28 12:44:12,053 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {36903#true} {37073#(<= main_~b~0 1)} #102#return; {37073#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:12,053 INFO L290 TraceCheckUtils]: 80: Hoare triple {36903#true} assume true; {36903#true} is VALID [2022-04-28 12:44:12,053 INFO L290 TraceCheckUtils]: 79: Hoare triple {36903#true} assume !(0 == ~cond); {36903#true} is VALID [2022-04-28 12:44:12,053 INFO L290 TraceCheckUtils]: 78: Hoare triple {36903#true} ~cond := #in~cond; {36903#true} is VALID [2022-04-28 12:44:12,054 INFO L272 TraceCheckUtils]: 77: Hoare triple {37073#(<= main_~b~0 1)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {36903#true} is VALID [2022-04-28 12:44:12,054 INFO L290 TraceCheckUtils]: 76: Hoare triple {37073#(<= main_~b~0 1)} assume !false; {37073#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:12,054 INFO L290 TraceCheckUtils]: 75: Hoare triple {37073#(<= main_~b~0 1)} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {37073#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:12,054 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {36903#true} {37073#(<= main_~b~0 1)} #108#return; {37073#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:12,054 INFO L290 TraceCheckUtils]: 73: Hoare triple {36903#true} assume true; {36903#true} is VALID [2022-04-28 12:44:12,054 INFO L290 TraceCheckUtils]: 72: Hoare triple {36903#true} assume !(0 == ~cond); {36903#true} is VALID [2022-04-28 12:44:12,055 INFO L290 TraceCheckUtils]: 71: Hoare triple {36903#true} ~cond := #in~cond; {36903#true} is VALID [2022-04-28 12:44:12,055 INFO L272 TraceCheckUtils]: 70: Hoare triple {37073#(<= main_~b~0 1)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {36903#true} is VALID [2022-04-28 12:44:12,055 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {36903#true} {37073#(<= main_~b~0 1)} #106#return; {37073#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:12,055 INFO L290 TraceCheckUtils]: 68: Hoare triple {36903#true} assume true; {36903#true} is VALID [2022-04-28 12:44:12,055 INFO L290 TraceCheckUtils]: 67: Hoare triple {36903#true} assume !(0 == ~cond); {36903#true} is VALID [2022-04-28 12:44:12,055 INFO L290 TraceCheckUtils]: 66: Hoare triple {36903#true} ~cond := #in~cond; {36903#true} is VALID [2022-04-28 12:44:12,055 INFO L272 TraceCheckUtils]: 65: Hoare triple {37073#(<= main_~b~0 1)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {36903#true} is VALID [2022-04-28 12:44:12,056 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {36903#true} {37073#(<= main_~b~0 1)} #104#return; {37073#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:12,056 INFO L290 TraceCheckUtils]: 63: Hoare triple {36903#true} assume true; {36903#true} is VALID [2022-04-28 12:44:12,056 INFO L290 TraceCheckUtils]: 62: Hoare triple {36903#true} assume !(0 == ~cond); {36903#true} is VALID [2022-04-28 12:44:12,056 INFO L290 TraceCheckUtils]: 61: Hoare triple {36903#true} ~cond := #in~cond; {36903#true} is VALID [2022-04-28 12:44:12,056 INFO L272 TraceCheckUtils]: 60: Hoare triple {37073#(<= main_~b~0 1)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {36903#true} is VALID [2022-04-28 12:44:12,056 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {36903#true} {37073#(<= main_~b~0 1)} #102#return; {37073#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:12,056 INFO L290 TraceCheckUtils]: 58: Hoare triple {36903#true} assume true; {36903#true} is VALID [2022-04-28 12:44:12,056 INFO L290 TraceCheckUtils]: 57: Hoare triple {36903#true} assume !(0 == ~cond); {36903#true} is VALID [2022-04-28 12:44:12,057 INFO L290 TraceCheckUtils]: 56: Hoare triple {36903#true} ~cond := #in~cond; {36903#true} is VALID [2022-04-28 12:44:12,057 INFO L272 TraceCheckUtils]: 55: Hoare triple {37073#(<= main_~b~0 1)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {36903#true} is VALID [2022-04-28 12:44:12,057 INFO L290 TraceCheckUtils]: 54: Hoare triple {37073#(<= main_~b~0 1)} assume !false; {37073#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:12,057 INFO L290 TraceCheckUtils]: 53: Hoare triple {37846#(or (<= main_~b~0 1) (not (<= (* main_~v~0 2) main_~c~0)))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {37073#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:12,058 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {36903#true} {37846#(or (<= main_~b~0 1) (not (<= (* main_~v~0 2) main_~c~0)))} #108#return; {37846#(or (<= main_~b~0 1) (not (<= (* main_~v~0 2) main_~c~0)))} is VALID [2022-04-28 12:44:12,058 INFO L290 TraceCheckUtils]: 51: Hoare triple {36903#true} assume true; {36903#true} is VALID [2022-04-28 12:44:12,058 INFO L290 TraceCheckUtils]: 50: Hoare triple {36903#true} assume !(0 == ~cond); {36903#true} is VALID [2022-04-28 12:44:12,058 INFO L290 TraceCheckUtils]: 49: Hoare triple {36903#true} ~cond := #in~cond; {36903#true} is VALID [2022-04-28 12:44:12,058 INFO L272 TraceCheckUtils]: 48: Hoare triple {37846#(or (<= main_~b~0 1) (not (<= (* main_~v~0 2) main_~c~0)))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {36903#true} is VALID [2022-04-28 12:44:12,058 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {36903#true} {37846#(or (<= main_~b~0 1) (not (<= (* main_~v~0 2) main_~c~0)))} #106#return; {37846#(or (<= main_~b~0 1) (not (<= (* main_~v~0 2) main_~c~0)))} is VALID [2022-04-28 12:44:12,058 INFO L290 TraceCheckUtils]: 46: Hoare triple {36903#true} assume true; {36903#true} is VALID [2022-04-28 12:44:12,058 INFO L290 TraceCheckUtils]: 45: Hoare triple {36903#true} assume !(0 == ~cond); {36903#true} is VALID [2022-04-28 12:44:12,058 INFO L290 TraceCheckUtils]: 44: Hoare triple {36903#true} ~cond := #in~cond; {36903#true} is VALID [2022-04-28 12:44:12,059 INFO L272 TraceCheckUtils]: 43: Hoare triple {37846#(or (<= main_~b~0 1) (not (<= (* main_~v~0 2) main_~c~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {36903#true} is VALID [2022-04-28 12:44:12,059 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {36903#true} {37846#(or (<= main_~b~0 1) (not (<= (* main_~v~0 2) main_~c~0)))} #104#return; {37846#(or (<= main_~b~0 1) (not (<= (* main_~v~0 2) main_~c~0)))} is VALID [2022-04-28 12:44:12,059 INFO L290 TraceCheckUtils]: 41: Hoare triple {36903#true} assume true; {36903#true} is VALID [2022-04-28 12:44:12,059 INFO L290 TraceCheckUtils]: 40: Hoare triple {36903#true} assume !(0 == ~cond); {36903#true} is VALID [2022-04-28 12:44:12,059 INFO L290 TraceCheckUtils]: 39: Hoare triple {36903#true} ~cond := #in~cond; {36903#true} is VALID [2022-04-28 12:44:12,059 INFO L272 TraceCheckUtils]: 38: Hoare triple {37846#(or (<= main_~b~0 1) (not (<= (* main_~v~0 2) main_~c~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {36903#true} is VALID [2022-04-28 12:44:12,060 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {36903#true} {37846#(or (<= main_~b~0 1) (not (<= (* main_~v~0 2) main_~c~0)))} #102#return; {37846#(or (<= main_~b~0 1) (not (<= (* main_~v~0 2) main_~c~0)))} is VALID [2022-04-28 12:44:12,060 INFO L290 TraceCheckUtils]: 36: Hoare triple {36903#true} assume true; {36903#true} is VALID [2022-04-28 12:44:12,060 INFO L290 TraceCheckUtils]: 35: Hoare triple {36903#true} assume !(0 == ~cond); {36903#true} is VALID [2022-04-28 12:44:12,060 INFO L290 TraceCheckUtils]: 34: Hoare triple {36903#true} ~cond := #in~cond; {36903#true} is VALID [2022-04-28 12:44:12,060 INFO L272 TraceCheckUtils]: 33: Hoare triple {37846#(or (<= main_~b~0 1) (not (<= (* main_~v~0 2) main_~c~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {36903#true} is VALID [2022-04-28 12:44:12,060 INFO L290 TraceCheckUtils]: 32: Hoare triple {37846#(or (<= main_~b~0 1) (not (<= (* main_~v~0 2) main_~c~0)))} assume !false; {37846#(or (<= main_~b~0 1) (not (<= (* main_~v~0 2) main_~c~0)))} is VALID [2022-04-28 12:44:12,062 INFO L290 TraceCheckUtils]: 31: Hoare triple {37913#(<= (div main_~c~0 2) 1)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {37846#(or (<= main_~b~0 1) (not (<= (* main_~v~0 2) main_~c~0)))} is VALID [2022-04-28 12:44:12,063 INFO L290 TraceCheckUtils]: 30: Hoare triple {37913#(<= (div main_~c~0 2) 1)} assume !false; {37913#(<= (div main_~c~0 2) 1)} is VALID [2022-04-28 12:44:12,063 INFO L290 TraceCheckUtils]: 29: Hoare triple {37920#(<= (div (+ (- 1) (* (- 1) main_~a~0)) (- 2)) 2)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {37913#(<= (div main_~c~0 2) 1)} is VALID [2022-04-28 12:44:12,064 INFO L290 TraceCheckUtils]: 28: Hoare triple {37920#(<= (div (+ (- 1) (* (- 1) main_~a~0)) (- 2)) 2)} assume !false; {37920#(<= (div (+ (- 1) (* (- 1) main_~a~0)) (- 2)) 2)} is VALID [2022-04-28 12:44:12,064 INFO L290 TraceCheckUtils]: 27: Hoare triple {37927#(<= (div (+ (- 3) (* (- 1) main_~x~0)) (- 2)) 3)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {37920#(<= (div (+ (- 1) (* (- 1) main_~a~0)) (- 2)) 2)} is VALID [2022-04-28 12:44:12,065 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {36903#true} {37927#(<= (div (+ (- 3) (* (- 1) main_~x~0)) (- 2)) 3)} #100#return; {37927#(<= (div (+ (- 3) (* (- 1) main_~x~0)) (- 2)) 3)} is VALID [2022-04-28 12:44:12,065 INFO L290 TraceCheckUtils]: 25: Hoare triple {36903#true} assume true; {36903#true} is VALID [2022-04-28 12:44:12,065 INFO L290 TraceCheckUtils]: 24: Hoare triple {36903#true} assume !(0 == ~cond); {36903#true} is VALID [2022-04-28 12:44:12,065 INFO L290 TraceCheckUtils]: 23: Hoare triple {36903#true} ~cond := #in~cond; {36903#true} is VALID [2022-04-28 12:44:12,065 INFO L272 TraceCheckUtils]: 22: Hoare triple {37927#(<= (div (+ (- 3) (* (- 1) main_~x~0)) (- 2)) 3)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {36903#true} is VALID [2022-04-28 12:44:12,065 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {36903#true} {37927#(<= (div (+ (- 3) (* (- 1) main_~x~0)) (- 2)) 3)} #98#return; {37927#(<= (div (+ (- 3) (* (- 1) main_~x~0)) (- 2)) 3)} is VALID [2022-04-28 12:44:12,065 INFO L290 TraceCheckUtils]: 20: Hoare triple {36903#true} assume true; {36903#true} is VALID [2022-04-28 12:44:12,065 INFO L290 TraceCheckUtils]: 19: Hoare triple {36903#true} assume !(0 == ~cond); {36903#true} is VALID [2022-04-28 12:44:12,065 INFO L290 TraceCheckUtils]: 18: Hoare triple {36903#true} ~cond := #in~cond; {36903#true} is VALID [2022-04-28 12:44:12,065 INFO L272 TraceCheckUtils]: 17: Hoare triple {37927#(<= (div (+ (- 3) (* (- 1) main_~x~0)) (- 2)) 3)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {36903#true} is VALID [2022-04-28 12:44:12,066 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {36903#true} {37927#(<= (div (+ (- 3) (* (- 1) main_~x~0)) (- 2)) 3)} #96#return; {37927#(<= (div (+ (- 3) (* (- 1) main_~x~0)) (- 2)) 3)} is VALID [2022-04-28 12:44:12,066 INFO L290 TraceCheckUtils]: 15: Hoare triple {36903#true} assume true; {36903#true} is VALID [2022-04-28 12:44:12,066 INFO L290 TraceCheckUtils]: 14: Hoare triple {36903#true} assume !(0 == ~cond); {36903#true} is VALID [2022-04-28 12:44:12,066 INFO L290 TraceCheckUtils]: 13: Hoare triple {36903#true} ~cond := #in~cond; {36903#true} is VALID [2022-04-28 12:44:12,066 INFO L272 TraceCheckUtils]: 12: Hoare triple {37927#(<= (div (+ (- 3) (* (- 1) main_~x~0)) (- 2)) 3)} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {36903#true} is VALID [2022-04-28 12:44:12,066 INFO L290 TraceCheckUtils]: 11: Hoare triple {37927#(<= (div (+ (- 3) (* (- 1) main_~x~0)) (- 2)) 3)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {37927#(<= (div (+ (- 3) (* (- 1) main_~x~0)) (- 2)) 3)} is VALID [2022-04-28 12:44:12,067 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36933#(not (= |assume_abort_if_not_#in~cond| 0))} {36903#true} #94#return; {37927#(<= (div (+ (- 3) (* (- 1) main_~x~0)) (- 2)) 3)} is VALID [2022-04-28 12:44:12,067 INFO L290 TraceCheckUtils]: 9: Hoare triple {36933#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {36933#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:44:12,067 INFO L290 TraceCheckUtils]: 8: Hoare triple {37988#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {36933#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:44:12,068 INFO L290 TraceCheckUtils]: 7: Hoare triple {36903#true} ~cond := #in~cond; {37988#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-28 12:44:12,068 INFO L272 TraceCheckUtils]: 6: Hoare triple {36903#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {36903#true} is VALID [2022-04-28 12:44:12,068 INFO L290 TraceCheckUtils]: 5: Hoare triple {36903#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {36903#true} is VALID [2022-04-28 12:44:12,068 INFO L272 TraceCheckUtils]: 4: Hoare triple {36903#true} call #t~ret6 := main(); {36903#true} is VALID [2022-04-28 12:44:12,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36903#true} {36903#true} #112#return; {36903#true} is VALID [2022-04-28 12:44:12,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {36903#true} assume true; {36903#true} is VALID [2022-04-28 12:44:12,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {36903#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(11, 2);call #Ultimate.allocInit(12, 3); {36903#true} is VALID [2022-04-28 12:44:12,068 INFO L272 TraceCheckUtils]: 0: Hoare triple {36903#true} call ULTIMATE.init(); {36903#true} is VALID [2022-04-28 12:44:12,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1286 backedges. 122 proven. 19 refuted. 0 times theorem prover too weak. 1145 trivial. 0 not checked. [2022-04-28 12:44:12,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:44:12,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405174462] [2022-04-28 12:44:12,069 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:44:12,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756197158] [2022-04-28 12:44:12,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756197158] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:44:12,069 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:44:12,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2022-04-28 12:44:12,069 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:44:12,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [127669250] [2022-04-28 12:44:12,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [127669250] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:44:12,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:44:12,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 12:44:12,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420902177] [2022-04-28 12:44:12,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:44:12,071 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 182 [2022-04-28 12:44:12,071 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:44:12,071 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 12:44:12,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:44:12,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 12:44:12,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:44:12,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 12:44:12,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-04-28 12:44:12,141 INFO L87 Difference]: Start difference. First operand 147 states and 177 transitions. Second operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 12:44:13,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:44:13,773 INFO L93 Difference]: Finished difference Result 153 states and 182 transitions. [2022-04-28 12:44:13,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 12:44:13,773 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 182 [2022-04-28 12:44:13,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:44:13,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 12:44:13,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 91 transitions. [2022-04-28 12:44:13,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 12:44:13,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 91 transitions. [2022-04-28 12:44:13,775 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 91 transitions. [2022-04-28 12:44:13,855 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:44:13,857 INFO L225 Difference]: With dead ends: 153 [2022-04-28 12:44:13,857 INFO L226 Difference]: Without dead ends: 146 [2022-04-28 12:44:13,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 345 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=209, Invalid=661, Unknown=0, NotChecked=0, Total=870 [2022-04-28 12:44:13,858 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 39 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 12:44:13,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 295 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 12:44:13,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-04-28 12:44:14,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 140. [2022-04-28 12:44:14,400 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:44:14,400 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand has 140 states, 83 states have (on average 1.036144578313253) internal successors, (86), 83 states have internal predecessors, (86), 42 states have call successors, (42), 15 states have call predecessors, (42), 14 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-28 12:44:14,400 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand has 140 states, 83 states have (on average 1.036144578313253) internal successors, (86), 83 states have internal predecessors, (86), 42 states have call successors, (42), 15 states have call predecessors, (42), 14 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-28 12:44:14,400 INFO L87 Difference]: Start difference. First operand 146 states. Second operand has 140 states, 83 states have (on average 1.036144578313253) internal successors, (86), 83 states have internal predecessors, (86), 42 states have call successors, (42), 15 states have call predecessors, (42), 14 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-28 12:44:14,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:44:14,402 INFO L93 Difference]: Finished difference Result 146 states and 175 transitions. [2022-04-28 12:44:14,402 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 175 transitions. [2022-04-28 12:44:14,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:44:14,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:44:14,403 INFO L74 IsIncluded]: Start isIncluded. First operand has 140 states, 83 states have (on average 1.036144578313253) internal successors, (86), 83 states have internal predecessors, (86), 42 states have call successors, (42), 15 states have call predecessors, (42), 14 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) Second operand 146 states. [2022-04-28 12:44:14,403 INFO L87 Difference]: Start difference. First operand has 140 states, 83 states have (on average 1.036144578313253) internal successors, (86), 83 states have internal predecessors, (86), 42 states have call successors, (42), 15 states have call predecessors, (42), 14 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) Second operand 146 states. [2022-04-28 12:44:14,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:44:14,406 INFO L93 Difference]: Finished difference Result 146 states and 175 transitions. [2022-04-28 12:44:14,406 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 175 transitions. [2022-04-28 12:44:14,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:44:14,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:44:14,408 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:44:14,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:44:14,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 83 states have (on average 1.036144578313253) internal successors, (86), 83 states have internal predecessors, (86), 42 states have call successors, (42), 15 states have call predecessors, (42), 14 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-28 12:44:14,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 169 transitions. [2022-04-28 12:44:14,410 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 169 transitions. Word has length 182 [2022-04-28 12:44:14,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:44:14,410 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 169 transitions. [2022-04-28 12:44:14,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-28 12:44:14,410 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 140 states and 169 transitions. [2022-04-28 12:44:14,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:44:14,802 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 169 transitions. [2022-04-28 12:44:14,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-04-28 12:44:14,803 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:44:14,803 INFO L195 NwaCegarLoop]: trace histogram [25, 24, 24, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:44:14,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-28 12:44:15,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:44:15,004 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:44:15,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:44:15,004 INFO L85 PathProgramCache]: Analyzing trace with hash 2054277986, now seen corresponding path program 3 times [2022-04-28 12:44:15,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:44:15,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [117938849] [2022-04-28 12:44:15,005 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:44:15,005 INFO L85 PathProgramCache]: Analyzing trace with hash 2054277986, now seen corresponding path program 4 times [2022-04-28 12:44:15,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:44:15,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733099428] [2022-04-28 12:44:15,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:44:15,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:44:15,022 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:44:15,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1867504296] [2022-04-28 12:44:15,022 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 12:44:15,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:44:15,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:44:15,023 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:44:15,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-28 12:44:15,087 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 12:44:15,087 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:44:15,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 12:44:15,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:44:15,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:44:27,791 INFO L272 TraceCheckUtils]: 0: Hoare triple {38914#true} call ULTIMATE.init(); {38914#true} is VALID [2022-04-28 12:44:27,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {38914#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(11, 2);call #Ultimate.allocInit(12, 3); {38914#true} is VALID [2022-04-28 12:44:27,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {38914#true} assume true; {38914#true} is VALID [2022-04-28 12:44:27,792 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38914#true} {38914#true} #112#return; {38914#true} is VALID [2022-04-28 12:44:27,792 INFO L272 TraceCheckUtils]: 4: Hoare triple {38914#true} call #t~ret6 := main(); {38914#true} is VALID [2022-04-28 12:44:27,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {38914#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {38914#true} is VALID [2022-04-28 12:44:27,792 INFO L272 TraceCheckUtils]: 6: Hoare triple {38914#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {38914#true} is VALID [2022-04-28 12:44:27,792 INFO L290 TraceCheckUtils]: 7: Hoare triple {38914#true} ~cond := #in~cond; {38940#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 12:44:27,792 INFO L290 TraceCheckUtils]: 8: Hoare triple {38940#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {38944#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:44:27,793 INFO L290 TraceCheckUtils]: 9: Hoare triple {38944#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {38944#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:44:27,793 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {38944#(not (= |assume_abort_if_not_#in~cond| 0))} {38914#true} #94#return; {38951#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 12:44:27,793 INFO L290 TraceCheckUtils]: 11: Hoare triple {38951#(and (<= 0 main_~x~0) (<= main_~x~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {38951#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 12:44:27,794 INFO L272 TraceCheckUtils]: 12: Hoare triple {38951#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {38914#true} is VALID [2022-04-28 12:44:27,794 INFO L290 TraceCheckUtils]: 13: Hoare triple {38914#true} ~cond := #in~cond; {38914#true} is VALID [2022-04-28 12:44:27,794 INFO L290 TraceCheckUtils]: 14: Hoare triple {38914#true} assume !(0 == ~cond); {38914#true} is VALID [2022-04-28 12:44:27,794 INFO L290 TraceCheckUtils]: 15: Hoare triple {38914#true} assume true; {38914#true} is VALID [2022-04-28 12:44:27,794 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {38914#true} {38951#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #96#return; {38951#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 12:44:27,794 INFO L272 TraceCheckUtils]: 17: Hoare triple {38951#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {38914#true} is VALID [2022-04-28 12:44:27,794 INFO L290 TraceCheckUtils]: 18: Hoare triple {38914#true} ~cond := #in~cond; {38914#true} is VALID [2022-04-28 12:44:27,794 INFO L290 TraceCheckUtils]: 19: Hoare triple {38914#true} assume !(0 == ~cond); {38914#true} is VALID [2022-04-28 12:44:27,794 INFO L290 TraceCheckUtils]: 20: Hoare triple {38914#true} assume true; {38914#true} is VALID [2022-04-28 12:44:27,795 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {38914#true} {38951#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #98#return; {38951#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 12:44:27,795 INFO L272 TraceCheckUtils]: 22: Hoare triple {38951#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {38914#true} is VALID [2022-04-28 12:44:27,795 INFO L290 TraceCheckUtils]: 23: Hoare triple {38914#true} ~cond := #in~cond; {38914#true} is VALID [2022-04-28 12:44:27,795 INFO L290 TraceCheckUtils]: 24: Hoare triple {38914#true} assume !(0 == ~cond); {38914#true} is VALID [2022-04-28 12:44:27,795 INFO L290 TraceCheckUtils]: 25: Hoare triple {38914#true} assume true; {38914#true} is VALID [2022-04-28 12:44:27,795 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {38914#true} {38951#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #100#return; {38951#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 12:44:27,795 INFO L290 TraceCheckUtils]: 27: Hoare triple {38951#(and (<= 0 main_~x~0) (<= main_~x~0 2))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {39003#(<= main_~a~0 2)} is VALID [2022-04-28 12:44:27,796 INFO L290 TraceCheckUtils]: 28: Hoare triple {39003#(<= main_~a~0 2)} assume !false; {39003#(<= main_~a~0 2)} is VALID [2022-04-28 12:44:27,796 INFO L290 TraceCheckUtils]: 29: Hoare triple {39003#(<= main_~a~0 2)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {39010#(<= main_~c~0 2)} is VALID [2022-04-28 12:44:27,796 INFO L290 TraceCheckUtils]: 30: Hoare triple {39010#(<= main_~c~0 2)} assume !false; {39010#(<= main_~c~0 2)} is VALID [2022-04-28 12:44:27,797 INFO L290 TraceCheckUtils]: 31: Hoare triple {39010#(<= main_~c~0 2)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {39017#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} is VALID [2022-04-28 12:44:27,797 INFO L290 TraceCheckUtils]: 32: Hoare triple {39017#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} assume !false; {39017#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} is VALID [2022-04-28 12:44:27,797 INFO L272 TraceCheckUtils]: 33: Hoare triple {39017#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {38914#true} is VALID [2022-04-28 12:44:27,797 INFO L290 TraceCheckUtils]: 34: Hoare triple {38914#true} ~cond := #in~cond; {38914#true} is VALID [2022-04-28 12:44:27,797 INFO L290 TraceCheckUtils]: 35: Hoare triple {38914#true} assume !(0 == ~cond); {38914#true} is VALID [2022-04-28 12:44:27,797 INFO L290 TraceCheckUtils]: 36: Hoare triple {38914#true} assume true; {38914#true} is VALID [2022-04-28 12:44:27,798 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {38914#true} {39017#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} #102#return; {39017#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} is VALID [2022-04-28 12:44:27,798 INFO L272 TraceCheckUtils]: 38: Hoare triple {39017#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {38914#true} is VALID [2022-04-28 12:44:27,798 INFO L290 TraceCheckUtils]: 39: Hoare triple {38914#true} ~cond := #in~cond; {38914#true} is VALID [2022-04-28 12:44:27,798 INFO L290 TraceCheckUtils]: 40: Hoare triple {38914#true} assume !(0 == ~cond); {38914#true} is VALID [2022-04-28 12:44:27,798 INFO L290 TraceCheckUtils]: 41: Hoare triple {38914#true} assume true; {38914#true} is VALID [2022-04-28 12:44:27,798 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {38914#true} {39017#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} #104#return; {39017#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} is VALID [2022-04-28 12:44:27,798 INFO L272 TraceCheckUtils]: 43: Hoare triple {39017#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {38914#true} is VALID [2022-04-28 12:44:27,798 INFO L290 TraceCheckUtils]: 44: Hoare triple {38914#true} ~cond := #in~cond; {38914#true} is VALID [2022-04-28 12:44:27,798 INFO L290 TraceCheckUtils]: 45: Hoare triple {38914#true} assume !(0 == ~cond); {38914#true} is VALID [2022-04-28 12:44:27,799 INFO L290 TraceCheckUtils]: 46: Hoare triple {38914#true} assume true; {38914#true} is VALID [2022-04-28 12:44:27,799 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {38914#true} {39017#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} #106#return; {39017#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} is VALID [2022-04-28 12:44:27,799 INFO L272 TraceCheckUtils]: 48: Hoare triple {39017#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {38914#true} is VALID [2022-04-28 12:44:27,799 INFO L290 TraceCheckUtils]: 49: Hoare triple {38914#true} ~cond := #in~cond; {38914#true} is VALID [2022-04-28 12:44:27,799 INFO L290 TraceCheckUtils]: 50: Hoare triple {38914#true} assume !(0 == ~cond); {38914#true} is VALID [2022-04-28 12:44:27,799 INFO L290 TraceCheckUtils]: 51: Hoare triple {38914#true} assume true; {38914#true} is VALID [2022-04-28 12:44:27,800 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {38914#true} {39017#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} #108#return; {39017#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} is VALID [2022-04-28 12:44:27,800 INFO L290 TraceCheckUtils]: 53: Hoare triple {39017#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {39084#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} is VALID [2022-04-28 12:44:27,801 INFO L290 TraceCheckUtils]: 54: Hoare triple {39084#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} assume !false; {39084#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} is VALID [2022-04-28 12:44:27,801 INFO L272 TraceCheckUtils]: 55: Hoare triple {39084#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {38914#true} is VALID [2022-04-28 12:44:27,801 INFO L290 TraceCheckUtils]: 56: Hoare triple {38914#true} ~cond := #in~cond; {38914#true} is VALID [2022-04-28 12:44:27,801 INFO L290 TraceCheckUtils]: 57: Hoare triple {38914#true} assume !(0 == ~cond); {38914#true} is VALID [2022-04-28 12:44:27,801 INFO L290 TraceCheckUtils]: 58: Hoare triple {38914#true} assume true; {38914#true} is VALID [2022-04-28 12:44:27,801 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {38914#true} {39084#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} #102#return; {39084#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} is VALID [2022-04-28 12:44:27,801 INFO L272 TraceCheckUtils]: 60: Hoare triple {39084#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {38914#true} is VALID [2022-04-28 12:44:27,802 INFO L290 TraceCheckUtils]: 61: Hoare triple {38914#true} ~cond := #in~cond; {38914#true} is VALID [2022-04-28 12:44:27,802 INFO L290 TraceCheckUtils]: 62: Hoare triple {38914#true} assume !(0 == ~cond); {38914#true} is VALID [2022-04-28 12:44:27,802 INFO L290 TraceCheckUtils]: 63: Hoare triple {38914#true} assume true; {38914#true} is VALID [2022-04-28 12:44:27,802 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {38914#true} {39084#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} #104#return; {39084#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} is VALID [2022-04-28 12:44:27,802 INFO L272 TraceCheckUtils]: 65: Hoare triple {39084#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {38914#true} is VALID [2022-04-28 12:44:27,802 INFO L290 TraceCheckUtils]: 66: Hoare triple {38914#true} ~cond := #in~cond; {38914#true} is VALID [2022-04-28 12:44:27,802 INFO L290 TraceCheckUtils]: 67: Hoare triple {38914#true} assume !(0 == ~cond); {38914#true} is VALID [2022-04-28 12:44:27,802 INFO L290 TraceCheckUtils]: 68: Hoare triple {38914#true} assume true; {38914#true} is VALID [2022-04-28 12:44:27,803 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {38914#true} {39084#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} #106#return; {39084#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} is VALID [2022-04-28 12:44:27,803 INFO L272 TraceCheckUtils]: 70: Hoare triple {39084#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {38914#true} is VALID [2022-04-28 12:44:27,803 INFO L290 TraceCheckUtils]: 71: Hoare triple {38914#true} ~cond := #in~cond; {38914#true} is VALID [2022-04-28 12:44:27,803 INFO L290 TraceCheckUtils]: 72: Hoare triple {38914#true} assume !(0 == ~cond); {38914#true} is VALID [2022-04-28 12:44:27,803 INFO L290 TraceCheckUtils]: 73: Hoare triple {38914#true} assume true; {38914#true} is VALID [2022-04-28 12:44:27,803 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {38914#true} {39084#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} #108#return; {39084#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} is VALID [2022-04-28 12:44:27,804 INFO L290 TraceCheckUtils]: 75: Hoare triple {39084#(and (<= main_~c~0 2) (<= main_~b~0 (div main_~v~0 2)))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {39151#(and (<= main_~b~0 (div (div main_~v~0 2) 2)) (<= main_~c~0 2))} is VALID [2022-04-28 12:44:27,804 INFO L290 TraceCheckUtils]: 76: Hoare triple {39151#(and (<= main_~b~0 (div (div main_~v~0 2) 2)) (<= main_~c~0 2))} assume !false; {39151#(and (<= main_~b~0 (div (div main_~v~0 2) 2)) (<= main_~c~0 2))} is VALID [2022-04-28 12:44:27,805 INFO L272 TraceCheckUtils]: 77: Hoare triple {39151#(and (<= main_~b~0 (div (div main_~v~0 2) 2)) (<= main_~c~0 2))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {38914#true} is VALID [2022-04-28 12:44:27,805 INFO L290 TraceCheckUtils]: 78: Hoare triple {38914#true} ~cond := #in~cond; {38914#true} is VALID [2022-04-28 12:44:27,805 INFO L290 TraceCheckUtils]: 79: Hoare triple {38914#true} assume !(0 == ~cond); {38914#true} is VALID [2022-04-28 12:44:27,805 INFO L290 TraceCheckUtils]: 80: Hoare triple {38914#true} assume true; {38914#true} is VALID [2022-04-28 12:44:27,805 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {38914#true} {39151#(and (<= main_~b~0 (div (div main_~v~0 2) 2)) (<= main_~c~0 2))} #102#return; {39151#(and (<= main_~b~0 (div (div main_~v~0 2) 2)) (<= main_~c~0 2))} is VALID [2022-04-28 12:44:27,805 INFO L272 TraceCheckUtils]: 82: Hoare triple {39151#(and (<= main_~b~0 (div (div main_~v~0 2) 2)) (<= main_~c~0 2))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {38914#true} is VALID [2022-04-28 12:44:27,805 INFO L290 TraceCheckUtils]: 83: Hoare triple {38914#true} ~cond := #in~cond; {38914#true} is VALID [2022-04-28 12:44:27,805 INFO L290 TraceCheckUtils]: 84: Hoare triple {38914#true} assume !(0 == ~cond); {38914#true} is VALID [2022-04-28 12:44:27,805 INFO L290 TraceCheckUtils]: 85: Hoare triple {38914#true} assume true; {38914#true} is VALID [2022-04-28 12:44:27,806 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {38914#true} {39151#(and (<= main_~b~0 (div (div main_~v~0 2) 2)) (<= main_~c~0 2))} #104#return; {39151#(and (<= main_~b~0 (div (div main_~v~0 2) 2)) (<= main_~c~0 2))} is VALID [2022-04-28 12:44:27,806 INFO L272 TraceCheckUtils]: 87: Hoare triple {39151#(and (<= main_~b~0 (div (div main_~v~0 2) 2)) (<= main_~c~0 2))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {38914#true} is VALID [2022-04-28 12:44:27,806 INFO L290 TraceCheckUtils]: 88: Hoare triple {38914#true} ~cond := #in~cond; {38914#true} is VALID [2022-04-28 12:44:27,806 INFO L290 TraceCheckUtils]: 89: Hoare triple {38914#true} assume !(0 == ~cond); {38914#true} is VALID [2022-04-28 12:44:27,806 INFO L290 TraceCheckUtils]: 90: Hoare triple {38914#true} assume true; {38914#true} is VALID [2022-04-28 12:44:27,807 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {38914#true} {39151#(and (<= main_~b~0 (div (div main_~v~0 2) 2)) (<= main_~c~0 2))} #106#return; {39151#(and (<= main_~b~0 (div (div main_~v~0 2) 2)) (<= main_~c~0 2))} is VALID [2022-04-28 12:44:27,807 INFO L272 TraceCheckUtils]: 92: Hoare triple {39151#(and (<= main_~b~0 (div (div main_~v~0 2) 2)) (<= main_~c~0 2))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {38914#true} is VALID [2022-04-28 12:44:27,807 INFO L290 TraceCheckUtils]: 93: Hoare triple {38914#true} ~cond := #in~cond; {38914#true} is VALID [2022-04-28 12:44:27,807 INFO L290 TraceCheckUtils]: 94: Hoare triple {38914#true} assume !(0 == ~cond); {38914#true} is VALID [2022-04-28 12:44:27,807 INFO L290 TraceCheckUtils]: 95: Hoare triple {38914#true} assume true; {38914#true} is VALID [2022-04-28 12:44:27,807 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {38914#true} {39151#(and (<= main_~b~0 (div (div main_~v~0 2) 2)) (<= main_~c~0 2))} #108#return; {39151#(and (<= main_~b~0 (div (div main_~v~0 2) 2)) (<= main_~c~0 2))} is VALID [2022-04-28 12:44:27,808 INFO L290 TraceCheckUtils]: 97: Hoare triple {39151#(and (<= main_~b~0 (div (div main_~v~0 2) 2)) (<= main_~c~0 2))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {39218#(and (<= main_~c~0 2) (<= main_~b~0 (div (div (div main_~v~0 2) 2) 2)))} is VALID [2022-04-28 12:44:27,810 INFO L290 TraceCheckUtils]: 98: Hoare triple {39218#(and (<= main_~c~0 2) (<= main_~b~0 (div (div (div main_~v~0 2) 2) 2)))} assume !false; {39218#(and (<= main_~c~0 2) (<= main_~b~0 (div (div (div main_~v~0 2) 2) 2)))} is VALID [2022-04-28 12:44:27,810 INFO L272 TraceCheckUtils]: 99: Hoare triple {39218#(and (<= main_~c~0 2) (<= main_~b~0 (div (div (div main_~v~0 2) 2) 2)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {38914#true} is VALID [2022-04-28 12:44:27,810 INFO L290 TraceCheckUtils]: 100: Hoare triple {38914#true} ~cond := #in~cond; {38914#true} is VALID [2022-04-28 12:44:27,810 INFO L290 TraceCheckUtils]: 101: Hoare triple {38914#true} assume !(0 == ~cond); {38914#true} is VALID [2022-04-28 12:44:27,810 INFO L290 TraceCheckUtils]: 102: Hoare triple {38914#true} assume true; {38914#true} is VALID [2022-04-28 12:44:27,810 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {38914#true} {39218#(and (<= main_~c~0 2) (<= main_~b~0 (div (div (div main_~v~0 2) 2) 2)))} #102#return; {39218#(and (<= main_~c~0 2) (<= main_~b~0 (div (div (div main_~v~0 2) 2) 2)))} is VALID [2022-04-28 12:44:27,811 INFO L272 TraceCheckUtils]: 104: Hoare triple {39218#(and (<= main_~c~0 2) (<= main_~b~0 (div (div (div main_~v~0 2) 2) 2)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {38914#true} is VALID [2022-04-28 12:44:27,811 INFO L290 TraceCheckUtils]: 105: Hoare triple {38914#true} ~cond := #in~cond; {38914#true} is VALID [2022-04-28 12:44:27,811 INFO L290 TraceCheckUtils]: 106: Hoare triple {38914#true} assume !(0 == ~cond); {38914#true} is VALID [2022-04-28 12:44:27,811 INFO L290 TraceCheckUtils]: 107: Hoare triple {38914#true} assume true; {38914#true} is VALID [2022-04-28 12:44:27,811 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {38914#true} {39218#(and (<= main_~c~0 2) (<= main_~b~0 (div (div (div main_~v~0 2) 2) 2)))} #104#return; {39218#(and (<= main_~c~0 2) (<= main_~b~0 (div (div (div main_~v~0 2) 2) 2)))} is VALID [2022-04-28 12:44:27,811 INFO L272 TraceCheckUtils]: 109: Hoare triple {39218#(and (<= main_~c~0 2) (<= main_~b~0 (div (div (div main_~v~0 2) 2) 2)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {38914#true} is VALID [2022-04-28 12:44:27,811 INFO L290 TraceCheckUtils]: 110: Hoare triple {38914#true} ~cond := #in~cond; {38914#true} is VALID [2022-04-28 12:44:27,811 INFO L290 TraceCheckUtils]: 111: Hoare triple {38914#true} assume !(0 == ~cond); {38914#true} is VALID [2022-04-28 12:44:27,811 INFO L290 TraceCheckUtils]: 112: Hoare triple {38914#true} assume true; {38914#true} is VALID [2022-04-28 12:44:27,812 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {38914#true} {39218#(and (<= main_~c~0 2) (<= main_~b~0 (div (div (div main_~v~0 2) 2) 2)))} #106#return; {39218#(and (<= main_~c~0 2) (<= main_~b~0 (div (div (div main_~v~0 2) 2) 2)))} is VALID [2022-04-28 12:44:27,812 INFO L272 TraceCheckUtils]: 114: Hoare triple {39218#(and (<= main_~c~0 2) (<= main_~b~0 (div (div (div main_~v~0 2) 2) 2)))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {38914#true} is VALID [2022-04-28 12:44:27,812 INFO L290 TraceCheckUtils]: 115: Hoare triple {38914#true} ~cond := #in~cond; {38914#true} is VALID [2022-04-28 12:44:27,812 INFO L290 TraceCheckUtils]: 116: Hoare triple {38914#true} assume !(0 == ~cond); {38914#true} is VALID [2022-04-28 12:44:27,812 INFO L290 TraceCheckUtils]: 117: Hoare triple {38914#true} assume true; {38914#true} is VALID [2022-04-28 12:44:27,812 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {38914#true} {39218#(and (<= main_~c~0 2) (<= main_~b~0 (div (div (div main_~v~0 2) 2) 2)))} #108#return; {39218#(and (<= main_~c~0 2) (<= main_~b~0 (div (div (div main_~v~0 2) 2) 2)))} is VALID [2022-04-28 12:44:27,813 INFO L290 TraceCheckUtils]: 119: Hoare triple {39218#(and (<= main_~c~0 2) (<= main_~b~0 (div (div (div main_~v~0 2) 2) 2)))} assume !(~c~0 >= 2 * ~v~0); {39218#(and (<= main_~c~0 2) (<= main_~b~0 (div (div (div main_~v~0 2) 2) 2)))} is VALID [2022-04-28 12:44:27,814 INFO L290 TraceCheckUtils]: 120: Hoare triple {39218#(and (<= main_~c~0 2) (<= main_~b~0 (div (div (div main_~v~0 2) 2) 2)))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {39288#(<= main_~b~0 (div (div (div (+ (* (- 1) main_~c~0) 2) 2) 2) 2))} is VALID [2022-04-28 12:44:27,814 INFO L290 TraceCheckUtils]: 121: Hoare triple {39288#(<= main_~b~0 (div (div (div (+ (* (- 1) main_~c~0) 2) 2) 2) 2))} assume !false; {39288#(<= main_~b~0 (div (div (div (+ (* (- 1) main_~c~0) 2) 2) 2) 2))} is VALID [2022-04-28 12:44:27,814 INFO L290 TraceCheckUtils]: 122: Hoare triple {39288#(<= main_~b~0 (div (div (div (+ (* (- 1) main_~c~0) 2) 2) 2) 2))} assume !(~c~0 >= ~b~0); {39295#(and (<= main_~b~0 (div (div (div (+ (* (- 1) main_~c~0) 2) 2) 2) 2)) (not (<= main_~b~0 main_~c~0)))} is VALID [2022-04-28 12:44:28,050 INFO L290 TraceCheckUtils]: 123: Hoare triple {39295#(and (<= main_~b~0 (div (div (div (+ (* (- 1) main_~c~0) 2) 2) 2) 2)) (not (<= main_~b~0 main_~c~0)))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {39299#(and (< main_~b~0 main_~a~0) (exists ((aux_div_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (<= (+ main_~b~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2) (< aux_mod_aux_div_main_~c~0_33_28 2) (< main_~b~0 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< 1 (+ main_~a~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< aux_mod_aux_div_aux_div_main_~c~0_33_28_39 2) (<= 0 aux_mod_aux_div_aux_div_main_~c~0_33_28_39) (< 1 (+ (* 9 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))))))} is VALID [2022-04-28 12:44:28,053 INFO L290 TraceCheckUtils]: 124: Hoare triple {39299#(and (< main_~b~0 main_~a~0) (exists ((aux_div_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (<= (+ main_~b~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2) (< aux_mod_aux_div_main_~c~0_33_28 2) (< main_~b~0 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< 1 (+ main_~a~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< aux_mod_aux_div_aux_div_main_~c~0_33_28_39 2) (<= 0 aux_mod_aux_div_aux_div_main_~c~0_33_28_39) (< 1 (+ (* 9 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))))))} assume !false; {39299#(and (< main_~b~0 main_~a~0) (exists ((aux_div_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (<= (+ main_~b~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2) (< aux_mod_aux_div_main_~c~0_33_28 2) (< main_~b~0 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< 1 (+ main_~a~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< aux_mod_aux_div_aux_div_main_~c~0_33_28_39 2) (<= 0 aux_mod_aux_div_aux_div_main_~c~0_33_28_39) (< 1 (+ (* 9 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))))))} is VALID [2022-04-28 12:44:28,055 INFO L290 TraceCheckUtils]: 125: Hoare triple {39299#(and (< main_~b~0 main_~a~0) (exists ((aux_div_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (<= (+ main_~b~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2) (< aux_mod_aux_div_main_~c~0_33_28 2) (< main_~b~0 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< 1 (+ main_~a~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (< aux_mod_aux_div_aux_div_main_~c~0_33_28_39 2) (<= 0 aux_mod_aux_div_aux_div_main_~c~0_33_28_39) (< 1 (+ (* 9 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))))))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {39306#(and (exists ((aux_div_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (<= (+ main_~b~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2) (< aux_mod_aux_div_main_~c~0_33_28 2) (< main_~b~0 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< aux_mod_aux_div_aux_div_main_~c~0_33_28_39 2) (< 1 (+ main_~c~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (<= 0 aux_mod_aux_div_aux_div_main_~c~0_33_28_39) (< 1 (+ (* 9 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))))) (< main_~b~0 main_~c~0))} is VALID [2022-04-28 12:44:28,056 INFO L290 TraceCheckUtils]: 126: Hoare triple {39306#(and (exists ((aux_div_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (<= (+ main_~b~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2) (< aux_mod_aux_div_main_~c~0_33_28 2) (< main_~b~0 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< aux_mod_aux_div_aux_div_main_~c~0_33_28_39 2) (< 1 (+ main_~c~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (<= 0 aux_mod_aux_div_aux_div_main_~c~0_33_28_39) (< 1 (+ (* 9 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))))) (< main_~b~0 main_~c~0))} assume !false; {39306#(and (exists ((aux_div_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (<= (+ main_~b~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2) (< aux_mod_aux_div_main_~c~0_33_28 2) (< main_~b~0 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< aux_mod_aux_div_aux_div_main_~c~0_33_28_39 2) (< 1 (+ main_~c~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (<= 0 aux_mod_aux_div_aux_div_main_~c~0_33_28_39) (< 1 (+ (* 9 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))))) (< main_~b~0 main_~c~0))} is VALID [2022-04-28 12:44:28,058 INFO L290 TraceCheckUtils]: 127: Hoare triple {39306#(and (exists ((aux_div_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (<= (+ main_~b~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2) (< aux_mod_aux_div_main_~c~0_33_28 2) (< main_~b~0 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< aux_mod_aux_div_aux_div_main_~c~0_33_28_39 2) (< 1 (+ main_~c~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (<= 0 aux_mod_aux_div_aux_div_main_~c~0_33_28_39) (< 1 (+ (* 9 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))))) (< main_~b~0 main_~c~0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {39313#(and (<= main_~v~0 main_~b~0) (exists ((aux_div_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (<= (+ main_~b~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2) (< aux_mod_aux_div_main_~c~0_33_28 2) (< main_~b~0 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< aux_mod_aux_div_aux_div_main_~c~0_33_28_39 2) (< 1 (+ main_~c~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (<= 0 aux_mod_aux_div_aux_div_main_~c~0_33_28_39) (< 1 (+ (* 9 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))))) (< main_~b~0 main_~c~0))} is VALID [2022-04-28 12:44:28,065 INFO L290 TraceCheckUtils]: 128: Hoare triple {39313#(and (<= main_~v~0 main_~b~0) (exists ((aux_div_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (<= (+ main_~b~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2) (< aux_mod_aux_div_main_~c~0_33_28 2) (< main_~b~0 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< aux_mod_aux_div_aux_div_main_~c~0_33_28_39 2) (< 1 (+ main_~c~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (<= 0 aux_mod_aux_div_aux_div_main_~c~0_33_28_39) (< 1 (+ (* 9 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))))) (< main_~b~0 main_~c~0))} assume !false; {39313#(and (<= main_~v~0 main_~b~0) (exists ((aux_div_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (<= (+ main_~b~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2) (< aux_mod_aux_div_main_~c~0_33_28 2) (< main_~b~0 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< aux_mod_aux_div_aux_div_main_~c~0_33_28_39 2) (< 1 (+ main_~c~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (<= 0 aux_mod_aux_div_aux_div_main_~c~0_33_28_39) (< 1 (+ (* 9 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))))) (< main_~b~0 main_~c~0))} is VALID [2022-04-28 12:44:28,065 INFO L272 TraceCheckUtils]: 129: Hoare triple {39313#(and (<= main_~v~0 main_~b~0) (exists ((aux_div_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (<= (+ main_~b~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2) (< aux_mod_aux_div_main_~c~0_33_28 2) (< main_~b~0 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< aux_mod_aux_div_aux_div_main_~c~0_33_28_39 2) (< 1 (+ main_~c~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (<= 0 aux_mod_aux_div_aux_div_main_~c~0_33_28_39) (< 1 (+ (* 9 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))))) (< main_~b~0 main_~c~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {38914#true} is VALID [2022-04-28 12:44:28,065 INFO L290 TraceCheckUtils]: 130: Hoare triple {38914#true} ~cond := #in~cond; {38914#true} is VALID [2022-04-28 12:44:28,065 INFO L290 TraceCheckUtils]: 131: Hoare triple {38914#true} assume !(0 == ~cond); {38914#true} is VALID [2022-04-28 12:44:28,065 INFO L290 TraceCheckUtils]: 132: Hoare triple {38914#true} assume true; {38914#true} is VALID [2022-04-28 12:44:28,076 INFO L284 TraceCheckUtils]: 133: Hoare quadruple {38914#true} {39313#(and (<= main_~v~0 main_~b~0) (exists ((aux_div_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (<= (+ main_~b~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2) (< aux_mod_aux_div_main_~c~0_33_28 2) (< main_~b~0 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< aux_mod_aux_div_aux_div_main_~c~0_33_28_39 2) (< 1 (+ main_~c~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (<= 0 aux_mod_aux_div_aux_div_main_~c~0_33_28_39) (< 1 (+ (* 9 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))))) (< main_~b~0 main_~c~0))} #102#return; {39313#(and (<= main_~v~0 main_~b~0) (exists ((aux_div_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (<= (+ main_~b~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2) (< aux_mod_aux_div_main_~c~0_33_28 2) (< main_~b~0 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< aux_mod_aux_div_aux_div_main_~c~0_33_28_39 2) (< 1 (+ main_~c~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (<= 0 aux_mod_aux_div_aux_div_main_~c~0_33_28_39) (< 1 (+ (* 9 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))))) (< main_~b~0 main_~c~0))} is VALID [2022-04-28 12:44:28,077 INFO L272 TraceCheckUtils]: 134: Hoare triple {39313#(and (<= main_~v~0 main_~b~0) (exists ((aux_div_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (<= (+ main_~b~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2) (< aux_mod_aux_div_main_~c~0_33_28 2) (< main_~b~0 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< aux_mod_aux_div_aux_div_main_~c~0_33_28_39 2) (< 1 (+ main_~c~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (<= 0 aux_mod_aux_div_aux_div_main_~c~0_33_28_39) (< 1 (+ (* 9 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))))) (< main_~b~0 main_~c~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {38914#true} is VALID [2022-04-28 12:44:28,077 INFO L290 TraceCheckUtils]: 135: Hoare triple {38914#true} ~cond := #in~cond; {38914#true} is VALID [2022-04-28 12:44:28,077 INFO L290 TraceCheckUtils]: 136: Hoare triple {38914#true} assume !(0 == ~cond); {38914#true} is VALID [2022-04-28 12:44:28,077 INFO L290 TraceCheckUtils]: 137: Hoare triple {38914#true} assume true; {38914#true} is VALID [2022-04-28 12:44:28,077 INFO L284 TraceCheckUtils]: 138: Hoare quadruple {38914#true} {39313#(and (<= main_~v~0 main_~b~0) (exists ((aux_div_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (<= (+ main_~b~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2) (< aux_mod_aux_div_main_~c~0_33_28 2) (< main_~b~0 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< aux_mod_aux_div_aux_div_main_~c~0_33_28_39 2) (< 1 (+ main_~c~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (<= 0 aux_mod_aux_div_aux_div_main_~c~0_33_28_39) (< 1 (+ (* 9 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))))) (< main_~b~0 main_~c~0))} #104#return; {39313#(and (<= main_~v~0 main_~b~0) (exists ((aux_div_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (<= (+ main_~b~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2) (< aux_mod_aux_div_main_~c~0_33_28 2) (< main_~b~0 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< aux_mod_aux_div_aux_div_main_~c~0_33_28_39 2) (< 1 (+ main_~c~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (<= 0 aux_mod_aux_div_aux_div_main_~c~0_33_28_39) (< 1 (+ (* 9 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))))) (< main_~b~0 main_~c~0))} is VALID [2022-04-28 12:44:28,077 INFO L272 TraceCheckUtils]: 139: Hoare triple {39313#(and (<= main_~v~0 main_~b~0) (exists ((aux_div_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (<= (+ main_~b~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2) (< aux_mod_aux_div_main_~c~0_33_28 2) (< main_~b~0 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< aux_mod_aux_div_aux_div_main_~c~0_33_28_39 2) (< 1 (+ main_~c~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (<= 0 aux_mod_aux_div_aux_div_main_~c~0_33_28_39) (< 1 (+ (* 9 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))))) (< main_~b~0 main_~c~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {38914#true} is VALID [2022-04-28 12:44:28,077 INFO L290 TraceCheckUtils]: 140: Hoare triple {38914#true} ~cond := #in~cond; {38914#true} is VALID [2022-04-28 12:44:28,077 INFO L290 TraceCheckUtils]: 141: Hoare triple {38914#true} assume !(0 == ~cond); {38914#true} is VALID [2022-04-28 12:44:28,078 INFO L290 TraceCheckUtils]: 142: Hoare triple {38914#true} assume true; {38914#true} is VALID [2022-04-28 12:44:28,078 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {38914#true} {39313#(and (<= main_~v~0 main_~b~0) (exists ((aux_div_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (<= (+ main_~b~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2) (< aux_mod_aux_div_main_~c~0_33_28 2) (< main_~b~0 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< aux_mod_aux_div_aux_div_main_~c~0_33_28_39 2) (< 1 (+ main_~c~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (<= 0 aux_mod_aux_div_aux_div_main_~c~0_33_28_39) (< 1 (+ (* 9 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))))) (< main_~b~0 main_~c~0))} #106#return; {39313#(and (<= main_~v~0 main_~b~0) (exists ((aux_div_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (<= (+ main_~b~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2) (< aux_mod_aux_div_main_~c~0_33_28 2) (< main_~b~0 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< aux_mod_aux_div_aux_div_main_~c~0_33_28_39 2) (< 1 (+ main_~c~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (<= 0 aux_mod_aux_div_aux_div_main_~c~0_33_28_39) (< 1 (+ (* 9 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))))) (< main_~b~0 main_~c~0))} is VALID [2022-04-28 12:44:28,078 INFO L272 TraceCheckUtils]: 144: Hoare triple {39313#(and (<= main_~v~0 main_~b~0) (exists ((aux_div_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (<= (+ main_~b~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2) (< aux_mod_aux_div_main_~c~0_33_28 2) (< main_~b~0 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< aux_mod_aux_div_aux_div_main_~c~0_33_28_39 2) (< 1 (+ main_~c~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (<= 0 aux_mod_aux_div_aux_div_main_~c~0_33_28_39) (< 1 (+ (* 9 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))))) (< main_~b~0 main_~c~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {38914#true} is VALID [2022-04-28 12:44:28,078 INFO L290 TraceCheckUtils]: 145: Hoare triple {38914#true} ~cond := #in~cond; {38914#true} is VALID [2022-04-28 12:44:28,078 INFO L290 TraceCheckUtils]: 146: Hoare triple {38914#true} assume !(0 == ~cond); {38914#true} is VALID [2022-04-28 12:44:28,078 INFO L290 TraceCheckUtils]: 147: Hoare triple {38914#true} assume true; {38914#true} is VALID [2022-04-28 12:44:28,079 INFO L284 TraceCheckUtils]: 148: Hoare quadruple {38914#true} {39313#(and (<= main_~v~0 main_~b~0) (exists ((aux_div_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (<= (+ main_~b~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2) (< aux_mod_aux_div_main_~c~0_33_28 2) (< main_~b~0 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< aux_mod_aux_div_aux_div_main_~c~0_33_28_39 2) (< 1 (+ main_~c~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (<= 0 aux_mod_aux_div_aux_div_main_~c~0_33_28_39) (< 1 (+ (* 9 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))))) (< main_~b~0 main_~c~0))} #108#return; {39313#(and (<= main_~v~0 main_~b~0) (exists ((aux_div_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (<= (+ main_~b~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2) (< aux_mod_aux_div_main_~c~0_33_28 2) (< main_~b~0 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< aux_mod_aux_div_aux_div_main_~c~0_33_28_39 2) (< 1 (+ main_~c~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (<= 0 aux_mod_aux_div_aux_div_main_~c~0_33_28_39) (< 1 (+ (* 9 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))))) (< main_~b~0 main_~c~0))} is VALID [2022-04-28 12:44:28,082 INFO L290 TraceCheckUtils]: 149: Hoare triple {39313#(and (<= main_~v~0 main_~b~0) (exists ((aux_div_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (<= (+ main_~b~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2) (< aux_mod_aux_div_main_~c~0_33_28 2) (< main_~b~0 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< aux_mod_aux_div_aux_div_main_~c~0_33_28_39 2) (< 1 (+ main_~c~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (<= 0 aux_mod_aux_div_aux_div_main_~c~0_33_28_39) (< 1 (+ (* 9 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))))) (< main_~b~0 main_~c~0))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {39380#(and (exists ((aux_div_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (<= (+ main_~b~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2) (< aux_mod_aux_div_main_~c~0_33_28 2) (< main_~b~0 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< aux_mod_aux_div_aux_div_main_~c~0_33_28_39 2) (< 1 (+ main_~c~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (<= 0 aux_mod_aux_div_aux_div_main_~c~0_33_28_39) (< 1 (+ (* 9 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))))) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-28 12:44:28,083 INFO L290 TraceCheckUtils]: 150: Hoare triple {39380#(and (exists ((aux_div_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (<= (+ main_~b~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2) (< aux_mod_aux_div_main_~c~0_33_28 2) (< main_~b~0 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< aux_mod_aux_div_aux_div_main_~c~0_33_28_39 2) (< 1 (+ main_~c~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (<= 0 aux_mod_aux_div_aux_div_main_~c~0_33_28_39) (< 1 (+ (* 9 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))))) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} assume !false; {39380#(and (exists ((aux_div_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (<= (+ main_~b~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2) (< aux_mod_aux_div_main_~c~0_33_28 2) (< main_~b~0 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< aux_mod_aux_div_aux_div_main_~c~0_33_28_39 2) (< 1 (+ main_~c~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (<= 0 aux_mod_aux_div_aux_div_main_~c~0_33_28_39) (< 1 (+ (* 9 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))))) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-28 12:44:28,083 INFO L272 TraceCheckUtils]: 151: Hoare triple {39380#(and (exists ((aux_div_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (<= (+ main_~b~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2) (< aux_mod_aux_div_main_~c~0_33_28 2) (< main_~b~0 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< aux_mod_aux_div_aux_div_main_~c~0_33_28_39 2) (< 1 (+ main_~c~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (<= 0 aux_mod_aux_div_aux_div_main_~c~0_33_28_39) (< 1 (+ (* 9 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))))) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {38914#true} is VALID [2022-04-28 12:44:28,083 INFO L290 TraceCheckUtils]: 152: Hoare triple {38914#true} ~cond := #in~cond; {38914#true} is VALID [2022-04-28 12:44:28,084 INFO L290 TraceCheckUtils]: 153: Hoare triple {38914#true} assume !(0 == ~cond); {38914#true} is VALID [2022-04-28 12:44:28,084 INFO L290 TraceCheckUtils]: 154: Hoare triple {38914#true} assume true; {38914#true} is VALID [2022-04-28 12:44:28,084 INFO L284 TraceCheckUtils]: 155: Hoare quadruple {38914#true} {39380#(and (exists ((aux_div_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (<= (+ main_~b~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2) (< aux_mod_aux_div_main_~c~0_33_28 2) (< main_~b~0 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< aux_mod_aux_div_aux_div_main_~c~0_33_28_39 2) (< 1 (+ main_~c~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (<= 0 aux_mod_aux_div_aux_div_main_~c~0_33_28_39) (< 1 (+ (* 9 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))))) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} #102#return; {39380#(and (exists ((aux_div_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (<= (+ main_~b~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2) (< aux_mod_aux_div_main_~c~0_33_28 2) (< main_~b~0 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< aux_mod_aux_div_aux_div_main_~c~0_33_28_39 2) (< 1 (+ main_~c~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (<= 0 aux_mod_aux_div_aux_div_main_~c~0_33_28_39) (< 1 (+ (* 9 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))))) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-28 12:44:28,084 INFO L272 TraceCheckUtils]: 156: Hoare triple {39380#(and (exists ((aux_div_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (<= (+ main_~b~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2) (< aux_mod_aux_div_main_~c~0_33_28 2) (< main_~b~0 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< aux_mod_aux_div_aux_div_main_~c~0_33_28_39 2) (< 1 (+ main_~c~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (<= 0 aux_mod_aux_div_aux_div_main_~c~0_33_28_39) (< 1 (+ (* 9 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))))) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {38914#true} is VALID [2022-04-28 12:44:28,084 INFO L290 TraceCheckUtils]: 157: Hoare triple {38914#true} ~cond := #in~cond; {38914#true} is VALID [2022-04-28 12:44:28,084 INFO L290 TraceCheckUtils]: 158: Hoare triple {38914#true} assume !(0 == ~cond); {38914#true} is VALID [2022-04-28 12:44:28,084 INFO L290 TraceCheckUtils]: 159: Hoare triple {38914#true} assume true; {38914#true} is VALID [2022-04-28 12:44:28,085 INFO L284 TraceCheckUtils]: 160: Hoare quadruple {38914#true} {39380#(and (exists ((aux_div_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (<= (+ main_~b~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2) (< aux_mod_aux_div_main_~c~0_33_28 2) (< main_~b~0 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< aux_mod_aux_div_aux_div_main_~c~0_33_28_39 2) (< 1 (+ main_~c~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (<= 0 aux_mod_aux_div_aux_div_main_~c~0_33_28_39) (< 1 (+ (* 9 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))))) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} #104#return; {39380#(and (exists ((aux_div_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (<= (+ main_~b~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2) (< aux_mod_aux_div_main_~c~0_33_28 2) (< main_~b~0 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< aux_mod_aux_div_aux_div_main_~c~0_33_28_39 2) (< 1 (+ main_~c~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (<= 0 aux_mod_aux_div_aux_div_main_~c~0_33_28_39) (< 1 (+ (* 9 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))))) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-28 12:44:28,085 INFO L272 TraceCheckUtils]: 161: Hoare triple {39380#(and (exists ((aux_div_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (<= (+ main_~b~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2) (< aux_mod_aux_div_main_~c~0_33_28 2) (< main_~b~0 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< aux_mod_aux_div_aux_div_main_~c~0_33_28_39 2) (< 1 (+ main_~c~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (<= 0 aux_mod_aux_div_aux_div_main_~c~0_33_28_39) (< 1 (+ (* 9 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))))) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {38914#true} is VALID [2022-04-28 12:44:28,085 INFO L290 TraceCheckUtils]: 162: Hoare triple {38914#true} ~cond := #in~cond; {38914#true} is VALID [2022-04-28 12:44:28,085 INFO L290 TraceCheckUtils]: 163: Hoare triple {38914#true} assume !(0 == ~cond); {38914#true} is VALID [2022-04-28 12:44:28,085 INFO L290 TraceCheckUtils]: 164: Hoare triple {38914#true} assume true; {38914#true} is VALID [2022-04-28 12:44:28,086 INFO L284 TraceCheckUtils]: 165: Hoare quadruple {38914#true} {39380#(and (exists ((aux_div_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (<= (+ main_~b~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2) (< aux_mod_aux_div_main_~c~0_33_28 2) (< main_~b~0 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< aux_mod_aux_div_aux_div_main_~c~0_33_28_39 2) (< 1 (+ main_~c~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (<= 0 aux_mod_aux_div_aux_div_main_~c~0_33_28_39) (< 1 (+ (* 9 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))))) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} #106#return; {39380#(and (exists ((aux_div_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (<= (+ main_~b~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2) (< aux_mod_aux_div_main_~c~0_33_28 2) (< main_~b~0 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< aux_mod_aux_div_aux_div_main_~c~0_33_28_39 2) (< 1 (+ main_~c~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (<= 0 aux_mod_aux_div_aux_div_main_~c~0_33_28_39) (< 1 (+ (* 9 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))))) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-28 12:44:28,086 INFO L272 TraceCheckUtils]: 166: Hoare triple {39380#(and (exists ((aux_div_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (<= (+ main_~b~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2) (< aux_mod_aux_div_main_~c~0_33_28 2) (< main_~b~0 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< aux_mod_aux_div_aux_div_main_~c~0_33_28_39 2) (< 1 (+ main_~c~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (<= 0 aux_mod_aux_div_aux_div_main_~c~0_33_28_39) (< 1 (+ (* 9 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))))) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {38914#true} is VALID [2022-04-28 12:44:28,086 INFO L290 TraceCheckUtils]: 167: Hoare triple {38914#true} ~cond := #in~cond; {38914#true} is VALID [2022-04-28 12:44:28,086 INFO L290 TraceCheckUtils]: 168: Hoare triple {38914#true} assume !(0 == ~cond); {38914#true} is VALID [2022-04-28 12:44:28,086 INFO L290 TraceCheckUtils]: 169: Hoare triple {38914#true} assume true; {38914#true} is VALID [2022-04-28 12:44:28,086 INFO L284 TraceCheckUtils]: 170: Hoare quadruple {38914#true} {39380#(and (exists ((aux_div_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (<= (+ main_~b~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2) (< aux_mod_aux_div_main_~c~0_33_28 2) (< main_~b~0 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< aux_mod_aux_div_aux_div_main_~c~0_33_28_39 2) (< 1 (+ main_~c~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (<= 0 aux_mod_aux_div_aux_div_main_~c~0_33_28_39) (< 1 (+ (* 9 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))))) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} #108#return; {39380#(and (exists ((aux_div_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (<= (+ main_~b~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2) (< aux_mod_aux_div_main_~c~0_33_28 2) (< main_~b~0 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< aux_mod_aux_div_aux_div_main_~c~0_33_28_39 2) (< 1 (+ main_~c~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (<= 0 aux_mod_aux_div_aux_div_main_~c~0_33_28_39) (< 1 (+ (* 9 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))))) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-28 12:44:28,088 INFO L290 TraceCheckUtils]: 171: Hoare triple {39380#(and (exists ((aux_div_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (<= (+ main_~b~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2) (< aux_mod_aux_div_main_~c~0_33_28 2) (< main_~b~0 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< aux_mod_aux_div_aux_div_main_~c~0_33_28_39 2) (< 1 (+ main_~c~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (<= 0 aux_mod_aux_div_aux_div_main_~c~0_33_28_39) (< 1 (+ (* 9 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))))) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} assume !(~c~0 >= 2 * ~v~0); {39380#(and (exists ((aux_div_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (<= (+ main_~b~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2) (< aux_mod_aux_div_main_~c~0_33_28 2) (< main_~b~0 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< aux_mod_aux_div_aux_div_main_~c~0_33_28_39 2) (< 1 (+ main_~c~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (<= 0 aux_mod_aux_div_aux_div_main_~c~0_33_28_39) (< 1 (+ (* 9 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))))) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-28 12:44:28,089 INFO L290 TraceCheckUtils]: 172: Hoare triple {39380#(and (exists ((aux_div_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (<= (+ main_~b~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2) (< aux_mod_aux_div_main_~c~0_33_28 2) (< main_~b~0 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< aux_mod_aux_div_aux_div_main_~c~0_33_28_39 2) (< 1 (+ main_~c~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))) (<= 0 aux_mod_aux_div_aux_div_main_~c~0_33_28_39) (< 1 (+ (* 9 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))))) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {39450#(and (exists ((aux_div_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (<= (+ main_~b~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2) (< aux_mod_aux_div_main_~c~0_33_28 2) (< main_~b~0 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< aux_mod_aux_div_aux_div_main_~c~0_33_28_39 2) (< (div (+ (- 2) main_~c~0) (- 2)) (+ (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 2) main_~b~0 aux_mod_aux_div_main_~c~0_33_28 (* aux_div_aux_div_aux_div_main_~c~0_33_28_39 4) 1)) (<= 0 aux_mod_aux_div_aux_div_main_~c~0_33_28_39) (< 1 (+ (* 9 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))))) (< (div (+ (- 1) main_~c~0 (* (- 1) main_~b~0)) (- 2)) (+ main_~b~0 1)))} is VALID [2022-04-28 12:44:28,091 INFO L290 TraceCheckUtils]: 173: Hoare triple {39450#(and (exists ((aux_div_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (<= (+ main_~b~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2) (< aux_mod_aux_div_main_~c~0_33_28 2) (< main_~b~0 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< aux_mod_aux_div_aux_div_main_~c~0_33_28_39 2) (< (div (+ (- 2) main_~c~0) (- 2)) (+ (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 2) main_~b~0 aux_mod_aux_div_main_~c~0_33_28 (* aux_div_aux_div_aux_div_main_~c~0_33_28_39 4) 1)) (<= 0 aux_mod_aux_div_aux_div_main_~c~0_33_28_39) (< 1 (+ (* 9 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))))) (< (div (+ (- 1) main_~c~0 (* (- 1) main_~b~0)) (- 2)) (+ main_~b~0 1)))} assume !false; {39450#(and (exists ((aux_div_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (<= (+ main_~b~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2) (< aux_mod_aux_div_main_~c~0_33_28 2) (< main_~b~0 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< aux_mod_aux_div_aux_div_main_~c~0_33_28_39 2) (< (div (+ (- 2) main_~c~0) (- 2)) (+ (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 2) main_~b~0 aux_mod_aux_div_main_~c~0_33_28 (* aux_div_aux_div_aux_div_main_~c~0_33_28_39 4) 1)) (<= 0 aux_mod_aux_div_aux_div_main_~c~0_33_28_39) (< 1 (+ (* 9 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))))) (< (div (+ (- 1) main_~c~0 (* (- 1) main_~b~0)) (- 2)) (+ main_~b~0 1)))} is VALID [2022-04-28 12:44:28,093 INFO L290 TraceCheckUtils]: 174: Hoare triple {39450#(and (exists ((aux_div_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_aux_div_main_~c~0_33_28_39 Int) (aux_mod_aux_div_main_~c~0_33_28 Int)) (and (<= (+ main_~b~0 (* 8 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28)) 2) (< aux_mod_aux_div_main_~c~0_33_28 2) (< main_~b~0 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (<= 0 aux_mod_aux_div_main_~c~0_33_28) (< aux_mod_aux_div_aux_div_main_~c~0_33_28_39 2) (< (div (+ (- 2) main_~c~0) (- 2)) (+ (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 2) main_~b~0 aux_mod_aux_div_main_~c~0_33_28 (* aux_div_aux_div_aux_div_main_~c~0_33_28_39 4) 1)) (<= 0 aux_mod_aux_div_aux_div_main_~c~0_33_28_39) (< 1 (+ (* 9 aux_div_aux_div_aux_div_main_~c~0_33_28_39) (* aux_mod_aux_div_aux_div_main_~c~0_33_28_39 4) (* 2 aux_mod_aux_div_main_~c~0_33_28))))) (< (div (+ (- 1) main_~c~0 (* (- 1) main_~b~0)) (- 2)) (+ main_~b~0 1)))} assume !(~c~0 >= ~b~0); {38915#false} is VALID [2022-04-28 12:44:28,093 INFO L290 TraceCheckUtils]: 175: Hoare triple {38915#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {38915#false} is VALID [2022-04-28 12:44:28,093 INFO L290 TraceCheckUtils]: 176: Hoare triple {38915#false} assume !false; {38915#false} is VALID [2022-04-28 12:44:28,093 INFO L290 TraceCheckUtils]: 177: Hoare triple {38915#false} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {38915#false} is VALID [2022-04-28 12:44:28,093 INFO L290 TraceCheckUtils]: 178: Hoare triple {38915#false} assume !false; {38915#false} is VALID [2022-04-28 12:44:28,093 INFO L290 TraceCheckUtils]: 179: Hoare triple {38915#false} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {38915#false} is VALID [2022-04-28 12:44:28,093 INFO L290 TraceCheckUtils]: 180: Hoare triple {38915#false} assume !false; {38915#false} is VALID [2022-04-28 12:44:28,094 INFO L272 TraceCheckUtils]: 181: Hoare triple {38915#false} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {38915#false} is VALID [2022-04-28 12:44:28,094 INFO L290 TraceCheckUtils]: 182: Hoare triple {38915#false} ~cond := #in~cond; {38915#false} is VALID [2022-04-28 12:44:28,094 INFO L290 TraceCheckUtils]: 183: Hoare triple {38915#false} assume 0 == ~cond; {38915#false} is VALID [2022-04-28 12:44:28,094 INFO L290 TraceCheckUtils]: 184: Hoare triple {38915#false} assume !false; {38915#false} is VALID [2022-04-28 12:44:28,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1306 backedges. 81 proven. 106 refuted. 0 times theorem prover too weak. 1119 trivial. 0 not checked. [2022-04-28 12:44:28,095 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:44:33,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:44:33,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733099428] [2022-04-28 12:44:33,493 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:44:33,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867504296] [2022-04-28 12:44:33,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867504296] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 12:44:33,493 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 12:44:33,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2022-04-28 12:44:33,493 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:44:33,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [117938849] [2022-04-28 12:44:33,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [117938849] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:44:33,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:44:33,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 12:44:33,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306933364] [2022-04-28 12:44:33,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:44:33,494 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 9 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (29), 8 states have call predecessors, (29), 8 states have call successors, (29) Word has length 185 [2022-04-28 12:44:33,494 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:44:33,494 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 9 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (29), 8 states have call predecessors, (29), 8 states have call successors, (29) [2022-04-28 12:44:33,670 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:44:33,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 12:44:33,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:44:33,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 12:44:33,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=853, Unknown=0, NotChecked=0, Total=992 [2022-04-28 12:44:33,671 INFO L87 Difference]: Start difference. First operand 140 states and 169 transitions. Second operand has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 9 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (29), 8 states have call predecessors, (29), 8 states have call successors, (29) [2022-04-28 12:44:39,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:44:39,080 INFO L93 Difference]: Finished difference Result 213 states and 264 transitions. [2022-04-28 12:44:39,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 12:44:39,080 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 9 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (29), 8 states have call predecessors, (29), 8 states have call successors, (29) Word has length 185 [2022-04-28 12:44:39,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:44:39,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 9 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (29), 8 states have call predecessors, (29), 8 states have call successors, (29) [2022-04-28 12:44:39,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 158 transitions. [2022-04-28 12:44:39,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 9 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (29), 8 states have call predecessors, (29), 8 states have call successors, (29) [2022-04-28 12:44:39,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 158 transitions. [2022-04-28 12:44:39,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 158 transitions. [2022-04-28 12:44:39,341 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:44:39,343 INFO L225 Difference]: With dead ends: 213 [2022-04-28 12:44:39,343 INFO L226 Difference]: Without dead ends: 146 [2022-04-28 12:44:39,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=280, Invalid=1526, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 12:44:39,344 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 56 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 330 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-28 12:44:39,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 498 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 296 Invalid, 0 Unknown, 330 Unchecked, 1.5s Time] [2022-04-28 12:44:39,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-04-28 12:44:40,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2022-04-28 12:44:40,003 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:44:40,003 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand has 146 states, 85 states have (on average 1.035294117647059) internal successors, (88), 85 states have internal predecessors, (88), 46 states have call successors, (46), 15 states have call predecessors, (46), 14 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2022-04-28 12:44:40,003 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand has 146 states, 85 states have (on average 1.035294117647059) internal successors, (88), 85 states have internal predecessors, (88), 46 states have call successors, (46), 15 states have call predecessors, (46), 14 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2022-04-28 12:44:40,003 INFO L87 Difference]: Start difference. First operand 146 states. Second operand has 146 states, 85 states have (on average 1.035294117647059) internal successors, (88), 85 states have internal predecessors, (88), 46 states have call successors, (46), 15 states have call predecessors, (46), 14 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2022-04-28 12:44:40,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:44:40,005 INFO L93 Difference]: Finished difference Result 146 states and 179 transitions. [2022-04-28 12:44:40,005 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 179 transitions. [2022-04-28 12:44:40,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:44:40,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:44:40,006 INFO L74 IsIncluded]: Start isIncluded. First operand has 146 states, 85 states have (on average 1.035294117647059) internal successors, (88), 85 states have internal predecessors, (88), 46 states have call successors, (46), 15 states have call predecessors, (46), 14 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) Second operand 146 states. [2022-04-28 12:44:40,006 INFO L87 Difference]: Start difference. First operand has 146 states, 85 states have (on average 1.035294117647059) internal successors, (88), 85 states have internal predecessors, (88), 46 states have call successors, (46), 15 states have call predecessors, (46), 14 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) Second operand 146 states. [2022-04-28 12:44:40,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:44:40,007 INFO L93 Difference]: Finished difference Result 146 states and 179 transitions. [2022-04-28 12:44:40,007 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 179 transitions. [2022-04-28 12:44:40,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:44:40,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:44:40,008 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:44:40,008 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:44:40,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 85 states have (on average 1.035294117647059) internal successors, (88), 85 states have internal predecessors, (88), 46 states have call successors, (46), 15 states have call predecessors, (46), 14 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2022-04-28 12:44:40,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 179 transitions. [2022-04-28 12:44:40,010 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 179 transitions. Word has length 185 [2022-04-28 12:44:40,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:44:40,010 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 179 transitions. [2022-04-28 12:44:40,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 9 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (29), 8 states have call predecessors, (29), 8 states have call successors, (29) [2022-04-28 12:44:40,010 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 146 states and 179 transitions. [2022-04-28 12:44:40,473 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:44:40,473 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 179 transitions. [2022-04-28 12:44:40,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-04-28 12:44:40,474 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:44:40,474 INFO L195 NwaCegarLoop]: trace histogram [29, 28, 28, 8, 8, 7, 7, 7, 7, 7, 7, 7, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:44:40,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-28 12:44:40,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:44:40,674 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:44:40,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:44:40,675 INFO L85 PathProgramCache]: Analyzing trace with hash 294904993, now seen corresponding path program 5 times [2022-04-28 12:44:40,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:44:40,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1544668744] [2022-04-28 12:44:40,675 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:44:40,675 INFO L85 PathProgramCache]: Analyzing trace with hash 294904993, now seen corresponding path program 6 times [2022-04-28 12:44:40,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:44:40,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079253730] [2022-04-28 12:44:40,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:44:40,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:44:40,687 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:44:40,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [275767975] [2022-04-28 12:44:40,687 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 12:44:40,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:44:40,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:44:40,688 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:44:40,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-28 12:44:40,753 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 12:44:40,753 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:44:40,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 12:44:40,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:44:40,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:44:42,975 INFO L272 TraceCheckUtils]: 0: Hoare triple {41009#true} call ULTIMATE.init(); {41009#true} is VALID [2022-04-28 12:44:42,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {41009#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(11, 2);call #Ultimate.allocInit(12, 3); {41009#true} is VALID [2022-04-28 12:44:42,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:42,976 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41009#true} {41009#true} #112#return; {41009#true} is VALID [2022-04-28 12:44:42,976 INFO L272 TraceCheckUtils]: 4: Hoare triple {41009#true} call #t~ret6 := main(); {41009#true} is VALID [2022-04-28 12:44:42,976 INFO L290 TraceCheckUtils]: 5: Hoare triple {41009#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {41009#true} is VALID [2022-04-28 12:44:42,976 INFO L272 TraceCheckUtils]: 6: Hoare triple {41009#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:42,976 INFO L290 TraceCheckUtils]: 7: Hoare triple {41009#true} ~cond := #in~cond; {41035#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 12:44:42,976 INFO L290 TraceCheckUtils]: 8: Hoare triple {41035#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {41039#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:44:42,977 INFO L290 TraceCheckUtils]: 9: Hoare triple {41039#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {41039#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:44:42,977 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41039#(not (= |assume_abort_if_not_#in~cond| 0))} {41009#true} #94#return; {41046#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 12:44:42,977 INFO L290 TraceCheckUtils]: 11: Hoare triple {41046#(and (<= 0 main_~x~0) (<= main_~x~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {41046#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 12:44:42,977 INFO L272 TraceCheckUtils]: 12: Hoare triple {41046#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:42,977 INFO L290 TraceCheckUtils]: 13: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:42,978 INFO L290 TraceCheckUtils]: 14: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:42,978 INFO L290 TraceCheckUtils]: 15: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:42,978 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {41009#true} {41046#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #96#return; {41046#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 12:44:42,978 INFO L272 TraceCheckUtils]: 17: Hoare triple {41046#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:42,978 INFO L290 TraceCheckUtils]: 18: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:42,978 INFO L290 TraceCheckUtils]: 19: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:42,978 INFO L290 TraceCheckUtils]: 20: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:42,978 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {41009#true} {41046#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #98#return; {41046#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 12:44:42,978 INFO L272 TraceCheckUtils]: 22: Hoare triple {41046#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:42,979 INFO L290 TraceCheckUtils]: 23: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:42,979 INFO L290 TraceCheckUtils]: 24: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:42,979 INFO L290 TraceCheckUtils]: 25: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:42,979 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {41009#true} {41046#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #100#return; {41046#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 12:44:42,979 INFO L290 TraceCheckUtils]: 27: Hoare triple {41046#(and (<= 0 main_~x~0) (<= main_~x~0 2))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {41098#(<= main_~a~0 2)} is VALID [2022-04-28 12:44:42,980 INFO L290 TraceCheckUtils]: 28: Hoare triple {41098#(<= main_~a~0 2)} assume !false; {41098#(<= main_~a~0 2)} is VALID [2022-04-28 12:44:42,980 INFO L290 TraceCheckUtils]: 29: Hoare triple {41098#(<= main_~a~0 2)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {41105#(<= main_~c~0 2)} is VALID [2022-04-28 12:44:42,980 INFO L290 TraceCheckUtils]: 30: Hoare triple {41105#(<= main_~c~0 2)} assume !false; {41105#(<= main_~c~0 2)} is VALID [2022-04-28 12:44:42,980 INFO L290 TraceCheckUtils]: 31: Hoare triple {41105#(<= main_~c~0 2)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {41112#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} is VALID [2022-04-28 12:44:42,981 INFO L290 TraceCheckUtils]: 32: Hoare triple {41112#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} assume !false; {41112#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} is VALID [2022-04-28 12:44:42,981 INFO L272 TraceCheckUtils]: 33: Hoare triple {41112#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:42,981 INFO L290 TraceCheckUtils]: 34: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:42,981 INFO L290 TraceCheckUtils]: 35: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:42,981 INFO L290 TraceCheckUtils]: 36: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:42,981 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {41009#true} {41112#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} #102#return; {41112#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} is VALID [2022-04-28 12:44:42,981 INFO L272 TraceCheckUtils]: 38: Hoare triple {41112#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:42,982 INFO L290 TraceCheckUtils]: 39: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:42,982 INFO L290 TraceCheckUtils]: 40: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:42,982 INFO L290 TraceCheckUtils]: 41: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:42,982 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {41009#true} {41112#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} #104#return; {41112#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} is VALID [2022-04-28 12:44:42,982 INFO L272 TraceCheckUtils]: 43: Hoare triple {41112#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:42,982 INFO L290 TraceCheckUtils]: 44: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:42,982 INFO L290 TraceCheckUtils]: 45: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:42,982 INFO L290 TraceCheckUtils]: 46: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:42,983 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {41009#true} {41112#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} #106#return; {41112#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} is VALID [2022-04-28 12:44:42,983 INFO L272 TraceCheckUtils]: 48: Hoare triple {41112#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:42,983 INFO L290 TraceCheckUtils]: 49: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:42,983 INFO L290 TraceCheckUtils]: 50: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:42,983 INFO L290 TraceCheckUtils]: 51: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:42,983 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {41009#true} {41112#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} #108#return; {41112#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} is VALID [2022-04-28 12:44:42,984 INFO L290 TraceCheckUtils]: 53: Hoare triple {41112#(and (<= main_~c~0 2) (<= main_~b~0 main_~v~0))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {41179#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:42,984 INFO L290 TraceCheckUtils]: 54: Hoare triple {41179#(<= main_~b~0 1)} assume !false; {41179#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:42,984 INFO L272 TraceCheckUtils]: 55: Hoare triple {41179#(<= main_~b~0 1)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:42,984 INFO L290 TraceCheckUtils]: 56: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:42,984 INFO L290 TraceCheckUtils]: 57: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:42,984 INFO L290 TraceCheckUtils]: 58: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:42,985 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {41009#true} {41179#(<= main_~b~0 1)} #102#return; {41179#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:42,985 INFO L272 TraceCheckUtils]: 60: Hoare triple {41179#(<= main_~b~0 1)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:42,985 INFO L290 TraceCheckUtils]: 61: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:42,985 INFO L290 TraceCheckUtils]: 62: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:42,985 INFO L290 TraceCheckUtils]: 63: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:42,987 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {41009#true} {41179#(<= main_~b~0 1)} #104#return; {41179#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:42,987 INFO L272 TraceCheckUtils]: 65: Hoare triple {41179#(<= main_~b~0 1)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:42,987 INFO L290 TraceCheckUtils]: 66: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:42,988 INFO L290 TraceCheckUtils]: 67: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:42,988 INFO L290 TraceCheckUtils]: 68: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:42,988 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {41009#true} {41179#(<= main_~b~0 1)} #106#return; {41179#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:42,988 INFO L272 TraceCheckUtils]: 70: Hoare triple {41179#(<= main_~b~0 1)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:42,988 INFO L290 TraceCheckUtils]: 71: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:42,988 INFO L290 TraceCheckUtils]: 72: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:42,988 INFO L290 TraceCheckUtils]: 73: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:42,989 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {41009#true} {41179#(<= main_~b~0 1)} #108#return; {41179#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:42,989 INFO L290 TraceCheckUtils]: 75: Hoare triple {41179#(<= main_~b~0 1)} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {41179#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:42,989 INFO L290 TraceCheckUtils]: 76: Hoare triple {41179#(<= main_~b~0 1)} assume !false; {41179#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:42,989 INFO L272 TraceCheckUtils]: 77: Hoare triple {41179#(<= main_~b~0 1)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:42,989 INFO L290 TraceCheckUtils]: 78: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:42,989 INFO L290 TraceCheckUtils]: 79: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:42,989 INFO L290 TraceCheckUtils]: 80: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:42,990 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {41009#true} {41179#(<= main_~b~0 1)} #102#return; {41179#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:42,990 INFO L272 TraceCheckUtils]: 82: Hoare triple {41179#(<= main_~b~0 1)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:42,990 INFO L290 TraceCheckUtils]: 83: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:42,990 INFO L290 TraceCheckUtils]: 84: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:42,990 INFO L290 TraceCheckUtils]: 85: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:42,990 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {41009#true} {41179#(<= main_~b~0 1)} #104#return; {41179#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:42,990 INFO L272 TraceCheckUtils]: 87: Hoare triple {41179#(<= main_~b~0 1)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:42,990 INFO L290 TraceCheckUtils]: 88: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:42,991 INFO L290 TraceCheckUtils]: 89: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:42,991 INFO L290 TraceCheckUtils]: 90: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:42,991 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {41009#true} {41179#(<= main_~b~0 1)} #106#return; {41179#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:42,991 INFO L272 TraceCheckUtils]: 92: Hoare triple {41179#(<= main_~b~0 1)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:42,991 INFO L290 TraceCheckUtils]: 93: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:42,991 INFO L290 TraceCheckUtils]: 94: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:42,991 INFO L290 TraceCheckUtils]: 95: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:42,992 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {41009#true} {41179#(<= main_~b~0 1)} #108#return; {41179#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:42,992 INFO L290 TraceCheckUtils]: 97: Hoare triple {41179#(<= main_~b~0 1)} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {41179#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:42,992 INFO L290 TraceCheckUtils]: 98: Hoare triple {41179#(<= main_~b~0 1)} assume !false; {41179#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:42,992 INFO L272 TraceCheckUtils]: 99: Hoare triple {41179#(<= main_~b~0 1)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:42,992 INFO L290 TraceCheckUtils]: 100: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:42,992 INFO L290 TraceCheckUtils]: 101: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:42,992 INFO L290 TraceCheckUtils]: 102: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:42,993 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {41009#true} {41179#(<= main_~b~0 1)} #102#return; {41179#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:42,993 INFO L272 TraceCheckUtils]: 104: Hoare triple {41179#(<= main_~b~0 1)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:42,993 INFO L290 TraceCheckUtils]: 105: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:42,993 INFO L290 TraceCheckUtils]: 106: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:42,993 INFO L290 TraceCheckUtils]: 107: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:42,994 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {41009#true} {41179#(<= main_~b~0 1)} #104#return; {41179#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:42,994 INFO L272 TraceCheckUtils]: 109: Hoare triple {41179#(<= main_~b~0 1)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:42,994 INFO L290 TraceCheckUtils]: 110: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:42,994 INFO L290 TraceCheckUtils]: 111: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:42,994 INFO L290 TraceCheckUtils]: 112: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:42,994 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {41009#true} {41179#(<= main_~b~0 1)} #106#return; {41179#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:42,994 INFO L272 TraceCheckUtils]: 114: Hoare triple {41179#(<= main_~b~0 1)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:42,994 INFO L290 TraceCheckUtils]: 115: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:42,994 INFO L290 TraceCheckUtils]: 116: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:42,994 INFO L290 TraceCheckUtils]: 117: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:42,995 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {41009#true} {41179#(<= main_~b~0 1)} #108#return; {41179#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:42,995 INFO L290 TraceCheckUtils]: 119: Hoare triple {41179#(<= main_~b~0 1)} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {41179#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:42,995 INFO L290 TraceCheckUtils]: 120: Hoare triple {41179#(<= main_~b~0 1)} assume !false; {41179#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:42,995 INFO L272 TraceCheckUtils]: 121: Hoare triple {41179#(<= main_~b~0 1)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:42,995 INFO L290 TraceCheckUtils]: 122: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:42,995 INFO L290 TraceCheckUtils]: 123: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:42,996 INFO L290 TraceCheckUtils]: 124: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:42,997 INFO L284 TraceCheckUtils]: 125: Hoare quadruple {41009#true} {41179#(<= main_~b~0 1)} #102#return; {41179#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:42,997 INFO L272 TraceCheckUtils]: 126: Hoare triple {41179#(<= main_~b~0 1)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:42,997 INFO L290 TraceCheckUtils]: 127: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:42,997 INFO L290 TraceCheckUtils]: 128: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:42,997 INFO L290 TraceCheckUtils]: 129: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:42,997 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {41009#true} {41179#(<= main_~b~0 1)} #104#return; {41179#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:42,997 INFO L272 TraceCheckUtils]: 131: Hoare triple {41179#(<= main_~b~0 1)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:42,997 INFO L290 TraceCheckUtils]: 132: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:42,998 INFO L290 TraceCheckUtils]: 133: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:42,998 INFO L290 TraceCheckUtils]: 134: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:42,998 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {41009#true} {41179#(<= main_~b~0 1)} #106#return; {41179#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:42,998 INFO L272 TraceCheckUtils]: 136: Hoare triple {41179#(<= main_~b~0 1)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:42,998 INFO L290 TraceCheckUtils]: 137: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:42,998 INFO L290 TraceCheckUtils]: 138: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:42,998 INFO L290 TraceCheckUtils]: 139: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:42,999 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {41009#true} {41179#(<= main_~b~0 1)} #108#return; {41179#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:42,999 INFO L290 TraceCheckUtils]: 141: Hoare triple {41179#(<= main_~b~0 1)} assume !(~c~0 >= 2 * ~v~0); {41179#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:42,999 INFO L290 TraceCheckUtils]: 142: Hoare triple {41179#(<= main_~b~0 1)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {41179#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:42,999 INFO L290 TraceCheckUtils]: 143: Hoare triple {41179#(<= main_~b~0 1)} assume !false; {41179#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:43,000 INFO L290 TraceCheckUtils]: 144: Hoare triple {41179#(<= main_~b~0 1)} assume !(~c~0 >= ~b~0); {41453#(and (<= main_~b~0 1) (not (<= main_~b~0 main_~c~0)))} is VALID [2022-04-28 12:44:43,000 INFO L290 TraceCheckUtils]: 145: Hoare triple {41453#(and (<= main_~b~0 1) (not (<= main_~b~0 main_~c~0)))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {41457#(and (< main_~b~0 main_~a~0) (< main_~b~0 1))} is VALID [2022-04-28 12:44:43,001 INFO L290 TraceCheckUtils]: 146: Hoare triple {41457#(and (< main_~b~0 main_~a~0) (< main_~b~0 1))} assume !false; {41457#(and (< main_~b~0 main_~a~0) (< main_~b~0 1))} is VALID [2022-04-28 12:44:43,001 INFO L290 TraceCheckUtils]: 147: Hoare triple {41457#(and (< main_~b~0 main_~a~0) (< main_~b~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {41464#(and (< main_~b~0 1) (< main_~b~0 main_~c~0))} is VALID [2022-04-28 12:44:43,001 INFO L290 TraceCheckUtils]: 148: Hoare triple {41464#(and (< main_~b~0 1) (< main_~b~0 main_~c~0))} assume !false; {41464#(and (< main_~b~0 1) (< main_~b~0 main_~c~0))} is VALID [2022-04-28 12:44:43,002 INFO L290 TraceCheckUtils]: 149: Hoare triple {41464#(and (< main_~b~0 1) (< main_~b~0 main_~c~0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {41471#(and (<= main_~v~0 main_~b~0) (< main_~b~0 1) (< main_~b~0 main_~c~0))} is VALID [2022-04-28 12:44:43,002 INFO L290 TraceCheckUtils]: 150: Hoare triple {41471#(and (<= main_~v~0 main_~b~0) (< main_~b~0 1) (< main_~b~0 main_~c~0))} assume !false; {41471#(and (<= main_~v~0 main_~b~0) (< main_~b~0 1) (< main_~b~0 main_~c~0))} is VALID [2022-04-28 12:44:43,002 INFO L272 TraceCheckUtils]: 151: Hoare triple {41471#(and (<= main_~v~0 main_~b~0) (< main_~b~0 1) (< main_~b~0 main_~c~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:43,002 INFO L290 TraceCheckUtils]: 152: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:43,002 INFO L290 TraceCheckUtils]: 153: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:43,002 INFO L290 TraceCheckUtils]: 154: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:43,003 INFO L284 TraceCheckUtils]: 155: Hoare quadruple {41009#true} {41471#(and (<= main_~v~0 main_~b~0) (< main_~b~0 1) (< main_~b~0 main_~c~0))} #102#return; {41471#(and (<= main_~v~0 main_~b~0) (< main_~b~0 1) (< main_~b~0 main_~c~0))} is VALID [2022-04-28 12:44:43,003 INFO L272 TraceCheckUtils]: 156: Hoare triple {41471#(and (<= main_~v~0 main_~b~0) (< main_~b~0 1) (< main_~b~0 main_~c~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:43,003 INFO L290 TraceCheckUtils]: 157: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:43,003 INFO L290 TraceCheckUtils]: 158: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:43,003 INFO L290 TraceCheckUtils]: 159: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:43,003 INFO L284 TraceCheckUtils]: 160: Hoare quadruple {41009#true} {41471#(and (<= main_~v~0 main_~b~0) (< main_~b~0 1) (< main_~b~0 main_~c~0))} #104#return; {41471#(and (<= main_~v~0 main_~b~0) (< main_~b~0 1) (< main_~b~0 main_~c~0))} is VALID [2022-04-28 12:44:43,003 INFO L272 TraceCheckUtils]: 161: Hoare triple {41471#(and (<= main_~v~0 main_~b~0) (< main_~b~0 1) (< main_~b~0 main_~c~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:43,004 INFO L290 TraceCheckUtils]: 162: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:43,004 INFO L290 TraceCheckUtils]: 163: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:43,004 INFO L290 TraceCheckUtils]: 164: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:43,004 INFO L284 TraceCheckUtils]: 165: Hoare quadruple {41009#true} {41471#(and (<= main_~v~0 main_~b~0) (< main_~b~0 1) (< main_~b~0 main_~c~0))} #106#return; {41471#(and (<= main_~v~0 main_~b~0) (< main_~b~0 1) (< main_~b~0 main_~c~0))} is VALID [2022-04-28 12:44:43,004 INFO L272 TraceCheckUtils]: 166: Hoare triple {41471#(and (<= main_~v~0 main_~b~0) (< main_~b~0 1) (< main_~b~0 main_~c~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:43,004 INFO L290 TraceCheckUtils]: 167: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:43,004 INFO L290 TraceCheckUtils]: 168: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:43,004 INFO L290 TraceCheckUtils]: 169: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:43,005 INFO L284 TraceCheckUtils]: 170: Hoare quadruple {41009#true} {41471#(and (<= main_~v~0 main_~b~0) (< main_~b~0 1) (< main_~b~0 main_~c~0))} #108#return; {41471#(and (<= main_~v~0 main_~b~0) (< main_~b~0 1) (< main_~b~0 main_~c~0))} is VALID [2022-04-28 12:44:43,007 INFO L290 TraceCheckUtils]: 171: Hoare triple {41471#(and (<= main_~v~0 main_~b~0) (< main_~b~0 1) (< main_~b~0 main_~c~0))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {41538#(and (< main_~b~0 1) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-28 12:44:43,007 INFO L290 TraceCheckUtils]: 172: Hoare triple {41538#(and (< main_~b~0 1) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} assume !false; {41538#(and (< main_~b~0 1) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-28 12:44:43,007 INFO L272 TraceCheckUtils]: 173: Hoare triple {41538#(and (< main_~b~0 1) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:43,007 INFO L290 TraceCheckUtils]: 174: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:43,007 INFO L290 TraceCheckUtils]: 175: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:43,007 INFO L290 TraceCheckUtils]: 176: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:43,008 INFO L284 TraceCheckUtils]: 177: Hoare quadruple {41009#true} {41538#(and (< main_~b~0 1) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} #102#return; {41538#(and (< main_~b~0 1) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-28 12:44:43,008 INFO L272 TraceCheckUtils]: 178: Hoare triple {41538#(and (< main_~b~0 1) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:43,008 INFO L290 TraceCheckUtils]: 179: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:43,008 INFO L290 TraceCheckUtils]: 180: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:43,008 INFO L290 TraceCheckUtils]: 181: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:43,008 INFO L284 TraceCheckUtils]: 182: Hoare quadruple {41009#true} {41538#(and (< main_~b~0 1) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} #104#return; {41538#(and (< main_~b~0 1) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-28 12:44:43,009 INFO L272 TraceCheckUtils]: 183: Hoare triple {41538#(and (< main_~b~0 1) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:43,009 INFO L290 TraceCheckUtils]: 184: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:43,009 INFO L290 TraceCheckUtils]: 185: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:43,009 INFO L290 TraceCheckUtils]: 186: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:43,009 INFO L284 TraceCheckUtils]: 187: Hoare quadruple {41009#true} {41538#(and (< main_~b~0 1) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} #106#return; {41538#(and (< main_~b~0 1) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-28 12:44:43,009 INFO L272 TraceCheckUtils]: 188: Hoare triple {41538#(and (< main_~b~0 1) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:43,009 INFO L290 TraceCheckUtils]: 189: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:43,009 INFO L290 TraceCheckUtils]: 190: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:43,009 INFO L290 TraceCheckUtils]: 191: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:43,010 INFO L284 TraceCheckUtils]: 192: Hoare quadruple {41009#true} {41538#(and (< main_~b~0 1) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} #108#return; {41538#(and (< main_~b~0 1) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-28 12:44:43,010 INFO L290 TraceCheckUtils]: 193: Hoare triple {41538#(and (< main_~b~0 1) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} assume !(~c~0 >= 2 * ~v~0); {41538#(and (< main_~b~0 1) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} is VALID [2022-04-28 12:44:43,011 INFO L290 TraceCheckUtils]: 194: Hoare triple {41538#(and (< main_~b~0 1) (< main_~b~0 main_~c~0) (<= (div (- main_~v~0) (- 2)) main_~b~0))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {41608#(and (< main_~b~0 1) (< (div (+ (- 1) main_~c~0 (* (- 1) main_~b~0)) (- 2)) (+ main_~b~0 1)))} is VALID [2022-04-28 12:44:43,011 INFO L290 TraceCheckUtils]: 195: Hoare triple {41608#(and (< main_~b~0 1) (< (div (+ (- 1) main_~c~0 (* (- 1) main_~b~0)) (- 2)) (+ main_~b~0 1)))} assume !false; {41608#(and (< main_~b~0 1) (< (div (+ (- 1) main_~c~0 (* (- 1) main_~b~0)) (- 2)) (+ main_~b~0 1)))} is VALID [2022-04-28 12:44:43,013 INFO L290 TraceCheckUtils]: 196: Hoare triple {41608#(and (< main_~b~0 1) (< (div (+ (- 1) main_~c~0 (* (- 1) main_~b~0)) (- 2)) (+ main_~b~0 1)))} assume !(~c~0 >= ~b~0); {41010#false} is VALID [2022-04-28 12:44:43,013 INFO L290 TraceCheckUtils]: 197: Hoare triple {41010#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {41010#false} is VALID [2022-04-28 12:44:43,013 INFO L290 TraceCheckUtils]: 198: Hoare triple {41010#false} assume !false; {41010#false} is VALID [2022-04-28 12:44:43,013 INFO L290 TraceCheckUtils]: 199: Hoare triple {41010#false} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {41010#false} is VALID [2022-04-28 12:44:43,013 INFO L290 TraceCheckUtils]: 200: Hoare triple {41010#false} assume !false; {41010#false} is VALID [2022-04-28 12:44:43,014 INFO L290 TraceCheckUtils]: 201: Hoare triple {41010#false} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {41010#false} is VALID [2022-04-28 12:44:43,014 INFO L290 TraceCheckUtils]: 202: Hoare triple {41010#false} assume !false; {41010#false} is VALID [2022-04-28 12:44:43,014 INFO L272 TraceCheckUtils]: 203: Hoare triple {41010#false} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {41010#false} is VALID [2022-04-28 12:44:43,014 INFO L290 TraceCheckUtils]: 204: Hoare triple {41010#false} ~cond := #in~cond; {41010#false} is VALID [2022-04-28 12:44:43,014 INFO L290 TraceCheckUtils]: 205: Hoare triple {41010#false} assume 0 == ~cond; {41010#false} is VALID [2022-04-28 12:44:43,014 INFO L290 TraceCheckUtils]: 206: Hoare triple {41010#false} assume !false; {41010#false} is VALID [2022-04-28 12:44:43,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1760 backedges. 144 proven. 53 refuted. 0 times theorem prover too weak. 1563 trivial. 0 not checked. [2022-04-28 12:44:43,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:44:44,577 INFO L290 TraceCheckUtils]: 206: Hoare triple {41010#false} assume !false; {41010#false} is VALID [2022-04-28 12:44:44,577 INFO L290 TraceCheckUtils]: 205: Hoare triple {41010#false} assume 0 == ~cond; {41010#false} is VALID [2022-04-28 12:44:44,577 INFO L290 TraceCheckUtils]: 204: Hoare triple {41010#false} ~cond := #in~cond; {41010#false} is VALID [2022-04-28 12:44:44,578 INFO L272 TraceCheckUtils]: 203: Hoare triple {41010#false} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {41010#false} is VALID [2022-04-28 12:44:44,578 INFO L290 TraceCheckUtils]: 202: Hoare triple {41010#false} assume !false; {41010#false} is VALID [2022-04-28 12:44:44,578 INFO L290 TraceCheckUtils]: 201: Hoare triple {41010#false} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {41010#false} is VALID [2022-04-28 12:44:44,578 INFO L290 TraceCheckUtils]: 200: Hoare triple {41010#false} assume !false; {41010#false} is VALID [2022-04-28 12:44:44,578 INFO L290 TraceCheckUtils]: 199: Hoare triple {41010#false} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {41010#false} is VALID [2022-04-28 12:44:44,578 INFO L290 TraceCheckUtils]: 198: Hoare triple {41010#false} assume !false; {41010#false} is VALID [2022-04-28 12:44:44,578 INFO L290 TraceCheckUtils]: 197: Hoare triple {41010#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {41010#false} is VALID [2022-04-28 12:44:44,578 INFO L290 TraceCheckUtils]: 196: Hoare triple {41675#(<= main_~b~0 main_~c~0)} assume !(~c~0 >= ~b~0); {41010#false} is VALID [2022-04-28 12:44:44,578 INFO L290 TraceCheckUtils]: 195: Hoare triple {41675#(<= main_~b~0 main_~c~0)} assume !false; {41675#(<= main_~b~0 main_~c~0)} is VALID [2022-04-28 12:44:44,579 INFO L290 TraceCheckUtils]: 194: Hoare triple {41682#(<= (+ main_~b~0 main_~v~0) main_~c~0)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {41675#(<= main_~b~0 main_~c~0)} is VALID [2022-04-28 12:44:44,579 INFO L290 TraceCheckUtils]: 193: Hoare triple {41682#(<= (+ main_~b~0 main_~v~0) main_~c~0)} assume !(~c~0 >= 2 * ~v~0); {41682#(<= (+ main_~b~0 main_~v~0) main_~c~0)} is VALID [2022-04-28 12:44:44,580 INFO L284 TraceCheckUtils]: 192: Hoare quadruple {41009#true} {41682#(<= (+ main_~b~0 main_~v~0) main_~c~0)} #108#return; {41682#(<= (+ main_~b~0 main_~v~0) main_~c~0)} is VALID [2022-04-28 12:44:44,580 INFO L290 TraceCheckUtils]: 191: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:44,580 INFO L290 TraceCheckUtils]: 190: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:44,580 INFO L290 TraceCheckUtils]: 189: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:44,580 INFO L272 TraceCheckUtils]: 188: Hoare triple {41682#(<= (+ main_~b~0 main_~v~0) main_~c~0)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:44,580 INFO L284 TraceCheckUtils]: 187: Hoare quadruple {41009#true} {41682#(<= (+ main_~b~0 main_~v~0) main_~c~0)} #106#return; {41682#(<= (+ main_~b~0 main_~v~0) main_~c~0)} is VALID [2022-04-28 12:44:44,581 INFO L290 TraceCheckUtils]: 186: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:44,581 INFO L290 TraceCheckUtils]: 185: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:44,581 INFO L290 TraceCheckUtils]: 184: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:44,581 INFO L272 TraceCheckUtils]: 183: Hoare triple {41682#(<= (+ main_~b~0 main_~v~0) main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:44,581 INFO L284 TraceCheckUtils]: 182: Hoare quadruple {41009#true} {41682#(<= (+ main_~b~0 main_~v~0) main_~c~0)} #104#return; {41682#(<= (+ main_~b~0 main_~v~0) main_~c~0)} is VALID [2022-04-28 12:44:44,581 INFO L290 TraceCheckUtils]: 181: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:44,581 INFO L290 TraceCheckUtils]: 180: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:44,581 INFO L290 TraceCheckUtils]: 179: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:44,581 INFO L272 TraceCheckUtils]: 178: Hoare triple {41682#(<= (+ main_~b~0 main_~v~0) main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:44,582 INFO L284 TraceCheckUtils]: 177: Hoare quadruple {41009#true} {41682#(<= (+ main_~b~0 main_~v~0) main_~c~0)} #102#return; {41682#(<= (+ main_~b~0 main_~v~0) main_~c~0)} is VALID [2022-04-28 12:44:44,582 INFO L290 TraceCheckUtils]: 176: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:44,582 INFO L290 TraceCheckUtils]: 175: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:44,582 INFO L290 TraceCheckUtils]: 174: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:44,582 INFO L272 TraceCheckUtils]: 173: Hoare triple {41682#(<= (+ main_~b~0 main_~v~0) main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:44,582 INFO L290 TraceCheckUtils]: 172: Hoare triple {41682#(<= (+ main_~b~0 main_~v~0) main_~c~0)} assume !false; {41682#(<= (+ main_~b~0 main_~v~0) main_~c~0)} is VALID [2022-04-28 12:44:44,584 INFO L290 TraceCheckUtils]: 171: Hoare triple {41752#(<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {41682#(<= (+ main_~b~0 main_~v~0) main_~c~0)} is VALID [2022-04-28 12:44:44,584 INFO L284 TraceCheckUtils]: 170: Hoare quadruple {41009#true} {41752#(<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)} #108#return; {41752#(<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)} is VALID [2022-04-28 12:44:44,584 INFO L290 TraceCheckUtils]: 169: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:44,584 INFO L290 TraceCheckUtils]: 168: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:44,584 INFO L290 TraceCheckUtils]: 167: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:44,584 INFO L272 TraceCheckUtils]: 166: Hoare triple {41752#(<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:44,585 INFO L284 TraceCheckUtils]: 165: Hoare quadruple {41009#true} {41752#(<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)} #106#return; {41752#(<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)} is VALID [2022-04-28 12:44:44,585 INFO L290 TraceCheckUtils]: 164: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:44,585 INFO L290 TraceCheckUtils]: 163: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:44,585 INFO L290 TraceCheckUtils]: 162: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:44,585 INFO L272 TraceCheckUtils]: 161: Hoare triple {41752#(<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:44,585 INFO L284 TraceCheckUtils]: 160: Hoare quadruple {41009#true} {41752#(<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)} #104#return; {41752#(<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)} is VALID [2022-04-28 12:44:44,586 INFO L290 TraceCheckUtils]: 159: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:44,586 INFO L290 TraceCheckUtils]: 158: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:44,586 INFO L290 TraceCheckUtils]: 157: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:44,586 INFO L272 TraceCheckUtils]: 156: Hoare triple {41752#(<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:44,586 INFO L284 TraceCheckUtils]: 155: Hoare quadruple {41009#true} {41752#(<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)} #102#return; {41752#(<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)} is VALID [2022-04-28 12:44:44,586 INFO L290 TraceCheckUtils]: 154: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:44,586 INFO L290 TraceCheckUtils]: 153: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:44,586 INFO L290 TraceCheckUtils]: 152: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:44,586 INFO L272 TraceCheckUtils]: 151: Hoare triple {41752#(<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:44,587 INFO L290 TraceCheckUtils]: 150: Hoare triple {41752#(<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)} assume !false; {41752#(<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)} is VALID [2022-04-28 12:44:44,589 INFO L290 TraceCheckUtils]: 149: Hoare triple {41819#(<= main_~b~0 (div (+ main_~c~0 (* (- 1) main_~b~0)) 2))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {41752#(<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)} is VALID [2022-04-28 12:44:44,592 INFO L290 TraceCheckUtils]: 148: Hoare triple {41819#(<= main_~b~0 (div (+ main_~c~0 (* (- 1) main_~b~0)) 2))} assume !false; {41819#(<= main_~b~0 (div (+ main_~c~0 (* (- 1) main_~b~0)) 2))} is VALID [2022-04-28 12:44:44,594 INFO L290 TraceCheckUtils]: 147: Hoare triple {41826#(<= main_~b~0 (+ (div (+ (- 2) main_~a~0 (* (- 1) main_~b~0)) 2) 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {41819#(<= main_~b~0 (div (+ main_~c~0 (* (- 1) main_~b~0)) 2))} is VALID [2022-04-28 12:44:44,594 INFO L290 TraceCheckUtils]: 146: Hoare triple {41826#(<= main_~b~0 (+ (div (+ (- 2) main_~a~0 (* (- 1) main_~b~0)) 2) 1))} assume !false; {41826#(<= main_~b~0 (+ (div (+ (- 2) main_~a~0 (* (- 1) main_~b~0)) 2) 1))} is VALID [2022-04-28 12:44:44,595 INFO L290 TraceCheckUtils]: 145: Hoare triple {41833#(<= main_~c~0 (+ 2 (div (+ (* (- 1) main_~c~0) main_~b~0 (- 4)) 2)))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {41826#(<= main_~b~0 (+ (div (+ (- 2) main_~a~0 (* (- 1) main_~b~0)) 2) 1))} is VALID [2022-04-28 12:44:44,596 INFO L290 TraceCheckUtils]: 144: Hoare triple {41179#(<= main_~b~0 1)} assume !(~c~0 >= ~b~0); {41833#(<= main_~c~0 (+ 2 (div (+ (* (- 1) main_~c~0) main_~b~0 (- 4)) 2)))} is VALID [2022-04-28 12:44:44,596 INFO L290 TraceCheckUtils]: 143: Hoare triple {41179#(<= main_~b~0 1)} assume !false; {41179#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:44,596 INFO L290 TraceCheckUtils]: 142: Hoare triple {41179#(<= main_~b~0 1)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {41179#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:44,597 INFO L290 TraceCheckUtils]: 141: Hoare triple {41179#(<= main_~b~0 1)} assume !(~c~0 >= 2 * ~v~0); {41179#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:44,597 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {41009#true} {41179#(<= main_~b~0 1)} #108#return; {41179#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:44,597 INFO L290 TraceCheckUtils]: 139: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:44,597 INFO L290 TraceCheckUtils]: 138: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:44,597 INFO L290 TraceCheckUtils]: 137: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:44,597 INFO L272 TraceCheckUtils]: 136: Hoare triple {41179#(<= main_~b~0 1)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:44,598 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {41009#true} {41179#(<= main_~b~0 1)} #106#return; {41179#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:44,598 INFO L290 TraceCheckUtils]: 134: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:44,598 INFO L290 TraceCheckUtils]: 133: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:44,598 INFO L290 TraceCheckUtils]: 132: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:44,598 INFO L272 TraceCheckUtils]: 131: Hoare triple {41179#(<= main_~b~0 1)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:44,598 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {41009#true} {41179#(<= main_~b~0 1)} #104#return; {41179#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:44,598 INFO L290 TraceCheckUtils]: 129: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:44,599 INFO L290 TraceCheckUtils]: 128: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:44,599 INFO L290 TraceCheckUtils]: 127: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:44,599 INFO L272 TraceCheckUtils]: 126: Hoare triple {41179#(<= main_~b~0 1)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:44,599 INFO L284 TraceCheckUtils]: 125: Hoare quadruple {41009#true} {41179#(<= main_~b~0 1)} #102#return; {41179#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:44,599 INFO L290 TraceCheckUtils]: 124: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:44,599 INFO L290 TraceCheckUtils]: 123: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:44,599 INFO L290 TraceCheckUtils]: 122: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:44,599 INFO L272 TraceCheckUtils]: 121: Hoare triple {41179#(<= main_~b~0 1)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:44,600 INFO L290 TraceCheckUtils]: 120: Hoare triple {41179#(<= main_~b~0 1)} assume !false; {41179#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:44,600 INFO L290 TraceCheckUtils]: 119: Hoare triple {41179#(<= main_~b~0 1)} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {41179#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:44,600 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {41009#true} {41179#(<= main_~b~0 1)} #108#return; {41179#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:44,600 INFO L290 TraceCheckUtils]: 117: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:44,600 INFO L290 TraceCheckUtils]: 116: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:44,600 INFO L290 TraceCheckUtils]: 115: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:44,600 INFO L272 TraceCheckUtils]: 114: Hoare triple {41179#(<= main_~b~0 1)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:44,601 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {41009#true} {41179#(<= main_~b~0 1)} #106#return; {41179#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:44,601 INFO L290 TraceCheckUtils]: 112: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:44,601 INFO L290 TraceCheckUtils]: 111: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:44,601 INFO L290 TraceCheckUtils]: 110: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:44,601 INFO L272 TraceCheckUtils]: 109: Hoare triple {41179#(<= main_~b~0 1)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:44,601 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {41009#true} {41179#(<= main_~b~0 1)} #104#return; {41179#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:44,601 INFO L290 TraceCheckUtils]: 107: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:44,601 INFO L290 TraceCheckUtils]: 106: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:44,602 INFO L290 TraceCheckUtils]: 105: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:44,602 INFO L272 TraceCheckUtils]: 104: Hoare triple {41179#(<= main_~b~0 1)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:44,602 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {41009#true} {41179#(<= main_~b~0 1)} #102#return; {41179#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:44,602 INFO L290 TraceCheckUtils]: 102: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:44,602 INFO L290 TraceCheckUtils]: 101: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:44,602 INFO L290 TraceCheckUtils]: 100: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:44,602 INFO L272 TraceCheckUtils]: 99: Hoare triple {41179#(<= main_~b~0 1)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:44,602 INFO L290 TraceCheckUtils]: 98: Hoare triple {41179#(<= main_~b~0 1)} assume !false; {41179#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:44,603 INFO L290 TraceCheckUtils]: 97: Hoare triple {41179#(<= main_~b~0 1)} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {41179#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:44,603 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {41009#true} {41179#(<= main_~b~0 1)} #108#return; {41179#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:44,603 INFO L290 TraceCheckUtils]: 95: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:44,603 INFO L290 TraceCheckUtils]: 94: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:44,603 INFO L290 TraceCheckUtils]: 93: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:44,603 INFO L272 TraceCheckUtils]: 92: Hoare triple {41179#(<= main_~b~0 1)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:44,604 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {41009#true} {41179#(<= main_~b~0 1)} #106#return; {41179#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:44,604 INFO L290 TraceCheckUtils]: 90: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:44,604 INFO L290 TraceCheckUtils]: 89: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:44,604 INFO L290 TraceCheckUtils]: 88: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:44,604 INFO L272 TraceCheckUtils]: 87: Hoare triple {41179#(<= main_~b~0 1)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:44,604 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {41009#true} {41179#(<= main_~b~0 1)} #104#return; {41179#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:44,604 INFO L290 TraceCheckUtils]: 85: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:44,604 INFO L290 TraceCheckUtils]: 84: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:44,604 INFO L290 TraceCheckUtils]: 83: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:44,605 INFO L272 TraceCheckUtils]: 82: Hoare triple {41179#(<= main_~b~0 1)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:44,605 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {41009#true} {41179#(<= main_~b~0 1)} #102#return; {41179#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:44,605 INFO L290 TraceCheckUtils]: 80: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:44,605 INFO L290 TraceCheckUtils]: 79: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:44,605 INFO L290 TraceCheckUtils]: 78: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:44,605 INFO L272 TraceCheckUtils]: 77: Hoare triple {41179#(<= main_~b~0 1)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:44,605 INFO L290 TraceCheckUtils]: 76: Hoare triple {41179#(<= main_~b~0 1)} assume !false; {41179#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:44,606 INFO L290 TraceCheckUtils]: 75: Hoare triple {41179#(<= main_~b~0 1)} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {41179#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:44,606 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {41009#true} {41179#(<= main_~b~0 1)} #108#return; {41179#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:44,606 INFO L290 TraceCheckUtils]: 73: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:44,606 INFO L290 TraceCheckUtils]: 72: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:44,606 INFO L290 TraceCheckUtils]: 71: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:44,606 INFO L272 TraceCheckUtils]: 70: Hoare triple {41179#(<= main_~b~0 1)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:44,607 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {41009#true} {41179#(<= main_~b~0 1)} #106#return; {41179#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:44,607 INFO L290 TraceCheckUtils]: 68: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:44,607 INFO L290 TraceCheckUtils]: 67: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:44,607 INFO L290 TraceCheckUtils]: 66: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:44,607 INFO L272 TraceCheckUtils]: 65: Hoare triple {41179#(<= main_~b~0 1)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:44,607 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {41009#true} {41179#(<= main_~b~0 1)} #104#return; {41179#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:44,607 INFO L290 TraceCheckUtils]: 63: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:44,607 INFO L290 TraceCheckUtils]: 62: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:44,607 INFO L290 TraceCheckUtils]: 61: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:44,608 INFO L272 TraceCheckUtils]: 60: Hoare triple {41179#(<= main_~b~0 1)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:44,608 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {41009#true} {41179#(<= main_~b~0 1)} #102#return; {41179#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:44,608 INFO L290 TraceCheckUtils]: 58: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:44,608 INFO L290 TraceCheckUtils]: 57: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:44,608 INFO L290 TraceCheckUtils]: 56: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:44,608 INFO L272 TraceCheckUtils]: 55: Hoare triple {41179#(<= main_~b~0 1)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:44,608 INFO L290 TraceCheckUtils]: 54: Hoare triple {41179#(<= main_~b~0 1)} assume !false; {41179#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:44,609 INFO L290 TraceCheckUtils]: 53: Hoare triple {42110#(or (<= main_~b~0 1) (not (<= (* main_~v~0 2) main_~c~0)))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {41179#(<= main_~b~0 1)} is VALID [2022-04-28 12:44:44,609 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {41009#true} {42110#(or (<= main_~b~0 1) (not (<= (* main_~v~0 2) main_~c~0)))} #108#return; {42110#(or (<= main_~b~0 1) (not (<= (* main_~v~0 2) main_~c~0)))} is VALID [2022-04-28 12:44:44,609 INFO L290 TraceCheckUtils]: 51: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:44,609 INFO L290 TraceCheckUtils]: 50: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:44,609 INFO L290 TraceCheckUtils]: 49: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:44,609 INFO L272 TraceCheckUtils]: 48: Hoare triple {42110#(or (<= main_~b~0 1) (not (<= (* main_~v~0 2) main_~c~0)))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:44,610 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {41009#true} {42110#(or (<= main_~b~0 1) (not (<= (* main_~v~0 2) main_~c~0)))} #106#return; {42110#(or (<= main_~b~0 1) (not (<= (* main_~v~0 2) main_~c~0)))} is VALID [2022-04-28 12:44:44,610 INFO L290 TraceCheckUtils]: 46: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:44,610 INFO L290 TraceCheckUtils]: 45: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:44,610 INFO L290 TraceCheckUtils]: 44: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:44,610 INFO L272 TraceCheckUtils]: 43: Hoare triple {42110#(or (<= main_~b~0 1) (not (<= (* main_~v~0 2) main_~c~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:44,611 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {41009#true} {42110#(or (<= main_~b~0 1) (not (<= (* main_~v~0 2) main_~c~0)))} #104#return; {42110#(or (<= main_~b~0 1) (not (<= (* main_~v~0 2) main_~c~0)))} is VALID [2022-04-28 12:44:44,611 INFO L290 TraceCheckUtils]: 41: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:44,611 INFO L290 TraceCheckUtils]: 40: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:44,611 INFO L290 TraceCheckUtils]: 39: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:44,611 INFO L272 TraceCheckUtils]: 38: Hoare triple {42110#(or (<= main_~b~0 1) (not (<= (* main_~v~0 2) main_~c~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:44,611 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {41009#true} {42110#(or (<= main_~b~0 1) (not (<= (* main_~v~0 2) main_~c~0)))} #102#return; {42110#(or (<= main_~b~0 1) (not (<= (* main_~v~0 2) main_~c~0)))} is VALID [2022-04-28 12:44:44,611 INFO L290 TraceCheckUtils]: 36: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:44,611 INFO L290 TraceCheckUtils]: 35: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:44,611 INFO L290 TraceCheckUtils]: 34: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:44,611 INFO L272 TraceCheckUtils]: 33: Hoare triple {42110#(or (<= main_~b~0 1) (not (<= (* main_~v~0 2) main_~c~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:44,612 INFO L290 TraceCheckUtils]: 32: Hoare triple {42110#(or (<= main_~b~0 1) (not (<= (* main_~v~0 2) main_~c~0)))} assume !false; {42110#(or (<= main_~b~0 1) (not (<= (* main_~v~0 2) main_~c~0)))} is VALID [2022-04-28 12:44:44,613 INFO L290 TraceCheckUtils]: 31: Hoare triple {42177#(<= (div main_~c~0 2) 1)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {42110#(or (<= main_~b~0 1) (not (<= (* main_~v~0 2) main_~c~0)))} is VALID [2022-04-28 12:44:44,613 INFO L290 TraceCheckUtils]: 30: Hoare triple {42177#(<= (div main_~c~0 2) 1)} assume !false; {42177#(<= (div main_~c~0 2) 1)} is VALID [2022-04-28 12:44:44,614 INFO L290 TraceCheckUtils]: 29: Hoare triple {42184#(<= (div (+ (- 1) (* (- 1) main_~a~0)) (- 2)) 2)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {42177#(<= (div main_~c~0 2) 1)} is VALID [2022-04-28 12:44:44,614 INFO L290 TraceCheckUtils]: 28: Hoare triple {42184#(<= (div (+ (- 1) (* (- 1) main_~a~0)) (- 2)) 2)} assume !false; {42184#(<= (div (+ (- 1) (* (- 1) main_~a~0)) (- 2)) 2)} is VALID [2022-04-28 12:44:44,615 INFO L290 TraceCheckUtils]: 27: Hoare triple {42191#(<= (div (+ (- 3) (* (- 1) main_~x~0)) (- 2)) 3)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {42184#(<= (div (+ (- 1) (* (- 1) main_~a~0)) (- 2)) 2)} is VALID [2022-04-28 12:44:44,615 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {41009#true} {42191#(<= (div (+ (- 3) (* (- 1) main_~x~0)) (- 2)) 3)} #100#return; {42191#(<= (div (+ (- 3) (* (- 1) main_~x~0)) (- 2)) 3)} is VALID [2022-04-28 12:44:44,615 INFO L290 TraceCheckUtils]: 25: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:44,615 INFO L290 TraceCheckUtils]: 24: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:44,615 INFO L290 TraceCheckUtils]: 23: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:44,615 INFO L272 TraceCheckUtils]: 22: Hoare triple {42191#(<= (div (+ (- 3) (* (- 1) main_~x~0)) (- 2)) 3)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:44,616 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {41009#true} {42191#(<= (div (+ (- 3) (* (- 1) main_~x~0)) (- 2)) 3)} #98#return; {42191#(<= (div (+ (- 3) (* (- 1) main_~x~0)) (- 2)) 3)} is VALID [2022-04-28 12:44:44,616 INFO L290 TraceCheckUtils]: 20: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:44,616 INFO L290 TraceCheckUtils]: 19: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:44,616 INFO L290 TraceCheckUtils]: 18: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:44,616 INFO L272 TraceCheckUtils]: 17: Hoare triple {42191#(<= (div (+ (- 3) (* (- 1) main_~x~0)) (- 2)) 3)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:44,616 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {41009#true} {42191#(<= (div (+ (- 3) (* (- 1) main_~x~0)) (- 2)) 3)} #96#return; {42191#(<= (div (+ (- 3) (* (- 1) main_~x~0)) (- 2)) 3)} is VALID [2022-04-28 12:44:44,616 INFO L290 TraceCheckUtils]: 15: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:44,616 INFO L290 TraceCheckUtils]: 14: Hoare triple {41009#true} assume !(0 == ~cond); {41009#true} is VALID [2022-04-28 12:44:44,616 INFO L290 TraceCheckUtils]: 13: Hoare triple {41009#true} ~cond := #in~cond; {41009#true} is VALID [2022-04-28 12:44:44,616 INFO L272 TraceCheckUtils]: 12: Hoare triple {42191#(<= (div (+ (- 3) (* (- 1) main_~x~0)) (- 2)) 3)} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:44,617 INFO L290 TraceCheckUtils]: 11: Hoare triple {42191#(<= (div (+ (- 3) (* (- 1) main_~x~0)) (- 2)) 3)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {42191#(<= (div (+ (- 3) (* (- 1) main_~x~0)) (- 2)) 3)} is VALID [2022-04-28 12:44:44,617 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41039#(not (= |assume_abort_if_not_#in~cond| 0))} {41009#true} #94#return; {42191#(<= (div (+ (- 3) (* (- 1) main_~x~0)) (- 2)) 3)} is VALID [2022-04-28 12:44:44,617 INFO L290 TraceCheckUtils]: 9: Hoare triple {41039#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {41039#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:44:44,618 INFO L290 TraceCheckUtils]: 8: Hoare triple {42252#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {41039#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:44:44,618 INFO L290 TraceCheckUtils]: 7: Hoare triple {41009#true} ~cond := #in~cond; {42252#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-28 12:44:44,618 INFO L272 TraceCheckUtils]: 6: Hoare triple {41009#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {41009#true} is VALID [2022-04-28 12:44:44,618 INFO L290 TraceCheckUtils]: 5: Hoare triple {41009#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {41009#true} is VALID [2022-04-28 12:44:44,618 INFO L272 TraceCheckUtils]: 4: Hoare triple {41009#true} call #t~ret6 := main(); {41009#true} is VALID [2022-04-28 12:44:44,618 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41009#true} {41009#true} #112#return; {41009#true} is VALID [2022-04-28 12:44:44,618 INFO L290 TraceCheckUtils]: 2: Hoare triple {41009#true} assume true; {41009#true} is VALID [2022-04-28 12:44:44,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {41009#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(11, 2);call #Ultimate.allocInit(12, 3); {41009#true} is VALID [2022-04-28 12:44:44,618 INFO L272 TraceCheckUtils]: 0: Hoare triple {41009#true} call ULTIMATE.init(); {41009#true} is VALID [2022-04-28 12:44:44,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1760 backedges. 107 proven. 90 refuted. 0 times theorem prover too weak. 1563 trivial. 0 not checked. [2022-04-28 12:44:44,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:44:44,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079253730] [2022-04-28 12:44:44,619 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:44:44,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275767975] [2022-04-28 12:44:44,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275767975] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:44:44,619 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:44:44,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 26 [2022-04-28 12:44:44,620 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:44:44,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1544668744] [2022-04-28 12:44:44,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1544668744] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:44:44,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:44:44,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 12:44:44,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940901874] [2022-04-28 12:44:44,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:44:44,620 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 7 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 6 states have call predecessors, (21), 6 states have call successors, (21) Word has length 207 [2022-04-28 12:44:44,620 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:44:44,621 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 7 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 6 states have call predecessors, (21), 6 states have call successors, (21) [2022-04-28 12:44:44,715 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:44:44,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 12:44:44,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:44:44,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 12:44:44,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2022-04-28 12:44:44,716 INFO L87 Difference]: Start difference. First operand 146 states and 179 transitions. Second operand has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 7 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 6 states have call predecessors, (21), 6 states have call successors, (21) [2022-04-28 12:44:46,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:44:46,415 INFO L93 Difference]: Finished difference Result 158 states and 188 transitions. [2022-04-28 12:44:46,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 12:44:46,415 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 7 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 6 states have call predecessors, (21), 6 states have call successors, (21) Word has length 207 [2022-04-28 12:44:46,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:44:46,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 7 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 6 states have call predecessors, (21), 6 states have call successors, (21) [2022-04-28 12:44:46,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 98 transitions. [2022-04-28 12:44:46,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 7 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 6 states have call predecessors, (21), 6 states have call successors, (21) [2022-04-28 12:44:46,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 98 transitions. [2022-04-28 12:44:46,417 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 98 transitions. [2022-04-28 12:44:46,520 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:44:46,520 INFO L225 Difference]: With dead ends: 158 [2022-04-28 12:44:46,520 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 12:44:46,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 389 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=247, Invalid=1085, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 12:44:46,521 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 38 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 12:44:46,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 230 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 12:44:46,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 12:44:46,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 12:44:46,521 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:44:46,522 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 12:44:46,522 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 12:44:46,522 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 12:44:46,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:44:46,522 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 12:44:46,522 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 12:44:46,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:44:46,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:44:46,522 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 12:44:46,522 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 12:44:46,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:44:46,522 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 12:44:46,522 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 12:44:46,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:44:46,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:44:46,522 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:44:46,522 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:44:46,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 12:44:46,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 12:44:46,522 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 207 [2022-04-28 12:44:46,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:44:46,523 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 12:44:46,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 7 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 6 states have call predecessors, (21), 6 states have call successors, (21) [2022-04-28 12:44:46,523 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 12:44:46,523 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:44:46,523 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 12:44:46,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:44:46,525 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 12:44:46,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-28 12:44:46,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-28 12:44:46,727 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.