/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_valuebound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 05:52:55,400 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 05:52:55,402 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 05:52:55,448 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 05:52:55,448 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 05:52:55,449 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 05:52:55,450 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 05:52:55,452 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 05:52:55,453 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 05:52:55,454 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 05:52:55,454 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 05:52:55,459 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 05:52:55,459 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 05:52:55,465 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 05:52:55,466 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 05:52:55,470 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 05:52:55,471 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 05:52:55,473 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 05:52:55,475 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 05:52:55,480 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 05:52:55,481 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 05:52:55,482 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 05:52:55,483 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 05:52:55,484 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 05:52:55,486 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 05:52:55,489 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 05:52:55,490 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 05:52:55,490 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 05:52:55,491 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 05:52:55,491 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 05:52:55,492 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 05:52:55,492 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 05:52:55,493 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 05:52:55,494 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 05:52:55,495 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 05:52:55,495 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 05:52:55,495 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 05:52:55,496 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 05:52:55,496 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 05:52:55,496 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 05:52:55,497 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 05:52:55,498 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 05:52:55,499 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 05:52:55,509 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 05:52:55,509 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 05:52:55,510 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 05:52:55,511 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 05:52:55,511 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 05:52:55,511 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 05:52:55,511 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 05:52:55,511 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 05:52:55,511 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 05:52:55,512 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 05:52:55,512 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 05:52:55,512 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 05:52:55,512 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 05:52:55,512 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 05:52:55,513 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 05:52:55,513 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 05:52:55,513 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 05:52:55,513 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 05:52:55,513 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 05:52:55,513 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 05:52:55,513 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 05:52:55,513 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 05:52:55,513 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 05:52:55,514 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 05:52:55,514 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 05:52:55,514 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 05:52:55,704 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 05:52:55,726 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 05:52:55,728 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 05:52:55,729 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 05:52:55,730 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 05:52:55,731 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_valuebound5.c [2022-04-28 05:52:55,795 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffb306b14/87001ad80f4a4838b55cb8bfa17e80cf/FLAG2f9949c90 [2022-04-28 05:52:56,163 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 05:52:56,163 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_valuebound5.c [2022-04-28 05:52:56,172 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffb306b14/87001ad80f4a4838b55cb8bfa17e80cf/FLAG2f9949c90 [2022-04-28 05:52:56,183 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffb306b14/87001ad80f4a4838b55cb8bfa17e80cf [2022-04-28 05:52:56,184 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 05:52:56,186 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 05:52:56,187 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 05:52:56,187 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 05:52:56,189 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 05:52:56,190 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 05:52:56" (1/1) ... [2022-04-28 05:52:56,191 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3abb6531 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:52:56, skipping insertion in model container [2022-04-28 05:52:56,191 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 05:52:56" (1/1) ... [2022-04-28 05:52:56,196 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 05:52:56,207 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 05:52:56,338 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_valuebound5.c[490,503] [2022-04-28 05:52:56,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 05:52:56,368 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 05:52:56,378 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_valuebound5.c[490,503] [2022-04-28 05:52:56,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 05:52:56,399 INFO L208 MainTranslator]: Completed translation [2022-04-28 05:52:56,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:52:56 WrapperNode [2022-04-28 05:52:56,399 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 05:52:56,400 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 05:52:56,400 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 05:52:56,400 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 05:52:56,409 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:52:56" (1/1) ... [2022-04-28 05:52:56,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:52:56" (1/1) ... [2022-04-28 05:52:56,416 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:52:56" (1/1) ... [2022-04-28 05:52:56,416 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:52:56" (1/1) ... [2022-04-28 05:52:56,422 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:52:56" (1/1) ... [2022-04-28 05:52:56,428 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:52:56" (1/1) ... [2022-04-28 05:52:56,429 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:52:56" (1/1) ... [2022-04-28 05:52:56,430 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 05:52:56,431 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 05:52:56,431 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 05:52:56,431 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 05:52:56,432 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:52:56" (1/1) ... [2022-04-28 05:52:56,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 05:52:56,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:52:56,464 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 05:52:56,469 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 05:52:56,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 05:52:56,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 05:52:56,491 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 05:52:56,491 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 05:52:56,491 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 05:52:56,491 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 05:52:56,491 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 05:52:56,491 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 05:52:56,491 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 05:52:56,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 05:52:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 05:52:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 05:52:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 05:52:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 05:52:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 05:52:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 05:52:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 05:52:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 05:52:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 05:52:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 05:52:56,540 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 05:52:56,541 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 05:52:56,695 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 05:52:56,701 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 05:52:56,701 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-28 05:52:56,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 05:52:56 BoogieIcfgContainer [2022-04-28 05:52:56,702 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 05:52:56,704 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 05:52:56,704 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 05:52:56,707 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 05:52:56,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 05:52:56" (1/3) ... [2022-04-28 05:52:56,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dcbc8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 05:52:56, skipping insertion in model container [2022-04-28 05:52:56,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:52:56" (2/3) ... [2022-04-28 05:52:56,708 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dcbc8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 05:52:56, skipping insertion in model container [2022-04-28 05:52:56,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 05:52:56" (3/3) ... [2022-04-28 05:52:56,709 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd3-ll_valuebound5.c [2022-04-28 05:52:56,720 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 05:52:56,721 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 05:52:56,776 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 05:52:56,781 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@c1667c7, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@41b42540 [2022-04-28 05:52:56,782 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 05:52:56,808 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 05:52:56,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 05:52:56,815 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:52:56,816 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 05:52:56,816 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:52:56,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:52:56,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1237885594, now seen corresponding path program 1 times [2022-04-28 05:52:56,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:52:56,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1169037127] [2022-04-28 05:52:56,855 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:52:56,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1237885594, now seen corresponding path program 2 times [2022-04-28 05:52:56,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:52:56,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465119889] [2022-04-28 05:52:56,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:52:56,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:52:56,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:52:57,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 05:52:57,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:52:57,070 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 05:52:57,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume true; {43#true} is VALID [2022-04-28 05:52:57,070 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43#true} {43#true} #112#return; {43#true} is VALID [2022-04-28 05:52:57,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 05:52:57,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:52:57,095 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 05:52:57,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 05:52:57,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 05:52:57,096 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {43#true} #94#return; {44#false} is VALID [2022-04-28 05:52:57,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 05:52:57,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:52:57,108 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 05:52:57,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 05:52:57,109 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 05:52:57,109 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #96#return; {44#false} is VALID [2022-04-28 05:52:57,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-28 05:52:57,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:52:57,120 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 05:52:57,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 05:52:57,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 05:52:57,121 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #98#return; {44#false} is VALID [2022-04-28 05:52:57,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-28 05:52:57,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:52:57,138 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 05:52:57,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 05:52:57,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 05:52:57,140 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #100#return; {44#false} is VALID [2022-04-28 05:52:57,142 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 05:52:57,142 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 05:52:57,142 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#true} assume true; {43#true} is VALID [2022-04-28 05:52:57,142 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#true} {43#true} #112#return; {43#true} is VALID [2022-04-28 05:52:57,143 INFO L272 TraceCheckUtils]: 4: Hoare triple {43#true} call #t~ret6 := main(); {43#true} is VALID [2022-04-28 05:52:57,144 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 05:52:57,144 INFO L272 TraceCheckUtils]: 6: Hoare triple {43#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {43#true} is VALID [2022-04-28 05:52:57,144 INFO L290 TraceCheckUtils]: 7: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 05:52:57,145 INFO L290 TraceCheckUtils]: 8: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 05:52:57,145 INFO L290 TraceCheckUtils]: 9: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 05:52:57,146 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {44#false} {43#true} #94#return; {44#false} is VALID [2022-04-28 05:52:57,146 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 05:52:57,146 INFO L272 TraceCheckUtils]: 12: Hoare triple {44#false} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {43#true} is VALID [2022-04-28 05:52:57,147 INFO L290 TraceCheckUtils]: 13: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 05:52:57,148 INFO L290 TraceCheckUtils]: 14: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 05:52:57,149 INFO L290 TraceCheckUtils]: 15: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 05:52:57,149 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {44#false} {44#false} #96#return; {44#false} is VALID [2022-04-28 05:52:57,149 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 05:52:57,150 INFO L290 TraceCheckUtils]: 18: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 05:52:57,151 INFO L290 TraceCheckUtils]: 19: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 05:52:57,151 INFO L290 TraceCheckUtils]: 20: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 05:52:57,152 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {44#false} {44#false} #98#return; {44#false} is VALID [2022-04-28 05:52:57,153 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 05:52:57,153 INFO L290 TraceCheckUtils]: 23: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 05:52:57,153 INFO L290 TraceCheckUtils]: 24: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 05:52:57,154 INFO L290 TraceCheckUtils]: 25: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 05:52:57,154 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {44#false} {44#false} #100#return; {44#false} is VALID [2022-04-28 05:52:57,154 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 05:52:57,158 INFO L290 TraceCheckUtils]: 28: Hoare triple {44#false} assume false; {44#false} is VALID [2022-04-28 05:52:57,158 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 05:52:57,158 INFO L290 TraceCheckUtils]: 30: Hoare triple {44#false} ~cond := #in~cond; {44#false} is VALID [2022-04-28 05:52:57,159 INFO L290 TraceCheckUtils]: 31: Hoare triple {44#false} assume 0 == ~cond; {44#false} is VALID [2022-04-28 05:52:57,159 INFO L290 TraceCheckUtils]: 32: Hoare triple {44#false} assume !false; {44#false} is VALID [2022-04-28 05:52:57,159 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 05:52:57,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:52:57,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465119889] [2022-04-28 05:52:57,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465119889] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:52:57,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:52:57,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 05:52:57,163 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:52:57,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1169037127] [2022-04-28 05:52:57,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1169037127] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:52:57,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:52:57,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 05:52:57,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003679297] [2022-04-28 05:52:57,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:52:57,173 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 05:52:57,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:52:57,179 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 05:52:57,226 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 05:52:57,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 05:52:57,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:52:57,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 05:52:57,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 05:52:57,264 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 05:52:57,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:52:57,491 INFO L93 Difference]: Finished difference Result 73 states and 115 transitions. [2022-04-28 05:52:57,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 05:52:57,492 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 05:52:57,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:52:57,494 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 05:52:57,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2022-04-28 05:52:57,502 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 05:52:57,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2022-04-28 05:52:57,507 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 115 transitions. [2022-04-28 05:52:57,620 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 05:52:57,628 INFO L225 Difference]: With dead ends: 73 [2022-04-28 05:52:57,628 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 05:52:57,630 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 05:52:57,633 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 05:52:57,634 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 05:52:57,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 05:52:57,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-28 05:52:57,660 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:52:57,660 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 05:52:57,661 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 05:52:57,661 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 05:52:57,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:52:57,665 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-28 05:52:57,666 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-28 05:52:57,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:52:57,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:52:57,667 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 05:52:57,667 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 05:52:57,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:52:57,671 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-28 05:52:57,671 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-28 05:52:57,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:52:57,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:52:57,672 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:52:57,672 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:52:57,672 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 05:52:57,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2022-04-28 05:52:57,676 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 33 [2022-04-28 05:52:57,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:52:57,676 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2022-04-28 05:52:57,676 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 05:52:57,676 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 44 transitions. [2022-04-28 05:52:57,734 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 05:52:57,735 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-28 05:52:57,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 05:52:57,736 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:52:57,736 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 05:52:57,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 05:52:57,737 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:52:57,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:52:57,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1569470122, now seen corresponding path program 1 times [2022-04-28 05:52:57,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:52:57,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2054594048] [2022-04-28 05:52:57,738 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:52:57,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1569470122, now seen corresponding path program 2 times [2022-04-28 05:52:57,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:52:57,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996451066] [2022-04-28 05:52:57,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:52:57,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:52:57,761 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:52:57,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [432626019] [2022-04-28 05:52:57,761 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:52:57,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:52:57,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:52:57,771 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 05:52:57,787 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 05:52:57,831 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 05:52:57,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:52:57,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 05:52:57,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:52:57,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:52:58,130 INFO L272 TraceCheckUtils]: 0: Hoare triple {353#true} call ULTIMATE.init(); {353#true} is VALID [2022-04-28 05:52:58,131 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 05:52:58,131 INFO L290 TraceCheckUtils]: 2: Hoare triple {353#true} assume true; {353#true} is VALID [2022-04-28 05:52:58,131 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {353#true} {353#true} #112#return; {353#true} is VALID [2022-04-28 05:52:58,132 INFO L272 TraceCheckUtils]: 4: Hoare triple {353#true} call #t~ret6 := main(); {353#true} is VALID [2022-04-28 05:52:58,132 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 05:52:58,132 INFO L272 TraceCheckUtils]: 6: Hoare triple {353#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {353#true} is VALID [2022-04-28 05:52:58,132 INFO L290 TraceCheckUtils]: 7: Hoare triple {353#true} ~cond := #in~cond; {353#true} is VALID [2022-04-28 05:52:58,132 INFO L290 TraceCheckUtils]: 8: Hoare triple {353#true} assume !(0 == ~cond); {353#true} is VALID [2022-04-28 05:52:58,133 INFO L290 TraceCheckUtils]: 9: Hoare triple {353#true} assume true; {353#true} is VALID [2022-04-28 05:52:58,133 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {353#true} {353#true} #94#return; {353#true} is VALID [2022-04-28 05:52:58,133 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 05:52:58,133 INFO L272 TraceCheckUtils]: 12: Hoare triple {353#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {353#true} is VALID [2022-04-28 05:52:58,133 INFO L290 TraceCheckUtils]: 13: Hoare triple {353#true} ~cond := #in~cond; {353#true} is VALID [2022-04-28 05:52:58,134 INFO L290 TraceCheckUtils]: 14: Hoare triple {353#true} assume !(0 == ~cond); {353#true} is VALID [2022-04-28 05:52:58,134 INFO L290 TraceCheckUtils]: 15: Hoare triple {353#true} assume true; {353#true} is VALID [2022-04-28 05:52:58,134 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {353#true} {353#true} #96#return; {353#true} is VALID [2022-04-28 05:52:58,134 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 05:52:58,134 INFO L290 TraceCheckUtils]: 18: Hoare triple {353#true} ~cond := #in~cond; {353#true} is VALID [2022-04-28 05:52:58,134 INFO L290 TraceCheckUtils]: 19: Hoare triple {353#true} assume !(0 == ~cond); {353#true} is VALID [2022-04-28 05:52:58,135 INFO L290 TraceCheckUtils]: 20: Hoare triple {353#true} assume true; {353#true} is VALID [2022-04-28 05:52:58,135 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {353#true} {353#true} #98#return; {353#true} is VALID [2022-04-28 05:52:58,135 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 05:52:58,135 INFO L290 TraceCheckUtils]: 23: Hoare triple {353#true} ~cond := #in~cond; {353#true} is VALID [2022-04-28 05:52:58,136 INFO L290 TraceCheckUtils]: 24: Hoare triple {353#true} assume !(0 == ~cond); {353#true} is VALID [2022-04-28 05:52:58,136 INFO L290 TraceCheckUtils]: 25: Hoare triple {353#true} assume true; {353#true} is VALID [2022-04-28 05:52:58,136 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {353#true} {353#true} #100#return; {353#true} is VALID [2022-04-28 05:52:58,137 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 05:52:58,138 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 05:52:58,138 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 05:52:58,140 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 05:52:58,140 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 05:52:58,141 INFO L290 TraceCheckUtils]: 32: Hoare triple {454#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {354#false} is VALID [2022-04-28 05:52:58,141 INFO L290 TraceCheckUtils]: 33: Hoare triple {354#false} assume !false; {354#false} is VALID [2022-04-28 05:52:58,142 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 05:52:58,142 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:52:58,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:52:58,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996451066] [2022-04-28 05:52:58,142 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:52:58,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432626019] [2022-04-28 05:52:58,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432626019] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:52:58,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:52:58,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 05:52:58,144 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:52:58,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2054594048] [2022-04-28 05:52:58,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2054594048] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:52:58,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:52:58,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 05:52:58,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727608862] [2022-04-28 05:52:58,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:52:58,146 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 05:52:58,147 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:52:58,150 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 05:52:58,184 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 05:52:58,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 05:52:58,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:52:58,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 05:52:58,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 05:52:58,188 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 05:52:58,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:52:58,558 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2022-04-28 05:52:58,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 05:52:58,558 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 05:52:58,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:52:58,559 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 05:52:58,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-04-28 05:52:58,568 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 05:52:58,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-04-28 05:52:58,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 69 transitions. [2022-04-28 05:52:58,636 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 05:52:58,642 INFO L225 Difference]: With dead ends: 54 [2022-04-28 05:52:58,642 INFO L226 Difference]: Without dead ends: 51 [2022-04-28 05:52:58,642 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 05:52:58,644 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 05:52:58,649 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 05:52:58,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-28 05:52:58,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-04-28 05:52:58,667 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:52:58,668 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 05:52:58,670 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 05:52:58,670 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 05:52:58,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:52:58,682 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2022-04-28 05:52:58,682 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2022-04-28 05:52:58,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:52:58,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:52:58,688 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 05:52:58,688 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 05:52:58,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:52:58,691 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2022-04-28 05:52:58,691 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2022-04-28 05:52:58,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:52:58,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:52:58,692 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:52:58,692 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:52:58,692 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 05:52:58,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2022-04-28 05:52:58,696 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 34 [2022-04-28 05:52:58,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:52:58,697 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2022-04-28 05:52:58,697 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 05:52:58,697 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 64 transitions. [2022-04-28 05:52:58,774 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 05:52:58,774 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-28 05:52:58,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 05:52:58,775 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:52:58,775 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 05:52:58,799 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 05:52:58,987 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 05:52:58,988 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:52:58,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:52:58,988 INFO L85 PathProgramCache]: Analyzing trace with hash 584996456, now seen corresponding path program 1 times [2022-04-28 05:52:58,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:52:58,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1370122965] [2022-04-28 05:52:58,989 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:52:58,989 INFO L85 PathProgramCache]: Analyzing trace with hash 584996456, now seen corresponding path program 2 times [2022-04-28 05:52:58,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:52:58,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056923895] [2022-04-28 05:52:58,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:52:58,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:52:59,006 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:52:59,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1635085247] [2022-04-28 05:52:59,007 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:52:59,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:52:59,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:52:59,008 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 05:52:59,022 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 05:52:59,057 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:52:59,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:52:59,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 05:52:59,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:52:59,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:52:59,218 INFO L272 TraceCheckUtils]: 0: Hoare triple {774#true} call ULTIMATE.init(); {774#true} is VALID [2022-04-28 05:52:59,218 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 05:52:59,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-28 05:52:59,218 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {774#true} {774#true} #112#return; {774#true} is VALID [2022-04-28 05:52:59,218 INFO L272 TraceCheckUtils]: 4: Hoare triple {774#true} call #t~ret6 := main(); {774#true} is VALID [2022-04-28 05:52:59,218 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 05:52:59,218 INFO L272 TraceCheckUtils]: 6: Hoare triple {774#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {774#true} is VALID [2022-04-28 05:52:59,219 INFO L290 TraceCheckUtils]: 7: Hoare triple {774#true} ~cond := #in~cond; {774#true} is VALID [2022-04-28 05:52:59,219 INFO L290 TraceCheckUtils]: 8: Hoare triple {774#true} assume !(0 == ~cond); {774#true} is VALID [2022-04-28 05:52:59,219 INFO L290 TraceCheckUtils]: 9: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-28 05:52:59,219 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {774#true} {774#true} #94#return; {774#true} is VALID [2022-04-28 05:52:59,219 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 05:52:59,219 INFO L272 TraceCheckUtils]: 12: Hoare triple {774#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {774#true} is VALID [2022-04-28 05:52:59,220 INFO L290 TraceCheckUtils]: 13: Hoare triple {774#true} ~cond := #in~cond; {774#true} is VALID [2022-04-28 05:52:59,220 INFO L290 TraceCheckUtils]: 14: Hoare triple {774#true} assume !(0 == ~cond); {774#true} is VALID [2022-04-28 05:52:59,220 INFO L290 TraceCheckUtils]: 15: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-28 05:52:59,220 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {774#true} {774#true} #96#return; {774#true} is VALID [2022-04-28 05:52:59,220 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 05:52:59,221 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 05:52:59,222 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 05:52:59,225 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 05:52:59,231 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 05:52:59,231 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 05:52:59,232 INFO L290 TraceCheckUtils]: 23: Hoare triple {774#true} ~cond := #in~cond; {774#true} is VALID [2022-04-28 05:52:59,232 INFO L290 TraceCheckUtils]: 24: Hoare triple {774#true} assume !(0 == ~cond); {774#true} is VALID [2022-04-28 05:52:59,232 INFO L290 TraceCheckUtils]: 25: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-28 05:52:59,233 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 05:52:59,234 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 05:52:59,235 INFO L290 TraceCheckUtils]: 28: Hoare triple {863#(<= 1 main_~a~0)} assume !false; {863#(<= 1 main_~a~0)} is VALID [2022-04-28 05:52:59,237 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 05:52:59,237 INFO L290 TraceCheckUtils]: 30: Hoare triple {870#(<= 1 main_~c~0)} assume !false; {870#(<= 1 main_~c~0)} is VALID [2022-04-28 05:52:59,240 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 05:52:59,241 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 05:52:59,242 INFO L290 TraceCheckUtils]: 33: Hoare triple {880#(<= 1 main_~b~0)} assume !false; {880#(<= 1 main_~b~0)} is VALID [2022-04-28 05:52:59,243 INFO L290 TraceCheckUtils]: 34: Hoare triple {880#(<= 1 main_~b~0)} assume !(0 != ~b~0); {775#false} is VALID [2022-04-28 05:52:59,243 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 05:52:59,244 INFO L290 TraceCheckUtils]: 36: Hoare triple {775#false} ~cond := #in~cond; {775#false} is VALID [2022-04-28 05:52:59,244 INFO L290 TraceCheckUtils]: 37: Hoare triple {775#false} assume 0 == ~cond; {775#false} is VALID [2022-04-28 05:52:59,244 INFO L290 TraceCheckUtils]: 38: Hoare triple {775#false} assume !false; {775#false} is VALID [2022-04-28 05:52:59,245 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 05:52:59,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:52:59,521 INFO L290 TraceCheckUtils]: 38: Hoare triple {775#false} assume !false; {775#false} is VALID [2022-04-28 05:52:59,521 INFO L290 TraceCheckUtils]: 37: Hoare triple {775#false} assume 0 == ~cond; {775#false} is VALID [2022-04-28 05:52:59,522 INFO L290 TraceCheckUtils]: 36: Hoare triple {775#false} ~cond := #in~cond; {775#false} is VALID [2022-04-28 05:52:59,522 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 05:52:59,522 INFO L290 TraceCheckUtils]: 34: Hoare triple {880#(<= 1 main_~b~0)} assume !(0 != ~b~0); {775#false} is VALID [2022-04-28 05:52:59,522 INFO L290 TraceCheckUtils]: 33: Hoare triple {880#(<= 1 main_~b~0)} assume !false; {880#(<= 1 main_~b~0)} is VALID [2022-04-28 05:52:59,523 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 05:52:59,523 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 05:52:59,524 INFO L290 TraceCheckUtils]: 30: Hoare triple {870#(<= 1 main_~c~0)} assume !false; {870#(<= 1 main_~c~0)} is VALID [2022-04-28 05:52:59,524 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 05:52:59,524 INFO L290 TraceCheckUtils]: 28: Hoare triple {863#(<= 1 main_~a~0)} assume !false; {863#(<= 1 main_~a~0)} is VALID [2022-04-28 05:52:59,525 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 05:52:59,526 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 05:52:59,526 INFO L290 TraceCheckUtils]: 25: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-28 05:52:59,526 INFO L290 TraceCheckUtils]: 24: Hoare triple {774#true} assume !(0 == ~cond); {774#true} is VALID [2022-04-28 05:52:59,527 INFO L290 TraceCheckUtils]: 23: Hoare triple {774#true} ~cond := #in~cond; {774#true} is VALID [2022-04-28 05:52:59,527 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 05:52:59,527 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 05:52:59,528 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 05:52:59,528 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 05:52:59,528 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 05:52:59,529 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 05:52:59,529 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {774#true} {774#true} #96#return; {774#true} is VALID [2022-04-28 05:52:59,529 INFO L290 TraceCheckUtils]: 15: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-28 05:52:59,529 INFO L290 TraceCheckUtils]: 14: Hoare triple {774#true} assume !(0 == ~cond); {774#true} is VALID [2022-04-28 05:52:59,529 INFO L290 TraceCheckUtils]: 13: Hoare triple {774#true} ~cond := #in~cond; {774#true} is VALID [2022-04-28 05:52:59,529 INFO L272 TraceCheckUtils]: 12: Hoare triple {774#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {774#true} is VALID [2022-04-28 05:52:59,529 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 05:52:59,529 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {774#true} {774#true} #94#return; {774#true} is VALID [2022-04-28 05:52:59,530 INFO L290 TraceCheckUtils]: 9: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-28 05:52:59,530 INFO L290 TraceCheckUtils]: 8: Hoare triple {774#true} assume !(0 == ~cond); {774#true} is VALID [2022-04-28 05:52:59,530 INFO L290 TraceCheckUtils]: 7: Hoare triple {774#true} ~cond := #in~cond; {774#true} is VALID [2022-04-28 05:52:59,530 INFO L272 TraceCheckUtils]: 6: Hoare triple {774#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {774#true} is VALID [2022-04-28 05:52:59,530 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 05:52:59,530 INFO L272 TraceCheckUtils]: 4: Hoare triple {774#true} call #t~ret6 := main(); {774#true} is VALID [2022-04-28 05:52:59,530 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {774#true} {774#true} #112#return; {774#true} is VALID [2022-04-28 05:52:59,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-28 05:52:59,530 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 05:52:59,531 INFO L272 TraceCheckUtils]: 0: Hoare triple {774#true} call ULTIMATE.init(); {774#true} is VALID [2022-04-28 05:52:59,531 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 05:52:59,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:52:59,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056923895] [2022-04-28 05:52:59,531 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:52:59,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635085247] [2022-04-28 05:52:59,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635085247] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:52:59,532 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:52:59,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-28 05:52:59,532 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:52:59,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1370122965] [2022-04-28 05:52:59,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1370122965] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:52:59,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:52:59,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 05:52:59,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610520028] [2022-04-28 05:52:59,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:52:59,533 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 05:52:59,533 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:52:59,533 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 05:52:59,557 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 05:52:59,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 05:52:59,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:52:59,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 05:52:59,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-28 05:52:59,558 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 05:53:00,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:53:00,275 INFO L93 Difference]: Finished difference Result 103 states and 143 transitions. [2022-04-28 05:53:00,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 05:53:00,276 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 05:53:00,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:53:00,276 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 05:53:00,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2022-04-28 05:53:00,279 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 05:53:00,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2022-04-28 05:53:00,282 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 108 transitions. [2022-04-28 05:53:00,383 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 05:53:00,387 INFO L225 Difference]: With dead ends: 103 [2022-04-28 05:53:00,387 INFO L226 Difference]: Without dead ends: 96 [2022-04-28 05:53:00,388 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 05:53:00,388 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 68 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-28 05:53:00,389 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.2s Time] [2022-04-28 05:53:00,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-28 05:53:00,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 71. [2022-04-28 05:53:00,471 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:53:00,472 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 05:53:00,472 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 05:53:00,472 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 05:53:00,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:53:00,478 INFO L93 Difference]: Finished difference Result 96 states and 136 transitions. [2022-04-28 05:53:00,478 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 136 transitions. [2022-04-28 05:53:00,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:53:00,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:53:00,479 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 05:53:00,479 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 05:53:00,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:53:00,484 INFO L93 Difference]: Finished difference Result 96 states and 136 transitions. [2022-04-28 05:53:00,484 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 136 transitions. [2022-04-28 05:53:00,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:53:00,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:53:00,485 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:53:00,485 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:53:00,486 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 05:53:00,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 95 transitions. [2022-04-28 05:53:00,489 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 95 transitions. Word has length 39 [2022-04-28 05:53:00,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:53:00,489 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 95 transitions. [2022-04-28 05:53:00,489 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 05:53:00,489 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 95 transitions. [2022-04-28 05:53:00,593 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 05:53:00,594 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 95 transitions. [2022-04-28 05:53:00,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 05:53:00,594 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:53:00,595 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 05:53:00,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-28 05:53:00,811 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 05:53:00,811 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:53:00,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:53:00,812 INFO L85 PathProgramCache]: Analyzing trace with hash -974923140, now seen corresponding path program 1 times [2022-04-28 05:53:00,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:53:00,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1902901459] [2022-04-28 05:53:00,812 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:53:00,813 INFO L85 PathProgramCache]: Analyzing trace with hash -974923140, now seen corresponding path program 2 times [2022-04-28 05:53:00,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:53:00,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951627745] [2022-04-28 05:53:00,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:53:00,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:53:00,830 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:53:00,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1285368815] [2022-04-28 05:53:00,830 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:53:00,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:53:00,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:53:00,832 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 05:53:00,842 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 05:53:00,890 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:53:00,891 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:53:00,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-28 05:53:00,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:53:00,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:53:01,629 INFO L272 TraceCheckUtils]: 0: Hoare triple {1566#true} call ULTIMATE.init(); {1566#true} is VALID [2022-04-28 05:53:01,629 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 05:53:01,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-28 05:53:01,629 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1566#true} {1566#true} #112#return; {1566#true} is VALID [2022-04-28 05:53:01,629 INFO L272 TraceCheckUtils]: 4: Hoare triple {1566#true} call #t~ret6 := main(); {1566#true} is VALID [2022-04-28 05:53:01,629 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 05:53:01,630 INFO L272 TraceCheckUtils]: 6: Hoare triple {1566#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {1566#true} is VALID [2022-04-28 05:53:01,630 INFO L290 TraceCheckUtils]: 7: Hoare triple {1566#true} ~cond := #in~cond; {1566#true} is VALID [2022-04-28 05:53:01,630 INFO L290 TraceCheckUtils]: 8: Hoare triple {1566#true} assume !(0 == ~cond); {1566#true} is VALID [2022-04-28 05:53:01,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-28 05:53:01,630 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1566#true} {1566#true} #94#return; {1566#true} is VALID [2022-04-28 05:53:01,630 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 05:53:01,630 INFO L272 TraceCheckUtils]: 12: Hoare triple {1566#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {1566#true} is VALID [2022-04-28 05:53:01,631 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 05:53:01,632 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 05:53:01,632 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 05:53:01,633 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 5))} is VALID [2022-04-28 05:53:01,633 INFO L272 TraceCheckUtils]: 17: Hoare triple {1621#(and (<= 0 main_~y~0) (<= main_~y~0 5))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1566#true} is VALID [2022-04-28 05:53:01,633 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 05:53:01,634 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 05:53:01,634 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 05:53:01,639 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1614#(not (= |assume_abort_if_not_#in~cond| 0))} {1621#(and (<= 0 main_~y~0) (<= main_~y~0 5))} #98#return; {1637#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 5))} is VALID [2022-04-28 05:53:01,640 INFO L272 TraceCheckUtils]: 22: Hoare triple {1637#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 5))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1566#true} is VALID [2022-04-28 05:53:01,640 INFO L290 TraceCheckUtils]: 23: Hoare triple {1566#true} ~cond := #in~cond; {1566#true} is VALID [2022-04-28 05:53:01,640 INFO L290 TraceCheckUtils]: 24: Hoare triple {1566#true} assume !(0 == ~cond); {1566#true} is VALID [2022-04-28 05:53:01,640 INFO L290 TraceCheckUtils]: 25: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-28 05:53:01,641 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1566#true} {1637#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 5))} #100#return; {1637#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 5))} is VALID [2022-04-28 05:53:01,641 INFO L290 TraceCheckUtils]: 27: Hoare triple {1637#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 5))} ~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_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~y~0 5))} is VALID [2022-04-28 05:53:01,642 INFO L290 TraceCheckUtils]: 28: Hoare triple {1656#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~y~0 5))} assume !false; {1656#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~y~0 5))} is VALID [2022-04-28 05:53:01,642 INFO L290 TraceCheckUtils]: 29: Hoare triple {1656#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~y~0 5))} 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_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 5) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 05:53:01,643 INFO L290 TraceCheckUtils]: 30: Hoare triple {1663#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 5) (= main_~c~0 main_~x~0))} assume !false; {1663#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 5) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 05:53:01,643 INFO L290 TraceCheckUtils]: 31: Hoare triple {1663#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 5) (= main_~c~0 main_~x~0))} assume !(~c~0 >= ~b~0); {1663#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 5) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 05:53:01,644 INFO L290 TraceCheckUtils]: 32: Hoare triple {1663#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 5) (= 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_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (<= main_~y~0 5))} is VALID [2022-04-28 05:53:01,648 INFO L290 TraceCheckUtils]: 33: Hoare triple {1673#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (<= main_~y~0 5))} assume !false; {1673#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (<= main_~y~0 5))} is VALID [2022-04-28 05:53:01,649 INFO L290 TraceCheckUtils]: 34: Hoare triple {1673#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (<= main_~y~0 5))} 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_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (<= main_~y~0 5))} is VALID [2022-04-28 05:53:01,649 INFO L290 TraceCheckUtils]: 35: Hoare triple {1680#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (<= main_~y~0 5))} assume !false; {1680#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (<= main_~y~0 5))} is VALID [2022-04-28 05:53:01,650 INFO L290 TraceCheckUtils]: 36: Hoare triple {1680#(and (<= 0 main_~y~0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (<= main_~y~0 5))} 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_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (<= main_~x~0 main_~a~0) (<= main_~y~0 5))} is VALID [2022-04-28 05:53:01,651 INFO L290 TraceCheckUtils]: 37: Hoare triple {1687#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (<= main_~x~0 main_~a~0) (<= main_~y~0 5))} assume !false; {1687#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (<= main_~x~0 main_~a~0) (<= main_~y~0 5))} is VALID [2022-04-28 05:53:01,651 INFO L272 TraceCheckUtils]: 38: Hoare triple {1687#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (<= main_~x~0 main_~a~0) (<= main_~y~0 5))} 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 05:53:01,652 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 05:53:01,652 INFO L290 TraceCheckUtils]: 40: Hoare triple {1698#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1567#false} is VALID [2022-04-28 05:53:01,652 INFO L290 TraceCheckUtils]: 41: Hoare triple {1567#false} assume !false; {1567#false} is VALID [2022-04-28 05:53:01,653 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 05:53:01,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:53:02,077 INFO L290 TraceCheckUtils]: 41: Hoare triple {1567#false} assume !false; {1567#false} is VALID [2022-04-28 05:53:02,077 INFO L290 TraceCheckUtils]: 40: Hoare triple {1698#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1567#false} is VALID [2022-04-28 05:53:02,078 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 05:53:02,079 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 05:53:02,079 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 05:53:02,080 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 05:53:02,080 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 05:53:02,081 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 05:53:02,082 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 05:53:02,082 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 05:53:02,083 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 05:53:02,084 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 05:53:02,084 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 05:53:02,085 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 05:53:02,085 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 05:53:02,085 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1566#true} {1566#true} #100#return; {1566#true} is VALID [2022-04-28 05:53:02,085 INFO L290 TraceCheckUtils]: 25: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-28 05:53:02,086 INFO L290 TraceCheckUtils]: 24: Hoare triple {1566#true} assume !(0 == ~cond); {1566#true} is VALID [2022-04-28 05:53:02,086 INFO L290 TraceCheckUtils]: 23: Hoare triple {1566#true} ~cond := #in~cond; {1566#true} is VALID [2022-04-28 05:53:02,086 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 05:53:02,086 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1566#true} {1566#true} #98#return; {1566#true} is VALID [2022-04-28 05:53:02,086 INFO L290 TraceCheckUtils]: 20: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-28 05:53:02,086 INFO L290 TraceCheckUtils]: 19: Hoare triple {1566#true} assume !(0 == ~cond); {1566#true} is VALID [2022-04-28 05:53:02,087 INFO L290 TraceCheckUtils]: 18: Hoare triple {1566#true} ~cond := #in~cond; {1566#true} is VALID [2022-04-28 05:53:02,087 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 05:53:02,087 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1566#true} {1566#true} #96#return; {1566#true} is VALID [2022-04-28 05:53:02,087 INFO L290 TraceCheckUtils]: 15: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-28 05:53:02,087 INFO L290 TraceCheckUtils]: 14: Hoare triple {1566#true} assume !(0 == ~cond); {1566#true} is VALID [2022-04-28 05:53:02,087 INFO L290 TraceCheckUtils]: 13: Hoare triple {1566#true} ~cond := #in~cond; {1566#true} is VALID [2022-04-28 05:53:02,087 INFO L272 TraceCheckUtils]: 12: Hoare triple {1566#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {1566#true} is VALID [2022-04-28 05:53:02,087 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 05:53:02,088 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1566#true} {1566#true} #94#return; {1566#true} is VALID [2022-04-28 05:53:02,088 INFO L290 TraceCheckUtils]: 9: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-28 05:53:02,088 INFO L290 TraceCheckUtils]: 8: Hoare triple {1566#true} assume !(0 == ~cond); {1566#true} is VALID [2022-04-28 05:53:02,093 INFO L290 TraceCheckUtils]: 7: Hoare triple {1566#true} ~cond := #in~cond; {1566#true} is VALID [2022-04-28 05:53:02,094 INFO L272 TraceCheckUtils]: 6: Hoare triple {1566#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {1566#true} is VALID [2022-04-28 05:53:02,095 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 05:53:02,097 INFO L272 TraceCheckUtils]: 4: Hoare triple {1566#true} call #t~ret6 := main(); {1566#true} is VALID [2022-04-28 05:53:02,098 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1566#true} {1566#true} #112#return; {1566#true} is VALID [2022-04-28 05:53:02,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-28 05:53:02,098 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 05:53:02,098 INFO L272 TraceCheckUtils]: 0: Hoare triple {1566#true} call ULTIMATE.init(); {1566#true} is VALID [2022-04-28 05:53:02,099 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 05:53:02,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:53:02,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951627745] [2022-04-28 05:53:02,099 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:53:02,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285368815] [2022-04-28 05:53:02,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285368815] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:53:02,099 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:53:02,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 18 [2022-04-28 05:53:02,100 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:53:02,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1902901459] [2022-04-28 05:53:02,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1902901459] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:53:02,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:53:02,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 05:53:02,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105008348] [2022-04-28 05:53:02,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:53:02,101 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 05:53:02,101 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:53:02,101 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 05:53:02,130 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 05:53:02,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 05:53:02,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:53:02,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 05:53:02,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2022-04-28 05:53:02,131 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 05:53:03,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:53:03,631 INFO L93 Difference]: Finished difference Result 112 states and 151 transitions. [2022-04-28 05:53:03,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 05:53:03,632 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 05:53:03,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:53:03,632 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 05:53:03,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 117 transitions. [2022-04-28 05:53:03,635 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 05:53:03,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 117 transitions. [2022-04-28 05:53:03,638 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 117 transitions. [2022-04-28 05:53:03,739 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 05:53:03,742 INFO L225 Difference]: With dead ends: 112 [2022-04-28 05:53:03,742 INFO L226 Difference]: Without dead ends: 110 [2022-04-28 05:53:03,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2022-04-28 05:53:03,743 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 89 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-28 05:53:03,743 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.5s Time] [2022-04-28 05:53:03,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-28 05:53:03,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 93. [2022-04-28 05:53:03,918 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:53:03,920 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 05:53:03,920 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 05:53:03,921 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 05:53:03,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:53:03,927 INFO L93 Difference]: Finished difference Result 110 states and 149 transitions. [2022-04-28 05:53:03,927 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 149 transitions. [2022-04-28 05:53:03,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:53:03,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:53:03,929 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 05:53:03,930 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 05:53:03,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:53:03,937 INFO L93 Difference]: Finished difference Result 110 states and 149 transitions. [2022-04-28 05:53:03,937 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 149 transitions. [2022-04-28 05:53:03,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:53:03,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:53:03,938 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:53:03,938 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:53:03,939 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 05:53:03,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 122 transitions. [2022-04-28 05:53:03,943 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 122 transitions. Word has length 42 [2022-04-28 05:53:03,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:53:03,943 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 122 transitions. [2022-04-28 05:53:03,944 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 05:53:03,944 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 93 states and 122 transitions. [2022-04-28 05:53:04,102 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 05:53:04,103 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 122 transitions. [2022-04-28 05:53:04,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-28 05:53:04,103 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:53:04,103 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 05:53:04,123 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 05:53:04,303 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 05:53:04,304 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:53:04,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:53:04,304 INFO L85 PathProgramCache]: Analyzing trace with hash 81990170, now seen corresponding path program 1 times [2022-04-28 05:53:04,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:53:04,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1377546068] [2022-04-28 05:53:04,305 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:53:04,305 INFO L85 PathProgramCache]: Analyzing trace with hash 81990170, now seen corresponding path program 2 times [2022-04-28 05:53:04,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:53:04,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224788808] [2022-04-28 05:53:04,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:53:04,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:53:04,321 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:53:04,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1415280550] [2022-04-28 05:53:04,322 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:53:04,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:53:04,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:53:04,332 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 05:53:04,336 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 05:53:04,380 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:53:04,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:53:04,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 05:53:04,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:53:04,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:53:04,706 INFO L272 TraceCheckUtils]: 0: Hoare triple {2475#true} call ULTIMATE.init(); {2475#true} is VALID [2022-04-28 05:53:04,706 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 05:53:04,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-28 05:53:04,707 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2475#true} {2475#true} #112#return; {2475#true} is VALID [2022-04-28 05:53:04,707 INFO L272 TraceCheckUtils]: 4: Hoare triple {2475#true} call #t~ret6 := main(); {2475#true} is VALID [2022-04-28 05:53:04,707 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 05:53:04,707 INFO L272 TraceCheckUtils]: 6: Hoare triple {2475#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {2475#true} is VALID [2022-04-28 05:53:04,707 INFO L290 TraceCheckUtils]: 7: Hoare triple {2475#true} ~cond := #in~cond; {2475#true} is VALID [2022-04-28 05:53:04,707 INFO L290 TraceCheckUtils]: 8: Hoare triple {2475#true} assume !(0 == ~cond); {2475#true} is VALID [2022-04-28 05:53:04,707 INFO L290 TraceCheckUtils]: 9: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-28 05:53:04,707 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2475#true} {2475#true} #94#return; {2475#true} is VALID [2022-04-28 05:53:04,708 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 05:53:04,708 INFO L272 TraceCheckUtils]: 12: Hoare triple {2475#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {2475#true} is VALID [2022-04-28 05:53:04,714 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 05:53:04,715 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 05:53:04,715 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 05:53:04,716 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 5))} is VALID [2022-04-28 05:53:04,716 INFO L272 TraceCheckUtils]: 17: Hoare triple {2530#(and (<= 0 main_~y~0) (<= main_~y~0 5))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2475#true} is VALID [2022-04-28 05:53:04,716 INFO L290 TraceCheckUtils]: 18: Hoare triple {2475#true} ~cond := #in~cond; {2475#true} is VALID [2022-04-28 05:53:04,716 INFO L290 TraceCheckUtils]: 19: Hoare triple {2475#true} assume !(0 == ~cond); {2475#true} is VALID [2022-04-28 05:53:04,716 INFO L290 TraceCheckUtils]: 20: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-28 05:53:04,717 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2475#true} {2530#(and (<= 0 main_~y~0) (<= main_~y~0 5))} #98#return; {2530#(and (<= 0 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 05:53:04,717 INFO L272 TraceCheckUtils]: 22: Hoare triple {2530#(and (<= 0 main_~y~0) (<= main_~y~0 5))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2475#true} is VALID [2022-04-28 05:53:04,717 INFO L290 TraceCheckUtils]: 23: Hoare triple {2475#true} ~cond := #in~cond; {2475#true} is VALID [2022-04-28 05:53:04,717 INFO L290 TraceCheckUtils]: 24: Hoare triple {2475#true} assume !(0 == ~cond); {2475#true} is VALID [2022-04-28 05:53:04,717 INFO L290 TraceCheckUtils]: 25: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-28 05:53:04,718 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2475#true} {2530#(and (<= 0 main_~y~0) (<= main_~y~0 5))} #100#return; {2530#(and (<= 0 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 05:53:04,718 INFO L290 TraceCheckUtils]: 27: Hoare triple {2530#(and (<= 0 main_~y~0) (<= main_~y~0 5))} ~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 05:53:04,718 INFO L290 TraceCheckUtils]: 28: Hoare triple {2564#(<= 0 main_~b~0)} assume !false; {2564#(<= 0 main_~b~0)} is VALID [2022-04-28 05:53:04,719 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 05:53:04,719 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 05:53:04,719 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 05:53:04,720 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 05:53:04,720 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 05:53:04,720 INFO L290 TraceCheckUtils]: 34: Hoare triple {2475#true} ~cond := #in~cond; {2475#true} is VALID [2022-04-28 05:53:04,720 INFO L290 TraceCheckUtils]: 35: Hoare triple {2475#true} assume !(0 == ~cond); {2475#true} is VALID [2022-04-28 05:53:04,720 INFO L290 TraceCheckUtils]: 36: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-28 05:53:04,721 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 05:53:04,722 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 05:53:04,722 INFO L290 TraceCheckUtils]: 39: Hoare triple {2475#true} ~cond := #in~cond; {2475#true} is VALID [2022-04-28 05:53:04,722 INFO L290 TraceCheckUtils]: 40: Hoare triple {2475#true} assume !(0 == ~cond); {2475#true} is VALID [2022-04-28 05:53:04,722 INFO L290 TraceCheckUtils]: 41: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-28 05:53:04,722 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 05:53:04,723 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 05:53:04,723 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 05:53:04,724 INFO L290 TraceCheckUtils]: 45: Hoare triple {2618#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2476#false} is VALID [2022-04-28 05:53:04,724 INFO L290 TraceCheckUtils]: 46: Hoare triple {2476#false} assume !false; {2476#false} is VALID [2022-04-28 05:53:04,724 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 05:53:04,724 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:53:04,969 INFO L290 TraceCheckUtils]: 46: Hoare triple {2476#false} assume !false; {2476#false} is VALID [2022-04-28 05:53:04,970 INFO L290 TraceCheckUtils]: 45: Hoare triple {2618#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2476#false} is VALID [2022-04-28 05:53:04,970 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 05:53:04,971 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 05:53:04,972 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 05:53:04,972 INFO L290 TraceCheckUtils]: 41: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-28 05:53:04,972 INFO L290 TraceCheckUtils]: 40: Hoare triple {2475#true} assume !(0 == ~cond); {2475#true} is VALID [2022-04-28 05:53:04,973 INFO L290 TraceCheckUtils]: 39: Hoare triple {2475#true} ~cond := #in~cond; {2475#true} is VALID [2022-04-28 05:53:04,974 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 05:53:04,974 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 05:53:04,974 INFO L290 TraceCheckUtils]: 36: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-28 05:53:04,975 INFO L290 TraceCheckUtils]: 35: Hoare triple {2475#true} assume !(0 == ~cond); {2475#true} is VALID [2022-04-28 05:53:04,975 INFO L290 TraceCheckUtils]: 34: Hoare triple {2475#true} ~cond := #in~cond; {2475#true} is VALID [2022-04-28 05:53:04,975 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 05:53:04,976 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 05:53:04,976 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 05:53:04,977 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 05:53:04,977 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 05:53:04,977 INFO L290 TraceCheckUtils]: 28: Hoare triple {2475#true} assume !false; {2475#true} is VALID [2022-04-28 05:53:04,977 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 05:53:04,977 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2475#true} {2475#true} #100#return; {2475#true} is VALID [2022-04-28 05:53:04,978 INFO L290 TraceCheckUtils]: 25: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-28 05:53:04,978 INFO L290 TraceCheckUtils]: 24: Hoare triple {2475#true} assume !(0 == ~cond); {2475#true} is VALID [2022-04-28 05:53:04,978 INFO L290 TraceCheckUtils]: 23: Hoare triple {2475#true} ~cond := #in~cond; {2475#true} is VALID [2022-04-28 05:53:04,978 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 05:53:04,978 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2475#true} {2475#true} #98#return; {2475#true} is VALID [2022-04-28 05:53:04,978 INFO L290 TraceCheckUtils]: 20: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-28 05:53:04,978 INFO L290 TraceCheckUtils]: 19: Hoare triple {2475#true} assume !(0 == ~cond); {2475#true} is VALID [2022-04-28 05:53:04,978 INFO L290 TraceCheckUtils]: 18: Hoare triple {2475#true} ~cond := #in~cond; {2475#true} is VALID [2022-04-28 05:53:04,979 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 05:53:04,979 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2475#true} {2475#true} #96#return; {2475#true} is VALID [2022-04-28 05:53:04,979 INFO L290 TraceCheckUtils]: 15: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-28 05:53:04,979 INFO L290 TraceCheckUtils]: 14: Hoare triple {2475#true} assume !(0 == ~cond); {2475#true} is VALID [2022-04-28 05:53:04,979 INFO L290 TraceCheckUtils]: 13: Hoare triple {2475#true} ~cond := #in~cond; {2475#true} is VALID [2022-04-28 05:53:04,979 INFO L272 TraceCheckUtils]: 12: Hoare triple {2475#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {2475#true} is VALID [2022-04-28 05:53:04,979 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 05:53:04,979 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2475#true} {2475#true} #94#return; {2475#true} is VALID [2022-04-28 05:53:04,980 INFO L290 TraceCheckUtils]: 9: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-28 05:53:04,980 INFO L290 TraceCheckUtils]: 8: Hoare triple {2475#true} assume !(0 == ~cond); {2475#true} is VALID [2022-04-28 05:53:04,980 INFO L290 TraceCheckUtils]: 7: Hoare triple {2475#true} ~cond := #in~cond; {2475#true} is VALID [2022-04-28 05:53:04,980 INFO L272 TraceCheckUtils]: 6: Hoare triple {2475#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {2475#true} is VALID [2022-04-28 05:53:04,980 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 05:53:04,980 INFO L272 TraceCheckUtils]: 4: Hoare triple {2475#true} call #t~ret6 := main(); {2475#true} is VALID [2022-04-28 05:53:04,980 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2475#true} {2475#true} #112#return; {2475#true} is VALID [2022-04-28 05:53:04,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {2475#true} assume true; {2475#true} is VALID [2022-04-28 05:53:04,980 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 05:53:04,981 INFO L272 TraceCheckUtils]: 0: Hoare triple {2475#true} call ULTIMATE.init(); {2475#true} is VALID [2022-04-28 05:53:04,981 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 05:53:04,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:53:04,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224788808] [2022-04-28 05:53:04,984 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:53:04,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415280550] [2022-04-28 05:53:04,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415280550] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 05:53:04,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 05:53:04,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2022-04-28 05:53:04,984 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:53:04,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1377546068] [2022-04-28 05:53:04,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1377546068] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:53:04,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:53:04,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:53:04,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132468641] [2022-04-28 05:53:04,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:53:04,985 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 05:53:04,986 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:53:04,986 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 05:53:05,011 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 05:53:05,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 05:53:05,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:53:05,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 05:53:05,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-04-28 05:53:05,014 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 05:53:05,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:53:05,477 INFO L93 Difference]: Finished difference Result 130 states and 179 transitions. [2022-04-28 05:53:05,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 05:53:05,477 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 05:53:05,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:53:05,477 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 05:53:05,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-28 05:53:05,479 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 05:53:05,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-28 05:53:05,480 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-28 05:53:05,540 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 05:53:05,543 INFO L225 Difference]: With dead ends: 130 [2022-04-28 05:53:05,543 INFO L226 Difference]: Without dead ends: 128 [2022-04-28 05:53:05,543 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 05:53:05,544 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 05:53:05,544 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 05:53:05,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-04-28 05:53:05,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 123. [2022-04-28 05:53:05,793 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:53:05,794 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 05:53:05,794 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 05:53:05,795 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 05:53:05,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:53:05,800 INFO L93 Difference]: Finished difference Result 128 states and 177 transitions. [2022-04-28 05:53:05,800 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 177 transitions. [2022-04-28 05:53:05,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:53:05,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:53:05,801 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 05:53:05,801 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 05:53:05,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:53:05,806 INFO L93 Difference]: Finished difference Result 128 states and 177 transitions. [2022-04-28 05:53:05,806 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 177 transitions. [2022-04-28 05:53:05,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:53:05,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:53:05,807 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:53:05,807 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:53:05,807 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 05:53:05,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 172 transitions. [2022-04-28 05:53:05,812 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 172 transitions. Word has length 47 [2022-04-28 05:53:05,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:53:05,813 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 172 transitions. [2022-04-28 05:53:05,813 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 05:53:05,813 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 123 states and 172 transitions. [2022-04-28 05:53:06,031 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 05:53:06,032 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 172 transitions. [2022-04-28 05:53:06,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-28 05:53:06,032 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:53:06,033 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 05:53:06,054 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 05:53:06,233 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 05:53:06,233 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:53:06,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:53:06,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1524769911, now seen corresponding path program 1 times [2022-04-28 05:53:06,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:53:06,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1293267497] [2022-04-28 05:53:06,234 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:53:06,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1524769911, now seen corresponding path program 2 times [2022-04-28 05:53:06,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:53:06,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339869662] [2022-04-28 05:53:06,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:53:06,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:53:06,254 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:53:06,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1345709418] [2022-04-28 05:53:06,254 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:53:06,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:53:06,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:53:06,258 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 05:53:06,259 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 05:53:06,303 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:53:06,303 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:53:06,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 05:53:06,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:53:06,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:53:10,667 INFO L272 TraceCheckUtils]: 0: Hoare triple {3530#true} call ULTIMATE.init(); {3530#true} is VALID [2022-04-28 05:53:10,667 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 05:53:10,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {3530#true} assume true; {3530#true} is VALID [2022-04-28 05:53:10,667 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3530#true} {3530#true} #112#return; {3530#true} is VALID [2022-04-28 05:53:10,667 INFO L272 TraceCheckUtils]: 4: Hoare triple {3530#true} call #t~ret6 := main(); {3530#true} is VALID [2022-04-28 05:53:10,668 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 05:53:10,668 INFO L272 TraceCheckUtils]: 6: Hoare triple {3530#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {3530#true} is VALID [2022-04-28 05:53:10,668 INFO L290 TraceCheckUtils]: 7: Hoare triple {3530#true} ~cond := #in~cond; {3530#true} is VALID [2022-04-28 05:53:10,668 INFO L290 TraceCheckUtils]: 8: Hoare triple {3530#true} assume !(0 == ~cond); {3530#true} is VALID [2022-04-28 05:53:10,668 INFO L290 TraceCheckUtils]: 9: Hoare triple {3530#true} assume true; {3530#true} is VALID [2022-04-28 05:53:10,668 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3530#true} {3530#true} #94#return; {3530#true} is VALID [2022-04-28 05:53:10,668 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 05:53:10,668 INFO L272 TraceCheckUtils]: 12: Hoare triple {3530#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {3530#true} is VALID [2022-04-28 05:53:10,668 INFO L290 TraceCheckUtils]: 13: Hoare triple {3530#true} ~cond := #in~cond; {3530#true} is VALID [2022-04-28 05:53:10,668 INFO L290 TraceCheckUtils]: 14: Hoare triple {3530#true} assume !(0 == ~cond); {3530#true} is VALID [2022-04-28 05:53:10,669 INFO L290 TraceCheckUtils]: 15: Hoare triple {3530#true} assume true; {3530#true} is VALID [2022-04-28 05:53:10,669 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3530#true} {3530#true} #96#return; {3530#true} is VALID [2022-04-28 05:53:10,669 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 05:53:10,669 INFO L290 TraceCheckUtils]: 18: Hoare triple {3530#true} ~cond := #in~cond; {3530#true} is VALID [2022-04-28 05:53:10,669 INFO L290 TraceCheckUtils]: 19: Hoare triple {3530#true} assume !(0 == ~cond); {3530#true} is VALID [2022-04-28 05:53:10,669 INFO L290 TraceCheckUtils]: 20: Hoare triple {3530#true} assume true; {3530#true} is VALID [2022-04-28 05:53:10,669 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3530#true} {3530#true} #98#return; {3530#true} is VALID [2022-04-28 05:53:10,669 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 05:53:10,669 INFO L290 TraceCheckUtils]: 23: Hoare triple {3530#true} ~cond := #in~cond; {3530#true} is VALID [2022-04-28 05:53:10,669 INFO L290 TraceCheckUtils]: 24: Hoare triple {3530#true} assume !(0 == ~cond); {3530#true} is VALID [2022-04-28 05:53:10,670 INFO L290 TraceCheckUtils]: 25: Hoare triple {3530#true} assume true; {3530#true} is VALID [2022-04-28 05:53:10,670 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3530#true} {3530#true} #100#return; {3530#true} is VALID [2022-04-28 05:53:10,670 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; {3616#(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 05:53:10,671 INFO L290 TraceCheckUtils]: 28: Hoare triple {3616#(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; {3616#(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 05:53:10,671 INFO L290 TraceCheckUtils]: 29: Hoare triple {3616#(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; {3623#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:53:10,672 INFO L290 TraceCheckUtils]: 30: Hoare triple {3623#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !false; {3623#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:53:10,672 INFO L290 TraceCheckUtils]: 31: Hoare triple {3623#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {3623#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:53:10,673 INFO L290 TraceCheckUtils]: 32: Hoare triple {3623#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= 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; {3633#(and (= main_~s~0 0) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-28 05:53:10,674 INFO L290 TraceCheckUtils]: 33: Hoare triple {3633#(and (= main_~s~0 0) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !false; {3633#(and (= main_~s~0 0) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-28 05:53:10,674 INFO L290 TraceCheckUtils]: 34: Hoare triple {3633#(and (= main_~s~0 0) (= main_~a~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; {3640#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-28 05:53:10,675 INFO L290 TraceCheckUtils]: 35: Hoare triple {3640#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !false; {3640#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-28 05:53:10,675 INFO L290 TraceCheckUtils]: 36: Hoare triple {3640#(and (= main_~s~0 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; {3640#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-28 05:53:10,676 INFO L290 TraceCheckUtils]: 37: Hoare triple {3640#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !false; {3640#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-28 05:53:10,676 INFO L272 TraceCheckUtils]: 38: Hoare triple {3640#(and (= main_~s~0 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 05:53:10,676 INFO L290 TraceCheckUtils]: 39: Hoare triple {3530#true} ~cond := #in~cond; {3530#true} is VALID [2022-04-28 05:53:10,676 INFO L290 TraceCheckUtils]: 40: Hoare triple {3530#true} assume !(0 == ~cond); {3530#true} is VALID [2022-04-28 05:53:10,676 INFO L290 TraceCheckUtils]: 41: Hoare triple {3530#true} assume true; {3530#true} is VALID [2022-04-28 05:53:10,677 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {3530#true} {3640#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #102#return; {3640#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-28 05:53:10,678 INFO L272 TraceCheckUtils]: 43: Hoare triple {3640#(and (= main_~s~0 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)); {3668#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:53:10,678 INFO L290 TraceCheckUtils]: 44: Hoare triple {3668#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3672#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:53:10,679 INFO L290 TraceCheckUtils]: 45: Hoare triple {3672#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3531#false} is VALID [2022-04-28 05:53:10,679 INFO L290 TraceCheckUtils]: 46: Hoare triple {3531#false} assume !false; {3531#false} is VALID [2022-04-28 05:53:10,679 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 05:53:10,679 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:53:10,980 INFO L290 TraceCheckUtils]: 46: Hoare triple {3531#false} assume !false; {3531#false} is VALID [2022-04-28 05:53:10,980 INFO L290 TraceCheckUtils]: 45: Hoare triple {3672#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3531#false} is VALID [2022-04-28 05:53:10,981 INFO L290 TraceCheckUtils]: 44: Hoare triple {3668#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3672#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:53:10,982 INFO L272 TraceCheckUtils]: 43: Hoare triple {3688#(= 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)); {3668#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:53:10,983 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {3530#true} {3688#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #102#return; {3688#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:53:10,983 INFO L290 TraceCheckUtils]: 41: Hoare triple {3530#true} assume true; {3530#true} is VALID [2022-04-28 05:53:10,983 INFO L290 TraceCheckUtils]: 40: Hoare triple {3530#true} assume !(0 == ~cond); {3530#true} is VALID [2022-04-28 05:53:10,983 INFO L290 TraceCheckUtils]: 39: Hoare triple {3530#true} ~cond := #in~cond; {3530#true} is VALID [2022-04-28 05:53:10,983 INFO L272 TraceCheckUtils]: 38: Hoare triple {3688#(= 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 05:53:10,983 INFO L290 TraceCheckUtils]: 37: Hoare triple {3688#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {3688#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:53:10,984 INFO L290 TraceCheckUtils]: 36: Hoare triple {3688#(= 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; {3688#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:53:10,984 INFO L290 TraceCheckUtils]: 35: Hoare triple {3688#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {3688#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:53:10,985 INFO L290 TraceCheckUtils]: 34: Hoare triple {3688#(= 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; {3688#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:53:10,985 INFO L290 TraceCheckUtils]: 33: Hoare triple {3688#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {3688#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:53:12,712 INFO L290 TraceCheckUtils]: 32: Hoare triple {3722#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~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; {3688#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:53:12,713 INFO L290 TraceCheckUtils]: 31: Hoare triple {3722#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} assume !(~c~0 >= ~b~0); {3722#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} is VALID [2022-04-28 05:53:12,713 INFO L290 TraceCheckUtils]: 30: Hoare triple {3722#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} assume !false; {3722#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} is VALID [2022-04-28 05:53:12,714 INFO L290 TraceCheckUtils]: 29: Hoare triple {3732#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0 0) main_~a~0 (* main_~y~0 main_~s~0 0)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {3722#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} is VALID [2022-04-28 05:53:12,714 INFO L290 TraceCheckUtils]: 28: Hoare triple {3732#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0 0) main_~a~0 (* main_~y~0 main_~s~0 0)))} assume !false; {3732#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0 0) main_~a~0 (* main_~y~0 main_~s~0 0)))} is VALID [2022-04-28 05:53:12,714 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; {3732#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0 0) main_~a~0 (* main_~y~0 main_~s~0 0)))} is VALID [2022-04-28 05:53:12,715 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3530#true} {3530#true} #100#return; {3530#true} is VALID [2022-04-28 05:53:12,715 INFO L290 TraceCheckUtils]: 25: Hoare triple {3530#true} assume true; {3530#true} is VALID [2022-04-28 05:53:12,715 INFO L290 TraceCheckUtils]: 24: Hoare triple {3530#true} assume !(0 == ~cond); {3530#true} is VALID [2022-04-28 05:53:12,715 INFO L290 TraceCheckUtils]: 23: Hoare triple {3530#true} ~cond := #in~cond; {3530#true} is VALID [2022-04-28 05:53:12,715 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 05:53:12,715 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3530#true} {3530#true} #98#return; {3530#true} is VALID [2022-04-28 05:53:12,715 INFO L290 TraceCheckUtils]: 20: Hoare triple {3530#true} assume true; {3530#true} is VALID [2022-04-28 05:53:12,715 INFO L290 TraceCheckUtils]: 19: Hoare triple {3530#true} assume !(0 == ~cond); {3530#true} is VALID [2022-04-28 05:53:12,715 INFO L290 TraceCheckUtils]: 18: Hoare triple {3530#true} ~cond := #in~cond; {3530#true} is VALID [2022-04-28 05:53:12,716 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 05:53:12,716 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3530#true} {3530#true} #96#return; {3530#true} is VALID [2022-04-28 05:53:12,716 INFO L290 TraceCheckUtils]: 15: Hoare triple {3530#true} assume true; {3530#true} is VALID [2022-04-28 05:53:12,716 INFO L290 TraceCheckUtils]: 14: Hoare triple {3530#true} assume !(0 == ~cond); {3530#true} is VALID [2022-04-28 05:53:12,716 INFO L290 TraceCheckUtils]: 13: Hoare triple {3530#true} ~cond := #in~cond; {3530#true} is VALID [2022-04-28 05:53:12,716 INFO L272 TraceCheckUtils]: 12: Hoare triple {3530#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {3530#true} is VALID [2022-04-28 05:53:12,716 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 05:53:12,716 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3530#true} {3530#true} #94#return; {3530#true} is VALID [2022-04-28 05:53:12,716 INFO L290 TraceCheckUtils]: 9: Hoare triple {3530#true} assume true; {3530#true} is VALID [2022-04-28 05:53:12,716 INFO L290 TraceCheckUtils]: 8: Hoare triple {3530#true} assume !(0 == ~cond); {3530#true} is VALID [2022-04-28 05:53:12,717 INFO L290 TraceCheckUtils]: 7: Hoare triple {3530#true} ~cond := #in~cond; {3530#true} is VALID [2022-04-28 05:53:12,717 INFO L272 TraceCheckUtils]: 6: Hoare triple {3530#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {3530#true} is VALID [2022-04-28 05:53:12,717 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 05:53:12,717 INFO L272 TraceCheckUtils]: 4: Hoare triple {3530#true} call #t~ret6 := main(); {3530#true} is VALID [2022-04-28 05:53:12,717 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3530#true} {3530#true} #112#return; {3530#true} is VALID [2022-04-28 05:53:12,717 INFO L290 TraceCheckUtils]: 2: Hoare triple {3530#true} assume true; {3530#true} is VALID [2022-04-28 05:53:12,717 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 05:53:12,717 INFO L272 TraceCheckUtils]: 0: Hoare triple {3530#true} call ULTIMATE.init(); {3530#true} is VALID [2022-04-28 05:53:12,718 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 05:53:12,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:53:12,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339869662] [2022-04-28 05:53:12,718 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:53:12,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345709418] [2022-04-28 05:53:12,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345709418] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:53:12,718 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:53:12,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2022-04-28 05:53:12,718 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:53:12,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1293267497] [2022-04-28 05:53:12,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1293267497] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:53:12,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:53:12,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 05:53:12,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307091146] [2022-04-28 05:53:12,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:53:12,719 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 47 [2022-04-28 05:53:12,720 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:53:12,720 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 05:53:12,752 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 05:53:12,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 05:53:12,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:53:12,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 05:53:12,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-28 05:53:12,753 INFO L87 Difference]: Start difference. First operand 123 states and 172 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 05:53:13,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:53:13,669 INFO L93 Difference]: Finished difference Result 137 states and 184 transitions. [2022-04-28 05:53:13,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 05:53:13,669 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 47 [2022-04-28 05:53:13,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:53:13,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 05:53:13,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2022-04-28 05:53:13,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 05:53:13,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2022-04-28 05:53:13,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 101 transitions. [2022-04-28 05:53:13,763 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 05:53:13,766 INFO L225 Difference]: With dead ends: 137 [2022-04-28 05:53:13,766 INFO L226 Difference]: Without dead ends: 135 [2022-04-28 05:53:13,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-28 05:53:13,767 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 32 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 05:53:13,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 233 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 05:53:13,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-04-28 05:53:14,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 131. [2022-04-28 05:53:14,047 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:53:14,047 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 05:53:14,047 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 05:53:14,048 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 05:53:14,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:53:14,054 INFO L93 Difference]: Finished difference Result 135 states and 182 transitions. [2022-04-28 05:53:14,054 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 182 transitions. [2022-04-28 05:53:14,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:53:14,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:53:14,059 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 05:53:14,059 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 05:53:14,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:53:14,070 INFO L93 Difference]: Finished difference Result 135 states and 182 transitions. [2022-04-28 05:53:14,070 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 182 transitions. [2022-04-28 05:53:14,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:53:14,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:53:14,071 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:53:14,071 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:53:14,072 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 05:53:14,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 178 transitions. [2022-04-28 05:53:14,078 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 178 transitions. Word has length 47 [2022-04-28 05:53:14,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:53:14,078 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 178 transitions. [2022-04-28 05:53:14,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 05:53:14,079 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 131 states and 178 transitions. [2022-04-28 05:53:14,305 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 05:53:14,305 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 178 transitions. [2022-04-28 05:53:14,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-28 05:53:14,306 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:53:14,306 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 05:53:14,322 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 05:53:14,507 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 05:53:14,507 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:53:14,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:53:14,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1836145722, now seen corresponding path program 3 times [2022-04-28 05:53:14,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:53:14,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [204749475] [2022-04-28 05:53:14,508 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:53:14,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1836145722, now seen corresponding path program 4 times [2022-04-28 05:53:14,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:53:14,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55085802] [2022-04-28 05:53:14,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:53:14,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:53:14,522 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:53:14,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [992898538] [2022-04-28 05:53:14,522 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:53:14,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:53:14,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:53:14,524 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 05:53:14,547 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 05:53:14,578 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:53:14,578 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:53:14,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 05:53:14,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:53:14,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:53:14,714 INFO L272 TraceCheckUtils]: 0: Hoare triple {4632#true} call ULTIMATE.init(); {4632#true} is VALID [2022-04-28 05:53:14,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {4632#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); {4632#true} is VALID [2022-04-28 05:53:14,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {4632#true} assume true; {4632#true} is VALID [2022-04-28 05:53:14,715 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4632#true} {4632#true} #112#return; {4632#true} is VALID [2022-04-28 05:53:14,715 INFO L272 TraceCheckUtils]: 4: Hoare triple {4632#true} call #t~ret6 := main(); {4632#true} is VALID [2022-04-28 05:53:14,715 INFO L290 TraceCheckUtils]: 5: Hoare triple {4632#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; {4632#true} is VALID [2022-04-28 05:53:14,715 INFO L272 TraceCheckUtils]: 6: Hoare triple {4632#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {4632#true} is VALID [2022-04-28 05:53:14,715 INFO L290 TraceCheckUtils]: 7: Hoare triple {4632#true} ~cond := #in~cond; {4632#true} is VALID [2022-04-28 05:53:14,715 INFO L290 TraceCheckUtils]: 8: Hoare triple {4632#true} assume !(0 == ~cond); {4632#true} is VALID [2022-04-28 05:53:14,715 INFO L290 TraceCheckUtils]: 9: Hoare triple {4632#true} assume true; {4632#true} is VALID [2022-04-28 05:53:14,715 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4632#true} {4632#true} #94#return; {4632#true} is VALID [2022-04-28 05:53:14,715 INFO L290 TraceCheckUtils]: 11: Hoare triple {4632#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4632#true} is VALID [2022-04-28 05:53:14,716 INFO L272 TraceCheckUtils]: 12: Hoare triple {4632#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {4632#true} is VALID [2022-04-28 05:53:14,716 INFO L290 TraceCheckUtils]: 13: Hoare triple {4632#true} ~cond := #in~cond; {4632#true} is VALID [2022-04-28 05:53:14,716 INFO L290 TraceCheckUtils]: 14: Hoare triple {4632#true} assume !(0 == ~cond); {4632#true} is VALID [2022-04-28 05:53:14,716 INFO L290 TraceCheckUtils]: 15: Hoare triple {4632#true} assume true; {4632#true} is VALID [2022-04-28 05:53:14,716 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4632#true} {4632#true} #96#return; {4632#true} is VALID [2022-04-28 05:53:14,716 INFO L272 TraceCheckUtils]: 17: Hoare triple {4632#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4632#true} is VALID [2022-04-28 05:53:14,716 INFO L290 TraceCheckUtils]: 18: Hoare triple {4632#true} ~cond := #in~cond; {4632#true} is VALID [2022-04-28 05:53:14,716 INFO L290 TraceCheckUtils]: 19: Hoare triple {4632#true} assume !(0 == ~cond); {4632#true} is VALID [2022-04-28 05:53:14,716 INFO L290 TraceCheckUtils]: 20: Hoare triple {4632#true} assume true; {4632#true} is VALID [2022-04-28 05:53:14,716 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4632#true} {4632#true} #98#return; {4632#true} is VALID [2022-04-28 05:53:14,717 INFO L272 TraceCheckUtils]: 22: Hoare triple {4632#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4632#true} is VALID [2022-04-28 05:53:14,717 INFO L290 TraceCheckUtils]: 23: Hoare triple {4632#true} ~cond := #in~cond; {4632#true} is VALID [2022-04-28 05:53:14,717 INFO L290 TraceCheckUtils]: 24: Hoare triple {4632#true} assume !(0 == ~cond); {4632#true} is VALID [2022-04-28 05:53:14,717 INFO L290 TraceCheckUtils]: 25: Hoare triple {4632#true} assume true; {4632#true} is VALID [2022-04-28 05:53:14,717 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4632#true} {4632#true} #100#return; {4632#true} is VALID [2022-04-28 05:53:14,717 INFO L290 TraceCheckUtils]: 27: Hoare triple {4632#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {4632#true} is VALID [2022-04-28 05:53:14,717 INFO L290 TraceCheckUtils]: 28: Hoare triple {4632#true} assume !false; {4632#true} is VALID [2022-04-28 05:53:14,717 INFO L290 TraceCheckUtils]: 29: Hoare triple {4632#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {4632#true} is VALID [2022-04-28 05:53:14,717 INFO L290 TraceCheckUtils]: 30: Hoare triple {4632#true} assume !false; {4632#true} is VALID [2022-04-28 05:53:14,718 INFO L290 TraceCheckUtils]: 31: Hoare triple {4632#true} assume !(~c~0 >= ~b~0); {4730#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-28 05:53:14,718 INFO L290 TraceCheckUtils]: 32: Hoare triple {4730#(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; {4734#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 05:53:14,719 INFO L290 TraceCheckUtils]: 33: Hoare triple {4734#(< main_~b~0 main_~a~0)} assume !false; {4734#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 05:53:14,719 INFO L290 TraceCheckUtils]: 34: Hoare triple {4734#(< main_~b~0 main_~a~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {4741#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 05:53:14,720 INFO L290 TraceCheckUtils]: 35: Hoare triple {4741#(< main_~b~0 main_~c~0)} assume !false; {4741#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 05:53:14,720 INFO L290 TraceCheckUtils]: 36: Hoare triple {4741#(< main_~b~0 main_~c~0)} assume !(~c~0 >= ~b~0); {4633#false} is VALID [2022-04-28 05:53:14,720 INFO L290 TraceCheckUtils]: 37: Hoare triple {4633#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; {4633#false} is VALID [2022-04-28 05:53:14,720 INFO L290 TraceCheckUtils]: 38: Hoare triple {4633#false} assume !false; {4633#false} is VALID [2022-04-28 05:53:14,720 INFO L290 TraceCheckUtils]: 39: Hoare triple {4633#false} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {4633#false} is VALID [2022-04-28 05:53:14,721 INFO L290 TraceCheckUtils]: 40: Hoare triple {4633#false} assume !false; {4633#false} is VALID [2022-04-28 05:53:14,721 INFO L290 TraceCheckUtils]: 41: Hoare triple {4633#false} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {4633#false} is VALID [2022-04-28 05:53:14,721 INFO L290 TraceCheckUtils]: 42: Hoare triple {4633#false} assume !false; {4633#false} is VALID [2022-04-28 05:53:14,721 INFO L272 TraceCheckUtils]: 43: Hoare triple {4633#false} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4633#false} is VALID [2022-04-28 05:53:14,721 INFO L290 TraceCheckUtils]: 44: Hoare triple {4633#false} ~cond := #in~cond; {4633#false} is VALID [2022-04-28 05:53:14,721 INFO L290 TraceCheckUtils]: 45: Hoare triple {4633#false} assume 0 == ~cond; {4633#false} is VALID [2022-04-28 05:53:14,721 INFO L290 TraceCheckUtils]: 46: Hoare triple {4633#false} assume !false; {4633#false} is VALID [2022-04-28 05:53:14,721 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 05:53:14,721 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:53:14,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:53:14,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55085802] [2022-04-28 05:53:14,722 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:53:14,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992898538] [2022-04-28 05:53:14,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992898538] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:53:14,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:53:14,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:53:14,722 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:53:14,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [204749475] [2022-04-28 05:53:14,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [204749475] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:53:14,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:53:14,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:53:14,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843286102] [2022-04-28 05:53:14,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:53:14,723 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 05:53:14,723 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:53:14,723 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 05:53:14,755 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 05:53:14,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 05:53:14,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:53:14,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 05:53:14,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 05:53:14,755 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 05:53:15,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:53:15,200 INFO L93 Difference]: Finished difference Result 170 states and 230 transitions. [2022-04-28 05:53:15,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 05:53:15,200 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 05:53:15,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:53:15,200 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 05:53:15,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2022-04-28 05:53:15,202 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 05:53:15,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2022-04-28 05:53:15,204 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 102 transitions. [2022-04-28 05:53:15,284 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 05:53:15,286 INFO L225 Difference]: With dead ends: 170 [2022-04-28 05:53:15,287 INFO L226 Difference]: Without dead ends: 114 [2022-04-28 05:53:15,287 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 05:53:15,288 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 05:53:15,288 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 05:53:15,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-04-28 05:53:15,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 106. [2022-04-28 05:53:15,475 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:53:15,476 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 05:53:15,476 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 05:53:15,477 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 05:53:15,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:53:15,480 INFO L93 Difference]: Finished difference Result 114 states and 146 transitions. [2022-04-28 05:53:15,481 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 146 transitions. [2022-04-28 05:53:15,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:53:15,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:53:15,482 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 05:53:15,482 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 05:53:15,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:53:15,486 INFO L93 Difference]: Finished difference Result 114 states and 146 transitions. [2022-04-28 05:53:15,486 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 146 transitions. [2022-04-28 05:53:15,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:53:15,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:53:15,487 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:53:15,487 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:53:15,487 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 05:53:15,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 137 transitions. [2022-04-28 05:53:15,491 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 137 transitions. Word has length 47 [2022-04-28 05:53:15,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:53:15,491 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 137 transitions. [2022-04-28 05:53:15,491 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 05:53:15,491 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 106 states and 137 transitions. [2022-04-28 05:53:15,655 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 05:53:15,655 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 137 transitions. [2022-04-28 05:53:15,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-28 05:53:15,655 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:53:15,655 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 05:53:15,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-28 05:53:15,856 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 05:53:15,856 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:53:15,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:53:15,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1952108775, now seen corresponding path program 1 times [2022-04-28 05:53:15,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:53:15,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1011338756] [2022-04-28 05:53:15,857 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:53:15,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1952108775, now seen corresponding path program 2 times [2022-04-28 05:53:15,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:53:15,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782197056] [2022-04-28 05:53:15,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:53:15,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:53:15,875 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:53:15,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1260017887] [2022-04-28 05:53:15,875 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:53:15,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:53:15,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:53:15,876 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 05:53:15,881 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 05:53:15,921 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:53:15,922 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:53:15,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 05:53:15,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:53:15,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:53:16,095 INFO L272 TraceCheckUtils]: 0: Hoare triple {5562#true} call ULTIMATE.init(); {5562#true} is VALID [2022-04-28 05:53:16,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {5562#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); {5562#true} is VALID [2022-04-28 05:53:16,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {5562#true} assume true; {5562#true} is VALID [2022-04-28 05:53:16,096 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5562#true} {5562#true} #112#return; {5562#true} is VALID [2022-04-28 05:53:16,096 INFO L272 TraceCheckUtils]: 4: Hoare triple {5562#true} call #t~ret6 := main(); {5562#true} is VALID [2022-04-28 05:53:16,096 INFO L290 TraceCheckUtils]: 5: Hoare triple {5562#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; {5562#true} is VALID [2022-04-28 05:53:16,096 INFO L272 TraceCheckUtils]: 6: Hoare triple {5562#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {5562#true} is VALID [2022-04-28 05:53:16,096 INFO L290 TraceCheckUtils]: 7: Hoare triple {5562#true} ~cond := #in~cond; {5562#true} is VALID [2022-04-28 05:53:16,096 INFO L290 TraceCheckUtils]: 8: Hoare triple {5562#true} assume !(0 == ~cond); {5562#true} is VALID [2022-04-28 05:53:16,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {5562#true} assume true; {5562#true} is VALID [2022-04-28 05:53:16,096 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5562#true} {5562#true} #94#return; {5562#true} is VALID [2022-04-28 05:53:16,096 INFO L290 TraceCheckUtils]: 11: Hoare triple {5562#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {5562#true} is VALID [2022-04-28 05:53:16,097 INFO L272 TraceCheckUtils]: 12: Hoare triple {5562#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {5562#true} is VALID [2022-04-28 05:53:16,097 INFO L290 TraceCheckUtils]: 13: Hoare triple {5562#true} ~cond := #in~cond; {5562#true} is VALID [2022-04-28 05:53:16,097 INFO L290 TraceCheckUtils]: 14: Hoare triple {5562#true} assume !(0 == ~cond); {5562#true} is VALID [2022-04-28 05:53:16,097 INFO L290 TraceCheckUtils]: 15: Hoare triple {5562#true} assume true; {5562#true} is VALID [2022-04-28 05:53:16,097 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5562#true} {5562#true} #96#return; {5562#true} is VALID [2022-04-28 05:53:16,097 INFO L272 TraceCheckUtils]: 17: Hoare triple {5562#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {5562#true} is VALID [2022-04-28 05:53:16,097 INFO L290 TraceCheckUtils]: 18: Hoare triple {5562#true} ~cond := #in~cond; {5562#true} is VALID [2022-04-28 05:53:16,097 INFO L290 TraceCheckUtils]: 19: Hoare triple {5562#true} assume !(0 == ~cond); {5562#true} is VALID [2022-04-28 05:53:16,098 INFO L290 TraceCheckUtils]: 20: Hoare triple {5562#true} assume true; {5562#true} is VALID [2022-04-28 05:53:16,098 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5562#true} {5562#true} #98#return; {5562#true} is VALID [2022-04-28 05:53:16,098 INFO L272 TraceCheckUtils]: 22: Hoare triple {5562#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {5562#true} is VALID [2022-04-28 05:53:16,098 INFO L290 TraceCheckUtils]: 23: Hoare triple {5562#true} ~cond := #in~cond; {5562#true} is VALID [2022-04-28 05:53:16,098 INFO L290 TraceCheckUtils]: 24: Hoare triple {5562#true} assume !(0 == ~cond); {5562#true} is VALID [2022-04-28 05:53:16,098 INFO L290 TraceCheckUtils]: 25: Hoare triple {5562#true} assume true; {5562#true} is VALID [2022-04-28 05:53:16,098 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5562#true} {5562#true} #100#return; {5562#true} is VALID [2022-04-28 05:53:16,098 INFO L290 TraceCheckUtils]: 27: Hoare triple {5562#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {5562#true} is VALID [2022-04-28 05:53:16,098 INFO L290 TraceCheckUtils]: 28: Hoare triple {5562#true} assume !false; {5562#true} is VALID [2022-04-28 05:53:16,098 INFO L290 TraceCheckUtils]: 29: Hoare triple {5562#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {5562#true} is VALID [2022-04-28 05:53:16,099 INFO L290 TraceCheckUtils]: 30: Hoare triple {5562#true} assume !false; {5562#true} is VALID [2022-04-28 05:53:16,099 INFO L290 TraceCheckUtils]: 31: Hoare triple {5562#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {5660#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-28 05:53:16,100 INFO L290 TraceCheckUtils]: 32: Hoare triple {5660#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} assume !false; {5660#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-28 05:53:16,100 INFO L272 TraceCheckUtils]: 33: Hoare triple {5660#(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)); {5562#true} is VALID [2022-04-28 05:53:16,100 INFO L290 TraceCheckUtils]: 34: Hoare triple {5562#true} ~cond := #in~cond; {5562#true} is VALID [2022-04-28 05:53:16,100 INFO L290 TraceCheckUtils]: 35: Hoare triple {5562#true} assume !(0 == ~cond); {5562#true} is VALID [2022-04-28 05:53:16,100 INFO L290 TraceCheckUtils]: 36: Hoare triple {5562#true} assume true; {5562#true} is VALID [2022-04-28 05:53:16,101 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5562#true} {5660#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} #102#return; {5660#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-28 05:53:16,101 INFO L272 TraceCheckUtils]: 38: Hoare triple {5660#(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)); {5562#true} is VALID [2022-04-28 05:53:16,101 INFO L290 TraceCheckUtils]: 39: Hoare triple {5562#true} ~cond := #in~cond; {5562#true} is VALID [2022-04-28 05:53:16,101 INFO L290 TraceCheckUtils]: 40: Hoare triple {5562#true} assume !(0 == ~cond); {5562#true} is VALID [2022-04-28 05:53:16,101 INFO L290 TraceCheckUtils]: 41: Hoare triple {5562#true} assume true; {5562#true} is VALID [2022-04-28 05:53:16,102 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {5562#true} {5660#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} #104#return; {5660#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-28 05:53:16,102 INFO L272 TraceCheckUtils]: 43: Hoare triple {5660#(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)); {5562#true} is VALID [2022-04-28 05:53:16,102 INFO L290 TraceCheckUtils]: 44: Hoare triple {5562#true} ~cond := #in~cond; {5562#true} is VALID [2022-04-28 05:53:16,102 INFO L290 TraceCheckUtils]: 45: Hoare triple {5562#true} assume !(0 == ~cond); {5562#true} is VALID [2022-04-28 05:53:16,103 INFO L290 TraceCheckUtils]: 46: Hoare triple {5562#true} assume true; {5562#true} is VALID [2022-04-28 05:53:16,103 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {5562#true} {5660#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} #106#return; {5660#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-28 05:53:16,104 INFO L272 TraceCheckUtils]: 48: Hoare triple {5660#(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)); {5712#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:53:16,104 INFO L290 TraceCheckUtils]: 49: Hoare triple {5712#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5716#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:53:16,105 INFO L290 TraceCheckUtils]: 50: Hoare triple {5716#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5563#false} is VALID [2022-04-28 05:53:16,105 INFO L290 TraceCheckUtils]: 51: Hoare triple {5563#false} assume !false; {5563#false} is VALID [2022-04-28 05:53:16,105 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 05:53:16,105 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:53:16,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:53:16,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782197056] [2022-04-28 05:53:16,105 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:53:16,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260017887] [2022-04-28 05:53:16,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260017887] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:53:16,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:53:16,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:53:16,106 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:53:16,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1011338756] [2022-04-28 05:53:16,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1011338756] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:53:16,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:53:16,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:53:16,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532756509] [2022-04-28 05:53:16,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:53:16,107 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 05:53:16,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:53:16,107 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 05:53:16,137 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 05:53:16,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 05:53:16,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:53:16,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 05:53:16,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 05:53:16,138 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 05:53:16,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:53:16,606 INFO L93 Difference]: Finished difference Result 158 states and 221 transitions. [2022-04-28 05:53:16,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 05:53:16,606 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 05:53:16,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:53:16,606 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 05:53:16,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-28 05:53:16,608 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 05:53:16,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-28 05:53:16,609 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-28 05:53:16,656 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 05:53:16,660 INFO L225 Difference]: With dead ends: 158 [2022-04-28 05:53:16,660 INFO L226 Difference]: Without dead ends: 156 [2022-04-28 05:53:16,660 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 05:53:16,661 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 05:53:16,661 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 05:53:16,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-04-28 05:53:16,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 140. [2022-04-28 05:53:16,955 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:53:16,962 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 05:53:16,966 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 05:53:16,966 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 05:53:16,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:53:16,971 INFO L93 Difference]: Finished difference Result 156 states and 219 transitions. [2022-04-28 05:53:16,971 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 219 transitions. [2022-04-28 05:53:16,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:53:16,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:53:16,973 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 05:53:16,973 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 05:53:16,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:53:16,979 INFO L93 Difference]: Finished difference Result 156 states and 219 transitions. [2022-04-28 05:53:16,980 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 219 transitions. [2022-04-28 05:53:16,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:53:16,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:53:16,980 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:53:16,980 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:53:16,981 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 05:53:16,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 194 transitions. [2022-04-28 05:53:16,994 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 194 transitions. Word has length 52 [2022-04-28 05:53:16,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:53:16,994 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 194 transitions. [2022-04-28 05:53:16,994 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 05:53:16,994 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 140 states and 194 transitions. [2022-04-28 05:53:17,260 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 05:53:17,260 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 194 transitions. [2022-04-28 05:53:17,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-28 05:53:17,260 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:53:17,260 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 05:53:17,276 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 05:53:17,461 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 05:53:17,461 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:53:17,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:53:17,461 INFO L85 PathProgramCache]: Analyzing trace with hash 188363668, now seen corresponding path program 1 times [2022-04-28 05:53:17,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:53:17,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1413091516] [2022-04-28 05:53:17,462 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:53:17,462 INFO L85 PathProgramCache]: Analyzing trace with hash 188363668, now seen corresponding path program 2 times [2022-04-28 05:53:17,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:53:17,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258565877] [2022-04-28 05:53:17,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:53:17,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:53:17,485 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:53:17,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [810981601] [2022-04-28 05:53:17,485 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:53:17,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:53:17,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:53:17,489 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 05:53:17,497 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 05:53:17,542 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:53:17,542 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:53:17,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 57 conjunts are in the unsatisfiable core [2022-04-28 05:53:17,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:53:17,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:53:18,345 INFO L272 TraceCheckUtils]: 0: Hoare triple {6632#true} call ULTIMATE.init(); {6632#true} is VALID [2022-04-28 05:53:18,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {6632#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); {6632#true} is VALID [2022-04-28 05:53:18,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {6632#true} assume true; {6632#true} is VALID [2022-04-28 05:53:18,345 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6632#true} {6632#true} #112#return; {6632#true} is VALID [2022-04-28 05:53:18,345 INFO L272 TraceCheckUtils]: 4: Hoare triple {6632#true} call #t~ret6 := main(); {6632#true} is VALID [2022-04-28 05:53:18,345 INFO L290 TraceCheckUtils]: 5: Hoare triple {6632#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; {6632#true} is VALID [2022-04-28 05:53:18,346 INFO L272 TraceCheckUtils]: 6: Hoare triple {6632#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {6632#true} is VALID [2022-04-28 05:53:18,346 INFO L290 TraceCheckUtils]: 7: Hoare triple {6632#true} ~cond := #in~cond; {6632#true} is VALID [2022-04-28 05:53:18,346 INFO L290 TraceCheckUtils]: 8: Hoare triple {6632#true} assume !(0 == ~cond); {6632#true} is VALID [2022-04-28 05:53:18,346 INFO L290 TraceCheckUtils]: 9: Hoare triple {6632#true} assume true; {6632#true} is VALID [2022-04-28 05:53:18,346 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6632#true} {6632#true} #94#return; {6632#true} is VALID [2022-04-28 05:53:18,346 INFO L290 TraceCheckUtils]: 11: Hoare triple {6632#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {6632#true} is VALID [2022-04-28 05:53:18,346 INFO L272 TraceCheckUtils]: 12: Hoare triple {6632#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {6632#true} is VALID [2022-04-28 05:53:18,346 INFO L290 TraceCheckUtils]: 13: Hoare triple {6632#true} ~cond := #in~cond; {6632#true} is VALID [2022-04-28 05:53:18,346 INFO L290 TraceCheckUtils]: 14: Hoare triple {6632#true} assume !(0 == ~cond); {6632#true} is VALID [2022-04-28 05:53:18,346 INFO L290 TraceCheckUtils]: 15: Hoare triple {6632#true} assume true; {6632#true} is VALID [2022-04-28 05:53:18,346 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6632#true} {6632#true} #96#return; {6632#true} is VALID [2022-04-28 05:53:18,347 INFO L272 TraceCheckUtils]: 17: Hoare triple {6632#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {6632#true} is VALID [2022-04-28 05:53:18,347 INFO L290 TraceCheckUtils]: 18: Hoare triple {6632#true} ~cond := #in~cond; {6632#true} is VALID [2022-04-28 05:53:18,347 INFO L290 TraceCheckUtils]: 19: Hoare triple {6632#true} assume !(0 == ~cond); {6632#true} is VALID [2022-04-28 05:53:18,347 INFO L290 TraceCheckUtils]: 20: Hoare triple {6632#true} assume true; {6632#true} is VALID [2022-04-28 05:53:18,347 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6632#true} {6632#true} #98#return; {6632#true} is VALID [2022-04-28 05:53:18,347 INFO L272 TraceCheckUtils]: 22: Hoare triple {6632#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6632#true} is VALID [2022-04-28 05:53:18,347 INFO L290 TraceCheckUtils]: 23: Hoare triple {6632#true} ~cond := #in~cond; {6632#true} is VALID [2022-04-28 05:53:18,347 INFO L290 TraceCheckUtils]: 24: Hoare triple {6632#true} assume !(0 == ~cond); {6632#true} is VALID [2022-04-28 05:53:18,347 INFO L290 TraceCheckUtils]: 25: Hoare triple {6632#true} assume true; {6632#true} is VALID [2022-04-28 05:53:18,347 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6632#true} {6632#true} #100#return; {6632#true} is VALID [2022-04-28 05:53:18,348 INFO L290 TraceCheckUtils]: 27: Hoare triple {6632#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {6718#(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 05:53:18,348 INFO L290 TraceCheckUtils]: 28: Hoare triple {6718#(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; {6718#(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 05:53:18,349 INFO L290 TraceCheckUtils]: 29: Hoare triple {6718#(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; {6725#(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 05:53:18,349 INFO L290 TraceCheckUtils]: 30: Hoare triple {6725#(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; {6725#(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 05:53:18,350 INFO L290 TraceCheckUtils]: 31: Hoare triple {6725#(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; {6732#(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 05:53:18,351 INFO L290 TraceCheckUtils]: 32: Hoare triple {6732#(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; {6732#(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 05:53:18,351 INFO L272 TraceCheckUtils]: 33: Hoare triple {6732#(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)); {6632#true} is VALID [2022-04-28 05:53:18,351 INFO L290 TraceCheckUtils]: 34: Hoare triple {6632#true} ~cond := #in~cond; {6742#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:53:18,351 INFO L290 TraceCheckUtils]: 35: Hoare triple {6742#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6746#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:53:18,352 INFO L290 TraceCheckUtils]: 36: Hoare triple {6746#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6746#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:53:18,353 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {6746#(not (= |__VERIFIER_assert_#in~cond| 0))} {6732#(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; {6753#(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 05:53:18,353 INFO L272 TraceCheckUtils]: 38: Hoare triple {6753#(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)); {6632#true} is VALID [2022-04-28 05:53:18,353 INFO L290 TraceCheckUtils]: 39: Hoare triple {6632#true} ~cond := #in~cond; {6742#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:53:18,354 INFO L290 TraceCheckUtils]: 40: Hoare triple {6742#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6746#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:53:18,354 INFO L290 TraceCheckUtils]: 41: Hoare triple {6746#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6746#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:53:18,355 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {6746#(not (= |__VERIFIER_assert_#in~cond| 0))} {6753#(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; {6753#(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 05:53:18,355 INFO L272 TraceCheckUtils]: 43: Hoare triple {6753#(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)); {6632#true} is VALID [2022-04-28 05:53:18,355 INFO L290 TraceCheckUtils]: 44: Hoare triple {6632#true} ~cond := #in~cond; {6632#true} is VALID [2022-04-28 05:53:18,355 INFO L290 TraceCheckUtils]: 45: Hoare triple {6632#true} assume !(0 == ~cond); {6632#true} is VALID [2022-04-28 05:53:18,356 INFO L290 TraceCheckUtils]: 46: Hoare triple {6632#true} assume true; {6632#true} is VALID [2022-04-28 05:53:18,357 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6632#true} {6753#(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; {6753#(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 05:53:18,357 INFO L272 TraceCheckUtils]: 48: Hoare triple {6753#(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)); {6632#true} is VALID [2022-04-28 05:53:18,357 INFO L290 TraceCheckUtils]: 49: Hoare triple {6632#true} ~cond := #in~cond; {6632#true} is VALID [2022-04-28 05:53:18,357 INFO L290 TraceCheckUtils]: 50: Hoare triple {6632#true} assume !(0 == ~cond); {6632#true} is VALID [2022-04-28 05:53:18,357 INFO L290 TraceCheckUtils]: 51: Hoare triple {6632#true} assume true; {6632#true} is VALID [2022-04-28 05:53:18,358 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6632#true} {6753#(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; {6753#(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 05:53:18,359 INFO L290 TraceCheckUtils]: 53: Hoare triple {6753#(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); {6753#(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 05:53:18,360 INFO L290 TraceCheckUtils]: 54: Hoare triple {6753#(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; {6805#(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 05:53:18,360 INFO L290 TraceCheckUtils]: 55: Hoare triple {6805#(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; {6805#(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 05:53:18,361 INFO L290 TraceCheckUtils]: 56: Hoare triple {6805#(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); {6805#(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 05:53:18,362 INFO L290 TraceCheckUtils]: 57: Hoare triple {6805#(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; {6815#(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 05:53:18,362 INFO L290 TraceCheckUtils]: 58: Hoare triple {6815#(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; {6815#(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 05:53:18,363 INFO L290 TraceCheckUtils]: 59: Hoare triple {6815#(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); {6822#(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 05:53:18,364 INFO L272 TraceCheckUtils]: 60: Hoare triple {6822#(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)); {6826#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:53:18,364 INFO L290 TraceCheckUtils]: 61: Hoare triple {6826#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6830#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:53:18,365 INFO L290 TraceCheckUtils]: 62: Hoare triple {6830#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6633#false} is VALID [2022-04-28 05:53:18,365 INFO L290 TraceCheckUtils]: 63: Hoare triple {6633#false} assume !false; {6633#false} is VALID [2022-04-28 05:53:18,365 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 05:53:18,365 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:54:00,579 INFO L290 TraceCheckUtils]: 63: Hoare triple {6633#false} assume !false; {6633#false} is VALID [2022-04-28 05:54:00,579 INFO L290 TraceCheckUtils]: 62: Hoare triple {6830#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6633#false} is VALID [2022-04-28 05:54:00,580 INFO L290 TraceCheckUtils]: 61: Hoare triple {6826#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6830#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:54:00,580 INFO L272 TraceCheckUtils]: 60: Hoare triple {6846#(= (+ (* 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)); {6826#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:54:00,581 INFO L290 TraceCheckUtils]: 59: Hoare triple {6850#(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); {6846#(= (+ (* 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 05:54:00,581 INFO L290 TraceCheckUtils]: 58: Hoare triple {6850#(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; {6850#(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 05:54:01,444 INFO L290 TraceCheckUtils]: 57: Hoare triple {6857#(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; {6850#(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 05:54:01,445 INFO L290 TraceCheckUtils]: 56: Hoare triple {6857#(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); {6857#(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 05:54:01,446 INFO L290 TraceCheckUtils]: 55: Hoare triple {6857#(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; {6857#(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 05:54:01,552 INFO L290 TraceCheckUtils]: 54: Hoare triple {6867#(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; {6857#(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 05:54:01,552 INFO L290 TraceCheckUtils]: 53: Hoare triple {6867#(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); {6867#(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 05:54:01,553 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6632#true} {6867#(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; {6867#(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 05:54:01,553 INFO L290 TraceCheckUtils]: 51: Hoare triple {6632#true} assume true; {6632#true} is VALID [2022-04-28 05:54:01,553 INFO L290 TraceCheckUtils]: 50: Hoare triple {6632#true} assume !(0 == ~cond); {6632#true} is VALID [2022-04-28 05:54:01,553 INFO L290 TraceCheckUtils]: 49: Hoare triple {6632#true} ~cond := #in~cond; {6632#true} is VALID [2022-04-28 05:54:01,554 INFO L272 TraceCheckUtils]: 48: Hoare triple {6867#(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)); {6632#true} is VALID [2022-04-28 05:54:01,554 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6632#true} {6867#(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; {6867#(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 05:54:01,554 INFO L290 TraceCheckUtils]: 46: Hoare triple {6632#true} assume true; {6632#true} is VALID [2022-04-28 05:54:01,554 INFO L290 TraceCheckUtils]: 45: Hoare triple {6632#true} assume !(0 == ~cond); {6632#true} is VALID [2022-04-28 05:54:01,554 INFO L290 TraceCheckUtils]: 44: Hoare triple {6632#true} ~cond := #in~cond; {6632#true} is VALID [2022-04-28 05:54:01,555 INFO L272 TraceCheckUtils]: 43: Hoare triple {6867#(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)); {6632#true} is VALID [2022-04-28 05:54:01,556 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {6746#(not (= |__VERIFIER_assert_#in~cond| 0))} {6904#(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; {6867#(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 05:54:01,556 INFO L290 TraceCheckUtils]: 41: Hoare triple {6746#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6746#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:54:01,556 INFO L290 TraceCheckUtils]: 40: Hoare triple {6914#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {6746#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:54:01,556 INFO L290 TraceCheckUtils]: 39: Hoare triple {6632#true} ~cond := #in~cond; {6914#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 05:54:01,557 INFO L272 TraceCheckUtils]: 38: Hoare triple {6904#(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)); {6632#true} is VALID [2022-04-28 05:54:01,558 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {6746#(not (= |__VERIFIER_assert_#in~cond| 0))} {6921#(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; {6904#(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 05:54:01,558 INFO L290 TraceCheckUtils]: 36: Hoare triple {6746#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6746#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:54:01,558 INFO L290 TraceCheckUtils]: 35: Hoare triple {6914#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {6746#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:54:01,559 INFO L290 TraceCheckUtils]: 34: Hoare triple {6632#true} ~cond := #in~cond; {6914#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 05:54:01,559 INFO L272 TraceCheckUtils]: 33: Hoare triple {6921#(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)); {6632#true} is VALID [2022-04-28 05:54:01,559 INFO L290 TraceCheckUtils]: 32: Hoare triple {6921#(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; {6921#(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 05:54:01,561 INFO L290 TraceCheckUtils]: 31: Hoare triple {6940#(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; {6921#(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 05:54:01,561 INFO L290 TraceCheckUtils]: 30: Hoare triple {6940#(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; {6940#(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 05:54:01,563 INFO L290 TraceCheckUtils]: 29: Hoare triple {6632#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {6940#(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 05:54:01,563 INFO L290 TraceCheckUtils]: 28: Hoare triple {6632#true} assume !false; {6632#true} is VALID [2022-04-28 05:54:01,563 INFO L290 TraceCheckUtils]: 27: Hoare triple {6632#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {6632#true} is VALID [2022-04-28 05:54:01,563 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6632#true} {6632#true} #100#return; {6632#true} is VALID [2022-04-28 05:54:01,563 INFO L290 TraceCheckUtils]: 25: Hoare triple {6632#true} assume true; {6632#true} is VALID [2022-04-28 05:54:01,563 INFO L290 TraceCheckUtils]: 24: Hoare triple {6632#true} assume !(0 == ~cond); {6632#true} is VALID [2022-04-28 05:54:01,563 INFO L290 TraceCheckUtils]: 23: Hoare triple {6632#true} ~cond := #in~cond; {6632#true} is VALID [2022-04-28 05:54:01,563 INFO L272 TraceCheckUtils]: 22: Hoare triple {6632#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6632#true} is VALID [2022-04-28 05:54:01,563 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6632#true} {6632#true} #98#return; {6632#true} is VALID [2022-04-28 05:54:01,563 INFO L290 TraceCheckUtils]: 20: Hoare triple {6632#true} assume true; {6632#true} is VALID [2022-04-28 05:54:01,564 INFO L290 TraceCheckUtils]: 19: Hoare triple {6632#true} assume !(0 == ~cond); {6632#true} is VALID [2022-04-28 05:54:01,564 INFO L290 TraceCheckUtils]: 18: Hoare triple {6632#true} ~cond := #in~cond; {6632#true} is VALID [2022-04-28 05:54:01,564 INFO L272 TraceCheckUtils]: 17: Hoare triple {6632#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {6632#true} is VALID [2022-04-28 05:54:01,564 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6632#true} {6632#true} #96#return; {6632#true} is VALID [2022-04-28 05:54:01,564 INFO L290 TraceCheckUtils]: 15: Hoare triple {6632#true} assume true; {6632#true} is VALID [2022-04-28 05:54:01,564 INFO L290 TraceCheckUtils]: 14: Hoare triple {6632#true} assume !(0 == ~cond); {6632#true} is VALID [2022-04-28 05:54:01,564 INFO L290 TraceCheckUtils]: 13: Hoare triple {6632#true} ~cond := #in~cond; {6632#true} is VALID [2022-04-28 05:54:01,564 INFO L272 TraceCheckUtils]: 12: Hoare triple {6632#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {6632#true} is VALID [2022-04-28 05:54:01,564 INFO L290 TraceCheckUtils]: 11: Hoare triple {6632#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {6632#true} is VALID [2022-04-28 05:54:01,564 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6632#true} {6632#true} #94#return; {6632#true} is VALID [2022-04-28 05:54:01,564 INFO L290 TraceCheckUtils]: 9: Hoare triple {6632#true} assume true; {6632#true} is VALID [2022-04-28 05:54:01,565 INFO L290 TraceCheckUtils]: 8: Hoare triple {6632#true} assume !(0 == ~cond); {6632#true} is VALID [2022-04-28 05:54:01,565 INFO L290 TraceCheckUtils]: 7: Hoare triple {6632#true} ~cond := #in~cond; {6632#true} is VALID [2022-04-28 05:54:01,565 INFO L272 TraceCheckUtils]: 6: Hoare triple {6632#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {6632#true} is VALID [2022-04-28 05:54:01,565 INFO L290 TraceCheckUtils]: 5: Hoare triple {6632#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; {6632#true} is VALID [2022-04-28 05:54:01,565 INFO L272 TraceCheckUtils]: 4: Hoare triple {6632#true} call #t~ret6 := main(); {6632#true} is VALID [2022-04-28 05:54:01,565 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6632#true} {6632#true} #112#return; {6632#true} is VALID [2022-04-28 05:54:01,565 INFO L290 TraceCheckUtils]: 2: Hoare triple {6632#true} assume true; {6632#true} is VALID [2022-04-28 05:54:01,565 INFO L290 TraceCheckUtils]: 1: Hoare triple {6632#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); {6632#true} is VALID [2022-04-28 05:54:01,565 INFO L272 TraceCheckUtils]: 0: Hoare triple {6632#true} call ULTIMATE.init(); {6632#true} is VALID [2022-04-28 05:54:01,566 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 05:54:01,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:54:01,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258565877] [2022-04-28 05:54:01,566 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:54:01,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810981601] [2022-04-28 05:54:01,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810981601] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:54:01,566 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:54:01,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2022-04-28 05:54:01,567 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:54:01,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1413091516] [2022-04-28 05:54:01,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1413091516] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:54:01,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:54:01,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 05:54:01,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140019477] [2022-04-28 05:54:01,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:54:01,568 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 05:54:01,568 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:54:01,568 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 05:54:01,615 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 05:54:01,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 05:54:01,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:54:01,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 05:54:01,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2022-04-28 05:54:01,616 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 05:54:03,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:54:03,829 INFO L93 Difference]: Finished difference Result 200 states and 283 transitions. [2022-04-28 05:54:03,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 05:54:03,830 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 05:54:03,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:54:03,830 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 05:54:03,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 131 transitions. [2022-04-28 05:54:03,833 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 05:54:03,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 131 transitions. [2022-04-28 05:54:03,836 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 131 transitions. [2022-04-28 05:54:03,968 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 05:54:03,972 INFO L225 Difference]: With dead ends: 200 [2022-04-28 05:54:03,972 INFO L226 Difference]: Without dead ends: 197 [2022-04-28 05:54:03,973 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 05:54:03,973 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 47 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 05:54:03,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 329 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 05:54:03,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-04-28 05:54:04,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 193. [2022-04-28 05:54:04,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:54:04,425 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 05:54:04,425 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 05:54:04,426 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 05:54:04,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:54:04,434 INFO L93 Difference]: Finished difference Result 197 states and 279 transitions. [2022-04-28 05:54:04,434 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 279 transitions. [2022-04-28 05:54:04,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:54:04,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:54:04,436 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 05:54:04,436 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 05:54:04,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:54:04,472 INFO L93 Difference]: Finished difference Result 197 states and 279 transitions. [2022-04-28 05:54:04,473 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 279 transitions. [2022-04-28 05:54:04,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:54:04,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:54:04,474 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:54:04,474 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:54:04,474 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 05:54:04,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 275 transitions. [2022-04-28 05:54:04,483 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 275 transitions. Word has length 64 [2022-04-28 05:54:04,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:54:04,483 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 275 transitions. [2022-04-28 05:54:04,483 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 05:54:04,483 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 193 states and 275 transitions. [2022-04-28 05:54:04,873 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 05:54:04,873 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 275 transitions. [2022-04-28 05:54:04,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-28 05:54:04,874 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:54:04,874 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 05:54:04,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-28 05:54:05,087 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 05:54:05,087 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:54:05,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:54:05,088 INFO L85 PathProgramCache]: Analyzing trace with hash -368004398, now seen corresponding path program 3 times [2022-04-28 05:54:05,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:54:05,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1870348303] [2022-04-28 05:54:05,088 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:54:05,088 INFO L85 PathProgramCache]: Analyzing trace with hash -368004398, now seen corresponding path program 4 times [2022-04-28 05:54:05,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:54:05,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836947000] [2022-04-28 05:54:05,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:54:05,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:54:05,106 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:54:05,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1283054399] [2022-04-28 05:54:05,106 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:54:05,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:54:05,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:54:05,108 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 05:54:05,111 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 05:54:05,153 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:54:05,154 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:54:05,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 05:54:05,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:54:05,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:54:05,383 INFO L272 TraceCheckUtils]: 0: Hoare triple {8224#true} call ULTIMATE.init(); {8224#true} is VALID [2022-04-28 05:54:05,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {8224#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); {8224#true} is VALID [2022-04-28 05:54:05,383 INFO L290 TraceCheckUtils]: 2: Hoare triple {8224#true} assume true; {8224#true} is VALID [2022-04-28 05:54:05,383 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8224#true} {8224#true} #112#return; {8224#true} is VALID [2022-04-28 05:54:05,383 INFO L272 TraceCheckUtils]: 4: Hoare triple {8224#true} call #t~ret6 := main(); {8224#true} is VALID [2022-04-28 05:54:05,383 INFO L290 TraceCheckUtils]: 5: Hoare triple {8224#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; {8224#true} is VALID [2022-04-28 05:54:05,383 INFO L272 TraceCheckUtils]: 6: Hoare triple {8224#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {8224#true} is VALID [2022-04-28 05:54:05,383 INFO L290 TraceCheckUtils]: 7: Hoare triple {8224#true} ~cond := #in~cond; {8224#true} is VALID [2022-04-28 05:54:05,383 INFO L290 TraceCheckUtils]: 8: Hoare triple {8224#true} assume !(0 == ~cond); {8224#true} is VALID [2022-04-28 05:54:05,383 INFO L290 TraceCheckUtils]: 9: Hoare triple {8224#true} assume true; {8224#true} is VALID [2022-04-28 05:54:05,384 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8224#true} {8224#true} #94#return; {8224#true} is VALID [2022-04-28 05:54:05,384 INFO L290 TraceCheckUtils]: 11: Hoare triple {8224#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8224#true} is VALID [2022-04-28 05:54:05,384 INFO L272 TraceCheckUtils]: 12: Hoare triple {8224#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {8224#true} is VALID [2022-04-28 05:54:05,384 INFO L290 TraceCheckUtils]: 13: Hoare triple {8224#true} ~cond := #in~cond; {8224#true} is VALID [2022-04-28 05:54:05,384 INFO L290 TraceCheckUtils]: 14: Hoare triple {8224#true} assume !(0 == ~cond); {8224#true} is VALID [2022-04-28 05:54:05,384 INFO L290 TraceCheckUtils]: 15: Hoare triple {8224#true} assume true; {8224#true} is VALID [2022-04-28 05:54:05,384 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8224#true} {8224#true} #96#return; {8224#true} is VALID [2022-04-28 05:54:05,384 INFO L272 TraceCheckUtils]: 17: Hoare triple {8224#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {8224#true} is VALID [2022-04-28 05:54:05,384 INFO L290 TraceCheckUtils]: 18: Hoare triple {8224#true} ~cond := #in~cond; {8224#true} is VALID [2022-04-28 05:54:05,384 INFO L290 TraceCheckUtils]: 19: Hoare triple {8224#true} assume !(0 == ~cond); {8224#true} is VALID [2022-04-28 05:54:05,384 INFO L290 TraceCheckUtils]: 20: Hoare triple {8224#true} assume true; {8224#true} is VALID [2022-04-28 05:54:05,385 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8224#true} {8224#true} #98#return; {8224#true} is VALID [2022-04-28 05:54:05,385 INFO L272 TraceCheckUtils]: 22: Hoare triple {8224#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8224#true} is VALID [2022-04-28 05:54:05,385 INFO L290 TraceCheckUtils]: 23: Hoare triple {8224#true} ~cond := #in~cond; {8224#true} is VALID [2022-04-28 05:54:05,385 INFO L290 TraceCheckUtils]: 24: Hoare triple {8224#true} assume !(0 == ~cond); {8224#true} is VALID [2022-04-28 05:54:05,385 INFO L290 TraceCheckUtils]: 25: Hoare triple {8224#true} assume true; {8224#true} is VALID [2022-04-28 05:54:05,385 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8224#true} {8224#true} #100#return; {8224#true} is VALID [2022-04-28 05:54:05,385 INFO L290 TraceCheckUtils]: 27: Hoare triple {8224#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {8224#true} is VALID [2022-04-28 05:54:05,385 INFO L290 TraceCheckUtils]: 28: Hoare triple {8224#true} assume !false; {8224#true} is VALID [2022-04-28 05:54:05,385 INFO L290 TraceCheckUtils]: 29: Hoare triple {8224#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {8224#true} is VALID [2022-04-28 05:54:05,385 INFO L290 TraceCheckUtils]: 30: Hoare triple {8224#true} assume !false; {8224#true} is VALID [2022-04-28 05:54:05,387 INFO L290 TraceCheckUtils]: 31: Hoare triple {8224#true} assume !(~c~0 >= ~b~0); {8322#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-28 05:54:05,388 INFO L290 TraceCheckUtils]: 32: Hoare triple {8322#(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; {8326#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 05:54:05,388 INFO L290 TraceCheckUtils]: 33: Hoare triple {8326#(< main_~b~0 main_~a~0)} assume !false; {8326#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 05:54:05,388 INFO L290 TraceCheckUtils]: 34: Hoare triple {8326#(< main_~b~0 main_~a~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {8333#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 05:54:05,389 INFO L290 TraceCheckUtils]: 35: Hoare triple {8333#(< main_~b~0 main_~c~0)} assume !false; {8333#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 05:54:05,389 INFO L290 TraceCheckUtils]: 36: Hoare triple {8333#(< main_~b~0 main_~c~0)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {8340#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 05:54:05,390 INFO L290 TraceCheckUtils]: 37: Hoare triple {8340#(< main_~v~0 main_~c~0)} assume !false; {8340#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 05:54:05,390 INFO L272 TraceCheckUtils]: 38: Hoare triple {8340#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8224#true} is VALID [2022-04-28 05:54:05,390 INFO L290 TraceCheckUtils]: 39: Hoare triple {8224#true} ~cond := #in~cond; {8224#true} is VALID [2022-04-28 05:54:05,390 INFO L290 TraceCheckUtils]: 40: Hoare triple {8224#true} assume !(0 == ~cond); {8224#true} is VALID [2022-04-28 05:54:05,390 INFO L290 TraceCheckUtils]: 41: Hoare triple {8224#true} assume true; {8224#true} is VALID [2022-04-28 05:54:05,391 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {8224#true} {8340#(< main_~v~0 main_~c~0)} #102#return; {8340#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 05:54:05,391 INFO L272 TraceCheckUtils]: 43: Hoare triple {8340#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8224#true} is VALID [2022-04-28 05:54:05,391 INFO L290 TraceCheckUtils]: 44: Hoare triple {8224#true} ~cond := #in~cond; {8224#true} is VALID [2022-04-28 05:54:05,391 INFO L290 TraceCheckUtils]: 45: Hoare triple {8224#true} assume !(0 == ~cond); {8224#true} is VALID [2022-04-28 05:54:05,391 INFO L290 TraceCheckUtils]: 46: Hoare triple {8224#true} assume true; {8224#true} is VALID [2022-04-28 05:54:05,392 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8224#true} {8340#(< main_~v~0 main_~c~0)} #104#return; {8340#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 05:54:05,392 INFO L272 TraceCheckUtils]: 48: Hoare triple {8340#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {8224#true} is VALID [2022-04-28 05:54:05,392 INFO L290 TraceCheckUtils]: 49: Hoare triple {8224#true} ~cond := #in~cond; {8224#true} is VALID [2022-04-28 05:54:05,392 INFO L290 TraceCheckUtils]: 50: Hoare triple {8224#true} assume !(0 == ~cond); {8224#true} is VALID [2022-04-28 05:54:05,392 INFO L290 TraceCheckUtils]: 51: Hoare triple {8224#true} assume true; {8224#true} is VALID [2022-04-28 05:54:05,393 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8224#true} {8340#(< main_~v~0 main_~c~0)} #106#return; {8340#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 05:54:05,393 INFO L272 TraceCheckUtils]: 53: Hoare triple {8340#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {8224#true} is VALID [2022-04-28 05:54:05,393 INFO L290 TraceCheckUtils]: 54: Hoare triple {8224#true} ~cond := #in~cond; {8224#true} is VALID [2022-04-28 05:54:05,393 INFO L290 TraceCheckUtils]: 55: Hoare triple {8224#true} assume !(0 == ~cond); {8224#true} is VALID [2022-04-28 05:54:05,393 INFO L290 TraceCheckUtils]: 56: Hoare triple {8224#true} assume true; {8224#true} is VALID [2022-04-28 05:54:05,394 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {8224#true} {8340#(< main_~v~0 main_~c~0)} #108#return; {8340#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 05:54:05,394 INFO L290 TraceCheckUtils]: 58: Hoare triple {8340#(< main_~v~0 main_~c~0)} assume !(~c~0 >= 2 * ~v~0); {8340#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 05:54:05,395 INFO L290 TraceCheckUtils]: 59: Hoare triple {8340#(< main_~v~0 main_~c~0)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {8410#(< 0 main_~c~0)} is VALID [2022-04-28 05:54:05,395 INFO L290 TraceCheckUtils]: 60: Hoare triple {8410#(< 0 main_~c~0)} assume !false; {8410#(< 0 main_~c~0)} is VALID [2022-04-28 05:54:05,395 INFO L290 TraceCheckUtils]: 61: Hoare triple {8410#(< 0 main_~c~0)} assume !(~c~0 >= ~b~0); {8410#(< 0 main_~c~0)} is VALID [2022-04-28 05:54:05,396 INFO L290 TraceCheckUtils]: 62: Hoare triple {8410#(< 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; {8420#(< 0 main_~b~0)} is VALID [2022-04-28 05:54:05,396 INFO L290 TraceCheckUtils]: 63: Hoare triple {8420#(< 0 main_~b~0)} assume !false; {8420#(< 0 main_~b~0)} is VALID [2022-04-28 05:54:05,396 INFO L290 TraceCheckUtils]: 64: Hoare triple {8420#(< 0 main_~b~0)} assume !(0 != ~b~0); {8225#false} is VALID [2022-04-28 05:54:05,396 INFO L272 TraceCheckUtils]: 65: Hoare triple {8225#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)); {8225#false} is VALID [2022-04-28 05:54:05,397 INFO L290 TraceCheckUtils]: 66: Hoare triple {8225#false} ~cond := #in~cond; {8225#false} is VALID [2022-04-28 05:54:05,397 INFO L290 TraceCheckUtils]: 67: Hoare triple {8225#false} assume 0 == ~cond; {8225#false} is VALID [2022-04-28 05:54:05,397 INFO L290 TraceCheckUtils]: 68: Hoare triple {8225#false} assume !false; {8225#false} is VALID [2022-04-28 05:54:05,397 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 05:54:05,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:54:05,630 INFO L290 TraceCheckUtils]: 68: Hoare triple {8225#false} assume !false; {8225#false} is VALID [2022-04-28 05:54:05,630 INFO L290 TraceCheckUtils]: 67: Hoare triple {8225#false} assume 0 == ~cond; {8225#false} is VALID [2022-04-28 05:54:05,630 INFO L290 TraceCheckUtils]: 66: Hoare triple {8225#false} ~cond := #in~cond; {8225#false} is VALID [2022-04-28 05:54:05,630 INFO L272 TraceCheckUtils]: 65: Hoare triple {8225#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)); {8225#false} is VALID [2022-04-28 05:54:05,631 INFO L290 TraceCheckUtils]: 64: Hoare triple {8420#(< 0 main_~b~0)} assume !(0 != ~b~0); {8225#false} is VALID [2022-04-28 05:54:05,631 INFO L290 TraceCheckUtils]: 63: Hoare triple {8420#(< 0 main_~b~0)} assume !false; {8420#(< 0 main_~b~0)} is VALID [2022-04-28 05:54:05,631 INFO L290 TraceCheckUtils]: 62: Hoare triple {8410#(< 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; {8420#(< 0 main_~b~0)} is VALID [2022-04-28 05:54:05,631 INFO L290 TraceCheckUtils]: 61: Hoare triple {8410#(< 0 main_~c~0)} assume !(~c~0 >= ~b~0); {8410#(< 0 main_~c~0)} is VALID [2022-04-28 05:54:05,632 INFO L290 TraceCheckUtils]: 60: Hoare triple {8410#(< 0 main_~c~0)} assume !false; {8410#(< 0 main_~c~0)} is VALID [2022-04-28 05:54:05,632 INFO L290 TraceCheckUtils]: 59: Hoare triple {8340#(< main_~v~0 main_~c~0)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {8410#(< 0 main_~c~0)} is VALID [2022-04-28 05:54:05,632 INFO L290 TraceCheckUtils]: 58: Hoare triple {8340#(< main_~v~0 main_~c~0)} assume !(~c~0 >= 2 * ~v~0); {8340#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 05:54:05,633 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {8224#true} {8340#(< main_~v~0 main_~c~0)} #108#return; {8340#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 05:54:05,633 INFO L290 TraceCheckUtils]: 56: Hoare triple {8224#true} assume true; {8224#true} is VALID [2022-04-28 05:54:05,633 INFO L290 TraceCheckUtils]: 55: Hoare triple {8224#true} assume !(0 == ~cond); {8224#true} is VALID [2022-04-28 05:54:05,633 INFO L290 TraceCheckUtils]: 54: Hoare triple {8224#true} ~cond := #in~cond; {8224#true} is VALID [2022-04-28 05:54:05,633 INFO L272 TraceCheckUtils]: 53: Hoare triple {8340#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {8224#true} is VALID [2022-04-28 05:54:05,634 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8224#true} {8340#(< main_~v~0 main_~c~0)} #106#return; {8340#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 05:54:05,634 INFO L290 TraceCheckUtils]: 51: Hoare triple {8224#true} assume true; {8224#true} is VALID [2022-04-28 05:54:05,634 INFO L290 TraceCheckUtils]: 50: Hoare triple {8224#true} assume !(0 == ~cond); {8224#true} is VALID [2022-04-28 05:54:05,634 INFO L290 TraceCheckUtils]: 49: Hoare triple {8224#true} ~cond := #in~cond; {8224#true} is VALID [2022-04-28 05:54:05,634 INFO L272 TraceCheckUtils]: 48: Hoare triple {8340#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {8224#true} is VALID [2022-04-28 05:54:05,634 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8224#true} {8340#(< main_~v~0 main_~c~0)} #104#return; {8340#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 05:54:05,635 INFO L290 TraceCheckUtils]: 46: Hoare triple {8224#true} assume true; {8224#true} is VALID [2022-04-28 05:54:05,635 INFO L290 TraceCheckUtils]: 45: Hoare triple {8224#true} assume !(0 == ~cond); {8224#true} is VALID [2022-04-28 05:54:05,635 INFO L290 TraceCheckUtils]: 44: Hoare triple {8224#true} ~cond := #in~cond; {8224#true} is VALID [2022-04-28 05:54:05,635 INFO L272 TraceCheckUtils]: 43: Hoare triple {8340#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8224#true} is VALID [2022-04-28 05:54:05,635 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {8224#true} {8340#(< main_~v~0 main_~c~0)} #102#return; {8340#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 05:54:05,635 INFO L290 TraceCheckUtils]: 41: Hoare triple {8224#true} assume true; {8224#true} is VALID [2022-04-28 05:54:05,635 INFO L290 TraceCheckUtils]: 40: Hoare triple {8224#true} assume !(0 == ~cond); {8224#true} is VALID [2022-04-28 05:54:05,635 INFO L290 TraceCheckUtils]: 39: Hoare triple {8224#true} ~cond := #in~cond; {8224#true} is VALID [2022-04-28 05:54:05,635 INFO L272 TraceCheckUtils]: 38: Hoare triple {8340#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8224#true} is VALID [2022-04-28 05:54:05,636 INFO L290 TraceCheckUtils]: 37: Hoare triple {8340#(< main_~v~0 main_~c~0)} assume !false; {8340#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 05:54:05,636 INFO L290 TraceCheckUtils]: 36: Hoare triple {8333#(< main_~b~0 main_~c~0)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {8340#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 05:54:05,639 INFO L290 TraceCheckUtils]: 35: Hoare triple {8333#(< main_~b~0 main_~c~0)} assume !false; {8333#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 05:54:05,640 INFO L290 TraceCheckUtils]: 34: Hoare triple {8326#(< main_~b~0 main_~a~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {8333#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 05:54:05,640 INFO L290 TraceCheckUtils]: 33: Hoare triple {8326#(< main_~b~0 main_~a~0)} assume !false; {8326#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 05:54:05,640 INFO L290 TraceCheckUtils]: 32: Hoare triple {8322#(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; {8326#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 05:54:05,641 INFO L290 TraceCheckUtils]: 31: Hoare triple {8224#true} assume !(~c~0 >= ~b~0); {8322#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-28 05:54:05,641 INFO L290 TraceCheckUtils]: 30: Hoare triple {8224#true} assume !false; {8224#true} is VALID [2022-04-28 05:54:05,641 INFO L290 TraceCheckUtils]: 29: Hoare triple {8224#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {8224#true} is VALID [2022-04-28 05:54:05,641 INFO L290 TraceCheckUtils]: 28: Hoare triple {8224#true} assume !false; {8224#true} is VALID [2022-04-28 05:54:05,641 INFO L290 TraceCheckUtils]: 27: Hoare triple {8224#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {8224#true} is VALID [2022-04-28 05:54:05,641 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8224#true} {8224#true} #100#return; {8224#true} is VALID [2022-04-28 05:54:05,641 INFO L290 TraceCheckUtils]: 25: Hoare triple {8224#true} assume true; {8224#true} is VALID [2022-04-28 05:54:05,641 INFO L290 TraceCheckUtils]: 24: Hoare triple {8224#true} assume !(0 == ~cond); {8224#true} is VALID [2022-04-28 05:54:05,641 INFO L290 TraceCheckUtils]: 23: Hoare triple {8224#true} ~cond := #in~cond; {8224#true} is VALID [2022-04-28 05:54:05,641 INFO L272 TraceCheckUtils]: 22: Hoare triple {8224#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8224#true} is VALID [2022-04-28 05:54:05,642 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8224#true} {8224#true} #98#return; {8224#true} is VALID [2022-04-28 05:54:05,642 INFO L290 TraceCheckUtils]: 20: Hoare triple {8224#true} assume true; {8224#true} is VALID [2022-04-28 05:54:05,642 INFO L290 TraceCheckUtils]: 19: Hoare triple {8224#true} assume !(0 == ~cond); {8224#true} is VALID [2022-04-28 05:54:05,642 INFO L290 TraceCheckUtils]: 18: Hoare triple {8224#true} ~cond := #in~cond; {8224#true} is VALID [2022-04-28 05:54:05,642 INFO L272 TraceCheckUtils]: 17: Hoare triple {8224#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {8224#true} is VALID [2022-04-28 05:54:05,642 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8224#true} {8224#true} #96#return; {8224#true} is VALID [2022-04-28 05:54:05,642 INFO L290 TraceCheckUtils]: 15: Hoare triple {8224#true} assume true; {8224#true} is VALID [2022-04-28 05:54:05,642 INFO L290 TraceCheckUtils]: 14: Hoare triple {8224#true} assume !(0 == ~cond); {8224#true} is VALID [2022-04-28 05:54:05,642 INFO L290 TraceCheckUtils]: 13: Hoare triple {8224#true} ~cond := #in~cond; {8224#true} is VALID [2022-04-28 05:54:05,642 INFO L272 TraceCheckUtils]: 12: Hoare triple {8224#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {8224#true} is VALID [2022-04-28 05:54:05,642 INFO L290 TraceCheckUtils]: 11: Hoare triple {8224#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8224#true} is VALID [2022-04-28 05:54:05,642 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8224#true} {8224#true} #94#return; {8224#true} is VALID [2022-04-28 05:54:05,643 INFO L290 TraceCheckUtils]: 9: Hoare triple {8224#true} assume true; {8224#true} is VALID [2022-04-28 05:54:05,643 INFO L290 TraceCheckUtils]: 8: Hoare triple {8224#true} assume !(0 == ~cond); {8224#true} is VALID [2022-04-28 05:54:05,643 INFO L290 TraceCheckUtils]: 7: Hoare triple {8224#true} ~cond := #in~cond; {8224#true} is VALID [2022-04-28 05:54:05,643 INFO L272 TraceCheckUtils]: 6: Hoare triple {8224#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {8224#true} is VALID [2022-04-28 05:54:05,643 INFO L290 TraceCheckUtils]: 5: Hoare triple {8224#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; {8224#true} is VALID [2022-04-28 05:54:05,643 INFO L272 TraceCheckUtils]: 4: Hoare triple {8224#true} call #t~ret6 := main(); {8224#true} is VALID [2022-04-28 05:54:05,643 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8224#true} {8224#true} #112#return; {8224#true} is VALID [2022-04-28 05:54:05,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {8224#true} assume true; {8224#true} is VALID [2022-04-28 05:54:05,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {8224#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); {8224#true} is VALID [2022-04-28 05:54:05,643 INFO L272 TraceCheckUtils]: 0: Hoare triple {8224#true} call ULTIMATE.init(); {8224#true} is VALID [2022-04-28 05:54:05,644 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 05:54:05,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:54:05,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836947000] [2022-04-28 05:54:05,644 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:54:05,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283054399] [2022-04-28 05:54:05,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283054399] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:54:05,644 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:54:05,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-04-28 05:54:05,644 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:54:05,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1870348303] [2022-04-28 05:54:05,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1870348303] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:54:05,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:54:05,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 05:54:05,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913627428] [2022-04-28 05:54:05,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:54:05,645 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 05:54:05,645 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:54:05,646 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 05:54:05,688 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 05:54:05,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 05:54:05,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:54:05,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 05:54:05,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-28 05:54:05,689 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 05:54:07,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:54:07,556 INFO L93 Difference]: Finished difference Result 288 states and 424 transitions. [2022-04-28 05:54:07,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 05:54:07,556 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 05:54:07,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:54:07,557 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 05:54:07,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 158 transitions. [2022-04-28 05:54:07,560 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 05:54:07,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 158 transitions. [2022-04-28 05:54:07,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 158 transitions. [2022-04-28 05:54:07,718 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 05:54:07,726 INFO L225 Difference]: With dead ends: 288 [2022-04-28 05:54:07,726 INFO L226 Difference]: Without dead ends: 281 [2022-04-28 05:54:07,727 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 05:54:07,727 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 05:54:07,727 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 05:54:07,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-04-28 05:54:08,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 208. [2022-04-28 05:54:08,229 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:54:08,229 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 05:54:08,229 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 05:54:08,230 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 05:54:08,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:54:08,242 INFO L93 Difference]: Finished difference Result 281 states and 417 transitions. [2022-04-28 05:54:08,242 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 417 transitions. [2022-04-28 05:54:08,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:54:08,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:54:08,244 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 05:54:08,244 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 05:54:08,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:54:08,256 INFO L93 Difference]: Finished difference Result 281 states and 417 transitions. [2022-04-28 05:54:08,256 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 417 transitions. [2022-04-28 05:54:08,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:54:08,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:54:08,257 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:54:08,257 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:54:08,258 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 05:54:08,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 296 transitions. [2022-04-28 05:54:08,265 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 296 transitions. Word has length 69 [2022-04-28 05:54:08,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:54:08,265 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 296 transitions. [2022-04-28 05:54:08,266 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 05:54:08,266 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 208 states and 296 transitions. [2022-04-28 05:54:08,785 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 05:54:08,785 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 296 transitions. [2022-04-28 05:54:08,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-28 05:54:08,786 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:54:08,786 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 05:54:08,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-28 05:54:08,995 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 05:54:08,996 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:54:08,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:54:08,996 INFO L85 PathProgramCache]: Analyzing trace with hash -298771846, now seen corresponding path program 1 times [2022-04-28 05:54:08,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:54:08,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1192932685] [2022-04-28 05:54:08,996 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:54:08,997 INFO L85 PathProgramCache]: Analyzing trace with hash -298771846, now seen corresponding path program 2 times [2022-04-28 05:54:08,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:54:08,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586012117] [2022-04-28 05:54:08,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:54:08,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:54:09,022 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:54:09,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1717121625] [2022-04-28 05:54:09,022 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:54:09,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:54:09,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:54:09,034 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 05:54:09,046 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 05:54:09,090 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:54:09,090 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:54:09,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 05:54:09,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:54:09,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:54:10,184 INFO L272 TraceCheckUtils]: 0: Hoare triple {10226#true} call ULTIMATE.init(); {10226#true} is VALID [2022-04-28 05:54:10,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {10226#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); {10226#true} is VALID [2022-04-28 05:54:10,185 INFO L290 TraceCheckUtils]: 2: Hoare triple {10226#true} assume true; {10226#true} is VALID [2022-04-28 05:54:10,185 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10226#true} {10226#true} #112#return; {10226#true} is VALID [2022-04-28 05:54:10,185 INFO L272 TraceCheckUtils]: 4: Hoare triple {10226#true} call #t~ret6 := main(); {10226#true} is VALID [2022-04-28 05:54:10,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {10226#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; {10226#true} is VALID [2022-04-28 05:54:10,185 INFO L272 TraceCheckUtils]: 6: Hoare triple {10226#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {10226#true} is VALID [2022-04-28 05:54:10,185 INFO L290 TraceCheckUtils]: 7: Hoare triple {10226#true} ~cond := #in~cond; {10252#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 05:54:10,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {10252#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {10256#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:54:10,186 INFO L290 TraceCheckUtils]: 9: Hoare triple {10256#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {10256#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:54:10,186 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10256#(not (= |assume_abort_if_not_#in~cond| 0))} {10226#true} #94#return; {10263#(and (<= 0 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 05:54:10,187 INFO L290 TraceCheckUtils]: 11: Hoare triple {10263#(and (<= 0 main_~x~0) (<= main_~x~0 5))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {10263#(and (<= 0 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 05:54:10,187 INFO L272 TraceCheckUtils]: 12: Hoare triple {10263#(and (<= 0 main_~x~0) (<= main_~x~0 5))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {10226#true} is VALID [2022-04-28 05:54:10,187 INFO L290 TraceCheckUtils]: 13: Hoare triple {10226#true} ~cond := #in~cond; {10252#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 05:54:10,187 INFO L290 TraceCheckUtils]: 14: Hoare triple {10252#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {10256#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:54:10,188 INFO L290 TraceCheckUtils]: 15: Hoare triple {10256#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {10256#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:54:10,188 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10256#(not (= |assume_abort_if_not_#in~cond| 0))} {10263#(and (<= 0 main_~x~0) (<= main_~x~0 5))} #96#return; {10282#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 5) (<= main_~y~0 5))} is VALID [2022-04-28 05:54:10,188 INFO L272 TraceCheckUtils]: 17: Hoare triple {10282#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 5) (<= main_~y~0 5))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {10226#true} is VALID [2022-04-28 05:54:10,188 INFO L290 TraceCheckUtils]: 18: Hoare triple {10226#true} ~cond := #in~cond; {10226#true} is VALID [2022-04-28 05:54:10,188 INFO L290 TraceCheckUtils]: 19: Hoare triple {10226#true} assume !(0 == ~cond); {10226#true} is VALID [2022-04-28 05:54:10,188 INFO L290 TraceCheckUtils]: 20: Hoare triple {10226#true} assume true; {10226#true} is VALID [2022-04-28 05:54:10,189 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {10226#true} {10282#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 5) (<= main_~y~0 5))} #98#return; {10282#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 5) (<= main_~y~0 5))} is VALID [2022-04-28 05:54:10,189 INFO L272 TraceCheckUtils]: 22: Hoare triple {10282#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 5) (<= main_~y~0 5))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {10226#true} is VALID [2022-04-28 05:54:10,189 INFO L290 TraceCheckUtils]: 23: Hoare triple {10226#true} ~cond := #in~cond; {10226#true} is VALID [2022-04-28 05:54:10,189 INFO L290 TraceCheckUtils]: 24: Hoare triple {10226#true} assume !(0 == ~cond); {10226#true} is VALID [2022-04-28 05:54:10,189 INFO L290 TraceCheckUtils]: 25: Hoare triple {10226#true} assume true; {10226#true} is VALID [2022-04-28 05:54:10,189 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10226#true} {10282#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 5) (<= main_~y~0 5))} #100#return; {10282#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 5) (<= main_~y~0 5))} is VALID [2022-04-28 05:54:10,190 INFO L290 TraceCheckUtils]: 27: Hoare triple {10282#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 5) (<= main_~y~0 5))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {10316#(and (<= main_~b~0 5) (<= 0 main_~b~0) (<= main_~a~0 5))} is VALID [2022-04-28 05:54:10,190 INFO L290 TraceCheckUtils]: 28: Hoare triple {10316#(and (<= main_~b~0 5) (<= 0 main_~b~0) (<= main_~a~0 5))} assume !false; {10316#(and (<= main_~b~0 5) (<= 0 main_~b~0) (<= main_~a~0 5))} is VALID [2022-04-28 05:54:10,195 INFO L290 TraceCheckUtils]: 29: Hoare triple {10316#(and (<= main_~b~0 5) (<= 0 main_~b~0) (<= main_~a~0 5))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {10323#(and (<= main_~c~0 5) (<= main_~b~0 5) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-28 05:54:10,196 INFO L290 TraceCheckUtils]: 30: Hoare triple {10323#(and (<= main_~c~0 5) (<= main_~b~0 5) (not (= main_~b~0 0)) (<= 0 main_~b~0))} assume !false; {10323#(and (<= main_~c~0 5) (<= main_~b~0 5) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-28 05:54:10,197 INFO L290 TraceCheckUtils]: 31: Hoare triple {10323#(and (<= main_~c~0 5) (<= main_~b~0 5) (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; {10330#(and (= main_~b~0 main_~v~0) (<= main_~c~0 5) (<= main_~b~0 5) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-28 05:54:10,197 INFO L290 TraceCheckUtils]: 32: Hoare triple {10330#(and (= main_~b~0 main_~v~0) (<= main_~c~0 5) (<= main_~b~0 5) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} assume !false; {10330#(and (= main_~b~0 main_~v~0) (<= main_~c~0 5) (<= main_~b~0 5) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-28 05:54:10,197 INFO L272 TraceCheckUtils]: 33: Hoare triple {10330#(and (= main_~b~0 main_~v~0) (<= main_~c~0 5) (<= main_~b~0 5) (= 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)); {10226#true} is VALID [2022-04-28 05:54:10,197 INFO L290 TraceCheckUtils]: 34: Hoare triple {10226#true} ~cond := #in~cond; {10226#true} is VALID [2022-04-28 05:54:10,198 INFO L290 TraceCheckUtils]: 35: Hoare triple {10226#true} assume !(0 == ~cond); {10226#true} is VALID [2022-04-28 05:54:10,198 INFO L290 TraceCheckUtils]: 36: Hoare triple {10226#true} assume true; {10226#true} is VALID [2022-04-28 05:54:10,198 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {10226#true} {10330#(and (= main_~b~0 main_~v~0) (<= main_~c~0 5) (<= main_~b~0 5) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} #102#return; {10330#(and (= main_~b~0 main_~v~0) (<= main_~c~0 5) (<= main_~b~0 5) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-28 05:54:10,199 INFO L272 TraceCheckUtils]: 38: Hoare triple {10330#(and (= main_~b~0 main_~v~0) (<= main_~c~0 5) (<= main_~b~0 5) (= 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)); {10226#true} is VALID [2022-04-28 05:54:10,199 INFO L290 TraceCheckUtils]: 39: Hoare triple {10226#true} ~cond := #in~cond; {10226#true} is VALID [2022-04-28 05:54:10,199 INFO L290 TraceCheckUtils]: 40: Hoare triple {10226#true} assume !(0 == ~cond); {10226#true} is VALID [2022-04-28 05:54:10,199 INFO L290 TraceCheckUtils]: 41: Hoare triple {10226#true} assume true; {10226#true} is VALID [2022-04-28 05:54:10,200 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {10226#true} {10330#(and (= main_~b~0 main_~v~0) (<= main_~c~0 5) (<= main_~b~0 5) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} #104#return; {10330#(and (= main_~b~0 main_~v~0) (<= main_~c~0 5) (<= main_~b~0 5) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-28 05:54:10,200 INFO L272 TraceCheckUtils]: 43: Hoare triple {10330#(and (= main_~b~0 main_~v~0) (<= main_~c~0 5) (<= main_~b~0 5) (= 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)); {10226#true} is VALID [2022-04-28 05:54:10,200 INFO L290 TraceCheckUtils]: 44: Hoare triple {10226#true} ~cond := #in~cond; {10226#true} is VALID [2022-04-28 05:54:10,200 INFO L290 TraceCheckUtils]: 45: Hoare triple {10226#true} assume !(0 == ~cond); {10226#true} is VALID [2022-04-28 05:54:10,200 INFO L290 TraceCheckUtils]: 46: Hoare triple {10226#true} assume true; {10226#true} is VALID [2022-04-28 05:54:10,201 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {10226#true} {10330#(and (= main_~b~0 main_~v~0) (<= main_~c~0 5) (<= main_~b~0 5) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} #106#return; {10330#(and (= main_~b~0 main_~v~0) (<= main_~c~0 5) (<= main_~b~0 5) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-28 05:54:10,201 INFO L272 TraceCheckUtils]: 48: Hoare triple {10330#(and (= main_~b~0 main_~v~0) (<= main_~c~0 5) (<= main_~b~0 5) (= 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)); {10226#true} is VALID [2022-04-28 05:54:10,201 INFO L290 TraceCheckUtils]: 49: Hoare triple {10226#true} ~cond := #in~cond; {10226#true} is VALID [2022-04-28 05:54:10,201 INFO L290 TraceCheckUtils]: 50: Hoare triple {10226#true} assume !(0 == ~cond); {10226#true} is VALID [2022-04-28 05:54:10,201 INFO L290 TraceCheckUtils]: 51: Hoare triple {10226#true} assume true; {10226#true} is VALID [2022-04-28 05:54:10,202 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {10226#true} {10330#(and (= main_~b~0 main_~v~0) (<= main_~c~0 5) (<= main_~b~0 5) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} #108#return; {10330#(and (= main_~b~0 main_~v~0) (<= main_~c~0 5) (<= main_~b~0 5) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-28 05:54:10,202 INFO L290 TraceCheckUtils]: 53: Hoare triple {10330#(and (= main_~b~0 main_~v~0) (<= main_~c~0 5) (<= main_~b~0 5) (= 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; {10397#(and (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) 5) (= main_~d~0 2) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-28 05:54:10,203 INFO L290 TraceCheckUtils]: 54: Hoare triple {10397#(and (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) 5) (= main_~d~0 2) (not (= main_~b~0 0)) (<= 0 main_~b~0))} assume !false; {10397#(and (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) 5) (= main_~d~0 2) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-28 05:54:10,203 INFO L272 TraceCheckUtils]: 55: Hoare triple {10397#(and (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) 5) (= 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)); {10226#true} is VALID [2022-04-28 05:54:10,203 INFO L290 TraceCheckUtils]: 56: Hoare triple {10226#true} ~cond := #in~cond; {10226#true} is VALID [2022-04-28 05:54:10,203 INFO L290 TraceCheckUtils]: 57: Hoare triple {10226#true} assume !(0 == ~cond); {10226#true} is VALID [2022-04-28 05:54:10,203 INFO L290 TraceCheckUtils]: 58: Hoare triple {10226#true} assume true; {10226#true} is VALID [2022-04-28 05:54:10,204 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {10226#true} {10397#(and (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) 5) (= main_~d~0 2) (not (= main_~b~0 0)) (<= 0 main_~b~0))} #102#return; {10397#(and (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) 5) (= main_~d~0 2) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-28 05:54:10,204 INFO L272 TraceCheckUtils]: 60: Hoare triple {10397#(and (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) 5) (= 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)); {10226#true} is VALID [2022-04-28 05:54:10,204 INFO L290 TraceCheckUtils]: 61: Hoare triple {10226#true} ~cond := #in~cond; {10226#true} is VALID [2022-04-28 05:54:10,204 INFO L290 TraceCheckUtils]: 62: Hoare triple {10226#true} assume !(0 == ~cond); {10226#true} is VALID [2022-04-28 05:54:10,204 INFO L290 TraceCheckUtils]: 63: Hoare triple {10226#true} assume true; {10226#true} is VALID [2022-04-28 05:54:10,205 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {10226#true} {10397#(and (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) 5) (= main_~d~0 2) (not (= main_~b~0 0)) (<= 0 main_~b~0))} #104#return; {10397#(and (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) 5) (= main_~d~0 2) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-28 05:54:10,205 INFO L272 TraceCheckUtils]: 65: Hoare triple {10397#(and (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) 5) (= 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)); {10226#true} is VALID [2022-04-28 05:54:10,205 INFO L290 TraceCheckUtils]: 66: Hoare triple {10226#true} ~cond := #in~cond; {10226#true} is VALID [2022-04-28 05:54:10,205 INFO L290 TraceCheckUtils]: 67: Hoare triple {10226#true} assume !(0 == ~cond); {10226#true} is VALID [2022-04-28 05:54:10,205 INFO L290 TraceCheckUtils]: 68: Hoare triple {10226#true} assume true; {10226#true} is VALID [2022-04-28 05:54:10,206 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {10226#true} {10397#(and (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) 5) (= main_~d~0 2) (not (= main_~b~0 0)) (<= 0 main_~b~0))} #106#return; {10397#(and (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) 5) (= main_~d~0 2) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-28 05:54:10,207 INFO L272 TraceCheckUtils]: 70: Hoare triple {10397#(and (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) 5) (= 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)); {10449#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:54:10,207 INFO L290 TraceCheckUtils]: 71: Hoare triple {10449#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10453#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:54:10,208 INFO L290 TraceCheckUtils]: 72: Hoare triple {10453#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10227#false} is VALID [2022-04-28 05:54:10,208 INFO L290 TraceCheckUtils]: 73: Hoare triple {10227#false} assume !false; {10227#false} is VALID [2022-04-28 05:54:10,208 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 05:54:10,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:54:10,639 INFO L290 TraceCheckUtils]: 73: Hoare triple {10227#false} assume !false; {10227#false} is VALID [2022-04-28 05:54:10,639 INFO L290 TraceCheckUtils]: 72: Hoare triple {10453#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10227#false} is VALID [2022-04-28 05:54:10,640 INFO L290 TraceCheckUtils]: 71: Hoare triple {10449#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10453#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:54:10,655 INFO L272 TraceCheckUtils]: 70: Hoare triple {10469#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {10449#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:54:10,657 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {10226#true} {10469#(= main_~v~0 (* main_~d~0 main_~b~0))} #106#return; {10469#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-28 05:54:10,657 INFO L290 TraceCheckUtils]: 68: Hoare triple {10226#true} assume true; {10226#true} is VALID [2022-04-28 05:54:10,658 INFO L290 TraceCheckUtils]: 67: Hoare triple {10226#true} assume !(0 == ~cond); {10226#true} is VALID [2022-04-28 05:54:10,658 INFO L290 TraceCheckUtils]: 66: Hoare triple {10226#true} ~cond := #in~cond; {10226#true} is VALID [2022-04-28 05:54:10,658 INFO L272 TraceCheckUtils]: 65: Hoare triple {10469#(= 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)); {10226#true} is VALID [2022-04-28 05:54:10,662 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {10226#true} {10469#(= main_~v~0 (* main_~d~0 main_~b~0))} #104#return; {10469#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-28 05:54:10,662 INFO L290 TraceCheckUtils]: 63: Hoare triple {10226#true} assume true; {10226#true} is VALID [2022-04-28 05:54:10,662 INFO L290 TraceCheckUtils]: 62: Hoare triple {10226#true} assume !(0 == ~cond); {10226#true} is VALID [2022-04-28 05:54:10,663 INFO L290 TraceCheckUtils]: 61: Hoare triple {10226#true} ~cond := #in~cond; {10226#true} is VALID [2022-04-28 05:54:10,663 INFO L272 TraceCheckUtils]: 60: Hoare triple {10469#(= 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)); {10226#true} is VALID [2022-04-28 05:54:10,667 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {10226#true} {10469#(= main_~v~0 (* main_~d~0 main_~b~0))} #102#return; {10469#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-28 05:54:10,667 INFO L290 TraceCheckUtils]: 58: Hoare triple {10226#true} assume true; {10226#true} is VALID [2022-04-28 05:54:10,668 INFO L290 TraceCheckUtils]: 57: Hoare triple {10226#true} assume !(0 == ~cond); {10226#true} is VALID [2022-04-28 05:54:10,668 INFO L290 TraceCheckUtils]: 56: Hoare triple {10226#true} ~cond := #in~cond; {10226#true} is VALID [2022-04-28 05:54:10,668 INFO L272 TraceCheckUtils]: 55: Hoare triple {10469#(= 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)); {10226#true} is VALID [2022-04-28 05:54:10,668 INFO L290 TraceCheckUtils]: 54: Hoare triple {10469#(= main_~v~0 (* main_~d~0 main_~b~0))} assume !false; {10469#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-28 05:54:10,671 INFO L290 TraceCheckUtils]: 53: Hoare triple {10521#(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; {10469#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-28 05:54:10,672 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {10226#true} {10521#(or (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2))) (not (<= (* main_~v~0 2) main_~c~0)))} #108#return; {10521#(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 05:54:10,672 INFO L290 TraceCheckUtils]: 51: Hoare triple {10226#true} assume true; {10226#true} is VALID [2022-04-28 05:54:10,672 INFO L290 TraceCheckUtils]: 50: Hoare triple {10226#true} assume !(0 == ~cond); {10226#true} is VALID [2022-04-28 05:54:10,672 INFO L290 TraceCheckUtils]: 49: Hoare triple {10226#true} ~cond := #in~cond; {10226#true} is VALID [2022-04-28 05:54:10,672 INFO L272 TraceCheckUtils]: 48: Hoare triple {10521#(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)); {10226#true} is VALID [2022-04-28 05:54:10,673 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {10226#true} {10521#(or (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2))) (not (<= (* main_~v~0 2) main_~c~0)))} #106#return; {10521#(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 05:54:10,673 INFO L290 TraceCheckUtils]: 46: Hoare triple {10226#true} assume true; {10226#true} is VALID [2022-04-28 05:54:10,673 INFO L290 TraceCheckUtils]: 45: Hoare triple {10226#true} assume !(0 == ~cond); {10226#true} is VALID [2022-04-28 05:54:10,673 INFO L290 TraceCheckUtils]: 44: Hoare triple {10226#true} ~cond := #in~cond; {10226#true} is VALID [2022-04-28 05:54:10,673 INFO L272 TraceCheckUtils]: 43: Hoare triple {10521#(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)); {10226#true} is VALID [2022-04-28 05:54:10,674 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {10226#true} {10521#(or (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2))) (not (<= (* main_~v~0 2) main_~c~0)))} #104#return; {10521#(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 05:54:10,674 INFO L290 TraceCheckUtils]: 41: Hoare triple {10226#true} assume true; {10226#true} is VALID [2022-04-28 05:54:10,674 INFO L290 TraceCheckUtils]: 40: Hoare triple {10226#true} assume !(0 == ~cond); {10226#true} is VALID [2022-04-28 05:54:10,674 INFO L290 TraceCheckUtils]: 39: Hoare triple {10226#true} ~cond := #in~cond; {10226#true} is VALID [2022-04-28 05:54:10,674 INFO L272 TraceCheckUtils]: 38: Hoare triple {10521#(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)); {10226#true} is VALID [2022-04-28 05:54:10,675 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {10226#true} {10521#(or (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2))) (not (<= (* main_~v~0 2) main_~c~0)))} #102#return; {10521#(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 05:54:10,675 INFO L290 TraceCheckUtils]: 36: Hoare triple {10226#true} assume true; {10226#true} is VALID [2022-04-28 05:54:10,675 INFO L290 TraceCheckUtils]: 35: Hoare triple {10226#true} assume !(0 == ~cond); {10226#true} is VALID [2022-04-28 05:54:10,675 INFO L290 TraceCheckUtils]: 34: Hoare triple {10226#true} ~cond := #in~cond; {10226#true} is VALID [2022-04-28 05:54:10,675 INFO L272 TraceCheckUtils]: 33: Hoare triple {10521#(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)); {10226#true} is VALID [2022-04-28 05:54:10,676 INFO L290 TraceCheckUtils]: 32: Hoare triple {10521#(or (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2))) (not (<= (* main_~v~0 2) main_~c~0)))} assume !false; {10521#(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 05:54:10,676 INFO L290 TraceCheckUtils]: 31: Hoare triple {10226#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {10521#(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 05:54:10,676 INFO L290 TraceCheckUtils]: 30: Hoare triple {10226#true} assume !false; {10226#true} is VALID [2022-04-28 05:54:10,676 INFO L290 TraceCheckUtils]: 29: Hoare triple {10226#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {10226#true} is VALID [2022-04-28 05:54:10,676 INFO L290 TraceCheckUtils]: 28: Hoare triple {10226#true} assume !false; {10226#true} is VALID [2022-04-28 05:54:10,677 INFO L290 TraceCheckUtils]: 27: Hoare triple {10226#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {10226#true} is VALID [2022-04-28 05:54:10,677 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10226#true} {10226#true} #100#return; {10226#true} is VALID [2022-04-28 05:54:10,677 INFO L290 TraceCheckUtils]: 25: Hoare triple {10226#true} assume true; {10226#true} is VALID [2022-04-28 05:54:10,677 INFO L290 TraceCheckUtils]: 24: Hoare triple {10226#true} assume !(0 == ~cond); {10226#true} is VALID [2022-04-28 05:54:10,677 INFO L290 TraceCheckUtils]: 23: Hoare triple {10226#true} ~cond := #in~cond; {10226#true} is VALID [2022-04-28 05:54:10,677 INFO L272 TraceCheckUtils]: 22: Hoare triple {10226#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {10226#true} is VALID [2022-04-28 05:54:10,677 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {10226#true} {10226#true} #98#return; {10226#true} is VALID [2022-04-28 05:54:10,677 INFO L290 TraceCheckUtils]: 20: Hoare triple {10226#true} assume true; {10226#true} is VALID [2022-04-28 05:54:10,677 INFO L290 TraceCheckUtils]: 19: Hoare triple {10226#true} assume !(0 == ~cond); {10226#true} is VALID [2022-04-28 05:54:10,677 INFO L290 TraceCheckUtils]: 18: Hoare triple {10226#true} ~cond := #in~cond; {10226#true} is VALID [2022-04-28 05:54:10,677 INFO L272 TraceCheckUtils]: 17: Hoare triple {10226#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {10226#true} is VALID [2022-04-28 05:54:10,677 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10226#true} {10226#true} #96#return; {10226#true} is VALID [2022-04-28 05:54:10,678 INFO L290 TraceCheckUtils]: 15: Hoare triple {10226#true} assume true; {10226#true} is VALID [2022-04-28 05:54:10,678 INFO L290 TraceCheckUtils]: 14: Hoare triple {10226#true} assume !(0 == ~cond); {10226#true} is VALID [2022-04-28 05:54:10,678 INFO L290 TraceCheckUtils]: 13: Hoare triple {10226#true} ~cond := #in~cond; {10226#true} is VALID [2022-04-28 05:54:10,678 INFO L272 TraceCheckUtils]: 12: Hoare triple {10226#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {10226#true} is VALID [2022-04-28 05:54:10,678 INFO L290 TraceCheckUtils]: 11: Hoare triple {10226#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {10226#true} is VALID [2022-04-28 05:54:10,678 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10226#true} {10226#true} #94#return; {10226#true} is VALID [2022-04-28 05:54:10,678 INFO L290 TraceCheckUtils]: 9: Hoare triple {10226#true} assume true; {10226#true} is VALID [2022-04-28 05:54:10,678 INFO L290 TraceCheckUtils]: 8: Hoare triple {10226#true} assume !(0 == ~cond); {10226#true} is VALID [2022-04-28 05:54:10,678 INFO L290 TraceCheckUtils]: 7: Hoare triple {10226#true} ~cond := #in~cond; {10226#true} is VALID [2022-04-28 05:54:10,678 INFO L272 TraceCheckUtils]: 6: Hoare triple {10226#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {10226#true} is VALID [2022-04-28 05:54:10,678 INFO L290 TraceCheckUtils]: 5: Hoare triple {10226#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; {10226#true} is VALID [2022-04-28 05:54:10,678 INFO L272 TraceCheckUtils]: 4: Hoare triple {10226#true} call #t~ret6 := main(); {10226#true} is VALID [2022-04-28 05:54:10,678 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10226#true} {10226#true} #112#return; {10226#true} is VALID [2022-04-28 05:54:10,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {10226#true} assume true; {10226#true} is VALID [2022-04-28 05:54:10,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {10226#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); {10226#true} is VALID [2022-04-28 05:54:10,679 INFO L272 TraceCheckUtils]: 0: Hoare triple {10226#true} call ULTIMATE.init(); {10226#true} is VALID [2022-04-28 05:54:10,679 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 05:54:10,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:54:10,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586012117] [2022-04-28 05:54:10,679 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:54:10,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717121625] [2022-04-28 05:54:10,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717121625] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 05:54:10,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 05:54:10,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 14 [2022-04-28 05:54:10,680 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:54:10,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1192932685] [2022-04-28 05:54:10,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1192932685] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:54:10,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:54:10,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 05:54:10,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220847416] [2022-04-28 05:54:10,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:54:10,681 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 05:54:10,681 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:54:10,681 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 05:54:10,723 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 05:54:10,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 05:54:10,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:54:10,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 05:54:10,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-04-28 05:54:10,724 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 05:54:11,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:54:11,357 INFO L93 Difference]: Finished difference Result 214 states and 301 transitions. [2022-04-28 05:54:11,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 05:54:11,358 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 05:54:11,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:54:11,358 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 05:54:11,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-28 05:54:11,359 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 05:54:11,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-28 05:54:11,360 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2022-04-28 05:54:11,410 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 05:54:11,415 INFO L225 Difference]: With dead ends: 214 [2022-04-28 05:54:11,415 INFO L226 Difference]: Without dead ends: 212 [2022-04-28 05:54:11,415 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 05:54:11,415 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 13 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:54:11,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 139 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:54:11,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-04-28 05:54:11,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2022-04-28 05:54:11,913 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:54:11,913 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 05:54:11,913 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 05:54:11,914 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 05:54:11,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:54:11,920 INFO L93 Difference]: Finished difference Result 212 states and 299 transitions. [2022-04-28 05:54:11,920 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 299 transitions. [2022-04-28 05:54:11,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:54:11,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:54:11,922 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 05:54:11,923 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 05:54:11,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:54:11,929 INFO L93 Difference]: Finished difference Result 212 states and 299 transitions. [2022-04-28 05:54:11,929 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 299 transitions. [2022-04-28 05:54:11,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:54:11,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:54:11,930 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:54:11,930 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:54:11,931 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 05:54:11,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 299 transitions. [2022-04-28 05:54:11,938 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 299 transitions. Word has length 74 [2022-04-28 05:54:11,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:54:11,938 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 299 transitions. [2022-04-28 05:54:11,938 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 05:54:11,939 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 212 states and 299 transitions. [2022-04-28 05:54:12,520 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 05:54:12,521 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 299 transitions. [2022-04-28 05:54:12,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-04-28 05:54:12,522 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:54:12,522 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 05:54:12,547 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 05:54:12,722 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 05:54:12,722 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:54:12,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:54:12,723 INFO L85 PathProgramCache]: Analyzing trace with hash -2089538094, now seen corresponding path program 1 times [2022-04-28 05:54:12,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:54:12,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [897474388] [2022-04-28 05:54:12,723 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:54:12,723 INFO L85 PathProgramCache]: Analyzing trace with hash -2089538094, now seen corresponding path program 2 times [2022-04-28 05:54:12,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:54:12,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142963829] [2022-04-28 05:54:12,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:54:12,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:54:12,740 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:54:12,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1024509697] [2022-04-28 05:54:12,741 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:54:12,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:54:12,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:54:12,746 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 05:54:12,748 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 05:54:12,803 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:54:12,803 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:54:12,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 05:54:12,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:54:12,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:54:13,056 INFO L272 TraceCheckUtils]: 0: Hoare triple {11961#true} call ULTIMATE.init(); {11961#true} is VALID [2022-04-28 05:54:13,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {11961#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); {11961#true} is VALID [2022-04-28 05:54:13,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {11961#true} assume true; {11961#true} is VALID [2022-04-28 05:54:13,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11961#true} {11961#true} #112#return; {11961#true} is VALID [2022-04-28 05:54:13,057 INFO L272 TraceCheckUtils]: 4: Hoare triple {11961#true} call #t~ret6 := main(); {11961#true} is VALID [2022-04-28 05:54:13,057 INFO L290 TraceCheckUtils]: 5: Hoare triple {11961#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; {11961#true} is VALID [2022-04-28 05:54:13,057 INFO L272 TraceCheckUtils]: 6: Hoare triple {11961#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {11961#true} is VALID [2022-04-28 05:54:13,057 INFO L290 TraceCheckUtils]: 7: Hoare triple {11961#true} ~cond := #in~cond; {11961#true} is VALID [2022-04-28 05:54:13,057 INFO L290 TraceCheckUtils]: 8: Hoare triple {11961#true} assume !(0 == ~cond); {11961#true} is VALID [2022-04-28 05:54:13,057 INFO L290 TraceCheckUtils]: 9: Hoare triple {11961#true} assume true; {11961#true} is VALID [2022-04-28 05:54:13,057 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11961#true} {11961#true} #94#return; {11961#true} is VALID [2022-04-28 05:54:13,057 INFO L290 TraceCheckUtils]: 11: Hoare triple {11961#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {11961#true} is VALID [2022-04-28 05:54:13,057 INFO L272 TraceCheckUtils]: 12: Hoare triple {11961#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {11961#true} is VALID [2022-04-28 05:54:13,058 INFO L290 TraceCheckUtils]: 13: Hoare triple {11961#true} ~cond := #in~cond; {11961#true} is VALID [2022-04-28 05:54:13,058 INFO L290 TraceCheckUtils]: 14: Hoare triple {11961#true} assume !(0 == ~cond); {11961#true} is VALID [2022-04-28 05:54:13,058 INFO L290 TraceCheckUtils]: 15: Hoare triple {11961#true} assume true; {11961#true} is VALID [2022-04-28 05:54:13,058 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11961#true} {11961#true} #96#return; {11961#true} is VALID [2022-04-28 05:54:13,058 INFO L272 TraceCheckUtils]: 17: Hoare triple {11961#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {11961#true} is VALID [2022-04-28 05:54:13,058 INFO L290 TraceCheckUtils]: 18: Hoare triple {11961#true} ~cond := #in~cond; {11961#true} is VALID [2022-04-28 05:54:13,058 INFO L290 TraceCheckUtils]: 19: Hoare triple {11961#true} assume !(0 == ~cond); {11961#true} is VALID [2022-04-28 05:54:13,058 INFO L290 TraceCheckUtils]: 20: Hoare triple {11961#true} assume true; {11961#true} is VALID [2022-04-28 05:54:13,058 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {11961#true} {11961#true} #98#return; {11961#true} is VALID [2022-04-28 05:54:13,058 INFO L272 TraceCheckUtils]: 22: Hoare triple {11961#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11961#true} is VALID [2022-04-28 05:54:13,058 INFO L290 TraceCheckUtils]: 23: Hoare triple {11961#true} ~cond := #in~cond; {11961#true} is VALID [2022-04-28 05:54:13,058 INFO L290 TraceCheckUtils]: 24: Hoare triple {11961#true} assume !(0 == ~cond); {11961#true} is VALID [2022-04-28 05:54:13,058 INFO L290 TraceCheckUtils]: 25: Hoare triple {11961#true} assume true; {11961#true} is VALID [2022-04-28 05:54:13,059 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {11961#true} {11961#true} #100#return; {11961#true} is VALID [2022-04-28 05:54:13,059 INFO L290 TraceCheckUtils]: 27: Hoare triple {11961#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {11961#true} is VALID [2022-04-28 05:54:13,059 INFO L290 TraceCheckUtils]: 28: Hoare triple {11961#true} assume !false; {11961#true} is VALID [2022-04-28 05:54:13,059 INFO L290 TraceCheckUtils]: 29: Hoare triple {11961#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {11961#true} is VALID [2022-04-28 05:54:13,059 INFO L290 TraceCheckUtils]: 30: Hoare triple {11961#true} assume !false; {11961#true} is VALID [2022-04-28 05:54:13,059 INFO L290 TraceCheckUtils]: 31: Hoare triple {11961#true} assume !(~c~0 >= ~b~0); {11961#true} is VALID [2022-04-28 05:54:13,059 INFO L290 TraceCheckUtils]: 32: Hoare triple {11961#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; {11961#true} is VALID [2022-04-28 05:54:13,059 INFO L290 TraceCheckUtils]: 33: Hoare triple {11961#true} assume !false; {11961#true} is VALID [2022-04-28 05:54:13,059 INFO L290 TraceCheckUtils]: 34: Hoare triple {11961#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {11961#true} is VALID [2022-04-28 05:54:13,059 INFO L290 TraceCheckUtils]: 35: Hoare triple {11961#true} assume !false; {11961#true} is VALID [2022-04-28 05:54:13,059 INFO L290 TraceCheckUtils]: 36: Hoare triple {11961#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {11961#true} is VALID [2022-04-28 05:54:13,059 INFO L290 TraceCheckUtils]: 37: Hoare triple {11961#true} assume !false; {11961#true} is VALID [2022-04-28 05:54:13,059 INFO L272 TraceCheckUtils]: 38: Hoare triple {11961#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11961#true} is VALID [2022-04-28 05:54:13,060 INFO L290 TraceCheckUtils]: 39: Hoare triple {11961#true} ~cond := #in~cond; {11961#true} is VALID [2022-04-28 05:54:13,060 INFO L290 TraceCheckUtils]: 40: Hoare triple {11961#true} assume !(0 == ~cond); {11961#true} is VALID [2022-04-28 05:54:13,060 INFO L290 TraceCheckUtils]: 41: Hoare triple {11961#true} assume true; {11961#true} is VALID [2022-04-28 05:54:13,060 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {11961#true} {11961#true} #102#return; {11961#true} is VALID [2022-04-28 05:54:13,060 INFO L272 TraceCheckUtils]: 43: Hoare triple {11961#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11961#true} is VALID [2022-04-28 05:54:13,061 INFO L290 TraceCheckUtils]: 44: Hoare triple {11961#true} ~cond := #in~cond; {12098#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:54:13,061 INFO L290 TraceCheckUtils]: 45: Hoare triple {12098#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {12102#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:54:13,061 INFO L290 TraceCheckUtils]: 46: Hoare triple {12102#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {12102#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:54:13,062 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {12102#(not (= |__VERIFIER_assert_#in~cond| 0))} {11961#true} #104#return; {12109#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:54:13,062 INFO L272 TraceCheckUtils]: 48: Hoare triple {12109#(= main_~b~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)); {11961#true} is VALID [2022-04-28 05:54:13,062 INFO L290 TraceCheckUtils]: 49: Hoare triple {11961#true} ~cond := #in~cond; {11961#true} is VALID [2022-04-28 05:54:13,063 INFO L290 TraceCheckUtils]: 50: Hoare triple {11961#true} assume !(0 == ~cond); {11961#true} is VALID [2022-04-28 05:54:13,063 INFO L290 TraceCheckUtils]: 51: Hoare triple {11961#true} assume true; {11961#true} is VALID [2022-04-28 05:54:13,063 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {11961#true} {12109#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #106#return; {12109#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:54:13,063 INFO L272 TraceCheckUtils]: 53: Hoare triple {12109#(= main_~b~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)); {11961#true} is VALID [2022-04-28 05:54:13,064 INFO L290 TraceCheckUtils]: 54: Hoare triple {11961#true} ~cond := #in~cond; {11961#true} is VALID [2022-04-28 05:54:13,064 INFO L290 TraceCheckUtils]: 55: Hoare triple {11961#true} assume !(0 == ~cond); {11961#true} is VALID [2022-04-28 05:54:13,064 INFO L290 TraceCheckUtils]: 56: Hoare triple {11961#true} assume true; {11961#true} is VALID [2022-04-28 05:54:13,064 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {11961#true} {12109#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #108#return; {12109#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:54:13,065 INFO L290 TraceCheckUtils]: 58: Hoare triple {12109#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= 2 * ~v~0); {12109#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:54:13,065 INFO L290 TraceCheckUtils]: 59: Hoare triple {12109#(= main_~b~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; {12109#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:54:13,066 INFO L290 TraceCheckUtils]: 60: Hoare triple {12109#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {12109#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:54:13,066 INFO L290 TraceCheckUtils]: 61: Hoare triple {12109#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= ~b~0); {12109#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:54:13,067 INFO L290 TraceCheckUtils]: 62: Hoare triple {12109#(= 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; {12155#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:54:13,067 INFO L290 TraceCheckUtils]: 63: Hoare triple {12155#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {12155#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:54:13,067 INFO L290 TraceCheckUtils]: 64: Hoare triple {12155#(= 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; {12155#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:54:13,068 INFO L290 TraceCheckUtils]: 65: Hoare triple {12155#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {12155#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:54:13,068 INFO L290 TraceCheckUtils]: 66: Hoare triple {12155#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {12155#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:54:13,069 INFO L290 TraceCheckUtils]: 67: Hoare triple {12155#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {12155#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:54:13,069 INFO L272 TraceCheckUtils]: 68: Hoare triple {12155#(= 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)); {12174#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:54:13,070 INFO L290 TraceCheckUtils]: 69: Hoare triple {12174#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12178#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:54:13,070 INFO L290 TraceCheckUtils]: 70: Hoare triple {12178#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11962#false} is VALID [2022-04-28 05:54:13,070 INFO L290 TraceCheckUtils]: 71: Hoare triple {11962#false} assume !false; {11962#false} is VALID [2022-04-28 05:54:13,071 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-04-28 05:54:13,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:54:30,061 INFO L290 TraceCheckUtils]: 71: Hoare triple {11962#false} assume !false; {11962#false} is VALID [2022-04-28 05:54:30,062 INFO L290 TraceCheckUtils]: 70: Hoare triple {12178#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11962#false} is VALID [2022-04-28 05:54:30,062 INFO L290 TraceCheckUtils]: 69: Hoare triple {12174#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12178#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:54:30,063 INFO L272 TraceCheckUtils]: 68: Hoare triple {12155#(= 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)); {12174#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:54:30,063 INFO L290 TraceCheckUtils]: 67: Hoare triple {12155#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {12155#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:54:30,063 INFO L290 TraceCheckUtils]: 66: Hoare triple {12155#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {12155#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:54:30,064 INFO L290 TraceCheckUtils]: 65: Hoare triple {12155#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {12155#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:54:30,064 INFO L290 TraceCheckUtils]: 64: Hoare triple {12155#(= 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; {12155#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:54:30,064 INFO L290 TraceCheckUtils]: 63: Hoare triple {12155#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {12155#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:54:30,065 INFO L290 TraceCheckUtils]: 62: Hoare triple {12109#(= 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; {12155#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:54:30,065 INFO L290 TraceCheckUtils]: 61: Hoare triple {12109#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= ~b~0); {12109#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:54:30,066 INFO L290 TraceCheckUtils]: 60: Hoare triple {12109#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {12109#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:54:30,066 INFO L290 TraceCheckUtils]: 59: Hoare triple {12109#(= main_~b~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; {12109#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:54:30,066 INFO L290 TraceCheckUtils]: 58: Hoare triple {12109#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= 2 * ~v~0); {12109#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:54:30,067 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {11961#true} {12109#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #108#return; {12109#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:54:30,067 INFO L290 TraceCheckUtils]: 56: Hoare triple {11961#true} assume true; {11961#true} is VALID [2022-04-28 05:54:30,067 INFO L290 TraceCheckUtils]: 55: Hoare triple {11961#true} assume !(0 == ~cond); {11961#true} is VALID [2022-04-28 05:54:30,067 INFO L290 TraceCheckUtils]: 54: Hoare triple {11961#true} ~cond := #in~cond; {11961#true} is VALID [2022-04-28 05:54:30,067 INFO L272 TraceCheckUtils]: 53: Hoare triple {12109#(= main_~b~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)); {11961#true} is VALID [2022-04-28 05:54:30,068 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {11961#true} {12109#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #106#return; {12109#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:54:30,068 INFO L290 TraceCheckUtils]: 51: Hoare triple {11961#true} assume true; {11961#true} is VALID [2022-04-28 05:54:30,068 INFO L290 TraceCheckUtils]: 50: Hoare triple {11961#true} assume !(0 == ~cond); {11961#true} is VALID [2022-04-28 05:54:30,068 INFO L290 TraceCheckUtils]: 49: Hoare triple {11961#true} ~cond := #in~cond; {11961#true} is VALID [2022-04-28 05:54:30,068 INFO L272 TraceCheckUtils]: 48: Hoare triple {12109#(= main_~b~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)); {11961#true} is VALID [2022-04-28 05:54:30,069 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {12102#(not (= |__VERIFIER_assert_#in~cond| 0))} {11961#true} #104#return; {12109#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:54:30,069 INFO L290 TraceCheckUtils]: 46: Hoare triple {12102#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {12102#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:54:30,069 INFO L290 TraceCheckUtils]: 45: Hoare triple {12266#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {12102#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:54:30,069 INFO L290 TraceCheckUtils]: 44: Hoare triple {11961#true} ~cond := #in~cond; {12266#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 05:54:30,069 INFO L272 TraceCheckUtils]: 43: Hoare triple {11961#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11961#true} is VALID [2022-04-28 05:54:30,070 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {11961#true} {11961#true} #102#return; {11961#true} is VALID [2022-04-28 05:54:30,070 INFO L290 TraceCheckUtils]: 41: Hoare triple {11961#true} assume true; {11961#true} is VALID [2022-04-28 05:54:30,070 INFO L290 TraceCheckUtils]: 40: Hoare triple {11961#true} assume !(0 == ~cond); {11961#true} is VALID [2022-04-28 05:54:30,070 INFO L290 TraceCheckUtils]: 39: Hoare triple {11961#true} ~cond := #in~cond; {11961#true} is VALID [2022-04-28 05:54:30,070 INFO L272 TraceCheckUtils]: 38: Hoare triple {11961#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11961#true} is VALID [2022-04-28 05:54:30,070 INFO L290 TraceCheckUtils]: 37: Hoare triple {11961#true} assume !false; {11961#true} is VALID [2022-04-28 05:54:30,070 INFO L290 TraceCheckUtils]: 36: Hoare triple {11961#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {11961#true} is VALID [2022-04-28 05:54:30,070 INFO L290 TraceCheckUtils]: 35: Hoare triple {11961#true} assume !false; {11961#true} is VALID [2022-04-28 05:54:30,070 INFO L290 TraceCheckUtils]: 34: Hoare triple {11961#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {11961#true} is VALID [2022-04-28 05:54:30,070 INFO L290 TraceCheckUtils]: 33: Hoare triple {11961#true} assume !false; {11961#true} is VALID [2022-04-28 05:54:30,070 INFO L290 TraceCheckUtils]: 32: Hoare triple {11961#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; {11961#true} is VALID [2022-04-28 05:54:30,070 INFO L290 TraceCheckUtils]: 31: Hoare triple {11961#true} assume !(~c~0 >= ~b~0); {11961#true} is VALID [2022-04-28 05:54:30,070 INFO L290 TraceCheckUtils]: 30: Hoare triple {11961#true} assume !false; {11961#true} is VALID [2022-04-28 05:54:30,070 INFO L290 TraceCheckUtils]: 29: Hoare triple {11961#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {11961#true} is VALID [2022-04-28 05:54:30,070 INFO L290 TraceCheckUtils]: 28: Hoare triple {11961#true} assume !false; {11961#true} is VALID [2022-04-28 05:54:30,070 INFO L290 TraceCheckUtils]: 27: Hoare triple {11961#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {11961#true} is VALID [2022-04-28 05:54:30,070 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {11961#true} {11961#true} #100#return; {11961#true} is VALID [2022-04-28 05:54:30,070 INFO L290 TraceCheckUtils]: 25: Hoare triple {11961#true} assume true; {11961#true} is VALID [2022-04-28 05:54:30,070 INFO L290 TraceCheckUtils]: 24: Hoare triple {11961#true} assume !(0 == ~cond); {11961#true} is VALID [2022-04-28 05:54:30,071 INFO L290 TraceCheckUtils]: 23: Hoare triple {11961#true} ~cond := #in~cond; {11961#true} is VALID [2022-04-28 05:54:30,071 INFO L272 TraceCheckUtils]: 22: Hoare triple {11961#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11961#true} is VALID [2022-04-28 05:54:30,071 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {11961#true} {11961#true} #98#return; {11961#true} is VALID [2022-04-28 05:54:30,071 INFO L290 TraceCheckUtils]: 20: Hoare triple {11961#true} assume true; {11961#true} is VALID [2022-04-28 05:54:30,071 INFO L290 TraceCheckUtils]: 19: Hoare triple {11961#true} assume !(0 == ~cond); {11961#true} is VALID [2022-04-28 05:54:30,071 INFO L290 TraceCheckUtils]: 18: Hoare triple {11961#true} ~cond := #in~cond; {11961#true} is VALID [2022-04-28 05:54:30,071 INFO L272 TraceCheckUtils]: 17: Hoare triple {11961#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {11961#true} is VALID [2022-04-28 05:54:30,071 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11961#true} {11961#true} #96#return; {11961#true} is VALID [2022-04-28 05:54:30,071 INFO L290 TraceCheckUtils]: 15: Hoare triple {11961#true} assume true; {11961#true} is VALID [2022-04-28 05:54:30,071 INFO L290 TraceCheckUtils]: 14: Hoare triple {11961#true} assume !(0 == ~cond); {11961#true} is VALID [2022-04-28 05:54:30,071 INFO L290 TraceCheckUtils]: 13: Hoare triple {11961#true} ~cond := #in~cond; {11961#true} is VALID [2022-04-28 05:54:30,071 INFO L272 TraceCheckUtils]: 12: Hoare triple {11961#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {11961#true} is VALID [2022-04-28 05:54:30,071 INFO L290 TraceCheckUtils]: 11: Hoare triple {11961#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {11961#true} is VALID [2022-04-28 05:54:30,071 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11961#true} {11961#true} #94#return; {11961#true} is VALID [2022-04-28 05:54:30,071 INFO L290 TraceCheckUtils]: 9: Hoare triple {11961#true} assume true; {11961#true} is VALID [2022-04-28 05:54:30,071 INFO L290 TraceCheckUtils]: 8: Hoare triple {11961#true} assume !(0 == ~cond); {11961#true} is VALID [2022-04-28 05:54:30,071 INFO L290 TraceCheckUtils]: 7: Hoare triple {11961#true} ~cond := #in~cond; {11961#true} is VALID [2022-04-28 05:54:30,071 INFO L272 TraceCheckUtils]: 6: Hoare triple {11961#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {11961#true} is VALID [2022-04-28 05:54:30,072 INFO L290 TraceCheckUtils]: 5: Hoare triple {11961#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; {11961#true} is VALID [2022-04-28 05:54:30,072 INFO L272 TraceCheckUtils]: 4: Hoare triple {11961#true} call #t~ret6 := main(); {11961#true} is VALID [2022-04-28 05:54:30,072 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11961#true} {11961#true} #112#return; {11961#true} is VALID [2022-04-28 05:54:30,072 INFO L290 TraceCheckUtils]: 2: Hoare triple {11961#true} assume true; {11961#true} is VALID [2022-04-28 05:54:30,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {11961#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); {11961#true} is VALID [2022-04-28 05:54:30,072 INFO L272 TraceCheckUtils]: 0: Hoare triple {11961#true} call ULTIMATE.init(); {11961#true} is VALID [2022-04-28 05:54:30,072 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-04-28 05:54:30,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:54:30,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142963829] [2022-04-28 05:54:30,072 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:54:30,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024509697] [2022-04-28 05:54:30,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1024509697] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:54:30,072 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:54:30,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-28 05:54:30,073 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:54:30,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [897474388] [2022-04-28 05:54:30,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [897474388] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:54:30,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:54:30,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 05:54:30,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253865156] [2022-04-28 05:54:30,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:54:30,073 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 72 [2022-04-28 05:54:30,073 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:54:30,073 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-28 05:54:30,110 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:54:30,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 05:54:30,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:54:30,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 05:54:30,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-28 05:54:30,111 INFO L87 Difference]: Start difference. First operand 212 states and 299 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-28 05:54:31,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:54:31,165 INFO L93 Difference]: Finished difference Result 226 states and 310 transitions. [2022-04-28 05:54:31,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 05:54:31,165 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 72 [2022-04-28 05:54:31,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:54:31,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-28 05:54:31,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2022-04-28 05:54:31,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-28 05:54:31,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2022-04-28 05:54:31,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 58 transitions. [2022-04-28 05:54:31,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:54:31,228 INFO L225 Difference]: With dead ends: 226 [2022-04-28 05:54:31,228 INFO L226 Difference]: Without dead ends: 224 [2022-04-28 05:54:31,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 136 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-28 05:54:31,229 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 21 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 05:54:31,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 173 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 05:54:31,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-04-28 05:54:31,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2022-04-28 05:54:31,724 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:54:31,725 INFO L82 GeneralOperation]: Start isEquivalent. First operand 224 states. Second operand has 224 states, 128 states have (on average 1.1875) internal successors, (152), 134 states have internal predecessors, (152), 79 states have call successors, (79), 17 states have call predecessors, (79), 16 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-28 05:54:31,725 INFO L74 IsIncluded]: Start isIncluded. First operand 224 states. Second operand has 224 states, 128 states have (on average 1.1875) internal successors, (152), 134 states have internal predecessors, (152), 79 states have call successors, (79), 17 states have call predecessors, (79), 16 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-28 05:54:31,726 INFO L87 Difference]: Start difference. First operand 224 states. Second operand has 224 states, 128 states have (on average 1.1875) internal successors, (152), 134 states have internal predecessors, (152), 79 states have call successors, (79), 17 states have call predecessors, (79), 16 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-28 05:54:31,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:54:31,732 INFO L93 Difference]: Finished difference Result 224 states and 308 transitions. [2022-04-28 05:54:31,732 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 308 transitions. [2022-04-28 05:54:31,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:54:31,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:54:31,734 INFO L74 IsIncluded]: Start isIncluded. First operand has 224 states, 128 states have (on average 1.1875) internal successors, (152), 134 states have internal predecessors, (152), 79 states have call successors, (79), 17 states have call predecessors, (79), 16 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) Second operand 224 states. [2022-04-28 05:54:31,734 INFO L87 Difference]: Start difference. First operand has 224 states, 128 states have (on average 1.1875) internal successors, (152), 134 states have internal predecessors, (152), 79 states have call successors, (79), 17 states have call predecessors, (79), 16 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) Second operand 224 states. [2022-04-28 05:54:31,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:54:31,741 INFO L93 Difference]: Finished difference Result 224 states and 308 transitions. [2022-04-28 05:54:31,741 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 308 transitions. [2022-04-28 05:54:31,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:54:31,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:54:31,742 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:54:31,742 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:54:31,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 128 states have (on average 1.1875) internal successors, (152), 134 states have internal predecessors, (152), 79 states have call successors, (79), 17 states have call predecessors, (79), 16 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2022-04-28 05:54:31,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 308 transitions. [2022-04-28 05:54:31,749 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 308 transitions. Word has length 72 [2022-04-28 05:54:31,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:54:31,750 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 308 transitions. [2022-04-28 05:54:31,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-28 05:54:31,750 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 224 states and 308 transitions. [2022-04-28 05:54:32,306 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 308 edges. 308 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:54:32,306 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 308 transitions. [2022-04-28 05:54:32,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-28 05:54:32,307 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:54:32,307 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 4, 4, 4, 3, 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] [2022-04-28 05:54:32,330 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 05:54:32,508 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 05:54:32,508 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:54:32,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:54:32,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1984914564, now seen corresponding path program 3 times [2022-04-28 05:54:32,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:54:32,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1757522255] [2022-04-28 05:54:32,509 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:54:32,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1984914564, now seen corresponding path program 4 times [2022-04-28 05:54:32,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:54:32,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211659304] [2022-04-28 05:54:32,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:54:32,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:54:32,521 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:54:32,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [404607570] [2022-04-28 05:54:32,521 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:54:32,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:54:32,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:54:32,522 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 05:54:32,530 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 05:54:32,569 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:54:32,569 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:54:32,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 05:54:32,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:54:32,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:54:32,769 INFO L272 TraceCheckUtils]: 0: Hoare triple {13756#true} call ULTIMATE.init(); {13756#true} is VALID [2022-04-28 05:54:32,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {13756#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); {13756#true} is VALID [2022-04-28 05:54:32,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {13756#true} assume true; {13756#true} is VALID [2022-04-28 05:54:32,770 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13756#true} {13756#true} #112#return; {13756#true} is VALID [2022-04-28 05:54:32,770 INFO L272 TraceCheckUtils]: 4: Hoare triple {13756#true} call #t~ret6 := main(); {13756#true} is VALID [2022-04-28 05:54:32,770 INFO L290 TraceCheckUtils]: 5: Hoare triple {13756#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; {13756#true} is VALID [2022-04-28 05:54:32,770 INFO L272 TraceCheckUtils]: 6: Hoare triple {13756#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {13756#true} is VALID [2022-04-28 05:54:32,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {13756#true} ~cond := #in~cond; {13756#true} is VALID [2022-04-28 05:54:32,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {13756#true} assume !(0 == ~cond); {13756#true} is VALID [2022-04-28 05:54:32,770 INFO L290 TraceCheckUtils]: 9: Hoare triple {13756#true} assume true; {13756#true} is VALID [2022-04-28 05:54:32,770 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13756#true} {13756#true} #94#return; {13756#true} is VALID [2022-04-28 05:54:32,771 INFO L290 TraceCheckUtils]: 11: Hoare triple {13756#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {13756#true} is VALID [2022-04-28 05:54:32,771 INFO L272 TraceCheckUtils]: 12: Hoare triple {13756#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {13756#true} is VALID [2022-04-28 05:54:32,771 INFO L290 TraceCheckUtils]: 13: Hoare triple {13756#true} ~cond := #in~cond; {13756#true} is VALID [2022-04-28 05:54:32,771 INFO L290 TraceCheckUtils]: 14: Hoare triple {13756#true} assume !(0 == ~cond); {13756#true} is VALID [2022-04-28 05:54:32,771 INFO L290 TraceCheckUtils]: 15: Hoare triple {13756#true} assume true; {13756#true} is VALID [2022-04-28 05:54:32,771 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13756#true} {13756#true} #96#return; {13756#true} is VALID [2022-04-28 05:54:32,771 INFO L272 TraceCheckUtils]: 17: Hoare triple {13756#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {13756#true} is VALID [2022-04-28 05:54:32,771 INFO L290 TraceCheckUtils]: 18: Hoare triple {13756#true} ~cond := #in~cond; {13756#true} is VALID [2022-04-28 05:54:32,771 INFO L290 TraceCheckUtils]: 19: Hoare triple {13756#true} assume !(0 == ~cond); {13756#true} is VALID [2022-04-28 05:54:32,771 INFO L290 TraceCheckUtils]: 20: Hoare triple {13756#true} assume true; {13756#true} is VALID [2022-04-28 05:54:32,771 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {13756#true} {13756#true} #98#return; {13756#true} is VALID [2022-04-28 05:54:32,771 INFO L272 TraceCheckUtils]: 22: Hoare triple {13756#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {13756#true} is VALID [2022-04-28 05:54:32,771 INFO L290 TraceCheckUtils]: 23: Hoare triple {13756#true} ~cond := #in~cond; {13756#true} is VALID [2022-04-28 05:54:32,772 INFO L290 TraceCheckUtils]: 24: Hoare triple {13756#true} assume !(0 == ~cond); {13756#true} is VALID [2022-04-28 05:54:32,772 INFO L290 TraceCheckUtils]: 25: Hoare triple {13756#true} assume true; {13756#true} is VALID [2022-04-28 05:54:32,772 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {13756#true} {13756#true} #100#return; {13756#true} is VALID [2022-04-28 05:54:32,772 INFO L290 TraceCheckUtils]: 27: Hoare triple {13756#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {13756#true} is VALID [2022-04-28 05:54:32,772 INFO L290 TraceCheckUtils]: 28: Hoare triple {13756#true} assume !false; {13756#true} is VALID [2022-04-28 05:54:32,772 INFO L290 TraceCheckUtils]: 29: Hoare triple {13756#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {13756#true} is VALID [2022-04-28 05:54:32,772 INFO L290 TraceCheckUtils]: 30: Hoare triple {13756#true} assume !false; {13756#true} is VALID [2022-04-28 05:54:32,772 INFO L290 TraceCheckUtils]: 31: Hoare triple {13756#true} assume !(~c~0 >= ~b~0); {13756#true} is VALID [2022-04-28 05:54:32,772 INFO L290 TraceCheckUtils]: 32: Hoare triple {13756#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; {13756#true} is VALID [2022-04-28 05:54:32,772 INFO L290 TraceCheckUtils]: 33: Hoare triple {13756#true} assume !false; {13756#true} is VALID [2022-04-28 05:54:32,772 INFO L290 TraceCheckUtils]: 34: Hoare triple {13756#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {13756#true} is VALID [2022-04-28 05:54:32,772 INFO L290 TraceCheckUtils]: 35: Hoare triple {13756#true} assume !false; {13756#true} is VALID [2022-04-28 05:54:32,773 INFO L290 TraceCheckUtils]: 36: Hoare triple {13756#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {13869#(<= main_~v~0 main_~b~0)} is VALID [2022-04-28 05:54:32,773 INFO L290 TraceCheckUtils]: 37: Hoare triple {13869#(<= main_~v~0 main_~b~0)} assume !false; {13869#(<= main_~v~0 main_~b~0)} is VALID [2022-04-28 05:54:32,773 INFO L272 TraceCheckUtils]: 38: Hoare triple {13869#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {13756#true} is VALID [2022-04-28 05:54:32,773 INFO L290 TraceCheckUtils]: 39: Hoare triple {13756#true} ~cond := #in~cond; {13756#true} is VALID [2022-04-28 05:54:32,773 INFO L290 TraceCheckUtils]: 40: Hoare triple {13756#true} assume !(0 == ~cond); {13756#true} is VALID [2022-04-28 05:54:32,774 INFO L290 TraceCheckUtils]: 41: Hoare triple {13756#true} assume true; {13756#true} is VALID [2022-04-28 05:54:32,774 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {13756#true} {13869#(<= main_~v~0 main_~b~0)} #102#return; {13869#(<= main_~v~0 main_~b~0)} is VALID [2022-04-28 05:54:32,774 INFO L272 TraceCheckUtils]: 43: Hoare triple {13869#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {13756#true} is VALID [2022-04-28 05:54:32,774 INFO L290 TraceCheckUtils]: 44: Hoare triple {13756#true} ~cond := #in~cond; {13756#true} is VALID [2022-04-28 05:54:32,774 INFO L290 TraceCheckUtils]: 45: Hoare triple {13756#true} assume !(0 == ~cond); {13756#true} is VALID [2022-04-28 05:54:32,775 INFO L290 TraceCheckUtils]: 46: Hoare triple {13756#true} assume true; {13756#true} is VALID [2022-04-28 05:54:32,775 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {13756#true} {13869#(<= main_~v~0 main_~b~0)} #104#return; {13869#(<= main_~v~0 main_~b~0)} is VALID [2022-04-28 05:54:32,775 INFO L272 TraceCheckUtils]: 48: Hoare triple {13869#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {13756#true} is VALID [2022-04-28 05:54:32,776 INFO L290 TraceCheckUtils]: 49: Hoare triple {13756#true} ~cond := #in~cond; {13756#true} is VALID [2022-04-28 05:54:32,776 INFO L290 TraceCheckUtils]: 50: Hoare triple {13756#true} assume !(0 == ~cond); {13756#true} is VALID [2022-04-28 05:54:32,776 INFO L290 TraceCheckUtils]: 51: Hoare triple {13756#true} assume true; {13756#true} is VALID [2022-04-28 05:54:32,776 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {13756#true} {13869#(<= main_~v~0 main_~b~0)} #106#return; {13869#(<= main_~v~0 main_~b~0)} is VALID [2022-04-28 05:54:32,776 INFO L272 TraceCheckUtils]: 53: Hoare triple {13869#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {13756#true} is VALID [2022-04-28 05:54:32,777 INFO L290 TraceCheckUtils]: 54: Hoare triple {13756#true} ~cond := #in~cond; {13756#true} is VALID [2022-04-28 05:54:32,777 INFO L290 TraceCheckUtils]: 55: Hoare triple {13756#true} assume !(0 == ~cond); {13756#true} is VALID [2022-04-28 05:54:32,777 INFO L290 TraceCheckUtils]: 56: Hoare triple {13756#true} assume true; {13756#true} is VALID [2022-04-28 05:54:32,777 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {13756#true} {13869#(<= main_~v~0 main_~b~0)} #108#return; {13869#(<= main_~v~0 main_~b~0)} is VALID [2022-04-28 05:54:32,778 INFO L290 TraceCheckUtils]: 58: Hoare triple {13869#(<= main_~v~0 main_~b~0)} assume !(~c~0 >= 2 * ~v~0); {13936#(and (<= main_~v~0 main_~b~0) (not (<= (* main_~v~0 2) main_~c~0)))} is VALID [2022-04-28 05:54:32,779 INFO L290 TraceCheckUtils]: 59: Hoare triple {13936#(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; {13940#(< main_~c~0 main_~b~0)} is VALID [2022-04-28 05:54:32,779 INFO L290 TraceCheckUtils]: 60: Hoare triple {13940#(< main_~c~0 main_~b~0)} assume !false; {13940#(< main_~c~0 main_~b~0)} is VALID [2022-04-28 05:54:32,779 INFO L290 TraceCheckUtils]: 61: Hoare triple {13940#(< main_~c~0 main_~b~0)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {13757#false} is VALID [2022-04-28 05:54:32,779 INFO L290 TraceCheckUtils]: 62: Hoare triple {13757#false} assume !false; {13757#false} is VALID [2022-04-28 05:54:32,780 INFO L272 TraceCheckUtils]: 63: Hoare triple {13757#false} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {13757#false} is VALID [2022-04-28 05:54:32,780 INFO L290 TraceCheckUtils]: 64: Hoare triple {13757#false} ~cond := #in~cond; {13757#false} is VALID [2022-04-28 05:54:32,780 INFO L290 TraceCheckUtils]: 65: Hoare triple {13757#false} assume !(0 == ~cond); {13757#false} is VALID [2022-04-28 05:54:32,780 INFO L290 TraceCheckUtils]: 66: Hoare triple {13757#false} assume true; {13757#false} is VALID [2022-04-28 05:54:32,780 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {13757#false} {13757#false} #102#return; {13757#false} is VALID [2022-04-28 05:54:32,780 INFO L272 TraceCheckUtils]: 68: Hoare triple {13757#false} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {13757#false} is VALID [2022-04-28 05:54:32,780 INFO L290 TraceCheckUtils]: 69: Hoare triple {13757#false} ~cond := #in~cond; {13757#false} is VALID [2022-04-28 05:54:32,780 INFO L290 TraceCheckUtils]: 70: Hoare triple {13757#false} assume !(0 == ~cond); {13757#false} is VALID [2022-04-28 05:54:32,780 INFO L290 TraceCheckUtils]: 71: Hoare triple {13757#false} assume true; {13757#false} is VALID [2022-04-28 05:54:32,780 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {13757#false} {13757#false} #104#return; {13757#false} is VALID [2022-04-28 05:54:32,780 INFO L272 TraceCheckUtils]: 73: Hoare triple {13757#false} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {13757#false} is VALID [2022-04-28 05:54:32,780 INFO L290 TraceCheckUtils]: 74: Hoare triple {13757#false} ~cond := #in~cond; {13757#false} is VALID [2022-04-28 05:54:32,781 INFO L290 TraceCheckUtils]: 75: Hoare triple {13757#false} assume 0 == ~cond; {13757#false} is VALID [2022-04-28 05:54:32,781 INFO L290 TraceCheckUtils]: 76: Hoare triple {13757#false} assume !false; {13757#false} is VALID [2022-04-28 05:54:32,781 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 05:54:32,781 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:54:32,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:54:32,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211659304] [2022-04-28 05:54:32,781 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:54:32,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404607570] [2022-04-28 05:54:32,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404607570] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:54:32,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:54:32,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:54:32,782 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:54:32,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1757522255] [2022-04-28 05:54:32,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1757522255] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:54:32,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:54:32,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:54:32,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4912956] [2022-04-28 05:54:32,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:54:32,783 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 77 [2022-04-28 05:54:32,783 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:54:32,783 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-28 05:54:32,831 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:54:32,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 05:54:32,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:54:32,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 05:54:32,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 05:54:32,832 INFO L87 Difference]: Start difference. First operand 224 states and 308 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-28 05:54:33,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:54:33,674 INFO L93 Difference]: Finished difference Result 367 states and 500 transitions. [2022-04-28 05:54:33,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 05:54:33,674 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 77 [2022-04-28 05:54:33,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:54:33,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-28 05:54:33,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2022-04-28 05:54:33,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-28 05:54:33,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2022-04-28 05:54:33,678 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 85 transitions. [2022-04-28 05:54:33,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:54:33,755 INFO L225 Difference]: With dead ends: 367 [2022-04-28 05:54:33,755 INFO L226 Difference]: Without dead ends: 230 [2022-04-28 05:54:33,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-28 05:54:33,759 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 3 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:54:33,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 139 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:54:33,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-04-28 05:54:34,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 214. [2022-04-28 05:54:34,273 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:54:34,275 INFO L82 GeneralOperation]: Start isEquivalent. First operand 230 states. Second operand has 214 states, 126 states have (on average 1.1825396825396826) internal successors, (149), 127 states have internal predecessors, (149), 71 states have call successors, (71), 17 states have call predecessors, (71), 16 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2022-04-28 05:54:34,276 INFO L74 IsIncluded]: Start isIncluded. First operand 230 states. Second operand has 214 states, 126 states have (on average 1.1825396825396826) internal successors, (149), 127 states have internal predecessors, (149), 71 states have call successors, (71), 17 states have call predecessors, (71), 16 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2022-04-28 05:54:34,276 INFO L87 Difference]: Start difference. First operand 230 states. Second operand has 214 states, 126 states have (on average 1.1825396825396826) internal successors, (149), 127 states have internal predecessors, (149), 71 states have call successors, (71), 17 states have call predecessors, (71), 16 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2022-04-28 05:54:34,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:54:34,289 INFO L93 Difference]: Finished difference Result 230 states and 305 transitions. [2022-04-28 05:54:34,289 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 305 transitions. [2022-04-28 05:54:34,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:54:34,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:54:34,290 INFO L74 IsIncluded]: Start isIncluded. First operand has 214 states, 126 states have (on average 1.1825396825396826) internal successors, (149), 127 states have internal predecessors, (149), 71 states have call successors, (71), 17 states have call predecessors, (71), 16 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) Second operand 230 states. [2022-04-28 05:54:34,291 INFO L87 Difference]: Start difference. First operand has 214 states, 126 states have (on average 1.1825396825396826) internal successors, (149), 127 states have internal predecessors, (149), 71 states have call successors, (71), 17 states have call predecessors, (71), 16 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) Second operand 230 states. [2022-04-28 05:54:34,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:54:34,297 INFO L93 Difference]: Finished difference Result 230 states and 305 transitions. [2022-04-28 05:54:34,297 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 305 transitions. [2022-04-28 05:54:34,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:54:34,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:54:34,298 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:54:34,298 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:54:34,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 126 states have (on average 1.1825396825396826) internal successors, (149), 127 states have internal predecessors, (149), 71 states have call successors, (71), 17 states have call predecessors, (71), 16 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2022-04-28 05:54:34,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 289 transitions. [2022-04-28 05:54:34,305 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 289 transitions. Word has length 77 [2022-04-28 05:54:34,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:54:34,305 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 289 transitions. [2022-04-28 05:54:34,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-28 05:54:34,309 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 214 states and 289 transitions. [2022-04-28 05:54:34,895 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 289 edges. 289 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:54:34,896 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 289 transitions. [2022-04-28 05:54:34,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-28 05:54:34,896 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:54:34,896 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 4, 3, 3, 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] [2022-04-28 05:54:34,912 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 05:54:35,097 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 05:54:35,097 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:54:35,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:54:35,097 INFO L85 PathProgramCache]: Analyzing trace with hash -867272991, now seen corresponding path program 5 times [2022-04-28 05:54:35,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:54:35,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1611800913] [2022-04-28 05:54:35,098 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:54:35,098 INFO L85 PathProgramCache]: Analyzing trace with hash -867272991, now seen corresponding path program 6 times [2022-04-28 05:54:35,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:54:35,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265925765] [2022-04-28 05:54:35,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:54:35,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:54:35,114 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:54:35,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1449175159] [2022-04-28 05:54:35,115 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 05:54:35,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:54:35,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:54:35,119 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 05:54:35,121 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 05:54:35,174 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 05:54:35,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:54:35,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 65 conjunts are in the unsatisfiable core [2022-04-28 05:54:35,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:54:35,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:54:36,306 INFO L272 TraceCheckUtils]: 0: Hoare triple {15616#true} call ULTIMATE.init(); {15616#true} is VALID [2022-04-28 05:54:36,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {15616#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); {15616#true} is VALID [2022-04-28 05:54:36,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {15616#true} assume true; {15616#true} is VALID [2022-04-28 05:54:36,307 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15616#true} {15616#true} #112#return; {15616#true} is VALID [2022-04-28 05:54:36,307 INFO L272 TraceCheckUtils]: 4: Hoare triple {15616#true} call #t~ret6 := main(); {15616#true} is VALID [2022-04-28 05:54:36,307 INFO L290 TraceCheckUtils]: 5: Hoare triple {15616#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; {15616#true} is VALID [2022-04-28 05:54:36,307 INFO L272 TraceCheckUtils]: 6: Hoare triple {15616#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {15616#true} is VALID [2022-04-28 05:54:36,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {15616#true} ~cond := #in~cond; {15616#true} is VALID [2022-04-28 05:54:36,307 INFO L290 TraceCheckUtils]: 8: Hoare triple {15616#true} assume !(0 == ~cond); {15616#true} is VALID [2022-04-28 05:54:36,307 INFO L290 TraceCheckUtils]: 9: Hoare triple {15616#true} assume true; {15616#true} is VALID [2022-04-28 05:54:36,307 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15616#true} {15616#true} #94#return; {15616#true} is VALID [2022-04-28 05:54:36,307 INFO L290 TraceCheckUtils]: 11: Hoare triple {15616#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {15616#true} is VALID [2022-04-28 05:54:36,307 INFO L272 TraceCheckUtils]: 12: Hoare triple {15616#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {15616#true} is VALID [2022-04-28 05:54:36,307 INFO L290 TraceCheckUtils]: 13: Hoare triple {15616#true} ~cond := #in~cond; {15616#true} is VALID [2022-04-28 05:54:36,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {15616#true} assume !(0 == ~cond); {15616#true} is VALID [2022-04-28 05:54:36,307 INFO L290 TraceCheckUtils]: 15: Hoare triple {15616#true} assume true; {15616#true} is VALID [2022-04-28 05:54:36,307 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {15616#true} {15616#true} #96#return; {15616#true} is VALID [2022-04-28 05:54:36,308 INFO L272 TraceCheckUtils]: 17: Hoare triple {15616#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {15616#true} is VALID [2022-04-28 05:54:36,308 INFO L290 TraceCheckUtils]: 18: Hoare triple {15616#true} ~cond := #in~cond; {15616#true} is VALID [2022-04-28 05:54:36,308 INFO L290 TraceCheckUtils]: 19: Hoare triple {15616#true} assume !(0 == ~cond); {15616#true} is VALID [2022-04-28 05:54:36,308 INFO L290 TraceCheckUtils]: 20: Hoare triple {15616#true} assume true; {15616#true} is VALID [2022-04-28 05:54:36,308 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {15616#true} {15616#true} #98#return; {15616#true} is VALID [2022-04-28 05:54:36,308 INFO L272 TraceCheckUtils]: 22: Hoare triple {15616#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {15616#true} is VALID [2022-04-28 05:54:36,308 INFO L290 TraceCheckUtils]: 23: Hoare triple {15616#true} ~cond := #in~cond; {15616#true} is VALID [2022-04-28 05:54:36,308 INFO L290 TraceCheckUtils]: 24: Hoare triple {15616#true} assume !(0 == ~cond); {15616#true} is VALID [2022-04-28 05:54:36,308 INFO L290 TraceCheckUtils]: 25: Hoare triple {15616#true} assume true; {15616#true} is VALID [2022-04-28 05:54:36,308 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {15616#true} {15616#true} #100#return; {15616#true} is VALID [2022-04-28 05:54:36,310 INFO L290 TraceCheckUtils]: 27: Hoare triple {15616#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {15702#(and (= main_~r~0 0) (<= 1 main_~p~0) (= 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 05:54:36,310 INFO L290 TraceCheckUtils]: 28: Hoare triple {15702#(and (= main_~r~0 0) (<= 1 main_~p~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !false; {15702#(and (= main_~r~0 0) (<= 1 main_~p~0) (= 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 05:54:36,311 INFO L290 TraceCheckUtils]: 29: Hoare triple {15702#(and (= main_~r~0 0) (<= 1 main_~p~0) (= 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; {15709#(and (= main_~r~0 0) (= main_~k~0 0) (<= 1 main_~p~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 05:54:36,311 INFO L290 TraceCheckUtils]: 30: Hoare triple {15709#(and (= main_~r~0 0) (= main_~k~0 0) (<= 1 main_~p~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} assume !false; {15709#(and (= main_~r~0 0) (= main_~k~0 0) (<= 1 main_~p~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 05:54:36,312 INFO L290 TraceCheckUtils]: 31: Hoare triple {15709#(and (= main_~r~0 0) (= main_~k~0 0) (<= 1 main_~p~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); {15709#(and (= main_~r~0 0) (= main_~k~0 0) (<= 1 main_~p~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 05:54:36,313 INFO L290 TraceCheckUtils]: 32: Hoare triple {15709#(and (= main_~r~0 0) (= main_~k~0 0) (<= 1 main_~p~0) (= 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; {15719#(and (= main_~s~0 0) (= main_~p~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 05:54:36,313 INFO L290 TraceCheckUtils]: 33: Hoare triple {15719#(and (= main_~s~0 0) (= main_~p~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !false; {15719#(and (= main_~s~0 0) (= main_~p~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 05:54:36,313 INFO L290 TraceCheckUtils]: 34: Hoare triple {15719#(and (= main_~s~0 0) (= main_~p~0 0) (<= 1 main_~q~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; {15726#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (<= 1 main_~q~0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 05:54:36,314 INFO L290 TraceCheckUtils]: 35: Hoare triple {15726#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (<= 1 main_~q~0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0))} assume !false; {15726#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (<= 1 main_~q~0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 05:54:36,314 INFO L290 TraceCheckUtils]: 36: Hoare triple {15726#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (<= 1 main_~q~0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {15733#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (<= 1 main_~q~0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1))} is VALID [2022-04-28 05:54:36,314 INFO L290 TraceCheckUtils]: 37: Hoare triple {15733#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (<= 1 main_~q~0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1))} assume !false; {15733#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (<= 1 main_~q~0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1))} is VALID [2022-04-28 05:54:36,315 INFO L272 TraceCheckUtils]: 38: Hoare triple {15733#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (<= 1 main_~q~0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {15616#true} is VALID [2022-04-28 05:54:36,315 INFO L290 TraceCheckUtils]: 39: Hoare triple {15616#true} ~cond := #in~cond; {15616#true} is VALID [2022-04-28 05:54:36,315 INFO L290 TraceCheckUtils]: 40: Hoare triple {15616#true} assume !(0 == ~cond); {15616#true} is VALID [2022-04-28 05:54:36,315 INFO L290 TraceCheckUtils]: 41: Hoare triple {15616#true} assume true; {15616#true} is VALID [2022-04-28 05:54:36,315 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {15616#true} {15733#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (<= 1 main_~q~0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1))} #102#return; {15733#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (<= 1 main_~q~0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1))} is VALID [2022-04-28 05:54:36,316 INFO L272 TraceCheckUtils]: 43: Hoare triple {15733#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (<= 1 main_~q~0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {15616#true} is VALID [2022-04-28 05:54:36,316 INFO L290 TraceCheckUtils]: 44: Hoare triple {15616#true} ~cond := #in~cond; {15758#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:54:36,316 INFO L290 TraceCheckUtils]: 45: Hoare triple {15758#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {15762#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:54:36,316 INFO L290 TraceCheckUtils]: 46: Hoare triple {15762#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15762#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:54:36,317 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {15762#(not (= |__VERIFIER_assert_#in~cond| 0))} {15733#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (<= 1 main_~q~0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1))} #104#return; {15769#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~k~0 0) (<= 1 main_~q~0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1))} is VALID [2022-04-28 05:54:36,317 INFO L272 TraceCheckUtils]: 48: Hoare triple {15769#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~k~0 0) (<= 1 main_~q~0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {15616#true} is VALID [2022-04-28 05:54:36,317 INFO L290 TraceCheckUtils]: 49: Hoare triple {15616#true} ~cond := #in~cond; {15616#true} is VALID [2022-04-28 05:54:36,317 INFO L290 TraceCheckUtils]: 50: Hoare triple {15616#true} assume !(0 == ~cond); {15616#true} is VALID [2022-04-28 05:54:36,318 INFO L290 TraceCheckUtils]: 51: Hoare triple {15616#true} assume true; {15616#true} is VALID [2022-04-28 05:54:36,318 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {15616#true} {15769#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~k~0 0) (<= 1 main_~q~0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1))} #106#return; {15769#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~k~0 0) (<= 1 main_~q~0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1))} is VALID [2022-04-28 05:54:36,318 INFO L272 TraceCheckUtils]: 53: Hoare triple {15769#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~k~0 0) (<= 1 main_~q~0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {15616#true} is VALID [2022-04-28 05:54:36,318 INFO L290 TraceCheckUtils]: 54: Hoare triple {15616#true} ~cond := #in~cond; {15616#true} is VALID [2022-04-28 05:54:36,318 INFO L290 TraceCheckUtils]: 55: Hoare triple {15616#true} assume !(0 == ~cond); {15616#true} is VALID [2022-04-28 05:54:36,318 INFO L290 TraceCheckUtils]: 56: Hoare triple {15616#true} assume true; {15616#true} is VALID [2022-04-28 05:54:36,323 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {15616#true} {15769#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~k~0 0) (<= 1 main_~q~0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1))} #108#return; {15769#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~k~0 0) (<= 1 main_~q~0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1))} is VALID [2022-04-28 05:54:36,324 INFO L290 TraceCheckUtils]: 58: Hoare triple {15769#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~k~0 0) (<= 1 main_~q~0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1))} assume !(~c~0 >= 2 * ~v~0); {15769#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~k~0 0) (<= 1 main_~q~0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1))} is VALID [2022-04-28 05:54:36,324 INFO L290 TraceCheckUtils]: 59: Hoare triple {15769#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~k~0 0) (<= 1 main_~q~0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {15806#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~y~0 (+ main_~c~0 main_~b~0)))} is VALID [2022-04-28 05:54:36,325 INFO L290 TraceCheckUtils]: 60: Hoare triple {15806#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~y~0 (+ main_~c~0 main_~b~0)))} assume !false; {15806#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~y~0 (+ main_~c~0 main_~b~0)))} is VALID [2022-04-28 05:54:36,325 INFO L290 TraceCheckUtils]: 61: Hoare triple {15806#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~y~0 (+ main_~c~0 main_~b~0)))} assume !(~c~0 >= ~b~0); {15806#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~y~0 (+ main_~c~0 main_~b~0)))} is VALID [2022-04-28 05:54:36,327 INFO L290 TraceCheckUtils]: 62: Hoare triple {15806#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= 1 main_~q~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~y~0 (+ 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; {15816#(and (= main_~s~0 1) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (<= (+ main_~q~0 1) 0) (= main_~a~0 (* main_~x~0 (* (- 1) main_~q~0))) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:54:36,327 INFO L290 TraceCheckUtils]: 63: Hoare triple {15816#(and (= main_~s~0 1) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (<= (+ main_~q~0 1) 0) (= main_~a~0 (* main_~x~0 (* (- 1) main_~q~0))) (= main_~a~0 main_~x~0))} assume !false; {15816#(and (= main_~s~0 1) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (<= (+ main_~q~0 1) 0) (= main_~a~0 (* main_~x~0 (* (- 1) main_~q~0))) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:54:36,328 INFO L290 TraceCheckUtils]: 64: Hoare triple {15816#(and (= main_~s~0 1) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (<= (+ main_~q~0 1) 0) (= main_~a~0 (* main_~x~0 (* (- 1) main_~q~0))) (= main_~a~0 main_~x~0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {15823#(and (= main_~s~0 1) (= main_~x~0 (* main_~x~0 (* (- 1) main_~q~0))) (<= (+ main_~q~0 1) 0) (= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))))))} is VALID [2022-04-28 05:54:36,328 INFO L290 TraceCheckUtils]: 65: Hoare triple {15823#(and (= main_~s~0 1) (= main_~x~0 (* main_~x~0 (* (- 1) main_~q~0))) (<= (+ main_~q~0 1) 0) (= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))))))} assume !false; {15823#(and (= main_~s~0 1) (= main_~x~0 (* main_~x~0 (* (- 1) main_~q~0))) (<= (+ main_~q~0 1) 0) (= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))))))} is VALID [2022-04-28 05:54:36,329 INFO L290 TraceCheckUtils]: 66: Hoare triple {15823#(and (= main_~s~0 1) (= main_~x~0 (* main_~x~0 (* (- 1) main_~q~0))) (<= (+ main_~q~0 1) 0) (= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))))))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {15823#(and (= main_~s~0 1) (= main_~x~0 (* main_~x~0 (* (- 1) main_~q~0))) (<= (+ main_~q~0 1) 0) (= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))))))} is VALID [2022-04-28 05:54:36,329 INFO L290 TraceCheckUtils]: 67: Hoare triple {15823#(and (= main_~s~0 1) (= main_~x~0 (* main_~x~0 (* (- 1) main_~q~0))) (<= (+ main_~q~0 1) 0) (= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))))))} assume !false; {15823#(and (= main_~s~0 1) (= main_~x~0 (* main_~x~0 (* (- 1) main_~q~0))) (<= (+ main_~q~0 1) 0) (= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))))))} is VALID [2022-04-28 05:54:36,329 INFO L272 TraceCheckUtils]: 68: Hoare triple {15823#(and (= main_~s~0 1) (= main_~x~0 (* main_~x~0 (* (- 1) main_~q~0))) (<= (+ main_~q~0 1) 0) (= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {15616#true} is VALID [2022-04-28 05:54:36,329 INFO L290 TraceCheckUtils]: 69: Hoare triple {15616#true} ~cond := #in~cond; {15616#true} is VALID [2022-04-28 05:54:36,329 INFO L290 TraceCheckUtils]: 70: Hoare triple {15616#true} assume !(0 == ~cond); {15616#true} is VALID [2022-04-28 05:54:36,329 INFO L290 TraceCheckUtils]: 71: Hoare triple {15616#true} assume true; {15616#true} is VALID [2022-04-28 05:54:36,330 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {15616#true} {15823#(and (= main_~s~0 1) (= main_~x~0 (* main_~x~0 (* (- 1) main_~q~0))) (<= (+ main_~q~0 1) 0) (= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))))))} #102#return; {15823#(and (= main_~s~0 1) (= main_~x~0 (* main_~x~0 (* (- 1) main_~q~0))) (<= (+ main_~q~0 1) 0) (= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))))))} is VALID [2022-04-28 05:54:36,330 INFO L272 TraceCheckUtils]: 73: Hoare triple {15823#(and (= main_~s~0 1) (= main_~x~0 (* main_~x~0 (* (- 1) main_~q~0))) (<= (+ main_~q~0 1) 0) (= main_~b~0 (+ main_~y~0 (* (- 1) (* main_~x~0 (* (- 1) main_~q~0))))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {15851#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:54:36,331 INFO L290 TraceCheckUtils]: 74: Hoare triple {15851#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15855#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:54:36,331 INFO L290 TraceCheckUtils]: 75: Hoare triple {15855#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15617#false} is VALID [2022-04-28 05:54:36,331 INFO L290 TraceCheckUtils]: 76: Hoare triple {15617#false} assume !false; {15617#false} is VALID [2022-04-28 05:54:36,331 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 12 proven. 32 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-28 05:54:36,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:55:03,945 INFO L290 TraceCheckUtils]: 76: Hoare triple {15617#false} assume !false; {15617#false} is VALID [2022-04-28 05:55:03,945 INFO L290 TraceCheckUtils]: 75: Hoare triple {15855#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15617#false} is VALID [2022-04-28 05:55:03,946 INFO L290 TraceCheckUtils]: 74: Hoare triple {15851#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15855#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:55:03,946 INFO L272 TraceCheckUtils]: 73: Hoare triple {15871#(= 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)); {15851#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:55:03,947 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {15616#true} {15871#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #102#return; {15871#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:55:03,947 INFO L290 TraceCheckUtils]: 71: Hoare triple {15616#true} assume true; {15616#true} is VALID [2022-04-28 05:55:03,947 INFO L290 TraceCheckUtils]: 70: Hoare triple {15616#true} assume !(0 == ~cond); {15616#true} is VALID [2022-04-28 05:55:03,947 INFO L290 TraceCheckUtils]: 69: Hoare triple {15616#true} ~cond := #in~cond; {15616#true} is VALID [2022-04-28 05:55:03,947 INFO L272 TraceCheckUtils]: 68: Hoare triple {15871#(= 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)); {15616#true} is VALID [2022-04-28 05:55:03,947 INFO L290 TraceCheckUtils]: 67: Hoare triple {15871#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {15871#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:55:03,948 INFO L290 TraceCheckUtils]: 66: Hoare triple {15871#(= 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; {15871#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:55:03,948 INFO L290 TraceCheckUtils]: 65: Hoare triple {15871#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {15871#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:55:03,948 INFO L290 TraceCheckUtils]: 64: Hoare triple {15871#(= 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; {15871#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:55:03,949 INFO L290 TraceCheckUtils]: 63: Hoare triple {15871#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {15871#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:55:05,950 WARN L290 TraceCheckUtils]: 62: Hoare triple {15905#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~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; {15871#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is UNKNOWN [2022-04-28 05:55:05,951 INFO L290 TraceCheckUtils]: 61: Hoare triple {15905#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} assume !(~c~0 >= ~b~0); {15905#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} is VALID [2022-04-28 05:55:05,951 INFO L290 TraceCheckUtils]: 60: Hoare triple {15905#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} assume !false; {15905#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} is VALID [2022-04-28 05:55:07,099 INFO L290 TraceCheckUtils]: 59: Hoare triple {15915#(= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {15905#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0)))} is VALID [2022-04-28 05:55:07,100 INFO L290 TraceCheckUtils]: 58: Hoare triple {15915#(= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !(~c~0 >= 2 * ~v~0); {15915#(= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:55:07,101 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {15616#true} {15915#(= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #108#return; {15915#(= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:55:07,101 INFO L290 TraceCheckUtils]: 56: Hoare triple {15616#true} assume true; {15616#true} is VALID [2022-04-28 05:55:07,101 INFO L290 TraceCheckUtils]: 55: Hoare triple {15616#true} assume !(0 == ~cond); {15616#true} is VALID [2022-04-28 05:55:07,101 INFO L290 TraceCheckUtils]: 54: Hoare triple {15616#true} ~cond := #in~cond; {15616#true} is VALID [2022-04-28 05:55:07,101 INFO L272 TraceCheckUtils]: 53: Hoare triple {15915#(= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {15616#true} is VALID [2022-04-28 05:55:07,102 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {15616#true} {15915#(= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #106#return; {15915#(= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:55:07,102 INFO L290 TraceCheckUtils]: 51: Hoare triple {15616#true} assume true; {15616#true} is VALID [2022-04-28 05:55:07,102 INFO L290 TraceCheckUtils]: 50: Hoare triple {15616#true} assume !(0 == ~cond); {15616#true} is VALID [2022-04-28 05:55:07,102 INFO L290 TraceCheckUtils]: 49: Hoare triple {15616#true} ~cond := #in~cond; {15616#true} is VALID [2022-04-28 05:55:07,102 INFO L272 TraceCheckUtils]: 48: Hoare triple {15915#(= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {15616#true} is VALID [2022-04-28 05:55:07,103 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {15762#(not (= |__VERIFIER_assert_#in~cond| 0))} {15952#(or (= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~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)))))} #104#return; {15915#(= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:55:07,103 INFO L290 TraceCheckUtils]: 46: Hoare triple {15762#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15762#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:55:07,104 INFO L290 TraceCheckUtils]: 45: Hoare triple {15962#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {15762#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:55:07,104 INFO L290 TraceCheckUtils]: 44: Hoare triple {15616#true} ~cond := #in~cond; {15962#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 05:55:07,104 INFO L272 TraceCheckUtils]: 43: Hoare triple {15952#(or (= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~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)))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {15616#true} is VALID [2022-04-28 05:55:07,105 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {15616#true} {15952#(or (= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~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)))))} #102#return; {15952#(or (= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~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)))))} is VALID [2022-04-28 05:55:07,105 INFO L290 TraceCheckUtils]: 41: Hoare triple {15616#true} assume true; {15616#true} is VALID [2022-04-28 05:55:07,105 INFO L290 TraceCheckUtils]: 40: Hoare triple {15616#true} assume !(0 == ~cond); {15616#true} is VALID [2022-04-28 05:55:07,105 INFO L290 TraceCheckUtils]: 39: Hoare triple {15616#true} ~cond := #in~cond; {15616#true} is VALID [2022-04-28 05:55:07,105 INFO L272 TraceCheckUtils]: 38: Hoare triple {15952#(or (= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~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)))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {15616#true} is VALID [2022-04-28 05:55:07,106 INFO L290 TraceCheckUtils]: 37: Hoare triple {15952#(or (= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~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)))))} assume !false; {15952#(or (= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~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)))))} is VALID [2022-04-28 05:55:07,106 INFO L290 TraceCheckUtils]: 36: Hoare triple {15987#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0) main_~c~0 (* (- 1) main_~b~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {15952#(or (= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~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)))))} is VALID [2022-04-28 05:55:07,107 INFO L290 TraceCheckUtils]: 35: Hoare triple {15987#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0) main_~c~0 (* (- 1) main_~b~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !false; {15987#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0) main_~c~0 (* (- 1) main_~b~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 05:55:07,107 INFO L290 TraceCheckUtils]: 34: Hoare triple {15994#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~a~0 (* (- 1) main_~b~0) (* main_~q~0 main_~x~0 1) (* main_~y~0 main_~s~0 1)) (+ (* 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; {15987#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0) main_~c~0 (* (- 1) main_~b~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 05:55:07,108 INFO L290 TraceCheckUtils]: 33: Hoare triple {15994#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~a~0 (* (- 1) main_~b~0) (* main_~q~0 main_~x~0 1) (* main_~y~0 main_~s~0 1)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !false; {15994#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~a~0 (* (- 1) main_~b~0) (* main_~q~0 main_~x~0 1) (* main_~y~0 main_~s~0 1)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 05:55:07,797 INFO L290 TraceCheckUtils]: 32: Hoare triple {16001#(or (not (= (+ (* (+ (* (* 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_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0 1) (* (- 1) main_~c~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0 1) 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; {15994#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~a~0 (* (- 1) main_~b~0) (* main_~q~0 main_~x~0 1) (* main_~y~0 main_~s~0 1)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 05:55:07,797 INFO L290 TraceCheckUtils]: 31: Hoare triple {16001#(or (not (= (+ (* (+ (* (* 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_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0 1) (* (- 1) main_~c~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0 1) main_~b~0) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= ~b~0); {16001#(or (not (= (+ (* (+ (* (* 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_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0 1) (* (- 1) main_~c~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0 1) main_~b~0) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 05:55:07,798 INFO L290 TraceCheckUtils]: 30: Hoare triple {16001#(or (not (= (+ (* (+ (* (* 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_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0 1) (* (- 1) main_~c~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0 1) main_~b~0) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !false; {16001#(or (not (= (+ (* (+ (* (* 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_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0 1) (* (- 1) main_~c~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0 1) main_~b~0) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 05:55:07,798 INFO L290 TraceCheckUtils]: 29: Hoare triple {16011#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* (- 1) main_~a~0) (* main_~y~0 main_~r~0 1) (* main_~p~0 main_~x~0 1) main_~b~0)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {16001#(or (not (= (+ (* (+ (* (* 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_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0 1) (* (- 1) main_~c~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0 1) main_~b~0) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 05:55:07,799 INFO L290 TraceCheckUtils]: 28: Hoare triple {16011#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* (- 1) main_~a~0) (* main_~y~0 main_~r~0 1) (* main_~p~0 main_~x~0 1) main_~b~0)))} assume !false; {16011#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* (- 1) main_~a~0) (* main_~y~0 main_~r~0 1) (* main_~p~0 main_~x~0 1) main_~b~0)))} is VALID [2022-04-28 05:55:07,799 INFO L290 TraceCheckUtils]: 27: Hoare triple {15616#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {16011#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* (- 1) main_~a~0) (* main_~y~0 main_~r~0 1) (* main_~p~0 main_~x~0 1) main_~b~0)))} is VALID [2022-04-28 05:55:07,799 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {15616#true} {15616#true} #100#return; {15616#true} is VALID [2022-04-28 05:55:07,799 INFO L290 TraceCheckUtils]: 25: Hoare triple {15616#true} assume true; {15616#true} is VALID [2022-04-28 05:55:07,799 INFO L290 TraceCheckUtils]: 24: Hoare triple {15616#true} assume !(0 == ~cond); {15616#true} is VALID [2022-04-28 05:55:07,800 INFO L290 TraceCheckUtils]: 23: Hoare triple {15616#true} ~cond := #in~cond; {15616#true} is VALID [2022-04-28 05:55:07,800 INFO L272 TraceCheckUtils]: 22: Hoare triple {15616#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {15616#true} is VALID [2022-04-28 05:55:07,800 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {15616#true} {15616#true} #98#return; {15616#true} is VALID [2022-04-28 05:55:07,800 INFO L290 TraceCheckUtils]: 20: Hoare triple {15616#true} assume true; {15616#true} is VALID [2022-04-28 05:55:07,800 INFO L290 TraceCheckUtils]: 19: Hoare triple {15616#true} assume !(0 == ~cond); {15616#true} is VALID [2022-04-28 05:55:07,800 INFO L290 TraceCheckUtils]: 18: Hoare triple {15616#true} ~cond := #in~cond; {15616#true} is VALID [2022-04-28 05:55:07,800 INFO L272 TraceCheckUtils]: 17: Hoare triple {15616#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {15616#true} is VALID [2022-04-28 05:55:07,800 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {15616#true} {15616#true} #96#return; {15616#true} is VALID [2022-04-28 05:55:07,800 INFO L290 TraceCheckUtils]: 15: Hoare triple {15616#true} assume true; {15616#true} is VALID [2022-04-28 05:55:07,800 INFO L290 TraceCheckUtils]: 14: Hoare triple {15616#true} assume !(0 == ~cond); {15616#true} is VALID [2022-04-28 05:55:07,800 INFO L290 TraceCheckUtils]: 13: Hoare triple {15616#true} ~cond := #in~cond; {15616#true} is VALID [2022-04-28 05:55:07,800 INFO L272 TraceCheckUtils]: 12: Hoare triple {15616#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {15616#true} is VALID [2022-04-28 05:55:07,800 INFO L290 TraceCheckUtils]: 11: Hoare triple {15616#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {15616#true} is VALID [2022-04-28 05:55:07,800 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15616#true} {15616#true} #94#return; {15616#true} is VALID [2022-04-28 05:55:07,800 INFO L290 TraceCheckUtils]: 9: Hoare triple {15616#true} assume true; {15616#true} is VALID [2022-04-28 05:55:07,800 INFO L290 TraceCheckUtils]: 8: Hoare triple {15616#true} assume !(0 == ~cond); {15616#true} is VALID [2022-04-28 05:55:07,800 INFO L290 TraceCheckUtils]: 7: Hoare triple {15616#true} ~cond := #in~cond; {15616#true} is VALID [2022-04-28 05:55:07,800 INFO L272 TraceCheckUtils]: 6: Hoare triple {15616#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {15616#true} is VALID [2022-04-28 05:55:07,800 INFO L290 TraceCheckUtils]: 5: Hoare triple {15616#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; {15616#true} is VALID [2022-04-28 05:55:07,801 INFO L272 TraceCheckUtils]: 4: Hoare triple {15616#true} call #t~ret6 := main(); {15616#true} is VALID [2022-04-28 05:55:07,801 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15616#true} {15616#true} #112#return; {15616#true} is VALID [2022-04-28 05:55:07,801 INFO L290 TraceCheckUtils]: 2: Hoare triple {15616#true} assume true; {15616#true} is VALID [2022-04-28 05:55:07,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {15616#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); {15616#true} is VALID [2022-04-28 05:55:07,801 INFO L272 TraceCheckUtils]: 0: Hoare triple {15616#true} call ULTIMATE.init(); {15616#true} is VALID [2022-04-28 05:55:07,801 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 18 proven. 26 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-28 05:55:07,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:55:07,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265925765] [2022-04-28 05:55:07,802 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:55:07,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449175159] [2022-04-28 05:55:07,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449175159] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:55:07,802 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:55:07,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 24 [2022-04-28 05:55:07,802 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:55:07,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1611800913] [2022-04-28 05:55:07,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1611800913] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:55:07,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:55:07,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 05:55:07,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939571264] [2022-04-28 05:55:07,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:55:07,803 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 77 [2022-04-28 05:55:07,803 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:55:07,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-28 05:55:07,854 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 05:55:07,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 05:55:07,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:55:07,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 05:55:07,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2022-04-28 05:55:07,854 INFO L87 Difference]: Start difference. First operand 214 states and 289 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-28 05:55:10,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:55:10,773 INFO L93 Difference]: Finished difference Result 285 states and 377 transitions. [2022-04-28 05:55:10,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 05:55:10,773 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 77 [2022-04-28 05:55:10,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:55:10,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-28 05:55:10,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 148 transitions. [2022-04-28 05:55:10,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-28 05:55:10,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 148 transitions. [2022-04-28 05:55:10,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 148 transitions. [2022-04-28 05:55:10,938 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:55:10,943 INFO L225 Difference]: With dead ends: 285 [2022-04-28 05:55:10,943 INFO L226 Difference]: Without dead ends: 283 [2022-04-28 05:55:10,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 130 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=150, Invalid=780, Unknown=0, NotChecked=0, Total=930 [2022-04-28 05:55:10,944 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 60 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 05:55:10,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 354 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 05:55:10,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-04-28 05:55:11,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 265. [2022-04-28 05:55:11,618 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:55:11,619 INFO L82 GeneralOperation]: Start isEquivalent. First operand 283 states. Second operand has 265 states, 157 states have (on average 1.178343949044586) internal successors, (185), 158 states have internal predecessors, (185), 87 states have call successors, (87), 21 states have call predecessors, (87), 20 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-04-28 05:55:11,620 INFO L74 IsIncluded]: Start isIncluded. First operand 283 states. Second operand has 265 states, 157 states have (on average 1.178343949044586) internal successors, (185), 158 states have internal predecessors, (185), 87 states have call successors, (87), 21 states have call predecessors, (87), 20 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-04-28 05:55:11,620 INFO L87 Difference]: Start difference. First operand 283 states. Second operand has 265 states, 157 states have (on average 1.178343949044586) internal successors, (185), 158 states have internal predecessors, (185), 87 states have call successors, (87), 21 states have call predecessors, (87), 20 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-04-28 05:55:11,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:55:11,628 INFO L93 Difference]: Finished difference Result 283 states and 375 transitions. [2022-04-28 05:55:11,628 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 375 transitions. [2022-04-28 05:55:11,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:55:11,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:55:11,630 INFO L74 IsIncluded]: Start isIncluded. First operand has 265 states, 157 states have (on average 1.178343949044586) internal successors, (185), 158 states have internal predecessors, (185), 87 states have call successors, (87), 21 states have call predecessors, (87), 20 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) Second operand 283 states. [2022-04-28 05:55:11,630 INFO L87 Difference]: Start difference. First operand has 265 states, 157 states have (on average 1.178343949044586) internal successors, (185), 158 states have internal predecessors, (185), 87 states have call successors, (87), 21 states have call predecessors, (87), 20 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) Second operand 283 states. [2022-04-28 05:55:11,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:55:11,638 INFO L93 Difference]: Finished difference Result 283 states and 375 transitions. [2022-04-28 05:55:11,638 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 375 transitions. [2022-04-28 05:55:11,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:55:11,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:55:11,639 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:55:11,639 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:55:11,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 157 states have (on average 1.178343949044586) internal successors, (185), 158 states have internal predecessors, (185), 87 states have call successors, (87), 21 states have call predecessors, (87), 20 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-04-28 05:55:11,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 357 transitions. [2022-04-28 05:55:11,647 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 357 transitions. Word has length 77 [2022-04-28 05:55:11,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:55:11,648 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 357 transitions. [2022-04-28 05:55:11,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-28 05:55:11,648 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 265 states and 357 transitions. [2022-04-28 05:55:12,316 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 357 edges. 357 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:55:12,317 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 357 transitions. [2022-04-28 05:55:12,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-28 05:55:12,317 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:55:12,317 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 05:55:12,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-28 05:55:12,521 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 05:55:12,522 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:55:12,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:55:12,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1679616651, now seen corresponding path program 1 times [2022-04-28 05:55:12,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:55:12,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [915308942] [2022-04-28 05:55:12,523 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:55:12,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1679616651, now seen corresponding path program 2 times [2022-04-28 05:55:12,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:55:12,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347608495] [2022-04-28 05:55:12,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:55:12,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:55:12,535 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:55:12,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [679940368] [2022-04-28 05:55:12,535 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:55:12,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:55:12,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:55:12,536 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 05:55:12,537 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 05:55:12,585 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:55:12,586 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:55:12,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 61 conjunts are in the unsatisfiable core [2022-04-28 05:55:12,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:55:12,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:55:13,425 INFO L272 TraceCheckUtils]: 0: Hoare triple {17781#true} call ULTIMATE.init(); {17781#true} is VALID [2022-04-28 05:55:13,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {17781#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); {17781#true} is VALID [2022-04-28 05:55:13,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {17781#true} assume true; {17781#true} is VALID [2022-04-28 05:55:13,425 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17781#true} {17781#true} #112#return; {17781#true} is VALID [2022-04-28 05:55:13,425 INFO L272 TraceCheckUtils]: 4: Hoare triple {17781#true} call #t~ret6 := main(); {17781#true} is VALID [2022-04-28 05:55:13,425 INFO L290 TraceCheckUtils]: 5: Hoare triple {17781#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; {17781#true} is VALID [2022-04-28 05:55:13,426 INFO L272 TraceCheckUtils]: 6: Hoare triple {17781#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {17781#true} is VALID [2022-04-28 05:55:13,426 INFO L290 TraceCheckUtils]: 7: Hoare triple {17781#true} ~cond := #in~cond; {17781#true} is VALID [2022-04-28 05:55:13,426 INFO L290 TraceCheckUtils]: 8: Hoare triple {17781#true} assume !(0 == ~cond); {17781#true} is VALID [2022-04-28 05:55:13,426 INFO L290 TraceCheckUtils]: 9: Hoare triple {17781#true} assume true; {17781#true} is VALID [2022-04-28 05:55:13,426 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17781#true} {17781#true} #94#return; {17781#true} is VALID [2022-04-28 05:55:13,426 INFO L290 TraceCheckUtils]: 11: Hoare triple {17781#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {17781#true} is VALID [2022-04-28 05:55:13,426 INFO L272 TraceCheckUtils]: 12: Hoare triple {17781#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {17781#true} is VALID [2022-04-28 05:55:13,426 INFO L290 TraceCheckUtils]: 13: Hoare triple {17781#true} ~cond := #in~cond; {17781#true} is VALID [2022-04-28 05:55:13,426 INFO L290 TraceCheckUtils]: 14: Hoare triple {17781#true} assume !(0 == ~cond); {17781#true} is VALID [2022-04-28 05:55:13,426 INFO L290 TraceCheckUtils]: 15: Hoare triple {17781#true} assume true; {17781#true} is VALID [2022-04-28 05:55:13,426 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {17781#true} {17781#true} #96#return; {17781#true} is VALID [2022-04-28 05:55:13,426 INFO L272 TraceCheckUtils]: 17: Hoare triple {17781#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {17781#true} is VALID [2022-04-28 05:55:13,426 INFO L290 TraceCheckUtils]: 18: Hoare triple {17781#true} ~cond := #in~cond; {17781#true} is VALID [2022-04-28 05:55:13,426 INFO L290 TraceCheckUtils]: 19: Hoare triple {17781#true} assume !(0 == ~cond); {17781#true} is VALID [2022-04-28 05:55:13,426 INFO L290 TraceCheckUtils]: 20: Hoare triple {17781#true} assume true; {17781#true} is VALID [2022-04-28 05:55:13,426 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {17781#true} {17781#true} #98#return; {17781#true} is VALID [2022-04-28 05:55:13,426 INFO L272 TraceCheckUtils]: 22: Hoare triple {17781#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {17781#true} is VALID [2022-04-28 05:55:13,427 INFO L290 TraceCheckUtils]: 23: Hoare triple {17781#true} ~cond := #in~cond; {17781#true} is VALID [2022-04-28 05:55:13,427 INFO L290 TraceCheckUtils]: 24: Hoare triple {17781#true} assume !(0 == ~cond); {17781#true} is VALID [2022-04-28 05:55:13,427 INFO L290 TraceCheckUtils]: 25: Hoare triple {17781#true} assume true; {17781#true} is VALID [2022-04-28 05:55:13,427 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {17781#true} {17781#true} #100#return; {17781#true} is VALID [2022-04-28 05:55:13,429 INFO L290 TraceCheckUtils]: 27: Hoare triple {17781#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {17867#(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 05:55:13,430 INFO L290 TraceCheckUtils]: 28: Hoare triple {17867#(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; {17867#(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 05:55:13,430 INFO L290 TraceCheckUtils]: 29: Hoare triple {17867#(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; {17874#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:55:13,430 INFO L290 TraceCheckUtils]: 30: Hoare triple {17874#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !false; {17874#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:55:13,431 INFO L290 TraceCheckUtils]: 31: Hoare triple {17874#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~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; {17881#(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 05:55:13,431 INFO L290 TraceCheckUtils]: 32: Hoare triple {17881#(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 !false; {17881#(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 05:55:13,431 INFO L272 TraceCheckUtils]: 33: Hoare triple {17881#(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 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {17781#true} is VALID [2022-04-28 05:55:13,431 INFO L290 TraceCheckUtils]: 34: Hoare triple {17781#true} ~cond := #in~cond; {17781#true} is VALID [2022-04-28 05:55:13,431 INFO L290 TraceCheckUtils]: 35: Hoare triple {17781#true} assume !(0 == ~cond); {17781#true} is VALID [2022-04-28 05:55:13,431 INFO L290 TraceCheckUtils]: 36: Hoare triple {17781#true} assume true; {17781#true} is VALID [2022-04-28 05:55:13,432 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {17781#true} {17881#(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))} #102#return; {17881#(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 05:55:13,432 INFO L272 TraceCheckUtils]: 38: Hoare triple {17881#(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)); {17781#true} is VALID [2022-04-28 05:55:13,432 INFO L290 TraceCheckUtils]: 39: Hoare triple {17781#true} ~cond := #in~cond; {17781#true} is VALID [2022-04-28 05:55:13,432 INFO L290 TraceCheckUtils]: 40: Hoare triple {17781#true} assume !(0 == ~cond); {17781#true} is VALID [2022-04-28 05:55:13,432 INFO L290 TraceCheckUtils]: 41: Hoare triple {17781#true} assume true; {17781#true} is VALID [2022-04-28 05:55:13,433 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {17781#true} {17881#(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; {17881#(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 05:55:13,433 INFO L272 TraceCheckUtils]: 43: Hoare triple {17881#(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)); {17781#true} is VALID [2022-04-28 05:55:13,433 INFO L290 TraceCheckUtils]: 44: Hoare triple {17781#true} ~cond := #in~cond; {17781#true} is VALID [2022-04-28 05:55:13,433 INFO L290 TraceCheckUtils]: 45: Hoare triple {17781#true} assume !(0 == ~cond); {17781#true} is VALID [2022-04-28 05:55:13,433 INFO L290 TraceCheckUtils]: 46: Hoare triple {17781#true} assume true; {17781#true} is VALID [2022-04-28 05:55:13,434 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {17781#true} {17881#(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; {17881#(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 05:55:13,434 INFO L272 TraceCheckUtils]: 48: Hoare triple {17881#(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)); {17781#true} is VALID [2022-04-28 05:55:13,434 INFO L290 TraceCheckUtils]: 49: Hoare triple {17781#true} ~cond := #in~cond; {17936#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:55:13,435 INFO L290 TraceCheckUtils]: 50: Hoare triple {17936#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17940#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:55:13,435 INFO L290 TraceCheckUtils]: 51: Hoare triple {17940#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17940#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:55:13,436 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {17940#(not (= |__VERIFIER_assert_#in~cond| 0))} {17881#(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; {17881#(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 05:55:13,436 INFO L290 TraceCheckUtils]: 53: Hoare triple {17881#(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);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {17950#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:55:13,436 INFO L290 TraceCheckUtils]: 54: Hoare triple {17950#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !false; {17950#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:55:13,437 INFO L272 TraceCheckUtils]: 55: Hoare triple {17950#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~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)); {17781#true} is VALID [2022-04-28 05:55:13,437 INFO L290 TraceCheckUtils]: 56: Hoare triple {17781#true} ~cond := #in~cond; {17781#true} is VALID [2022-04-28 05:55:13,437 INFO L290 TraceCheckUtils]: 57: Hoare triple {17781#true} assume !(0 == ~cond); {17781#true} is VALID [2022-04-28 05:55:13,437 INFO L290 TraceCheckUtils]: 58: Hoare triple {17781#true} assume true; {17781#true} is VALID [2022-04-28 05:55:13,437 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {17781#true} {17950#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #102#return; {17950#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:55:13,438 INFO L272 TraceCheckUtils]: 60: Hoare triple {17950#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= 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)); {17781#true} is VALID [2022-04-28 05:55:13,438 INFO L290 TraceCheckUtils]: 61: Hoare triple {17781#true} ~cond := #in~cond; {17781#true} is VALID [2022-04-28 05:55:13,438 INFO L290 TraceCheckUtils]: 62: Hoare triple {17781#true} assume !(0 == ~cond); {17781#true} is VALID [2022-04-28 05:55:13,438 INFO L290 TraceCheckUtils]: 63: Hoare triple {17781#true} assume true; {17781#true} is VALID [2022-04-28 05:55:13,438 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {17781#true} {17950#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #104#return; {17950#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:55:13,438 INFO L272 TraceCheckUtils]: 65: Hoare triple {17950#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= 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)); {17781#true} is VALID [2022-04-28 05:55:13,439 INFO L290 TraceCheckUtils]: 66: Hoare triple {17781#true} ~cond := #in~cond; {17781#true} is VALID [2022-04-28 05:55:13,439 INFO L290 TraceCheckUtils]: 67: Hoare triple {17781#true} assume !(0 == ~cond); {17781#true} is VALID [2022-04-28 05:55:13,439 INFO L290 TraceCheckUtils]: 68: Hoare triple {17781#true} assume true; {17781#true} is VALID [2022-04-28 05:55:13,439 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {17781#true} {17950#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #106#return; {17950#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:55:13,439 INFO L272 TraceCheckUtils]: 70: Hoare triple {17950#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= 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)); {17781#true} is VALID [2022-04-28 05:55:13,440 INFO L290 TraceCheckUtils]: 71: Hoare triple {17781#true} ~cond := #in~cond; {17936#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:55:13,440 INFO L290 TraceCheckUtils]: 72: Hoare triple {17936#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17940#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:55:13,440 INFO L290 TraceCheckUtils]: 73: Hoare triple {17940#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17940#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:55:13,441 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {17940#(not (= |__VERIFIER_assert_#in~cond| 0))} {17950#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #108#return; {17950#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:55:13,443 INFO L290 TraceCheckUtils]: 75: Hoare triple {17950#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= 2 * ~v~0); {17950#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:55:13,444 INFO L290 TraceCheckUtils]: 76: Hoare triple {17950#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= 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; {18020#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~c~0 (+ (* (- 2) main_~b~0) main_~x~0)) (= main_~p~0 1))} is VALID [2022-04-28 05:55:13,445 INFO L290 TraceCheckUtils]: 77: Hoare triple {18020#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~c~0 (+ (* (- 2) main_~b~0) main_~x~0)) (= main_~p~0 1))} assume !false; {18020#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~c~0 (+ (* (- 2) main_~b~0) main_~x~0)) (= main_~p~0 1))} is VALID [2022-04-28 05:55:13,445 INFO L290 TraceCheckUtils]: 78: Hoare triple {18020#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~c~0 (+ (* (- 2) main_~b~0) main_~x~0)) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {18020#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~c~0 (+ (* (- 2) main_~b~0) main_~x~0)) (= main_~p~0 1))} is VALID [2022-04-28 05:55:13,446 INFO L290 TraceCheckUtils]: 79: Hoare triple {18020#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~c~0 (+ (* (- 2) main_~b~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; {18030#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ (* main_~p~0 2) main_~q~0) 1) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))) (= (+ main_~s~0 (* main_~r~0 2)) 0))} is VALID [2022-04-28 05:55:13,447 INFO L290 TraceCheckUtils]: 80: Hoare triple {18030#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ (* main_~p~0 2) main_~q~0) 1) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))) (= (+ main_~s~0 (* main_~r~0 2)) 0))} assume !false; {18030#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ (* main_~p~0 2) main_~q~0) 1) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))) (= (+ main_~s~0 (* main_~r~0 2)) 0))} is VALID [2022-04-28 05:55:13,447 INFO L290 TraceCheckUtils]: 81: Hoare triple {18030#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ (* main_~p~0 2) main_~q~0) 1) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))) (= (+ main_~s~0 (* main_~r~0 2)) 0))} assume !(0 != ~b~0); {18037#(and (= main_~p~0 0) (= (+ main_~x~0 (* (- 2) main_~y~0)) 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ (* main_~p~0 2) main_~q~0) 1) (= (+ main_~s~0 (* main_~r~0 2)) 0))} is VALID [2022-04-28 05:55:13,448 INFO L272 TraceCheckUtils]: 82: Hoare triple {18037#(and (= main_~p~0 0) (= (+ main_~x~0 (* (- 2) main_~y~0)) 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ (* main_~p~0 2) main_~q~0) 1) (= (+ 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)); {18041#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:55:13,449 INFO L290 TraceCheckUtils]: 83: Hoare triple {18041#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18045#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:55:13,449 INFO L290 TraceCheckUtils]: 84: Hoare triple {18045#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17782#false} is VALID [2022-04-28 05:55:13,449 INFO L290 TraceCheckUtils]: 85: Hoare triple {17782#false} assume !false; {17782#false} is VALID [2022-04-28 05:55:13,450 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 41 proven. 21 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-04-28 05:55:13,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:55:36,219 INFO L290 TraceCheckUtils]: 85: Hoare triple {17782#false} assume !false; {17782#false} is VALID [2022-04-28 05:55:36,219 INFO L290 TraceCheckUtils]: 84: Hoare triple {18045#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17782#false} is VALID [2022-04-28 05:55:36,219 INFO L290 TraceCheckUtils]: 83: Hoare triple {18041#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18045#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:55:36,220 INFO L272 TraceCheckUtils]: 82: Hoare triple {18061#(= (+ (* 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)); {18041#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:55:36,221 INFO L290 TraceCheckUtils]: 81: Hoare triple {18065#(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); {18061#(= (+ (* 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 05:55:36,221 INFO L290 TraceCheckUtils]: 80: Hoare triple {18065#(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; {18065#(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 05:55:36,371 INFO L290 TraceCheckUtils]: 79: Hoare triple {18072#(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; {18065#(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 05:55:36,372 INFO L290 TraceCheckUtils]: 78: Hoare triple {18072#(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); {18072#(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 05:55:36,372 INFO L290 TraceCheckUtils]: 77: Hoare triple {18072#(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; {18072#(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 05:55:36,440 INFO L290 TraceCheckUtils]: 76: Hoare triple {18082#(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; {18072#(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 05:55:36,441 INFO L290 TraceCheckUtils]: 75: Hoare triple {18082#(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); {18082#(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 05:55:36,442 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {17940#(not (= |__VERIFIER_assert_#in~cond| 0))} {18089#(or (not (= (+ main_~c~0 (* (- 1) main_~v~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; {18082#(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 05:55:36,442 INFO L290 TraceCheckUtils]: 73: Hoare triple {17940#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17940#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:55:36,443 INFO L290 TraceCheckUtils]: 72: Hoare triple {18099#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {17940#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:55:36,443 INFO L290 TraceCheckUtils]: 71: Hoare triple {17781#true} ~cond := #in~cond; {18099#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 05:55:36,443 INFO L272 TraceCheckUtils]: 70: Hoare triple {18089#(or (not (= (+ main_~c~0 (* (- 1) main_~v~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)); {17781#true} is VALID [2022-04-28 05:55:36,444 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {17781#true} {18089#(or (not (= (+ main_~c~0 (* (- 1) main_~v~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))))} #106#return; {18089#(or (not (= (+ main_~c~0 (* (- 1) main_~v~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 05:55:36,444 INFO L290 TraceCheckUtils]: 68: Hoare triple {17781#true} assume true; {17781#true} is VALID [2022-04-28 05:55:36,444 INFO L290 TraceCheckUtils]: 67: Hoare triple {17781#true} assume !(0 == ~cond); {17781#true} is VALID [2022-04-28 05:55:36,444 INFO L290 TraceCheckUtils]: 66: Hoare triple {17781#true} ~cond := #in~cond; {17781#true} is VALID [2022-04-28 05:55:36,444 INFO L272 TraceCheckUtils]: 65: Hoare triple {18089#(or (not (= (+ main_~c~0 (* (- 1) main_~v~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 ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {17781#true} is VALID [2022-04-28 05:55:36,445 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {17781#true} {18089#(or (not (= (+ main_~c~0 (* (- 1) main_~v~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))))} #104#return; {18089#(or (not (= (+ main_~c~0 (* (- 1) main_~v~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 05:55:36,445 INFO L290 TraceCheckUtils]: 63: Hoare triple {17781#true} assume true; {17781#true} is VALID [2022-04-28 05:55:36,445 INFO L290 TraceCheckUtils]: 62: Hoare triple {17781#true} assume !(0 == ~cond); {17781#true} is VALID [2022-04-28 05:55:36,445 INFO L290 TraceCheckUtils]: 61: Hoare triple {17781#true} ~cond := #in~cond; {17781#true} is VALID [2022-04-28 05:55:36,445 INFO L272 TraceCheckUtils]: 60: Hoare triple {18089#(or (not (= (+ main_~c~0 (* (- 1) main_~v~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 ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {17781#true} is VALID [2022-04-28 05:55:36,446 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {17781#true} {18089#(or (not (= (+ main_~c~0 (* (- 1) main_~v~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))))} #102#return; {18089#(or (not (= (+ main_~c~0 (* (- 1) main_~v~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 05:55:36,446 INFO L290 TraceCheckUtils]: 58: Hoare triple {17781#true} assume true; {17781#true} is VALID [2022-04-28 05:55:36,446 INFO L290 TraceCheckUtils]: 57: Hoare triple {17781#true} assume !(0 == ~cond); {17781#true} is VALID [2022-04-28 05:55:36,446 INFO L290 TraceCheckUtils]: 56: Hoare triple {17781#true} ~cond := #in~cond; {17781#true} is VALID [2022-04-28 05:55:36,446 INFO L272 TraceCheckUtils]: 55: Hoare triple {18089#(or (not (= (+ main_~c~0 (* (- 1) main_~v~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 ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {17781#true} is VALID [2022-04-28 05:55:36,447 INFO L290 TraceCheckUtils]: 54: Hoare triple {18089#(or (not (= (+ main_~c~0 (* (- 1) main_~v~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))))} assume !false; {18089#(or (not (= (+ main_~c~0 (* (- 1) main_~v~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 05:55:36,508 INFO L290 TraceCheckUtils]: 53: Hoare triple {18154#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {18089#(or (not (= (+ main_~c~0 (* (- 1) main_~v~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 05:55:36,509 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {17781#true} {18154#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} #108#return; {18154#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} is VALID [2022-04-28 05:55:36,509 INFO L290 TraceCheckUtils]: 51: Hoare triple {17781#true} assume true; {17781#true} is VALID [2022-04-28 05:55:36,509 INFO L290 TraceCheckUtils]: 50: Hoare triple {17781#true} assume !(0 == ~cond); {17781#true} is VALID [2022-04-28 05:55:36,509 INFO L290 TraceCheckUtils]: 49: Hoare triple {17781#true} ~cond := #in~cond; {17781#true} is VALID [2022-04-28 05:55:36,509 INFO L272 TraceCheckUtils]: 48: Hoare triple {18154#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {17781#true} is VALID [2022-04-28 05:55:36,510 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {17781#true} {18154#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} #106#return; {18154#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} is VALID [2022-04-28 05:55:36,510 INFO L290 TraceCheckUtils]: 46: Hoare triple {17781#true} assume true; {17781#true} is VALID [2022-04-28 05:55:36,510 INFO L290 TraceCheckUtils]: 45: Hoare triple {17781#true} assume !(0 == ~cond); {17781#true} is VALID [2022-04-28 05:55:36,510 INFO L290 TraceCheckUtils]: 44: Hoare triple {17781#true} ~cond := #in~cond; {17781#true} is VALID [2022-04-28 05:55:36,510 INFO L272 TraceCheckUtils]: 43: Hoare triple {18154#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {17781#true} is VALID [2022-04-28 05:55:36,516 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {17781#true} {18154#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} #104#return; {18154#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} is VALID [2022-04-28 05:55:36,516 INFO L290 TraceCheckUtils]: 41: Hoare triple {17781#true} assume true; {17781#true} is VALID [2022-04-28 05:55:36,516 INFO L290 TraceCheckUtils]: 40: Hoare triple {17781#true} assume !(0 == ~cond); {17781#true} is VALID [2022-04-28 05:55:36,516 INFO L290 TraceCheckUtils]: 39: Hoare triple {17781#true} ~cond := #in~cond; {17781#true} is VALID [2022-04-28 05:55:36,516 INFO L272 TraceCheckUtils]: 38: Hoare triple {18154#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {17781#true} is VALID [2022-04-28 05:55:36,517 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {17781#true} {18154#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} #102#return; {18154#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} is VALID [2022-04-28 05:55:36,517 INFO L290 TraceCheckUtils]: 36: Hoare triple {17781#true} assume true; {17781#true} is VALID [2022-04-28 05:55:36,517 INFO L290 TraceCheckUtils]: 35: Hoare triple {17781#true} assume !(0 == ~cond); {17781#true} is VALID [2022-04-28 05:55:36,517 INFO L290 TraceCheckUtils]: 34: Hoare triple {17781#true} ~cond := #in~cond; {17781#true} is VALID [2022-04-28 05:55:36,517 INFO L272 TraceCheckUtils]: 33: Hoare triple {18154#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {17781#true} is VALID [2022-04-28 05:55:36,518 INFO L290 TraceCheckUtils]: 32: Hoare triple {18154#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} assume !false; {18154#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} is VALID [2022-04-28 05:55:36,519 INFO L290 TraceCheckUtils]: 31: Hoare triple {18221#(or (not (= (+ (* (- 2) main_~b~0) main_~c~0) 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ main_~b~0 (* main_~y~0 (+ (* (* (+ main_~k~0 2) main_~s~0) (- 1)) main_~r~0)) (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 2) main_~q~0))))))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {18154#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))))} is VALID [2022-04-28 05:55:36,520 INFO L290 TraceCheckUtils]: 30: Hoare triple {18221#(or (not (= (+ (* (- 2) main_~b~0) main_~c~0) 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ main_~b~0 (* main_~y~0 (+ (* (* (+ main_~k~0 2) main_~s~0) (- 1)) main_~r~0)) (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 2) main_~q~0))))))} assume !false; {18221#(or (not (= (+ (* (- 2) main_~b~0) main_~c~0) 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ main_~b~0 (* main_~y~0 (+ (* (* (+ main_~k~0 2) main_~s~0) (- 1)) main_~r~0)) (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 2) main_~q~0))))))} is VALID [2022-04-28 05:55:36,520 INFO L290 TraceCheckUtils]: 29: Hoare triple {18228#(or (not (= (+ (* (- 2) main_~b~0) main_~a~0) 0)) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0) 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; {18221#(or (not (= (+ (* (- 2) main_~b~0) main_~c~0) 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ main_~b~0 (* main_~y~0 (+ (* (* (+ main_~k~0 2) main_~s~0) (- 1)) main_~r~0)) (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 2) main_~q~0))))))} is VALID [2022-04-28 05:55:36,521 INFO L290 TraceCheckUtils]: 28: Hoare triple {18228#(or (not (= (+ (* (- 2) main_~b~0) main_~a~0) 0)) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0) main_~b~0) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !false; {18228#(or (not (= (+ (* (- 2) main_~b~0) main_~a~0) 0)) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0) main_~b~0) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 05:55:36,521 INFO L290 TraceCheckUtils]: 27: Hoare triple {17781#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {18228#(or (not (= (+ (* (- 2) main_~b~0) main_~a~0) 0)) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0) main_~b~0) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 05:55:36,522 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {17781#true} {17781#true} #100#return; {17781#true} is VALID [2022-04-28 05:55:36,522 INFO L290 TraceCheckUtils]: 25: Hoare triple {17781#true} assume true; {17781#true} is VALID [2022-04-28 05:55:36,522 INFO L290 TraceCheckUtils]: 24: Hoare triple {17781#true} assume !(0 == ~cond); {17781#true} is VALID [2022-04-28 05:55:36,522 INFO L290 TraceCheckUtils]: 23: Hoare triple {17781#true} ~cond := #in~cond; {17781#true} is VALID [2022-04-28 05:55:36,522 INFO L272 TraceCheckUtils]: 22: Hoare triple {17781#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {17781#true} is VALID [2022-04-28 05:55:36,522 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {17781#true} {17781#true} #98#return; {17781#true} is VALID [2022-04-28 05:55:36,522 INFO L290 TraceCheckUtils]: 20: Hoare triple {17781#true} assume true; {17781#true} is VALID [2022-04-28 05:55:36,522 INFO L290 TraceCheckUtils]: 19: Hoare triple {17781#true} assume !(0 == ~cond); {17781#true} is VALID [2022-04-28 05:55:36,522 INFO L290 TraceCheckUtils]: 18: Hoare triple {17781#true} ~cond := #in~cond; {17781#true} is VALID [2022-04-28 05:55:36,522 INFO L272 TraceCheckUtils]: 17: Hoare triple {17781#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {17781#true} is VALID [2022-04-28 05:55:36,522 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {17781#true} {17781#true} #96#return; {17781#true} is VALID [2022-04-28 05:55:36,522 INFO L290 TraceCheckUtils]: 15: Hoare triple {17781#true} assume true; {17781#true} is VALID [2022-04-28 05:55:36,523 INFO L290 TraceCheckUtils]: 14: Hoare triple {17781#true} assume !(0 == ~cond); {17781#true} is VALID [2022-04-28 05:55:36,523 INFO L290 TraceCheckUtils]: 13: Hoare triple {17781#true} ~cond := #in~cond; {17781#true} is VALID [2022-04-28 05:55:36,523 INFO L272 TraceCheckUtils]: 12: Hoare triple {17781#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {17781#true} is VALID [2022-04-28 05:55:36,523 INFO L290 TraceCheckUtils]: 11: Hoare triple {17781#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {17781#true} is VALID [2022-04-28 05:55:36,523 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17781#true} {17781#true} #94#return; {17781#true} is VALID [2022-04-28 05:55:36,523 INFO L290 TraceCheckUtils]: 9: Hoare triple {17781#true} assume true; {17781#true} is VALID [2022-04-28 05:55:36,525 INFO L290 TraceCheckUtils]: 8: Hoare triple {17781#true} assume !(0 == ~cond); {17781#true} is VALID [2022-04-28 05:55:36,525 INFO L290 TraceCheckUtils]: 7: Hoare triple {17781#true} ~cond := #in~cond; {17781#true} is VALID [2022-04-28 05:55:36,525 INFO L272 TraceCheckUtils]: 6: Hoare triple {17781#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {17781#true} is VALID [2022-04-28 05:55:36,525 INFO L290 TraceCheckUtils]: 5: Hoare triple {17781#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; {17781#true} is VALID [2022-04-28 05:55:36,525 INFO L272 TraceCheckUtils]: 4: Hoare triple {17781#true} call #t~ret6 := main(); {17781#true} is VALID [2022-04-28 05:55:36,525 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17781#true} {17781#true} #112#return; {17781#true} is VALID [2022-04-28 05:55:36,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {17781#true} assume true; {17781#true} is VALID [2022-04-28 05:55:36,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {17781#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); {17781#true} is VALID [2022-04-28 05:55:36,525 INFO L272 TraceCheckUtils]: 0: Hoare triple {17781#true} call ULTIMATE.init(); {17781#true} is VALID [2022-04-28 05:55:36,526 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 36 proven. 11 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-04-28 05:55:36,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:55:36,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347608495] [2022-04-28 05:55:36,526 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:55:36,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679940368] [2022-04-28 05:55:36,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679940368] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:55:36,526 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:55:36,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 22 [2022-04-28 05:55:36,527 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:55:36,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [915308942] [2022-04-28 05:55:36,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [915308942] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:55:36,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:55:36,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 05:55:36,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091921142] [2022-04-28 05:55:36,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:55:36,529 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 86 [2022-04-28 05:55:36,529 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:55:36,529 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-28 05:55:36,593 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 05:55:36,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 05:55:36,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:55:36,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 05:55:36,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2022-04-28 05:55:36,594 INFO L87 Difference]: Start difference. First operand 265 states and 357 transitions. Second operand has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-28 05:55:39,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:55:39,972 INFO L93 Difference]: Finished difference Result 348 states and 475 transitions. [2022-04-28 05:55:39,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 05:55:39,973 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 86 [2022-04-28 05:55:39,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:55:39,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-28 05:55:39,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 143 transitions. [2022-04-28 05:55:39,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-28 05:55:39,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 143 transitions. [2022-04-28 05:55:39,977 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 143 transitions. [2022-04-28 05:55:40,167 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:55:40,177 INFO L225 Difference]: With dead ends: 348 [2022-04-28 05:55:40,177 INFO L226 Difference]: Without dead ends: 345 [2022-04-28 05:55:40,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 148 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=139, Invalid=673, Unknown=0, NotChecked=0, Total=812 [2022-04-28 05:55:40,178 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 55 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:55:40,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 328 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 05:55:40,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2022-04-28 05:55:41,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 330. [2022-04-28 05:55:41,153 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:55:41,153 INFO L82 GeneralOperation]: Start isEquivalent. First operand 345 states. Second operand has 330 states, 191 states have (on average 1.193717277486911) internal successors, (228), 192 states have internal predecessors, (228), 115 states have call successors, (115), 24 states have call predecessors, (115), 23 states have return successors, (113), 113 states have call predecessors, (113), 113 states have call successors, (113) [2022-04-28 05:55:41,154 INFO L74 IsIncluded]: Start isIncluded. First operand 345 states. Second operand has 330 states, 191 states have (on average 1.193717277486911) internal successors, (228), 192 states have internal predecessors, (228), 115 states have call successors, (115), 24 states have call predecessors, (115), 23 states have return successors, (113), 113 states have call predecessors, (113), 113 states have call successors, (113) [2022-04-28 05:55:41,155 INFO L87 Difference]: Start difference. First operand 345 states. Second operand has 330 states, 191 states have (on average 1.193717277486911) internal successors, (228), 192 states have internal predecessors, (228), 115 states have call successors, (115), 24 states have call predecessors, (115), 23 states have return successors, (113), 113 states have call predecessors, (113), 113 states have call successors, (113) [2022-04-28 05:55:41,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:55:41,164 INFO L93 Difference]: Finished difference Result 345 states and 471 transitions. [2022-04-28 05:55:41,164 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 471 transitions. [2022-04-28 05:55:41,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:55:41,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:55:41,166 INFO L74 IsIncluded]: Start isIncluded. First operand has 330 states, 191 states have (on average 1.193717277486911) internal successors, (228), 192 states have internal predecessors, (228), 115 states have call successors, (115), 24 states have call predecessors, (115), 23 states have return successors, (113), 113 states have call predecessors, (113), 113 states have call successors, (113) Second operand 345 states. [2022-04-28 05:55:41,167 INFO L87 Difference]: Start difference. First operand has 330 states, 191 states have (on average 1.193717277486911) internal successors, (228), 192 states have internal predecessors, (228), 115 states have call successors, (115), 24 states have call predecessors, (115), 23 states have return successors, (113), 113 states have call predecessors, (113), 113 states have call successors, (113) Second operand 345 states. [2022-04-28 05:55:41,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:55:41,177 INFO L93 Difference]: Finished difference Result 345 states and 471 transitions. [2022-04-28 05:55:41,178 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 471 transitions. [2022-04-28 05:55:41,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:55:41,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:55:41,179 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:55:41,179 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:55:41,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 191 states have (on average 1.193717277486911) internal successors, (228), 192 states have internal predecessors, (228), 115 states have call successors, (115), 24 states have call predecessors, (115), 23 states have return successors, (113), 113 states have call predecessors, (113), 113 states have call successors, (113) [2022-04-28 05:55:41,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 456 transitions. [2022-04-28 05:55:41,191 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 456 transitions. Word has length 86 [2022-04-28 05:55:41,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:55:41,191 INFO L495 AbstractCegarLoop]: Abstraction has 330 states and 456 transitions. [2022-04-28 05:55:41,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-28 05:55:41,191 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 330 states and 456 transitions. [2022-04-28 05:55:42,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 456 edges. 456 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:55:42,144 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 456 transitions. [2022-04-28 05:55:42,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-28 05:55:42,145 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:55:42,145 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 05:55:42,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-04-28 05:55:42,367 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 05:55:42,368 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:55:42,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:55:42,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1455197645, now seen corresponding path program 3 times [2022-04-28 05:55:42,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:55:42,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2138369634] [2022-04-28 05:55:42,368 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:55:42,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1455197645, now seen corresponding path program 4 times [2022-04-28 05:55:42,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:55:42,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041330127] [2022-04-28 05:55:42,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:55:42,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:55:42,380 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:55:42,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [551750511] [2022-04-28 05:55:42,380 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:55:42,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:55:42,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:55:42,381 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 05:55:42,384 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 05:55:42,438 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:55:42,438 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:55:42,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 86 conjunts are in the unsatisfiable core [2022-04-28 05:55:42,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:55:42,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:55:44,239 INFO L272 TraceCheckUtils]: 0: Hoare triple {20378#true} call ULTIMATE.init(); {20378#true} is VALID [2022-04-28 05:55:44,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {20378#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); {20378#true} is VALID [2022-04-28 05:55:44,240 INFO L290 TraceCheckUtils]: 2: Hoare triple {20378#true} assume true; {20378#true} is VALID [2022-04-28 05:55:44,240 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20378#true} {20378#true} #112#return; {20378#true} is VALID [2022-04-28 05:55:44,240 INFO L272 TraceCheckUtils]: 4: Hoare triple {20378#true} call #t~ret6 := main(); {20378#true} is VALID [2022-04-28 05:55:44,240 INFO L290 TraceCheckUtils]: 5: Hoare triple {20378#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; {20378#true} is VALID [2022-04-28 05:55:44,240 INFO L272 TraceCheckUtils]: 6: Hoare triple {20378#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {20378#true} is VALID [2022-04-28 05:55:44,240 INFO L290 TraceCheckUtils]: 7: Hoare triple {20378#true} ~cond := #in~cond; {20378#true} is VALID [2022-04-28 05:55:44,240 INFO L290 TraceCheckUtils]: 8: Hoare triple {20378#true} assume !(0 == ~cond); {20378#true} is VALID [2022-04-28 05:55:44,240 INFO L290 TraceCheckUtils]: 9: Hoare triple {20378#true} assume true; {20378#true} is VALID [2022-04-28 05:55:44,240 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20378#true} {20378#true} #94#return; {20378#true} is VALID [2022-04-28 05:55:44,240 INFO L290 TraceCheckUtils]: 11: Hoare triple {20378#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {20378#true} is VALID [2022-04-28 05:55:44,241 INFO L272 TraceCheckUtils]: 12: Hoare triple {20378#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {20378#true} is VALID [2022-04-28 05:55:44,241 INFO L290 TraceCheckUtils]: 13: Hoare triple {20378#true} ~cond := #in~cond; {20378#true} is VALID [2022-04-28 05:55:44,241 INFO L290 TraceCheckUtils]: 14: Hoare triple {20378#true} assume !(0 == ~cond); {20378#true} is VALID [2022-04-28 05:55:44,241 INFO L290 TraceCheckUtils]: 15: Hoare triple {20378#true} assume true; {20378#true} is VALID [2022-04-28 05:55:44,241 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {20378#true} {20378#true} #96#return; {20378#true} is VALID [2022-04-28 05:55:44,241 INFO L272 TraceCheckUtils]: 17: Hoare triple {20378#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {20378#true} is VALID [2022-04-28 05:55:44,241 INFO L290 TraceCheckUtils]: 18: Hoare triple {20378#true} ~cond := #in~cond; {20378#true} is VALID [2022-04-28 05:55:44,241 INFO L290 TraceCheckUtils]: 19: Hoare triple {20378#true} assume !(0 == ~cond); {20378#true} is VALID [2022-04-28 05:55:44,241 INFO L290 TraceCheckUtils]: 20: Hoare triple {20378#true} assume true; {20378#true} is VALID [2022-04-28 05:55:44,241 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {20378#true} {20378#true} #98#return; {20378#true} is VALID [2022-04-28 05:55:44,241 INFO L272 TraceCheckUtils]: 22: Hoare triple {20378#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {20378#true} is VALID [2022-04-28 05:55:44,241 INFO L290 TraceCheckUtils]: 23: Hoare triple {20378#true} ~cond := #in~cond; {20378#true} is VALID [2022-04-28 05:55:44,241 INFO L290 TraceCheckUtils]: 24: Hoare triple {20378#true} assume !(0 == ~cond); {20378#true} is VALID [2022-04-28 05:55:44,242 INFO L290 TraceCheckUtils]: 25: Hoare triple {20378#true} assume true; {20378#true} is VALID [2022-04-28 05:55:44,242 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {20378#true} {20378#true} #100#return; {20378#true} is VALID [2022-04-28 05:55:44,242 INFO L290 TraceCheckUtils]: 27: Hoare triple {20378#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {20464#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:55:44,243 INFO L290 TraceCheckUtils]: 28: Hoare triple {20464#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !false; {20464#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:55:44,243 INFO L290 TraceCheckUtils]: 29: Hoare triple {20464#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= 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; {20471#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 05:55:44,244 INFO L290 TraceCheckUtils]: 30: Hoare triple {20471#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} assume !false; {20471#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 05:55:44,244 INFO L290 TraceCheckUtils]: 31: Hoare triple {20471#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} assume !(~c~0 >= ~b~0); {20478#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (<= main_~b~0 main_~c~0)) (<= main_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 05:55:44,245 INFO L290 TraceCheckUtils]: 32: Hoare triple {20478#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (<= main_~b~0 main_~c~0)) (<= main_~p~0 1) (= 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; {20482#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 05:55:44,246 INFO L290 TraceCheckUtils]: 33: Hoare triple {20482#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !false; {20482#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 05:55:44,246 INFO L290 TraceCheckUtils]: 34: Hoare triple {20482#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= 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; {20489#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 05:55:44,247 INFO L290 TraceCheckUtils]: 35: Hoare triple {20489#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !false; {20489#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 05:55:44,248 INFO L290 TraceCheckUtils]: 36: Hoare triple {20489#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= 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; {20496#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} is VALID [2022-04-28 05:55:44,248 INFO L290 TraceCheckUtils]: 37: Hoare triple {20496#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} assume !false; {20496#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} is VALID [2022-04-28 05:55:44,248 INFO L272 TraceCheckUtils]: 38: Hoare triple {20496#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {20378#true} is VALID [2022-04-28 05:55:44,248 INFO L290 TraceCheckUtils]: 39: Hoare triple {20378#true} ~cond := #in~cond; {20378#true} is VALID [2022-04-28 05:55:44,248 INFO L290 TraceCheckUtils]: 40: Hoare triple {20378#true} assume !(0 == ~cond); {20378#true} is VALID [2022-04-28 05:55:44,248 INFO L290 TraceCheckUtils]: 41: Hoare triple {20378#true} assume true; {20378#true} is VALID [2022-04-28 05:55:44,249 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {20378#true} {20496#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} #102#return; {20496#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} is VALID [2022-04-28 05:55:44,250 INFO L272 TraceCheckUtils]: 43: Hoare triple {20496#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {20378#true} is VALID [2022-04-28 05:55:44,250 INFO L290 TraceCheckUtils]: 44: Hoare triple {20378#true} ~cond := #in~cond; {20378#true} is VALID [2022-04-28 05:55:44,250 INFO L290 TraceCheckUtils]: 45: Hoare triple {20378#true} assume !(0 == ~cond); {20378#true} is VALID [2022-04-28 05:55:44,250 INFO L290 TraceCheckUtils]: 46: Hoare triple {20378#true} assume true; {20378#true} is VALID [2022-04-28 05:55:44,251 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {20378#true} {20496#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} #104#return; {20496#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} is VALID [2022-04-28 05:55:44,251 INFO L272 TraceCheckUtils]: 48: Hoare triple {20496#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {20378#true} is VALID [2022-04-28 05:55:44,251 INFO L290 TraceCheckUtils]: 49: Hoare triple {20378#true} ~cond := #in~cond; {20378#true} is VALID [2022-04-28 05:55:44,251 INFO L290 TraceCheckUtils]: 50: Hoare triple {20378#true} assume !(0 == ~cond); {20378#true} is VALID [2022-04-28 05:55:44,251 INFO L290 TraceCheckUtils]: 51: Hoare triple {20378#true} assume true; {20378#true} is VALID [2022-04-28 05:55:44,252 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {20378#true} {20496#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} #106#return; {20496#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} is VALID [2022-04-28 05:55:44,252 INFO L272 TraceCheckUtils]: 53: Hoare triple {20496#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {20378#true} is VALID [2022-04-28 05:55:44,252 INFO L290 TraceCheckUtils]: 54: Hoare triple {20378#true} ~cond := #in~cond; {20551#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:55:44,253 INFO L290 TraceCheckUtils]: 55: Hoare triple {20551#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {20555#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:55:44,253 INFO L290 TraceCheckUtils]: 56: Hoare triple {20555#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {20555#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:55:44,254 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {20555#(not (= |__VERIFIER_assert_#in~cond| 0))} {20496#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} #108#return; {20496#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} is VALID [2022-04-28 05:55:44,255 INFO L290 TraceCheckUtils]: 58: Hoare triple {20496#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {20565#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 2))} is VALID [2022-04-28 05:55:44,255 INFO L290 TraceCheckUtils]: 59: Hoare triple {20565#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 2))} assume !false; {20565#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 2))} is VALID [2022-04-28 05:55:44,255 INFO L272 TraceCheckUtils]: 60: Hoare triple {20565#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 2))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {20378#true} is VALID [2022-04-28 05:55:44,256 INFO L290 TraceCheckUtils]: 61: Hoare triple {20378#true} ~cond := #in~cond; {20551#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:55:44,256 INFO L290 TraceCheckUtils]: 62: Hoare triple {20551#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {20555#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:55:44,256 INFO L290 TraceCheckUtils]: 63: Hoare triple {20555#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {20555#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:55:44,258 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {20555#(not (= |__VERIFIER_assert_#in~cond| 0))} {20565#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 2))} #102#return; {20584#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 05:55:44,258 INFO L272 TraceCheckUtils]: 65: Hoare triple {20584#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {20378#true} is VALID [2022-04-28 05:55:44,258 INFO L290 TraceCheckUtils]: 66: Hoare triple {20378#true} ~cond := #in~cond; {20551#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:55:44,258 INFO L290 TraceCheckUtils]: 67: Hoare triple {20551#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {20555#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:55:44,259 INFO L290 TraceCheckUtils]: 68: Hoare triple {20555#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {20555#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:55:44,260 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {20555#(not (= |__VERIFIER_assert_#in~cond| 0))} {20584#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #104#return; {20600#(and (< 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_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 05:55:44,260 INFO L272 TraceCheckUtils]: 70: Hoare triple {20600#(and (< 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_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {20378#true} is VALID [2022-04-28 05:55:44,260 INFO L290 TraceCheckUtils]: 71: Hoare triple {20378#true} ~cond := #in~cond; {20378#true} is VALID [2022-04-28 05:55:44,260 INFO L290 TraceCheckUtils]: 72: Hoare triple {20378#true} assume !(0 == ~cond); {20378#true} is VALID [2022-04-28 05:55:44,260 INFO L290 TraceCheckUtils]: 73: Hoare triple {20378#true} assume true; {20378#true} is VALID [2022-04-28 05:55:44,261 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {20378#true} {20600#(and (< 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_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #106#return; {20600#(and (< 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_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 05:55:44,261 INFO L272 TraceCheckUtils]: 75: Hoare triple {20600#(and (< 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_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {20378#true} is VALID [2022-04-28 05:55:44,262 INFO L290 TraceCheckUtils]: 76: Hoare triple {20378#true} ~cond := #in~cond; {20551#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:55:44,262 INFO L290 TraceCheckUtils]: 77: Hoare triple {20551#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {20555#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:55:44,262 INFO L290 TraceCheckUtils]: 78: Hoare triple {20555#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {20555#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:55:44,263 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {20555#(not (= |__VERIFIER_assert_#in~cond| 0))} {20600#(and (< 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_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #108#return; {20600#(and (< 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_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 05:55:44,264 INFO L290 TraceCheckUtils]: 80: Hoare triple {20600#(and (< 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_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !(~c~0 >= 2 * ~v~0); {20600#(and (< 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_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 05:55:44,265 INFO L290 TraceCheckUtils]: 81: Hoare triple {20600#(and (< 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_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {20637#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= main_~q~0 1) (= main_~r~0 1) (< main_~x~0 (+ main_~c~0 (* main_~b~0 2))) (= main_~b~0 main_~x~0) (= main_~k~0 2) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 05:55:44,266 INFO L290 TraceCheckUtils]: 82: Hoare triple {20637#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= main_~q~0 1) (= main_~r~0 1) (< main_~x~0 (+ main_~c~0 (* main_~b~0 2))) (= main_~b~0 main_~x~0) (= main_~k~0 2) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !false; {20637#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= main_~q~0 1) (= main_~r~0 1) (< main_~x~0 (+ main_~c~0 (* main_~b~0 2))) (= main_~b~0 main_~x~0) (= main_~k~0 2) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 05:55:44,267 INFO L290 TraceCheckUtils]: 83: Hoare triple {20637#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= main_~q~0 1) (= main_~r~0 1) (< main_~x~0 (+ main_~c~0 (* main_~b~0 2))) (= main_~b~0 main_~x~0) (= main_~k~0 2) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !(~c~0 >= ~b~0); {20644#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~r~0 1) (< main_~x~0 (+ main_~c~0 (* main_~b~0 2))) (= main_~b~0 main_~x~0) (= main_~k~0 2) (< main_~c~0 main_~b~0) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 05:55:44,268 INFO L290 TraceCheckUtils]: 84: Hoare triple {20644#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~r~0 1) (< main_~x~0 (+ main_~c~0 (* main_~b~0 2))) (= main_~b~0 main_~x~0) (= main_~k~0 2) (< main_~c~0 main_~b~0) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~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; {20648#(and (= main_~r~0 0) (< main_~y~0 (* main_~a~0 3)) (= main_~b~0 (+ main_~y~0 (* (- 2) main_~a~0))) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= main_~a~0 (* main_~p~0 main_~x~0)) (= main_~a~0 main_~x~0) (= (+ (* main_~p~0 2) main_~q~0) 0))} is VALID [2022-04-28 05:55:44,269 INFO L290 TraceCheckUtils]: 85: Hoare triple {20648#(and (= main_~r~0 0) (< main_~y~0 (* main_~a~0 3)) (= main_~b~0 (+ main_~y~0 (* (- 2) main_~a~0))) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= main_~a~0 (* main_~p~0 main_~x~0)) (= main_~a~0 main_~x~0) (= (+ (* main_~p~0 2) main_~q~0) 0))} assume !false; {20648#(and (= main_~r~0 0) (< main_~y~0 (* main_~a~0 3)) (= main_~b~0 (+ main_~y~0 (* (- 2) main_~a~0))) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= main_~a~0 (* main_~p~0 main_~x~0)) (= main_~a~0 main_~x~0) (= (+ (* main_~p~0 2) main_~q~0) 0))} is VALID [2022-04-28 05:55:44,270 INFO L290 TraceCheckUtils]: 86: Hoare triple {20648#(and (= main_~r~0 0) (< main_~y~0 (* main_~a~0 3)) (= main_~b~0 (+ main_~y~0 (* (- 2) main_~a~0))) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= main_~a~0 (* main_~p~0 main_~x~0)) (= main_~a~0 main_~x~0) (= (+ (* main_~p~0 2) main_~q~0) 0))} assume !(0 != ~b~0); {20655#(and (= main_~r~0 0) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= (* main_~a~0 2) main_~y~0) (= main_~a~0 (* main_~p~0 main_~x~0)) (= main_~a~0 main_~x~0) (= (+ (* main_~p~0 2) main_~q~0) 0))} is VALID [2022-04-28 05:55:44,272 INFO L272 TraceCheckUtils]: 87: Hoare triple {20655#(and (= main_~r~0 0) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= (* main_~a~0 2) main_~y~0) (= main_~a~0 (* main_~p~0 main_~x~0)) (= main_~a~0 main_~x~0) (= (+ (* main_~p~0 2) main_~q~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)); {20659#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:55:44,273 INFO L290 TraceCheckUtils]: 88: Hoare triple {20659#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20663#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:55:44,273 INFO L290 TraceCheckUtils]: 89: Hoare triple {20663#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20379#false} is VALID [2022-04-28 05:55:44,273 INFO L290 TraceCheckUtils]: 90: Hoare triple {20379#false} assume !false; {20379#false} is VALID [2022-04-28 05:55:44,274 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 51 proven. 32 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-28 05:55:44,274 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:56:52,974 INFO L290 TraceCheckUtils]: 90: Hoare triple {20379#false} assume !false; {20379#false} is VALID [2022-04-28 05:56:52,974 INFO L290 TraceCheckUtils]: 89: Hoare triple {20663#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20379#false} is VALID [2022-04-28 05:56:52,974 INFO L290 TraceCheckUtils]: 88: Hoare triple {20659#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20663#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:56:52,975 INFO L272 TraceCheckUtils]: 87: Hoare triple {20679#(= (+ (* 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)); {20659#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:56:52,976 INFO L290 TraceCheckUtils]: 86: Hoare triple {20683#(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); {20679#(= (+ (* 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 05:56:52,976 INFO L290 TraceCheckUtils]: 85: Hoare triple {20683#(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; {20683#(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 05:56:53,072 INFO L290 TraceCheckUtils]: 84: Hoare triple {20690#(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; {20683#(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 05:56:53,073 INFO L290 TraceCheckUtils]: 83: Hoare triple {20694#(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); {20690#(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 05:56:53,073 INFO L290 TraceCheckUtils]: 82: Hoare triple {20694#(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; {20694#(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 05:56:53,192 INFO L290 TraceCheckUtils]: 81: Hoare triple {20701#(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; {20694#(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 05:56:53,193 INFO L290 TraceCheckUtils]: 80: Hoare triple {20701#(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); {20701#(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 05:56:53,194 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {20555#(not (= |__VERIFIER_assert_#in~cond| 0))} {20708#(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; {20701#(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 05:56:53,194 INFO L290 TraceCheckUtils]: 78: Hoare triple {20555#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {20555#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:56:53,194 INFO L290 TraceCheckUtils]: 77: Hoare triple {20718#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {20555#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:56:53,195 INFO L290 TraceCheckUtils]: 76: Hoare triple {20378#true} ~cond := #in~cond; {20718#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 05:56:53,195 INFO L272 TraceCheckUtils]: 75: Hoare triple {20708#(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)); {20378#true} is VALID [2022-04-28 05:56:53,195 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {20378#true} {20708#(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))))} #106#return; {20708#(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 05:56:53,196 INFO L290 TraceCheckUtils]: 73: Hoare triple {20378#true} assume true; {20378#true} is VALID [2022-04-28 05:56:53,196 INFO L290 TraceCheckUtils]: 72: Hoare triple {20378#true} assume !(0 == ~cond); {20378#true} is VALID [2022-04-28 05:56:53,196 INFO L290 TraceCheckUtils]: 71: Hoare triple {20378#true} ~cond := #in~cond; {20378#true} is VALID [2022-04-28 05:56:53,196 INFO L272 TraceCheckUtils]: 70: Hoare triple {20708#(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 ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {20378#true} is VALID [2022-04-28 05:56:53,197 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {20555#(not (= |__VERIFIER_assert_#in~cond| 0))} {20740#(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_~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; {20708#(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 05:56:53,197 INFO L290 TraceCheckUtils]: 68: Hoare triple {20555#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {20555#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:56:53,197 INFO L290 TraceCheckUtils]: 67: Hoare triple {20718#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {20555#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:56:53,198 INFO L290 TraceCheckUtils]: 66: Hoare triple {20378#true} ~cond := #in~cond; {20718#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 05:56:53,198 INFO L272 TraceCheckUtils]: 65: Hoare triple {20740#(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_~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)); {20378#true} is VALID [2022-04-28 05:56:53,199 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {20555#(not (= |__VERIFIER_assert_#in~cond| 0))} {20756#(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 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))))} #102#return; {20740#(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_~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 05:56:53,199 INFO L290 TraceCheckUtils]: 63: Hoare triple {20555#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {20555#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:56:53,199 INFO L290 TraceCheckUtils]: 62: Hoare triple {20718#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {20555#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:56:53,200 INFO L290 TraceCheckUtils]: 61: Hoare triple {20378#true} ~cond := #in~cond; {20718#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 05:56:53,200 INFO L272 TraceCheckUtils]: 60: Hoare triple {20756#(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 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 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {20378#true} is VALID [2022-04-28 05:56:53,200 INFO L290 TraceCheckUtils]: 59: Hoare triple {20756#(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 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))))} assume !false; {20756#(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 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 05:56:53,209 INFO L290 TraceCheckUtils]: 58: Hoare triple {20775#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))) (<= main_~b~0 0))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {20756#(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 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 05:56:53,210 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {20378#true} {20775#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))) (<= main_~b~0 0))} #108#return; {20775#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))) (<= main_~b~0 0))} is VALID [2022-04-28 05:56:53,210 INFO L290 TraceCheckUtils]: 56: Hoare triple {20378#true} assume true; {20378#true} is VALID [2022-04-28 05:56:53,210 INFO L290 TraceCheckUtils]: 55: Hoare triple {20378#true} assume !(0 == ~cond); {20378#true} is VALID [2022-04-28 05:56:53,210 INFO L290 TraceCheckUtils]: 54: Hoare triple {20378#true} ~cond := #in~cond; {20378#true} is VALID [2022-04-28 05:56:53,210 INFO L272 TraceCheckUtils]: 53: Hoare triple {20775#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))) (<= main_~b~0 0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {20378#true} is VALID [2022-04-28 05:56:53,211 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {20378#true} {20775#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))) (<= main_~b~0 0))} #106#return; {20775#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))) (<= main_~b~0 0))} is VALID [2022-04-28 05:56:53,211 INFO L290 TraceCheckUtils]: 51: Hoare triple {20378#true} assume true; {20378#true} is VALID [2022-04-28 05:56:53,211 INFO L290 TraceCheckUtils]: 50: Hoare triple {20378#true} assume !(0 == ~cond); {20378#true} is VALID [2022-04-28 05:56:53,211 INFO L290 TraceCheckUtils]: 49: Hoare triple {20378#true} ~cond := #in~cond; {20378#true} is VALID [2022-04-28 05:56:53,211 INFO L272 TraceCheckUtils]: 48: Hoare triple {20775#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))) (<= main_~b~0 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {20378#true} is VALID [2022-04-28 05:56:53,212 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {20378#true} {20775#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))) (<= main_~b~0 0))} #104#return; {20775#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))) (<= main_~b~0 0))} is VALID [2022-04-28 05:56:53,212 INFO L290 TraceCheckUtils]: 46: Hoare triple {20378#true} assume true; {20378#true} is VALID [2022-04-28 05:56:53,212 INFO L290 TraceCheckUtils]: 45: Hoare triple {20378#true} assume !(0 == ~cond); {20378#true} is VALID [2022-04-28 05:56:53,212 INFO L290 TraceCheckUtils]: 44: Hoare triple {20378#true} ~cond := #in~cond; {20378#true} is VALID [2022-04-28 05:56:53,212 INFO L272 TraceCheckUtils]: 43: Hoare triple {20775#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))) (<= main_~b~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {20378#true} is VALID [2022-04-28 05:56:53,213 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {20378#true} {20775#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))) (<= main_~b~0 0))} #102#return; {20775#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))) (<= main_~b~0 0))} is VALID [2022-04-28 05:56:53,213 INFO L290 TraceCheckUtils]: 41: Hoare triple {20378#true} assume true; {20378#true} is VALID [2022-04-28 05:56:53,213 INFO L290 TraceCheckUtils]: 40: Hoare triple {20378#true} assume !(0 == ~cond); {20378#true} is VALID [2022-04-28 05:56:53,213 INFO L290 TraceCheckUtils]: 39: Hoare triple {20378#true} ~cond := #in~cond; {20378#true} is VALID [2022-04-28 05:56:53,213 INFO L272 TraceCheckUtils]: 38: Hoare triple {20775#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))) (<= main_~b~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {20378#true} is VALID [2022-04-28 05:56:53,214 INFO L290 TraceCheckUtils]: 37: Hoare triple {20775#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))) (<= main_~b~0 0))} assume !false; {20775#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))) (<= main_~b~0 0))} is VALID [2022-04-28 05:56:53,214 INFO L290 TraceCheckUtils]: 36: Hoare triple {20842#(or (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 0) (not (= (+ (* (- 2) main_~b~0) main_~c~0) 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ main_~b~0 (* main_~y~0 (+ (* (* (+ main_~k~0 2) main_~s~0) (- 1)) main_~r~0)) (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 2) main_~q~0))))))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {20775#(or (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~c~0 (* (- 2) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) main_~b~0 (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))) (<= main_~b~0 0))} is VALID [2022-04-28 05:56:53,215 INFO L290 TraceCheckUtils]: 35: Hoare triple {20842#(or (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 0) (not (= (+ (* (- 2) main_~b~0) main_~c~0) 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ main_~b~0 (* main_~y~0 (+ (* (* (+ main_~k~0 2) main_~s~0) (- 1)) main_~r~0)) (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 2) main_~q~0))))))} assume !false; {20842#(or (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 0) (not (= (+ (* (- 2) main_~b~0) main_~c~0) 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ main_~b~0 (* main_~y~0 (+ (* (* (+ main_~k~0 2) main_~s~0) (- 1)) main_~r~0)) (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 2) main_~q~0))))))} is VALID [2022-04-28 05:56:53,216 INFO L290 TraceCheckUtils]: 34: Hoare triple {20378#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {20842#(or (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 0) (not (= (+ (* (- 2) main_~b~0) main_~c~0) 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ main_~b~0 (* main_~y~0 (+ (* (* (+ main_~k~0 2) main_~s~0) (- 1)) main_~r~0)) (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 2) main_~q~0))))))} is VALID [2022-04-28 05:56:53,216 INFO L290 TraceCheckUtils]: 33: Hoare triple {20378#true} assume !false; {20378#true} is VALID [2022-04-28 05:56:53,216 INFO L290 TraceCheckUtils]: 32: Hoare triple {20378#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; {20378#true} is VALID [2022-04-28 05:56:53,216 INFO L290 TraceCheckUtils]: 31: Hoare triple {20378#true} assume !(~c~0 >= ~b~0); {20378#true} is VALID [2022-04-28 05:56:53,216 INFO L290 TraceCheckUtils]: 30: Hoare triple {20378#true} assume !false; {20378#true} is VALID [2022-04-28 05:56:53,216 INFO L290 TraceCheckUtils]: 29: Hoare triple {20378#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {20378#true} is VALID [2022-04-28 05:56:53,216 INFO L290 TraceCheckUtils]: 28: Hoare triple {20378#true} assume !false; {20378#true} is VALID [2022-04-28 05:56:53,216 INFO L290 TraceCheckUtils]: 27: Hoare triple {20378#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {20378#true} is VALID [2022-04-28 05:56:53,216 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {20378#true} {20378#true} #100#return; {20378#true} is VALID [2022-04-28 05:56:53,216 INFO L290 TraceCheckUtils]: 25: Hoare triple {20378#true} assume true; {20378#true} is VALID [2022-04-28 05:56:53,216 INFO L290 TraceCheckUtils]: 24: Hoare triple {20378#true} assume !(0 == ~cond); {20378#true} is VALID [2022-04-28 05:56:53,216 INFO L290 TraceCheckUtils]: 23: Hoare triple {20378#true} ~cond := #in~cond; {20378#true} is VALID [2022-04-28 05:56:53,217 INFO L272 TraceCheckUtils]: 22: Hoare triple {20378#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {20378#true} is VALID [2022-04-28 05:56:53,217 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {20378#true} {20378#true} #98#return; {20378#true} is VALID [2022-04-28 05:56:53,217 INFO L290 TraceCheckUtils]: 20: Hoare triple {20378#true} assume true; {20378#true} is VALID [2022-04-28 05:56:53,217 INFO L290 TraceCheckUtils]: 19: Hoare triple {20378#true} assume !(0 == ~cond); {20378#true} is VALID [2022-04-28 05:56:53,217 INFO L290 TraceCheckUtils]: 18: Hoare triple {20378#true} ~cond := #in~cond; {20378#true} is VALID [2022-04-28 05:56:53,217 INFO L272 TraceCheckUtils]: 17: Hoare triple {20378#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {20378#true} is VALID [2022-04-28 05:56:53,217 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {20378#true} {20378#true} #96#return; {20378#true} is VALID [2022-04-28 05:56:53,217 INFO L290 TraceCheckUtils]: 15: Hoare triple {20378#true} assume true; {20378#true} is VALID [2022-04-28 05:56:53,217 INFO L290 TraceCheckUtils]: 14: Hoare triple {20378#true} assume !(0 == ~cond); {20378#true} is VALID [2022-04-28 05:56:53,217 INFO L290 TraceCheckUtils]: 13: Hoare triple {20378#true} ~cond := #in~cond; {20378#true} is VALID [2022-04-28 05:56:53,217 INFO L272 TraceCheckUtils]: 12: Hoare triple {20378#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {20378#true} is VALID [2022-04-28 05:56:53,217 INFO L290 TraceCheckUtils]: 11: Hoare triple {20378#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {20378#true} is VALID [2022-04-28 05:56:53,217 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20378#true} {20378#true} #94#return; {20378#true} is VALID [2022-04-28 05:56:53,217 INFO L290 TraceCheckUtils]: 9: Hoare triple {20378#true} assume true; {20378#true} is VALID [2022-04-28 05:56:53,217 INFO L290 TraceCheckUtils]: 8: Hoare triple {20378#true} assume !(0 == ~cond); {20378#true} is VALID [2022-04-28 05:56:53,217 INFO L290 TraceCheckUtils]: 7: Hoare triple {20378#true} ~cond := #in~cond; {20378#true} is VALID [2022-04-28 05:56:53,217 INFO L272 TraceCheckUtils]: 6: Hoare triple {20378#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {20378#true} is VALID [2022-04-28 05:56:53,217 INFO L290 TraceCheckUtils]: 5: Hoare triple {20378#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; {20378#true} is VALID [2022-04-28 05:56:53,217 INFO L272 TraceCheckUtils]: 4: Hoare triple {20378#true} call #t~ret6 := main(); {20378#true} is VALID [2022-04-28 05:56:53,218 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20378#true} {20378#true} #112#return; {20378#true} is VALID [2022-04-28 05:56:53,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {20378#true} assume true; {20378#true} is VALID [2022-04-28 05:56:53,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {20378#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); {20378#true} is VALID [2022-04-28 05:56:53,218 INFO L272 TraceCheckUtils]: 0: Hoare triple {20378#true} call ULTIMATE.init(); {20378#true} is VALID [2022-04-28 05:56:53,218 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 61 proven. 17 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-04-28 05:56:53,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:56:53,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041330127] [2022-04-28 05:56:53,218 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:56:53,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551750511] [2022-04-28 05:56:53,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551750511] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:56:53,219 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:56:53,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 30 [2022-04-28 05:56:53,219 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:56:53,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2138369634] [2022-04-28 05:56:53,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2138369634] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:56:53,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:56:53,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 05:56:53,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599236219] [2022-04-28 05:56:53,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:56:53,219 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 6 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) Word has length 91 [2022-04-28 05:56:53,220 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:56:53,220 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 6 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-28 05:56:53,291 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 05:56:53,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 05:56:53,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:53,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 05:56:53,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2022-04-28 05:56:53,292 INFO L87 Difference]: Start difference. First operand 330 states and 456 transitions. Second operand has 19 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 6 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-28 05:56:59,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:59,760 INFO L93 Difference]: Finished difference Result 422 states and 582 transitions. [2022-04-28 05:56:59,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 05:56:59,761 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 6 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) Word has length 91 [2022-04-28 05:56:59,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:56:59,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 6 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-28 05:56:59,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 175 transitions. [2022-04-28 05:56:59,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 6 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-28 05:56:59,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 175 transitions. [2022-04-28 05:56:59,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 175 transitions. [2022-04-28 05:57:00,018 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:00,033 INFO L225 Difference]: With dead ends: 422 [2022-04-28 05:57:00,033 INFO L226 Difference]: Without dead ends: 419 [2022-04-28 05:57:00,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 150 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=230, Invalid=1176, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 05:57:00,034 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 65 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 1295 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 1343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-28 05:57:00,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 477 Invalid, 1343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1295 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-28 05:57:00,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2022-04-28 05:57:01,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 399. [2022-04-28 05:57:01,243 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:57:01,244 INFO L82 GeneralOperation]: Start isEquivalent. First operand 419 states. Second operand has 399 states, 228 states have (on average 1.2017543859649122) internal successors, (274), 229 states have internal predecessors, (274), 143 states have call successors, (143), 28 states have call predecessors, (143), 27 states have return successors, (141), 141 states have call predecessors, (141), 141 states have call successors, (141) [2022-04-28 05:57:01,244 INFO L74 IsIncluded]: Start isIncluded. First operand 419 states. Second operand has 399 states, 228 states have (on average 1.2017543859649122) internal successors, (274), 229 states have internal predecessors, (274), 143 states have call successors, (143), 28 states have call predecessors, (143), 27 states have return successors, (141), 141 states have call predecessors, (141), 141 states have call successors, (141) [2022-04-28 05:57:01,245 INFO L87 Difference]: Start difference. First operand 419 states. Second operand has 399 states, 228 states have (on average 1.2017543859649122) internal successors, (274), 229 states have internal predecessors, (274), 143 states have call successors, (143), 28 states have call predecessors, (143), 27 states have return successors, (141), 141 states have call predecessors, (141), 141 states have call successors, (141) [2022-04-28 05:57:01,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:01,258 INFO L93 Difference]: Finished difference Result 419 states and 578 transitions. [2022-04-28 05:57:01,259 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 578 transitions. [2022-04-28 05:57:01,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:01,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:01,261 INFO L74 IsIncluded]: Start isIncluded. First operand has 399 states, 228 states have (on average 1.2017543859649122) internal successors, (274), 229 states have internal predecessors, (274), 143 states have call successors, (143), 28 states have call predecessors, (143), 27 states have return successors, (141), 141 states have call predecessors, (141), 141 states have call successors, (141) Second operand 419 states. [2022-04-28 05:57:01,261 INFO L87 Difference]: Start difference. First operand has 399 states, 228 states have (on average 1.2017543859649122) internal successors, (274), 229 states have internal predecessors, (274), 143 states have call successors, (143), 28 states have call predecessors, (143), 27 states have return successors, (141), 141 states have call predecessors, (141), 141 states have call successors, (141) Second operand 419 states. [2022-04-28 05:57:01,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:01,275 INFO L93 Difference]: Finished difference Result 419 states and 578 transitions. [2022-04-28 05:57:01,275 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 578 transitions. [2022-04-28 05:57:01,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:01,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:01,277 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:57:01,277 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:57:01,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 228 states have (on average 1.2017543859649122) internal successors, (274), 229 states have internal predecessors, (274), 143 states have call successors, (143), 28 states have call predecessors, (143), 27 states have return successors, (141), 141 states have call predecessors, (141), 141 states have call successors, (141) [2022-04-28 05:57:01,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 558 transitions. [2022-04-28 05:57:01,294 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 558 transitions. Word has length 91 [2022-04-28 05:57:01,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:57:01,294 INFO L495 AbstractCegarLoop]: Abstraction has 399 states and 558 transitions. [2022-04-28 05:57:01,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 6 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-28 05:57:01,294 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 399 states and 558 transitions. [2022-04-28 05:57:02,592 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 558 edges. 558 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:02,592 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 558 transitions. [2022-04-28 05:57:02,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-04-28 05:57:02,593 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:57:02,593 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2022-04-28 05:57:02,609 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 05:57:02,793 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 05:57:02,793 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:57:02,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:57:02,794 INFO L85 PathProgramCache]: Analyzing trace with hash -100199667, now seen corresponding path program 7 times [2022-04-28 05:57:02,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:02,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [786123469] [2022-04-28 05:57:02,794 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:57:02,794 INFO L85 PathProgramCache]: Analyzing trace with hash -100199667, now seen corresponding path program 8 times [2022-04-28 05:57:02,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:57:02,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775387789] [2022-04-28 05:57:02,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:57:02,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:57:02,813 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:57:02,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [102073853] [2022-04-28 05:57:02,813 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:57:02,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:57:02,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:57:02,814 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 05:57:02,818 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 05:57:02,871 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:57:02,871 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:57:02,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 96 conjunts are in the unsatisfiable core [2022-04-28 05:57:02,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:57:02,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:57:16,025 INFO L272 TraceCheckUtils]: 0: Hoare triple {23449#true} call ULTIMATE.init(); {23449#true} is VALID [2022-04-28 05:57:16,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {23449#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); {23449#true} is VALID [2022-04-28 05:57:16,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {23449#true} assume true; {23449#true} is VALID [2022-04-28 05:57:16,026 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23449#true} {23449#true} #112#return; {23449#true} is VALID [2022-04-28 05:57:16,026 INFO L272 TraceCheckUtils]: 4: Hoare triple {23449#true} call #t~ret6 := main(); {23449#true} is VALID [2022-04-28 05:57:16,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {23449#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; {23449#true} is VALID [2022-04-28 05:57:16,026 INFO L272 TraceCheckUtils]: 6: Hoare triple {23449#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {23449#true} is VALID [2022-04-28 05:57:16,026 INFO L290 TraceCheckUtils]: 7: Hoare triple {23449#true} ~cond := #in~cond; {23449#true} is VALID [2022-04-28 05:57:16,026 INFO L290 TraceCheckUtils]: 8: Hoare triple {23449#true} assume !(0 == ~cond); {23449#true} is VALID [2022-04-28 05:57:16,026 INFO L290 TraceCheckUtils]: 9: Hoare triple {23449#true} assume true; {23449#true} is VALID [2022-04-28 05:57:16,026 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23449#true} {23449#true} #94#return; {23449#true} is VALID [2022-04-28 05:57:16,026 INFO L290 TraceCheckUtils]: 11: Hoare triple {23449#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {23449#true} is VALID [2022-04-28 05:57:16,026 INFO L272 TraceCheckUtils]: 12: Hoare triple {23449#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {23449#true} is VALID [2022-04-28 05:57:16,026 INFO L290 TraceCheckUtils]: 13: Hoare triple {23449#true} ~cond := #in~cond; {23449#true} is VALID [2022-04-28 05:57:16,026 INFO L290 TraceCheckUtils]: 14: Hoare triple {23449#true} assume !(0 == ~cond); {23449#true} is VALID [2022-04-28 05:57:16,026 INFO L290 TraceCheckUtils]: 15: Hoare triple {23449#true} assume true; {23449#true} is VALID [2022-04-28 05:57:16,026 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {23449#true} {23449#true} #96#return; {23449#true} is VALID [2022-04-28 05:57:16,026 INFO L272 TraceCheckUtils]: 17: Hoare triple {23449#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {23449#true} is VALID [2022-04-28 05:57:16,026 INFO L290 TraceCheckUtils]: 18: Hoare triple {23449#true} ~cond := #in~cond; {23449#true} is VALID [2022-04-28 05:57:16,026 INFO L290 TraceCheckUtils]: 19: Hoare triple {23449#true} assume !(0 == ~cond); {23449#true} is VALID [2022-04-28 05:57:16,027 INFO L290 TraceCheckUtils]: 20: Hoare triple {23449#true} assume true; {23449#true} is VALID [2022-04-28 05:57:16,027 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {23449#true} {23449#true} #98#return; {23449#true} is VALID [2022-04-28 05:57:16,027 INFO L272 TraceCheckUtils]: 22: Hoare triple {23449#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {23449#true} is VALID [2022-04-28 05:57:16,027 INFO L290 TraceCheckUtils]: 23: Hoare triple {23449#true} ~cond := #in~cond; {23449#true} is VALID [2022-04-28 05:57:16,027 INFO L290 TraceCheckUtils]: 24: Hoare triple {23449#true} assume !(0 == ~cond); {23449#true} is VALID [2022-04-28 05:57:16,027 INFO L290 TraceCheckUtils]: 25: Hoare triple {23449#true} assume true; {23449#true} is VALID [2022-04-28 05:57:16,027 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {23449#true} {23449#true} #100#return; {23449#true} is VALID [2022-04-28 05:57:16,027 INFO L290 TraceCheckUtils]: 27: Hoare triple {23449#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {23535#(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 05:57:16,028 INFO L290 TraceCheckUtils]: 28: Hoare triple {23535#(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; {23535#(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 05:57:16,028 INFO L290 TraceCheckUtils]: 29: Hoare triple {23535#(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; {23542#(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 05:57:16,028 INFO L290 TraceCheckUtils]: 30: Hoare triple {23542#(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; {23542#(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 05:57:16,029 INFO L290 TraceCheckUtils]: 31: Hoare triple {23542#(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; {23549#(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_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:57:16,029 INFO L290 TraceCheckUtils]: 32: Hoare triple {23549#(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_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {23549#(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_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:57:16,029 INFO L272 TraceCheckUtils]: 33: Hoare triple {23549#(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_~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)); {23449#true} is VALID [2022-04-28 05:57:16,029 INFO L290 TraceCheckUtils]: 34: Hoare triple {23449#true} ~cond := #in~cond; {23559#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:57:16,030 INFO L290 TraceCheckUtils]: 35: Hoare triple {23559#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {23563#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:57:16,030 INFO L290 TraceCheckUtils]: 36: Hoare triple {23563#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {23563#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:57:16,031 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {23563#(not (= |__VERIFIER_assert_#in~cond| 0))} {23549#(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_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #102#return; {23570#(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_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:57:16,031 INFO L272 TraceCheckUtils]: 38: Hoare triple {23570#(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_~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)); {23449#true} is VALID [2022-04-28 05:57:16,031 INFO L290 TraceCheckUtils]: 39: Hoare triple {23449#true} ~cond := #in~cond; {23559#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:57:16,032 INFO L290 TraceCheckUtils]: 40: Hoare triple {23559#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {23563#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:57:16,032 INFO L290 TraceCheckUtils]: 41: Hoare triple {23563#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {23563#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:57:16,033 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {23563#(not (= |__VERIFIER_assert_#in~cond| 0))} {23570#(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_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #104#return; {23570#(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_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:57:16,033 INFO L272 TraceCheckUtils]: 43: Hoare triple {23570#(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_~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)); {23449#true} is VALID [2022-04-28 05:57:16,033 INFO L290 TraceCheckUtils]: 44: Hoare triple {23449#true} ~cond := #in~cond; {23449#true} is VALID [2022-04-28 05:57:16,033 INFO L290 TraceCheckUtils]: 45: Hoare triple {23449#true} assume !(0 == ~cond); {23449#true} is VALID [2022-04-28 05:57:16,033 INFO L290 TraceCheckUtils]: 46: Hoare triple {23449#true} assume true; {23449#true} is VALID [2022-04-28 05:57:16,033 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {23449#true} {23570#(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_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #106#return; {23570#(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_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:57:16,034 INFO L272 TraceCheckUtils]: 48: Hoare triple {23570#(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_~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)); {23449#true} is VALID [2022-04-28 05:57:16,034 INFO L290 TraceCheckUtils]: 49: Hoare triple {23449#true} ~cond := #in~cond; {23449#true} is VALID [2022-04-28 05:57:16,034 INFO L290 TraceCheckUtils]: 50: Hoare triple {23449#true} assume !(0 == ~cond); {23449#true} is VALID [2022-04-28 05:57:16,034 INFO L290 TraceCheckUtils]: 51: Hoare triple {23449#true} assume true; {23449#true} is VALID [2022-04-28 05:57:16,034 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {23449#true} {23570#(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_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #108#return; {23570#(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_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:57:16,035 INFO L290 TraceCheckUtils]: 53: Hoare triple {23570#(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_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= 2 * ~v~0); {23570#(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_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:57:16,035 INFO L290 TraceCheckUtils]: 54: Hoare triple {23570#(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_~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; {23622#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 05:57:16,036 INFO L290 TraceCheckUtils]: 55: Hoare triple {23622#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} assume !false; {23622#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 05:57:16,036 INFO L290 TraceCheckUtils]: 56: Hoare triple {23622#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {23622#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 05:57:16,036 INFO L290 TraceCheckUtils]: 57: Hoare triple {23622#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= 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; {23632#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} is VALID [2022-04-28 05:57:16,037 INFO L290 TraceCheckUtils]: 58: Hoare triple {23632#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} assume !false; {23632#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} is VALID [2022-04-28 05:57:16,037 INFO L290 TraceCheckUtils]: 59: Hoare triple {23632#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {23639#(and (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} is VALID [2022-04-28 05:57:16,038 INFO L290 TraceCheckUtils]: 60: Hoare triple {23639#(and (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} assume !false; {23639#(and (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} is VALID [2022-04-28 05:57:16,038 INFO L290 TraceCheckUtils]: 61: Hoare triple {23639#(and (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {23646#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} is VALID [2022-04-28 05:57:16,039 INFO L290 TraceCheckUtils]: 62: Hoare triple {23646#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} assume !false; {23646#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} is VALID [2022-04-28 05:57:16,039 INFO L272 TraceCheckUtils]: 63: Hoare triple {23646#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {23449#true} is VALID [2022-04-28 05:57:16,039 INFO L290 TraceCheckUtils]: 64: Hoare triple {23449#true} ~cond := #in~cond; {23559#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:57:16,039 INFO L290 TraceCheckUtils]: 65: Hoare triple {23559#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {23563#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:57:16,039 INFO L290 TraceCheckUtils]: 66: Hoare triple {23563#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {23563#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:57:16,040 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {23563#(not (= |__VERIFIER_assert_#in~cond| 0))} {23646#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~d~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1))} #102#return; {23665#(and (= main_~b~0 main_~v~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 05:57:16,040 INFO L272 TraceCheckUtils]: 68: Hoare triple {23665#(and (= main_~b~0 main_~v~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {23449#true} is VALID [2022-04-28 05:57:16,041 INFO L290 TraceCheckUtils]: 69: Hoare triple {23449#true} ~cond := #in~cond; {23559#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:57:16,041 INFO L290 TraceCheckUtils]: 70: Hoare triple {23559#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {23563#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:57:16,041 INFO L290 TraceCheckUtils]: 71: Hoare triple {23563#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {23563#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:57:16,042 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {23563#(not (= |__VERIFIER_assert_#in~cond| 0))} {23665#(and (= main_~b~0 main_~v~0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #104#return; {23681#(and (= main_~b~0 main_~v~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 05:57:16,042 INFO L272 TraceCheckUtils]: 73: Hoare triple {23681#(and (= main_~b~0 main_~v~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {23449#true} is VALID [2022-04-28 05:57:16,042 INFO L290 TraceCheckUtils]: 74: Hoare triple {23449#true} ~cond := #in~cond; {23449#true} is VALID [2022-04-28 05:57:16,042 INFO L290 TraceCheckUtils]: 75: Hoare triple {23449#true} assume !(0 == ~cond); {23449#true} is VALID [2022-04-28 05:57:16,042 INFO L290 TraceCheckUtils]: 76: Hoare triple {23449#true} assume true; {23449#true} is VALID [2022-04-28 05:57:16,043 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {23449#true} {23681#(and (= main_~b~0 main_~v~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #106#return; {23681#(and (= main_~b~0 main_~v~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 05:57:16,043 INFO L272 TraceCheckUtils]: 78: Hoare triple {23681#(and (= main_~b~0 main_~v~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {23449#true} is VALID [2022-04-28 05:57:16,043 INFO L290 TraceCheckUtils]: 79: Hoare triple {23449#true} ~cond := #in~cond; {23449#true} is VALID [2022-04-28 05:57:16,043 INFO L290 TraceCheckUtils]: 80: Hoare triple {23449#true} assume !(0 == ~cond); {23449#true} is VALID [2022-04-28 05:57:16,043 INFO L290 TraceCheckUtils]: 81: Hoare triple {23449#true} assume true; {23449#true} is VALID [2022-04-28 05:57:16,044 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {23449#true} {23681#(and (= main_~b~0 main_~v~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #108#return; {23681#(and (= main_~b~0 main_~v~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 05:57:16,045 INFO L290 TraceCheckUtils]: 83: Hoare triple {23681#(and (= main_~b~0 main_~v~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !(~c~0 >= 2 * ~v~0); {23681#(and (= main_~b~0 main_~v~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 05:57:16,045 INFO L290 TraceCheckUtils]: 84: Hoare triple {23681#(and (= main_~b~0 main_~v~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {23718#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 05:57:16,046 INFO L290 TraceCheckUtils]: 85: Hoare triple {23718#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~0) (* main_~p~0 main_~x~0))))} assume !false; {23718#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 05:57:16,046 INFO L290 TraceCheckUtils]: 86: Hoare triple {23718#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~0) (* main_~p~0 main_~x~0))))} assume !(~c~0 >= ~b~0); {23718#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 05:57:16,048 INFO L290 TraceCheckUtils]: 87: Hoare triple {23718#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= main_~x~0 (+ main_~b~0 main_~y~0)) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~0) (* main_~p~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; {23728#(and (= (+ main_~s~0 main_~r~0) 1) (= main_~b~0 (+ (* (+ main_~s~0 main_~r~0) main_~y~0) (* (- 1) (* main_~p~0 main_~x~0)) (* (- 1) (* main_~y~0 main_~r~0)))) (= (+ (* main_~y~0 main_~r~0) main_~y~0 (* main_~p~0 main_~x~0)) main_~x~0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-28 05:57:16,049 INFO L290 TraceCheckUtils]: 88: Hoare triple {23728#(and (= (+ main_~s~0 main_~r~0) 1) (= main_~b~0 (+ (* (+ main_~s~0 main_~r~0) main_~y~0) (* (- 1) (* main_~p~0 main_~x~0)) (* (- 1) (* main_~y~0 main_~r~0)))) (= (+ (* main_~y~0 main_~r~0) main_~y~0 (* main_~p~0 main_~x~0)) main_~x~0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} assume !false; {23728#(and (= (+ main_~s~0 main_~r~0) 1) (= main_~b~0 (+ (* (+ main_~s~0 main_~r~0) main_~y~0) (* (- 1) (* main_~p~0 main_~x~0)) (* (- 1) (* main_~y~0 main_~r~0)))) (= (+ (* main_~y~0 main_~r~0) main_~y~0 (* main_~p~0 main_~x~0)) main_~x~0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-28 05:57:16,049 INFO L290 TraceCheckUtils]: 89: Hoare triple {23728#(and (= (+ main_~s~0 main_~r~0) 1) (= main_~b~0 (+ (* (+ main_~s~0 main_~r~0) main_~y~0) (* (- 1) (* main_~p~0 main_~x~0)) (* (- 1) (* main_~y~0 main_~r~0)))) (= (+ (* main_~y~0 main_~r~0) main_~y~0 (* main_~p~0 main_~x~0)) main_~x~0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {23728#(and (= (+ main_~s~0 main_~r~0) 1) (= main_~b~0 (+ (* (+ main_~s~0 main_~r~0) main_~y~0) (* (- 1) (* main_~p~0 main_~x~0)) (* (- 1) (* main_~y~0 main_~r~0)))) (= (+ (* main_~y~0 main_~r~0) main_~y~0 (* main_~p~0 main_~x~0)) main_~x~0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-28 05:57:16,050 INFO L290 TraceCheckUtils]: 90: Hoare triple {23728#(and (= (+ main_~s~0 main_~r~0) 1) (= main_~b~0 (+ (* (+ main_~s~0 main_~r~0) main_~y~0) (* (- 1) (* main_~p~0 main_~x~0)) (* (- 1) (* main_~y~0 main_~r~0)))) (= (+ (* main_~y~0 main_~r~0) main_~y~0 (* main_~p~0 main_~x~0)) main_~x~0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} assume !false; {23728#(and (= (+ main_~s~0 main_~r~0) 1) (= main_~b~0 (+ (* (+ main_~s~0 main_~r~0) main_~y~0) (* (- 1) (* main_~p~0 main_~x~0)) (* (- 1) (* main_~y~0 main_~r~0)))) (= (+ (* main_~y~0 main_~r~0) main_~y~0 (* main_~p~0 main_~x~0)) main_~x~0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-28 05:57:16,050 INFO L290 TraceCheckUtils]: 91: Hoare triple {23728#(and (= (+ main_~s~0 main_~r~0) 1) (= main_~b~0 (+ (* (+ main_~s~0 main_~r~0) main_~y~0) (* (- 1) (* main_~p~0 main_~x~0)) (* (- 1) (* main_~y~0 main_~r~0)))) (= (+ (* main_~y~0 main_~r~0) main_~y~0 (* main_~p~0 main_~x~0)) main_~x~0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {23728#(and (= (+ main_~s~0 main_~r~0) 1) (= main_~b~0 (+ (* (+ main_~s~0 main_~r~0) main_~y~0) (* (- 1) (* main_~p~0 main_~x~0)) (* (- 1) (* main_~y~0 main_~r~0)))) (= (+ (* main_~y~0 main_~r~0) main_~y~0 (* main_~p~0 main_~x~0)) main_~x~0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-28 05:57:16,051 INFO L290 TraceCheckUtils]: 92: Hoare triple {23728#(and (= (+ main_~s~0 main_~r~0) 1) (= main_~b~0 (+ (* (+ main_~s~0 main_~r~0) main_~y~0) (* (- 1) (* main_~p~0 main_~x~0)) (* (- 1) (* main_~y~0 main_~r~0)))) (= (+ (* main_~y~0 main_~r~0) main_~y~0 (* main_~p~0 main_~x~0)) main_~x~0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} assume !false; {23728#(and (= (+ main_~s~0 main_~r~0) 1) (= main_~b~0 (+ (* (+ main_~s~0 main_~r~0) main_~y~0) (* (- 1) (* main_~p~0 main_~x~0)) (* (- 1) (* main_~y~0 main_~r~0)))) (= (+ (* main_~y~0 main_~r~0) main_~y~0 (* main_~p~0 main_~x~0)) main_~x~0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-28 05:57:16,051 INFO L272 TraceCheckUtils]: 93: Hoare triple {23728#(and (= (+ main_~s~0 main_~r~0) 1) (= main_~b~0 (+ (* (+ main_~s~0 main_~r~0) main_~y~0) (* (- 1) (* main_~p~0 main_~x~0)) (* (- 1) (* main_~y~0 main_~r~0)))) (= (+ (* main_~y~0 main_~r~0) main_~y~0 (* main_~p~0 main_~x~0)) main_~x~0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {23449#true} is VALID [2022-04-28 05:57:16,051 INFO L290 TraceCheckUtils]: 94: Hoare triple {23449#true} ~cond := #in~cond; {23559#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:57:16,051 INFO L290 TraceCheckUtils]: 95: Hoare triple {23559#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {23563#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:57:16,052 INFO L290 TraceCheckUtils]: 96: Hoare triple {23563#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {23563#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:57:16,053 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {23563#(not (= |__VERIFIER_assert_#in~cond| 0))} {23728#(and (= (+ main_~s~0 main_~r~0) 1) (= main_~b~0 (+ (* (+ main_~s~0 main_~r~0) main_~y~0) (* (- 1) (* main_~p~0 main_~x~0)) (* (- 1) (* main_~y~0 main_~r~0)))) (= (+ (* main_~y~0 main_~r~0) main_~y~0 (* main_~p~0 main_~x~0)) main_~x~0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} #102#return; {23759#(and (= (* (- 1) main_~q~0) 1) (= (+ main_~b~0 (* main_~x~0 (* (- 1) main_~q~0))) (* main_~y~0 main_~s~0)) (= main_~x~0 (+ main_~y~0 (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} is VALID [2022-04-28 05:57:16,054 INFO L272 TraceCheckUtils]: 98: Hoare triple {23759#(and (= (* (- 1) main_~q~0) 1) (= (+ main_~b~0 (* main_~x~0 (* (- 1) main_~q~0))) (* main_~y~0 main_~s~0)) (= main_~x~0 (+ main_~y~0 (* main_~x~0 (* (- 1) main_~q~0)) (* main_~y~0 (+ (* (- 1) main_~s~0) 1)))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {23763#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:57:16,055 INFO L290 TraceCheckUtils]: 99: Hoare triple {23763#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {23767#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:57:16,056 INFO L290 TraceCheckUtils]: 100: Hoare triple {23767#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {23450#false} is VALID [2022-04-28 05:57:16,056 INFO L290 TraceCheckUtils]: 101: Hoare triple {23450#false} assume !false; {23450#false} is VALID [2022-04-28 05:57:16,056 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 37 proven. 81 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-04-28 05:57:16,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:58:13,881 INFO L290 TraceCheckUtils]: 101: Hoare triple {23450#false} assume !false; {23450#false} is VALID [2022-04-28 05:58:13,882 INFO L290 TraceCheckUtils]: 100: Hoare triple {23767#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {23450#false} is VALID [2022-04-28 05:58:13,882 INFO L290 TraceCheckUtils]: 99: Hoare triple {23763#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {23767#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:58:13,883 INFO L272 TraceCheckUtils]: 98: Hoare triple {23783#(= 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)); {23763#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:58:13,883 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {23563#(not (= |__VERIFIER_assert_#in~cond| 0))} {23787#(or (= main_~b~0 (+ (* 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)))))} #102#return; {23783#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:58:13,884 INFO L290 TraceCheckUtils]: 96: Hoare triple {23563#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {23563#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:58:13,884 INFO L290 TraceCheckUtils]: 95: Hoare triple {23797#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {23563#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:58:13,884 INFO L290 TraceCheckUtils]: 94: Hoare triple {23449#true} ~cond := #in~cond; {23797#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 05:58:13,884 INFO L272 TraceCheckUtils]: 93: Hoare triple {23787#(or (= main_~b~0 (+ (* 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)))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {23449#true} is VALID [2022-04-28 05:58:13,885 INFO L290 TraceCheckUtils]: 92: Hoare triple {23787#(or (= main_~b~0 (+ (* 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)))))} assume !false; {23787#(or (= main_~b~0 (+ (* 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)))))} is VALID [2022-04-28 05:58:13,886 INFO L290 TraceCheckUtils]: 91: Hoare triple {23787#(or (= main_~b~0 (+ (* 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)))))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {23787#(or (= main_~b~0 (+ (* 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)))))} is VALID [2022-04-28 05:58:13,886 INFO L290 TraceCheckUtils]: 90: Hoare triple {23787#(or (= main_~b~0 (+ (* 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)))))} assume !false; {23787#(or (= main_~b~0 (+ (* 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)))))} is VALID [2022-04-28 05:58:13,887 INFO L290 TraceCheckUtils]: 89: Hoare triple {23787#(or (= main_~b~0 (+ (* 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)))))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {23787#(or (= main_~b~0 (+ (* 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)))))} is VALID [2022-04-28 05:58:13,887 INFO L290 TraceCheckUtils]: 88: Hoare triple {23787#(or (= main_~b~0 (+ (* 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)))))} assume !false; {23787#(or (= main_~b~0 (+ (* 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)))))} is VALID [2022-04-28 05:58:13,938 INFO L290 TraceCheckUtils]: 87: Hoare triple {23819#(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) (not (= 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; {23787#(or (= main_~b~0 (+ (* 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)))))} is VALID [2022-04-28 05:58:13,939 INFO L290 TraceCheckUtils]: 86: Hoare triple {23819#(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) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !(~c~0 >= ~b~0); {23819#(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) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-28 05:58:13,939 INFO L290 TraceCheckUtils]: 85: Hoare triple {23819#(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) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !false; {23819#(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) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-28 05:58:13,944 INFO L290 TraceCheckUtils]: 84: Hoare triple {23829#(or (= (+ main_~c~0 (* (- 1) main_~v~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))) (not (= main_~b~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; {23819#(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) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-28 05:58:13,945 INFO L290 TraceCheckUtils]: 83: Hoare triple {23829#(or (= (+ main_~c~0 (* (- 1) main_~v~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))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !(~c~0 >= 2 * ~v~0); {23829#(or (= (+ main_~c~0 (* (- 1) main_~v~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))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-28 05:58:13,945 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {23449#true} {23829#(or (= (+ main_~c~0 (* (- 1) main_~v~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))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #108#return; {23829#(or (= (+ main_~c~0 (* (- 1) main_~v~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))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-28 05:58:13,946 INFO L290 TraceCheckUtils]: 81: Hoare triple {23449#true} assume true; {23449#true} is VALID [2022-04-28 05:58:13,946 INFO L290 TraceCheckUtils]: 80: Hoare triple {23449#true} assume !(0 == ~cond); {23449#true} is VALID [2022-04-28 05:58:13,946 INFO L290 TraceCheckUtils]: 79: Hoare triple {23449#true} ~cond := #in~cond; {23449#true} is VALID [2022-04-28 05:58:13,946 INFO L272 TraceCheckUtils]: 78: Hoare triple {23829#(or (= (+ main_~c~0 (* (- 1) main_~v~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))) (not (= main_~b~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)); {23449#true} is VALID [2022-04-28 05:58:13,946 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {23449#true} {23829#(or (= (+ main_~c~0 (* (- 1) main_~v~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))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #106#return; {23829#(or (= (+ main_~c~0 (* (- 1) main_~v~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))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-28 05:58:13,947 INFO L290 TraceCheckUtils]: 76: Hoare triple {23449#true} assume true; {23449#true} is VALID [2022-04-28 05:58:13,947 INFO L290 TraceCheckUtils]: 75: Hoare triple {23449#true} assume !(0 == ~cond); {23449#true} is VALID [2022-04-28 05:58:13,947 INFO L290 TraceCheckUtils]: 74: Hoare triple {23449#true} ~cond := #in~cond; {23449#true} is VALID [2022-04-28 05:58:13,947 INFO L272 TraceCheckUtils]: 73: Hoare triple {23829#(or (= (+ main_~c~0 (* (- 1) main_~v~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))) (not (= main_~b~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)); {23449#true} is VALID [2022-04-28 05:58:13,947 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {23449#true} {23829#(or (= (+ main_~c~0 (* (- 1) main_~v~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))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #104#return; {23829#(or (= (+ main_~c~0 (* (- 1) main_~v~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))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-28 05:58:13,947 INFO L290 TraceCheckUtils]: 71: Hoare triple {23449#true} assume true; {23449#true} is VALID [2022-04-28 05:58:13,948 INFO L290 TraceCheckUtils]: 70: Hoare triple {23449#true} assume !(0 == ~cond); {23449#true} is VALID [2022-04-28 05:58:13,948 INFO L290 TraceCheckUtils]: 69: Hoare triple {23449#true} ~cond := #in~cond; {23449#true} is VALID [2022-04-28 05:58:13,948 INFO L272 TraceCheckUtils]: 68: Hoare triple {23829#(or (= (+ main_~c~0 (* (- 1) main_~v~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))) (not (= 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)); {23449#true} is VALID [2022-04-28 05:58:13,949 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {23563#(not (= |__VERIFIER_assert_#in~cond| 0))} {23881#(or (= (+ main_~c~0 (* (- 1) main_~v~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))) (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)))))} #102#return; {23829#(or (= (+ main_~c~0 (* (- 1) main_~v~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))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-28 05:58:13,949 INFO L290 TraceCheckUtils]: 66: Hoare triple {23563#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {23563#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:58:13,949 INFO L290 TraceCheckUtils]: 65: Hoare triple {23797#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {23563#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:58:13,950 INFO L290 TraceCheckUtils]: 64: Hoare triple {23449#true} ~cond := #in~cond; {23797#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 05:58:13,950 INFO L272 TraceCheckUtils]: 63: Hoare triple {23881#(or (= (+ main_~c~0 (* (- 1) main_~v~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))) (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)))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {23449#true} is VALID [2022-04-28 05:58:13,950 INFO L290 TraceCheckUtils]: 62: Hoare triple {23881#(or (= (+ main_~c~0 (* (- 1) main_~v~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))) (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)))))} assume !false; {23881#(or (= (+ main_~c~0 (* (- 1) main_~v~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))) (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)))))} is VALID [2022-04-28 05:58:13,951 INFO L290 TraceCheckUtils]: 61: Hoare triple {23900#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~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)))))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {23881#(or (= (+ main_~c~0 (* (- 1) main_~v~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))) (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)))))} is VALID [2022-04-28 05:58:13,951 INFO L290 TraceCheckUtils]: 60: Hoare triple {23900#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~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)))))} assume !false; {23900#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~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)))))} is VALID [2022-04-28 05:58:13,953 INFO L290 TraceCheckUtils]: 59: Hoare triple {23449#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {23900#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~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)))))} is VALID [2022-04-28 05:58:13,953 INFO L290 TraceCheckUtils]: 58: Hoare triple {23449#true} assume !false; {23449#true} is VALID [2022-04-28 05:58:13,953 INFO L290 TraceCheckUtils]: 57: Hoare triple {23449#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; {23449#true} is VALID [2022-04-28 05:58:13,953 INFO L290 TraceCheckUtils]: 56: Hoare triple {23449#true} assume !(~c~0 >= ~b~0); {23449#true} is VALID [2022-04-28 05:58:13,953 INFO L290 TraceCheckUtils]: 55: Hoare triple {23449#true} assume !false; {23449#true} is VALID [2022-04-28 05:58:13,953 INFO L290 TraceCheckUtils]: 54: Hoare triple {23449#true} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {23449#true} is VALID [2022-04-28 05:58:13,953 INFO L290 TraceCheckUtils]: 53: Hoare triple {23449#true} assume !(~c~0 >= 2 * ~v~0); {23449#true} is VALID [2022-04-28 05:58:13,953 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {23449#true} {23449#true} #108#return; {23449#true} is VALID [2022-04-28 05:58:13,953 INFO L290 TraceCheckUtils]: 51: Hoare triple {23449#true} assume true; {23449#true} is VALID [2022-04-28 05:58:13,953 INFO L290 TraceCheckUtils]: 50: Hoare triple {23449#true} assume !(0 == ~cond); {23449#true} is VALID [2022-04-28 05:58:13,953 INFO L290 TraceCheckUtils]: 49: Hoare triple {23449#true} ~cond := #in~cond; {23449#true} is VALID [2022-04-28 05:58:13,953 INFO L272 TraceCheckUtils]: 48: Hoare triple {23449#true} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {23449#true} is VALID [2022-04-28 05:58:13,953 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {23449#true} {23449#true} #106#return; {23449#true} is VALID [2022-04-28 05:58:13,953 INFO L290 TraceCheckUtils]: 46: Hoare triple {23449#true} assume true; {23449#true} is VALID [2022-04-28 05:58:13,953 INFO L290 TraceCheckUtils]: 45: Hoare triple {23449#true} assume !(0 == ~cond); {23449#true} is VALID [2022-04-28 05:58:13,953 INFO L290 TraceCheckUtils]: 44: Hoare triple {23449#true} ~cond := #in~cond; {23449#true} is VALID [2022-04-28 05:58:13,954 INFO L272 TraceCheckUtils]: 43: Hoare triple {23449#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {23449#true} is VALID [2022-04-28 05:58:13,954 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {23449#true} {23449#true} #104#return; {23449#true} is VALID [2022-04-28 05:58:13,954 INFO L290 TraceCheckUtils]: 41: Hoare triple {23449#true} assume true; {23449#true} is VALID [2022-04-28 05:58:13,954 INFO L290 TraceCheckUtils]: 40: Hoare triple {23449#true} assume !(0 == ~cond); {23449#true} is VALID [2022-04-28 05:58:13,954 INFO L290 TraceCheckUtils]: 39: Hoare triple {23449#true} ~cond := #in~cond; {23449#true} is VALID [2022-04-28 05:58:13,954 INFO L272 TraceCheckUtils]: 38: Hoare triple {23449#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {23449#true} is VALID [2022-04-28 05:58:13,954 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {23449#true} {23449#true} #102#return; {23449#true} is VALID [2022-04-28 05:58:13,954 INFO L290 TraceCheckUtils]: 36: Hoare triple {23449#true} assume true; {23449#true} is VALID [2022-04-28 05:58:13,954 INFO L290 TraceCheckUtils]: 35: Hoare triple {23449#true} assume !(0 == ~cond); {23449#true} is VALID [2022-04-28 05:58:13,954 INFO L290 TraceCheckUtils]: 34: Hoare triple {23449#true} ~cond := #in~cond; {23449#true} is VALID [2022-04-28 05:58:13,954 INFO L272 TraceCheckUtils]: 33: Hoare triple {23449#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {23449#true} is VALID [2022-04-28 05:58:13,954 INFO L290 TraceCheckUtils]: 32: Hoare triple {23449#true} assume !false; {23449#true} is VALID [2022-04-28 05:58:13,954 INFO L290 TraceCheckUtils]: 31: Hoare triple {23449#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {23449#true} is VALID [2022-04-28 05:58:13,955 INFO L290 TraceCheckUtils]: 30: Hoare triple {23449#true} assume !false; {23449#true} is VALID [2022-04-28 05:58:13,955 INFO L290 TraceCheckUtils]: 29: Hoare triple {23449#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {23449#true} is VALID [2022-04-28 05:58:13,955 INFO L290 TraceCheckUtils]: 28: Hoare triple {23449#true} assume !false; {23449#true} is VALID [2022-04-28 05:58:13,955 INFO L290 TraceCheckUtils]: 27: Hoare triple {23449#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {23449#true} is VALID [2022-04-28 05:58:13,955 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {23449#true} {23449#true} #100#return; {23449#true} is VALID [2022-04-28 05:58:13,955 INFO L290 TraceCheckUtils]: 25: Hoare triple {23449#true} assume true; {23449#true} is VALID [2022-04-28 05:58:13,955 INFO L290 TraceCheckUtils]: 24: Hoare triple {23449#true} assume !(0 == ~cond); {23449#true} is VALID [2022-04-28 05:58:13,955 INFO L290 TraceCheckUtils]: 23: Hoare triple {23449#true} ~cond := #in~cond; {23449#true} is VALID [2022-04-28 05:58:13,955 INFO L272 TraceCheckUtils]: 22: Hoare triple {23449#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {23449#true} is VALID [2022-04-28 05:58:13,955 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {23449#true} {23449#true} #98#return; {23449#true} is VALID [2022-04-28 05:58:13,955 INFO L290 TraceCheckUtils]: 20: Hoare triple {23449#true} assume true; {23449#true} is VALID [2022-04-28 05:58:13,955 INFO L290 TraceCheckUtils]: 19: Hoare triple {23449#true} assume !(0 == ~cond); {23449#true} is VALID [2022-04-28 05:58:13,955 INFO L290 TraceCheckUtils]: 18: Hoare triple {23449#true} ~cond := #in~cond; {23449#true} is VALID [2022-04-28 05:58:13,955 INFO L272 TraceCheckUtils]: 17: Hoare triple {23449#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {23449#true} is VALID [2022-04-28 05:58:13,955 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {23449#true} {23449#true} #96#return; {23449#true} is VALID [2022-04-28 05:58:13,955 INFO L290 TraceCheckUtils]: 15: Hoare triple {23449#true} assume true; {23449#true} is VALID [2022-04-28 05:58:13,956 INFO L290 TraceCheckUtils]: 14: Hoare triple {23449#true} assume !(0 == ~cond); {23449#true} is VALID [2022-04-28 05:58:13,956 INFO L290 TraceCheckUtils]: 13: Hoare triple {23449#true} ~cond := #in~cond; {23449#true} is VALID [2022-04-28 05:58:13,956 INFO L272 TraceCheckUtils]: 12: Hoare triple {23449#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {23449#true} is VALID [2022-04-28 05:58:13,956 INFO L290 TraceCheckUtils]: 11: Hoare triple {23449#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {23449#true} is VALID [2022-04-28 05:58:13,956 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23449#true} {23449#true} #94#return; {23449#true} is VALID [2022-04-28 05:58:13,956 INFO L290 TraceCheckUtils]: 9: Hoare triple {23449#true} assume true; {23449#true} is VALID [2022-04-28 05:58:13,956 INFO L290 TraceCheckUtils]: 8: Hoare triple {23449#true} assume !(0 == ~cond); {23449#true} is VALID [2022-04-28 05:58:13,956 INFO L290 TraceCheckUtils]: 7: Hoare triple {23449#true} ~cond := #in~cond; {23449#true} is VALID [2022-04-28 05:58:13,956 INFO L272 TraceCheckUtils]: 6: Hoare triple {23449#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {23449#true} is VALID [2022-04-28 05:58:13,956 INFO L290 TraceCheckUtils]: 5: Hoare triple {23449#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; {23449#true} is VALID [2022-04-28 05:58:13,956 INFO L272 TraceCheckUtils]: 4: Hoare triple {23449#true} call #t~ret6 := main(); {23449#true} is VALID [2022-04-28 05:58:13,956 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23449#true} {23449#true} #112#return; {23449#true} is VALID [2022-04-28 05:58:13,956 INFO L290 TraceCheckUtils]: 2: Hoare triple {23449#true} assume true; {23449#true} is VALID [2022-04-28 05:58:13,956 INFO L290 TraceCheckUtils]: 1: Hoare triple {23449#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); {23449#true} is VALID [2022-04-28 05:58:13,956 INFO L272 TraceCheckUtils]: 0: Hoare triple {23449#true} call ULTIMATE.init(); {23449#true} is VALID [2022-04-28 05:58:13,957 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 78 proven. 18 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-04-28 05:58:13,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:58:13,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775387789] [2022-04-28 05:58:13,957 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:58:13,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102073853] [2022-04-28 05:58:13,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102073853] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:58:13,957 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:58:13,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12] total 26 [2022-04-28 05:58:13,957 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:58:13,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [786123469] [2022-04-28 05:58:13,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [786123469] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:58:13,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:58:13,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 05:58:13,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557553845] [2022-04-28 05:58:13,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:58:13,958 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 16 states have internal predecessors, (42), 8 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14) Word has length 102 [2022-04-28 05:58:13,958 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:58:13,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 16 states have internal predecessors, (42), 8 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-28 05:58:14,035 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:14,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 05:58:14,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:14,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 05:58:14,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=544, Unknown=0, NotChecked=0, Total=650 [2022-04-28 05:58:14,036 INFO L87 Difference]: Start difference. First operand 399 states and 558 transitions. Second operand has 19 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 16 states have internal predecessors, (42), 8 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-28 05:58:19,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:19,070 INFO L93 Difference]: Finished difference Result 474 states and 649 transitions. [2022-04-28 05:58:19,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 05:58:19,070 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 16 states have internal predecessors, (42), 8 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14) Word has length 102 [2022-04-28 05:58:19,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:58:19,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 16 states have internal predecessors, (42), 8 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-28 05:58:19,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 163 transitions. [2022-04-28 05:58:19,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 16 states have internal predecessors, (42), 8 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-28 05:58:19,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 163 transitions. [2022-04-28 05:58:19,075 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 163 transitions. [2022-04-28 05:58:19,322 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:19,340 INFO L225 Difference]: With dead ends: 474 [2022-04-28 05:58:19,340 INFO L226 Difference]: Without dead ends: 472 [2022-04-28 05:58:19,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 176 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=146, Invalid=784, Unknown=0, NotChecked=0, Total=930 [2022-04-28 05:58:19,341 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 63 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 1133 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-28 05:58:19,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 472 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1133 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-28 05:58:19,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2022-04-28 05:58:20,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 454. [2022-04-28 05:58:20,709 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:58:20,709 INFO L82 GeneralOperation]: Start isEquivalent. First operand 472 states. Second operand has 454 states, 262 states have (on average 1.1946564885496183) internal successors, (313), 263 states have internal predecessors, (313), 159 states have call successors, (159), 33 states have call predecessors, (159), 32 states have return successors, (157), 157 states have call predecessors, (157), 157 states have call successors, (157) [2022-04-28 05:58:20,710 INFO L74 IsIncluded]: Start isIncluded. First operand 472 states. Second operand has 454 states, 262 states have (on average 1.1946564885496183) internal successors, (313), 263 states have internal predecessors, (313), 159 states have call successors, (159), 33 states have call predecessors, (159), 32 states have return successors, (157), 157 states have call predecessors, (157), 157 states have call successors, (157) [2022-04-28 05:58:20,711 INFO L87 Difference]: Start difference. First operand 472 states. Second operand has 454 states, 262 states have (on average 1.1946564885496183) internal successors, (313), 263 states have internal predecessors, (313), 159 states have call successors, (159), 33 states have call predecessors, (159), 32 states have return successors, (157), 157 states have call predecessors, (157), 157 states have call successors, (157) [2022-04-28 05:58:20,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:20,728 INFO L93 Difference]: Finished difference Result 472 states and 647 transitions. [2022-04-28 05:58:20,728 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 647 transitions. [2022-04-28 05:58:20,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:20,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:20,730 INFO L74 IsIncluded]: Start isIncluded. First operand has 454 states, 262 states have (on average 1.1946564885496183) internal successors, (313), 263 states have internal predecessors, (313), 159 states have call successors, (159), 33 states have call predecessors, (159), 32 states have return successors, (157), 157 states have call predecessors, (157), 157 states have call successors, (157) Second operand 472 states. [2022-04-28 05:58:20,731 INFO L87 Difference]: Start difference. First operand has 454 states, 262 states have (on average 1.1946564885496183) internal successors, (313), 263 states have internal predecessors, (313), 159 states have call successors, (159), 33 states have call predecessors, (159), 32 states have return successors, (157), 157 states have call predecessors, (157), 157 states have call successors, (157) Second operand 472 states. [2022-04-28 05:58:20,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:58:20,747 INFO L93 Difference]: Finished difference Result 472 states and 647 transitions. [2022-04-28 05:58:20,747 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 647 transitions. [2022-04-28 05:58:20,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:58:20,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:58:20,748 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:58:20,748 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:58:20,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 262 states have (on average 1.1946564885496183) internal successors, (313), 263 states have internal predecessors, (313), 159 states have call successors, (159), 33 states have call predecessors, (159), 32 states have return successors, (157), 157 states have call predecessors, (157), 157 states have call successors, (157) [2022-04-28 05:58:20,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 629 transitions. [2022-04-28 05:58:20,769 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 629 transitions. Word has length 102 [2022-04-28 05:58:20,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:58:20,769 INFO L495 AbstractCegarLoop]: Abstraction has 454 states and 629 transitions. [2022-04-28 05:58:20,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 16 states have internal predecessors, (42), 8 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-28 05:58:20,769 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 454 states and 629 transitions. [2022-04-28 05:58:22,388 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 629 edges. 629 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:58:22,388 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 629 transitions. [2022-04-28 05:58:22,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-04-28 05:58:22,389 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:58:22,389 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 05:58:22,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-04-28 05:58:22,590 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 05:58:22,590 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:58:22,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:58:22,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1948981098, now seen corresponding path program 5 times [2022-04-28 05:58:22,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:58:22,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1301506193] [2022-04-28 05:58:22,591 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:58:22,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1948981098, now seen corresponding path program 6 times [2022-04-28 05:58:22,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:58:22,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528172990] [2022-04-28 05:58:22,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:58:22,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:58:22,602 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:58:22,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1409851444] [2022-04-28 05:58:22,602 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 05:58:22,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:58:22,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:58:22,603 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 05:58:22,612 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 05:58:22,673 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 05:58:22,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:58:22,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 58 conjunts are in the unsatisfiable core [2022-04-28 05:58:22,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:58:22,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:58:43,043 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 05:58:43,402 INFO L272 TraceCheckUtils]: 0: Hoare triple {26896#true} call ULTIMATE.init(); {26896#true} is VALID [2022-04-28 05:58:43,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {26896#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); {26896#true} is VALID [2022-04-28 05:58:43,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {26896#true} assume true; {26896#true} is VALID [2022-04-28 05:58:43,402 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26896#true} {26896#true} #112#return; {26896#true} is VALID [2022-04-28 05:58:43,402 INFO L272 TraceCheckUtils]: 4: Hoare triple {26896#true} call #t~ret6 := main(); {26896#true} is VALID [2022-04-28 05:58:43,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {26896#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; {26896#true} is VALID [2022-04-28 05:58:43,402 INFO L272 TraceCheckUtils]: 6: Hoare triple {26896#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {26896#true} is VALID [2022-04-28 05:58:43,402 INFO L290 TraceCheckUtils]: 7: Hoare triple {26896#true} ~cond := #in~cond; {26896#true} is VALID [2022-04-28 05:58:43,402 INFO L290 TraceCheckUtils]: 8: Hoare triple {26896#true} assume !(0 == ~cond); {26896#true} is VALID [2022-04-28 05:58:43,402 INFO L290 TraceCheckUtils]: 9: Hoare triple {26896#true} assume true; {26896#true} is VALID [2022-04-28 05:58:43,402 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {26896#true} {26896#true} #94#return; {26896#true} is VALID [2022-04-28 05:58:43,402 INFO L290 TraceCheckUtils]: 11: Hoare triple {26896#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {26896#true} is VALID [2022-04-28 05:58:43,402 INFO L272 TraceCheckUtils]: 12: Hoare triple {26896#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {26896#true} is VALID [2022-04-28 05:58:43,402 INFO L290 TraceCheckUtils]: 13: Hoare triple {26896#true} ~cond := #in~cond; {26896#true} is VALID [2022-04-28 05:58:43,402 INFO L290 TraceCheckUtils]: 14: Hoare triple {26896#true} assume !(0 == ~cond); {26896#true} is VALID [2022-04-28 05:58:43,403 INFO L290 TraceCheckUtils]: 15: Hoare triple {26896#true} assume true; {26896#true} is VALID [2022-04-28 05:58:43,403 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {26896#true} {26896#true} #96#return; {26896#true} is VALID [2022-04-28 05:58:43,403 INFO L272 TraceCheckUtils]: 17: Hoare triple {26896#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {26896#true} is VALID [2022-04-28 05:58:43,403 INFO L290 TraceCheckUtils]: 18: Hoare triple {26896#true} ~cond := #in~cond; {26896#true} is VALID [2022-04-28 05:58:43,403 INFO L290 TraceCheckUtils]: 19: Hoare triple {26896#true} assume !(0 == ~cond); {26896#true} is VALID [2022-04-28 05:58:43,403 INFO L290 TraceCheckUtils]: 20: Hoare triple {26896#true} assume true; {26896#true} is VALID [2022-04-28 05:58:43,403 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {26896#true} {26896#true} #98#return; {26896#true} is VALID [2022-04-28 05:58:43,403 INFO L272 TraceCheckUtils]: 22: Hoare triple {26896#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {26896#true} is VALID [2022-04-28 05:58:43,403 INFO L290 TraceCheckUtils]: 23: Hoare triple {26896#true} ~cond := #in~cond; {26896#true} is VALID [2022-04-28 05:58:43,403 INFO L290 TraceCheckUtils]: 24: Hoare triple {26896#true} assume !(0 == ~cond); {26896#true} is VALID [2022-04-28 05:58:43,403 INFO L290 TraceCheckUtils]: 25: Hoare triple {26896#true} assume true; {26896#true} is VALID [2022-04-28 05:58:43,403 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {26896#true} {26896#true} #100#return; {26896#true} is VALID [2022-04-28 05:58:43,403 INFO L290 TraceCheckUtils]: 27: Hoare triple {26896#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {26982#(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 05:58:43,404 INFO L290 TraceCheckUtils]: 28: Hoare triple {26982#(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; {26982#(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 05:58:43,404 INFO L290 TraceCheckUtils]: 29: Hoare triple {26982#(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; {26989#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:58:43,405 INFO L290 TraceCheckUtils]: 30: Hoare triple {26989#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !false; {26989#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:58:43,405 INFO L290 TraceCheckUtils]: 31: Hoare triple {26989#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~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; {26989#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:58:43,405 INFO L290 TraceCheckUtils]: 32: Hoare triple {26989#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !false; {26989#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:58:43,405 INFO L272 TraceCheckUtils]: 33: Hoare triple {26989#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~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)); {26896#true} is VALID [2022-04-28 05:58:43,406 INFO L290 TraceCheckUtils]: 34: Hoare triple {26896#true} ~cond := #in~cond; {26896#true} is VALID [2022-04-28 05:58:43,406 INFO L290 TraceCheckUtils]: 35: Hoare triple {26896#true} assume !(0 == ~cond); {26896#true} is VALID [2022-04-28 05:58:43,406 INFO L290 TraceCheckUtils]: 36: Hoare triple {26896#true} assume true; {26896#true} is VALID [2022-04-28 05:58:43,406 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {26896#true} {26989#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #102#return; {26989#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:58:43,406 INFO L272 TraceCheckUtils]: 38: Hoare triple {26989#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= 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)); {26896#true} is VALID [2022-04-28 05:58:43,407 INFO L290 TraceCheckUtils]: 39: Hoare triple {26896#true} ~cond := #in~cond; {27020#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:58:43,407 INFO L290 TraceCheckUtils]: 40: Hoare triple {27020#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {27024#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:58:43,407 INFO L290 TraceCheckUtils]: 41: Hoare triple {27024#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {27024#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:58:43,408 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {27024#(not (= |__VERIFIER_assert_#in~cond| 0))} {26989#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #104#return; {26989#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:58:43,408 INFO L272 TraceCheckUtils]: 43: Hoare triple {26989#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= 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)); {26896#true} is VALID [2022-04-28 05:58:43,408 INFO L290 TraceCheckUtils]: 44: Hoare triple {26896#true} ~cond := #in~cond; {26896#true} is VALID [2022-04-28 05:58:43,408 INFO L290 TraceCheckUtils]: 45: Hoare triple {26896#true} assume !(0 == ~cond); {26896#true} is VALID [2022-04-28 05:58:43,408 INFO L290 TraceCheckUtils]: 46: Hoare triple {26896#true} assume true; {26896#true} is VALID [2022-04-28 05:58:43,409 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {26896#true} {26989#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #106#return; {26989#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:58:43,409 INFO L272 TraceCheckUtils]: 48: Hoare triple {26989#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= 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)); {26896#true} is VALID [2022-04-28 05:58:43,409 INFO L290 TraceCheckUtils]: 49: Hoare triple {26896#true} ~cond := #in~cond; {26896#true} is VALID [2022-04-28 05:58:43,409 INFO L290 TraceCheckUtils]: 50: Hoare triple {26896#true} assume !(0 == ~cond); {26896#true} is VALID [2022-04-28 05:58:43,409 INFO L290 TraceCheckUtils]: 51: Hoare triple {26896#true} assume true; {26896#true} is VALID [2022-04-28 05:58:43,410 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {26896#true} {26989#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #108#return; {26989#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:58:43,410 INFO L290 TraceCheckUtils]: 53: Hoare triple {26989#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {26989#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:58:43,411 INFO L290 TraceCheckUtils]: 54: Hoare triple {26989#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !false; {26989#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:58:43,411 INFO L272 TraceCheckUtils]: 55: Hoare triple {26989#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~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)); {26896#true} is VALID [2022-04-28 05:58:43,411 INFO L290 TraceCheckUtils]: 56: Hoare triple {26896#true} ~cond := #in~cond; {26896#true} is VALID [2022-04-28 05:58:43,411 INFO L290 TraceCheckUtils]: 57: Hoare triple {26896#true} assume !(0 == ~cond); {26896#true} is VALID [2022-04-28 05:58:43,411 INFO L290 TraceCheckUtils]: 58: Hoare triple {26896#true} assume true; {26896#true} is VALID [2022-04-28 05:58:43,411 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {26896#true} {26989#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #102#return; {26989#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:58:43,412 INFO L272 TraceCheckUtils]: 60: Hoare triple {26989#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= 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)); {26896#true} is VALID [2022-04-28 05:58:43,412 INFO L290 TraceCheckUtils]: 61: Hoare triple {26896#true} ~cond := #in~cond; {26896#true} is VALID [2022-04-28 05:58:43,412 INFO L290 TraceCheckUtils]: 62: Hoare triple {26896#true} assume !(0 == ~cond); {26896#true} is VALID [2022-04-28 05:58:43,412 INFO L290 TraceCheckUtils]: 63: Hoare triple {26896#true} assume true; {26896#true} is VALID [2022-04-28 05:58:43,412 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {26896#true} {26989#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #104#return; {26989#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:58:43,412 INFO L272 TraceCheckUtils]: 65: Hoare triple {26989#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= 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)); {26896#true} is VALID [2022-04-28 05:58:43,412 INFO L290 TraceCheckUtils]: 66: Hoare triple {26896#true} ~cond := #in~cond; {26896#true} is VALID [2022-04-28 05:58:43,413 INFO L290 TraceCheckUtils]: 67: Hoare triple {26896#true} assume !(0 == ~cond); {26896#true} is VALID [2022-04-28 05:58:43,413 INFO L290 TraceCheckUtils]: 68: Hoare triple {26896#true} assume true; {26896#true} is VALID [2022-04-28 05:58:43,413 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {26896#true} {26989#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #106#return; {26989#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:58:43,413 INFO L272 TraceCheckUtils]: 70: Hoare triple {26989#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= 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)); {26896#true} is VALID [2022-04-28 05:58:43,413 INFO L290 TraceCheckUtils]: 71: Hoare triple {26896#true} ~cond := #in~cond; {26896#true} is VALID [2022-04-28 05:58:43,413 INFO L290 TraceCheckUtils]: 72: Hoare triple {26896#true} assume !(0 == ~cond); {26896#true} is VALID [2022-04-28 05:58:43,413 INFO L290 TraceCheckUtils]: 73: Hoare triple {26896#true} assume true; {26896#true} is VALID [2022-04-28 05:58:43,414 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {26896#true} {26989#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #108#return; {26989#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:58:43,415 INFO L290 TraceCheckUtils]: 75: Hoare triple {26989#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {26989#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:58:43,415 INFO L290 TraceCheckUtils]: 76: Hoare triple {26989#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !false; {26989#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:58:43,415 INFO L272 TraceCheckUtils]: 77: Hoare triple {26989#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~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)); {26896#true} is VALID [2022-04-28 05:58:43,415 INFO L290 TraceCheckUtils]: 78: Hoare triple {26896#true} ~cond := #in~cond; {26896#true} is VALID [2022-04-28 05:58:43,415 INFO L290 TraceCheckUtils]: 79: Hoare triple {26896#true} assume !(0 == ~cond); {26896#true} is VALID [2022-04-28 05:58:43,415 INFO L290 TraceCheckUtils]: 80: Hoare triple {26896#true} assume true; {26896#true} is VALID [2022-04-28 05:58:43,416 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {26896#true} {26989#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #102#return; {26989#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:58:43,416 INFO L272 TraceCheckUtils]: 82: Hoare triple {26989#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= 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)); {26896#true} is VALID [2022-04-28 05:58:43,416 INFO L290 TraceCheckUtils]: 83: Hoare triple {26896#true} ~cond := #in~cond; {26896#true} is VALID [2022-04-28 05:58:43,416 INFO L290 TraceCheckUtils]: 84: Hoare triple {26896#true} assume !(0 == ~cond); {26896#true} is VALID [2022-04-28 05:58:43,416 INFO L290 TraceCheckUtils]: 85: Hoare triple {26896#true} assume true; {26896#true} is VALID [2022-04-28 05:58:43,417 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {26896#true} {26989#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #104#return; {26989#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:58:43,417 INFO L272 TraceCheckUtils]: 87: Hoare triple {26989#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= 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)); {26896#true} is VALID [2022-04-28 05:58:43,417 INFO L290 TraceCheckUtils]: 88: Hoare triple {26896#true} ~cond := #in~cond; {26896#true} is VALID [2022-04-28 05:58:43,417 INFO L290 TraceCheckUtils]: 89: Hoare triple {26896#true} assume !(0 == ~cond); {26896#true} is VALID [2022-04-28 05:58:43,417 INFO L290 TraceCheckUtils]: 90: Hoare triple {26896#true} assume true; {26896#true} is VALID [2022-04-28 05:58:43,418 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {26896#true} {26989#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #106#return; {26989#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:58:43,418 INFO L272 TraceCheckUtils]: 92: Hoare triple {26989#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= 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)); {26896#true} is VALID [2022-04-28 05:58:43,418 INFO L290 TraceCheckUtils]: 93: Hoare triple {26896#true} ~cond := #in~cond; {27020#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:58:43,418 INFO L290 TraceCheckUtils]: 94: Hoare triple {27020#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {27024#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:58:43,419 INFO L290 TraceCheckUtils]: 95: Hoare triple {27024#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {27024#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:58:43,420 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {27024#(not (= |__VERIFIER_assert_#in~cond| 0))} {26989#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #108#return; {27193#(and (= main_~v~0 (* main_~d~0 main_~b~0)) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:58:43,420 INFO L290 TraceCheckUtils]: 97: Hoare triple {27193#(and (= main_~v~0 (* main_~d~0 main_~b~0)) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= 2 * ~v~0); {27197#(and (= main_~v~0 (* main_~d~0 main_~b~0)) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (not (<= (* main_~v~0 2) main_~c~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:58:43,423 INFO L290 TraceCheckUtils]: 98: Hoare triple {27197#(and (= main_~v~0 (* main_~d~0 main_~b~0)) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (not (<= (* main_~v~0 2) main_~c~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {27201#(and (= main_~r~0 0) (= (+ (* (- 1) main_~c~0) main_~x~0) (* main_~b~0 main_~k~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (not (<= main_~x~0 (* main_~c~0 2))) (= main_~p~0 1))} is VALID [2022-04-28 05:58:43,424 INFO L290 TraceCheckUtils]: 99: Hoare triple {27201#(and (= main_~r~0 0) (= (+ (* (- 1) main_~c~0) main_~x~0) (* main_~b~0 main_~k~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (not (<= main_~x~0 (* main_~c~0 2))) (= main_~p~0 1))} assume !false; {27201#(and (= main_~r~0 0) (= (+ (* (- 1) main_~c~0) main_~x~0) (* main_~b~0 main_~k~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (not (<= main_~x~0 (* main_~c~0 2))) (= main_~p~0 1))} is VALID [2022-04-28 05:58:43,424 INFO L290 TraceCheckUtils]: 100: Hoare triple {27201#(and (= main_~r~0 0) (= (+ (* (- 1) main_~c~0) main_~x~0) (* main_~b~0 main_~k~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (not (<= main_~x~0 (* main_~c~0 2))) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {27201#(and (= main_~r~0 0) (= (+ (* (- 1) main_~c~0) main_~x~0) (* main_~b~0 main_~k~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (not (<= main_~x~0 (* main_~c~0 2))) (= main_~p~0 1))} is VALID [2022-04-28 05:58:43,426 INFO L290 TraceCheckUtils]: 101: Hoare triple {27201#(and (= main_~r~0 0) (= (+ (* (- 1) main_~c~0) main_~x~0) (* main_~b~0 main_~k~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (not (<= main_~x~0 (* main_~c~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; {27211#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (< main_~x~0 (* (* main_~y~0 (div (* (- 1) main_~s~0) main_~r~0)) 2)) (= main_~q~0 1) (= (+ (* main_~y~0 (div (* (- 1) main_~s~0) main_~r~0)) main_~b~0) main_~x~0))} is VALID [2022-04-28 05:58:43,427 INFO L290 TraceCheckUtils]: 102: Hoare triple {27211#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (< main_~x~0 (* (* main_~y~0 (div (* (- 1) main_~s~0) main_~r~0)) 2)) (= main_~q~0 1) (= (+ (* main_~y~0 (div (* (- 1) main_~s~0) main_~r~0)) main_~b~0) main_~x~0))} assume !false; {27211#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (< main_~x~0 (* (* main_~y~0 (div (* (- 1) main_~s~0) main_~r~0)) 2)) (= main_~q~0 1) (= (+ (* main_~y~0 (div (* (- 1) main_~s~0) main_~r~0)) main_~b~0) main_~x~0))} is VALID [2022-04-28 05:58:43,427 INFO L290 TraceCheckUtils]: 103: Hoare triple {27211#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (< main_~x~0 (* (* main_~y~0 (div (* (- 1) main_~s~0) main_~r~0)) 2)) (= main_~q~0 1) (= (+ (* main_~y~0 (div (* (- 1) main_~s~0) main_~r~0)) main_~b~0) main_~x~0))} assume !(0 != ~b~0); {27218#(and (= main_~p~0 0) (= (* main_~y~0 (div (* (- 1) main_~s~0) main_~r~0)) main_~x~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (< main_~x~0 (* (* main_~y~0 (div (* (- 1) main_~s~0) main_~r~0)) 2)) (= main_~q~0 1))} is VALID [2022-04-28 05:58:43,430 INFO L272 TraceCheckUtils]: 104: Hoare triple {27218#(and (= main_~p~0 0) (= (* main_~y~0 (div (* (- 1) main_~s~0) main_~r~0)) main_~x~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (< main_~x~0 (* (* main_~y~0 (div (* (- 1) main_~s~0) main_~r~0)) 2)) (= main_~q~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)); {27222#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:58:43,430 INFO L290 TraceCheckUtils]: 105: Hoare triple {27222#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {27226#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:58:43,431 INFO L290 TraceCheckUtils]: 106: Hoare triple {27226#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {26897#false} is VALID [2022-04-28 05:58:43,431 INFO L290 TraceCheckUtils]: 107: Hoare triple {26897#false} assume !false; {26897#false} is VALID [2022-04-28 05:58:43,431 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 57 proven. 33 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2022-04-28 05:58:43,431 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:59:03,777 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 06:03:32,797 WARN L855 $PredicateComparison]: unable to prove that (and (not (= |c___VERIFIER_assert_#in~cond| 0)) (or (not (= |c___VERIFIER_assert_#in~cond| 1)) (forall ((v_main_~s~0_BEFORE_CALL_97 Int) (v_main_~x~0_BEFORE_CALL_119 Int) (v_main_~y~0_BEFORE_CALL_118 Int) (v_main_~k~0_BEFORE_CALL_78 Int) (v_main_~r~0_BEFORE_CALL_88 Int) (v_main_~b~0_BEFORE_CALL_125 Int) (v_main_~q~0_BEFORE_CALL_99 Int) (v_main_~p~0_BEFORE_CALL_88 Int) (v_main_~d~0_BEFORE_CALL_81 Int)) (let ((.cse0 (* v_main_~d~0_BEFORE_CALL_81 v_main_~b~0_BEFORE_CALL_125))) (or (<= .cse0 0) (= (+ (* v_main_~y~0_BEFORE_CALL_118 v_main_~k~0_BEFORE_CALL_78 v_main_~s~0_BEFORE_CALL_97) (* v_main_~q~0_BEFORE_CALL_99 v_main_~d~0_BEFORE_CALL_81 v_main_~x~0_BEFORE_CALL_119) (* v_main_~d~0_BEFORE_CALL_81 v_main_~y~0_BEFORE_CALL_118 v_main_~s~0_BEFORE_CALL_97) (* v_main_~q~0_BEFORE_CALL_99 v_main_~x~0_BEFORE_CALL_119) (* v_main_~q~0_BEFORE_CALL_99 v_main_~x~0_BEFORE_CALL_119 v_main_~k~0_BEFORE_CALL_78) (* v_main_~y~0_BEFORE_CALL_118 v_main_~s~0_BEFORE_CALL_97)) (+ (* v_main_~r~0_BEFORE_CALL_88 v_main_~y~0_BEFORE_CALL_118) (* v_main_~p~0_BEFORE_CALL_88 v_main_~x~0_BEFORE_CALL_119) v_main_~b~0_BEFORE_CALL_125)) (= 0 (mod .cse0 v_main_~b~0_BEFORE_CALL_125))))))) is different from true [2022-04-28 06:04:24,838 WARN L855 $PredicateComparison]: unable to prove that (or (= c___VERIFIER_assert_~cond 0) (and (not (= |c___VERIFIER_assert_#in~cond| 0)) (or (not (= |c___VERIFIER_assert_#in~cond| 1)) (forall ((v_main_~s~0_BEFORE_CALL_97 Int) (v_main_~x~0_BEFORE_CALL_119 Int) (v_main_~y~0_BEFORE_CALL_118 Int) (v_main_~k~0_BEFORE_CALL_78 Int) (v_main_~r~0_BEFORE_CALL_88 Int) (v_main_~b~0_BEFORE_CALL_125 Int) (v_main_~q~0_BEFORE_CALL_99 Int) (v_main_~p~0_BEFORE_CALL_88 Int) (v_main_~d~0_BEFORE_CALL_81 Int)) (let ((.cse0 (* v_main_~d~0_BEFORE_CALL_81 v_main_~b~0_BEFORE_CALL_125))) (or (<= .cse0 0) (= (+ (* v_main_~y~0_BEFORE_CALL_118 v_main_~k~0_BEFORE_CALL_78 v_main_~s~0_BEFORE_CALL_97) (* v_main_~q~0_BEFORE_CALL_99 v_main_~d~0_BEFORE_CALL_81 v_main_~x~0_BEFORE_CALL_119) (* v_main_~d~0_BEFORE_CALL_81 v_main_~y~0_BEFORE_CALL_118 v_main_~s~0_BEFORE_CALL_97) (* v_main_~q~0_BEFORE_CALL_99 v_main_~x~0_BEFORE_CALL_119) (* v_main_~q~0_BEFORE_CALL_99 v_main_~x~0_BEFORE_CALL_119 v_main_~k~0_BEFORE_CALL_78) (* v_main_~y~0_BEFORE_CALL_118 v_main_~s~0_BEFORE_CALL_97)) (+ (* v_main_~r~0_BEFORE_CALL_88 v_main_~y~0_BEFORE_CALL_118) (* v_main_~p~0_BEFORE_CALL_88 v_main_~x~0_BEFORE_CALL_119) v_main_~b~0_BEFORE_CALL_125)) (= 0 (mod .cse0 v_main_~b~0_BEFORE_CALL_125)))))))) is different from true [2022-04-28 06:04:51,883 WARN L855 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 1)) (forall ((v_main_~s~0_BEFORE_CALL_97 Int) (v_main_~x~0_BEFORE_CALL_119 Int) (v_main_~y~0_BEFORE_CALL_118 Int) (v_main_~k~0_BEFORE_CALL_78 Int) (v_main_~r~0_BEFORE_CALL_88 Int) (v_main_~b~0_BEFORE_CALL_125 Int) (v_main_~q~0_BEFORE_CALL_99 Int) (v_main_~p~0_BEFORE_CALL_88 Int) (v_main_~d~0_BEFORE_CALL_81 Int)) (let ((.cse0 (* v_main_~d~0_BEFORE_CALL_81 v_main_~b~0_BEFORE_CALL_125))) (or (<= .cse0 0) (= (+ (* v_main_~y~0_BEFORE_CALL_118 v_main_~k~0_BEFORE_CALL_78 v_main_~s~0_BEFORE_CALL_97) (* v_main_~q~0_BEFORE_CALL_99 v_main_~d~0_BEFORE_CALL_81 v_main_~x~0_BEFORE_CALL_119) (* v_main_~d~0_BEFORE_CALL_81 v_main_~y~0_BEFORE_CALL_118 v_main_~s~0_BEFORE_CALL_97) (* v_main_~q~0_BEFORE_CALL_99 v_main_~x~0_BEFORE_CALL_119) (* v_main_~q~0_BEFORE_CALL_99 v_main_~x~0_BEFORE_CALL_119 v_main_~k~0_BEFORE_CALL_78) (* v_main_~y~0_BEFORE_CALL_118 v_main_~s~0_BEFORE_CALL_97)) (+ (* v_main_~r~0_BEFORE_CALL_88 v_main_~y~0_BEFORE_CALL_118) (* v_main_~p~0_BEFORE_CALL_88 v_main_~x~0_BEFORE_CALL_119) v_main_~b~0_BEFORE_CALL_125)) (= 0 (mod .cse0 v_main_~b~0_BEFORE_CALL_125)))))) is different from true [2022-04-28 06:05:34,928 INFO L290 TraceCheckUtils]: 107: Hoare triple {26897#false} assume !false; {26897#false} is VALID [2022-04-28 06:05:34,930 INFO L290 TraceCheckUtils]: 106: Hoare triple {27226#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {26897#false} is VALID [2022-04-28 06:05:34,930 INFO L290 TraceCheckUtils]: 105: Hoare triple {27222#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {27226#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:05:34,931 INFO L272 TraceCheckUtils]: 104: Hoare triple {27242#(= (+ (* 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)); {27222#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 06:05:34,932 INFO L290 TraceCheckUtils]: 103: Hoare triple {27246#(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); {27242#(= (+ (* 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 06:05:34,932 INFO L290 TraceCheckUtils]: 102: Hoare triple {27246#(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; {27246#(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 06:05:35,086 INFO L290 TraceCheckUtils]: 101: Hoare triple {27253#(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; {27246#(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 06:05:35,087 INFO L290 TraceCheckUtils]: 100: Hoare triple {27253#(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); {27253#(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 06:05:35,087 INFO L290 TraceCheckUtils]: 99: Hoare triple {27253#(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; {27253#(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 06:05:35,109 INFO L290 TraceCheckUtils]: 98: Hoare triple {27263#(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; {27253#(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 06:05:35,110 INFO L290 TraceCheckUtils]: 97: Hoare triple {27267#(or (<= (* main_~v~0 2) 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); {27263#(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 06:05:37,115 WARN L284 TraceCheckUtils]: 96: Hoare quadruple {27275#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (or (not (= |__VERIFIER_assert_#in~cond| 1)) (forall ((v_main_~s~0_BEFORE_CALL_97 Int) (v_main_~x~0_BEFORE_CALL_119 Int) (v_main_~y~0_BEFORE_CALL_118 Int) (v_main_~k~0_BEFORE_CALL_78 Int) (v_main_~r~0_BEFORE_CALL_88 Int) (v_main_~b~0_BEFORE_CALL_125 Int) (v_main_~q~0_BEFORE_CALL_99 Int) (v_main_~p~0_BEFORE_CALL_88 Int) (v_main_~d~0_BEFORE_CALL_81 Int)) (or (<= (* v_main_~d~0_BEFORE_CALL_81 v_main_~b~0_BEFORE_CALL_125) 0) (= (+ (* v_main_~y~0_BEFORE_CALL_118 v_main_~k~0_BEFORE_CALL_78 v_main_~s~0_BEFORE_CALL_97) (* v_main_~q~0_BEFORE_CALL_99 v_main_~d~0_BEFORE_CALL_81 v_main_~x~0_BEFORE_CALL_119) (* v_main_~d~0_BEFORE_CALL_81 v_main_~y~0_BEFORE_CALL_118 v_main_~s~0_BEFORE_CALL_97) (* v_main_~q~0_BEFORE_CALL_99 v_main_~x~0_BEFORE_CALL_119) (* v_main_~q~0_BEFORE_CALL_99 v_main_~x~0_BEFORE_CALL_119 v_main_~k~0_BEFORE_CALL_78) (* v_main_~y~0_BEFORE_CALL_118 v_main_~s~0_BEFORE_CALL_97)) (+ (* v_main_~r~0_BEFORE_CALL_88 v_main_~y~0_BEFORE_CALL_118) (* v_main_~p~0_BEFORE_CALL_88 v_main_~x~0_BEFORE_CALL_119) v_main_~b~0_BEFORE_CALL_125)) (= 0 (mod (* v_main_~d~0_BEFORE_CALL_81 v_main_~b~0_BEFORE_CALL_125) v_main_~b~0_BEFORE_CALL_125))))))} {27271#(or (not (= (mod main_~c~0 main_~b~0) 0)) (= main_~b~0 0) (= (+ (* main_~x~0 (+ (* (- 1) main_~q~0 (+ main_~k~0 (div main_~c~0 main_~b~0))) main_~p~0)) main_~b~0 (* (+ main_~r~0 (* (- 1) (* main_~s~0 (+ main_~k~0 (div main_~c~0 main_~b~0))))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~c~0 0))} #108#return; {27267#(or (<= (* main_~v~0 2) 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 06:05:37,116 INFO L290 TraceCheckUtils]: 95: Hoare triple {27275#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (or (not (= |__VERIFIER_assert_#in~cond| 1)) (forall ((v_main_~s~0_BEFORE_CALL_97 Int) (v_main_~x~0_BEFORE_CALL_119 Int) (v_main_~y~0_BEFORE_CALL_118 Int) (v_main_~k~0_BEFORE_CALL_78 Int) (v_main_~r~0_BEFORE_CALL_88 Int) (v_main_~b~0_BEFORE_CALL_125 Int) (v_main_~q~0_BEFORE_CALL_99 Int) (v_main_~p~0_BEFORE_CALL_88 Int) (v_main_~d~0_BEFORE_CALL_81 Int)) (or (<= (* v_main_~d~0_BEFORE_CALL_81 v_main_~b~0_BEFORE_CALL_125) 0) (= (+ (* v_main_~y~0_BEFORE_CALL_118 v_main_~k~0_BEFORE_CALL_78 v_main_~s~0_BEFORE_CALL_97) (* v_main_~q~0_BEFORE_CALL_99 v_main_~d~0_BEFORE_CALL_81 v_main_~x~0_BEFORE_CALL_119) (* v_main_~d~0_BEFORE_CALL_81 v_main_~y~0_BEFORE_CALL_118 v_main_~s~0_BEFORE_CALL_97) (* v_main_~q~0_BEFORE_CALL_99 v_main_~x~0_BEFORE_CALL_119) (* v_main_~q~0_BEFORE_CALL_99 v_main_~x~0_BEFORE_CALL_119 v_main_~k~0_BEFORE_CALL_78) (* v_main_~y~0_BEFORE_CALL_118 v_main_~s~0_BEFORE_CALL_97)) (+ (* v_main_~r~0_BEFORE_CALL_88 v_main_~y~0_BEFORE_CALL_118) (* v_main_~p~0_BEFORE_CALL_88 v_main_~x~0_BEFORE_CALL_119) v_main_~b~0_BEFORE_CALL_125)) (= 0 (mod (* v_main_~d~0_BEFORE_CALL_81 v_main_~b~0_BEFORE_CALL_125) v_main_~b~0_BEFORE_CALL_125))))))} assume true; {27275#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (or (not (= |__VERIFIER_assert_#in~cond| 1)) (forall ((v_main_~s~0_BEFORE_CALL_97 Int) (v_main_~x~0_BEFORE_CALL_119 Int) (v_main_~y~0_BEFORE_CALL_118 Int) (v_main_~k~0_BEFORE_CALL_78 Int) (v_main_~r~0_BEFORE_CALL_88 Int) (v_main_~b~0_BEFORE_CALL_125 Int) (v_main_~q~0_BEFORE_CALL_99 Int) (v_main_~p~0_BEFORE_CALL_88 Int) (v_main_~d~0_BEFORE_CALL_81 Int)) (or (<= (* v_main_~d~0_BEFORE_CALL_81 v_main_~b~0_BEFORE_CALL_125) 0) (= (+ (* v_main_~y~0_BEFORE_CALL_118 v_main_~k~0_BEFORE_CALL_78 v_main_~s~0_BEFORE_CALL_97) (* v_main_~q~0_BEFORE_CALL_99 v_main_~d~0_BEFORE_CALL_81 v_main_~x~0_BEFORE_CALL_119) (* v_main_~d~0_BEFORE_CALL_81 v_main_~y~0_BEFORE_CALL_118 v_main_~s~0_BEFORE_CALL_97) (* v_main_~q~0_BEFORE_CALL_99 v_main_~x~0_BEFORE_CALL_119) (* v_main_~q~0_BEFORE_CALL_99 v_main_~x~0_BEFORE_CALL_119 v_main_~k~0_BEFORE_CALL_78) (* v_main_~y~0_BEFORE_CALL_118 v_main_~s~0_BEFORE_CALL_97)) (+ (* v_main_~r~0_BEFORE_CALL_88 v_main_~y~0_BEFORE_CALL_118) (* v_main_~p~0_BEFORE_CALL_88 v_main_~x~0_BEFORE_CALL_119) v_main_~b~0_BEFORE_CALL_125)) (= 0 (mod (* v_main_~d~0_BEFORE_CALL_81 v_main_~b~0_BEFORE_CALL_125) v_main_~b~0_BEFORE_CALL_125))))))} is VALID [2022-04-28 06:05:37,117 INFO L290 TraceCheckUtils]: 94: Hoare triple {27282#(or (= __VERIFIER_assert_~cond 0) (and (not (= |__VERIFIER_assert_#in~cond| 0)) (or (not (= |__VERIFIER_assert_#in~cond| 1)) (forall ((v_main_~s~0_BEFORE_CALL_97 Int) (v_main_~x~0_BEFORE_CALL_119 Int) (v_main_~y~0_BEFORE_CALL_118 Int) (v_main_~k~0_BEFORE_CALL_78 Int) (v_main_~r~0_BEFORE_CALL_88 Int) (v_main_~b~0_BEFORE_CALL_125 Int) (v_main_~q~0_BEFORE_CALL_99 Int) (v_main_~p~0_BEFORE_CALL_88 Int) (v_main_~d~0_BEFORE_CALL_81 Int)) (or (<= (* v_main_~d~0_BEFORE_CALL_81 v_main_~b~0_BEFORE_CALL_125) 0) (= (+ (* v_main_~y~0_BEFORE_CALL_118 v_main_~k~0_BEFORE_CALL_78 v_main_~s~0_BEFORE_CALL_97) (* v_main_~q~0_BEFORE_CALL_99 v_main_~d~0_BEFORE_CALL_81 v_main_~x~0_BEFORE_CALL_119) (* v_main_~d~0_BEFORE_CALL_81 v_main_~y~0_BEFORE_CALL_118 v_main_~s~0_BEFORE_CALL_97) (* v_main_~q~0_BEFORE_CALL_99 v_main_~x~0_BEFORE_CALL_119) (* v_main_~q~0_BEFORE_CALL_99 v_main_~x~0_BEFORE_CALL_119 v_main_~k~0_BEFORE_CALL_78) (* v_main_~y~0_BEFORE_CALL_118 v_main_~s~0_BEFORE_CALL_97)) (+ (* v_main_~r~0_BEFORE_CALL_88 v_main_~y~0_BEFORE_CALL_118) (* v_main_~p~0_BEFORE_CALL_88 v_main_~x~0_BEFORE_CALL_119) v_main_~b~0_BEFORE_CALL_125)) (= 0 (mod (* v_main_~d~0_BEFORE_CALL_81 v_main_~b~0_BEFORE_CALL_125) v_main_~b~0_BEFORE_CALL_125)))))))} assume !(0 == ~cond); {27275#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (or (not (= |__VERIFIER_assert_#in~cond| 1)) (forall ((v_main_~s~0_BEFORE_CALL_97 Int) (v_main_~x~0_BEFORE_CALL_119 Int) (v_main_~y~0_BEFORE_CALL_118 Int) (v_main_~k~0_BEFORE_CALL_78 Int) (v_main_~r~0_BEFORE_CALL_88 Int) (v_main_~b~0_BEFORE_CALL_125 Int) (v_main_~q~0_BEFORE_CALL_99 Int) (v_main_~p~0_BEFORE_CALL_88 Int) (v_main_~d~0_BEFORE_CALL_81 Int)) (or (<= (* v_main_~d~0_BEFORE_CALL_81 v_main_~b~0_BEFORE_CALL_125) 0) (= (+ (* v_main_~y~0_BEFORE_CALL_118 v_main_~k~0_BEFORE_CALL_78 v_main_~s~0_BEFORE_CALL_97) (* v_main_~q~0_BEFORE_CALL_99 v_main_~d~0_BEFORE_CALL_81 v_main_~x~0_BEFORE_CALL_119) (* v_main_~d~0_BEFORE_CALL_81 v_main_~y~0_BEFORE_CALL_118 v_main_~s~0_BEFORE_CALL_97) (* v_main_~q~0_BEFORE_CALL_99 v_main_~x~0_BEFORE_CALL_119) (* v_main_~q~0_BEFORE_CALL_99 v_main_~x~0_BEFORE_CALL_119 v_main_~k~0_BEFORE_CALL_78) (* v_main_~y~0_BEFORE_CALL_118 v_main_~s~0_BEFORE_CALL_97)) (+ (* v_main_~r~0_BEFORE_CALL_88 v_main_~y~0_BEFORE_CALL_118) (* v_main_~p~0_BEFORE_CALL_88 v_main_~x~0_BEFORE_CALL_119) v_main_~b~0_BEFORE_CALL_125)) (= 0 (mod (* v_main_~d~0_BEFORE_CALL_81 v_main_~b~0_BEFORE_CALL_125) v_main_~b~0_BEFORE_CALL_125))))))} is VALID [2022-04-28 06:05:37,117 INFO L290 TraceCheckUtils]: 93: Hoare triple {27286#(or (not (= |__VERIFIER_assert_#in~cond| 1)) (forall ((v_main_~s~0_BEFORE_CALL_97 Int) (v_main_~x~0_BEFORE_CALL_119 Int) (v_main_~y~0_BEFORE_CALL_118 Int) (v_main_~k~0_BEFORE_CALL_78 Int) (v_main_~r~0_BEFORE_CALL_88 Int) (v_main_~b~0_BEFORE_CALL_125 Int) (v_main_~q~0_BEFORE_CALL_99 Int) (v_main_~p~0_BEFORE_CALL_88 Int) (v_main_~d~0_BEFORE_CALL_81 Int)) (or (<= (* v_main_~d~0_BEFORE_CALL_81 v_main_~b~0_BEFORE_CALL_125) 0) (= (+ (* v_main_~y~0_BEFORE_CALL_118 v_main_~k~0_BEFORE_CALL_78 v_main_~s~0_BEFORE_CALL_97) (* v_main_~q~0_BEFORE_CALL_99 v_main_~d~0_BEFORE_CALL_81 v_main_~x~0_BEFORE_CALL_119) (* v_main_~d~0_BEFORE_CALL_81 v_main_~y~0_BEFORE_CALL_118 v_main_~s~0_BEFORE_CALL_97) (* v_main_~q~0_BEFORE_CALL_99 v_main_~x~0_BEFORE_CALL_119) (* v_main_~q~0_BEFORE_CALL_99 v_main_~x~0_BEFORE_CALL_119 v_main_~k~0_BEFORE_CALL_78) (* v_main_~y~0_BEFORE_CALL_118 v_main_~s~0_BEFORE_CALL_97)) (+ (* v_main_~r~0_BEFORE_CALL_88 v_main_~y~0_BEFORE_CALL_118) (* v_main_~p~0_BEFORE_CALL_88 v_main_~x~0_BEFORE_CALL_119) v_main_~b~0_BEFORE_CALL_125)) (= 0 (mod (* v_main_~d~0_BEFORE_CALL_81 v_main_~b~0_BEFORE_CALL_125) v_main_~b~0_BEFORE_CALL_125)))))} ~cond := #in~cond; {27282#(or (= __VERIFIER_assert_~cond 0) (and (not (= |__VERIFIER_assert_#in~cond| 0)) (or (not (= |__VERIFIER_assert_#in~cond| 1)) (forall ((v_main_~s~0_BEFORE_CALL_97 Int) (v_main_~x~0_BEFORE_CALL_119 Int) (v_main_~y~0_BEFORE_CALL_118 Int) (v_main_~k~0_BEFORE_CALL_78 Int) (v_main_~r~0_BEFORE_CALL_88 Int) (v_main_~b~0_BEFORE_CALL_125 Int) (v_main_~q~0_BEFORE_CALL_99 Int) (v_main_~p~0_BEFORE_CALL_88 Int) (v_main_~d~0_BEFORE_CALL_81 Int)) (or (<= (* v_main_~d~0_BEFORE_CALL_81 v_main_~b~0_BEFORE_CALL_125) 0) (= (+ (* v_main_~y~0_BEFORE_CALL_118 v_main_~k~0_BEFORE_CALL_78 v_main_~s~0_BEFORE_CALL_97) (* v_main_~q~0_BEFORE_CALL_99 v_main_~d~0_BEFORE_CALL_81 v_main_~x~0_BEFORE_CALL_119) (* v_main_~d~0_BEFORE_CALL_81 v_main_~y~0_BEFORE_CALL_118 v_main_~s~0_BEFORE_CALL_97) (* v_main_~q~0_BEFORE_CALL_99 v_main_~x~0_BEFORE_CALL_119) (* v_main_~q~0_BEFORE_CALL_99 v_main_~x~0_BEFORE_CALL_119 v_main_~k~0_BEFORE_CALL_78) (* v_main_~y~0_BEFORE_CALL_118 v_main_~s~0_BEFORE_CALL_97)) (+ (* v_main_~r~0_BEFORE_CALL_88 v_main_~y~0_BEFORE_CALL_118) (* v_main_~p~0_BEFORE_CALL_88 v_main_~x~0_BEFORE_CALL_119) v_main_~b~0_BEFORE_CALL_125)) (= 0 (mod (* v_main_~d~0_BEFORE_CALL_81 v_main_~b~0_BEFORE_CALL_125) v_main_~b~0_BEFORE_CALL_125)))))))} is VALID [2022-04-28 06:05:39,121 WARN L272 TraceCheckUtils]: 92: Hoare triple {27271#(or (not (= (mod main_~c~0 main_~b~0) 0)) (= main_~b~0 0) (= (+ (* main_~x~0 (+ (* (- 1) main_~q~0 (+ main_~k~0 (div main_~c~0 main_~b~0))) main_~p~0)) main_~b~0 (* (+ main_~r~0 (* (- 1) (* main_~s~0 (+ main_~k~0 (div main_~c~0 main_~b~0))))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~c~0 0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {27286#(or (not (= |__VERIFIER_assert_#in~cond| 1)) (forall ((v_main_~s~0_BEFORE_CALL_97 Int) (v_main_~x~0_BEFORE_CALL_119 Int) (v_main_~y~0_BEFORE_CALL_118 Int) (v_main_~k~0_BEFORE_CALL_78 Int) (v_main_~r~0_BEFORE_CALL_88 Int) (v_main_~b~0_BEFORE_CALL_125 Int) (v_main_~q~0_BEFORE_CALL_99 Int) (v_main_~p~0_BEFORE_CALL_88 Int) (v_main_~d~0_BEFORE_CALL_81 Int)) (or (<= (* v_main_~d~0_BEFORE_CALL_81 v_main_~b~0_BEFORE_CALL_125) 0) (= (+ (* v_main_~y~0_BEFORE_CALL_118 v_main_~k~0_BEFORE_CALL_78 v_main_~s~0_BEFORE_CALL_97) (* v_main_~q~0_BEFORE_CALL_99 v_main_~d~0_BEFORE_CALL_81 v_main_~x~0_BEFORE_CALL_119) (* v_main_~d~0_BEFORE_CALL_81 v_main_~y~0_BEFORE_CALL_118 v_main_~s~0_BEFORE_CALL_97) (* v_main_~q~0_BEFORE_CALL_99 v_main_~x~0_BEFORE_CALL_119) (* v_main_~q~0_BEFORE_CALL_99 v_main_~x~0_BEFORE_CALL_119 v_main_~k~0_BEFORE_CALL_78) (* v_main_~y~0_BEFORE_CALL_118 v_main_~s~0_BEFORE_CALL_97)) (+ (* v_main_~r~0_BEFORE_CALL_88 v_main_~y~0_BEFORE_CALL_118) (* v_main_~p~0_BEFORE_CALL_88 v_main_~x~0_BEFORE_CALL_119) v_main_~b~0_BEFORE_CALL_125)) (= 0 (mod (* v_main_~d~0_BEFORE_CALL_81 v_main_~b~0_BEFORE_CALL_125) v_main_~b~0_BEFORE_CALL_125)))))} is UNKNOWN [2022-04-28 06:05:39,135 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {26896#true} {27271#(or (not (= (mod main_~c~0 main_~b~0) 0)) (= main_~b~0 0) (= (+ (* main_~x~0 (+ (* (- 1) main_~q~0 (+ main_~k~0 (div main_~c~0 main_~b~0))) main_~p~0)) main_~b~0 (* (+ main_~r~0 (* (- 1) (* main_~s~0 (+ main_~k~0 (div main_~c~0 main_~b~0))))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~c~0 0))} #106#return; {27271#(or (not (= (mod main_~c~0 main_~b~0) 0)) (= main_~b~0 0) (= (+ (* main_~x~0 (+ (* (- 1) main_~q~0 (+ main_~k~0 (div main_~c~0 main_~b~0))) main_~p~0)) main_~b~0 (* (+ main_~r~0 (* (- 1) (* main_~s~0 (+ main_~k~0 (div main_~c~0 main_~b~0))))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~c~0 0))} is VALID [2022-04-28 06:05:39,135 INFO L290 TraceCheckUtils]: 90: Hoare triple {26896#true} assume true; {26896#true} is VALID [2022-04-28 06:05:39,136 INFO L290 TraceCheckUtils]: 89: Hoare triple {26896#true} assume !(0 == ~cond); {26896#true} is VALID [2022-04-28 06:05:39,136 INFO L290 TraceCheckUtils]: 88: Hoare triple {26896#true} ~cond := #in~cond; {26896#true} is VALID [2022-04-28 06:05:39,136 INFO L272 TraceCheckUtils]: 87: Hoare triple {27271#(or (not (= (mod main_~c~0 main_~b~0) 0)) (= main_~b~0 0) (= (+ (* main_~x~0 (+ (* (- 1) main_~q~0 (+ main_~k~0 (div main_~c~0 main_~b~0))) main_~p~0)) main_~b~0 (* (+ main_~r~0 (* (- 1) (* main_~s~0 (+ main_~k~0 (div main_~c~0 main_~b~0))))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~c~0 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {26896#true} is VALID [2022-04-28 06:05:39,137 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {26896#true} {27271#(or (not (= (mod main_~c~0 main_~b~0) 0)) (= main_~b~0 0) (= (+ (* main_~x~0 (+ (* (- 1) main_~q~0 (+ main_~k~0 (div main_~c~0 main_~b~0))) main_~p~0)) main_~b~0 (* (+ main_~r~0 (* (- 1) (* main_~s~0 (+ main_~k~0 (div main_~c~0 main_~b~0))))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~c~0 0))} #104#return; {27271#(or (not (= (mod main_~c~0 main_~b~0) 0)) (= main_~b~0 0) (= (+ (* main_~x~0 (+ (* (- 1) main_~q~0 (+ main_~k~0 (div main_~c~0 main_~b~0))) main_~p~0)) main_~b~0 (* (+ main_~r~0 (* (- 1) (* main_~s~0 (+ main_~k~0 (div main_~c~0 main_~b~0))))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~c~0 0))} is VALID [2022-04-28 06:05:39,137 INFO L290 TraceCheckUtils]: 85: Hoare triple {26896#true} assume true; {26896#true} is VALID [2022-04-28 06:05:39,137 INFO L290 TraceCheckUtils]: 84: Hoare triple {26896#true} assume !(0 == ~cond); {26896#true} is VALID [2022-04-28 06:05:39,137 INFO L290 TraceCheckUtils]: 83: Hoare triple {26896#true} ~cond := #in~cond; {26896#true} is VALID [2022-04-28 06:05:39,137 INFO L272 TraceCheckUtils]: 82: Hoare triple {27271#(or (not (= (mod main_~c~0 main_~b~0) 0)) (= main_~b~0 0) (= (+ (* main_~x~0 (+ (* (- 1) main_~q~0 (+ main_~k~0 (div main_~c~0 main_~b~0))) main_~p~0)) main_~b~0 (* (+ main_~r~0 (* (- 1) (* main_~s~0 (+ main_~k~0 (div main_~c~0 main_~b~0))))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~c~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {26896#true} is VALID [2022-04-28 06:05:39,138 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {26896#true} {27271#(or (not (= (mod main_~c~0 main_~b~0) 0)) (= main_~b~0 0) (= (+ (* main_~x~0 (+ (* (- 1) main_~q~0 (+ main_~k~0 (div main_~c~0 main_~b~0))) main_~p~0)) main_~b~0 (* (+ main_~r~0 (* (- 1) (* main_~s~0 (+ main_~k~0 (div main_~c~0 main_~b~0))))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~c~0 0))} #102#return; {27271#(or (not (= (mod main_~c~0 main_~b~0) 0)) (= main_~b~0 0) (= (+ (* main_~x~0 (+ (* (- 1) main_~q~0 (+ main_~k~0 (div main_~c~0 main_~b~0))) main_~p~0)) main_~b~0 (* (+ main_~r~0 (* (- 1) (* main_~s~0 (+ main_~k~0 (div main_~c~0 main_~b~0))))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~c~0 0))} is VALID [2022-04-28 06:05:39,138 INFO L290 TraceCheckUtils]: 80: Hoare triple {26896#true} assume true; {26896#true} is VALID [2022-04-28 06:05:39,138 INFO L290 TraceCheckUtils]: 79: Hoare triple {26896#true} assume !(0 == ~cond); {26896#true} is VALID [2022-04-28 06:05:39,138 INFO L290 TraceCheckUtils]: 78: Hoare triple {26896#true} ~cond := #in~cond; {26896#true} is VALID [2022-04-28 06:05:39,138 INFO L272 TraceCheckUtils]: 77: Hoare triple {27271#(or (not (= (mod main_~c~0 main_~b~0) 0)) (= main_~b~0 0) (= (+ (* main_~x~0 (+ (* (- 1) main_~q~0 (+ main_~k~0 (div main_~c~0 main_~b~0))) main_~p~0)) main_~b~0 (* (+ main_~r~0 (* (- 1) (* main_~s~0 (+ main_~k~0 (div main_~c~0 main_~b~0))))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~c~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {26896#true} is VALID [2022-04-28 06:05:39,139 INFO L290 TraceCheckUtils]: 76: Hoare triple {27271#(or (not (= (mod main_~c~0 main_~b~0) 0)) (= main_~b~0 0) (= (+ (* main_~x~0 (+ (* (- 1) main_~q~0 (+ main_~k~0 (div main_~c~0 main_~b~0))) main_~p~0)) main_~b~0 (* (+ main_~r~0 (* (- 1) (* main_~s~0 (+ main_~k~0 (div main_~c~0 main_~b~0))))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~c~0 0))} assume !false; {27271#(or (not (= (mod main_~c~0 main_~b~0) 0)) (= main_~b~0 0) (= (+ (* main_~x~0 (+ (* (- 1) main_~q~0 (+ main_~k~0 (div main_~c~0 main_~b~0))) main_~p~0)) main_~b~0 (* (+ main_~r~0 (* (- 1) (* main_~s~0 (+ main_~k~0 (div main_~c~0 main_~b~0))))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~c~0 0))} is VALID [2022-04-28 06:05:39,140 INFO L290 TraceCheckUtils]: 75: Hoare triple {27271#(or (not (= (mod main_~c~0 main_~b~0) 0)) (= main_~b~0 0) (= (+ (* main_~x~0 (+ (* (- 1) main_~q~0 (+ main_~k~0 (div main_~c~0 main_~b~0))) main_~p~0)) main_~b~0 (* (+ main_~r~0 (* (- 1) (* main_~s~0 (+ main_~k~0 (div main_~c~0 main_~b~0))))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~c~0 0))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {27271#(or (not (= (mod main_~c~0 main_~b~0) 0)) (= main_~b~0 0) (= (+ (* main_~x~0 (+ (* (- 1) main_~q~0 (+ main_~k~0 (div main_~c~0 main_~b~0))) main_~p~0)) main_~b~0 (* (+ main_~r~0 (* (- 1) (* main_~s~0 (+ main_~k~0 (div main_~c~0 main_~b~0))))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~c~0 0))} is VALID [2022-04-28 06:05:39,141 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {26896#true} {27271#(or (not (= (mod main_~c~0 main_~b~0) 0)) (= main_~b~0 0) (= (+ (* main_~x~0 (+ (* (- 1) main_~q~0 (+ main_~k~0 (div main_~c~0 main_~b~0))) main_~p~0)) main_~b~0 (* (+ main_~r~0 (* (- 1) (* main_~s~0 (+ main_~k~0 (div main_~c~0 main_~b~0))))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~c~0 0))} #108#return; {27271#(or (not (= (mod main_~c~0 main_~b~0) 0)) (= main_~b~0 0) (= (+ (* main_~x~0 (+ (* (- 1) main_~q~0 (+ main_~k~0 (div main_~c~0 main_~b~0))) main_~p~0)) main_~b~0 (* (+ main_~r~0 (* (- 1) (* main_~s~0 (+ main_~k~0 (div main_~c~0 main_~b~0))))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~c~0 0))} is VALID [2022-04-28 06:05:39,141 INFO L290 TraceCheckUtils]: 73: Hoare triple {26896#true} assume true; {26896#true} is VALID [2022-04-28 06:05:39,141 INFO L290 TraceCheckUtils]: 72: Hoare triple {26896#true} assume !(0 == ~cond); {26896#true} is VALID [2022-04-28 06:05:39,141 INFO L290 TraceCheckUtils]: 71: Hoare triple {26896#true} ~cond := #in~cond; {26896#true} is VALID [2022-04-28 06:05:39,141 INFO L272 TraceCheckUtils]: 70: Hoare triple {27271#(or (not (= (mod main_~c~0 main_~b~0) 0)) (= main_~b~0 0) (= (+ (* main_~x~0 (+ (* (- 1) main_~q~0 (+ main_~k~0 (div main_~c~0 main_~b~0))) main_~p~0)) main_~b~0 (* (+ main_~r~0 (* (- 1) (* main_~s~0 (+ main_~k~0 (div main_~c~0 main_~b~0))))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~c~0 0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {26896#true} is VALID [2022-04-28 06:05:39,142 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {26896#true} {27271#(or (not (= (mod main_~c~0 main_~b~0) 0)) (= main_~b~0 0) (= (+ (* main_~x~0 (+ (* (- 1) main_~q~0 (+ main_~k~0 (div main_~c~0 main_~b~0))) main_~p~0)) main_~b~0 (* (+ main_~r~0 (* (- 1) (* main_~s~0 (+ main_~k~0 (div main_~c~0 main_~b~0))))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~c~0 0))} #106#return; {27271#(or (not (= (mod main_~c~0 main_~b~0) 0)) (= main_~b~0 0) (= (+ (* main_~x~0 (+ (* (- 1) main_~q~0 (+ main_~k~0 (div main_~c~0 main_~b~0))) main_~p~0)) main_~b~0 (* (+ main_~r~0 (* (- 1) (* main_~s~0 (+ main_~k~0 (div main_~c~0 main_~b~0))))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~c~0 0))} is VALID [2022-04-28 06:05:39,142 INFO L290 TraceCheckUtils]: 68: Hoare triple {26896#true} assume true; {26896#true} is VALID [2022-04-28 06:05:39,142 INFO L290 TraceCheckUtils]: 67: Hoare triple {26896#true} assume !(0 == ~cond); {26896#true} is VALID [2022-04-28 06:05:39,143 INFO L290 TraceCheckUtils]: 66: Hoare triple {26896#true} ~cond := #in~cond; {26896#true} is VALID [2022-04-28 06:05:39,143 INFO L272 TraceCheckUtils]: 65: Hoare triple {27271#(or (not (= (mod main_~c~0 main_~b~0) 0)) (= main_~b~0 0) (= (+ (* main_~x~0 (+ (* (- 1) main_~q~0 (+ main_~k~0 (div main_~c~0 main_~b~0))) main_~p~0)) main_~b~0 (* (+ main_~r~0 (* (- 1) (* main_~s~0 (+ main_~k~0 (div main_~c~0 main_~b~0))))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~c~0 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {26896#true} is VALID [2022-04-28 06:05:39,143 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {26896#true} {27271#(or (not (= (mod main_~c~0 main_~b~0) 0)) (= main_~b~0 0) (= (+ (* main_~x~0 (+ (* (- 1) main_~q~0 (+ main_~k~0 (div main_~c~0 main_~b~0))) main_~p~0)) main_~b~0 (* (+ main_~r~0 (* (- 1) (* main_~s~0 (+ main_~k~0 (div main_~c~0 main_~b~0))))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~c~0 0))} #104#return; {27271#(or (not (= (mod main_~c~0 main_~b~0) 0)) (= main_~b~0 0) (= (+ (* main_~x~0 (+ (* (- 1) main_~q~0 (+ main_~k~0 (div main_~c~0 main_~b~0))) main_~p~0)) main_~b~0 (* (+ main_~r~0 (* (- 1) (* main_~s~0 (+ main_~k~0 (div main_~c~0 main_~b~0))))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~c~0 0))} is VALID [2022-04-28 06:05:39,144 INFO L290 TraceCheckUtils]: 63: Hoare triple {26896#true} assume true; {26896#true} is VALID [2022-04-28 06:05:39,144 INFO L290 TraceCheckUtils]: 62: Hoare triple {26896#true} assume !(0 == ~cond); {26896#true} is VALID [2022-04-28 06:05:39,144 INFO L290 TraceCheckUtils]: 61: Hoare triple {26896#true} ~cond := #in~cond; {26896#true} is VALID [2022-04-28 06:05:39,144 INFO L272 TraceCheckUtils]: 60: Hoare triple {27271#(or (not (= (mod main_~c~0 main_~b~0) 0)) (= main_~b~0 0) (= (+ (* main_~x~0 (+ (* (- 1) main_~q~0 (+ main_~k~0 (div main_~c~0 main_~b~0))) main_~p~0)) main_~b~0 (* (+ main_~r~0 (* (- 1) (* main_~s~0 (+ main_~k~0 (div main_~c~0 main_~b~0))))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~c~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {26896#true} is VALID [2022-04-28 06:05:39,145 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {26896#true} {27271#(or (not (= (mod main_~c~0 main_~b~0) 0)) (= main_~b~0 0) (= (+ (* main_~x~0 (+ (* (- 1) main_~q~0 (+ main_~k~0 (div main_~c~0 main_~b~0))) main_~p~0)) main_~b~0 (* (+ main_~r~0 (* (- 1) (* main_~s~0 (+ main_~k~0 (div main_~c~0 main_~b~0))))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~c~0 0))} #102#return; {27271#(or (not (= (mod main_~c~0 main_~b~0) 0)) (= main_~b~0 0) (= (+ (* main_~x~0 (+ (* (- 1) main_~q~0 (+ main_~k~0 (div main_~c~0 main_~b~0))) main_~p~0)) main_~b~0 (* (+ main_~r~0 (* (- 1) (* main_~s~0 (+ main_~k~0 (div main_~c~0 main_~b~0))))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~c~0 0))} is VALID [2022-04-28 06:05:39,145 INFO L290 TraceCheckUtils]: 58: Hoare triple {26896#true} assume true; {26896#true} is VALID [2022-04-28 06:05:39,145 INFO L290 TraceCheckUtils]: 57: Hoare triple {26896#true} assume !(0 == ~cond); {26896#true} is VALID [2022-04-28 06:05:39,145 INFO L290 TraceCheckUtils]: 56: Hoare triple {26896#true} ~cond := #in~cond; {26896#true} is VALID [2022-04-28 06:05:39,145 INFO L272 TraceCheckUtils]: 55: Hoare triple {27271#(or (not (= (mod main_~c~0 main_~b~0) 0)) (= main_~b~0 0) (= (+ (* main_~x~0 (+ (* (- 1) main_~q~0 (+ main_~k~0 (div main_~c~0 main_~b~0))) main_~p~0)) main_~b~0 (* (+ main_~r~0 (* (- 1) (* main_~s~0 (+ main_~k~0 (div main_~c~0 main_~b~0))))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~c~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {26896#true} is VALID [2022-04-28 06:05:39,146 INFO L290 TraceCheckUtils]: 54: Hoare triple {27271#(or (not (= (mod main_~c~0 main_~b~0) 0)) (= main_~b~0 0) (= (+ (* main_~x~0 (+ (* (- 1) main_~q~0 (+ main_~k~0 (div main_~c~0 main_~b~0))) main_~p~0)) main_~b~0 (* (+ main_~r~0 (* (- 1) (* main_~s~0 (+ main_~k~0 (div main_~c~0 main_~b~0))))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~c~0 0))} assume !false; {27271#(or (not (= (mod main_~c~0 main_~b~0) 0)) (= main_~b~0 0) (= (+ (* main_~x~0 (+ (* (- 1) main_~q~0 (+ main_~k~0 (div main_~c~0 main_~b~0))) main_~p~0)) main_~b~0 (* (+ main_~r~0 (* (- 1) (* main_~s~0 (+ main_~k~0 (div main_~c~0 main_~b~0))))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~c~0 0))} is VALID [2022-04-28 06:05:39,146 INFO L290 TraceCheckUtils]: 53: Hoare triple {27271#(or (not (= (mod main_~c~0 main_~b~0) 0)) (= main_~b~0 0) (= (+ (* main_~x~0 (+ (* (- 1) main_~q~0 (+ main_~k~0 (div main_~c~0 main_~b~0))) main_~p~0)) main_~b~0 (* (+ main_~r~0 (* (- 1) (* main_~s~0 (+ main_~k~0 (div main_~c~0 main_~b~0))))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~c~0 0))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {27271#(or (not (= (mod main_~c~0 main_~b~0) 0)) (= main_~b~0 0) (= (+ (* main_~x~0 (+ (* (- 1) main_~q~0 (+ main_~k~0 (div main_~c~0 main_~b~0))) main_~p~0)) main_~b~0 (* (+ main_~r~0 (* (- 1) (* main_~s~0 (+ main_~k~0 (div main_~c~0 main_~b~0))))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~c~0 0))} is VALID [2022-04-28 06:05:39,147 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {26896#true} {27271#(or (not (= (mod main_~c~0 main_~b~0) 0)) (= main_~b~0 0) (= (+ (* main_~x~0 (+ (* (- 1) main_~q~0 (+ main_~k~0 (div main_~c~0 main_~b~0))) main_~p~0)) main_~b~0 (* (+ main_~r~0 (* (- 1) (* main_~s~0 (+ main_~k~0 (div main_~c~0 main_~b~0))))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~c~0 0))} #108#return; {27271#(or (not (= (mod main_~c~0 main_~b~0) 0)) (= main_~b~0 0) (= (+ (* main_~x~0 (+ (* (- 1) main_~q~0 (+ main_~k~0 (div main_~c~0 main_~b~0))) main_~p~0)) main_~b~0 (* (+ main_~r~0 (* (- 1) (* main_~s~0 (+ main_~k~0 (div main_~c~0 main_~b~0))))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~c~0 0))} is VALID [2022-04-28 06:05:39,147 INFO L290 TraceCheckUtils]: 51: Hoare triple {26896#true} assume true; {26896#true} is VALID [2022-04-28 06:05:39,147 INFO L290 TraceCheckUtils]: 50: Hoare triple {26896#true} assume !(0 == ~cond); {26896#true} is VALID [2022-04-28 06:05:39,147 INFO L290 TraceCheckUtils]: 49: Hoare triple {26896#true} ~cond := #in~cond; {26896#true} is VALID [2022-04-28 06:05:39,148 INFO L272 TraceCheckUtils]: 48: Hoare triple {27271#(or (not (= (mod main_~c~0 main_~b~0) 0)) (= main_~b~0 0) (= (+ (* main_~x~0 (+ (* (- 1) main_~q~0 (+ main_~k~0 (div main_~c~0 main_~b~0))) main_~p~0)) main_~b~0 (* (+ main_~r~0 (* (- 1) (* main_~s~0 (+ main_~k~0 (div main_~c~0 main_~b~0))))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~c~0 0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {26896#true} is VALID [2022-04-28 06:05:39,148 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {26896#true} {27271#(or (not (= (mod main_~c~0 main_~b~0) 0)) (= main_~b~0 0) (= (+ (* main_~x~0 (+ (* (- 1) main_~q~0 (+ main_~k~0 (div main_~c~0 main_~b~0))) main_~p~0)) main_~b~0 (* (+ main_~r~0 (* (- 1) (* main_~s~0 (+ main_~k~0 (div main_~c~0 main_~b~0))))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~c~0 0))} #106#return; {27271#(or (not (= (mod main_~c~0 main_~b~0) 0)) (= main_~b~0 0) (= (+ (* main_~x~0 (+ (* (- 1) main_~q~0 (+ main_~k~0 (div main_~c~0 main_~b~0))) main_~p~0)) main_~b~0 (* (+ main_~r~0 (* (- 1) (* main_~s~0 (+ main_~k~0 (div main_~c~0 main_~b~0))))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~c~0 0))} is VALID [2022-04-28 06:05:39,149 INFO L290 TraceCheckUtils]: 46: Hoare triple {26896#true} assume true; {26896#true} is VALID [2022-04-28 06:05:39,149 INFO L290 TraceCheckUtils]: 45: Hoare triple {26896#true} assume !(0 == ~cond); {26896#true} is VALID [2022-04-28 06:05:39,149 INFO L290 TraceCheckUtils]: 44: Hoare triple {26896#true} ~cond := #in~cond; {26896#true} is VALID [2022-04-28 06:05:39,149 INFO L272 TraceCheckUtils]: 43: Hoare triple {27271#(or (not (= (mod main_~c~0 main_~b~0) 0)) (= main_~b~0 0) (= (+ (* main_~x~0 (+ (* (- 1) main_~q~0 (+ main_~k~0 (div main_~c~0 main_~b~0))) main_~p~0)) main_~b~0 (* (+ main_~r~0 (* (- 1) (* main_~s~0 (+ main_~k~0 (div main_~c~0 main_~b~0))))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~c~0 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {26896#true} is VALID [2022-04-28 06:05:39,150 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {27024#(not (= |__VERIFIER_assert_#in~cond| 0))} {27437#(or (not (= (mod main_~c~0 main_~b~0) 0)) (= main_~b~0 0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~x~0 (+ (* (- 1) main_~q~0 (+ main_~k~0 (div main_~c~0 main_~b~0))) main_~p~0)) main_~b~0 (* (+ main_~r~0 (* (- 1) (* main_~s~0 (+ main_~k~0 (div main_~c~0 main_~b~0))))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~c~0 0))} #104#return; {27271#(or (not (= (mod main_~c~0 main_~b~0) 0)) (= main_~b~0 0) (= (+ (* main_~x~0 (+ (* (- 1) main_~q~0 (+ main_~k~0 (div main_~c~0 main_~b~0))) main_~p~0)) main_~b~0 (* (+ main_~r~0 (* (- 1) (* main_~s~0 (+ main_~k~0 (div main_~c~0 main_~b~0))))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~c~0 0))} is VALID [2022-04-28 06:05:39,150 INFO L290 TraceCheckUtils]: 41: Hoare triple {27024#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {27024#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:05:39,151 INFO L290 TraceCheckUtils]: 40: Hoare triple {27447#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {27024#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:05:39,151 INFO L290 TraceCheckUtils]: 39: Hoare triple {26896#true} ~cond := #in~cond; {27447#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 06:05:39,151 INFO L272 TraceCheckUtils]: 38: Hoare triple {27437#(or (not (= (mod main_~c~0 main_~b~0) 0)) (= main_~b~0 0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~x~0 (+ (* (- 1) main_~q~0 (+ main_~k~0 (div main_~c~0 main_~b~0))) main_~p~0)) main_~b~0 (* (+ main_~r~0 (* (- 1) (* main_~s~0 (+ main_~k~0 (div main_~c~0 main_~b~0))))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~c~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {26896#true} is VALID [2022-04-28 06:05:39,152 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {26896#true} {27437#(or (not (= (mod main_~c~0 main_~b~0) 0)) (= main_~b~0 0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~x~0 (+ (* (- 1) main_~q~0 (+ main_~k~0 (div main_~c~0 main_~b~0))) main_~p~0)) main_~b~0 (* (+ main_~r~0 (* (- 1) (* main_~s~0 (+ main_~k~0 (div main_~c~0 main_~b~0))))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~c~0 0))} #102#return; {27437#(or (not (= (mod main_~c~0 main_~b~0) 0)) (= main_~b~0 0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~x~0 (+ (* (- 1) main_~q~0 (+ main_~k~0 (div main_~c~0 main_~b~0))) main_~p~0)) main_~b~0 (* (+ main_~r~0 (* (- 1) (* main_~s~0 (+ main_~k~0 (div main_~c~0 main_~b~0))))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~c~0 0))} is VALID [2022-04-28 06:05:39,152 INFO L290 TraceCheckUtils]: 36: Hoare triple {26896#true} assume true; {26896#true} is VALID [2022-04-28 06:05:39,152 INFO L290 TraceCheckUtils]: 35: Hoare triple {26896#true} assume !(0 == ~cond); {26896#true} is VALID [2022-04-28 06:05:39,152 INFO L290 TraceCheckUtils]: 34: Hoare triple {26896#true} ~cond := #in~cond; {26896#true} is VALID [2022-04-28 06:05:39,152 INFO L272 TraceCheckUtils]: 33: Hoare triple {27437#(or (not (= (mod main_~c~0 main_~b~0) 0)) (= main_~b~0 0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~x~0 (+ (* (- 1) main_~q~0 (+ main_~k~0 (div main_~c~0 main_~b~0))) main_~p~0)) main_~b~0 (* (+ main_~r~0 (* (- 1) (* main_~s~0 (+ main_~k~0 (div main_~c~0 main_~b~0))))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~c~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {26896#true} is VALID [2022-04-28 06:05:39,153 INFO L290 TraceCheckUtils]: 32: Hoare triple {27437#(or (not (= (mod main_~c~0 main_~b~0) 0)) (= main_~b~0 0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~x~0 (+ (* (- 1) main_~q~0 (+ main_~k~0 (div main_~c~0 main_~b~0))) main_~p~0)) main_~b~0 (* (+ main_~r~0 (* (- 1) (* main_~s~0 (+ main_~k~0 (div main_~c~0 main_~b~0))))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~c~0 0))} assume !false; {27437#(or (not (= (mod main_~c~0 main_~b~0) 0)) (= main_~b~0 0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~x~0 (+ (* (- 1) main_~q~0 (+ main_~k~0 (div main_~c~0 main_~b~0))) main_~p~0)) main_~b~0 (* (+ main_~r~0 (* (- 1) (* main_~s~0 (+ main_~k~0 (div main_~c~0 main_~b~0))))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~c~0 0))} is VALID [2022-04-28 06:05:39,154 INFO L290 TraceCheckUtils]: 31: Hoare triple {27437#(or (not (= (mod main_~c~0 main_~b~0) 0)) (= main_~b~0 0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~x~0 (+ (* (- 1) main_~q~0 (+ main_~k~0 (div main_~c~0 main_~b~0))) main_~p~0)) main_~b~0 (* (+ main_~r~0 (* (- 1) (* main_~s~0 (+ main_~k~0 (div main_~c~0 main_~b~0))))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~c~0 0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {27437#(or (not (= (mod main_~c~0 main_~b~0) 0)) (= main_~b~0 0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~x~0 (+ (* (- 1) main_~q~0 (+ main_~k~0 (div main_~c~0 main_~b~0))) main_~p~0)) main_~b~0 (* (+ main_~r~0 (* (- 1) (* main_~s~0 (+ main_~k~0 (div main_~c~0 main_~b~0))))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~c~0 0))} is VALID [2022-04-28 06:05:39,155 INFO L290 TraceCheckUtils]: 30: Hoare triple {27437#(or (not (= (mod main_~c~0 main_~b~0) 0)) (= main_~b~0 0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~x~0 (+ (* (- 1) main_~q~0 (+ main_~k~0 (div main_~c~0 main_~b~0))) main_~p~0)) main_~b~0 (* (+ main_~r~0 (* (- 1) (* main_~s~0 (+ main_~k~0 (div main_~c~0 main_~b~0))))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~c~0 0))} assume !false; {27437#(or (not (= (mod main_~c~0 main_~b~0) 0)) (= main_~b~0 0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~x~0 (+ (* (- 1) main_~q~0 (+ main_~k~0 (div main_~c~0 main_~b~0))) main_~p~0)) main_~b~0 (* (+ main_~r~0 (* (- 1) (* main_~s~0 (+ main_~k~0 (div main_~c~0 main_~b~0))))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~c~0 0))} is VALID [2022-04-28 06:05:39,155 INFO L290 TraceCheckUtils]: 29: Hoare triple {27478#(or (not (= (mod main_~a~0 main_~b~0) 0)) (= main_~b~0 0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~a~0 0) (= (+ (* (+ (* (- 1) (* main_~s~0 (div main_~a~0 main_~b~0))) main_~r~0) main_~y~0) main_~b~0 (* (+ (* (- 1) main_~q~0 (div main_~a~0 main_~b~0)) main_~p~0) main_~x~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; {27437#(or (not (= (mod main_~c~0 main_~b~0) 0)) (= main_~b~0 0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~x~0 (+ (* (- 1) main_~q~0 (+ main_~k~0 (div main_~c~0 main_~b~0))) main_~p~0)) main_~b~0 (* (+ main_~r~0 (* (- 1) (* main_~s~0 (+ main_~k~0 (div main_~c~0 main_~b~0))))) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~c~0 0))} is VALID [2022-04-28 06:05:39,156 INFO L290 TraceCheckUtils]: 28: Hoare triple {27478#(or (not (= (mod main_~a~0 main_~b~0) 0)) (= main_~b~0 0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~a~0 0) (= (+ (* (+ (* (- 1) (* main_~s~0 (div main_~a~0 main_~b~0))) main_~r~0) main_~y~0) main_~b~0 (* (+ (* (- 1) main_~q~0 (div main_~a~0 main_~b~0)) main_~p~0) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !false; {27478#(or (not (= (mod main_~a~0 main_~b~0) 0)) (= main_~b~0 0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~a~0 0) (= (+ (* (+ (* (- 1) (* main_~s~0 (div main_~a~0 main_~b~0))) main_~r~0) main_~y~0) main_~b~0 (* (+ (* (- 1) main_~q~0 (div main_~a~0 main_~b~0)) main_~p~0) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 06:05:39,158 INFO L290 TraceCheckUtils]: 27: Hoare triple {26896#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {27478#(or (not (= (mod main_~a~0 main_~b~0) 0)) (= main_~b~0 0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~a~0 0) (= (+ (* (+ (* (- 1) (* main_~s~0 (div main_~a~0 main_~b~0))) main_~r~0) main_~y~0) main_~b~0 (* (+ (* (- 1) main_~q~0 (div main_~a~0 main_~b~0)) main_~p~0) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 06:05:39,158 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {26896#true} {26896#true} #100#return; {26896#true} is VALID [2022-04-28 06:05:39,158 INFO L290 TraceCheckUtils]: 25: Hoare triple {26896#true} assume true; {26896#true} is VALID [2022-04-28 06:05:39,158 INFO L290 TraceCheckUtils]: 24: Hoare triple {26896#true} assume !(0 == ~cond); {26896#true} is VALID [2022-04-28 06:05:39,158 INFO L290 TraceCheckUtils]: 23: Hoare triple {26896#true} ~cond := #in~cond; {26896#true} is VALID [2022-04-28 06:05:39,158 INFO L272 TraceCheckUtils]: 22: Hoare triple {26896#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {26896#true} is VALID [2022-04-28 06:05:39,158 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {26896#true} {26896#true} #98#return; {26896#true} is VALID [2022-04-28 06:05:39,158 INFO L290 TraceCheckUtils]: 20: Hoare triple {26896#true} assume true; {26896#true} is VALID [2022-04-28 06:05:39,158 INFO L290 TraceCheckUtils]: 19: Hoare triple {26896#true} assume !(0 == ~cond); {26896#true} is VALID [2022-04-28 06:05:39,159 INFO L290 TraceCheckUtils]: 18: Hoare triple {26896#true} ~cond := #in~cond; {26896#true} is VALID [2022-04-28 06:05:39,159 INFO L272 TraceCheckUtils]: 17: Hoare triple {26896#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {26896#true} is VALID [2022-04-28 06:05:39,159 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {26896#true} {26896#true} #96#return; {26896#true} is VALID [2022-04-28 06:05:39,159 INFO L290 TraceCheckUtils]: 15: Hoare triple {26896#true} assume true; {26896#true} is VALID [2022-04-28 06:05:39,159 INFO L290 TraceCheckUtils]: 14: Hoare triple {26896#true} assume !(0 == ~cond); {26896#true} is VALID [2022-04-28 06:05:39,159 INFO L290 TraceCheckUtils]: 13: Hoare triple {26896#true} ~cond := #in~cond; {26896#true} is VALID [2022-04-28 06:05:39,159 INFO L272 TraceCheckUtils]: 12: Hoare triple {26896#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {26896#true} is VALID [2022-04-28 06:05:39,159 INFO L290 TraceCheckUtils]: 11: Hoare triple {26896#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {26896#true} is VALID [2022-04-28 06:05:39,159 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {26896#true} {26896#true} #94#return; {26896#true} is VALID [2022-04-28 06:05:39,159 INFO L290 TraceCheckUtils]: 9: Hoare triple {26896#true} assume true; {26896#true} is VALID [2022-04-28 06:05:39,159 INFO L290 TraceCheckUtils]: 8: Hoare triple {26896#true} assume !(0 == ~cond); {26896#true} is VALID [2022-04-28 06:05:39,159 INFO L290 TraceCheckUtils]: 7: Hoare triple {26896#true} ~cond := #in~cond; {26896#true} is VALID [2022-04-28 06:05:39,159 INFO L272 TraceCheckUtils]: 6: Hoare triple {26896#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {26896#true} is VALID [2022-04-28 06:05:39,160 INFO L290 TraceCheckUtils]: 5: Hoare triple {26896#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; {26896#true} is VALID [2022-04-28 06:05:39,160 INFO L272 TraceCheckUtils]: 4: Hoare triple {26896#true} call #t~ret6 := main(); {26896#true} is VALID [2022-04-28 06:05:39,160 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26896#true} {26896#true} #112#return; {26896#true} is VALID [2022-04-28 06:05:39,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {26896#true} assume true; {26896#true} is VALID [2022-04-28 06:05:39,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {26896#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); {26896#true} is VALID [2022-04-28 06:05:39,160 INFO L272 TraceCheckUtils]: 0: Hoare triple {26896#true} call ULTIMATE.init(); {26896#true} is VALID [2022-04-28 06:05:39,161 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 71 proven. 34 refuted. 0 times theorem prover too weak. 224 trivial. 5 not checked. [2022-04-28 06:05:39,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:05:39,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528172990] [2022-04-28 06:05:39,161 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:05:39,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409851444] [2022-04-28 06:05:39,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409851444] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:05:39,161 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:05:39,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17] total 25 [2022-04-28 06:05:39,162 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:05:39,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1301506193] [2022-04-28 06:05:39,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1301506193] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:05:39,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:05:39,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 06:05:39,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455111834] [2022-04-28 06:05:39,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:05:39,162 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 11 states have internal predecessors, (30), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 108 [2022-04-28 06:05:39,163 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:05:39,163 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.5) internal successors, (30), 11 states have internal predecessors, (30), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-04-28 06:05:39,252 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:05:39,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 06:05:39,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:05:39,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 06:05:39,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=390, Unknown=3, NotChecked=126, Total=600 [2022-04-28 06:05:39,253 INFO L87 Difference]: Start difference. First operand 454 states and 629 transitions. Second operand has 13 states, 12 states have (on average 2.5) internal successors, (30), 11 states have internal predecessors, (30), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-04-28 06:05:43,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:05:43,459 INFO L93 Difference]: Finished difference Result 530 states and 735 transitions. [2022-04-28 06:05:43,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 06:05:43,459 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 11 states have internal predecessors, (30), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 108 [2022-04-28 06:05:43,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:05:43,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.5) internal successors, (30), 11 states have internal predecessors, (30), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-04-28 06:05:43,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 119 transitions. [2022-04-28 06:05:43,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.5) internal successors, (30), 11 states have internal predecessors, (30), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-04-28 06:05:43,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 119 transitions. [2022-04-28 06:05:43,463 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 119 transitions. [2022-04-28 06:05:43,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:05:43,702 INFO L225 Difference]: With dead ends: 530 [2022-04-28 06:05:43,702 INFO L226 Difference]: Without dead ends: 527 [2022-04-28 06:05:43,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 190 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=149, Invalid=672, Unknown=3, NotChecked=168, Total=992 [2022-04-28 06:05:43,703 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 47 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 06:05:43,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 302 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 06:05:43,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2022-04-28 06:05:45,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 448. [2022-04-28 06:05:45,179 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:05:45,183 INFO L82 GeneralOperation]: Start isEquivalent. First operand 527 states. Second operand has 448 states, 260 states have (on average 1.1923076923076923) internal successors, (310), 261 states have internal predecessors, (310), 155 states have call successors, (155), 33 states have call predecessors, (155), 32 states have return successors, (153), 153 states have call predecessors, (153), 153 states have call successors, (153) [2022-04-28 06:05:45,184 INFO L74 IsIncluded]: Start isIncluded. First operand 527 states. Second operand has 448 states, 260 states have (on average 1.1923076923076923) internal successors, (310), 261 states have internal predecessors, (310), 155 states have call successors, (155), 33 states have call predecessors, (155), 32 states have return successors, (153), 153 states have call predecessors, (153), 153 states have call successors, (153) [2022-04-28 06:05:45,184 INFO L87 Difference]: Start difference. First operand 527 states. Second operand has 448 states, 260 states have (on average 1.1923076923076923) internal successors, (310), 261 states have internal predecessors, (310), 155 states have call successors, (155), 33 states have call predecessors, (155), 32 states have return successors, (153), 153 states have call predecessors, (153), 153 states have call successors, (153) [2022-04-28 06:05:45,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:05:45,206 INFO L93 Difference]: Finished difference Result 527 states and 731 transitions. [2022-04-28 06:05:45,206 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 731 transitions. [2022-04-28 06:05:45,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:05:45,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:05:45,208 INFO L74 IsIncluded]: Start isIncluded. First operand has 448 states, 260 states have (on average 1.1923076923076923) internal successors, (310), 261 states have internal predecessors, (310), 155 states have call successors, (155), 33 states have call predecessors, (155), 32 states have return successors, (153), 153 states have call predecessors, (153), 153 states have call successors, (153) Second operand 527 states. [2022-04-28 06:05:45,209 INFO L87 Difference]: Start difference. First operand has 448 states, 260 states have (on average 1.1923076923076923) internal successors, (310), 261 states have internal predecessors, (310), 155 states have call successors, (155), 33 states have call predecessors, (155), 32 states have return successors, (153), 153 states have call predecessors, (153), 153 states have call successors, (153) Second operand 527 states. [2022-04-28 06:05:45,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:05:45,230 INFO L93 Difference]: Finished difference Result 527 states and 731 transitions. [2022-04-28 06:05:45,230 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 731 transitions. [2022-04-28 06:05:45,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:05:45,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:05:45,231 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:05:45,232 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:05:45,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 260 states have (on average 1.1923076923076923) internal successors, (310), 261 states have internal predecessors, (310), 155 states have call successors, (155), 33 states have call predecessors, (155), 32 states have return successors, (153), 153 states have call predecessors, (153), 153 states have call successors, (153) [2022-04-28 06:05:45,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 618 transitions. [2022-04-28 06:05:45,252 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 618 transitions. Word has length 108 [2022-04-28 06:05:45,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:05:45,252 INFO L495 AbstractCegarLoop]: Abstraction has 448 states and 618 transitions. [2022-04-28 06:05:45,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 11 states have internal predecessors, (30), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-04-28 06:05:45,252 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 448 states and 618 transitions. [2022-04-28 06:05:47,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 618 edges. 618 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:05:47,500 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 618 transitions. [2022-04-28 06:05:47,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-28 06:05:47,505 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:05:47,505 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2022-04-28 06:05:47,530 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 06:05:47,727 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 06:05:47,728 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:05:47,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:05:47,728 INFO L85 PathProgramCache]: Analyzing trace with hash 826422219, now seen corresponding path program 9 times [2022-04-28 06:05:47,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:05:47,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1113200487] [2022-04-28 06:05:47,729 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:05:47,729 INFO L85 PathProgramCache]: Analyzing trace with hash 826422219, now seen corresponding path program 10 times [2022-04-28 06:05:47,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:05:47,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463436137] [2022-04-28 06:05:47,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:05:47,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:05:47,742 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:05:47,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1325612658] [2022-04-28 06:05:47,743 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 06:05:47,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:05:47,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:05:47,760 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 06:05:47,760 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 06:05:47,821 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 06:05:47,821 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:05:47,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 104 conjunts are in the unsatisfiable core [2022-04-28 06:05:47,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:05:47,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:05:49,982 INFO L272 TraceCheckUtils]: 0: Hoare triple {30592#true} call ULTIMATE.init(); {30592#true} is VALID [2022-04-28 06:05:49,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {30592#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); {30592#true} is VALID [2022-04-28 06:05:49,982 INFO L290 TraceCheckUtils]: 2: Hoare triple {30592#true} assume true; {30592#true} is VALID [2022-04-28 06:05:49,982 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30592#true} {30592#true} #112#return; {30592#true} is VALID [2022-04-28 06:05:49,982 INFO L272 TraceCheckUtils]: 4: Hoare triple {30592#true} call #t~ret6 := main(); {30592#true} is VALID [2022-04-28 06:05:49,983 INFO L290 TraceCheckUtils]: 5: Hoare triple {30592#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; {30592#true} is VALID [2022-04-28 06:05:49,983 INFO L272 TraceCheckUtils]: 6: Hoare triple {30592#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {30592#true} is VALID [2022-04-28 06:05:49,983 INFO L290 TraceCheckUtils]: 7: Hoare triple {30592#true} ~cond := #in~cond; {30592#true} is VALID [2022-04-28 06:05:49,983 INFO L290 TraceCheckUtils]: 8: Hoare triple {30592#true} assume !(0 == ~cond); {30592#true} is VALID [2022-04-28 06:05:49,983 INFO L290 TraceCheckUtils]: 9: Hoare triple {30592#true} assume true; {30592#true} is VALID [2022-04-28 06:05:49,983 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {30592#true} {30592#true} #94#return; {30592#true} is VALID [2022-04-28 06:05:49,983 INFO L290 TraceCheckUtils]: 11: Hoare triple {30592#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {30592#true} is VALID [2022-04-28 06:05:49,983 INFO L272 TraceCheckUtils]: 12: Hoare triple {30592#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {30592#true} is VALID [2022-04-28 06:05:49,983 INFO L290 TraceCheckUtils]: 13: Hoare triple {30592#true} ~cond := #in~cond; {30592#true} is VALID [2022-04-28 06:05:49,983 INFO L290 TraceCheckUtils]: 14: Hoare triple {30592#true} assume !(0 == ~cond); {30592#true} is VALID [2022-04-28 06:05:49,983 INFO L290 TraceCheckUtils]: 15: Hoare triple {30592#true} assume true; {30592#true} is VALID [2022-04-28 06:05:49,983 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {30592#true} {30592#true} #96#return; {30592#true} is VALID [2022-04-28 06:05:49,983 INFO L272 TraceCheckUtils]: 17: Hoare triple {30592#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {30592#true} is VALID [2022-04-28 06:05:49,983 INFO L290 TraceCheckUtils]: 18: Hoare triple {30592#true} ~cond := #in~cond; {30592#true} is VALID [2022-04-28 06:05:49,983 INFO L290 TraceCheckUtils]: 19: Hoare triple {30592#true} assume !(0 == ~cond); {30592#true} is VALID [2022-04-28 06:05:49,983 INFO L290 TraceCheckUtils]: 20: Hoare triple {30592#true} assume true; {30592#true} is VALID [2022-04-28 06:05:49,983 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {30592#true} {30592#true} #98#return; {30592#true} is VALID [2022-04-28 06:05:49,983 INFO L272 TraceCheckUtils]: 22: Hoare triple {30592#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {30592#true} is VALID [2022-04-28 06:05:49,983 INFO L290 TraceCheckUtils]: 23: Hoare triple {30592#true} ~cond := #in~cond; {30592#true} is VALID [2022-04-28 06:05:49,984 INFO L290 TraceCheckUtils]: 24: Hoare triple {30592#true} assume !(0 == ~cond); {30592#true} is VALID [2022-04-28 06:05:49,984 INFO L290 TraceCheckUtils]: 25: Hoare triple {30592#true} assume true; {30592#true} is VALID [2022-04-28 06:05:49,984 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {30592#true} {30592#true} #100#return; {30592#true} is VALID [2022-04-28 06:05:49,984 INFO L290 TraceCheckUtils]: 27: Hoare triple {30592#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {30678#(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))} is VALID [2022-04-28 06:05:49,984 INFO L290 TraceCheckUtils]: 28: Hoare triple {30678#(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))} assume !false; {30678#(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))} is VALID [2022-04-28 06:05:49,985 INFO L290 TraceCheckUtils]: 29: Hoare triple {30678#(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))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {30685#(and (= main_~r~0 0) (= 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 06:05:49,985 INFO L290 TraceCheckUtils]: 30: Hoare triple {30685#(and (= main_~r~0 0) (= 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; {30685#(and (= main_~r~0 0) (= 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 06:05:49,985 INFO L290 TraceCheckUtils]: 31: Hoare triple {30685#(and (= main_~r~0 0) (= 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); {30685#(and (= main_~r~0 0) (= 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 06:05:49,986 INFO L290 TraceCheckUtils]: 32: Hoare triple {30685#(and (= main_~r~0 0) (= main_~k~0 0) (= 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; {30695#(and (= main_~s~0 0) (= 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 06:05:49,986 INFO L290 TraceCheckUtils]: 33: Hoare triple {30695#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !false; {30695#(and (= main_~s~0 0) (= 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 06:05:49,987 INFO L290 TraceCheckUtils]: 34: Hoare triple {30695#(and (= main_~s~0 0) (= 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; {30702#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 06:05:49,987 INFO L290 TraceCheckUtils]: 35: Hoare triple {30702#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !false; {30702#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 06:05:49,987 INFO L290 TraceCheckUtils]: 36: Hoare triple {30702#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~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; {30709#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} is VALID [2022-04-28 06:05:49,988 INFO L290 TraceCheckUtils]: 37: Hoare triple {30709#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} assume !false; {30709#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} is VALID [2022-04-28 06:05:49,988 INFO L272 TraceCheckUtils]: 38: Hoare triple {30709#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {30592#true} is VALID [2022-04-28 06:05:49,988 INFO L290 TraceCheckUtils]: 39: Hoare triple {30592#true} ~cond := #in~cond; {30719#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:05:49,988 INFO L290 TraceCheckUtils]: 40: Hoare triple {30719#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {30723#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:05:49,989 INFO L290 TraceCheckUtils]: 41: Hoare triple {30723#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {30723#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:05:49,990 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {30723#(not (= |__VERIFIER_assert_#in~cond| 0))} {30709#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} #102#return; {30730#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 06:05:49,990 INFO L272 TraceCheckUtils]: 43: Hoare triple {30730#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {30592#true} is VALID [2022-04-28 06:05:49,990 INFO L290 TraceCheckUtils]: 44: Hoare triple {30592#true} ~cond := #in~cond; {30719#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:05:49,990 INFO L290 TraceCheckUtils]: 45: Hoare triple {30719#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {30723#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:05:49,991 INFO L290 TraceCheckUtils]: 46: Hoare triple {30723#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {30723#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:05:49,991 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {30723#(not (= |__VERIFIER_assert_#in~cond| 0))} {30730#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #104#return; {30746#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 06:05:49,992 INFO L272 TraceCheckUtils]: 48: Hoare triple {30746#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {30592#true} is VALID [2022-04-28 06:05:49,992 INFO L290 TraceCheckUtils]: 49: Hoare triple {30592#true} ~cond := #in~cond; {30592#true} is VALID [2022-04-28 06:05:49,992 INFO L290 TraceCheckUtils]: 50: Hoare triple {30592#true} assume !(0 == ~cond); {30592#true} is VALID [2022-04-28 06:05:49,992 INFO L290 TraceCheckUtils]: 51: Hoare triple {30592#true} assume true; {30592#true} is VALID [2022-04-28 06:05:49,992 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {30592#true} {30746#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #106#return; {30746#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 06:05:49,993 INFO L272 TraceCheckUtils]: 53: Hoare triple {30746#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {30592#true} is VALID [2022-04-28 06:05:49,993 INFO L290 TraceCheckUtils]: 54: Hoare triple {30592#true} ~cond := #in~cond; {30719#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:05:49,993 INFO L290 TraceCheckUtils]: 55: Hoare triple {30719#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {30723#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:05:49,993 INFO L290 TraceCheckUtils]: 56: Hoare triple {30723#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {30723#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:05:49,994 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {30723#(not (= |__VERIFIER_assert_#in~cond| 0))} {30746#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #108#return; {30746#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 06:05:49,994 INFO L290 TraceCheckUtils]: 58: Hoare triple {30746#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !(~c~0 >= 2 * ~v~0); {30746#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 06:05:49,996 INFO L290 TraceCheckUtils]: 59: Hoare triple {30746#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {30783#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 06:05:49,996 INFO L290 TraceCheckUtils]: 60: Hoare triple {30783#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~0) (* main_~p~0 main_~x~0))))} assume !false; {30783#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 06:05:49,997 INFO L290 TraceCheckUtils]: 61: Hoare triple {30783#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~0) (* main_~p~0 main_~x~0))))} assume !(~c~0 >= ~b~0); {30783#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 06:05:49,998 INFO L290 TraceCheckUtils]: 62: Hoare triple {30783#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~0) (* main_~p~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; {30793#(and (= (+ (* main_~q~0 main_~x~0) (* (- 1) main_~a~0) main_~y~0 (* main_~p~0 main_~x~0)) main_~b~0) (= main_~r~0 0) (= main_~x~0 (+ (* main_~p~0 main_~x~0 1) main_~a~0 (* (- 1) (* main_~p~0 main_~x~0)))) (= main_~s~0 1) (= (* main_~p~0 main_~x~0) (+ (* main_~p~0 main_~x~0 1) main_~a~0 (* (- 1) (* main_~p~0 main_~x~0)))) (= (+ main_~q~0 main_~p~0) 0))} is VALID [2022-04-28 06:05:49,999 INFO L290 TraceCheckUtils]: 63: Hoare triple {30793#(and (= (+ (* main_~q~0 main_~x~0) (* (- 1) main_~a~0) main_~y~0 (* main_~p~0 main_~x~0)) main_~b~0) (= main_~r~0 0) (= main_~x~0 (+ (* main_~p~0 main_~x~0 1) main_~a~0 (* (- 1) (* main_~p~0 main_~x~0)))) (= main_~s~0 1) (= (* main_~p~0 main_~x~0) (+ (* main_~p~0 main_~x~0 1) main_~a~0 (* (- 1) (* main_~p~0 main_~x~0)))) (= (+ main_~q~0 main_~p~0) 0))} assume !false; {30793#(and (= (+ (* main_~q~0 main_~x~0) (* (- 1) main_~a~0) main_~y~0 (* main_~p~0 main_~x~0)) main_~b~0) (= main_~r~0 0) (= main_~x~0 (+ (* main_~p~0 main_~x~0 1) main_~a~0 (* (- 1) (* main_~p~0 main_~x~0)))) (= main_~s~0 1) (= (* main_~p~0 main_~x~0) (+ (* main_~p~0 main_~x~0 1) main_~a~0 (* (- 1) (* main_~p~0 main_~x~0)))) (= (+ main_~q~0 main_~p~0) 0))} is VALID [2022-04-28 06:05:49,999 INFO L290 TraceCheckUtils]: 64: Hoare triple {30793#(and (= (+ (* main_~q~0 main_~x~0) (* (- 1) main_~a~0) main_~y~0 (* main_~p~0 main_~x~0)) main_~b~0) (= main_~r~0 0) (= main_~x~0 (+ (* main_~p~0 main_~x~0 1) main_~a~0 (* (- 1) (* main_~p~0 main_~x~0)))) (= main_~s~0 1) (= (* main_~p~0 main_~x~0) (+ (* main_~p~0 main_~x~0 1) main_~a~0 (* (- 1) (* main_~p~0 main_~x~0)))) (= (+ main_~q~0 main_~p~0) 0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {30800#(and (= (+ (* main_~q~0 main_~x~0) (* (- 1) main_~a~0) main_~y~0 (* main_~p~0 main_~x~0)) main_~b~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~x~0 (+ (* main_~p~0 main_~x~0 1) main_~a~0 (* (- 1) (* main_~p~0 main_~x~0)))) (= main_~k~0 0) (= main_~s~0 1) (= (* main_~p~0 main_~x~0) (+ (* main_~p~0 main_~x~0 1) main_~a~0 (* (- 1) (* main_~p~0 main_~x~0)))) (= (+ main_~q~0 main_~p~0) 0))} is VALID [2022-04-28 06:05:50,000 INFO L290 TraceCheckUtils]: 65: Hoare triple {30800#(and (= (+ (* main_~q~0 main_~x~0) (* (- 1) main_~a~0) main_~y~0 (* main_~p~0 main_~x~0)) main_~b~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~x~0 (+ (* main_~p~0 main_~x~0 1) main_~a~0 (* (- 1) (* main_~p~0 main_~x~0)))) (= main_~k~0 0) (= main_~s~0 1) (= (* main_~p~0 main_~x~0) (+ (* main_~p~0 main_~x~0 1) main_~a~0 (* (- 1) (* main_~p~0 main_~x~0)))) (= (+ main_~q~0 main_~p~0) 0))} assume !false; {30800#(and (= (+ (* main_~q~0 main_~x~0) (* (- 1) main_~a~0) main_~y~0 (* main_~p~0 main_~x~0)) main_~b~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~x~0 (+ (* main_~p~0 main_~x~0 1) main_~a~0 (* (- 1) (* main_~p~0 main_~x~0)))) (= main_~k~0 0) (= main_~s~0 1) (= (* main_~p~0 main_~x~0) (+ (* main_~p~0 main_~x~0 1) main_~a~0 (* (- 1) (* main_~p~0 main_~x~0)))) (= (+ main_~q~0 main_~p~0) 0))} is VALID [2022-04-28 06:05:50,001 INFO L290 TraceCheckUtils]: 66: Hoare triple {30800#(and (= (+ (* main_~q~0 main_~x~0) (* (- 1) main_~a~0) main_~y~0 (* main_~p~0 main_~x~0)) main_~b~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~x~0 (+ (* main_~p~0 main_~x~0 1) main_~a~0 (* (- 1) (* main_~p~0 main_~x~0)))) (= main_~k~0 0) (= main_~s~0 1) (= (* main_~p~0 main_~x~0) (+ (* main_~p~0 main_~x~0 1) main_~a~0 (* (- 1) (* main_~p~0 main_~x~0)))) (= (+ main_~q~0 main_~p~0) 0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {30807#(and (= main_~b~0 main_~v~0) (= (+ (* main_~q~0 main_~x~0) (* (- 1) main_~a~0) main_~y~0 (* main_~p~0 main_~x~0)) main_~b~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~x~0 (+ (* main_~p~0 main_~x~0 1) main_~a~0 (* (- 1) (* main_~p~0 main_~x~0)))) (= main_~k~0 0) (= main_~s~0 1) (= main_~d~0 1) (= (* main_~p~0 main_~x~0) (+ (* main_~p~0 main_~x~0 1) main_~a~0 (* (- 1) (* main_~p~0 main_~x~0)))) (= (+ main_~q~0 main_~p~0) 0))} is VALID [2022-04-28 06:05:50,001 INFO L290 TraceCheckUtils]: 67: Hoare triple {30807#(and (= main_~b~0 main_~v~0) (= (+ (* main_~q~0 main_~x~0) (* (- 1) main_~a~0) main_~y~0 (* main_~p~0 main_~x~0)) main_~b~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~x~0 (+ (* main_~p~0 main_~x~0 1) main_~a~0 (* (- 1) (* main_~p~0 main_~x~0)))) (= main_~k~0 0) (= main_~s~0 1) (= main_~d~0 1) (= (* main_~p~0 main_~x~0) (+ (* main_~p~0 main_~x~0 1) main_~a~0 (* (- 1) (* main_~p~0 main_~x~0)))) (= (+ main_~q~0 main_~p~0) 0))} assume !false; {30807#(and (= main_~b~0 main_~v~0) (= (+ (* main_~q~0 main_~x~0) (* (- 1) main_~a~0) main_~y~0 (* main_~p~0 main_~x~0)) main_~b~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~x~0 (+ (* main_~p~0 main_~x~0 1) main_~a~0 (* (- 1) (* main_~p~0 main_~x~0)))) (= main_~k~0 0) (= main_~s~0 1) (= main_~d~0 1) (= (* main_~p~0 main_~x~0) (+ (* main_~p~0 main_~x~0 1) main_~a~0 (* (- 1) (* main_~p~0 main_~x~0)))) (= (+ main_~q~0 main_~p~0) 0))} is VALID [2022-04-28 06:05:50,001 INFO L272 TraceCheckUtils]: 68: Hoare triple {30807#(and (= main_~b~0 main_~v~0) (= (+ (* main_~q~0 main_~x~0) (* (- 1) main_~a~0) main_~y~0 (* main_~p~0 main_~x~0)) main_~b~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~x~0 (+ (* main_~p~0 main_~x~0 1) main_~a~0 (* (- 1) (* main_~p~0 main_~x~0)))) (= main_~k~0 0) (= main_~s~0 1) (= main_~d~0 1) (= (* main_~p~0 main_~x~0) (+ (* main_~p~0 main_~x~0 1) main_~a~0 (* (- 1) (* main_~p~0 main_~x~0)))) (= (+ main_~q~0 main_~p~0) 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {30592#true} is VALID [2022-04-28 06:05:50,001 INFO L290 TraceCheckUtils]: 69: Hoare triple {30592#true} ~cond := #in~cond; {30719#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:05:50,002 INFO L290 TraceCheckUtils]: 70: Hoare triple {30719#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {30723#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:05:50,002 INFO L290 TraceCheckUtils]: 71: Hoare triple {30723#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {30723#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:05:50,004 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {30723#(not (= |__VERIFIER_assert_#in~cond| 0))} {30807#(and (= main_~b~0 main_~v~0) (= (+ (* main_~q~0 main_~x~0) (* (- 1) main_~a~0) main_~y~0 (* main_~p~0 main_~x~0)) main_~b~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~x~0 (+ (* main_~p~0 main_~x~0 1) main_~a~0 (* (- 1) (* main_~p~0 main_~x~0)))) (= main_~k~0 0) (= main_~s~0 1) (= main_~d~0 1) (= (* main_~p~0 main_~x~0) (+ (* main_~p~0 main_~x~0 1) main_~a~0 (* (- 1) (* main_~p~0 main_~x~0)))) (= (+ main_~q~0 main_~p~0) 0))} #102#return; {30826#(and (= (+ (* main_~q~0 main_~x~0) main_~y~0 (* main_~p~0 main_~x~0)) (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= main_~s~0 1) (= main_~d~0 1) (= (+ (* main_~q~0 main_~x~0) main_~y~0 (* main_~p~0 main_~x~0)) (+ main_~b~0 main_~x~0)) (= (+ main_~q~0 main_~p~0) 0))} is VALID [2022-04-28 06:05:50,004 INFO L272 TraceCheckUtils]: 73: Hoare triple {30826#(and (= (+ (* main_~q~0 main_~x~0) main_~y~0 (* main_~p~0 main_~x~0)) (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= main_~s~0 1) (= main_~d~0 1) (= (+ (* main_~q~0 main_~x~0) main_~y~0 (* main_~p~0 main_~x~0)) (+ main_~b~0 main_~x~0)) (= (+ main_~q~0 main_~p~0) 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {30592#true} is VALID [2022-04-28 06:05:50,005 INFO L290 TraceCheckUtils]: 74: Hoare triple {30592#true} ~cond := #in~cond; {30719#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:05:50,005 INFO L290 TraceCheckUtils]: 75: Hoare triple {30719#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {30723#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:05:50,005 INFO L290 TraceCheckUtils]: 76: Hoare triple {30723#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {30723#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:05:50,007 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {30723#(not (= |__VERIFIER_assert_#in~cond| 0))} {30826#(and (= (+ (* main_~q~0 main_~x~0) main_~y~0 (* main_~p~0 main_~x~0)) (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= main_~s~0 1) (= main_~d~0 1) (= (+ (* main_~q~0 main_~x~0) main_~y~0 (* main_~p~0 main_~x~0)) (+ main_~b~0 main_~x~0)) (= (+ main_~q~0 main_~p~0) 0))} #104#return; {30842#(and (= main_~r~0 0) (= (+ main_~c~0 main_~v~0) (+ (* main_~q~0 main_~x~0) main_~y~0 (* main_~p~0 main_~x~0))) (= (+ main_~y~0 (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (= main_~d~0 1) (= (+ main_~q~0 main_~p~0) 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 06:05:50,007 INFO L272 TraceCheckUtils]: 78: Hoare triple {30842#(and (= main_~r~0 0) (= (+ main_~c~0 main_~v~0) (+ (* main_~q~0 main_~x~0) main_~y~0 (* main_~p~0 main_~x~0))) (= (+ main_~y~0 (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (= main_~d~0 1) (= (+ main_~q~0 main_~p~0) 0) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {30592#true} is VALID [2022-04-28 06:05:50,007 INFO L290 TraceCheckUtils]: 79: Hoare triple {30592#true} ~cond := #in~cond; {30592#true} is VALID [2022-04-28 06:05:50,008 INFO L290 TraceCheckUtils]: 80: Hoare triple {30592#true} assume !(0 == ~cond); {30592#true} is VALID [2022-04-28 06:05:50,008 INFO L290 TraceCheckUtils]: 81: Hoare triple {30592#true} assume true; {30592#true} is VALID [2022-04-28 06:05:50,008 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {30592#true} {30842#(and (= main_~r~0 0) (= (+ main_~c~0 main_~v~0) (+ (* main_~q~0 main_~x~0) main_~y~0 (* main_~p~0 main_~x~0))) (= (+ main_~y~0 (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (= main_~d~0 1) (= (+ main_~q~0 main_~p~0) 0) (= main_~c~0 main_~x~0))} #106#return; {30842#(and (= main_~r~0 0) (= (+ main_~c~0 main_~v~0) (+ (* main_~q~0 main_~x~0) main_~y~0 (* main_~p~0 main_~x~0))) (= (+ main_~y~0 (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (= main_~d~0 1) (= (+ main_~q~0 main_~p~0) 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 06:05:50,008 INFO L272 TraceCheckUtils]: 83: Hoare triple {30842#(and (= main_~r~0 0) (= (+ main_~c~0 main_~v~0) (+ (* main_~q~0 main_~x~0) main_~y~0 (* main_~p~0 main_~x~0))) (= (+ main_~y~0 (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (= main_~d~0 1) (= (+ main_~q~0 main_~p~0) 0) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {30592#true} is VALID [2022-04-28 06:05:50,008 INFO L290 TraceCheckUtils]: 84: Hoare triple {30592#true} ~cond := #in~cond; {30592#true} is VALID [2022-04-28 06:05:50,009 INFO L290 TraceCheckUtils]: 85: Hoare triple {30592#true} assume !(0 == ~cond); {30592#true} is VALID [2022-04-28 06:05:50,009 INFO L290 TraceCheckUtils]: 86: Hoare triple {30592#true} assume true; {30592#true} is VALID [2022-04-28 06:05:50,011 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {30592#true} {30842#(and (= main_~r~0 0) (= (+ main_~c~0 main_~v~0) (+ (* main_~q~0 main_~x~0) main_~y~0 (* main_~p~0 main_~x~0))) (= (+ main_~y~0 (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (= main_~d~0 1) (= (+ main_~q~0 main_~p~0) 0) (= main_~c~0 main_~x~0))} #108#return; {30842#(and (= main_~r~0 0) (= (+ main_~c~0 main_~v~0) (+ (* main_~q~0 main_~x~0) main_~y~0 (* main_~p~0 main_~x~0))) (= (+ main_~y~0 (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (= main_~d~0 1) (= (+ main_~q~0 main_~p~0) 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 06:05:50,011 INFO L290 TraceCheckUtils]: 88: Hoare triple {30842#(and (= main_~r~0 0) (= (+ main_~c~0 main_~v~0) (+ (* main_~q~0 main_~x~0) main_~y~0 (* main_~p~0 main_~x~0))) (= (+ main_~y~0 (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (= main_~d~0 1) (= (+ main_~q~0 main_~p~0) 0) (= main_~c~0 main_~x~0))} assume !(~c~0 >= 2 * ~v~0); {30842#(and (= main_~r~0 0) (= (+ main_~c~0 main_~v~0) (+ (* main_~q~0 main_~x~0) main_~y~0 (* main_~p~0 main_~x~0))) (= (+ main_~y~0 (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (= main_~d~0 1) (= (+ main_~q~0 main_~p~0) 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 06:05:50,012 INFO L290 TraceCheckUtils]: 89: Hoare triple {30842#(and (= main_~r~0 0) (= (+ main_~c~0 main_~v~0) (+ (* main_~q~0 main_~x~0) main_~y~0 (* main_~p~0 main_~x~0))) (= (+ main_~y~0 (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (= main_~d~0 1) (= (+ main_~q~0 main_~p~0) 0) (= main_~c~0 main_~x~0))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {30879#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~c~0 (+ (* main_~x~0 2) (* (- 1) (* main_~p~0 main_~x~0)) (* (- 1) main_~y~0) (* (- 1) (* main_~q~0 main_~x~0)))) (= (+ main_~y~0 (* main_~p~0 main_~x~0)) (+ main_~x~0 (* main_~y~0 main_~s~0))) (= main_~k~0 1) (= (+ main_~q~0 main_~p~0) 0))} is VALID [2022-04-28 06:05:50,013 INFO L290 TraceCheckUtils]: 90: Hoare triple {30879#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~c~0 (+ (* main_~x~0 2) (* (- 1) (* main_~p~0 main_~x~0)) (* (- 1) main_~y~0) (* (- 1) (* main_~q~0 main_~x~0)))) (= (+ main_~y~0 (* main_~p~0 main_~x~0)) (+ main_~x~0 (* main_~y~0 main_~s~0))) (= main_~k~0 1) (= (+ main_~q~0 main_~p~0) 0))} assume !false; {30879#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~c~0 (+ (* main_~x~0 2) (* (- 1) (* main_~p~0 main_~x~0)) (* (- 1) main_~y~0) (* (- 1) (* main_~q~0 main_~x~0)))) (= (+ main_~y~0 (* main_~p~0 main_~x~0)) (+ main_~x~0 (* main_~y~0 main_~s~0))) (= main_~k~0 1) (= (+ main_~q~0 main_~p~0) 0))} is VALID [2022-04-28 06:05:50,013 INFO L290 TraceCheckUtils]: 91: Hoare triple {30879#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~c~0 (+ (* main_~x~0 2) (* (- 1) (* main_~p~0 main_~x~0)) (* (- 1) main_~y~0) (* (- 1) (* main_~q~0 main_~x~0)))) (= (+ main_~y~0 (* main_~p~0 main_~x~0)) (+ main_~x~0 (* main_~y~0 main_~s~0))) (= main_~k~0 1) (= (+ main_~q~0 main_~p~0) 0))} assume !(~c~0 >= ~b~0); {30879#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~c~0 (+ (* main_~x~0 2) (* (- 1) (* main_~p~0 main_~x~0)) (* (- 1) main_~y~0) (* (- 1) (* main_~q~0 main_~x~0)))) (= (+ main_~y~0 (* main_~p~0 main_~x~0)) (+ main_~x~0 (* main_~y~0 main_~s~0))) (= main_~k~0 1) (= (+ main_~q~0 main_~p~0) 0))} is VALID [2022-04-28 06:05:50,017 INFO L290 TraceCheckUtils]: 92: Hoare triple {30879#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~c~0 (+ (* main_~x~0 2) (* (- 1) (* main_~p~0 main_~x~0)) (* (- 1) main_~y~0) (* (- 1) (* main_~q~0 main_~x~0)))) (= (+ main_~y~0 (* main_~p~0 main_~x~0)) (+ main_~x~0 (* main_~y~0 main_~s~0))) (= main_~k~0 1) (= (+ main_~q~0 main_~p~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; {30889#(and (= (+ main_~y~0 (* (* (div (- main_~q~0) 2) (- 1)) main_~x~0)) (+ main_~y~0 main_~x~0)) (= main_~b~0 (+ (* main_~x~0 2) (* (- 1) (* (* (div (- main_~q~0) 2) (- 1)) main_~x~0)) (* (- 1) (* (div (- main_~q~0) 2) main_~x~0)) (* (- 1) main_~y~0))) (= (mod main_~q~0 2) 0) (= (+ main_~s~0 1) 0))} is VALID [2022-04-28 06:05:50,018 INFO L290 TraceCheckUtils]: 93: Hoare triple {30889#(and (= (+ main_~y~0 (* (* (div (- main_~q~0) 2) (- 1)) main_~x~0)) (+ main_~y~0 main_~x~0)) (= main_~b~0 (+ (* main_~x~0 2) (* (- 1) (* (* (div (- main_~q~0) 2) (- 1)) main_~x~0)) (* (- 1) (* (div (- main_~q~0) 2) main_~x~0)) (* (- 1) main_~y~0))) (= (mod main_~q~0 2) 0) (= (+ main_~s~0 1) 0))} assume !false; {30889#(and (= (+ main_~y~0 (* (* (div (- main_~q~0) 2) (- 1)) main_~x~0)) (+ main_~y~0 main_~x~0)) (= main_~b~0 (+ (* main_~x~0 2) (* (- 1) (* (* (div (- main_~q~0) 2) (- 1)) main_~x~0)) (* (- 1) (* (div (- main_~q~0) 2) main_~x~0)) (* (- 1) main_~y~0))) (= (mod main_~q~0 2) 0) (= (+ main_~s~0 1) 0))} is VALID [2022-04-28 06:05:50,018 INFO L290 TraceCheckUtils]: 94: Hoare triple {30889#(and (= (+ main_~y~0 (* (* (div (- main_~q~0) 2) (- 1)) main_~x~0)) (+ main_~y~0 main_~x~0)) (= main_~b~0 (+ (* main_~x~0 2) (* (- 1) (* (* (div (- main_~q~0) 2) (- 1)) main_~x~0)) (* (- 1) (* (div (- main_~q~0) 2) main_~x~0)) (* (- 1) main_~y~0))) (= (mod main_~q~0 2) 0) (= (+ main_~s~0 1) 0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {30889#(and (= (+ main_~y~0 (* (* (div (- main_~q~0) 2) (- 1)) main_~x~0)) (+ main_~y~0 main_~x~0)) (= main_~b~0 (+ (* main_~x~0 2) (* (- 1) (* (* (div (- main_~q~0) 2) (- 1)) main_~x~0)) (* (- 1) (* (div (- main_~q~0) 2) main_~x~0)) (* (- 1) main_~y~0))) (= (mod main_~q~0 2) 0) (= (+ main_~s~0 1) 0))} is VALID [2022-04-28 06:05:50,019 INFO L290 TraceCheckUtils]: 95: Hoare triple {30889#(and (= (+ main_~y~0 (* (* (div (- main_~q~0) 2) (- 1)) main_~x~0)) (+ main_~y~0 main_~x~0)) (= main_~b~0 (+ (* main_~x~0 2) (* (- 1) (* (* (div (- main_~q~0) 2) (- 1)) main_~x~0)) (* (- 1) (* (div (- main_~q~0) 2) main_~x~0)) (* (- 1) main_~y~0))) (= (mod main_~q~0 2) 0) (= (+ main_~s~0 1) 0))} assume !false; {30889#(and (= (+ main_~y~0 (* (* (div (- main_~q~0) 2) (- 1)) main_~x~0)) (+ main_~y~0 main_~x~0)) (= main_~b~0 (+ (* main_~x~0 2) (* (- 1) (* (* (div (- main_~q~0) 2) (- 1)) main_~x~0)) (* (- 1) (* (div (- main_~q~0) 2) main_~x~0)) (* (- 1) main_~y~0))) (= (mod main_~q~0 2) 0) (= (+ main_~s~0 1) 0))} is VALID [2022-04-28 06:05:50,019 INFO L290 TraceCheckUtils]: 96: Hoare triple {30889#(and (= (+ main_~y~0 (* (* (div (- main_~q~0) 2) (- 1)) main_~x~0)) (+ main_~y~0 main_~x~0)) (= main_~b~0 (+ (* main_~x~0 2) (* (- 1) (* (* (div (- main_~q~0) 2) (- 1)) main_~x~0)) (* (- 1) (* (div (- main_~q~0) 2) main_~x~0)) (* (- 1) main_~y~0))) (= (mod main_~q~0 2) 0) (= (+ main_~s~0 1) 0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {30889#(and (= (+ main_~y~0 (* (* (div (- main_~q~0) 2) (- 1)) main_~x~0)) (+ main_~y~0 main_~x~0)) (= main_~b~0 (+ (* main_~x~0 2) (* (- 1) (* (* (div (- main_~q~0) 2) (- 1)) main_~x~0)) (* (- 1) (* (div (- main_~q~0) 2) main_~x~0)) (* (- 1) main_~y~0))) (= (mod main_~q~0 2) 0) (= (+ main_~s~0 1) 0))} is VALID [2022-04-28 06:05:50,020 INFO L290 TraceCheckUtils]: 97: Hoare triple {30889#(and (= (+ main_~y~0 (* (* (div (- main_~q~0) 2) (- 1)) main_~x~0)) (+ main_~y~0 main_~x~0)) (= main_~b~0 (+ (* main_~x~0 2) (* (- 1) (* (* (div (- main_~q~0) 2) (- 1)) main_~x~0)) (* (- 1) (* (div (- main_~q~0) 2) main_~x~0)) (* (- 1) main_~y~0))) (= (mod main_~q~0 2) 0) (= (+ main_~s~0 1) 0))} assume !false; {30889#(and (= (+ main_~y~0 (* (* (div (- main_~q~0) 2) (- 1)) main_~x~0)) (+ main_~y~0 main_~x~0)) (= main_~b~0 (+ (* main_~x~0 2) (* (- 1) (* (* (div (- main_~q~0) 2) (- 1)) main_~x~0)) (* (- 1) (* (div (- main_~q~0) 2) main_~x~0)) (* (- 1) main_~y~0))) (= (mod main_~q~0 2) 0) (= (+ main_~s~0 1) 0))} is VALID [2022-04-28 06:05:50,020 INFO L272 TraceCheckUtils]: 98: Hoare triple {30889#(and (= (+ main_~y~0 (* (* (div (- main_~q~0) 2) (- 1)) main_~x~0)) (+ main_~y~0 main_~x~0)) (= main_~b~0 (+ (* main_~x~0 2) (* (- 1) (* (* (div (- main_~q~0) 2) (- 1)) main_~x~0)) (* (- 1) (* (div (- main_~q~0) 2) main_~x~0)) (* (- 1) main_~y~0))) (= (mod main_~q~0 2) 0) (= (+ main_~s~0 1) 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {30592#true} is VALID [2022-04-28 06:05:50,020 INFO L290 TraceCheckUtils]: 99: Hoare triple {30592#true} ~cond := #in~cond; {30592#true} is VALID [2022-04-28 06:05:50,020 INFO L290 TraceCheckUtils]: 100: Hoare triple {30592#true} assume !(0 == ~cond); {30592#true} is VALID [2022-04-28 06:05:50,020 INFO L290 TraceCheckUtils]: 101: Hoare triple {30592#true} assume true; {30592#true} is VALID [2022-04-28 06:05:50,021 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {30592#true} {30889#(and (= (+ main_~y~0 (* (* (div (- main_~q~0) 2) (- 1)) main_~x~0)) (+ main_~y~0 main_~x~0)) (= main_~b~0 (+ (* main_~x~0 2) (* (- 1) (* (* (div (- main_~q~0) 2) (- 1)) main_~x~0)) (* (- 1) (* (div (- main_~q~0) 2) main_~x~0)) (* (- 1) main_~y~0))) (= (mod main_~q~0 2) 0) (= (+ main_~s~0 1) 0))} #102#return; {30889#(and (= (+ main_~y~0 (* (* (div (- main_~q~0) 2) (- 1)) main_~x~0)) (+ main_~y~0 main_~x~0)) (= main_~b~0 (+ (* main_~x~0 2) (* (- 1) (* (* (div (- main_~q~0) 2) (- 1)) main_~x~0)) (* (- 1) (* (div (- main_~q~0) 2) main_~x~0)) (* (- 1) main_~y~0))) (= (mod main_~q~0 2) 0) (= (+ main_~s~0 1) 0))} is VALID [2022-04-28 06:05:50,023 INFO L272 TraceCheckUtils]: 103: Hoare triple {30889#(and (= (+ main_~y~0 (* (* (div (- main_~q~0) 2) (- 1)) main_~x~0)) (+ main_~y~0 main_~x~0)) (= main_~b~0 (+ (* main_~x~0 2) (* (- 1) (* (* (div (- main_~q~0) 2) (- 1)) main_~x~0)) (* (- 1) (* (div (- main_~q~0) 2) main_~x~0)) (* (- 1) main_~y~0))) (= (mod main_~q~0 2) 0) (= (+ main_~s~0 1) 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {30923#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 06:05:50,023 INFO L290 TraceCheckUtils]: 104: Hoare triple {30923#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {30927#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:05:50,024 INFO L290 TraceCheckUtils]: 105: Hoare triple {30927#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {30593#false} is VALID [2022-04-28 06:05:50,024 INFO L290 TraceCheckUtils]: 106: Hoare triple {30593#false} assume !false; {30593#false} is VALID [2022-04-28 06:05:50,024 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 22 proven. 114 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-04-28 06:05:50,024 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:07:04,320 INFO L290 TraceCheckUtils]: 106: Hoare triple {30593#false} assume !false; {30593#false} is VALID [2022-04-28 06:07:04,320 INFO L290 TraceCheckUtils]: 105: Hoare triple {30927#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {30593#false} is VALID [2022-04-28 06:07:04,321 INFO L290 TraceCheckUtils]: 104: Hoare triple {30923#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {30927#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:07:04,321 INFO L272 TraceCheckUtils]: 103: Hoare triple {30943#(= 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)); {30923#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 06:07:04,322 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {30592#true} {30943#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #102#return; {30943#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 06:07:04,322 INFO L290 TraceCheckUtils]: 101: Hoare triple {30592#true} assume true; {30592#true} is VALID [2022-04-28 06:07:04,322 INFO L290 TraceCheckUtils]: 100: Hoare triple {30592#true} assume !(0 == ~cond); {30592#true} is VALID [2022-04-28 06:07:04,322 INFO L290 TraceCheckUtils]: 99: Hoare triple {30592#true} ~cond := #in~cond; {30592#true} is VALID [2022-04-28 06:07:04,322 INFO L272 TraceCheckUtils]: 98: Hoare triple {30943#(= 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)); {30592#true} is VALID [2022-04-28 06:07:04,323 INFO L290 TraceCheckUtils]: 97: Hoare triple {30943#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {30943#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 06:07:04,323 INFO L290 TraceCheckUtils]: 96: Hoare triple {30943#(= 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; {30943#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 06:07:04,323 INFO L290 TraceCheckUtils]: 95: Hoare triple {30943#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {30943#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 06:07:04,324 INFO L290 TraceCheckUtils]: 94: Hoare triple {30943#(= 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; {30943#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 06:07:04,324 INFO L290 TraceCheckUtils]: 93: Hoare triple {30943#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {30943#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID