/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_unwindbound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 12:28:37,461 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 12:28:37,463 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 12:28:37,518 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 12:28:37,518 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 12:28:37,519 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 12:28:37,520 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 12:28:37,522 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 12:28:37,523 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 12:28:37,524 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 12:28:37,525 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 12:28:37,526 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 12:28:37,526 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 12:28:37,527 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 12:28:37,529 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 12:28:37,529 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 12:28:37,530 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 12:28:37,531 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 12:28:37,532 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 12:28:37,533 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 12:28:37,534 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 12:28:37,535 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 12:28:37,536 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 12:28:37,537 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 12:28:37,538 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 12:28:37,540 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 12:28:37,540 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 12:28:37,541 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 12:28:37,541 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 12:28:37,542 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 12:28:37,542 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 12:28:37,543 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 12:28:37,543 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 12:28:37,544 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 12:28:37,544 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 12:28:37,545 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 12:28:37,545 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 12:28:37,546 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 12:28:37,546 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 12:28:37,546 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 12:28:37,547 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 12:28:37,548 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 12:28:37,548 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 12:28:37,555 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 12:28:37,556 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 12:28:37,557 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 12:28:37,557 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 12:28:37,557 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 12:28:37,557 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 12:28:37,557 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 12:28:37,557 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 12:28:37,558 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 12:28:37,558 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 12:28:37,558 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 12:28:37,558 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 12:28:37,558 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 12:28:37,558 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 12:28:37,558 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 12:28:37,559 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 12:28:37,559 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 12:28:37,559 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 12:28:37,559 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 12:28:37,559 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 12:28:37,559 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 12:28:37,560 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 12:28:37,560 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 12:28:37,771 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 12:28:37,790 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 12:28:37,792 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 12:28:37,793 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 12:28:37,795 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 12:28:37,795 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_unwindbound10.c [2022-04-28 12:28:37,846 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86dd9f85e/dc26f101666f4c4a8dd366df904a8b92/FLAGa01149c43 [2022-04-28 12:28:38,228 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 12:28:38,229 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_unwindbound10.c [2022-04-28 12:28:38,238 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86dd9f85e/dc26f101666f4c4a8dd366df904a8b92/FLAGa01149c43 [2022-04-28 12:28:38,256 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86dd9f85e/dc26f101666f4c4a8dd366df904a8b92 [2022-04-28 12:28:38,258 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 12:28:38,260 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 12:28:38,263 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 12:28:38,263 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 12:28:38,266 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 12:28:38,267 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 12:28:38" (1/1) ... [2022-04-28 12:28:38,268 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29d0cdb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:28:38, skipping insertion in model container [2022-04-28 12:28:38,268 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 12:28:38" (1/1) ... [2022-04-28 12:28:38,275 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 12:28:38,290 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 12:28:38,481 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_unwindbound10.c[490,503] [2022-04-28 12:28:38,514 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 12:28:38,540 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 12:28:38,560 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_unwindbound10.c[490,503] [2022-04-28 12:28:38,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 12:28:38,580 INFO L208 MainTranslator]: Completed translation [2022-04-28 12:28:38,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:28:38 WrapperNode [2022-04-28 12:28:38,581 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 12:28:38,582 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 12:28:38,582 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 12:28:38,582 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 12:28:38,593 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:28:38" (1/1) ... [2022-04-28 12:28:38,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:28:38" (1/1) ... [2022-04-28 12:28:38,600 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:28:38" (1/1) ... [2022-04-28 12:28:38,600 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:28:38" (1/1) ... [2022-04-28 12:28:38,607 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:28:38" (1/1) ... [2022-04-28 12:28:38,617 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:28:38" (1/1) ... [2022-04-28 12:28:38,618 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:28:38" (1/1) ... [2022-04-28 12:28:38,619 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 12:28:38,620 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 12:28:38,620 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 12:28:38,620 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 12:28:38,624 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:28:38" (1/1) ... [2022-04-28 12:28:38,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 12:28:38,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:28:38,651 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 12:28:38,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 12:28:38,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 12:28:38,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 12:28:38,687 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 12:28:38,687 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 12:28:38,688 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 12:28:38,688 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 12:28:38,688 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 12:28:38,688 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 12:28:38,688 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 12:28:38,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 12:28:38,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 12:28:38,689 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 12:28:38,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 12:28:38,689 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 12:28:38,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 12:28:38,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 12:28:38,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 12:28:38,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 12:28:38,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 12:28:38,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 12:28:38,766 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 12:28:38,767 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 12:28:38,986 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 12:28:38,991 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 12:28:38,991 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-28 12:28:38,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 12:28:38 BoogieIcfgContainer [2022-04-28 12:28:38,993 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 12:28:38,994 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 12:28:38,994 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 12:28:38,997 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 12:28:38,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 12:28:38" (1/3) ... [2022-04-28 12:28:38,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c2361b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 12:28:38, skipping insertion in model container [2022-04-28 12:28:38,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:28:38" (2/3) ... [2022-04-28 12:28:38,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c2361b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 12:28:38, skipping insertion in model container [2022-04-28 12:28:38,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 12:28:38" (3/3) ... [2022-04-28 12:28:38,999 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd3-ll_unwindbound10.c [2022-04-28 12:28:39,012 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 12:28:39,012 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 12:28:39,048 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 12:28:39,053 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@245ae1f3, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3f1e23a0 [2022-04-28 12:28:39,053 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 12:28:39,065 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 25 states have (on average 1.48) internal successors, (37), 26 states have internal predecessors, (37), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 12:28:39,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 12:28:39,072 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:28:39,072 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:28:39,073 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:28:39,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:28:39,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1766263304, now seen corresponding path program 1 times [2022-04-28 12:28:39,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:28:39,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [401949270] [2022-04-28 12:28:39,100 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:28:39,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1766263304, now seen corresponding path program 2 times [2022-04-28 12:28:39,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:28:39,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783093107] [2022-04-28 12:28:39,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:28:39,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:28:39,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:28:39,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 12:28:39,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:28:39,244 INFO L290 TraceCheckUtils]: 0: Hoare triple {56#(and (= ~counter~0 |old(~counter~0)|) (= |#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);~counter~0 := 0; {43#true} is VALID [2022-04-28 12:28:39,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume true; {43#true} is VALID [2022-04-28 12:28:39,244 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43#true} {43#true} #108#return; {43#true} is VALID [2022-04-28 12:28:39,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 12:28:39,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:28:39,252 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 12:28:39,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 12:28:39,253 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 12:28:39,254 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {43#true} #94#return; {44#false} is VALID [2022-04-28 12:28:39,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 12:28:39,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:28:39,261 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 12:28:39,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 12:28:39,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 12:28:39,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #96#return; {44#false} is VALID [2022-04-28 12:28:39,263 INFO L272 TraceCheckUtils]: 0: Hoare triple {43#true} call ULTIMATE.init(); {56#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 12:28:39,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {56#(and (= ~counter~0 |old(~counter~0)|) (= |#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);~counter~0 := 0; {43#true} is VALID [2022-04-28 12:28:39,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#true} assume true; {43#true} is VALID [2022-04-28 12:28:39,264 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#true} {43#true} #108#return; {43#true} is VALID [2022-04-28 12:28:39,264 INFO L272 TraceCheckUtils]: 4: Hoare triple {43#true} call #t~ret9 := main(); {43#true} is VALID [2022-04-28 12:28:39,264 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {43#true} is VALID [2022-04-28 12:28:39,265 INFO L272 TraceCheckUtils]: 6: Hoare triple {43#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {43#true} is VALID [2022-04-28 12:28:39,265 INFO L290 TraceCheckUtils]: 7: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 12:28:39,265 INFO L290 TraceCheckUtils]: 8: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 12:28:39,266 INFO L290 TraceCheckUtils]: 9: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 12:28:39,266 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {44#false} {43#true} #94#return; {44#false} is VALID [2022-04-28 12:28:39,266 INFO L272 TraceCheckUtils]: 11: Hoare triple {44#false} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {43#true} is VALID [2022-04-28 12:28:39,267 INFO L290 TraceCheckUtils]: 12: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 12:28:39,267 INFO L290 TraceCheckUtils]: 13: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 12:28:39,267 INFO L290 TraceCheckUtils]: 14: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 12:28:39,268 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {44#false} {44#false} #96#return; {44#false} is VALID [2022-04-28 12:28:39,268 INFO L290 TraceCheckUtils]: 16: Hoare triple {44#false} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {44#false} is VALID [2022-04-28 12:28:39,268 INFO L290 TraceCheckUtils]: 17: Hoare triple {44#false} assume !true; {44#false} is VALID [2022-04-28 12:28:39,268 INFO L272 TraceCheckUtils]: 18: Hoare triple {44#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {44#false} is VALID [2022-04-28 12:28:39,269 INFO L290 TraceCheckUtils]: 19: Hoare triple {44#false} ~cond := #in~cond; {44#false} is VALID [2022-04-28 12:28:39,269 INFO L290 TraceCheckUtils]: 20: Hoare triple {44#false} assume 0 == ~cond; {44#false} is VALID [2022-04-28 12:28:39,269 INFO L290 TraceCheckUtils]: 21: Hoare triple {44#false} assume !false; {44#false} is VALID [2022-04-28 12:28:39,270 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 12:28:39,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:28:39,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783093107] [2022-04-28 12:28:39,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783093107] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:28:39,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:28:39,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 12:28:39,274 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:28:39,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [401949270] [2022-04-28 12:28:39,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [401949270] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:28:39,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:28:39,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 12:28:39,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702964548] [2022-04-28 12:28:39,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:28:39,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 12:28:39,281 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:28:39,284 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:28:39,308 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:28:39,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 12:28:39,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:28:39,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 12:28:39,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 12:28:39,331 INFO L87 Difference]: Start difference. First operand has 40 states, 25 states have (on average 1.48) internal successors, (37), 26 states have internal predecessors, (37), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:28:39,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:28:39,519 INFO L93 Difference]: Finished difference Result 74 states and 111 transitions. [2022-04-28 12:28:39,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 12:28:39,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 12:28:39,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:28:39,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:28:39,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-28 12:28:39,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:28:39,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-28 12:28:39,554 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 111 transitions. [2022-04-28 12:28:39,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:28:39,712 INFO L225 Difference]: With dead ends: 74 [2022-04-28 12:28:39,712 INFO L226 Difference]: Without dead ends: 36 [2022-04-28 12:28:39,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 12:28:39,717 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:28:39,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 51 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:28:39,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-28 12:28:39,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-04-28 12:28:39,746 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:28:39,747 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 12:28:39,748 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 12:28:39,748 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 12:28:39,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:28:39,754 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2022-04-28 12:28:39,754 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2022-04-28 12:28:39,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:28:39,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:28:39,756 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-28 12:28:39,756 INFO L87 Difference]: Start difference. First operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-28 12:28:39,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:28:39,761 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2022-04-28 12:28:39,761 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2022-04-28 12:28:39,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:28:39,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:28:39,762 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:28:39,762 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:28:39,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 12:28:39,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2022-04-28 12:28:39,768 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 22 [2022-04-28 12:28:39,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:28:39,768 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2022-04-28 12:28:39,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:28:39,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 45 transitions. [2022-04-28 12:28:39,826 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:28:39,827 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2022-04-28 12:28:39,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 12:28:39,828 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:28:39,828 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:28:39,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 12:28:39,829 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:28:39,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:28:39,830 INFO L85 PathProgramCache]: Analyzing trace with hash -81203399, now seen corresponding path program 1 times [2022-04-28 12:28:39,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:28:39,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [321969107] [2022-04-28 12:28:39,832 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:28:39,832 INFO L85 PathProgramCache]: Analyzing trace with hash -81203399, now seen corresponding path program 2 times [2022-04-28 12:28:39,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:28:39,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700719746] [2022-04-28 12:28:39,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:28:39,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:28:39,881 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:28:39,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1114168177] [2022-04-28 12:28:39,882 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:28:39,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:28:39,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:28:39,885 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:28:39,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 12:28:39,942 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 12:28:39,942 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:28:39,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 12:28:39,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:28:39,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:28:40,147 INFO L272 TraceCheckUtils]: 0: Hoare triple {349#true} call ULTIMATE.init(); {349#true} is VALID [2022-04-28 12:28:40,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {349#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);~counter~0 := 0; {357#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:40,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {357#(<= ~counter~0 0)} assume true; {357#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:40,149 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {357#(<= ~counter~0 0)} {349#true} #108#return; {357#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:40,150 INFO L272 TraceCheckUtils]: 4: Hoare triple {357#(<= ~counter~0 0)} call #t~ret9 := main(); {357#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:40,151 INFO L290 TraceCheckUtils]: 5: Hoare triple {357#(<= ~counter~0 0)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {357#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:40,152 INFO L272 TraceCheckUtils]: 6: Hoare triple {357#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {357#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:40,153 INFO L290 TraceCheckUtils]: 7: Hoare triple {357#(<= ~counter~0 0)} ~cond := #in~cond; {357#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:40,154 INFO L290 TraceCheckUtils]: 8: Hoare triple {357#(<= ~counter~0 0)} assume !(0 == ~cond); {357#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:40,155 INFO L290 TraceCheckUtils]: 9: Hoare triple {357#(<= ~counter~0 0)} assume true; {357#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:40,156 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {357#(<= ~counter~0 0)} {357#(<= ~counter~0 0)} #94#return; {357#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:40,157 INFO L272 TraceCheckUtils]: 11: Hoare triple {357#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {357#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:40,157 INFO L290 TraceCheckUtils]: 12: Hoare triple {357#(<= ~counter~0 0)} ~cond := #in~cond; {357#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:40,158 INFO L290 TraceCheckUtils]: 13: Hoare triple {357#(<= ~counter~0 0)} assume !(0 == ~cond); {357#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:40,161 INFO L290 TraceCheckUtils]: 14: Hoare triple {357#(<= ~counter~0 0)} assume true; {357#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:40,164 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {357#(<= ~counter~0 0)} {357#(<= ~counter~0 0)} #96#return; {357#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:40,167 INFO L290 TraceCheckUtils]: 16: Hoare triple {357#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {357#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:40,167 INFO L290 TraceCheckUtils]: 17: Hoare triple {357#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {406#(<= |main_#t~post6| 0)} is VALID [2022-04-28 12:28:40,168 INFO L290 TraceCheckUtils]: 18: Hoare triple {406#(<= |main_#t~post6| 0)} assume !(#t~post6 < 10);havoc #t~post6; {350#false} is VALID [2022-04-28 12:28:40,168 INFO L272 TraceCheckUtils]: 19: Hoare triple {350#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)); {350#false} is VALID [2022-04-28 12:28:40,168 INFO L290 TraceCheckUtils]: 20: Hoare triple {350#false} ~cond := #in~cond; {350#false} is VALID [2022-04-28 12:28:40,168 INFO L290 TraceCheckUtils]: 21: Hoare triple {350#false} assume 0 == ~cond; {350#false} is VALID [2022-04-28 12:28:40,169 INFO L290 TraceCheckUtils]: 22: Hoare triple {350#false} assume !false; {350#false} is VALID [2022-04-28 12:28:40,169 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 12:28:40,169 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:28:40,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:28:40,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700719746] [2022-04-28 12:28:40,170 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:28:40,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114168177] [2022-04-28 12:28:40,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114168177] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:28:40,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:28:40,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 12:28:40,171 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:28:40,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [321969107] [2022-04-28 12:28:40,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [321969107] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:28:40,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:28:40,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 12:28:40,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461651862] [2022-04-28 12:28:40,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:28:40,173 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-28 12:28:40,173 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:28:40,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:28:40,194 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:28:40,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 12:28:40,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:28:40,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 12:28:40,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 12:28:40,197 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:28:40,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:28:40,315 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2022-04-28 12:28:40,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 12:28:40,316 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-28 12:28:40,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:28:40,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:28:40,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-04-28 12:28:40,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:28:40,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-04-28 12:28:40,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 54 transitions. [2022-04-28 12:28:40,367 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 12:28:40,369 INFO L225 Difference]: With dead ends: 44 [2022-04-28 12:28:40,369 INFO L226 Difference]: Without dead ends: 37 [2022-04-28 12:28:40,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 12:28:40,371 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:28:40,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:28:40,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-28 12:28:40,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-28 12:28:40,385 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:28:40,385 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 12:28:40,386 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 12:28:40,386 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 12:28:40,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:28:40,388 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2022-04-28 12:28:40,389 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-04-28 12:28:40,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:28:40,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:28:40,390 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 37 states. [2022-04-28 12:28:40,390 INFO L87 Difference]: Start difference. First operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 37 states. [2022-04-28 12:28:40,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:28:40,393 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2022-04-28 12:28:40,393 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-04-28 12:28:40,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:28:40,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:28:40,394 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:28:40,394 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:28:40,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 12:28:40,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2022-04-28 12:28:40,397 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 23 [2022-04-28 12:28:40,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:28:40,397 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2022-04-28 12:28:40,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:28:40,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 47 transitions. [2022-04-28 12:28:40,442 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:28:40,442 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-04-28 12:28:40,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 12:28:40,443 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:28:40,443 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:28:40,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 12:28:40,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:28:40,666 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:28:40,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:28:40,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1762644405, now seen corresponding path program 1 times [2022-04-28 12:28:40,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:28:40,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1936282661] [2022-04-28 12:28:40,668 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:28:40,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1762644405, now seen corresponding path program 2 times [2022-04-28 12:28:40,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:28:40,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900513762] [2022-04-28 12:28:40,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:28:40,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:28:40,694 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:28:40,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [467017953] [2022-04-28 12:28:40,695 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:28:40,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:28:40,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:28:40,702 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:28:40,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 12:28:40,750 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 12:28:40,750 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:28:40,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 12:28:40,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:28:40,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:28:41,029 INFO L272 TraceCheckUtils]: 0: Hoare triple {657#true} call ULTIMATE.init(); {657#true} is VALID [2022-04-28 12:28:41,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {657#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);~counter~0 := 0; {657#true} is VALID [2022-04-28 12:28:41,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {657#true} assume true; {657#true} is VALID [2022-04-28 12:28:41,030 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {657#true} {657#true} #108#return; {657#true} is VALID [2022-04-28 12:28:41,031 INFO L272 TraceCheckUtils]: 4: Hoare triple {657#true} call #t~ret9 := main(); {657#true} is VALID [2022-04-28 12:28:41,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {657#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {657#true} is VALID [2022-04-28 12:28:41,031 INFO L272 TraceCheckUtils]: 6: Hoare triple {657#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {657#true} is VALID [2022-04-28 12:28:41,031 INFO L290 TraceCheckUtils]: 7: Hoare triple {657#true} ~cond := #in~cond; {657#true} is VALID [2022-04-28 12:28:41,032 INFO L290 TraceCheckUtils]: 8: Hoare triple {657#true} assume !(0 == ~cond); {657#true} is VALID [2022-04-28 12:28:41,032 INFO L290 TraceCheckUtils]: 9: Hoare triple {657#true} assume true; {657#true} is VALID [2022-04-28 12:28:41,032 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {657#true} {657#true} #94#return; {657#true} is VALID [2022-04-28 12:28:41,032 INFO L272 TraceCheckUtils]: 11: Hoare triple {657#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {657#true} is VALID [2022-04-28 12:28:41,033 INFO L290 TraceCheckUtils]: 12: Hoare triple {657#true} ~cond := #in~cond; {657#true} is VALID [2022-04-28 12:28:41,033 INFO L290 TraceCheckUtils]: 13: Hoare triple {657#true} assume !(0 == ~cond); {657#true} is VALID [2022-04-28 12:28:41,033 INFO L290 TraceCheckUtils]: 14: Hoare triple {657#true} assume true; {657#true} is VALID [2022-04-28 12:28:41,033 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {657#true} {657#true} #96#return; {657#true} is VALID [2022-04-28 12:28:41,034 INFO L290 TraceCheckUtils]: 16: Hoare triple {657#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {710#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:28:41,035 INFO L290 TraceCheckUtils]: 17: Hoare triple {710#(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))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {710#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:28:41,035 INFO L290 TraceCheckUtils]: 18: Hoare triple {710#(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 !!(#t~post6 < 10);havoc #t~post6; {710#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:28:41,036 INFO L290 TraceCheckUtils]: 19: Hoare triple {710#(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); {720#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:28:41,037 INFO L272 TraceCheckUtils]: 20: Hoare triple {720#(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)); {724#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:28:41,038 INFO L290 TraceCheckUtils]: 21: Hoare triple {724#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {728#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:28:41,038 INFO L290 TraceCheckUtils]: 22: Hoare triple {728#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {658#false} is VALID [2022-04-28 12:28:41,039 INFO L290 TraceCheckUtils]: 23: Hoare triple {658#false} assume !false; {658#false} is VALID [2022-04-28 12:28:41,039 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 12:28:41,039 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:28:41,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:28:41,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900513762] [2022-04-28 12:28:41,040 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:28:41,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467017953] [2022-04-28 12:28:41,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467017953] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:28:41,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:28:41,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 12:28:41,041 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:28:41,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1936282661] [2022-04-28 12:28:41,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1936282661] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:28:41,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:28:41,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 12:28:41,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14418541] [2022-04-28 12:28:41,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:28:41,042 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-04-28 12:28:41,043 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:28:41,043 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 12:28:41,061 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:28:41,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 12:28:41,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:28:41,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 12:28:41,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 12:28:41,063 INFO L87 Difference]: Start difference. First operand 37 states and 47 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 12:28:41,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:28:41,419 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2022-04-28 12:28:41,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 12:28:41,420 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-04-28 12:28:41,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:28:41,421 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 12:28:41,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-04-28 12:28:41,426 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 12:28:41,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-04-28 12:28:41,432 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 75 transitions. [2022-04-28 12:28:41,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:28:41,501 INFO L225 Difference]: With dead ends: 57 [2022-04-28 12:28:41,501 INFO L226 Difference]: Without dead ends: 54 [2022-04-28 12:28:41,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 12:28:41,503 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 18 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 12:28:41,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 169 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 12:28:41,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-28 12:28:41,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2022-04-28 12:28:41,521 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:28:41,521 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 53 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 36 states have internal predecessors, (46), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 12:28:41,521 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 53 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 36 states have internal predecessors, (46), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 12:28:41,522 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 53 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 36 states have internal predecessors, (46), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 12:28:41,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:28:41,525 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2022-04-28 12:28:41,525 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 71 transitions. [2022-04-28 12:28:41,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:28:41,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:28:41,526 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 36 states have internal predecessors, (46), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 54 states. [2022-04-28 12:28:41,527 INFO L87 Difference]: Start difference. First operand has 53 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 36 states have internal predecessors, (46), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 54 states. [2022-04-28 12:28:41,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:28:41,530 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2022-04-28 12:28:41,530 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 71 transitions. [2022-04-28 12:28:41,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:28:41,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:28:41,531 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:28:41,531 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:28:41,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 36 states have internal predecessors, (46), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 12:28:41,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 70 transitions. [2022-04-28 12:28:41,534 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 70 transitions. Word has length 24 [2022-04-28 12:28:41,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:28:41,534 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 70 transitions. [2022-04-28 12:28:41,534 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 12:28:41,534 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 70 transitions. [2022-04-28 12:28:41,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:28:41,596 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 70 transitions. [2022-04-28 12:28:41,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 12:28:41,597 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:28:41,597 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:28:41,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 12:28:41,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-28 12:28:41,816 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:28:41,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:28:41,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1090347867, now seen corresponding path program 1 times [2022-04-28 12:28:41,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:28:41,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [548733349] [2022-04-28 12:28:41,817 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:28:41,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1090347867, now seen corresponding path program 2 times [2022-04-28 12:28:41,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:28:41,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760530435] [2022-04-28 12:28:41,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:28:41,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:28:41,844 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:28:41,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [830605945] [2022-04-28 12:28:41,845 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:28:41,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:28:41,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:28:41,860 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:28:41,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 12:28:41,912 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:28:41,912 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:28:41,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 12:28:41,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:28:41,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:28:42,072 INFO L272 TraceCheckUtils]: 0: Hoare triple {1066#true} call ULTIMATE.init(); {1066#true} is VALID [2022-04-28 12:28:42,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {1066#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);~counter~0 := 0; {1074#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:42,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {1074#(<= ~counter~0 0)} assume true; {1074#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:42,074 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1074#(<= ~counter~0 0)} {1066#true} #108#return; {1074#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:42,076 INFO L272 TraceCheckUtils]: 4: Hoare triple {1074#(<= ~counter~0 0)} call #t~ret9 := main(); {1074#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:42,077 INFO L290 TraceCheckUtils]: 5: Hoare triple {1074#(<= ~counter~0 0)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1074#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:42,077 INFO L272 TraceCheckUtils]: 6: Hoare triple {1074#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1074#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:42,078 INFO L290 TraceCheckUtils]: 7: Hoare triple {1074#(<= ~counter~0 0)} ~cond := #in~cond; {1074#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:42,078 INFO L290 TraceCheckUtils]: 8: Hoare triple {1074#(<= ~counter~0 0)} assume !(0 == ~cond); {1074#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:42,079 INFO L290 TraceCheckUtils]: 9: Hoare triple {1074#(<= ~counter~0 0)} assume true; {1074#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:42,079 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1074#(<= ~counter~0 0)} {1074#(<= ~counter~0 0)} #94#return; {1074#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:42,080 INFO L272 TraceCheckUtils]: 11: Hoare triple {1074#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1074#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:42,080 INFO L290 TraceCheckUtils]: 12: Hoare triple {1074#(<= ~counter~0 0)} ~cond := #in~cond; {1074#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:42,081 INFO L290 TraceCheckUtils]: 13: Hoare triple {1074#(<= ~counter~0 0)} assume !(0 == ~cond); {1074#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:42,081 INFO L290 TraceCheckUtils]: 14: Hoare triple {1074#(<= ~counter~0 0)} assume true; {1074#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:42,082 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1074#(<= ~counter~0 0)} {1074#(<= ~counter~0 0)} #96#return; {1074#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:42,082 INFO L290 TraceCheckUtils]: 16: Hoare triple {1074#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {1074#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:42,083 INFO L290 TraceCheckUtils]: 17: Hoare triple {1074#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1123#(<= ~counter~0 1)} is VALID [2022-04-28 12:28:42,083 INFO L290 TraceCheckUtils]: 18: Hoare triple {1123#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {1123#(<= ~counter~0 1)} is VALID [2022-04-28 12:28:42,084 INFO L290 TraceCheckUtils]: 19: Hoare triple {1123#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {1123#(<= ~counter~0 1)} is VALID [2022-04-28 12:28:42,084 INFO L290 TraceCheckUtils]: 20: Hoare triple {1123#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1133#(<= |main_#t~post7| 1)} is VALID [2022-04-28 12:28:42,087 INFO L290 TraceCheckUtils]: 21: Hoare triple {1133#(<= |main_#t~post7| 1)} assume !(#t~post7 < 10);havoc #t~post7; {1067#false} is VALID [2022-04-28 12:28:42,087 INFO L290 TraceCheckUtils]: 22: Hoare triple {1067#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; {1067#false} is VALID [2022-04-28 12:28:42,087 INFO L290 TraceCheckUtils]: 23: Hoare triple {1067#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1067#false} is VALID [2022-04-28 12:28:42,088 INFO L290 TraceCheckUtils]: 24: Hoare triple {1067#false} assume !(#t~post6 < 10);havoc #t~post6; {1067#false} is VALID [2022-04-28 12:28:42,088 INFO L272 TraceCheckUtils]: 25: Hoare triple {1067#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)); {1067#false} is VALID [2022-04-28 12:28:42,088 INFO L290 TraceCheckUtils]: 26: Hoare triple {1067#false} ~cond := #in~cond; {1067#false} is VALID [2022-04-28 12:28:42,088 INFO L290 TraceCheckUtils]: 27: Hoare triple {1067#false} assume 0 == ~cond; {1067#false} is VALID [2022-04-28 12:28:42,088 INFO L290 TraceCheckUtils]: 28: Hoare triple {1067#false} assume !false; {1067#false} is VALID [2022-04-28 12:28:42,089 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 12:28:42,089 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:28:42,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:28:42,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760530435] [2022-04-28 12:28:42,089 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:28:42,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830605945] [2022-04-28 12:28:42,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830605945] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:28:42,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:28:42,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:28:42,090 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:28:42,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [548733349] [2022-04-28 12:28:42,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [548733349] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:28:42,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:28:42,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:28:42,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786200115] [2022-04-28 12:28:42,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:28:42,091 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-04-28 12:28:42,091 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:28:42,092 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:28:42,111 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:28:42,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 12:28:42,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:28:42,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 12:28:42,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 12:28:42,112 INFO L87 Difference]: Start difference. First operand 53 states and 70 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:28:42,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:28:42,241 INFO L93 Difference]: Finished difference Result 77 states and 104 transitions. [2022-04-28 12:28:42,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 12:28:42,241 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-04-28 12:28:42,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:28:42,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:28:42,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2022-04-28 12:28:42,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:28:42,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2022-04-28 12:28:42,245 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 82 transitions. [2022-04-28 12:28:42,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:28:42,307 INFO L225 Difference]: With dead ends: 77 [2022-04-28 12:28:42,307 INFO L226 Difference]: Without dead ends: 55 [2022-04-28 12:28:42,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 12:28:42,308 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:28:42,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 139 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:28:42,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-28 12:28:42,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-28 12:28:42,329 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:28:42,329 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 12:28:42,329 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 12:28:42,330 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 12:28:42,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:28:42,332 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2022-04-28 12:28:42,332 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 72 transitions. [2022-04-28 12:28:42,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:28:42,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:28:42,333 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 55 states. [2022-04-28 12:28:42,334 INFO L87 Difference]: Start difference. First operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 55 states. [2022-04-28 12:28:42,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:28:42,336 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2022-04-28 12:28:42,336 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 72 transitions. [2022-04-28 12:28:42,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:28:42,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:28:42,337 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:28:42,337 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:28:42,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 12:28:42,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 72 transitions. [2022-04-28 12:28:42,340 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 72 transitions. Word has length 29 [2022-04-28 12:28:42,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:28:42,340 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 72 transitions. [2022-04-28 12:28:42,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:28:42,341 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 72 transitions. [2022-04-28 12:28:42,404 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 12:28:42,404 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 72 transitions. [2022-04-28 12:28:42,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 12:28:42,404 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:28:42,405 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-04-28 12:28:42,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 12:28:42,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:28:42,619 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:28:42,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:28:42,620 INFO L85 PathProgramCache]: Analyzing trace with hash 979890972, now seen corresponding path program 1 times [2022-04-28 12:28:42,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:28:42,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1292362172] [2022-04-28 12:28:42,621 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:28:42,621 INFO L85 PathProgramCache]: Analyzing trace with hash 979890972, now seen corresponding path program 2 times [2022-04-28 12:28:42,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:28:42,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486519133] [2022-04-28 12:28:42,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:28:42,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:28:42,652 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:28:42,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1437407307] [2022-04-28 12:28:42,653 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:28:42,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:28:42,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:28:42,657 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:28:42,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 12:28:42,697 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:28:42,697 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:28:42,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 12:28:42,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:28:42,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:28:42,871 INFO L272 TraceCheckUtils]: 0: Hoare triple {1531#true} call ULTIMATE.init(); {1531#true} is VALID [2022-04-28 12:28:42,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {1531#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);~counter~0 := 0; {1539#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:42,872 INFO L290 TraceCheckUtils]: 2: Hoare triple {1539#(<= ~counter~0 0)} assume true; {1539#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:42,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1539#(<= ~counter~0 0)} {1531#true} #108#return; {1539#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:42,874 INFO L272 TraceCheckUtils]: 4: Hoare triple {1539#(<= ~counter~0 0)} call #t~ret9 := main(); {1539#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:42,874 INFO L290 TraceCheckUtils]: 5: Hoare triple {1539#(<= ~counter~0 0)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1539#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:42,879 INFO L272 TraceCheckUtils]: 6: Hoare triple {1539#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1539#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:42,891 INFO L290 TraceCheckUtils]: 7: Hoare triple {1539#(<= ~counter~0 0)} ~cond := #in~cond; {1539#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:42,892 INFO L290 TraceCheckUtils]: 8: Hoare triple {1539#(<= ~counter~0 0)} assume !(0 == ~cond); {1539#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:42,892 INFO L290 TraceCheckUtils]: 9: Hoare triple {1539#(<= ~counter~0 0)} assume true; {1539#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:42,893 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1539#(<= ~counter~0 0)} {1539#(<= ~counter~0 0)} #94#return; {1539#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:42,897 INFO L272 TraceCheckUtils]: 11: Hoare triple {1539#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1539#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:42,897 INFO L290 TraceCheckUtils]: 12: Hoare triple {1539#(<= ~counter~0 0)} ~cond := #in~cond; {1539#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:42,898 INFO L290 TraceCheckUtils]: 13: Hoare triple {1539#(<= ~counter~0 0)} assume !(0 == ~cond); {1539#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:42,898 INFO L290 TraceCheckUtils]: 14: Hoare triple {1539#(<= ~counter~0 0)} assume true; {1539#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:42,899 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1539#(<= ~counter~0 0)} {1539#(<= ~counter~0 0)} #96#return; {1539#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:42,899 INFO L290 TraceCheckUtils]: 16: Hoare triple {1539#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {1539#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:42,900 INFO L290 TraceCheckUtils]: 17: Hoare triple {1539#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1588#(<= ~counter~0 1)} is VALID [2022-04-28 12:28:42,900 INFO L290 TraceCheckUtils]: 18: Hoare triple {1588#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {1588#(<= ~counter~0 1)} is VALID [2022-04-28 12:28:42,901 INFO L290 TraceCheckUtils]: 19: Hoare triple {1588#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {1588#(<= ~counter~0 1)} is VALID [2022-04-28 12:28:42,901 INFO L290 TraceCheckUtils]: 20: Hoare triple {1588#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1598#(<= ~counter~0 2)} is VALID [2022-04-28 12:28:42,901 INFO L290 TraceCheckUtils]: 21: Hoare triple {1598#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {1598#(<= ~counter~0 2)} is VALID [2022-04-28 12:28:42,902 INFO L290 TraceCheckUtils]: 22: Hoare triple {1598#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {1598#(<= ~counter~0 2)} is VALID [2022-04-28 12:28:42,902 INFO L290 TraceCheckUtils]: 23: Hoare triple {1598#(<= ~counter~0 2)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {1598#(<= ~counter~0 2)} is VALID [2022-04-28 12:28:42,903 INFO L290 TraceCheckUtils]: 24: Hoare triple {1598#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1611#(<= |main_#t~post6| 2)} is VALID [2022-04-28 12:28:42,903 INFO L290 TraceCheckUtils]: 25: Hoare triple {1611#(<= |main_#t~post6| 2)} assume !(#t~post6 < 10);havoc #t~post6; {1532#false} is VALID [2022-04-28 12:28:42,903 INFO L272 TraceCheckUtils]: 26: Hoare triple {1532#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)); {1532#false} is VALID [2022-04-28 12:28:42,903 INFO L290 TraceCheckUtils]: 27: Hoare triple {1532#false} ~cond := #in~cond; {1532#false} is VALID [2022-04-28 12:28:42,903 INFO L290 TraceCheckUtils]: 28: Hoare triple {1532#false} assume 0 == ~cond; {1532#false} is VALID [2022-04-28 12:28:42,904 INFO L290 TraceCheckUtils]: 29: Hoare triple {1532#false} assume !false; {1532#false} is VALID [2022-04-28 12:28:42,904 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 12:28:42,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:28:43,101 INFO L290 TraceCheckUtils]: 29: Hoare triple {1532#false} assume !false; {1532#false} is VALID [2022-04-28 12:28:43,101 INFO L290 TraceCheckUtils]: 28: Hoare triple {1532#false} assume 0 == ~cond; {1532#false} is VALID [2022-04-28 12:28:43,101 INFO L290 TraceCheckUtils]: 27: Hoare triple {1532#false} ~cond := #in~cond; {1532#false} is VALID [2022-04-28 12:28:43,102 INFO L272 TraceCheckUtils]: 26: Hoare triple {1532#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)); {1532#false} is VALID [2022-04-28 12:28:43,102 INFO L290 TraceCheckUtils]: 25: Hoare triple {1639#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {1532#false} is VALID [2022-04-28 12:28:43,102 INFO L290 TraceCheckUtils]: 24: Hoare triple {1643#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1639#(< |main_#t~post6| 10)} is VALID [2022-04-28 12:28:43,103 INFO L290 TraceCheckUtils]: 23: Hoare triple {1643#(< ~counter~0 10)} ~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; {1643#(< ~counter~0 10)} is VALID [2022-04-28 12:28:43,103 INFO L290 TraceCheckUtils]: 22: Hoare triple {1643#(< ~counter~0 10)} assume !(~c~0 >= ~b~0); {1643#(< ~counter~0 10)} is VALID [2022-04-28 12:28:43,103 INFO L290 TraceCheckUtils]: 21: Hoare triple {1643#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {1643#(< ~counter~0 10)} is VALID [2022-04-28 12:28:43,104 INFO L290 TraceCheckUtils]: 20: Hoare triple {1656#(< ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1643#(< ~counter~0 10)} is VALID [2022-04-28 12:28:43,104 INFO L290 TraceCheckUtils]: 19: Hoare triple {1656#(< ~counter~0 9)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {1656#(< ~counter~0 9)} is VALID [2022-04-28 12:28:43,105 INFO L290 TraceCheckUtils]: 18: Hoare triple {1656#(< ~counter~0 9)} assume !!(#t~post6 < 10);havoc #t~post6; {1656#(< ~counter~0 9)} is VALID [2022-04-28 12:28:43,105 INFO L290 TraceCheckUtils]: 17: Hoare triple {1666#(< ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1656#(< ~counter~0 9)} is VALID [2022-04-28 12:28:43,106 INFO L290 TraceCheckUtils]: 16: Hoare triple {1666#(< ~counter~0 8)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {1666#(< ~counter~0 8)} is VALID [2022-04-28 12:28:43,106 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1531#true} {1666#(< ~counter~0 8)} #96#return; {1666#(< ~counter~0 8)} is VALID [2022-04-28 12:28:43,106 INFO L290 TraceCheckUtils]: 14: Hoare triple {1531#true} assume true; {1531#true} is VALID [2022-04-28 12:28:43,107 INFO L290 TraceCheckUtils]: 13: Hoare triple {1531#true} assume !(0 == ~cond); {1531#true} is VALID [2022-04-28 12:28:43,107 INFO L290 TraceCheckUtils]: 12: Hoare triple {1531#true} ~cond := #in~cond; {1531#true} is VALID [2022-04-28 12:28:43,107 INFO L272 TraceCheckUtils]: 11: Hoare triple {1666#(< ~counter~0 8)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1531#true} is VALID [2022-04-28 12:28:43,107 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1531#true} {1666#(< ~counter~0 8)} #94#return; {1666#(< ~counter~0 8)} is VALID [2022-04-28 12:28:43,107 INFO L290 TraceCheckUtils]: 9: Hoare triple {1531#true} assume true; {1531#true} is VALID [2022-04-28 12:28:43,108 INFO L290 TraceCheckUtils]: 8: Hoare triple {1531#true} assume !(0 == ~cond); {1531#true} is VALID [2022-04-28 12:28:43,108 INFO L290 TraceCheckUtils]: 7: Hoare triple {1531#true} ~cond := #in~cond; {1531#true} is VALID [2022-04-28 12:28:43,108 INFO L272 TraceCheckUtils]: 6: Hoare triple {1666#(< ~counter~0 8)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1531#true} is VALID [2022-04-28 12:28:43,108 INFO L290 TraceCheckUtils]: 5: Hoare triple {1666#(< ~counter~0 8)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1666#(< ~counter~0 8)} is VALID [2022-04-28 12:28:43,109 INFO L272 TraceCheckUtils]: 4: Hoare triple {1666#(< ~counter~0 8)} call #t~ret9 := main(); {1666#(< ~counter~0 8)} is VALID [2022-04-28 12:28:43,109 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1666#(< ~counter~0 8)} {1531#true} #108#return; {1666#(< ~counter~0 8)} is VALID [2022-04-28 12:28:43,109 INFO L290 TraceCheckUtils]: 2: Hoare triple {1666#(< ~counter~0 8)} assume true; {1666#(< ~counter~0 8)} is VALID [2022-04-28 12:28:43,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {1531#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);~counter~0 := 0; {1666#(< ~counter~0 8)} is VALID [2022-04-28 12:28:43,110 INFO L272 TraceCheckUtils]: 0: Hoare triple {1531#true} call ULTIMATE.init(); {1531#true} is VALID [2022-04-28 12:28:43,110 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 12:28:43,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:28:43,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486519133] [2022-04-28 12:28:43,111 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:28:43,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437407307] [2022-04-28 12:28:43,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437407307] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:28:43,111 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:28:43,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-28 12:28:43,112 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:28:43,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1292362172] [2022-04-28 12:28:43,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1292362172] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:28:43,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:28:43,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 12:28:43,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656629052] [2022-04-28 12:28:43,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:28:43,113 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2022-04-28 12:28:43,113 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:28:43,113 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:28:43,133 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:28:43,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 12:28:43,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:28:43,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 12:28:43,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 12:28:43,134 INFO L87 Difference]: Start difference. First operand 55 states and 72 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:28:43,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:28:43,303 INFO L93 Difference]: Finished difference Result 67 states and 85 transitions. [2022-04-28 12:28:43,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 12:28:43,303 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2022-04-28 12:28:43,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:28:43,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:28:43,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2022-04-28 12:28:43,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:28:43,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2022-04-28 12:28:43,309 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 63 transitions. [2022-04-28 12:28:43,354 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:28:43,355 INFO L225 Difference]: With dead ends: 67 [2022-04-28 12:28:43,355 INFO L226 Difference]: Without dead ends: 60 [2022-04-28 12:28:43,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-04-28 12:28:43,356 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 8 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:28:43,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 165 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:28:43,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-28 12:28:43,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2022-04-28 12:28:43,378 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:28:43,379 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 59 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 42 states have internal predecessors, (53), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 12:28:43,379 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 59 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 42 states have internal predecessors, (53), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 12:28:43,379 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 59 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 42 states have internal predecessors, (53), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 12:28:43,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:28:43,382 INFO L93 Difference]: Finished difference Result 60 states and 78 transitions. [2022-04-28 12:28:43,382 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 78 transitions. [2022-04-28 12:28:43,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:28:43,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:28:43,383 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 42 states have internal predecessors, (53), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 60 states. [2022-04-28 12:28:43,383 INFO L87 Difference]: Start difference. First operand has 59 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 42 states have internal predecessors, (53), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 60 states. [2022-04-28 12:28:43,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:28:43,385 INFO L93 Difference]: Finished difference Result 60 states and 78 transitions. [2022-04-28 12:28:43,386 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 78 transitions. [2022-04-28 12:28:43,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:28:43,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:28:43,386 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:28:43,386 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:28:43,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 42 states have internal predecessors, (53), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 12:28:43,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 77 transitions. [2022-04-28 12:28:43,389 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 77 transitions. Word has length 30 [2022-04-28 12:28:43,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:28:43,389 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 77 transitions. [2022-04-28 12:28:43,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:28:43,389 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 77 transitions. [2022-04-28 12:28:43,456 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:28:43,457 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 77 transitions. [2022-04-28 12:28:43,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 12:28:43,457 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:28:43,457 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:28:43,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 12:28:43,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:28:43,683 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:28:43,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:28:43,684 INFO L85 PathProgramCache]: Analyzing trace with hash 296831538, now seen corresponding path program 1 times [2022-04-28 12:28:43,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:28:43,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2099511048] [2022-04-28 12:28:43,685 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:28:43,685 INFO L85 PathProgramCache]: Analyzing trace with hash 296831538, now seen corresponding path program 2 times [2022-04-28 12:28:43,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:28:43,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707675277] [2022-04-28 12:28:43,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:28:43,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:28:43,704 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:28:43,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1488377201] [2022-04-28 12:28:43,705 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:28:43,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:28:43,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:28:43,708 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:28:43,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 12:28:43,763 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:28:43,763 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:28:43,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 12:28:43,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:28:43,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:28:43,909 INFO L272 TraceCheckUtils]: 0: Hoare triple {2094#true} call ULTIMATE.init(); {2094#true} is VALID [2022-04-28 12:28:43,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {2094#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);~counter~0 := 0; {2094#true} is VALID [2022-04-28 12:28:43,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {2094#true} assume true; {2094#true} is VALID [2022-04-28 12:28:43,909 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2094#true} {2094#true} #108#return; {2094#true} is VALID [2022-04-28 12:28:43,910 INFO L272 TraceCheckUtils]: 4: Hoare triple {2094#true} call #t~ret9 := main(); {2094#true} is VALID [2022-04-28 12:28:43,910 INFO L290 TraceCheckUtils]: 5: Hoare triple {2094#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2094#true} is VALID [2022-04-28 12:28:43,910 INFO L272 TraceCheckUtils]: 6: Hoare triple {2094#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2094#true} is VALID [2022-04-28 12:28:43,910 INFO L290 TraceCheckUtils]: 7: Hoare triple {2094#true} ~cond := #in~cond; {2120#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 12:28:43,911 INFO L290 TraceCheckUtils]: 8: Hoare triple {2120#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2124#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:28:43,911 INFO L290 TraceCheckUtils]: 9: Hoare triple {2124#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2124#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:28:43,912 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2124#(not (= |assume_abort_if_not_#in~cond| 0))} {2094#true} #94#return; {2131#(<= 1 main_~x~0)} is VALID [2022-04-28 12:28:43,912 INFO L272 TraceCheckUtils]: 11: Hoare triple {2131#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2094#true} is VALID [2022-04-28 12:28:43,912 INFO L290 TraceCheckUtils]: 12: Hoare triple {2094#true} ~cond := #in~cond; {2094#true} is VALID [2022-04-28 12:28:43,912 INFO L290 TraceCheckUtils]: 13: Hoare triple {2094#true} assume !(0 == ~cond); {2094#true} is VALID [2022-04-28 12:28:43,912 INFO L290 TraceCheckUtils]: 14: Hoare triple {2094#true} assume true; {2094#true} is VALID [2022-04-28 12:28:43,913 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2094#true} {2131#(<= 1 main_~x~0)} #96#return; {2131#(<= 1 main_~x~0)} is VALID [2022-04-28 12:28:43,913 INFO L290 TraceCheckUtils]: 16: Hoare triple {2131#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {2150#(<= 1 main_~a~0)} is VALID [2022-04-28 12:28:43,913 INFO L290 TraceCheckUtils]: 17: Hoare triple {2150#(<= 1 main_~a~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2150#(<= 1 main_~a~0)} is VALID [2022-04-28 12:28:43,914 INFO L290 TraceCheckUtils]: 18: Hoare triple {2150#(<= 1 main_~a~0)} assume !!(#t~post6 < 10);havoc #t~post6; {2150#(<= 1 main_~a~0)} is VALID [2022-04-28 12:28:43,914 INFO L290 TraceCheckUtils]: 19: Hoare triple {2150#(<= 1 main_~a~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {2160#(<= 1 main_~c~0)} is VALID [2022-04-28 12:28:43,915 INFO L290 TraceCheckUtils]: 20: Hoare triple {2160#(<= 1 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2160#(<= 1 main_~c~0)} is VALID [2022-04-28 12:28:43,915 INFO L290 TraceCheckUtils]: 21: Hoare triple {2160#(<= 1 main_~c~0)} assume !!(#t~post7 < 10);havoc #t~post7; {2160#(<= 1 main_~c~0)} is VALID [2022-04-28 12:28:43,915 INFO L290 TraceCheckUtils]: 22: Hoare triple {2160#(<= 1 main_~c~0)} assume !(~c~0 >= ~b~0); {2160#(<= 1 main_~c~0)} is VALID [2022-04-28 12:28:43,916 INFO L290 TraceCheckUtils]: 23: Hoare triple {2160#(<= 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; {2173#(<= 1 main_~b~0)} is VALID [2022-04-28 12:28:43,916 INFO L290 TraceCheckUtils]: 24: Hoare triple {2173#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2173#(<= 1 main_~b~0)} is VALID [2022-04-28 12:28:43,917 INFO L290 TraceCheckUtils]: 25: Hoare triple {2173#(<= 1 main_~b~0)} assume !!(#t~post6 < 10);havoc #t~post6; {2173#(<= 1 main_~b~0)} is VALID [2022-04-28 12:28:43,917 INFO L290 TraceCheckUtils]: 26: Hoare triple {2173#(<= 1 main_~b~0)} assume !(0 != ~b~0); {2095#false} is VALID [2022-04-28 12:28:43,917 INFO L272 TraceCheckUtils]: 27: Hoare triple {2095#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)); {2095#false} is VALID [2022-04-28 12:28:43,917 INFO L290 TraceCheckUtils]: 28: Hoare triple {2095#false} ~cond := #in~cond; {2095#false} is VALID [2022-04-28 12:28:43,918 INFO L290 TraceCheckUtils]: 29: Hoare triple {2095#false} assume 0 == ~cond; {2095#false} is VALID [2022-04-28 12:28:43,918 INFO L290 TraceCheckUtils]: 30: Hoare triple {2095#false} assume !false; {2095#false} is VALID [2022-04-28 12:28:43,918 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 12:28:43,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:28:44,144 INFO L290 TraceCheckUtils]: 30: Hoare triple {2095#false} assume !false; {2095#false} is VALID [2022-04-28 12:28:44,144 INFO L290 TraceCheckUtils]: 29: Hoare triple {2095#false} assume 0 == ~cond; {2095#false} is VALID [2022-04-28 12:28:44,145 INFO L290 TraceCheckUtils]: 28: Hoare triple {2095#false} ~cond := #in~cond; {2095#false} is VALID [2022-04-28 12:28:44,145 INFO L272 TraceCheckUtils]: 27: Hoare triple {2095#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)); {2095#false} is VALID [2022-04-28 12:28:44,145 INFO L290 TraceCheckUtils]: 26: Hoare triple {2173#(<= 1 main_~b~0)} assume !(0 != ~b~0); {2095#false} is VALID [2022-04-28 12:28:44,146 INFO L290 TraceCheckUtils]: 25: Hoare triple {2173#(<= 1 main_~b~0)} assume !!(#t~post6 < 10);havoc #t~post6; {2173#(<= 1 main_~b~0)} is VALID [2022-04-28 12:28:44,146 INFO L290 TraceCheckUtils]: 24: Hoare triple {2173#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2173#(<= 1 main_~b~0)} is VALID [2022-04-28 12:28:44,146 INFO L290 TraceCheckUtils]: 23: Hoare triple {2160#(<= 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; {2173#(<= 1 main_~b~0)} is VALID [2022-04-28 12:28:44,147 INFO L290 TraceCheckUtils]: 22: Hoare triple {2160#(<= 1 main_~c~0)} assume !(~c~0 >= ~b~0); {2160#(<= 1 main_~c~0)} is VALID [2022-04-28 12:28:44,147 INFO L290 TraceCheckUtils]: 21: Hoare triple {2160#(<= 1 main_~c~0)} assume !!(#t~post7 < 10);havoc #t~post7; {2160#(<= 1 main_~c~0)} is VALID [2022-04-28 12:28:44,148 INFO L290 TraceCheckUtils]: 20: Hoare triple {2160#(<= 1 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2160#(<= 1 main_~c~0)} is VALID [2022-04-28 12:28:44,148 INFO L290 TraceCheckUtils]: 19: Hoare triple {2150#(<= 1 main_~a~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {2160#(<= 1 main_~c~0)} is VALID [2022-04-28 12:28:44,148 INFO L290 TraceCheckUtils]: 18: Hoare triple {2150#(<= 1 main_~a~0)} assume !!(#t~post6 < 10);havoc #t~post6; {2150#(<= 1 main_~a~0)} is VALID [2022-04-28 12:28:44,149 INFO L290 TraceCheckUtils]: 17: Hoare triple {2150#(<= 1 main_~a~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2150#(<= 1 main_~a~0)} is VALID [2022-04-28 12:28:44,149 INFO L290 TraceCheckUtils]: 16: Hoare triple {2131#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {2150#(<= 1 main_~a~0)} is VALID [2022-04-28 12:28:44,150 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2094#true} {2131#(<= 1 main_~x~0)} #96#return; {2131#(<= 1 main_~x~0)} is VALID [2022-04-28 12:28:44,150 INFO L290 TraceCheckUtils]: 14: Hoare triple {2094#true} assume true; {2094#true} is VALID [2022-04-28 12:28:44,150 INFO L290 TraceCheckUtils]: 13: Hoare triple {2094#true} assume !(0 == ~cond); {2094#true} is VALID [2022-04-28 12:28:44,150 INFO L290 TraceCheckUtils]: 12: Hoare triple {2094#true} ~cond := #in~cond; {2094#true} is VALID [2022-04-28 12:28:44,150 INFO L272 TraceCheckUtils]: 11: Hoare triple {2131#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2094#true} is VALID [2022-04-28 12:28:44,151 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2124#(not (= |assume_abort_if_not_#in~cond| 0))} {2094#true} #94#return; {2131#(<= 1 main_~x~0)} is VALID [2022-04-28 12:28:44,151 INFO L290 TraceCheckUtils]: 9: Hoare triple {2124#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2124#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:28:44,152 INFO L290 TraceCheckUtils]: 8: Hoare triple {2264#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {2124#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:28:44,152 INFO L290 TraceCheckUtils]: 7: Hoare triple {2094#true} ~cond := #in~cond; {2264#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-28 12:28:44,152 INFO L272 TraceCheckUtils]: 6: Hoare triple {2094#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2094#true} is VALID [2022-04-28 12:28:44,152 INFO L290 TraceCheckUtils]: 5: Hoare triple {2094#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2094#true} is VALID [2022-04-28 12:28:44,153 INFO L272 TraceCheckUtils]: 4: Hoare triple {2094#true} call #t~ret9 := main(); {2094#true} is VALID [2022-04-28 12:28:44,153 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2094#true} {2094#true} #108#return; {2094#true} is VALID [2022-04-28 12:28:44,153 INFO L290 TraceCheckUtils]: 2: Hoare triple {2094#true} assume true; {2094#true} is VALID [2022-04-28 12:28:44,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {2094#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);~counter~0 := 0; {2094#true} is VALID [2022-04-28 12:28:44,153 INFO L272 TraceCheckUtils]: 0: Hoare triple {2094#true} call ULTIMATE.init(); {2094#true} is VALID [2022-04-28 12:28:44,153 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 12:28:44,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:28:44,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707675277] [2022-04-28 12:28:44,154 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:28:44,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488377201] [2022-04-28 12:28:44,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488377201] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:28:44,154 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:28:44,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-28 12:28:44,155 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:28:44,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2099511048] [2022-04-28 12:28:44,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2099511048] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:28:44,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:28:44,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 12:28:44,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75721757] [2022-04-28 12:28:44,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:28:44,156 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2022-04-28 12:28:44,156 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:28:44,156 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:28:44,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:28:44,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 12:28:44,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:28:44,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 12:28:44,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-28 12:28:44,182 INFO L87 Difference]: Start difference. First operand 59 states and 77 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:28:44,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:28:44,972 INFO L93 Difference]: Finished difference Result 138 states and 201 transitions. [2022-04-28 12:28:44,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 12:28:44,972 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2022-04-28 12:28:44,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:28:44,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:28:44,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 155 transitions. [2022-04-28 12:28:44,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:28:44,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 155 transitions. [2022-04-28 12:28:44,979 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 155 transitions. [2022-04-28 12:28:45,115 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:28:45,118 INFO L225 Difference]: With dead ends: 138 [2022-04-28 12:28:45,118 INFO L226 Difference]: Without dead ends: 131 [2022-04-28 12:28:45,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-04-28 12:28:45,119 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 115 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 12:28:45,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 298 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 12:28:45,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-04-28 12:28:45,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 88. [2022-04-28 12:28:45,263 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:28:45,263 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand has 88 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 67 states have internal predecessors, (90), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 12:28:45,264 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand has 88 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 67 states have internal predecessors, (90), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 12:28:45,264 INFO L87 Difference]: Start difference. First operand 131 states. Second operand has 88 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 67 states have internal predecessors, (90), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 12:28:45,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:28:45,272 INFO L93 Difference]: Finished difference Result 131 states and 193 transitions. [2022-04-28 12:28:45,272 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 193 transitions. [2022-04-28 12:28:45,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:28:45,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:28:45,273 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 67 states have internal predecessors, (90), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 131 states. [2022-04-28 12:28:45,273 INFO L87 Difference]: Start difference. First operand has 88 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 67 states have internal predecessors, (90), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 131 states. [2022-04-28 12:28:45,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:28:45,281 INFO L93 Difference]: Finished difference Result 131 states and 193 transitions. [2022-04-28 12:28:45,281 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 193 transitions. [2022-04-28 12:28:45,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:28:45,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:28:45,282 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:28:45,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:28:45,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 67 states have internal predecessors, (90), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 12:28:45,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 122 transitions. [2022-04-28 12:28:45,286 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 122 transitions. Word has length 31 [2022-04-28 12:28:45,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:28:45,287 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 122 transitions. [2022-04-28 12:28:45,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:28:45,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 88 states and 122 transitions. [2022-04-28 12:28:45,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:28:45,413 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 122 transitions. [2022-04-28 12:28:45,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 12:28:45,413 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:28:45,413 INFO L195 NwaCegarLoop]: trace histogram [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 12:28:45,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 12:28:45,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:28:45,614 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:28:45,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:28:45,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1911367052, now seen corresponding path program 1 times [2022-04-28 12:28:45,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:28:45,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1420213514] [2022-04-28 12:28:45,615 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:28:45,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1911367052, now seen corresponding path program 2 times [2022-04-28 12:28:45,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:28:45,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749430052] [2022-04-28 12:28:45,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:28:45,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:28:45,634 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:28:45,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [268505159] [2022-04-28 12:28:45,634 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:28:45,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:28:45,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:28:45,636 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:28:45,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 12:28:45,684 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:28:45,684 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:28:45,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 12:28:45,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:28:45,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:28:45,895 INFO L272 TraceCheckUtils]: 0: Hoare triple {3016#true} call ULTIMATE.init(); {3016#true} is VALID [2022-04-28 12:28:45,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {3016#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);~counter~0 := 0; {3024#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:45,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {3024#(<= ~counter~0 0)} assume true; {3024#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:45,896 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3024#(<= ~counter~0 0)} {3016#true} #108#return; {3024#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:45,897 INFO L272 TraceCheckUtils]: 4: Hoare triple {3024#(<= ~counter~0 0)} call #t~ret9 := main(); {3024#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:45,897 INFO L290 TraceCheckUtils]: 5: Hoare triple {3024#(<= ~counter~0 0)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3024#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:45,898 INFO L272 TraceCheckUtils]: 6: Hoare triple {3024#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3024#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:45,898 INFO L290 TraceCheckUtils]: 7: Hoare triple {3024#(<= ~counter~0 0)} ~cond := #in~cond; {3024#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:45,904 INFO L290 TraceCheckUtils]: 8: Hoare triple {3024#(<= ~counter~0 0)} assume !(0 == ~cond); {3024#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:45,905 INFO L290 TraceCheckUtils]: 9: Hoare triple {3024#(<= ~counter~0 0)} assume true; {3024#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:45,906 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3024#(<= ~counter~0 0)} {3024#(<= ~counter~0 0)} #94#return; {3024#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:45,907 INFO L272 TraceCheckUtils]: 11: Hoare triple {3024#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3024#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:45,911 INFO L290 TraceCheckUtils]: 12: Hoare triple {3024#(<= ~counter~0 0)} ~cond := #in~cond; {3024#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:45,912 INFO L290 TraceCheckUtils]: 13: Hoare triple {3024#(<= ~counter~0 0)} assume !(0 == ~cond); {3024#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:45,914 INFO L290 TraceCheckUtils]: 14: Hoare triple {3024#(<= ~counter~0 0)} assume true; {3024#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:45,915 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3024#(<= ~counter~0 0)} {3024#(<= ~counter~0 0)} #96#return; {3024#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:45,915 INFO L290 TraceCheckUtils]: 16: Hoare triple {3024#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {3024#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:45,916 INFO L290 TraceCheckUtils]: 17: Hoare triple {3024#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3073#(<= ~counter~0 1)} is VALID [2022-04-28 12:28:45,917 INFO L290 TraceCheckUtils]: 18: Hoare triple {3073#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {3073#(<= ~counter~0 1)} is VALID [2022-04-28 12:28:45,918 INFO L290 TraceCheckUtils]: 19: Hoare triple {3073#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {3073#(<= ~counter~0 1)} is VALID [2022-04-28 12:28:45,918 INFO L290 TraceCheckUtils]: 20: Hoare triple {3073#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3083#(<= ~counter~0 2)} is VALID [2022-04-28 12:28:45,919 INFO L290 TraceCheckUtils]: 21: Hoare triple {3083#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {3083#(<= ~counter~0 2)} is VALID [2022-04-28 12:28:45,919 INFO L290 TraceCheckUtils]: 22: Hoare triple {3083#(<= ~counter~0 2)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {3083#(<= ~counter~0 2)} is VALID [2022-04-28 12:28:45,920 INFO L290 TraceCheckUtils]: 23: Hoare triple {3083#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {3093#(<= |main_#t~post8| 2)} is VALID [2022-04-28 12:28:45,923 INFO L290 TraceCheckUtils]: 24: Hoare triple {3093#(<= |main_#t~post8| 2)} assume !(#t~post8 < 10);havoc #t~post8; {3017#false} is VALID [2022-04-28 12:28:45,923 INFO L290 TraceCheckUtils]: 25: Hoare triple {3017#false} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {3017#false} is VALID [2022-04-28 12:28:45,924 INFO L290 TraceCheckUtils]: 26: Hoare triple {3017#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3017#false} is VALID [2022-04-28 12:28:45,924 INFO L290 TraceCheckUtils]: 27: Hoare triple {3017#false} assume !(#t~post7 < 10);havoc #t~post7; {3017#false} is VALID [2022-04-28 12:28:45,924 INFO L290 TraceCheckUtils]: 28: Hoare triple {3017#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; {3017#false} is VALID [2022-04-28 12:28:45,924 INFO L290 TraceCheckUtils]: 29: Hoare triple {3017#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3017#false} is VALID [2022-04-28 12:28:45,924 INFO L290 TraceCheckUtils]: 30: Hoare triple {3017#false} assume !(#t~post6 < 10);havoc #t~post6; {3017#false} is VALID [2022-04-28 12:28:45,924 INFO L272 TraceCheckUtils]: 31: Hoare triple {3017#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)); {3017#false} is VALID [2022-04-28 12:28:45,924 INFO L290 TraceCheckUtils]: 32: Hoare triple {3017#false} ~cond := #in~cond; {3017#false} is VALID [2022-04-28 12:28:45,925 INFO L290 TraceCheckUtils]: 33: Hoare triple {3017#false} assume 0 == ~cond; {3017#false} is VALID [2022-04-28 12:28:45,925 INFO L290 TraceCheckUtils]: 34: Hoare triple {3017#false} assume !false; {3017#false} is VALID [2022-04-28 12:28:45,925 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 12:28:45,925 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:28:45,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:28:45,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749430052] [2022-04-28 12:28:45,925 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:28:45,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268505159] [2022-04-28 12:28:45,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268505159] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:28:45,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:28:45,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 12:28:45,926 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:28:45,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1420213514] [2022-04-28 12:28:45,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1420213514] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:28:45,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:28:45,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 12:28:45,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054146783] [2022-04-28 12:28:45,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:28:45,927 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2022-04-28 12:28:45,927 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:28:45,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:28:45,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:28:45,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 12:28:45,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:28:45,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 12:28:45,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-28 12:28:45,954 INFO L87 Difference]: Start difference. First operand 88 states and 122 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:28:46,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:28:46,197 INFO L93 Difference]: Finished difference Result 127 states and 178 transitions. [2022-04-28 12:28:46,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 12:28:46,198 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2022-04-28 12:28:46,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:28:46,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:28:46,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2022-04-28 12:28:46,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:28:46,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2022-04-28 12:28:46,201 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 88 transitions. [2022-04-28 12:28:46,269 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:28:46,271 INFO L225 Difference]: With dead ends: 127 [2022-04-28 12:28:46,271 INFO L226 Difference]: Without dead ends: 90 [2022-04-28 12:28:46,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-28 12:28:46,272 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 10 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:28:46,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 139 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:28:46,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-04-28 12:28:46,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-04-28 12:28:46,389 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:28:46,390 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand has 90 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 69 states have internal predecessors, (92), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 12:28:46,390 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand has 90 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 69 states have internal predecessors, (92), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 12:28:46,390 INFO L87 Difference]: Start difference. First operand 90 states. Second operand has 90 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 69 states have internal predecessors, (92), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 12:28:46,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:28:46,393 INFO L93 Difference]: Finished difference Result 90 states and 124 transitions. [2022-04-28 12:28:46,394 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 124 transitions. [2022-04-28 12:28:46,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:28:46,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:28:46,395 INFO L74 IsIncluded]: Start isIncluded. First operand has 90 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 69 states have internal predecessors, (92), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 90 states. [2022-04-28 12:28:46,395 INFO L87 Difference]: Start difference. First operand has 90 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 69 states have internal predecessors, (92), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 90 states. [2022-04-28 12:28:46,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:28:46,398 INFO L93 Difference]: Finished difference Result 90 states and 124 transitions. [2022-04-28 12:28:46,398 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 124 transitions. [2022-04-28 12:28:46,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:28:46,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:28:46,399 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:28:46,399 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:28:46,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 69 states have internal predecessors, (92), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 12:28:46,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 124 transitions. [2022-04-28 12:28:46,402 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 124 transitions. Word has length 35 [2022-04-28 12:28:46,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:28:46,403 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 124 transitions. [2022-04-28 12:28:46,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:28:46,403 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 90 states and 124 transitions. [2022-04-28 12:28:46,524 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:28:46,524 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 124 transitions. [2022-04-28 12:28:46,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 12:28:46,525 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:28:46,525 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-04-28 12:28:46,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 12:28:46,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:28:46,739 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:28:46,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:28:46,740 INFO L85 PathProgramCache]: Analyzing trace with hash -304485816, now seen corresponding path program 1 times [2022-04-28 12:28:46,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:28:46,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [483981622] [2022-04-28 12:28:46,740 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:28:46,741 INFO L85 PathProgramCache]: Analyzing trace with hash -304485816, now seen corresponding path program 2 times [2022-04-28 12:28:46,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:28:46,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334925579] [2022-04-28 12:28:46,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:28:46,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:28:46,763 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:28:46,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1727581833] [2022-04-28 12:28:46,763 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:28:46,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:28:46,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:28:46,768 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:28:46,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 12:28:46,818 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:28:46,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:28:46,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 12:28:46,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:28:46,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:28:47,037 INFO L272 TraceCheckUtils]: 0: Hoare triple {3740#true} call ULTIMATE.init(); {3740#true} is VALID [2022-04-28 12:28:47,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {3740#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);~counter~0 := 0; {3748#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:47,038 INFO L290 TraceCheckUtils]: 2: Hoare triple {3748#(<= ~counter~0 0)} assume true; {3748#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:47,038 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3748#(<= ~counter~0 0)} {3740#true} #108#return; {3748#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:47,039 INFO L272 TraceCheckUtils]: 4: Hoare triple {3748#(<= ~counter~0 0)} call #t~ret9 := main(); {3748#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:47,039 INFO L290 TraceCheckUtils]: 5: Hoare triple {3748#(<= ~counter~0 0)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3748#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:47,040 INFO L272 TraceCheckUtils]: 6: Hoare triple {3748#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3748#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:47,040 INFO L290 TraceCheckUtils]: 7: Hoare triple {3748#(<= ~counter~0 0)} ~cond := #in~cond; {3748#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:47,041 INFO L290 TraceCheckUtils]: 8: Hoare triple {3748#(<= ~counter~0 0)} assume !(0 == ~cond); {3748#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:47,041 INFO L290 TraceCheckUtils]: 9: Hoare triple {3748#(<= ~counter~0 0)} assume true; {3748#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:47,042 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3748#(<= ~counter~0 0)} {3748#(<= ~counter~0 0)} #94#return; {3748#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:47,042 INFO L272 TraceCheckUtils]: 11: Hoare triple {3748#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3748#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:47,043 INFO L290 TraceCheckUtils]: 12: Hoare triple {3748#(<= ~counter~0 0)} ~cond := #in~cond; {3748#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:47,043 INFO L290 TraceCheckUtils]: 13: Hoare triple {3748#(<= ~counter~0 0)} assume !(0 == ~cond); {3748#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:47,043 INFO L290 TraceCheckUtils]: 14: Hoare triple {3748#(<= ~counter~0 0)} assume true; {3748#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:47,044 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3748#(<= ~counter~0 0)} {3748#(<= ~counter~0 0)} #96#return; {3748#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:47,044 INFO L290 TraceCheckUtils]: 16: Hoare triple {3748#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {3748#(<= ~counter~0 0)} is VALID [2022-04-28 12:28:47,045 INFO L290 TraceCheckUtils]: 17: Hoare triple {3748#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3797#(<= ~counter~0 1)} is VALID [2022-04-28 12:28:47,045 INFO L290 TraceCheckUtils]: 18: Hoare triple {3797#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {3797#(<= ~counter~0 1)} is VALID [2022-04-28 12:28:47,046 INFO L290 TraceCheckUtils]: 19: Hoare triple {3797#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {3797#(<= ~counter~0 1)} is VALID [2022-04-28 12:28:47,046 INFO L290 TraceCheckUtils]: 20: Hoare triple {3797#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3807#(<= ~counter~0 2)} is VALID [2022-04-28 12:28:47,047 INFO L290 TraceCheckUtils]: 21: Hoare triple {3807#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {3807#(<= ~counter~0 2)} is VALID [2022-04-28 12:28:47,047 INFO L290 TraceCheckUtils]: 22: Hoare triple {3807#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {3807#(<= ~counter~0 2)} is VALID [2022-04-28 12:28:47,048 INFO L290 TraceCheckUtils]: 23: Hoare triple {3807#(<= ~counter~0 2)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {3807#(<= ~counter~0 2)} is VALID [2022-04-28 12:28:47,048 INFO L290 TraceCheckUtils]: 24: Hoare triple {3807#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3820#(<= ~counter~0 3)} is VALID [2022-04-28 12:28:47,049 INFO L290 TraceCheckUtils]: 25: Hoare triple {3820#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {3820#(<= ~counter~0 3)} is VALID [2022-04-28 12:28:47,049 INFO L290 TraceCheckUtils]: 26: Hoare triple {3820#(<= ~counter~0 3)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {3820#(<= ~counter~0 3)} is VALID [2022-04-28 12:28:47,049 INFO L290 TraceCheckUtils]: 27: Hoare triple {3820#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3830#(<= |main_#t~post7| 3)} is VALID [2022-04-28 12:28:47,050 INFO L290 TraceCheckUtils]: 28: Hoare triple {3830#(<= |main_#t~post7| 3)} assume !(#t~post7 < 10);havoc #t~post7; {3741#false} is VALID [2022-04-28 12:28:47,050 INFO L290 TraceCheckUtils]: 29: Hoare triple {3741#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; {3741#false} is VALID [2022-04-28 12:28:47,050 INFO L290 TraceCheckUtils]: 30: Hoare triple {3741#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3741#false} is VALID [2022-04-28 12:28:47,050 INFO L290 TraceCheckUtils]: 31: Hoare triple {3741#false} assume !(#t~post6 < 10);havoc #t~post6; {3741#false} is VALID [2022-04-28 12:28:47,050 INFO L272 TraceCheckUtils]: 32: Hoare triple {3741#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)); {3741#false} is VALID [2022-04-28 12:28:47,051 INFO L290 TraceCheckUtils]: 33: Hoare triple {3741#false} ~cond := #in~cond; {3741#false} is VALID [2022-04-28 12:28:47,051 INFO L290 TraceCheckUtils]: 34: Hoare triple {3741#false} assume 0 == ~cond; {3741#false} is VALID [2022-04-28 12:28:47,051 INFO L290 TraceCheckUtils]: 35: Hoare triple {3741#false} assume !false; {3741#false} is VALID [2022-04-28 12:28:47,051 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 12:28:47,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:28:47,311 INFO L290 TraceCheckUtils]: 35: Hoare triple {3741#false} assume !false; {3741#false} is VALID [2022-04-28 12:28:47,311 INFO L290 TraceCheckUtils]: 34: Hoare triple {3741#false} assume 0 == ~cond; {3741#false} is VALID [2022-04-28 12:28:47,312 INFO L290 TraceCheckUtils]: 33: Hoare triple {3741#false} ~cond := #in~cond; {3741#false} is VALID [2022-04-28 12:28:47,312 INFO L272 TraceCheckUtils]: 32: Hoare triple {3741#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)); {3741#false} is VALID [2022-04-28 12:28:47,312 INFO L290 TraceCheckUtils]: 31: Hoare triple {3741#false} assume !(#t~post6 < 10);havoc #t~post6; {3741#false} is VALID [2022-04-28 12:28:47,312 INFO L290 TraceCheckUtils]: 30: Hoare triple {3741#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3741#false} is VALID [2022-04-28 12:28:47,312 INFO L290 TraceCheckUtils]: 29: Hoare triple {3741#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; {3741#false} is VALID [2022-04-28 12:28:47,313 INFO L290 TraceCheckUtils]: 28: Hoare triple {3876#(< |main_#t~post7| 10)} assume !(#t~post7 < 10);havoc #t~post7; {3741#false} is VALID [2022-04-28 12:28:47,313 INFO L290 TraceCheckUtils]: 27: Hoare triple {3880#(< ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3876#(< |main_#t~post7| 10)} is VALID [2022-04-28 12:28:47,313 INFO L290 TraceCheckUtils]: 26: Hoare triple {3880#(< ~counter~0 10)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {3880#(< ~counter~0 10)} is VALID [2022-04-28 12:28:47,314 INFO L290 TraceCheckUtils]: 25: Hoare triple {3880#(< ~counter~0 10)} assume !!(#t~post6 < 10);havoc #t~post6; {3880#(< ~counter~0 10)} is VALID [2022-04-28 12:28:47,314 INFO L290 TraceCheckUtils]: 24: Hoare triple {3890#(< ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3880#(< ~counter~0 10)} is VALID [2022-04-28 12:28:47,315 INFO L290 TraceCheckUtils]: 23: Hoare triple {3890#(< ~counter~0 9)} ~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; {3890#(< ~counter~0 9)} is VALID [2022-04-28 12:28:47,315 INFO L290 TraceCheckUtils]: 22: Hoare triple {3890#(< ~counter~0 9)} assume !(~c~0 >= ~b~0); {3890#(< ~counter~0 9)} is VALID [2022-04-28 12:28:47,316 INFO L290 TraceCheckUtils]: 21: Hoare triple {3890#(< ~counter~0 9)} assume !!(#t~post7 < 10);havoc #t~post7; {3890#(< ~counter~0 9)} is VALID [2022-04-28 12:28:47,316 INFO L290 TraceCheckUtils]: 20: Hoare triple {3903#(< ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3890#(< ~counter~0 9)} is VALID [2022-04-28 12:28:47,317 INFO L290 TraceCheckUtils]: 19: Hoare triple {3903#(< ~counter~0 8)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {3903#(< ~counter~0 8)} is VALID [2022-04-28 12:28:47,317 INFO L290 TraceCheckUtils]: 18: Hoare triple {3903#(< ~counter~0 8)} assume !!(#t~post6 < 10);havoc #t~post6; {3903#(< ~counter~0 8)} is VALID [2022-04-28 12:28:47,317 INFO L290 TraceCheckUtils]: 17: Hoare triple {3913#(< ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3903#(< ~counter~0 8)} is VALID [2022-04-28 12:28:47,318 INFO L290 TraceCheckUtils]: 16: Hoare triple {3913#(< ~counter~0 7)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {3913#(< ~counter~0 7)} is VALID [2022-04-28 12:28:47,318 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3740#true} {3913#(< ~counter~0 7)} #96#return; {3913#(< ~counter~0 7)} is VALID [2022-04-28 12:28:47,319 INFO L290 TraceCheckUtils]: 14: Hoare triple {3740#true} assume true; {3740#true} is VALID [2022-04-28 12:28:47,319 INFO L290 TraceCheckUtils]: 13: Hoare triple {3740#true} assume !(0 == ~cond); {3740#true} is VALID [2022-04-28 12:28:47,319 INFO L290 TraceCheckUtils]: 12: Hoare triple {3740#true} ~cond := #in~cond; {3740#true} is VALID [2022-04-28 12:28:47,319 INFO L272 TraceCheckUtils]: 11: Hoare triple {3913#(< ~counter~0 7)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3740#true} is VALID [2022-04-28 12:28:47,320 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3740#true} {3913#(< ~counter~0 7)} #94#return; {3913#(< ~counter~0 7)} is VALID [2022-04-28 12:28:47,320 INFO L290 TraceCheckUtils]: 9: Hoare triple {3740#true} assume true; {3740#true} is VALID [2022-04-28 12:28:47,320 INFO L290 TraceCheckUtils]: 8: Hoare triple {3740#true} assume !(0 == ~cond); {3740#true} is VALID [2022-04-28 12:28:47,320 INFO L290 TraceCheckUtils]: 7: Hoare triple {3740#true} ~cond := #in~cond; {3740#true} is VALID [2022-04-28 12:28:47,320 INFO L272 TraceCheckUtils]: 6: Hoare triple {3913#(< ~counter~0 7)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3740#true} is VALID [2022-04-28 12:28:47,320 INFO L290 TraceCheckUtils]: 5: Hoare triple {3913#(< ~counter~0 7)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3913#(< ~counter~0 7)} is VALID [2022-04-28 12:28:47,321 INFO L272 TraceCheckUtils]: 4: Hoare triple {3913#(< ~counter~0 7)} call #t~ret9 := main(); {3913#(< ~counter~0 7)} is VALID [2022-04-28 12:28:47,321 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3913#(< ~counter~0 7)} {3740#true} #108#return; {3913#(< ~counter~0 7)} is VALID [2022-04-28 12:28:47,322 INFO L290 TraceCheckUtils]: 2: Hoare triple {3913#(< ~counter~0 7)} assume true; {3913#(< ~counter~0 7)} is VALID [2022-04-28 12:28:47,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {3740#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);~counter~0 := 0; {3913#(< ~counter~0 7)} is VALID [2022-04-28 12:28:47,323 INFO L272 TraceCheckUtils]: 0: Hoare triple {3740#true} call ULTIMATE.init(); {3740#true} is VALID [2022-04-28 12:28:47,323 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 12:28:47,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:28:47,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334925579] [2022-04-28 12:28:47,323 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:28:47,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727581833] [2022-04-28 12:28:47,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727581833] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:28:47,324 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:28:47,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-28 12:28:47,324 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:28:47,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [483981622] [2022-04-28 12:28:47,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [483981622] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:28:47,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:28:47,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 12:28:47,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136760719] [2022-04-28 12:28:47,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:28:47,325 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2022-04-28 12:28:47,325 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:28:47,325 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:28:47,349 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:28:47,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 12:28:47,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:28:47,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 12:28:47,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-28 12:28:47,350 INFO L87 Difference]: Start difference. First operand 90 states and 124 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:28:47,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:28:47,705 INFO L93 Difference]: Finished difference Result 163 states and 227 transitions. [2022-04-28 12:28:47,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 12:28:47,705 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2022-04-28 12:28:47,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:28:47,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:28:47,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2022-04-28 12:28:47,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:28:47,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2022-04-28 12:28:47,710 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 109 transitions. [2022-04-28 12:28:47,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:28:47,817 INFO L225 Difference]: With dead ends: 163 [2022-04-28 12:28:47,817 INFO L226 Difference]: Without dead ends: 112 [2022-04-28 12:28:47,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2022-04-28 12:28:47,820 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 34 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:28:47,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 180 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:28:47,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-04-28 12:28:47,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2022-04-28 12:28:47,976 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:28:47,976 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand has 109 states, 81 states have (on average 1.3209876543209877) internal successors, (107), 82 states have internal predecessors, (107), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 12:28:47,977 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand has 109 states, 81 states have (on average 1.3209876543209877) internal successors, (107), 82 states have internal predecessors, (107), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 12:28:47,977 INFO L87 Difference]: Start difference. First operand 112 states. Second operand has 109 states, 81 states have (on average 1.3209876543209877) internal successors, (107), 82 states have internal predecessors, (107), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 12:28:47,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:28:47,981 INFO L93 Difference]: Finished difference Result 112 states and 149 transitions. [2022-04-28 12:28:47,981 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 149 transitions. [2022-04-28 12:28:47,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:28:47,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:28:47,982 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 81 states have (on average 1.3209876543209877) internal successors, (107), 82 states have internal predecessors, (107), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 112 states. [2022-04-28 12:28:47,982 INFO L87 Difference]: Start difference. First operand has 109 states, 81 states have (on average 1.3209876543209877) internal successors, (107), 82 states have internal predecessors, (107), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 112 states. [2022-04-28 12:28:47,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:28:47,986 INFO L93 Difference]: Finished difference Result 112 states and 149 transitions. [2022-04-28 12:28:47,986 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 149 transitions. [2022-04-28 12:28:47,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:28:47,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:28:47,987 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:28:47,987 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:28:47,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 81 states have (on average 1.3209876543209877) internal successors, (107), 82 states have internal predecessors, (107), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 12:28:47,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 147 transitions. [2022-04-28 12:28:47,992 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 147 transitions. Word has length 36 [2022-04-28 12:28:47,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:28:47,992 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 147 transitions. [2022-04-28 12:28:47,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:28:47,992 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 109 states and 147 transitions. [2022-04-28 12:28:48,134 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:28:48,134 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 147 transitions. [2022-04-28 12:28:48,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 12:28:48,135 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:28:48,135 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-04-28 12:28:48,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 12:28:48,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:28:48,339 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:28:48,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:28:48,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1581560821, now seen corresponding path program 1 times [2022-04-28 12:28:48,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:28:48,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [207837667] [2022-04-28 12:28:48,340 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:28:48,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1581560821, now seen corresponding path program 2 times [2022-04-28 12:28:48,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:28:48,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912702476] [2022-04-28 12:28:48,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:28:48,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:28:48,356 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:28:48,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1103814861] [2022-04-28 12:28:48,356 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:28:48,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:28:48,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:28:48,357 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:28:48,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 12:28:48,398 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:28:48,398 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:28:48,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 12:28:48,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:28:48,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:28:48,758 INFO L272 TraceCheckUtils]: 0: Hoare triple {4737#true} call ULTIMATE.init(); {4737#true} is VALID [2022-04-28 12:28:48,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {4737#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);~counter~0 := 0; {4737#true} is VALID [2022-04-28 12:28:48,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {4737#true} assume true; {4737#true} is VALID [2022-04-28 12:28:48,758 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4737#true} {4737#true} #108#return; {4737#true} is VALID [2022-04-28 12:28:48,758 INFO L272 TraceCheckUtils]: 4: Hoare triple {4737#true} call #t~ret9 := main(); {4737#true} is VALID [2022-04-28 12:28:48,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {4737#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4737#true} is VALID [2022-04-28 12:28:48,759 INFO L272 TraceCheckUtils]: 6: Hoare triple {4737#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4737#true} is VALID [2022-04-28 12:28:48,759 INFO L290 TraceCheckUtils]: 7: Hoare triple {4737#true} ~cond := #in~cond; {4763#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 12:28:48,759 INFO L290 TraceCheckUtils]: 8: Hoare triple {4763#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {4767#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:28:48,760 INFO L290 TraceCheckUtils]: 9: Hoare triple {4767#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4767#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:28:48,760 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4767#(not (= |assume_abort_if_not_#in~cond| 0))} {4737#true} #94#return; {4774#(<= 1 main_~x~0)} is VALID [2022-04-28 12:28:48,760 INFO L272 TraceCheckUtils]: 11: Hoare triple {4774#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4737#true} is VALID [2022-04-28 12:28:48,760 INFO L290 TraceCheckUtils]: 12: Hoare triple {4737#true} ~cond := #in~cond; {4737#true} is VALID [2022-04-28 12:28:48,760 INFO L290 TraceCheckUtils]: 13: Hoare triple {4737#true} assume !(0 == ~cond); {4737#true} is VALID [2022-04-28 12:28:48,761 INFO L290 TraceCheckUtils]: 14: Hoare triple {4737#true} assume true; {4737#true} is VALID [2022-04-28 12:28:48,762 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4737#true} {4774#(<= 1 main_~x~0)} #96#return; {4774#(<= 1 main_~x~0)} is VALID [2022-04-28 12:28:48,762 INFO L290 TraceCheckUtils]: 16: Hoare triple {4774#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {4793#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 12:28:48,763 INFO L290 TraceCheckUtils]: 17: Hoare triple {4793#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4793#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 12:28:48,763 INFO L290 TraceCheckUtils]: 18: Hoare triple {4793#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(#t~post6 < 10);havoc #t~post6; {4793#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 12:28:48,763 INFO L290 TraceCheckUtils]: 19: Hoare triple {4793#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {4793#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 12:28:48,764 INFO L290 TraceCheckUtils]: 20: Hoare triple {4793#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4793#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 12:28:48,764 INFO L290 TraceCheckUtils]: 21: Hoare triple {4793#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(#t~post7 < 10);havoc #t~post7; {4793#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 12:28:48,765 INFO L290 TraceCheckUtils]: 22: Hoare triple {4793#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !(~c~0 >= ~b~0); {4793#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 12:28:48,765 INFO L290 TraceCheckUtils]: 23: Hoare triple {4793#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~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; {4815#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-28 12:28:48,765 INFO L290 TraceCheckUtils]: 24: Hoare triple {4815#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4815#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-28 12:28:48,766 INFO L290 TraceCheckUtils]: 25: Hoare triple {4815#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} assume !!(#t~post6 < 10);havoc #t~post6; {4815#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-28 12:28:48,766 INFO L290 TraceCheckUtils]: 26: Hoare triple {4815#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {4815#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-28 12:28:48,767 INFO L290 TraceCheckUtils]: 27: Hoare triple {4815#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4815#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-28 12:28:48,767 INFO L290 TraceCheckUtils]: 28: Hoare triple {4815#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} assume !!(#t~post7 < 10);havoc #t~post7; {4815#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-28 12:28:48,768 INFO L290 TraceCheckUtils]: 29: Hoare triple {4815#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {4815#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-28 12:28:48,768 INFO L290 TraceCheckUtils]: 30: Hoare triple {4815#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4815#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-28 12:28:48,769 INFO L290 TraceCheckUtils]: 31: Hoare triple {4815#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} assume !!(#t~post8 < 10);havoc #t~post8; {4815#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-28 12:28:48,770 INFO L272 TraceCheckUtils]: 32: Hoare triple {4815#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4843#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:28:48,772 INFO L290 TraceCheckUtils]: 33: Hoare triple {4843#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4847#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:28:48,773 INFO L290 TraceCheckUtils]: 34: Hoare triple {4847#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4738#false} is VALID [2022-04-28 12:28:48,773 INFO L290 TraceCheckUtils]: 35: Hoare triple {4738#false} assume !false; {4738#false} is VALID [2022-04-28 12:28:48,773 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 12:28:48,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:28:49,002 INFO L290 TraceCheckUtils]: 35: Hoare triple {4738#false} assume !false; {4738#false} is VALID [2022-04-28 12:28:49,003 INFO L290 TraceCheckUtils]: 34: Hoare triple {4847#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4738#false} is VALID [2022-04-28 12:28:49,003 INFO L290 TraceCheckUtils]: 33: Hoare triple {4843#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4847#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:28:49,004 INFO L272 TraceCheckUtils]: 32: Hoare triple {4863#(= 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)); {4843#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:28:49,005 INFO L290 TraceCheckUtils]: 31: Hoare triple {4863#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post8 < 10);havoc #t~post8; {4863#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:28:49,005 INFO L290 TraceCheckUtils]: 30: Hoare triple {4863#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4863#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:28:49,006 INFO L290 TraceCheckUtils]: 29: Hoare triple {4863#(= 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; {4863#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:28:49,006 INFO L290 TraceCheckUtils]: 28: Hoare triple {4863#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post7 < 10);havoc #t~post7; {4863#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:28:49,007 INFO L290 TraceCheckUtils]: 27: Hoare triple {4863#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4863#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:28:49,007 INFO L290 TraceCheckUtils]: 26: Hoare triple {4863#(= 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; {4863#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:28:49,007 INFO L290 TraceCheckUtils]: 25: Hoare triple {4863#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post6 < 10);havoc #t~post6; {4863#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:28:49,008 INFO L290 TraceCheckUtils]: 24: Hoare triple {4863#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4863#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:28:49,009 INFO L290 TraceCheckUtils]: 23: Hoare triple {4891#(= 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; {4863#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:28:49,009 INFO L290 TraceCheckUtils]: 22: Hoare triple {4891#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= ~b~0); {4891#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:28:49,010 INFO L290 TraceCheckUtils]: 21: Hoare triple {4891#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post7 < 10);havoc #t~post7; {4891#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:28:49,010 INFO L290 TraceCheckUtils]: 20: Hoare triple {4891#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4891#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:28:49,010 INFO L290 TraceCheckUtils]: 19: Hoare triple {4891#(= 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; {4891#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:28:49,011 INFO L290 TraceCheckUtils]: 18: Hoare triple {4891#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post6 < 10);havoc #t~post6; {4891#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:28:49,011 INFO L290 TraceCheckUtils]: 17: Hoare triple {4891#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4891#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:28:49,012 INFO L290 TraceCheckUtils]: 16: Hoare triple {4737#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {4891#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:28:49,012 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4737#true} {4737#true} #96#return; {4737#true} is VALID [2022-04-28 12:28:49,012 INFO L290 TraceCheckUtils]: 14: Hoare triple {4737#true} assume true; {4737#true} is VALID [2022-04-28 12:28:49,012 INFO L290 TraceCheckUtils]: 13: Hoare triple {4737#true} assume !(0 == ~cond); {4737#true} is VALID [2022-04-28 12:28:49,012 INFO L290 TraceCheckUtils]: 12: Hoare triple {4737#true} ~cond := #in~cond; {4737#true} is VALID [2022-04-28 12:28:49,012 INFO L272 TraceCheckUtils]: 11: Hoare triple {4737#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4737#true} is VALID [2022-04-28 12:28:49,012 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4737#true} {4737#true} #94#return; {4737#true} is VALID [2022-04-28 12:28:49,013 INFO L290 TraceCheckUtils]: 9: Hoare triple {4737#true} assume true; {4737#true} is VALID [2022-04-28 12:28:49,013 INFO L290 TraceCheckUtils]: 8: Hoare triple {4737#true} assume !(0 == ~cond); {4737#true} is VALID [2022-04-28 12:28:49,013 INFO L290 TraceCheckUtils]: 7: Hoare triple {4737#true} ~cond := #in~cond; {4737#true} is VALID [2022-04-28 12:28:49,013 INFO L272 TraceCheckUtils]: 6: Hoare triple {4737#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4737#true} is VALID [2022-04-28 12:28:49,013 INFO L290 TraceCheckUtils]: 5: Hoare triple {4737#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4737#true} is VALID [2022-04-28 12:28:49,013 INFO L272 TraceCheckUtils]: 4: Hoare triple {4737#true} call #t~ret9 := main(); {4737#true} is VALID [2022-04-28 12:28:49,013 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4737#true} {4737#true} #108#return; {4737#true} is VALID [2022-04-28 12:28:49,013 INFO L290 TraceCheckUtils]: 2: Hoare triple {4737#true} assume true; {4737#true} is VALID [2022-04-28 12:28:49,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {4737#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);~counter~0 := 0; {4737#true} is VALID [2022-04-28 12:28:49,014 INFO L272 TraceCheckUtils]: 0: Hoare triple {4737#true} call ULTIMATE.init(); {4737#true} is VALID [2022-04-28 12:28:49,014 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 12:28:49,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:28:49,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912702476] [2022-04-28 12:28:49,014 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:28:49,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103814861] [2022-04-28 12:28:49,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103814861] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:28:49,015 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:28:49,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 11 [2022-04-28 12:28:49,017 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:28:49,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [207837667] [2022-04-28 12:28:49,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [207837667] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:28:49,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:28:49,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 12:28:49,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846212302] [2022-04-28 12:28:49,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:28:49,021 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2022-04-28 12:28:49,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:28:49,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:28:49,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:28:49,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 12:28:49,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:28:49,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 12:28:49,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-28 12:28:49,057 INFO L87 Difference]: Start difference. First operand 109 states and 147 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:28:49,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:28:49,778 INFO L93 Difference]: Finished difference Result 154 states and 208 transitions. [2022-04-28 12:28:49,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 12:28:49,778 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2022-04-28 12:28:49,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:28:49,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:28:49,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2022-04-28 12:28:49,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:28:49,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2022-04-28 12:28:49,789 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 99 transitions. [2022-04-28 12:28:49,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:28:49,871 INFO L225 Difference]: With dead ends: 154 [2022-04-28 12:28:49,871 INFO L226 Difference]: Without dead ends: 152 [2022-04-28 12:28:49,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-04-28 12:28:49,872 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 61 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 12:28:49,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 326 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 12:28:49,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-04-28 12:28:50,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 148. [2022-04-28 12:28:50,066 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:28:50,066 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand has 148 states, 109 states have (on average 1.3394495412844036) internal successors, (146), 110 states have internal predecessors, (146), 29 states have call successors, (29), 10 states have call predecessors, (29), 9 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-28 12:28:50,067 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand has 148 states, 109 states have (on average 1.3394495412844036) internal successors, (146), 110 states have internal predecessors, (146), 29 states have call successors, (29), 10 states have call predecessors, (29), 9 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-28 12:28:50,067 INFO L87 Difference]: Start difference. First operand 152 states. Second operand has 148 states, 109 states have (on average 1.3394495412844036) internal successors, (146), 110 states have internal predecessors, (146), 29 states have call successors, (29), 10 states have call predecessors, (29), 9 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-28 12:28:50,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:28:50,072 INFO L93 Difference]: Finished difference Result 152 states and 206 transitions. [2022-04-28 12:28:50,072 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 206 transitions. [2022-04-28 12:28:50,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:28:50,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:28:50,073 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 109 states have (on average 1.3394495412844036) internal successors, (146), 110 states have internal predecessors, (146), 29 states have call successors, (29), 10 states have call predecessors, (29), 9 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 152 states. [2022-04-28 12:28:50,074 INFO L87 Difference]: Start difference. First operand has 148 states, 109 states have (on average 1.3394495412844036) internal successors, (146), 110 states have internal predecessors, (146), 29 states have call successors, (29), 10 states have call predecessors, (29), 9 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 152 states. [2022-04-28 12:28:50,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:28:50,078 INFO L93 Difference]: Finished difference Result 152 states and 206 transitions. [2022-04-28 12:28:50,079 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 206 transitions. [2022-04-28 12:28:50,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:28:50,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:28:50,079 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:28:50,079 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:28:50,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 109 states have (on average 1.3394495412844036) internal successors, (146), 110 states have internal predecessors, (146), 29 states have call successors, (29), 10 states have call predecessors, (29), 9 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-28 12:28:50,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 202 transitions. [2022-04-28 12:28:50,085 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 202 transitions. Word has length 36 [2022-04-28 12:28:50,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:28:50,085 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 202 transitions. [2022-04-28 12:28:50,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:28:50,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 202 transitions. [2022-04-28 12:28:50,260 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 202 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:28:50,261 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 202 transitions. [2022-04-28 12:28:50,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 12:28:50,261 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:28:50,261 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-04-28 12:28:50,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 12:28:50,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-28 12:28:50,464 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:28:50,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:28:50,464 INFO L85 PathProgramCache]: Analyzing trace with hash -428189223, now seen corresponding path program 3 times [2022-04-28 12:28:50,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:28:50,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [145024068] [2022-04-28 12:28:50,464 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:28:50,464 INFO L85 PathProgramCache]: Analyzing trace with hash -428189223, now seen corresponding path program 4 times [2022-04-28 12:28:50,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:28:50,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975631730] [2022-04-28 12:28:50,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:28:50,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:28:50,487 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:28:50,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1037100034] [2022-04-28 12:28:50,487 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 12:28:50,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:28:50,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:28:50,489 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:28:50,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-28 12:28:50,531 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 12:28:50,531 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:28:50,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 12:28:50,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:28:50,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:28:50,645 INFO L272 TraceCheckUtils]: 0: Hoare triple {5875#true} call ULTIMATE.init(); {5875#true} is VALID [2022-04-28 12:28:50,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {5875#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);~counter~0 := 0; {5875#true} is VALID [2022-04-28 12:28:50,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {5875#true} assume true; {5875#true} is VALID [2022-04-28 12:28:50,646 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5875#true} {5875#true} #108#return; {5875#true} is VALID [2022-04-28 12:28:50,646 INFO L272 TraceCheckUtils]: 4: Hoare triple {5875#true} call #t~ret9 := main(); {5875#true} is VALID [2022-04-28 12:28:50,646 INFO L290 TraceCheckUtils]: 5: Hoare triple {5875#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {5875#true} is VALID [2022-04-28 12:28:50,646 INFO L272 TraceCheckUtils]: 6: Hoare triple {5875#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {5875#true} is VALID [2022-04-28 12:28:50,646 INFO L290 TraceCheckUtils]: 7: Hoare triple {5875#true} ~cond := #in~cond; {5875#true} is VALID [2022-04-28 12:28:50,646 INFO L290 TraceCheckUtils]: 8: Hoare triple {5875#true} assume !(0 == ~cond); {5875#true} is VALID [2022-04-28 12:28:50,646 INFO L290 TraceCheckUtils]: 9: Hoare triple {5875#true} assume true; {5875#true} is VALID [2022-04-28 12:28:50,646 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5875#true} {5875#true} #94#return; {5875#true} is VALID [2022-04-28 12:28:50,646 INFO L272 TraceCheckUtils]: 11: Hoare triple {5875#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {5875#true} is VALID [2022-04-28 12:28:50,646 INFO L290 TraceCheckUtils]: 12: Hoare triple {5875#true} ~cond := #in~cond; {5875#true} is VALID [2022-04-28 12:28:50,646 INFO L290 TraceCheckUtils]: 13: Hoare triple {5875#true} assume !(0 == ~cond); {5875#true} is VALID [2022-04-28 12:28:50,647 INFO L290 TraceCheckUtils]: 14: Hoare triple {5875#true} assume true; {5875#true} is VALID [2022-04-28 12:28:50,647 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5875#true} {5875#true} #96#return; {5875#true} is VALID [2022-04-28 12:28:50,647 INFO L290 TraceCheckUtils]: 16: Hoare triple {5875#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {5875#true} is VALID [2022-04-28 12:28:50,647 INFO L290 TraceCheckUtils]: 17: Hoare triple {5875#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5875#true} is VALID [2022-04-28 12:28:50,647 INFO L290 TraceCheckUtils]: 18: Hoare triple {5875#true} assume !!(#t~post6 < 10);havoc #t~post6; {5875#true} is VALID [2022-04-28 12:28:50,647 INFO L290 TraceCheckUtils]: 19: Hoare triple {5875#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {5875#true} is VALID [2022-04-28 12:28:50,647 INFO L290 TraceCheckUtils]: 20: Hoare triple {5875#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5875#true} is VALID [2022-04-28 12:28:50,647 INFO L290 TraceCheckUtils]: 21: Hoare triple {5875#true} assume !!(#t~post7 < 10);havoc #t~post7; {5875#true} is VALID [2022-04-28 12:28:50,648 INFO L290 TraceCheckUtils]: 22: Hoare triple {5875#true} assume !(~c~0 >= ~b~0); {5946#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-28 12:28:50,648 INFO L290 TraceCheckUtils]: 23: Hoare triple {5946#(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; {5950#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 12:28:50,649 INFO L290 TraceCheckUtils]: 24: Hoare triple {5950#(< main_~b~0 main_~a~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5950#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 12:28:50,649 INFO L290 TraceCheckUtils]: 25: Hoare triple {5950#(< main_~b~0 main_~a~0)} assume !!(#t~post6 < 10);havoc #t~post6; {5950#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 12:28:50,649 INFO L290 TraceCheckUtils]: 26: Hoare triple {5950#(< main_~b~0 main_~a~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {5960#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 12:28:50,650 INFO L290 TraceCheckUtils]: 27: Hoare triple {5960#(< main_~b~0 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5960#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 12:28:50,650 INFO L290 TraceCheckUtils]: 28: Hoare triple {5960#(< main_~b~0 main_~c~0)} assume !!(#t~post7 < 10);havoc #t~post7; {5960#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 12:28:50,650 INFO L290 TraceCheckUtils]: 29: Hoare triple {5960#(< main_~b~0 main_~c~0)} assume !(~c~0 >= ~b~0); {5876#false} is VALID [2022-04-28 12:28:50,650 INFO L290 TraceCheckUtils]: 30: Hoare triple {5876#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; {5876#false} is VALID [2022-04-28 12:28:50,650 INFO L290 TraceCheckUtils]: 31: Hoare triple {5876#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5876#false} is VALID [2022-04-28 12:28:50,651 INFO L290 TraceCheckUtils]: 32: Hoare triple {5876#false} assume !(#t~post6 < 10);havoc #t~post6; {5876#false} is VALID [2022-04-28 12:28:50,651 INFO L272 TraceCheckUtils]: 33: Hoare triple {5876#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)); {5876#false} is VALID [2022-04-28 12:28:50,651 INFO L290 TraceCheckUtils]: 34: Hoare triple {5876#false} ~cond := #in~cond; {5876#false} is VALID [2022-04-28 12:28:50,651 INFO L290 TraceCheckUtils]: 35: Hoare triple {5876#false} assume 0 == ~cond; {5876#false} is VALID [2022-04-28 12:28:50,651 INFO L290 TraceCheckUtils]: 36: Hoare triple {5876#false} assume !false; {5876#false} is VALID [2022-04-28 12:28:50,651 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 12:28:50,651 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:28:50,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:28:50,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975631730] [2022-04-28 12:28:50,651 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:28:50,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037100034] [2022-04-28 12:28:50,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037100034] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:28:50,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:28:50,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:28:50,652 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:28:50,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [145024068] [2022-04-28 12:28:50,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [145024068] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:28:50,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:28:50,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:28:50,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537902476] [2022-04-28 12:28:50,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:28:50,653 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2022-04-28 12:28:50,653 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:28:50,653 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 12:28:50,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:28:50,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 12:28:50,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:28:50,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 12:28:50,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 12:28:50,673 INFO L87 Difference]: Start difference. First operand 148 states and 202 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 12:28:51,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:28:51,377 INFO L93 Difference]: Finished difference Result 300 states and 442 transitions. [2022-04-28 12:28:51,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 12:28:51,377 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2022-04-28 12:28:51,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:28:51,377 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 12:28:51,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2022-04-28 12:28:51,379 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 12:28:51,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2022-04-28 12:28:51,381 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 124 transitions. [2022-04-28 12:28:51,469 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:28:51,476 INFO L225 Difference]: With dead ends: 300 [2022-04-28 12:28:51,476 INFO L226 Difference]: Without dead ends: 249 [2022-04-28 12:28:51,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-28 12:28:51,477 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 29 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 12:28:51,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 176 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 12:28:51,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-04-28 12:28:51,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 175. [2022-04-28 12:28:51,746 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:28:51,746 INFO L82 GeneralOperation]: Start isEquivalent. First operand 249 states. Second operand has 175 states, 136 states have (on average 1.3455882352941178) internal successors, (183), 137 states have internal predecessors, (183), 29 states have call successors, (29), 10 states have call predecessors, (29), 9 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-28 12:28:51,747 INFO L74 IsIncluded]: Start isIncluded. First operand 249 states. Second operand has 175 states, 136 states have (on average 1.3455882352941178) internal successors, (183), 137 states have internal predecessors, (183), 29 states have call successors, (29), 10 states have call predecessors, (29), 9 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-28 12:28:51,747 INFO L87 Difference]: Start difference. First operand 249 states. Second operand has 175 states, 136 states have (on average 1.3455882352941178) internal successors, (183), 137 states have internal predecessors, (183), 29 states have call successors, (29), 10 states have call predecessors, (29), 9 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-28 12:28:51,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:28:51,755 INFO L93 Difference]: Finished difference Result 249 states and 361 transitions. [2022-04-28 12:28:51,756 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 361 transitions. [2022-04-28 12:28:51,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:28:51,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:28:51,757 INFO L74 IsIncluded]: Start isIncluded. First operand has 175 states, 136 states have (on average 1.3455882352941178) internal successors, (183), 137 states have internal predecessors, (183), 29 states have call successors, (29), 10 states have call predecessors, (29), 9 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 249 states. [2022-04-28 12:28:51,758 INFO L87 Difference]: Start difference. First operand has 175 states, 136 states have (on average 1.3455882352941178) internal successors, (183), 137 states have internal predecessors, (183), 29 states have call successors, (29), 10 states have call predecessors, (29), 9 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 249 states. [2022-04-28 12:28:51,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:28:51,766 INFO L93 Difference]: Finished difference Result 249 states and 361 transitions. [2022-04-28 12:28:51,766 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 361 transitions. [2022-04-28 12:28:51,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:28:51,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:28:51,767 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:28:51,767 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:28:51,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 136 states have (on average 1.3455882352941178) internal successors, (183), 137 states have internal predecessors, (183), 29 states have call successors, (29), 10 states have call predecessors, (29), 9 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-28 12:28:51,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 239 transitions. [2022-04-28 12:28:51,772 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 239 transitions. Word has length 37 [2022-04-28 12:28:51,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:28:51,773 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 239 transitions. [2022-04-28 12:28:51,773 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 12:28:51,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 175 states and 239 transitions. [2022-04-28 12:28:51,990 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 239 edges. 239 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:28:51,991 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 239 transitions. [2022-04-28 12:28:51,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 12:28:51,991 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:28:51,991 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-04-28 12:28:52,011 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 12:28:52,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-28 12:28:52,204 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:28:52,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:28:52,204 INFO L85 PathProgramCache]: Analyzing trace with hash -957710478, now seen corresponding path program 1 times [2022-04-28 12:28:52,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:28:52,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [922602018] [2022-04-28 12:28:52,205 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:28:52,205 INFO L85 PathProgramCache]: Analyzing trace with hash -957710478, now seen corresponding path program 2 times [2022-04-28 12:28:52,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:28:52,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540347881] [2022-04-28 12:28:52,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:28:52,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:28:52,218 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:28:52,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [811687824] [2022-04-28 12:28:52,218 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:28:52,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:28:52,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:28:52,219 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:28:52,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-28 12:28:52,262 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:28:52,262 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:28:52,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 12:28:52,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:28:52,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:28:52,496 INFO L272 TraceCheckUtils]: 0: Hoare triple {7443#true} call ULTIMATE.init(); {7443#true} is VALID [2022-04-28 12:28:52,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {7443#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);~counter~0 := 0; {7443#true} is VALID [2022-04-28 12:28:52,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {7443#true} assume true; {7443#true} is VALID [2022-04-28 12:28:52,496 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7443#true} {7443#true} #108#return; {7443#true} is VALID [2022-04-28 12:28:52,497 INFO L272 TraceCheckUtils]: 4: Hoare triple {7443#true} call #t~ret9 := main(); {7443#true} is VALID [2022-04-28 12:28:52,497 INFO L290 TraceCheckUtils]: 5: Hoare triple {7443#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {7443#true} is VALID [2022-04-28 12:28:52,497 INFO L272 TraceCheckUtils]: 6: Hoare triple {7443#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {7443#true} is VALID [2022-04-28 12:28:52,497 INFO L290 TraceCheckUtils]: 7: Hoare triple {7443#true} ~cond := #in~cond; {7443#true} is VALID [2022-04-28 12:28:52,497 INFO L290 TraceCheckUtils]: 8: Hoare triple {7443#true} assume !(0 == ~cond); {7443#true} is VALID [2022-04-28 12:28:52,497 INFO L290 TraceCheckUtils]: 9: Hoare triple {7443#true} assume true; {7443#true} is VALID [2022-04-28 12:28:52,497 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7443#true} {7443#true} #94#return; {7443#true} is VALID [2022-04-28 12:28:52,497 INFO L272 TraceCheckUtils]: 11: Hoare triple {7443#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7443#true} is VALID [2022-04-28 12:28:52,498 INFO L290 TraceCheckUtils]: 12: Hoare triple {7443#true} ~cond := #in~cond; {7484#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 12:28:52,498 INFO L290 TraceCheckUtils]: 13: Hoare triple {7484#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {7488#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:28:52,498 INFO L290 TraceCheckUtils]: 14: Hoare triple {7488#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {7488#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:28:52,499 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7488#(not (= |assume_abort_if_not_#in~cond| 0))} {7443#true} #96#return; {7495#(<= 1 main_~y~0)} is VALID [2022-04-28 12:28:52,499 INFO L290 TraceCheckUtils]: 16: Hoare triple {7495#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {7499#(<= 1 main_~b~0)} is VALID [2022-04-28 12:28:52,499 INFO L290 TraceCheckUtils]: 17: Hoare triple {7499#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7499#(<= 1 main_~b~0)} is VALID [2022-04-28 12:28:52,500 INFO L290 TraceCheckUtils]: 18: Hoare triple {7499#(<= 1 main_~b~0)} assume !!(#t~post6 < 10);havoc #t~post6; {7499#(<= 1 main_~b~0)} is VALID [2022-04-28 12:28:52,500 INFO L290 TraceCheckUtils]: 19: Hoare triple {7499#(<= 1 main_~b~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {7509#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-28 12:28:52,500 INFO L290 TraceCheckUtils]: 20: Hoare triple {7509#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7509#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-28 12:28:52,501 INFO L290 TraceCheckUtils]: 21: Hoare triple {7509#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} assume !!(#t~post7 < 10);havoc #t~post7; {7509#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-28 12:28:52,501 INFO L290 TraceCheckUtils]: 22: Hoare triple {7509#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {7509#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-28 12:28:52,501 INFO L290 TraceCheckUtils]: 23: Hoare triple {7509#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7509#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-28 12:28:52,502 INFO L290 TraceCheckUtils]: 24: Hoare triple {7509#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} assume !!(#t~post8 < 10);havoc #t~post8; {7509#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-28 12:28:52,502 INFO L272 TraceCheckUtils]: 25: Hoare triple {7509#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {7443#true} is VALID [2022-04-28 12:28:52,502 INFO L290 TraceCheckUtils]: 26: Hoare triple {7443#true} ~cond := #in~cond; {7443#true} is VALID [2022-04-28 12:28:52,502 INFO L290 TraceCheckUtils]: 27: Hoare triple {7443#true} assume !(0 == ~cond); {7443#true} is VALID [2022-04-28 12:28:52,502 INFO L290 TraceCheckUtils]: 28: Hoare triple {7443#true} assume true; {7443#true} is VALID [2022-04-28 12:28:52,504 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {7443#true} {7509#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} #98#return; {7509#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-28 12:28:52,504 INFO L272 TraceCheckUtils]: 30: Hoare triple {7509#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {7443#true} is VALID [2022-04-28 12:28:52,504 INFO L290 TraceCheckUtils]: 31: Hoare triple {7443#true} ~cond := #in~cond; {7443#true} is VALID [2022-04-28 12:28:52,504 INFO L290 TraceCheckUtils]: 32: Hoare triple {7443#true} assume !(0 == ~cond); {7443#true} is VALID [2022-04-28 12:28:52,504 INFO L290 TraceCheckUtils]: 33: Hoare triple {7443#true} assume true; {7443#true} is VALID [2022-04-28 12:28:52,505 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7443#true} {7509#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} #100#return; {7509#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-28 12:28:52,506 INFO L272 TraceCheckUtils]: 35: Hoare triple {7509#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {7558#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:28:52,506 INFO L290 TraceCheckUtils]: 36: Hoare triple {7558#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7562#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:28:52,507 INFO L290 TraceCheckUtils]: 37: Hoare triple {7562#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7444#false} is VALID [2022-04-28 12:28:52,507 INFO L290 TraceCheckUtils]: 38: Hoare triple {7444#false} assume !false; {7444#false} is VALID [2022-04-28 12:28:52,507 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-28 12:28:52,507 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:28:52,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:28:52,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540347881] [2022-04-28 12:28:52,508 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:28:52,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811687824] [2022-04-28 12:28:52,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811687824] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:28:52,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:28:52,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 12:28:52,508 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:28:52,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [922602018] [2022-04-28 12:28:52,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [922602018] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:28:52,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:28:52,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 12:28:52,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502660882] [2022-04-28 12:28:52,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:28:52,509 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2022-04-28 12:28:52,510 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:28:52,510 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 12:28:52,543 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:28:52,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 12:28:52,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:28:52,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 12:28:52,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-04-28 12:28:52,544 INFO L87 Difference]: Start difference. First operand 175 states and 239 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 12:28:53,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:28:53,306 INFO L93 Difference]: Finished difference Result 193 states and 262 transitions. [2022-04-28 12:28:53,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 12:28:53,306 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2022-04-28 12:28:53,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:28:53,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 12:28:53,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 92 transitions. [2022-04-28 12:28:53,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 12:28:53,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 92 transitions. [2022-04-28 12:28:53,310 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 92 transitions. [2022-04-28 12:28:53,388 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:28:53,392 INFO L225 Difference]: With dead ends: 193 [2022-04-28 12:28:53,392 INFO L226 Difference]: Without dead ends: 191 [2022-04-28 12:28:53,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-04-28 12:28:53,393 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 57 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 12:28:53,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 270 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 12:28:53,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-04-28 12:28:53,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 190. [2022-04-28 12:28:53,756 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:28:53,756 INFO L82 GeneralOperation]: Start isEquivalent. First operand 191 states. Second operand has 190 states, 145 states have (on average 1.3379310344827586) internal successors, (194), 146 states have internal predecessors, (194), 33 states have call successors, (33), 12 states have call predecessors, (33), 11 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 12:28:53,756 INFO L74 IsIncluded]: Start isIncluded. First operand 191 states. Second operand has 190 states, 145 states have (on average 1.3379310344827586) internal successors, (194), 146 states have internal predecessors, (194), 33 states have call successors, (33), 12 states have call predecessors, (33), 11 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 12:28:53,757 INFO L87 Difference]: Start difference. First operand 191 states. Second operand has 190 states, 145 states have (on average 1.3379310344827586) internal successors, (194), 146 states have internal predecessors, (194), 33 states have call successors, (33), 12 states have call predecessors, (33), 11 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 12:28:53,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:28:53,762 INFO L93 Difference]: Finished difference Result 191 states and 259 transitions. [2022-04-28 12:28:53,762 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 259 transitions. [2022-04-28 12:28:53,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:28:53,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:28:53,763 INFO L74 IsIncluded]: Start isIncluded. First operand has 190 states, 145 states have (on average 1.3379310344827586) internal successors, (194), 146 states have internal predecessors, (194), 33 states have call successors, (33), 12 states have call predecessors, (33), 11 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand 191 states. [2022-04-28 12:28:53,763 INFO L87 Difference]: Start difference. First operand has 190 states, 145 states have (on average 1.3379310344827586) internal successors, (194), 146 states have internal predecessors, (194), 33 states have call successors, (33), 12 states have call predecessors, (33), 11 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand 191 states. [2022-04-28 12:28:53,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:28:53,768 INFO L93 Difference]: Finished difference Result 191 states and 259 transitions. [2022-04-28 12:28:53,768 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 259 transitions. [2022-04-28 12:28:53,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:28:53,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:28:53,769 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:28:53,769 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:28:53,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 145 states have (on average 1.3379310344827586) internal successors, (194), 146 states have internal predecessors, (194), 33 states have call successors, (33), 12 states have call predecessors, (33), 11 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 12:28:53,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 258 transitions. [2022-04-28 12:28:53,774 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 258 transitions. Word has length 39 [2022-04-28 12:28:53,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:28:53,775 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 258 transitions. [2022-04-28 12:28:53,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 12:28:53,775 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 190 states and 258 transitions. [2022-04-28 12:28:54,017 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 258 edges. 258 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:28:54,017 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 258 transitions. [2022-04-28 12:28:54,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 12:28:54,018 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:28:54,018 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:28:54,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-28 12:28:54,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-28 12:28:54,227 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:28:54,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:28:54,228 INFO L85 PathProgramCache]: Analyzing trace with hash 409018142, now seen corresponding path program 1 times [2022-04-28 12:28:54,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:28:54,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1908221616] [2022-04-28 12:28:54,228 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:28:54,228 INFO L85 PathProgramCache]: Analyzing trace with hash 409018142, now seen corresponding path program 2 times [2022-04-28 12:28:54,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:28:54,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204714357] [2022-04-28 12:28:54,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:28:54,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:28:54,241 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:28:54,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [818820579] [2022-04-28 12:28:54,242 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:28:54,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:28:54,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:28:54,243 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:28:54,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-28 12:28:54,293 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:28:54,293 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:28:54,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 12:28:54,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:28:54,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:28:54,839 INFO L272 TraceCheckUtils]: 0: Hoare triple {8724#true} call ULTIMATE.init(); {8724#true} is VALID [2022-04-28 12:28:54,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {8724#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);~counter~0 := 0; {8724#true} is VALID [2022-04-28 12:28:54,839 INFO L290 TraceCheckUtils]: 2: Hoare triple {8724#true} assume true; {8724#true} is VALID [2022-04-28 12:28:54,839 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8724#true} {8724#true} #108#return; {8724#true} is VALID [2022-04-28 12:28:54,839 INFO L272 TraceCheckUtils]: 4: Hoare triple {8724#true} call #t~ret9 := main(); {8724#true} is VALID [2022-04-28 12:28:54,839 INFO L290 TraceCheckUtils]: 5: Hoare triple {8724#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8724#true} is VALID [2022-04-28 12:28:54,839 INFO L272 TraceCheckUtils]: 6: Hoare triple {8724#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {8724#true} is VALID [2022-04-28 12:28:54,840 INFO L290 TraceCheckUtils]: 7: Hoare triple {8724#true} ~cond := #in~cond; {8750#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 12:28:54,840 INFO L290 TraceCheckUtils]: 8: Hoare triple {8750#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {8754#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:28:54,840 INFO L290 TraceCheckUtils]: 9: Hoare triple {8754#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {8754#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:28:54,841 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8754#(not (= |assume_abort_if_not_#in~cond| 0))} {8724#true} #94#return; {8761#(<= 1 main_~x~0)} is VALID [2022-04-28 12:28:54,841 INFO L272 TraceCheckUtils]: 11: Hoare triple {8761#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8724#true} is VALID [2022-04-28 12:28:54,841 INFO L290 TraceCheckUtils]: 12: Hoare triple {8724#true} ~cond := #in~cond; {8750#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 12:28:54,841 INFO L290 TraceCheckUtils]: 13: Hoare triple {8750#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {8754#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:28:54,842 INFO L290 TraceCheckUtils]: 14: Hoare triple {8754#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {8754#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:28:54,844 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8754#(not (= |assume_abort_if_not_#in~cond| 0))} {8761#(<= 1 main_~x~0)} #96#return; {8777#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-28 12:28:54,844 INFO L290 TraceCheckUtils]: 16: Hoare triple {8777#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {8781#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:28:54,845 INFO L290 TraceCheckUtils]: 17: Hoare triple {8781#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8781#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:28:54,845 INFO L290 TraceCheckUtils]: 18: Hoare triple {8781#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 10);havoc #t~post6; {8781#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:28:54,846 INFO L290 TraceCheckUtils]: 19: Hoare triple {8781#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {8791#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:28:54,846 INFO L290 TraceCheckUtils]: 20: Hoare triple {8791#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8791#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:28:54,846 INFO L290 TraceCheckUtils]: 21: Hoare triple {8791#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 10);havoc #t~post7; {8791#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:28:54,847 INFO L290 TraceCheckUtils]: 22: Hoare triple {8791#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {8791#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:28:54,847 INFO L290 TraceCheckUtils]: 23: Hoare triple {8791#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (<= 1 main_~y~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; {8804#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-28 12:28:54,848 INFO L290 TraceCheckUtils]: 24: Hoare triple {8804#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8804#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-28 12:28:54,848 INFO L290 TraceCheckUtils]: 25: Hoare triple {8804#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} assume !!(#t~post6 < 10);havoc #t~post6; {8804#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-28 12:28:54,849 INFO L290 TraceCheckUtils]: 26: Hoare triple {8804#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {8804#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-28 12:28:54,849 INFO L290 TraceCheckUtils]: 27: Hoare triple {8804#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8804#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-28 12:28:54,849 INFO L290 TraceCheckUtils]: 28: Hoare triple {8804#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} assume !!(#t~post7 < 10);havoc #t~post7; {8804#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-28 12:28:54,850 INFO L290 TraceCheckUtils]: 29: Hoare triple {8804#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {8804#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-28 12:28:54,850 INFO L290 TraceCheckUtils]: 30: Hoare triple {8804#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8804#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-28 12:28:54,851 INFO L290 TraceCheckUtils]: 31: Hoare triple {8804#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} assume !!(#t~post8 < 10);havoc #t~post8; {8804#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-28 12:28:54,851 INFO L272 TraceCheckUtils]: 32: Hoare triple {8804#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8724#true} is VALID [2022-04-28 12:28:54,851 INFO L290 TraceCheckUtils]: 33: Hoare triple {8724#true} ~cond := #in~cond; {8724#true} is VALID [2022-04-28 12:28:54,851 INFO L290 TraceCheckUtils]: 34: Hoare triple {8724#true} assume !(0 == ~cond); {8724#true} is VALID [2022-04-28 12:28:54,851 INFO L290 TraceCheckUtils]: 35: Hoare triple {8724#true} assume true; {8724#true} is VALID [2022-04-28 12:28:54,852 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8724#true} {8804#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} #98#return; {8804#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-28 12:28:54,852 INFO L272 TraceCheckUtils]: 37: Hoare triple {8804#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8847#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:28:54,853 INFO L290 TraceCheckUtils]: 38: Hoare triple {8847#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8851#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:28:54,853 INFO L290 TraceCheckUtils]: 39: Hoare triple {8851#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8725#false} is VALID [2022-04-28 12:28:54,853 INFO L290 TraceCheckUtils]: 40: Hoare triple {8725#false} assume !false; {8725#false} is VALID [2022-04-28 12:28:54,853 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 12:28:54,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:28:55,174 INFO L290 TraceCheckUtils]: 40: Hoare triple {8725#false} assume !false; {8725#false} is VALID [2022-04-28 12:28:55,175 INFO L290 TraceCheckUtils]: 39: Hoare triple {8851#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8725#false} is VALID [2022-04-28 12:28:55,175 INFO L290 TraceCheckUtils]: 38: Hoare triple {8847#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8851#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:28:55,176 INFO L272 TraceCheckUtils]: 37: Hoare triple {8867#(= 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)); {8847#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:28:55,176 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8724#true} {8867#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #98#return; {8867#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:28:55,176 INFO L290 TraceCheckUtils]: 35: Hoare triple {8724#true} assume true; {8724#true} is VALID [2022-04-28 12:28:55,177 INFO L290 TraceCheckUtils]: 34: Hoare triple {8724#true} assume !(0 == ~cond); {8724#true} is VALID [2022-04-28 12:28:55,177 INFO L290 TraceCheckUtils]: 33: Hoare triple {8724#true} ~cond := #in~cond; {8724#true} is VALID [2022-04-28 12:28:55,177 INFO L272 TraceCheckUtils]: 32: Hoare triple {8867#(= 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)); {8724#true} is VALID [2022-04-28 12:28:55,177 INFO L290 TraceCheckUtils]: 31: Hoare triple {8867#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post8 < 10);havoc #t~post8; {8867#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:28:55,177 INFO L290 TraceCheckUtils]: 30: Hoare triple {8867#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8867#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:28:55,178 INFO L290 TraceCheckUtils]: 29: Hoare triple {8867#(= 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; {8867#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:28:55,178 INFO L290 TraceCheckUtils]: 28: Hoare triple {8867#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post7 < 10);havoc #t~post7; {8867#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:28:55,179 INFO L290 TraceCheckUtils]: 27: Hoare triple {8867#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8867#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:28:55,179 INFO L290 TraceCheckUtils]: 26: Hoare triple {8867#(= 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; {8867#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:28:55,179 INFO L290 TraceCheckUtils]: 25: Hoare triple {8867#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post6 < 10);havoc #t~post6; {8867#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:28:55,180 INFO L290 TraceCheckUtils]: 24: Hoare triple {8867#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8867#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:28:57,181 WARN L290 TraceCheckUtils]: 23: Hoare triple {8910#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {8867#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is UNKNOWN [2022-04-28 12:28:57,182 INFO L290 TraceCheckUtils]: 22: Hoare triple {8910#(= (+ (* (+ (* (* 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)} assume !(~c~0 >= ~b~0); {8910#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} is VALID [2022-04-28 12:28:57,182 INFO L290 TraceCheckUtils]: 21: Hoare triple {8910#(= (+ (* (+ (* (* 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)} assume !!(#t~post7 < 10);havoc #t~post7; {8910#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} is VALID [2022-04-28 12:28:57,183 INFO L290 TraceCheckUtils]: 20: Hoare triple {8910#(= (+ (* (+ (* (* 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)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8910#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} is VALID [2022-04-28 12:28:57,184 INFO L290 TraceCheckUtils]: 19: Hoare triple {8923#(= 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; {8910#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} is VALID [2022-04-28 12:28:57,184 INFO L290 TraceCheckUtils]: 18: Hoare triple {8923#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post6 < 10);havoc #t~post6; {8923#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:28:57,185 INFO L290 TraceCheckUtils]: 17: Hoare triple {8923#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8923#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:28:57,185 INFO L290 TraceCheckUtils]: 16: Hoare triple {8724#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {8923#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:28:57,185 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8724#true} {8724#true} #96#return; {8724#true} is VALID [2022-04-28 12:28:57,186 INFO L290 TraceCheckUtils]: 14: Hoare triple {8724#true} assume true; {8724#true} is VALID [2022-04-28 12:28:57,186 INFO L290 TraceCheckUtils]: 13: Hoare triple {8724#true} assume !(0 == ~cond); {8724#true} is VALID [2022-04-28 12:28:57,186 INFO L290 TraceCheckUtils]: 12: Hoare triple {8724#true} ~cond := #in~cond; {8724#true} is VALID [2022-04-28 12:28:57,186 INFO L272 TraceCheckUtils]: 11: Hoare triple {8724#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8724#true} is VALID [2022-04-28 12:28:57,186 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8724#true} {8724#true} #94#return; {8724#true} is VALID [2022-04-28 12:28:57,186 INFO L290 TraceCheckUtils]: 9: Hoare triple {8724#true} assume true; {8724#true} is VALID [2022-04-28 12:28:57,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {8724#true} assume !(0 == ~cond); {8724#true} is VALID [2022-04-28 12:28:57,186 INFO L290 TraceCheckUtils]: 7: Hoare triple {8724#true} ~cond := #in~cond; {8724#true} is VALID [2022-04-28 12:28:57,187 INFO L272 TraceCheckUtils]: 6: Hoare triple {8724#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {8724#true} is VALID [2022-04-28 12:28:57,187 INFO L290 TraceCheckUtils]: 5: Hoare triple {8724#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8724#true} is VALID [2022-04-28 12:28:57,187 INFO L272 TraceCheckUtils]: 4: Hoare triple {8724#true} call #t~ret9 := main(); {8724#true} is VALID [2022-04-28 12:28:57,187 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8724#true} {8724#true} #108#return; {8724#true} is VALID [2022-04-28 12:28:57,187 INFO L290 TraceCheckUtils]: 2: Hoare triple {8724#true} assume true; {8724#true} is VALID [2022-04-28 12:28:57,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {8724#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);~counter~0 := 0; {8724#true} is VALID [2022-04-28 12:28:57,187 INFO L272 TraceCheckUtils]: 0: Hoare triple {8724#true} call ULTIMATE.init(); {8724#true} is VALID [2022-04-28 12:28:57,188 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 12:28:57,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:28:57,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204714357] [2022-04-28 12:28:57,188 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:28:57,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818820579] [2022-04-28 12:28:57,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818820579] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:28:57,188 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:28:57,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 14 [2022-04-28 12:28:57,189 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:28:57,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1908221616] [2022-04-28 12:28:57,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1908221616] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:28:57,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:28:57,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 12:28:57,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296357248] [2022-04-28 12:28:57,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:28:57,190 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 41 [2022-04-28 12:28:57,190 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:28:57,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.8) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 12:28:57,230 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:28:57,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 12:28:57,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:28:57,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 12:28:57,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-28 12:28:57,231 INFO L87 Difference]: Start difference. First operand 190 states and 258 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 12:28:58,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:28:58,483 INFO L93 Difference]: Finished difference Result 199 states and 266 transitions. [2022-04-28 12:28:58,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 12:28:58,483 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 41 [2022-04-28 12:28:58,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:28:58,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 12:28:58,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2022-04-28 12:28:58,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 12:28:58,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2022-04-28 12:28:58,487 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 115 transitions. [2022-04-28 12:28:58,606 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:28:58,610 INFO L225 Difference]: With dead ends: 199 [2022-04-28 12:28:58,610 INFO L226 Difference]: Without dead ends: 197 [2022-04-28 12:28:58,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2022-04-28 12:28:58,611 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 104 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 12:28:58,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 310 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 12:28:58,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-04-28 12:28:59,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 194. [2022-04-28 12:28:59,041 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:28:59,042 INFO L82 GeneralOperation]: Start isEquivalent. First operand 197 states. Second operand has 194 states, 148 states have (on average 1.3310810810810811) internal successors, (197), 149 states have internal predecessors, (197), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 12:28:59,042 INFO L74 IsIncluded]: Start isIncluded. First operand 197 states. Second operand has 194 states, 148 states have (on average 1.3310810810810811) internal successors, (197), 149 states have internal predecessors, (197), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 12:28:59,042 INFO L87 Difference]: Start difference. First operand 197 states. Second operand has 194 states, 148 states have (on average 1.3310810810810811) internal successors, (197), 149 states have internal predecessors, (197), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 12:28:59,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:28:59,048 INFO L93 Difference]: Finished difference Result 197 states and 264 transitions. [2022-04-28 12:28:59,048 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 264 transitions. [2022-04-28 12:28:59,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:28:59,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:28:59,049 INFO L74 IsIncluded]: Start isIncluded. First operand has 194 states, 148 states have (on average 1.3310810810810811) internal successors, (197), 149 states have internal predecessors, (197), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand 197 states. [2022-04-28 12:28:59,049 INFO L87 Difference]: Start difference. First operand has 194 states, 148 states have (on average 1.3310810810810811) internal successors, (197), 149 states have internal predecessors, (197), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand 197 states. [2022-04-28 12:28:59,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:28:59,054 INFO L93 Difference]: Finished difference Result 197 states and 264 transitions. [2022-04-28 12:28:59,054 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 264 transitions. [2022-04-28 12:28:59,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:28:59,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:28:59,055 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:28:59,055 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:28:59,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 148 states have (on average 1.3310810810810811) internal successors, (197), 149 states have internal predecessors, (197), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 12:28:59,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 261 transitions. [2022-04-28 12:28:59,060 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 261 transitions. Word has length 41 [2022-04-28 12:28:59,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:28:59,061 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 261 transitions. [2022-04-28 12:28:59,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 12:28:59,061 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 194 states and 261 transitions. [2022-04-28 12:28:59,328 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 261 edges. 261 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:28:59,328 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 261 transitions. [2022-04-28 12:28:59,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 12:28:59,328 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:28:59,328 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-04-28 12:28:59,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-28 12:28:59,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-28 12:28:59,531 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:28:59,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:28:59,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1943393983, now seen corresponding path program 1 times [2022-04-28 12:28:59,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:28:59,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1051595181] [2022-04-28 12:28:59,532 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:28:59,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1943393983, now seen corresponding path program 2 times [2022-04-28 12:28:59,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:28:59,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621651490] [2022-04-28 12:28:59,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:28:59,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:28:59,552 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:28:59,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [193103175] [2022-04-28 12:28:59,552 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:28:59,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:28:59,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:28:59,554 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:28:59,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-28 12:28:59,610 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:28:59,610 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:28:59,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 12:28:59,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:28:59,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:28:59,758 INFO L272 TraceCheckUtils]: 0: Hoare triple {10169#true} call ULTIMATE.init(); {10169#true} is VALID [2022-04-28 12:28:59,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {10169#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);~counter~0 := 0; {10169#true} is VALID [2022-04-28 12:28:59,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {10169#true} assume true; {10169#true} is VALID [2022-04-28 12:28:59,758 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10169#true} {10169#true} #108#return; {10169#true} is VALID [2022-04-28 12:28:59,758 INFO L272 TraceCheckUtils]: 4: Hoare triple {10169#true} call #t~ret9 := main(); {10169#true} is VALID [2022-04-28 12:28:59,758 INFO L290 TraceCheckUtils]: 5: Hoare triple {10169#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {10169#true} is VALID [2022-04-28 12:28:59,759 INFO L272 TraceCheckUtils]: 6: Hoare triple {10169#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {10169#true} is VALID [2022-04-28 12:28:59,759 INFO L290 TraceCheckUtils]: 7: Hoare triple {10169#true} ~cond := #in~cond; {10169#true} is VALID [2022-04-28 12:28:59,759 INFO L290 TraceCheckUtils]: 8: Hoare triple {10169#true} assume !(0 == ~cond); {10169#true} is VALID [2022-04-28 12:28:59,759 INFO L290 TraceCheckUtils]: 9: Hoare triple {10169#true} assume true; {10169#true} is VALID [2022-04-28 12:28:59,759 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10169#true} {10169#true} #94#return; {10169#true} is VALID [2022-04-28 12:28:59,759 INFO L272 TraceCheckUtils]: 11: Hoare triple {10169#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {10169#true} is VALID [2022-04-28 12:28:59,759 INFO L290 TraceCheckUtils]: 12: Hoare triple {10169#true} ~cond := #in~cond; {10169#true} is VALID [2022-04-28 12:28:59,759 INFO L290 TraceCheckUtils]: 13: Hoare triple {10169#true} assume !(0 == ~cond); {10169#true} is VALID [2022-04-28 12:28:59,759 INFO L290 TraceCheckUtils]: 14: Hoare triple {10169#true} assume true; {10169#true} is VALID [2022-04-28 12:28:59,759 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10169#true} {10169#true} #96#return; {10169#true} is VALID [2022-04-28 12:28:59,759 INFO L290 TraceCheckUtils]: 16: Hoare triple {10169#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {10169#true} is VALID [2022-04-28 12:28:59,760 INFO L290 TraceCheckUtils]: 17: Hoare triple {10169#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10169#true} is VALID [2022-04-28 12:28:59,760 INFO L290 TraceCheckUtils]: 18: Hoare triple {10169#true} assume !!(#t~post6 < 10);havoc #t~post6; {10169#true} is VALID [2022-04-28 12:28:59,760 INFO L290 TraceCheckUtils]: 19: Hoare triple {10169#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {10169#true} is VALID [2022-04-28 12:28:59,760 INFO L290 TraceCheckUtils]: 20: Hoare triple {10169#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10169#true} is VALID [2022-04-28 12:28:59,760 INFO L290 TraceCheckUtils]: 21: Hoare triple {10169#true} assume !!(#t~post7 < 10);havoc #t~post7; {10169#true} is VALID [2022-04-28 12:28:59,760 INFO L290 TraceCheckUtils]: 22: Hoare triple {10169#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {10240#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-28 12:28:59,761 INFO L290 TraceCheckUtils]: 23: Hoare triple {10240#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10240#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-28 12:28:59,761 INFO L290 TraceCheckUtils]: 24: Hoare triple {10240#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} assume !!(#t~post8 < 10);havoc #t~post8; {10240#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-28 12:28:59,761 INFO L272 TraceCheckUtils]: 25: Hoare triple {10240#(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)); {10169#true} is VALID [2022-04-28 12:28:59,761 INFO L290 TraceCheckUtils]: 26: Hoare triple {10169#true} ~cond := #in~cond; {10169#true} is VALID [2022-04-28 12:28:59,761 INFO L290 TraceCheckUtils]: 27: Hoare triple {10169#true} assume !(0 == ~cond); {10169#true} is VALID [2022-04-28 12:28:59,761 INFO L290 TraceCheckUtils]: 28: Hoare triple {10169#true} assume true; {10169#true} is VALID [2022-04-28 12:28:59,762 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {10169#true} {10240#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} #98#return; {10240#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-28 12:28:59,762 INFO L272 TraceCheckUtils]: 30: Hoare triple {10240#(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)); {10169#true} is VALID [2022-04-28 12:28:59,762 INFO L290 TraceCheckUtils]: 31: Hoare triple {10169#true} ~cond := #in~cond; {10169#true} is VALID [2022-04-28 12:28:59,762 INFO L290 TraceCheckUtils]: 32: Hoare triple {10169#true} assume !(0 == ~cond); {10169#true} is VALID [2022-04-28 12:28:59,762 INFO L290 TraceCheckUtils]: 33: Hoare triple {10169#true} assume true; {10169#true} is VALID [2022-04-28 12:28:59,763 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10169#true} {10240#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} #100#return; {10240#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-28 12:28:59,763 INFO L272 TraceCheckUtils]: 35: Hoare triple {10240#(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)); {10169#true} is VALID [2022-04-28 12:28:59,763 INFO L290 TraceCheckUtils]: 36: Hoare triple {10169#true} ~cond := #in~cond; {10169#true} is VALID [2022-04-28 12:28:59,763 INFO L290 TraceCheckUtils]: 37: Hoare triple {10169#true} assume !(0 == ~cond); {10169#true} is VALID [2022-04-28 12:28:59,763 INFO L290 TraceCheckUtils]: 38: Hoare triple {10169#true} assume true; {10169#true} is VALID [2022-04-28 12:28:59,764 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {10169#true} {10240#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} #102#return; {10240#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-28 12:28:59,764 INFO L272 TraceCheckUtils]: 40: Hoare triple {10240#(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)); {10295#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:28:59,765 INFO L290 TraceCheckUtils]: 41: Hoare triple {10295#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10299#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:28:59,765 INFO L290 TraceCheckUtils]: 42: Hoare triple {10299#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10170#false} is VALID [2022-04-28 12:28:59,765 INFO L290 TraceCheckUtils]: 43: Hoare triple {10170#false} assume !false; {10170#false} is VALID [2022-04-28 12:28:59,765 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 12:28:59,765 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:28:59,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:28:59,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621651490] [2022-04-28 12:28:59,766 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:28:59,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193103175] [2022-04-28 12:28:59,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193103175] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:28:59,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:28:59,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:28:59,766 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:28:59,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1051595181] [2022-04-28 12:28:59,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1051595181] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:28:59,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:28:59,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:28:59,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051599157] [2022-04-28 12:28:59,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:28:59,767 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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 44 [2022-04-28 12:28:59,767 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:28:59,767 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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 12:28:59,801 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:28:59,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 12:28:59,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:28:59,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 12:28:59,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 12:28:59,802 INFO L87 Difference]: Start difference. First operand 194 states and 261 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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 12:29:00,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:00,474 INFO L93 Difference]: Finished difference Result 261 states and 367 transitions. [2022-04-28 12:29:00,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 12:29:00,475 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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 44 [2022-04-28 12:29:00,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:29:00,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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 12:29:00,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 12:29:00,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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 12:29:00,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 12:29:00,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-28 12:29:00,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:00,544 INFO L225 Difference]: With dead ends: 261 [2022-04-28 12:29:00,544 INFO L226 Difference]: Without dead ends: 259 [2022-04-28 12:29:00,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 12:29:00,545 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 12 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:29:00,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 163 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:29:00,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-04-28 12:29:01,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 228. [2022-04-28 12:29:01,013 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:29:01,013 INFO L82 GeneralOperation]: Start isEquivalent. First operand 259 states. Second operand has 228 states, 161 states have (on average 1.329192546583851) internal successors, (214), 167 states have internal predecessors, (214), 53 states have call successors, (53), 14 states have call predecessors, (53), 13 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-28 12:29:01,013 INFO L74 IsIncluded]: Start isIncluded. First operand 259 states. Second operand has 228 states, 161 states have (on average 1.329192546583851) internal successors, (214), 167 states have internal predecessors, (214), 53 states have call successors, (53), 14 states have call predecessors, (53), 13 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-28 12:29:01,014 INFO L87 Difference]: Start difference. First operand 259 states. Second operand has 228 states, 161 states have (on average 1.329192546583851) internal successors, (214), 167 states have internal predecessors, (214), 53 states have call successors, (53), 14 states have call predecessors, (53), 13 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-28 12:29:01,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:01,021 INFO L93 Difference]: Finished difference Result 259 states and 364 transitions. [2022-04-28 12:29:01,021 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 364 transitions. [2022-04-28 12:29:01,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:29:01,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:29:01,023 INFO L74 IsIncluded]: Start isIncluded. First operand has 228 states, 161 states have (on average 1.329192546583851) internal successors, (214), 167 states have internal predecessors, (214), 53 states have call successors, (53), 14 states have call predecessors, (53), 13 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) Second operand 259 states. [2022-04-28 12:29:01,023 INFO L87 Difference]: Start difference. First operand has 228 states, 161 states have (on average 1.329192546583851) internal successors, (214), 167 states have internal predecessors, (214), 53 states have call successors, (53), 14 states have call predecessors, (53), 13 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) Second operand 259 states. [2022-04-28 12:29:01,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:01,030 INFO L93 Difference]: Finished difference Result 259 states and 364 transitions. [2022-04-28 12:29:01,030 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 364 transitions. [2022-04-28 12:29:01,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:29:01,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:29:01,031 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:29:01,031 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:29:01,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 161 states have (on average 1.329192546583851) internal successors, (214), 167 states have internal predecessors, (214), 53 states have call successors, (53), 14 states have call predecessors, (53), 13 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-28 12:29:01,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 318 transitions. [2022-04-28 12:29:01,038 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 318 transitions. Word has length 44 [2022-04-28 12:29:01,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:29:01,038 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 318 transitions. [2022-04-28 12:29:01,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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 12:29:01,039 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 228 states and 318 transitions. [2022-04-28 12:29:01,397 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 318 edges. 318 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:01,397 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 318 transitions. [2022-04-28 12:29:01,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 12:29:01,398 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:29:01,398 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-04-28 12:29:01,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-28 12:29:01,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 12:29:01,598 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:29:01,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:29:01,599 INFO L85 PathProgramCache]: Analyzing trace with hash -772903697, now seen corresponding path program 1 times [2022-04-28 12:29:01,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:29:01,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [504569140] [2022-04-28 12:29:01,599 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:29:01,599 INFO L85 PathProgramCache]: Analyzing trace with hash -772903697, now seen corresponding path program 2 times [2022-04-28 12:29:01,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:29:01,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556499964] [2022-04-28 12:29:01,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:29:01,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:29:01,611 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:29:01,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1906542275] [2022-04-28 12:29:01,611 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:29:01,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:29:01,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:29:01,613 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:29:01,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-28 12:29:01,658 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:29:01,658 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:29:01,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 12:29:01,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:29:01,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:29:01,901 INFO L272 TraceCheckUtils]: 0: Hoare triple {11803#true} call ULTIMATE.init(); {11803#true} is VALID [2022-04-28 12:29:01,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {11803#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);~counter~0 := 0; {11811#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:01,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {11811#(<= ~counter~0 0)} assume true; {11811#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:01,903 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11811#(<= ~counter~0 0)} {11803#true} #108#return; {11811#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:01,903 INFO L272 TraceCheckUtils]: 4: Hoare triple {11811#(<= ~counter~0 0)} call #t~ret9 := main(); {11811#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:01,903 INFO L290 TraceCheckUtils]: 5: Hoare triple {11811#(<= ~counter~0 0)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {11811#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:01,904 INFO L272 TraceCheckUtils]: 6: Hoare triple {11811#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {11811#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:01,904 INFO L290 TraceCheckUtils]: 7: Hoare triple {11811#(<= ~counter~0 0)} ~cond := #in~cond; {11811#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:01,904 INFO L290 TraceCheckUtils]: 8: Hoare triple {11811#(<= ~counter~0 0)} assume !(0 == ~cond); {11811#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:01,904 INFO L290 TraceCheckUtils]: 9: Hoare triple {11811#(<= ~counter~0 0)} assume true; {11811#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:01,905 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11811#(<= ~counter~0 0)} {11811#(<= ~counter~0 0)} #94#return; {11811#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:01,905 INFO L272 TraceCheckUtils]: 11: Hoare triple {11811#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11811#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:01,906 INFO L290 TraceCheckUtils]: 12: Hoare triple {11811#(<= ~counter~0 0)} ~cond := #in~cond; {11811#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:01,906 INFO L290 TraceCheckUtils]: 13: Hoare triple {11811#(<= ~counter~0 0)} assume !(0 == ~cond); {11811#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:01,906 INFO L290 TraceCheckUtils]: 14: Hoare triple {11811#(<= ~counter~0 0)} assume true; {11811#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:01,907 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11811#(<= ~counter~0 0)} {11811#(<= ~counter~0 0)} #96#return; {11811#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:01,907 INFO L290 TraceCheckUtils]: 16: Hoare triple {11811#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {11811#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:01,907 INFO L290 TraceCheckUtils]: 17: Hoare triple {11811#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11860#(<= ~counter~0 1)} is VALID [2022-04-28 12:29:01,908 INFO L290 TraceCheckUtils]: 18: Hoare triple {11860#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {11860#(<= ~counter~0 1)} is VALID [2022-04-28 12:29:01,908 INFO L290 TraceCheckUtils]: 19: Hoare triple {11860#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {11860#(<= ~counter~0 1)} is VALID [2022-04-28 12:29:01,908 INFO L290 TraceCheckUtils]: 20: Hoare triple {11860#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11870#(<= ~counter~0 2)} is VALID [2022-04-28 12:29:01,909 INFO L290 TraceCheckUtils]: 21: Hoare triple {11870#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {11870#(<= ~counter~0 2)} is VALID [2022-04-28 12:29:01,909 INFO L290 TraceCheckUtils]: 22: Hoare triple {11870#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {11870#(<= ~counter~0 2)} is VALID [2022-04-28 12:29:01,909 INFO L290 TraceCheckUtils]: 23: Hoare triple {11870#(<= ~counter~0 2)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {11870#(<= ~counter~0 2)} is VALID [2022-04-28 12:29:01,910 INFO L290 TraceCheckUtils]: 24: Hoare triple {11870#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11883#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:01,910 INFO L290 TraceCheckUtils]: 25: Hoare triple {11883#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {11883#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:01,910 INFO L290 TraceCheckUtils]: 26: Hoare triple {11883#(<= ~counter~0 3)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {11883#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:01,911 INFO L290 TraceCheckUtils]: 27: Hoare triple {11883#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11893#(<= ~counter~0 4)} is VALID [2022-04-28 12:29:01,911 INFO L290 TraceCheckUtils]: 28: Hoare triple {11893#(<= ~counter~0 4)} assume !!(#t~post7 < 10);havoc #t~post7; {11893#(<= ~counter~0 4)} is VALID [2022-04-28 12:29:01,911 INFO L290 TraceCheckUtils]: 29: Hoare triple {11893#(<= ~counter~0 4)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {11893#(<= ~counter~0 4)} is VALID [2022-04-28 12:29:01,912 INFO L290 TraceCheckUtils]: 30: Hoare triple {11893#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {11903#(<= |main_#t~post8| 4)} is VALID [2022-04-28 12:29:01,912 INFO L290 TraceCheckUtils]: 31: Hoare triple {11903#(<= |main_#t~post8| 4)} assume !(#t~post8 < 10);havoc #t~post8; {11804#false} is VALID [2022-04-28 12:29:01,912 INFO L290 TraceCheckUtils]: 32: Hoare triple {11804#false} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {11804#false} is VALID [2022-04-28 12:29:01,912 INFO L290 TraceCheckUtils]: 33: Hoare triple {11804#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11804#false} is VALID [2022-04-28 12:29:01,912 INFO L290 TraceCheckUtils]: 34: Hoare triple {11804#false} assume !(#t~post7 < 10);havoc #t~post7; {11804#false} is VALID [2022-04-28 12:29:01,912 INFO L290 TraceCheckUtils]: 35: Hoare triple {11804#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; {11804#false} is VALID [2022-04-28 12:29:01,913 INFO L290 TraceCheckUtils]: 36: Hoare triple {11804#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11804#false} is VALID [2022-04-28 12:29:01,913 INFO L290 TraceCheckUtils]: 37: Hoare triple {11804#false} assume !(#t~post6 < 10);havoc #t~post6; {11804#false} is VALID [2022-04-28 12:29:01,913 INFO L272 TraceCheckUtils]: 38: Hoare triple {11804#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)); {11804#false} is VALID [2022-04-28 12:29:01,913 INFO L290 TraceCheckUtils]: 39: Hoare triple {11804#false} ~cond := #in~cond; {11804#false} is VALID [2022-04-28 12:29:01,913 INFO L290 TraceCheckUtils]: 40: Hoare triple {11804#false} assume 0 == ~cond; {11804#false} is VALID [2022-04-28 12:29:01,913 INFO L290 TraceCheckUtils]: 41: Hoare triple {11804#false} assume !false; {11804#false} is VALID [2022-04-28 12:29:01,913 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 12:29:01,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:29:02,149 INFO L290 TraceCheckUtils]: 41: Hoare triple {11804#false} assume !false; {11804#false} is VALID [2022-04-28 12:29:02,149 INFO L290 TraceCheckUtils]: 40: Hoare triple {11804#false} assume 0 == ~cond; {11804#false} is VALID [2022-04-28 12:29:02,150 INFO L290 TraceCheckUtils]: 39: Hoare triple {11804#false} ~cond := #in~cond; {11804#false} is VALID [2022-04-28 12:29:02,150 INFO L272 TraceCheckUtils]: 38: Hoare triple {11804#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)); {11804#false} is VALID [2022-04-28 12:29:02,150 INFO L290 TraceCheckUtils]: 37: Hoare triple {11804#false} assume !(#t~post6 < 10);havoc #t~post6; {11804#false} is VALID [2022-04-28 12:29:02,150 INFO L290 TraceCheckUtils]: 36: Hoare triple {11804#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11804#false} is VALID [2022-04-28 12:29:02,150 INFO L290 TraceCheckUtils]: 35: Hoare triple {11804#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; {11804#false} is VALID [2022-04-28 12:29:02,150 INFO L290 TraceCheckUtils]: 34: Hoare triple {11804#false} assume !(#t~post7 < 10);havoc #t~post7; {11804#false} is VALID [2022-04-28 12:29:02,150 INFO L290 TraceCheckUtils]: 33: Hoare triple {11804#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11804#false} is VALID [2022-04-28 12:29:02,150 INFO L290 TraceCheckUtils]: 32: Hoare triple {11804#false} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {11804#false} is VALID [2022-04-28 12:29:02,153 INFO L290 TraceCheckUtils]: 31: Hoare triple {11967#(< |main_#t~post8| 10)} assume !(#t~post8 < 10);havoc #t~post8; {11804#false} is VALID [2022-04-28 12:29:02,153 INFO L290 TraceCheckUtils]: 30: Hoare triple {11971#(< ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {11967#(< |main_#t~post8| 10)} is VALID [2022-04-28 12:29:02,153 INFO L290 TraceCheckUtils]: 29: Hoare triple {11971#(< ~counter~0 10)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {11971#(< ~counter~0 10)} is VALID [2022-04-28 12:29:02,154 INFO L290 TraceCheckUtils]: 28: Hoare triple {11971#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {11971#(< ~counter~0 10)} is VALID [2022-04-28 12:29:02,154 INFO L290 TraceCheckUtils]: 27: Hoare triple {11981#(< ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11971#(< ~counter~0 10)} is VALID [2022-04-28 12:29:02,155 INFO L290 TraceCheckUtils]: 26: Hoare triple {11981#(< ~counter~0 9)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {11981#(< ~counter~0 9)} is VALID [2022-04-28 12:29:02,155 INFO L290 TraceCheckUtils]: 25: Hoare triple {11981#(< ~counter~0 9)} assume !!(#t~post6 < 10);havoc #t~post6; {11981#(< ~counter~0 9)} is VALID [2022-04-28 12:29:02,155 INFO L290 TraceCheckUtils]: 24: Hoare triple {11991#(< ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11981#(< ~counter~0 9)} is VALID [2022-04-28 12:29:02,156 INFO L290 TraceCheckUtils]: 23: Hoare triple {11991#(< ~counter~0 8)} ~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; {11991#(< ~counter~0 8)} is VALID [2022-04-28 12:29:02,156 INFO L290 TraceCheckUtils]: 22: Hoare triple {11991#(< ~counter~0 8)} assume !(~c~0 >= ~b~0); {11991#(< ~counter~0 8)} is VALID [2022-04-28 12:29:02,156 INFO L290 TraceCheckUtils]: 21: Hoare triple {11991#(< ~counter~0 8)} assume !!(#t~post7 < 10);havoc #t~post7; {11991#(< ~counter~0 8)} is VALID [2022-04-28 12:29:02,157 INFO L290 TraceCheckUtils]: 20: Hoare triple {12004#(< ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11991#(< ~counter~0 8)} is VALID [2022-04-28 12:29:02,157 INFO L290 TraceCheckUtils]: 19: Hoare triple {12004#(< ~counter~0 7)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {12004#(< ~counter~0 7)} is VALID [2022-04-28 12:29:02,157 INFO L290 TraceCheckUtils]: 18: Hoare triple {12004#(< ~counter~0 7)} assume !!(#t~post6 < 10);havoc #t~post6; {12004#(< ~counter~0 7)} is VALID [2022-04-28 12:29:02,158 INFO L290 TraceCheckUtils]: 17: Hoare triple {12014#(< ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12004#(< ~counter~0 7)} is VALID [2022-04-28 12:29:02,158 INFO L290 TraceCheckUtils]: 16: Hoare triple {12014#(< ~counter~0 6)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {12014#(< ~counter~0 6)} is VALID [2022-04-28 12:29:02,159 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11803#true} {12014#(< ~counter~0 6)} #96#return; {12014#(< ~counter~0 6)} is VALID [2022-04-28 12:29:02,159 INFO L290 TraceCheckUtils]: 14: Hoare triple {11803#true} assume true; {11803#true} is VALID [2022-04-28 12:29:02,159 INFO L290 TraceCheckUtils]: 13: Hoare triple {11803#true} assume !(0 == ~cond); {11803#true} is VALID [2022-04-28 12:29:02,159 INFO L290 TraceCheckUtils]: 12: Hoare triple {11803#true} ~cond := #in~cond; {11803#true} is VALID [2022-04-28 12:29:02,159 INFO L272 TraceCheckUtils]: 11: Hoare triple {12014#(< ~counter~0 6)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11803#true} is VALID [2022-04-28 12:29:02,159 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11803#true} {12014#(< ~counter~0 6)} #94#return; {12014#(< ~counter~0 6)} is VALID [2022-04-28 12:29:02,159 INFO L290 TraceCheckUtils]: 9: Hoare triple {11803#true} assume true; {11803#true} is VALID [2022-04-28 12:29:02,159 INFO L290 TraceCheckUtils]: 8: Hoare triple {11803#true} assume !(0 == ~cond); {11803#true} is VALID [2022-04-28 12:29:02,160 INFO L290 TraceCheckUtils]: 7: Hoare triple {11803#true} ~cond := #in~cond; {11803#true} is VALID [2022-04-28 12:29:02,160 INFO L272 TraceCheckUtils]: 6: Hoare triple {12014#(< ~counter~0 6)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {11803#true} is VALID [2022-04-28 12:29:02,164 INFO L290 TraceCheckUtils]: 5: Hoare triple {12014#(< ~counter~0 6)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {12014#(< ~counter~0 6)} is VALID [2022-04-28 12:29:02,165 INFO L272 TraceCheckUtils]: 4: Hoare triple {12014#(< ~counter~0 6)} call #t~ret9 := main(); {12014#(< ~counter~0 6)} is VALID [2022-04-28 12:29:02,165 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12014#(< ~counter~0 6)} {11803#true} #108#return; {12014#(< ~counter~0 6)} is VALID [2022-04-28 12:29:02,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {12014#(< ~counter~0 6)} assume true; {12014#(< ~counter~0 6)} is VALID [2022-04-28 12:29:02,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {11803#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);~counter~0 := 0; {12014#(< ~counter~0 6)} is VALID [2022-04-28 12:29:02,166 INFO L272 TraceCheckUtils]: 0: Hoare triple {11803#true} call ULTIMATE.init(); {11803#true} is VALID [2022-04-28 12:29:02,166 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 12:29:02,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:29:02,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556499964] [2022-04-28 12:29:02,166 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:29:02,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906542275] [2022-04-28 12:29:02,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906542275] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:29:02,167 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:29:02,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-28 12:29:02,168 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:29:02,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [504569140] [2022-04-28 12:29:02,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [504569140] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:29:02,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:29:02,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 12:29:02,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269332181] [2022-04-28 12:29:02,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:29:02,169 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 42 [2022-04-28 12:29:02,169 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:29:02,169 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), 7 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:29:02,194 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:02,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 12:29:02,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:29:02,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 12:29:02,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 12:29:02,194 INFO L87 Difference]: Start difference. First operand 228 states and 318 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:29:02,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:02,915 INFO L93 Difference]: Finished difference Result 429 states and 607 transitions. [2022-04-28 12:29:02,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 12:29:02,915 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 42 [2022-04-28 12:29:02,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:29:02,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:29:02,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 132 transitions. [2022-04-28 12:29:02,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:29:02,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 132 transitions. [2022-04-28 12:29:02,919 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 132 transitions. [2022-04-28 12:29:03,030 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:03,037 INFO L225 Difference]: With dead ends: 429 [2022-04-28 12:29:03,037 INFO L226 Difference]: Without dead ends: 264 [2022-04-28 12:29:03,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2022-04-28 12:29:03,039 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 52 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:29:03,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 201 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:29:03,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-04-28 12:29:03,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 258. [2022-04-28 12:29:03,606 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:29:03,607 INFO L82 GeneralOperation]: Start isEquivalent. First operand 264 states. Second operand has 258 states, 183 states have (on average 1.3060109289617485) internal successors, (239), 189 states have internal predecessors, (239), 57 states have call successors, (57), 18 states have call predecessors, (57), 17 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-28 12:29:03,607 INFO L74 IsIncluded]: Start isIncluded. First operand 264 states. Second operand has 258 states, 183 states have (on average 1.3060109289617485) internal successors, (239), 189 states have internal predecessors, (239), 57 states have call successors, (57), 18 states have call predecessors, (57), 17 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-28 12:29:03,608 INFO L87 Difference]: Start difference. First operand 264 states. Second operand has 258 states, 183 states have (on average 1.3060109289617485) internal successors, (239), 189 states have internal predecessors, (239), 57 states have call successors, (57), 18 states have call predecessors, (57), 17 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-28 12:29:03,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:03,615 INFO L93 Difference]: Finished difference Result 264 states and 356 transitions. [2022-04-28 12:29:03,615 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 356 transitions. [2022-04-28 12:29:03,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:29:03,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:29:03,616 INFO L74 IsIncluded]: Start isIncluded. First operand has 258 states, 183 states have (on average 1.3060109289617485) internal successors, (239), 189 states have internal predecessors, (239), 57 states have call successors, (57), 18 states have call predecessors, (57), 17 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) Second operand 264 states. [2022-04-28 12:29:03,617 INFO L87 Difference]: Start difference. First operand has 258 states, 183 states have (on average 1.3060109289617485) internal successors, (239), 189 states have internal predecessors, (239), 57 states have call successors, (57), 18 states have call predecessors, (57), 17 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) Second operand 264 states. [2022-04-28 12:29:03,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:03,624 INFO L93 Difference]: Finished difference Result 264 states and 356 transitions. [2022-04-28 12:29:03,624 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 356 transitions. [2022-04-28 12:29:03,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:29:03,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:29:03,625 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:29:03,625 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:29:03,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 183 states have (on average 1.3060109289617485) internal successors, (239), 189 states have internal predecessors, (239), 57 states have call successors, (57), 18 states have call predecessors, (57), 17 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-28 12:29:03,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 351 transitions. [2022-04-28 12:29:03,633 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 351 transitions. Word has length 42 [2022-04-28 12:29:03,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:29:03,634 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 351 transitions. [2022-04-28 12:29:03,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:29:03,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 258 states and 351 transitions. [2022-04-28 12:29:04,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 351 edges. 351 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:04,077 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 351 transitions. [2022-04-28 12:29:04,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-28 12:29:04,077 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:29:04,077 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:29:04,093 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 12:29:04,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-28 12:29:04,278 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:29:04,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:29:04,278 INFO L85 PathProgramCache]: Analyzing trace with hash 744709461, now seen corresponding path program 1 times [2022-04-28 12:29:04,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:29:04,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [919508271] [2022-04-28 12:29:04,279 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:29:04,279 INFO L85 PathProgramCache]: Analyzing trace with hash 744709461, now seen corresponding path program 2 times [2022-04-28 12:29:04,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:29:04,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764971045] [2022-04-28 12:29:04,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:29:04,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:29:04,290 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:29:04,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1040870093] [2022-04-28 12:29:04,290 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:29:04,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:29:04,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:29:04,291 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:29:04,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-28 12:29:04,344 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:29:04,344 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:29:04,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 12:29:04,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:29:04,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:29:07,138 INFO L272 TraceCheckUtils]: 0: Hoare triple {13974#true} call ULTIMATE.init(); {13974#true} is VALID [2022-04-28 12:29:07,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {13974#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);~counter~0 := 0; {13974#true} is VALID [2022-04-28 12:29:07,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {13974#true} assume true; {13974#true} is VALID [2022-04-28 12:29:07,139 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13974#true} {13974#true} #108#return; {13974#true} is VALID [2022-04-28 12:29:07,139 INFO L272 TraceCheckUtils]: 4: Hoare triple {13974#true} call #t~ret9 := main(); {13974#true} is VALID [2022-04-28 12:29:07,139 INFO L290 TraceCheckUtils]: 5: Hoare triple {13974#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {13974#true} is VALID [2022-04-28 12:29:07,139 INFO L272 TraceCheckUtils]: 6: Hoare triple {13974#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {13974#true} is VALID [2022-04-28 12:29:07,139 INFO L290 TraceCheckUtils]: 7: Hoare triple {13974#true} ~cond := #in~cond; {13974#true} is VALID [2022-04-28 12:29:07,140 INFO L290 TraceCheckUtils]: 8: Hoare triple {13974#true} assume !(0 == ~cond); {13974#true} is VALID [2022-04-28 12:29:07,140 INFO L290 TraceCheckUtils]: 9: Hoare triple {13974#true} assume true; {13974#true} is VALID [2022-04-28 12:29:07,140 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13974#true} {13974#true} #94#return; {13974#true} is VALID [2022-04-28 12:29:07,140 INFO L272 TraceCheckUtils]: 11: Hoare triple {13974#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {13974#true} is VALID [2022-04-28 12:29:07,140 INFO L290 TraceCheckUtils]: 12: Hoare triple {13974#true} ~cond := #in~cond; {13974#true} is VALID [2022-04-28 12:29:07,140 INFO L290 TraceCheckUtils]: 13: Hoare triple {13974#true} assume !(0 == ~cond); {13974#true} is VALID [2022-04-28 12:29:07,140 INFO L290 TraceCheckUtils]: 14: Hoare triple {13974#true} assume true; {13974#true} is VALID [2022-04-28 12:29:07,141 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13974#true} {13974#true} #96#return; {13974#true} is VALID [2022-04-28 12:29:07,141 INFO L290 TraceCheckUtils]: 16: Hoare triple {13974#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {13974#true} is VALID [2022-04-28 12:29:07,141 INFO L290 TraceCheckUtils]: 17: Hoare triple {13974#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13974#true} is VALID [2022-04-28 12:29:07,141 INFO L290 TraceCheckUtils]: 18: Hoare triple {13974#true} assume !!(#t~post6 < 10);havoc #t~post6; {13974#true} is VALID [2022-04-28 12:29:07,141 INFO L290 TraceCheckUtils]: 19: Hoare triple {13974#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {13974#true} is VALID [2022-04-28 12:29:07,141 INFO L290 TraceCheckUtils]: 20: Hoare triple {13974#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13974#true} is VALID [2022-04-28 12:29:07,141 INFO L290 TraceCheckUtils]: 21: Hoare triple {13974#true} assume !!(#t~post7 < 10);havoc #t~post7; {13974#true} is VALID [2022-04-28 12:29:07,141 INFO L290 TraceCheckUtils]: 22: Hoare triple {13974#true} assume !(~c~0 >= ~b~0); {13974#true} is VALID [2022-04-28 12:29:07,141 INFO L290 TraceCheckUtils]: 23: Hoare triple {13974#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; {13974#true} is VALID [2022-04-28 12:29:07,142 INFO L290 TraceCheckUtils]: 24: Hoare triple {13974#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13974#true} is VALID [2022-04-28 12:29:07,142 INFO L290 TraceCheckUtils]: 25: Hoare triple {13974#true} assume !!(#t~post6 < 10);havoc #t~post6; {13974#true} is VALID [2022-04-28 12:29:07,142 INFO L290 TraceCheckUtils]: 26: Hoare triple {13974#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {14057#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 12:29:07,143 INFO L290 TraceCheckUtils]: 27: Hoare triple {14057#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14057#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 12:29:07,143 INFO L290 TraceCheckUtils]: 28: Hoare triple {14057#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} assume !!(#t~post7 < 10);havoc #t~post7; {14057#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 12:29:07,144 INFO L290 TraceCheckUtils]: 29: Hoare triple {14057#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {14057#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 12:29:07,144 INFO L290 TraceCheckUtils]: 30: Hoare triple {14057#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14057#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 12:29:07,145 INFO L290 TraceCheckUtils]: 31: Hoare triple {14057#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} assume !!(#t~post8 < 10);havoc #t~post8; {14057#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 12:29:07,145 INFO L272 TraceCheckUtils]: 32: Hoare triple {14057#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {13974#true} is VALID [2022-04-28 12:29:07,145 INFO L290 TraceCheckUtils]: 33: Hoare triple {13974#true} ~cond := #in~cond; {13974#true} is VALID [2022-04-28 12:29:07,145 INFO L290 TraceCheckUtils]: 34: Hoare triple {13974#true} assume !(0 == ~cond); {13974#true} is VALID [2022-04-28 12:29:07,145 INFO L290 TraceCheckUtils]: 35: Hoare triple {13974#true} assume true; {13974#true} is VALID [2022-04-28 12:29:07,146 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {13974#true} {14057#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #98#return; {14057#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 12:29:07,146 INFO L272 TraceCheckUtils]: 37: Hoare triple {14057#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {13974#true} is VALID [2022-04-28 12:29:07,146 INFO L290 TraceCheckUtils]: 38: Hoare triple {13974#true} ~cond := #in~cond; {13974#true} is VALID [2022-04-28 12:29:07,146 INFO L290 TraceCheckUtils]: 39: Hoare triple {13974#true} assume !(0 == ~cond); {13974#true} is VALID [2022-04-28 12:29:07,146 INFO L290 TraceCheckUtils]: 40: Hoare triple {13974#true} assume true; {13974#true} is VALID [2022-04-28 12:29:07,147 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {13974#true} {14057#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #100#return; {14057#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 12:29:07,148 INFO L272 TraceCheckUtils]: 42: Hoare triple {14057#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {14106#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:29:07,148 INFO L290 TraceCheckUtils]: 43: Hoare triple {14106#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14110#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:29:07,149 INFO L290 TraceCheckUtils]: 44: Hoare triple {14110#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13975#false} is VALID [2022-04-28 12:29:07,149 INFO L290 TraceCheckUtils]: 45: Hoare triple {13975#false} assume !false; {13975#false} is VALID [2022-04-28 12:29:07,149 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 12:29:07,149 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:29:07,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:29:07,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764971045] [2022-04-28 12:29:07,150 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:29:07,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040870093] [2022-04-28 12:29:07,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040870093] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:29:07,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:29:07,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:29:07,150 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:29:07,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [919508271] [2022-04-28 12:29:07,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [919508271] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:29:07,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:29:07,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:29:07,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647623136] [2022-04-28 12:29:07,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:29:07,151 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 46 [2022-04-28 12:29:07,151 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:29:07,152 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), 4 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 12:29:07,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:07,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 12:29:07,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:29:07,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 12:29:07,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 12:29:07,181 INFO L87 Difference]: Start difference. First operand 258 states and 351 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 12:29:08,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:08,033 INFO L93 Difference]: Finished difference Result 332 states and 473 transitions. [2022-04-28 12:29:08,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 12:29:08,033 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 46 [2022-04-28 12:29:08,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:29:08,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 12:29:08,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 12:29:08,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 12:29:08,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 12:29:08,036 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-28 12:29:08,095 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:08,104 INFO L225 Difference]: With dead ends: 332 [2022-04-28 12:29:08,104 INFO L226 Difference]: Without dead ends: 330 [2022-04-28 12:29:08,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 12:29:08,105 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 10 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:29:08,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 153 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:29:08,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2022-04-28 12:29:08,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 321. [2022-04-28 12:29:08,893 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:29:08,893 INFO L82 GeneralOperation]: Start isEquivalent. First operand 330 states. Second operand has 321 states, 213 states have (on average 1.3427230046948357) internal successors, (286), 223 states have internal predecessors, (286), 89 states have call successors, (89), 19 states have call predecessors, (89), 18 states have return successors, (87), 78 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-28 12:29:08,894 INFO L74 IsIncluded]: Start isIncluded. First operand 330 states. Second operand has 321 states, 213 states have (on average 1.3427230046948357) internal successors, (286), 223 states have internal predecessors, (286), 89 states have call successors, (89), 19 states have call predecessors, (89), 18 states have return successors, (87), 78 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-28 12:29:08,894 INFO L87 Difference]: Start difference. First operand 330 states. Second operand has 321 states, 213 states have (on average 1.3427230046948357) internal successors, (286), 223 states have internal predecessors, (286), 89 states have call successors, (89), 19 states have call predecessors, (89), 18 states have return successors, (87), 78 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-28 12:29:08,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:08,905 INFO L93 Difference]: Finished difference Result 330 states and 471 transitions. [2022-04-28 12:29:08,905 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 471 transitions. [2022-04-28 12:29:08,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:29:08,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:29:08,907 INFO L74 IsIncluded]: Start isIncluded. First operand has 321 states, 213 states have (on average 1.3427230046948357) internal successors, (286), 223 states have internal predecessors, (286), 89 states have call successors, (89), 19 states have call predecessors, (89), 18 states have return successors, (87), 78 states have call predecessors, (87), 87 states have call successors, (87) Second operand 330 states. [2022-04-28 12:29:08,907 INFO L87 Difference]: Start difference. First operand has 321 states, 213 states have (on average 1.3427230046948357) internal successors, (286), 223 states have internal predecessors, (286), 89 states have call successors, (89), 19 states have call predecessors, (89), 18 states have return successors, (87), 78 states have call predecessors, (87), 87 states have call successors, (87) Second operand 330 states. [2022-04-28 12:29:08,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:08,918 INFO L93 Difference]: Finished difference Result 330 states and 471 transitions. [2022-04-28 12:29:08,918 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 471 transitions. [2022-04-28 12:29:08,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:29:08,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:29:08,919 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:29:08,920 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:29:08,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 213 states have (on average 1.3427230046948357) internal successors, (286), 223 states have internal predecessors, (286), 89 states have call successors, (89), 19 states have call predecessors, (89), 18 states have return successors, (87), 78 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-28 12:29:08,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 462 transitions. [2022-04-28 12:29:08,931 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 462 transitions. Word has length 46 [2022-04-28 12:29:08,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:29:08,932 INFO L495 AbstractCegarLoop]: Abstraction has 321 states and 462 transitions. [2022-04-28 12:29:08,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 12:29:08,932 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 321 states and 462 transitions. [2022-04-28 12:29:09,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 462 edges. 462 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:09,444 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 462 transitions. [2022-04-28 12:29:09,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-28 12:29:09,444 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:29:09,444 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 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, 1, 1, 1, 1, 1] [2022-04-28 12:29:09,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-28 12:29:09,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:29:09,645 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:29:09,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:29:09,645 INFO L85 PathProgramCache]: Analyzing trace with hash -522797827, now seen corresponding path program 1 times [2022-04-28 12:29:09,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:29:09,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1302672044] [2022-04-28 12:29:09,646 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:29:09,646 INFO L85 PathProgramCache]: Analyzing trace with hash -522797827, now seen corresponding path program 2 times [2022-04-28 12:29:09,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:29:09,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303202005] [2022-04-28 12:29:09,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:29:09,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:29:09,662 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:29:09,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [311160138] [2022-04-28 12:29:09,663 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:29:09,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:29:09,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:29:09,665 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:29:09,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-28 12:29:09,707 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:29:09,707 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:29:09,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 12:29:09,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:29:09,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:29:09,969 INFO L272 TraceCheckUtils]: 0: Hoare triple {16084#true} call ULTIMATE.init(); {16084#true} is VALID [2022-04-28 12:29:09,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {16084#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);~counter~0 := 0; {16092#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:09,970 INFO L290 TraceCheckUtils]: 2: Hoare triple {16092#(<= ~counter~0 0)} assume true; {16092#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:09,970 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16092#(<= ~counter~0 0)} {16084#true} #108#return; {16092#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:09,970 INFO L272 TraceCheckUtils]: 4: Hoare triple {16092#(<= ~counter~0 0)} call #t~ret9 := main(); {16092#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:09,971 INFO L290 TraceCheckUtils]: 5: Hoare triple {16092#(<= ~counter~0 0)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {16092#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:09,971 INFO L272 TraceCheckUtils]: 6: Hoare triple {16092#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {16092#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:09,971 INFO L290 TraceCheckUtils]: 7: Hoare triple {16092#(<= ~counter~0 0)} ~cond := #in~cond; {16092#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:09,972 INFO L290 TraceCheckUtils]: 8: Hoare triple {16092#(<= ~counter~0 0)} assume !(0 == ~cond); {16092#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:09,972 INFO L290 TraceCheckUtils]: 9: Hoare triple {16092#(<= ~counter~0 0)} assume true; {16092#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:09,972 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16092#(<= ~counter~0 0)} {16092#(<= ~counter~0 0)} #94#return; {16092#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:09,973 INFO L272 TraceCheckUtils]: 11: Hoare triple {16092#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {16092#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:09,973 INFO L290 TraceCheckUtils]: 12: Hoare triple {16092#(<= ~counter~0 0)} ~cond := #in~cond; {16092#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:09,973 INFO L290 TraceCheckUtils]: 13: Hoare triple {16092#(<= ~counter~0 0)} assume !(0 == ~cond); {16092#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:09,974 INFO L290 TraceCheckUtils]: 14: Hoare triple {16092#(<= ~counter~0 0)} assume true; {16092#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:09,974 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {16092#(<= ~counter~0 0)} {16092#(<= ~counter~0 0)} #96#return; {16092#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:09,974 INFO L290 TraceCheckUtils]: 16: Hoare triple {16092#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {16092#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:09,975 INFO L290 TraceCheckUtils]: 17: Hoare triple {16092#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16141#(<= ~counter~0 1)} is VALID [2022-04-28 12:29:09,975 INFO L290 TraceCheckUtils]: 18: Hoare triple {16141#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {16141#(<= ~counter~0 1)} is VALID [2022-04-28 12:29:09,976 INFO L290 TraceCheckUtils]: 19: Hoare triple {16141#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {16141#(<= ~counter~0 1)} is VALID [2022-04-28 12:29:09,976 INFO L290 TraceCheckUtils]: 20: Hoare triple {16141#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16151#(<= ~counter~0 2)} is VALID [2022-04-28 12:29:09,976 INFO L290 TraceCheckUtils]: 21: Hoare triple {16151#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {16151#(<= ~counter~0 2)} is VALID [2022-04-28 12:29:09,977 INFO L290 TraceCheckUtils]: 22: Hoare triple {16151#(<= ~counter~0 2)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {16151#(<= ~counter~0 2)} is VALID [2022-04-28 12:29:09,977 INFO L290 TraceCheckUtils]: 23: Hoare triple {16151#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {16161#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:09,977 INFO L290 TraceCheckUtils]: 24: Hoare triple {16161#(<= ~counter~0 3)} assume !!(#t~post8 < 10);havoc #t~post8; {16161#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:09,978 INFO L272 TraceCheckUtils]: 25: Hoare triple {16161#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16161#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:09,978 INFO L290 TraceCheckUtils]: 26: Hoare triple {16161#(<= ~counter~0 3)} ~cond := #in~cond; {16161#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:09,978 INFO L290 TraceCheckUtils]: 27: Hoare triple {16161#(<= ~counter~0 3)} assume !(0 == ~cond); {16161#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:09,979 INFO L290 TraceCheckUtils]: 28: Hoare triple {16161#(<= ~counter~0 3)} assume true; {16161#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:09,979 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {16161#(<= ~counter~0 3)} {16161#(<= ~counter~0 3)} #98#return; {16161#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:09,980 INFO L272 TraceCheckUtils]: 30: Hoare triple {16161#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16161#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:09,980 INFO L290 TraceCheckUtils]: 31: Hoare triple {16161#(<= ~counter~0 3)} ~cond := #in~cond; {16161#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:09,980 INFO L290 TraceCheckUtils]: 32: Hoare triple {16161#(<= ~counter~0 3)} assume !(0 == ~cond); {16161#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:09,981 INFO L290 TraceCheckUtils]: 33: Hoare triple {16161#(<= ~counter~0 3)} assume true; {16161#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:09,981 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {16161#(<= ~counter~0 3)} {16161#(<= ~counter~0 3)} #100#return; {16161#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:09,982 INFO L272 TraceCheckUtils]: 35: Hoare triple {16161#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16161#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:09,982 INFO L290 TraceCheckUtils]: 36: Hoare triple {16161#(<= ~counter~0 3)} ~cond := #in~cond; {16161#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:09,982 INFO L290 TraceCheckUtils]: 37: Hoare triple {16161#(<= ~counter~0 3)} assume !(0 == ~cond); {16161#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:09,983 INFO L290 TraceCheckUtils]: 38: Hoare triple {16161#(<= ~counter~0 3)} assume true; {16161#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:09,983 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {16161#(<= ~counter~0 3)} {16161#(<= ~counter~0 3)} #102#return; {16161#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:09,984 INFO L272 TraceCheckUtils]: 40: Hoare triple {16161#(<= ~counter~0 3)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {16161#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:09,984 INFO L290 TraceCheckUtils]: 41: Hoare triple {16161#(<= ~counter~0 3)} ~cond := #in~cond; {16161#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:09,984 INFO L290 TraceCheckUtils]: 42: Hoare triple {16161#(<= ~counter~0 3)} assume !(0 == ~cond); {16161#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:09,985 INFO L290 TraceCheckUtils]: 43: Hoare triple {16161#(<= ~counter~0 3)} assume true; {16161#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:09,985 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {16161#(<= ~counter~0 3)} {16161#(<= ~counter~0 3)} #104#return; {16161#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:09,985 INFO L290 TraceCheckUtils]: 45: Hoare triple {16161#(<= ~counter~0 3)} assume !(~c~0 >= 2 * ~v~0); {16161#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:09,986 INFO L290 TraceCheckUtils]: 46: Hoare triple {16161#(<= ~counter~0 3)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {16161#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:09,986 INFO L290 TraceCheckUtils]: 47: Hoare triple {16161#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16234#(<= ~counter~0 4)} is VALID [2022-04-28 12:29:09,986 INFO L290 TraceCheckUtils]: 48: Hoare triple {16234#(<= ~counter~0 4)} assume !!(#t~post7 < 10);havoc #t~post7; {16234#(<= ~counter~0 4)} is VALID [2022-04-28 12:29:09,987 INFO L290 TraceCheckUtils]: 49: Hoare triple {16234#(<= ~counter~0 4)} assume !(~c~0 >= ~b~0); {16234#(<= ~counter~0 4)} is VALID [2022-04-28 12:29:09,987 INFO L290 TraceCheckUtils]: 50: Hoare triple {16234#(<= ~counter~0 4)} ~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; {16234#(<= ~counter~0 4)} is VALID [2022-04-28 12:29:09,987 INFO L290 TraceCheckUtils]: 51: Hoare triple {16234#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16247#(<= |main_#t~post6| 4)} is VALID [2022-04-28 12:29:09,988 INFO L290 TraceCheckUtils]: 52: Hoare triple {16247#(<= |main_#t~post6| 4)} assume !(#t~post6 < 10);havoc #t~post6; {16085#false} is VALID [2022-04-28 12:29:09,988 INFO L272 TraceCheckUtils]: 53: Hoare triple {16085#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)); {16085#false} is VALID [2022-04-28 12:29:09,988 INFO L290 TraceCheckUtils]: 54: Hoare triple {16085#false} ~cond := #in~cond; {16085#false} is VALID [2022-04-28 12:29:09,988 INFO L290 TraceCheckUtils]: 55: Hoare triple {16085#false} assume 0 == ~cond; {16085#false} is VALID [2022-04-28 12:29:09,988 INFO L290 TraceCheckUtils]: 56: Hoare triple {16085#false} assume !false; {16085#false} is VALID [2022-04-28 12:29:09,988 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 12:29:09,988 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:29:10,275 INFO L290 TraceCheckUtils]: 56: Hoare triple {16085#false} assume !false; {16085#false} is VALID [2022-04-28 12:29:10,276 INFO L290 TraceCheckUtils]: 55: Hoare triple {16085#false} assume 0 == ~cond; {16085#false} is VALID [2022-04-28 12:29:10,276 INFO L290 TraceCheckUtils]: 54: Hoare triple {16085#false} ~cond := #in~cond; {16085#false} is VALID [2022-04-28 12:29:10,276 INFO L272 TraceCheckUtils]: 53: Hoare triple {16085#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)); {16085#false} is VALID [2022-04-28 12:29:10,276 INFO L290 TraceCheckUtils]: 52: Hoare triple {16275#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {16085#false} is VALID [2022-04-28 12:29:10,276 INFO L290 TraceCheckUtils]: 51: Hoare triple {16279#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16275#(< |main_#t~post6| 10)} is VALID [2022-04-28 12:29:10,277 INFO L290 TraceCheckUtils]: 50: Hoare triple {16279#(< ~counter~0 10)} ~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; {16279#(< ~counter~0 10)} is VALID [2022-04-28 12:29:10,277 INFO L290 TraceCheckUtils]: 49: Hoare triple {16279#(< ~counter~0 10)} assume !(~c~0 >= ~b~0); {16279#(< ~counter~0 10)} is VALID [2022-04-28 12:29:10,277 INFO L290 TraceCheckUtils]: 48: Hoare triple {16279#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {16279#(< ~counter~0 10)} is VALID [2022-04-28 12:29:10,278 INFO L290 TraceCheckUtils]: 47: Hoare triple {16292#(< ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16279#(< ~counter~0 10)} is VALID [2022-04-28 12:29:10,278 INFO L290 TraceCheckUtils]: 46: Hoare triple {16292#(< ~counter~0 9)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {16292#(< ~counter~0 9)} is VALID [2022-04-28 12:29:10,279 INFO L290 TraceCheckUtils]: 45: Hoare triple {16292#(< ~counter~0 9)} assume !(~c~0 >= 2 * ~v~0); {16292#(< ~counter~0 9)} is VALID [2022-04-28 12:29:10,279 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {16084#true} {16292#(< ~counter~0 9)} #104#return; {16292#(< ~counter~0 9)} is VALID [2022-04-28 12:29:10,279 INFO L290 TraceCheckUtils]: 43: Hoare triple {16084#true} assume true; {16084#true} is VALID [2022-04-28 12:29:10,279 INFO L290 TraceCheckUtils]: 42: Hoare triple {16084#true} assume !(0 == ~cond); {16084#true} is VALID [2022-04-28 12:29:10,279 INFO L290 TraceCheckUtils]: 41: Hoare triple {16084#true} ~cond := #in~cond; {16084#true} is VALID [2022-04-28 12:29:10,279 INFO L272 TraceCheckUtils]: 40: Hoare triple {16292#(< ~counter~0 9)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {16084#true} is VALID [2022-04-28 12:29:10,280 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {16084#true} {16292#(< ~counter~0 9)} #102#return; {16292#(< ~counter~0 9)} is VALID [2022-04-28 12:29:10,280 INFO L290 TraceCheckUtils]: 38: Hoare triple {16084#true} assume true; {16084#true} is VALID [2022-04-28 12:29:10,280 INFO L290 TraceCheckUtils]: 37: Hoare triple {16084#true} assume !(0 == ~cond); {16084#true} is VALID [2022-04-28 12:29:10,280 INFO L290 TraceCheckUtils]: 36: Hoare triple {16084#true} ~cond := #in~cond; {16084#true} is VALID [2022-04-28 12:29:10,280 INFO L272 TraceCheckUtils]: 35: Hoare triple {16292#(< ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16084#true} is VALID [2022-04-28 12:29:10,281 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {16084#true} {16292#(< ~counter~0 9)} #100#return; {16292#(< ~counter~0 9)} is VALID [2022-04-28 12:29:10,281 INFO L290 TraceCheckUtils]: 33: Hoare triple {16084#true} assume true; {16084#true} is VALID [2022-04-28 12:29:10,281 INFO L290 TraceCheckUtils]: 32: Hoare triple {16084#true} assume !(0 == ~cond); {16084#true} is VALID [2022-04-28 12:29:10,281 INFO L290 TraceCheckUtils]: 31: Hoare triple {16084#true} ~cond := #in~cond; {16084#true} is VALID [2022-04-28 12:29:10,281 INFO L272 TraceCheckUtils]: 30: Hoare triple {16292#(< ~counter~0 9)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16084#true} is VALID [2022-04-28 12:29:10,282 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {16084#true} {16292#(< ~counter~0 9)} #98#return; {16292#(< ~counter~0 9)} is VALID [2022-04-28 12:29:10,282 INFO L290 TraceCheckUtils]: 28: Hoare triple {16084#true} assume true; {16084#true} is VALID [2022-04-28 12:29:10,282 INFO L290 TraceCheckUtils]: 27: Hoare triple {16084#true} assume !(0 == ~cond); {16084#true} is VALID [2022-04-28 12:29:10,282 INFO L290 TraceCheckUtils]: 26: Hoare triple {16084#true} ~cond := #in~cond; {16084#true} is VALID [2022-04-28 12:29:10,282 INFO L272 TraceCheckUtils]: 25: Hoare triple {16292#(< ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16084#true} is VALID [2022-04-28 12:29:10,299 INFO L290 TraceCheckUtils]: 24: Hoare triple {16292#(< ~counter~0 9)} assume !!(#t~post8 < 10);havoc #t~post8; {16292#(< ~counter~0 9)} is VALID [2022-04-28 12:29:10,300 INFO L290 TraceCheckUtils]: 23: Hoare triple {16365#(< ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {16292#(< ~counter~0 9)} is VALID [2022-04-28 12:29:10,301 INFO L290 TraceCheckUtils]: 22: Hoare triple {16365#(< ~counter~0 8)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {16365#(< ~counter~0 8)} is VALID [2022-04-28 12:29:10,301 INFO L290 TraceCheckUtils]: 21: Hoare triple {16365#(< ~counter~0 8)} assume !!(#t~post7 < 10);havoc #t~post7; {16365#(< ~counter~0 8)} is VALID [2022-04-28 12:29:10,302 INFO L290 TraceCheckUtils]: 20: Hoare triple {16375#(< ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16365#(< ~counter~0 8)} is VALID [2022-04-28 12:29:10,302 INFO L290 TraceCheckUtils]: 19: Hoare triple {16375#(< ~counter~0 7)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {16375#(< ~counter~0 7)} is VALID [2022-04-28 12:29:10,303 INFO L290 TraceCheckUtils]: 18: Hoare triple {16375#(< ~counter~0 7)} assume !!(#t~post6 < 10);havoc #t~post6; {16375#(< ~counter~0 7)} is VALID [2022-04-28 12:29:10,304 INFO L290 TraceCheckUtils]: 17: Hoare triple {16385#(< ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16375#(< ~counter~0 7)} is VALID [2022-04-28 12:29:10,304 INFO L290 TraceCheckUtils]: 16: Hoare triple {16385#(< ~counter~0 6)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {16385#(< ~counter~0 6)} is VALID [2022-04-28 12:29:10,305 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {16084#true} {16385#(< ~counter~0 6)} #96#return; {16385#(< ~counter~0 6)} is VALID [2022-04-28 12:29:10,305 INFO L290 TraceCheckUtils]: 14: Hoare triple {16084#true} assume true; {16084#true} is VALID [2022-04-28 12:29:10,305 INFO L290 TraceCheckUtils]: 13: Hoare triple {16084#true} assume !(0 == ~cond); {16084#true} is VALID [2022-04-28 12:29:10,305 INFO L290 TraceCheckUtils]: 12: Hoare triple {16084#true} ~cond := #in~cond; {16084#true} is VALID [2022-04-28 12:29:10,306 INFO L272 TraceCheckUtils]: 11: Hoare triple {16385#(< ~counter~0 6)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {16084#true} is VALID [2022-04-28 12:29:10,306 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16084#true} {16385#(< ~counter~0 6)} #94#return; {16385#(< ~counter~0 6)} is VALID [2022-04-28 12:29:10,306 INFO L290 TraceCheckUtils]: 9: Hoare triple {16084#true} assume true; {16084#true} is VALID [2022-04-28 12:29:10,307 INFO L290 TraceCheckUtils]: 8: Hoare triple {16084#true} assume !(0 == ~cond); {16084#true} is VALID [2022-04-28 12:29:10,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {16084#true} ~cond := #in~cond; {16084#true} is VALID [2022-04-28 12:29:10,307 INFO L272 TraceCheckUtils]: 6: Hoare triple {16385#(< ~counter~0 6)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {16084#true} is VALID [2022-04-28 12:29:10,307 INFO L290 TraceCheckUtils]: 5: Hoare triple {16385#(< ~counter~0 6)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {16385#(< ~counter~0 6)} is VALID [2022-04-28 12:29:10,308 INFO L272 TraceCheckUtils]: 4: Hoare triple {16385#(< ~counter~0 6)} call #t~ret9 := main(); {16385#(< ~counter~0 6)} is VALID [2022-04-28 12:29:10,308 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16385#(< ~counter~0 6)} {16084#true} #108#return; {16385#(< ~counter~0 6)} is VALID [2022-04-28 12:29:10,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {16385#(< ~counter~0 6)} assume true; {16385#(< ~counter~0 6)} is VALID [2022-04-28 12:29:10,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {16084#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);~counter~0 := 0; {16385#(< ~counter~0 6)} is VALID [2022-04-28 12:29:10,310 INFO L272 TraceCheckUtils]: 0: Hoare triple {16084#true} call ULTIMATE.init(); {16084#true} is VALID [2022-04-28 12:29:10,310 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 12:29:10,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:29:10,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303202005] [2022-04-28 12:29:10,310 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:29:10,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311160138] [2022-04-28 12:29:10,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [311160138] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:29:10,311 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:29:10,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-28 12:29:10,311 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:29:10,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1302672044] [2022-04-28 12:29:10,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1302672044] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:29:10,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:29:10,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 12:29:10,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089843796] [2022-04-28 12:29:10,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:29:10,312 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 57 [2022-04-28 12:29:10,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:29:10,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 12:29:10,347 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:10,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 12:29:10,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:29:10,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 12:29:10,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 12:29:10,348 INFO L87 Difference]: Start difference. First operand 321 states and 462 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 12:29:11,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:11,237 INFO L93 Difference]: Finished difference Result 335 states and 475 transitions. [2022-04-28 12:29:11,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 12:29:11,238 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 57 [2022-04-28 12:29:11,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:29:11,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 12:29:11,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2022-04-28 12:29:11,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 12:29:11,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2022-04-28 12:29:11,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 106 transitions. [2022-04-28 12:29:11,320 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:11,340 INFO L225 Difference]: With dead ends: 335 [2022-04-28 12:29:11,340 INFO L226 Difference]: Without dead ends: 328 [2022-04-28 12:29:11,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-28 12:29:11,342 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 46 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 12:29:11,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 177 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 12:29:11,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2022-04-28 12:29:12,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 324. [2022-04-28 12:29:12,018 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:29:12,019 INFO L82 GeneralOperation]: Start isEquivalent. First operand 328 states. Second operand has 324 states, 216 states have (on average 1.337962962962963) internal successors, (289), 226 states have internal predecessors, (289), 89 states have call successors, (89), 19 states have call predecessors, (89), 18 states have return successors, (87), 78 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-28 12:29:12,019 INFO L74 IsIncluded]: Start isIncluded. First operand 328 states. Second operand has 324 states, 216 states have (on average 1.337962962962963) internal successors, (289), 226 states have internal predecessors, (289), 89 states have call successors, (89), 19 states have call predecessors, (89), 18 states have return successors, (87), 78 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-28 12:29:12,020 INFO L87 Difference]: Start difference. First operand 328 states. Second operand has 324 states, 216 states have (on average 1.337962962962963) internal successors, (289), 226 states have internal predecessors, (289), 89 states have call successors, (89), 19 states have call predecessors, (89), 18 states have return successors, (87), 78 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-28 12:29:12,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:12,030 INFO L93 Difference]: Finished difference Result 328 states and 468 transitions. [2022-04-28 12:29:12,030 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 468 transitions. [2022-04-28 12:29:12,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:29:12,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:29:12,032 INFO L74 IsIncluded]: Start isIncluded. First operand has 324 states, 216 states have (on average 1.337962962962963) internal successors, (289), 226 states have internal predecessors, (289), 89 states have call successors, (89), 19 states have call predecessors, (89), 18 states have return successors, (87), 78 states have call predecessors, (87), 87 states have call successors, (87) Second operand 328 states. [2022-04-28 12:29:12,032 INFO L87 Difference]: Start difference. First operand has 324 states, 216 states have (on average 1.337962962962963) internal successors, (289), 226 states have internal predecessors, (289), 89 states have call successors, (89), 19 states have call predecessors, (89), 18 states have return successors, (87), 78 states have call predecessors, (87), 87 states have call successors, (87) Second operand 328 states. [2022-04-28 12:29:12,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:12,042 INFO L93 Difference]: Finished difference Result 328 states and 468 transitions. [2022-04-28 12:29:12,042 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 468 transitions. [2022-04-28 12:29:12,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:29:12,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:29:12,043 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:29:12,043 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:29:12,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 216 states have (on average 1.337962962962963) internal successors, (289), 226 states have internal predecessors, (289), 89 states have call successors, (89), 19 states have call predecessors, (89), 18 states have return successors, (87), 78 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-28 12:29:12,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 465 transitions. [2022-04-28 12:29:12,056 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 465 transitions. Word has length 57 [2022-04-28 12:29:12,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:29:12,056 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 465 transitions. [2022-04-28 12:29:12,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 12:29:12,057 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 324 states and 465 transitions. [2022-04-28 12:29:12,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 465 edges. 465 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:12,674 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 465 transitions. [2022-04-28 12:29:12,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-28 12:29:12,675 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:29:12,676 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 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, 1, 1, 1, 1] [2022-04-28 12:29:12,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-28 12:29:12,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-28 12:29:12,898 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:29:12,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:29:12,899 INFO L85 PathProgramCache]: Analyzing trace with hash 958119025, now seen corresponding path program 1 times [2022-04-28 12:29:12,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:29:12,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [962718961] [2022-04-28 12:29:12,899 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:29:12,899 INFO L85 PathProgramCache]: Analyzing trace with hash 958119025, now seen corresponding path program 2 times [2022-04-28 12:29:12,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:29:12,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829430282] [2022-04-28 12:29:12,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:29:12,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:29:12,910 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:29:12,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [433443958] [2022-04-28 12:29:12,910 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:29:12,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:29:12,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:29:12,912 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:29:12,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-28 12:29:12,969 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:29:12,969 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:29:12,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-28 12:29:12,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:29:12,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:29:13,714 INFO L272 TraceCheckUtils]: 0: Hoare triple {18417#true} call ULTIMATE.init(); {18417#true} is VALID [2022-04-28 12:29:13,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {18417#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);~counter~0 := 0; {18417#true} is VALID [2022-04-28 12:29:13,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {18417#true} assume true; {18417#true} is VALID [2022-04-28 12:29:13,714 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18417#true} {18417#true} #108#return; {18417#true} is VALID [2022-04-28 12:29:13,714 INFO L272 TraceCheckUtils]: 4: Hoare triple {18417#true} call #t~ret9 := main(); {18417#true} is VALID [2022-04-28 12:29:13,714 INFO L290 TraceCheckUtils]: 5: Hoare triple {18417#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {18417#true} is VALID [2022-04-28 12:29:13,714 INFO L272 TraceCheckUtils]: 6: Hoare triple {18417#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {18417#true} is VALID [2022-04-28 12:29:13,714 INFO L290 TraceCheckUtils]: 7: Hoare triple {18417#true} ~cond := #in~cond; {18417#true} is VALID [2022-04-28 12:29:13,715 INFO L290 TraceCheckUtils]: 8: Hoare triple {18417#true} assume !(0 == ~cond); {18417#true} is VALID [2022-04-28 12:29:13,715 INFO L290 TraceCheckUtils]: 9: Hoare triple {18417#true} assume true; {18417#true} is VALID [2022-04-28 12:29:13,715 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18417#true} {18417#true} #94#return; {18417#true} is VALID [2022-04-28 12:29:13,715 INFO L272 TraceCheckUtils]: 11: Hoare triple {18417#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {18417#true} is VALID [2022-04-28 12:29:13,715 INFO L290 TraceCheckUtils]: 12: Hoare triple {18417#true} ~cond := #in~cond; {18417#true} is VALID [2022-04-28 12:29:13,715 INFO L290 TraceCheckUtils]: 13: Hoare triple {18417#true} assume !(0 == ~cond); {18417#true} is VALID [2022-04-28 12:29:13,715 INFO L290 TraceCheckUtils]: 14: Hoare triple {18417#true} assume true; {18417#true} is VALID [2022-04-28 12:29:13,715 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18417#true} {18417#true} #96#return; {18417#true} is VALID [2022-04-28 12:29:13,716 INFO L290 TraceCheckUtils]: 16: Hoare triple {18417#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {18470#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:29:13,716 INFO L290 TraceCheckUtils]: 17: Hoare triple {18470#(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))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18470#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:29:13,716 INFO L290 TraceCheckUtils]: 18: Hoare triple {18470#(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 !!(#t~post6 < 10);havoc #t~post6; {18470#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:29:13,717 INFO L290 TraceCheckUtils]: 19: Hoare triple {18470#(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; {18480#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:29:13,717 INFO L290 TraceCheckUtils]: 20: Hoare triple {18480#(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))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18480#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:29:13,718 INFO L290 TraceCheckUtils]: 21: Hoare triple {18480#(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 !!(#t~post7 < 10);havoc #t~post7; {18480#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:29:13,718 INFO L290 TraceCheckUtils]: 22: Hoare triple {18480#(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; {18490#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:29:13,719 INFO L290 TraceCheckUtils]: 23: Hoare triple {18490#(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))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18490#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:29:13,719 INFO L290 TraceCheckUtils]: 24: Hoare triple {18490#(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 !!(#t~post8 < 10);havoc #t~post8; {18490#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:29:13,719 INFO L272 TraceCheckUtils]: 25: Hoare triple {18490#(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)); {18417#true} is VALID [2022-04-28 12:29:13,719 INFO L290 TraceCheckUtils]: 26: Hoare triple {18417#true} ~cond := #in~cond; {18503#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:29:13,720 INFO L290 TraceCheckUtils]: 27: Hoare triple {18503#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {18507#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:29:13,720 INFO L290 TraceCheckUtils]: 28: Hoare triple {18507#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18507#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:29:13,721 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {18507#(not (= |__VERIFIER_assert_#in~cond| 0))} {18490#(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))} #98#return; {18514#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:29:13,721 INFO L272 TraceCheckUtils]: 30: Hoare triple {18514#(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)); {18417#true} is VALID [2022-04-28 12:29:13,721 INFO L290 TraceCheckUtils]: 31: Hoare triple {18417#true} ~cond := #in~cond; {18417#true} is VALID [2022-04-28 12:29:13,721 INFO L290 TraceCheckUtils]: 32: Hoare triple {18417#true} assume !(0 == ~cond); {18417#true} is VALID [2022-04-28 12:29:13,721 INFO L290 TraceCheckUtils]: 33: Hoare triple {18417#true} assume true; {18417#true} is VALID [2022-04-28 12:29:13,722 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {18417#true} {18514#(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))} #100#return; {18514#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:29:13,722 INFO L272 TraceCheckUtils]: 35: Hoare triple {18514#(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)); {18417#true} is VALID [2022-04-28 12:29:13,722 INFO L290 TraceCheckUtils]: 36: Hoare triple {18417#true} ~cond := #in~cond; {18417#true} is VALID [2022-04-28 12:29:13,722 INFO L290 TraceCheckUtils]: 37: Hoare triple {18417#true} assume !(0 == ~cond); {18417#true} is VALID [2022-04-28 12:29:13,722 INFO L290 TraceCheckUtils]: 38: Hoare triple {18417#true} assume true; {18417#true} is VALID [2022-04-28 12:29:13,723 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {18417#true} {18514#(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; {18514#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:29:13,723 INFO L272 TraceCheckUtils]: 40: Hoare triple {18514#(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)); {18417#true} is VALID [2022-04-28 12:29:13,723 INFO L290 TraceCheckUtils]: 41: Hoare triple {18417#true} ~cond := #in~cond; {18417#true} is VALID [2022-04-28 12:29:13,724 INFO L290 TraceCheckUtils]: 42: Hoare triple {18417#true} assume !(0 == ~cond); {18417#true} is VALID [2022-04-28 12:29:13,724 INFO L290 TraceCheckUtils]: 43: Hoare triple {18417#true} assume true; {18417#true} is VALID [2022-04-28 12:29:13,724 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {18417#true} {18514#(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; {18514#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:29:13,725 INFO L290 TraceCheckUtils]: 45: Hoare triple {18514#(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); {18514#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:29:13,725 INFO L290 TraceCheckUtils]: 46: Hoare triple {18514#(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; {18566#(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_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 12:29:13,726 INFO L290 TraceCheckUtils]: 47: Hoare triple {18566#(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_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18566#(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_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 12:29:13,726 INFO L290 TraceCheckUtils]: 48: Hoare triple {18566#(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_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !!(#t~post7 < 10);havoc #t~post7; {18566#(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_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 12:29:13,727 INFO L290 TraceCheckUtils]: 49: Hoare triple {18566#(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_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {18566#(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_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 12:29:13,727 INFO L290 TraceCheckUtils]: 50: Hoare triple {18566#(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_~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; {18579#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ main_~s~0 1) 0))} is VALID [2022-04-28 12:29:13,728 INFO L290 TraceCheckUtils]: 51: Hoare triple {18579#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ main_~s~0 1) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18579#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ main_~s~0 1) 0))} is VALID [2022-04-28 12:29:13,728 INFO L290 TraceCheckUtils]: 52: Hoare triple {18579#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ main_~s~0 1) 0))} assume !!(#t~post6 < 10);havoc #t~post6; {18579#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ main_~s~0 1) 0))} is VALID [2022-04-28 12:29:13,729 INFO L290 TraceCheckUtils]: 53: Hoare triple {18579#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ main_~s~0 1) 0))} assume !(0 != ~b~0); {18589#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= main_~r~0 1) (= (+ main_~x~0 (* (- 1) main_~y~0)) 0) (= main_~a~0 main_~y~0) (= (+ main_~s~0 1) 0))} is VALID [2022-04-28 12:29:13,729 INFO L272 TraceCheckUtils]: 54: Hoare triple {18589#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= main_~r~0 1) (= (+ main_~x~0 (* (- 1) main_~y~0)) 0) (= main_~a~0 main_~y~0) (= (+ main_~s~0 1) 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)); {18593#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:29:13,730 INFO L290 TraceCheckUtils]: 55: Hoare triple {18593#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18597#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:29:13,730 INFO L290 TraceCheckUtils]: 56: Hoare triple {18597#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18418#false} is VALID [2022-04-28 12:29:13,730 INFO L290 TraceCheckUtils]: 57: Hoare triple {18418#false} assume !false; {18418#false} is VALID [2022-04-28 12:29:13,730 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-28 12:29:13,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:29:26,764 INFO L290 TraceCheckUtils]: 57: Hoare triple {18418#false} assume !false; {18418#false} is VALID [2022-04-28 12:29:26,764 INFO L290 TraceCheckUtils]: 56: Hoare triple {18597#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18418#false} is VALID [2022-04-28 12:29:26,765 INFO L290 TraceCheckUtils]: 55: Hoare triple {18593#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18597#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:29:26,766 INFO L272 TraceCheckUtils]: 54: Hoare triple {18613#(= (+ (* 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)); {18593#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:29:26,766 INFO L290 TraceCheckUtils]: 53: Hoare triple {18617#(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); {18613#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:29:26,767 INFO L290 TraceCheckUtils]: 52: Hoare triple {18617#(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 !!(#t~post6 < 10);havoc #t~post6; {18617#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-28 12:29:26,767 INFO L290 TraceCheckUtils]: 51: Hoare triple {18617#(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)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18617#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-28 12:29:27,066 INFO L290 TraceCheckUtils]: 50: Hoare triple {18627#(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; {18617#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-28 12:29:27,067 INFO L290 TraceCheckUtils]: 49: Hoare triple {18627#(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); {18627#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:29:27,067 INFO L290 TraceCheckUtils]: 48: Hoare triple {18627#(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 !!(#t~post7 < 10);havoc #t~post7; {18627#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:29:27,068 INFO L290 TraceCheckUtils]: 47: Hoare triple {18627#(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))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18627#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:29:27,115 INFO L290 TraceCheckUtils]: 46: Hoare triple {18640#(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; {18627#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:29:27,115 INFO L290 TraceCheckUtils]: 45: Hoare triple {18640#(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); {18640#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:29:27,116 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {18417#true} {18640#(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))))} #104#return; {18640#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:29:27,116 INFO L290 TraceCheckUtils]: 43: Hoare triple {18417#true} assume true; {18417#true} is VALID [2022-04-28 12:29:27,116 INFO L290 TraceCheckUtils]: 42: Hoare triple {18417#true} assume !(0 == ~cond); {18417#true} is VALID [2022-04-28 12:29:27,117 INFO L290 TraceCheckUtils]: 41: Hoare triple {18417#true} ~cond := #in~cond; {18417#true} is VALID [2022-04-28 12:29:27,117 INFO L272 TraceCheckUtils]: 40: Hoare triple {18640#(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)); {18417#true} is VALID [2022-04-28 12:29:27,118 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {18417#true} {18640#(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))))} #102#return; {18640#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:29:27,118 INFO L290 TraceCheckUtils]: 38: Hoare triple {18417#true} assume true; {18417#true} is VALID [2022-04-28 12:29:27,118 INFO L290 TraceCheckUtils]: 37: Hoare triple {18417#true} assume !(0 == ~cond); {18417#true} is VALID [2022-04-28 12:29:27,118 INFO L290 TraceCheckUtils]: 36: Hoare triple {18417#true} ~cond := #in~cond; {18417#true} is VALID [2022-04-28 12:29:27,118 INFO L272 TraceCheckUtils]: 35: Hoare triple {18640#(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)); {18417#true} is VALID [2022-04-28 12:29:27,119 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {18417#true} {18640#(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))))} #100#return; {18640#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:29:27,119 INFO L290 TraceCheckUtils]: 33: Hoare triple {18417#true} assume true; {18417#true} is VALID [2022-04-28 12:29:27,119 INFO L290 TraceCheckUtils]: 32: Hoare triple {18417#true} assume !(0 == ~cond); {18417#true} is VALID [2022-04-28 12:29:27,119 INFO L290 TraceCheckUtils]: 31: Hoare triple {18417#true} ~cond := #in~cond; {18417#true} is VALID [2022-04-28 12:29:27,120 INFO L272 TraceCheckUtils]: 30: Hoare triple {18640#(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 ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18417#true} is VALID [2022-04-28 12:29:27,121 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {18507#(not (= |__VERIFIER_assert_#in~cond| 0))} {18692#(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)))) (= (+ 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))))} #98#return; {18640#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:29:27,121 INFO L290 TraceCheckUtils]: 28: Hoare triple {18507#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18507#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:29:27,121 INFO L290 TraceCheckUtils]: 27: Hoare triple {18702#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {18507#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:29:27,122 INFO L290 TraceCheckUtils]: 26: Hoare triple {18417#true} ~cond := #in~cond; {18702#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 12:29:27,122 INFO L272 TraceCheckUtils]: 25: Hoare triple {18692#(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)))) (= (+ 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)); {18417#true} is VALID [2022-04-28 12:29:27,122 INFO L290 TraceCheckUtils]: 24: Hoare triple {18692#(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)))) (= (+ 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 !!(#t~post8 < 10);havoc #t~post8; {18692#(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)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:29:27,123 INFO L290 TraceCheckUtils]: 23: Hoare triple {18692#(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)))) (= (+ 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))))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18692#(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)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:29:27,124 INFO L290 TraceCheckUtils]: 22: Hoare triple {18715#(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_~c~0 (* (- 1) main_~b~0)) 0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {18692#(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)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:29:27,124 INFO L290 TraceCheckUtils]: 21: Hoare triple {18715#(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_~c~0 (* (- 1) main_~b~0)) 0)))} assume !!(#t~post7 < 10);havoc #t~post7; {18715#(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_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-28 12:29:27,125 INFO L290 TraceCheckUtils]: 20: Hoare triple {18715#(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_~c~0 (* (- 1) main_~b~0)) 0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18715#(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_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-28 12:29:27,126 INFO L290 TraceCheckUtils]: 19: Hoare triple {18725#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) main_~b~0 (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {18715#(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_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-28 12:29:27,126 INFO L290 TraceCheckUtils]: 18: Hoare triple {18725#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) main_~b~0 (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} assume !!(#t~post6 < 10);havoc #t~post6; {18725#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) main_~b~0 (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-28 12:29:27,127 INFO L290 TraceCheckUtils]: 17: Hoare triple {18725#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) main_~b~0 (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18725#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) main_~b~0 (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-28 12:29:27,127 INFO L290 TraceCheckUtils]: 16: Hoare triple {18417#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {18725#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) main_~b~0 (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-28 12:29:27,127 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18417#true} {18417#true} #96#return; {18417#true} is VALID [2022-04-28 12:29:27,127 INFO L290 TraceCheckUtils]: 14: Hoare triple {18417#true} assume true; {18417#true} is VALID [2022-04-28 12:29:27,127 INFO L290 TraceCheckUtils]: 13: Hoare triple {18417#true} assume !(0 == ~cond); {18417#true} is VALID [2022-04-28 12:29:27,127 INFO L290 TraceCheckUtils]: 12: Hoare triple {18417#true} ~cond := #in~cond; {18417#true} is VALID [2022-04-28 12:29:27,128 INFO L272 TraceCheckUtils]: 11: Hoare triple {18417#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {18417#true} is VALID [2022-04-28 12:29:27,128 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18417#true} {18417#true} #94#return; {18417#true} is VALID [2022-04-28 12:29:27,128 INFO L290 TraceCheckUtils]: 9: Hoare triple {18417#true} assume true; {18417#true} is VALID [2022-04-28 12:29:27,128 INFO L290 TraceCheckUtils]: 8: Hoare triple {18417#true} assume !(0 == ~cond); {18417#true} is VALID [2022-04-28 12:29:27,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {18417#true} ~cond := #in~cond; {18417#true} is VALID [2022-04-28 12:29:27,128 INFO L272 TraceCheckUtils]: 6: Hoare triple {18417#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {18417#true} is VALID [2022-04-28 12:29:27,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {18417#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {18417#true} is VALID [2022-04-28 12:29:27,128 INFO L272 TraceCheckUtils]: 4: Hoare triple {18417#true} call #t~ret9 := main(); {18417#true} is VALID [2022-04-28 12:29:27,128 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18417#true} {18417#true} #108#return; {18417#true} is VALID [2022-04-28 12:29:27,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {18417#true} assume true; {18417#true} is VALID [2022-04-28 12:29:27,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {18417#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);~counter~0 := 0; {18417#true} is VALID [2022-04-28 12:29:27,128 INFO L272 TraceCheckUtils]: 0: Hoare triple {18417#true} call ULTIMATE.init(); {18417#true} is VALID [2022-04-28 12:29:27,129 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-28 12:29:27,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:29:27,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829430282] [2022-04-28 12:29:27,129 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:29:27,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433443958] [2022-04-28 12:29:27,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433443958] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:29:27,129 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:29:27,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2022-04-28 12:29:27,130 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:29:27,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [962718961] [2022-04-28 12:29:27,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [962718961] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:29:27,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:29:27,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 12:29:27,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88674161] [2022-04-28 12:29:27,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:29:27,130 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2022-04-28 12:29:27,131 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:29:27,131 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 12:29:27,176 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:27,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 12:29:27,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:29:27,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 12:29:27,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2022-04-28 12:29:27,177 INFO L87 Difference]: Start difference. First operand 324 states and 465 transitions. Second operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 12:29:29,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:29,771 INFO L93 Difference]: Finished difference Result 384 states and 559 transitions. [2022-04-28 12:29:29,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 12:29:29,771 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2022-04-28 12:29:29,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:29:29,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 12:29:29,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 149 transitions. [2022-04-28 12:29:29,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 12:29:29,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 149 transitions. [2022-04-28 12:29:29,775 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 149 transitions. [2022-04-28 12:29:29,945 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:29,956 INFO L225 Difference]: With dead ends: 384 [2022-04-28 12:29:29,957 INFO L226 Difference]: Without dead ends: 381 [2022-04-28 12:29:29,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2022-04-28 12:29:29,958 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 66 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 12:29:29,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 399 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 12:29:29,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2022-04-28 12:29:30,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 377. [2022-04-28 12:29:30,818 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:29:30,819 INFO L82 GeneralOperation]: Start isEquivalent. First operand 381 states. Second operand has 377 states, 243 states have (on average 1.345679012345679) internal successors, (327), 256 states have internal predecessors, (327), 113 states have call successors, (113), 21 states have call predecessors, (113), 20 states have return successors, (111), 99 states have call predecessors, (111), 111 states have call successors, (111) [2022-04-28 12:29:30,820 INFO L74 IsIncluded]: Start isIncluded. First operand 381 states. Second operand has 377 states, 243 states have (on average 1.345679012345679) internal successors, (327), 256 states have internal predecessors, (327), 113 states have call successors, (113), 21 states have call predecessors, (113), 20 states have return successors, (111), 99 states have call predecessors, (111), 111 states have call successors, (111) [2022-04-28 12:29:30,820 INFO L87 Difference]: Start difference. First operand 381 states. Second operand has 377 states, 243 states have (on average 1.345679012345679) internal successors, (327), 256 states have internal predecessors, (327), 113 states have call successors, (113), 21 states have call predecessors, (113), 20 states have return successors, (111), 99 states have call predecessors, (111), 111 states have call successors, (111) [2022-04-28 12:29:30,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:30,832 INFO L93 Difference]: Finished difference Result 381 states and 555 transitions. [2022-04-28 12:29:30,833 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 555 transitions. [2022-04-28 12:29:30,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:29:30,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:29:30,835 INFO L74 IsIncluded]: Start isIncluded. First operand has 377 states, 243 states have (on average 1.345679012345679) internal successors, (327), 256 states have internal predecessors, (327), 113 states have call successors, (113), 21 states have call predecessors, (113), 20 states have return successors, (111), 99 states have call predecessors, (111), 111 states have call successors, (111) Second operand 381 states. [2022-04-28 12:29:30,835 INFO L87 Difference]: Start difference. First operand has 377 states, 243 states have (on average 1.345679012345679) internal successors, (327), 256 states have internal predecessors, (327), 113 states have call successors, (113), 21 states have call predecessors, (113), 20 states have return successors, (111), 99 states have call predecessors, (111), 111 states have call successors, (111) Second operand 381 states. [2022-04-28 12:29:30,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:30,847 INFO L93 Difference]: Finished difference Result 381 states and 555 transitions. [2022-04-28 12:29:30,847 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 555 transitions. [2022-04-28 12:29:30,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:29:30,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:29:30,849 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:29:30,849 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:29:30,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 243 states have (on average 1.345679012345679) internal successors, (327), 256 states have internal predecessors, (327), 113 states have call successors, (113), 21 states have call predecessors, (113), 20 states have return successors, (111), 99 states have call predecessors, (111), 111 states have call successors, (111) [2022-04-28 12:29:30,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 551 transitions. [2022-04-28 12:29:30,864 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 551 transitions. Word has length 58 [2022-04-28 12:29:30,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:29:30,864 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 551 transitions. [2022-04-28 12:29:30,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 12:29:30,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 377 states and 551 transitions. [2022-04-28 12:29:31,604 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 551 edges. 551 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:31,605 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 551 transitions. [2022-04-28 12:29:31,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 12:29:31,605 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:29:31,605 INFO L195 NwaCegarLoop]: trace histogram [5, 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, 1, 1, 1, 1, 1] [2022-04-28 12:29:31,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-28 12:29:31,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-28 12:29:31,806 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:29:31,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:29:31,806 INFO L85 PathProgramCache]: Analyzing trace with hash 27973409, now seen corresponding path program 1 times [2022-04-28 12:29:31,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:29:31,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [454078881] [2022-04-28 12:29:31,807 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:29:31,807 INFO L85 PathProgramCache]: Analyzing trace with hash 27973409, now seen corresponding path program 2 times [2022-04-28 12:29:31,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:29:31,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806869521] [2022-04-28 12:29:31,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:29:31,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:29:31,819 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:29:31,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [162227817] [2022-04-28 12:29:31,819 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:29:31,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:29:31,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:29:31,820 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:29:31,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-28 12:29:31,872 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:29:31,872 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:29:31,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 12:29:31,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:29:31,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:29:32,164 INFO L272 TraceCheckUtils]: 0: Hoare triple {21077#true} call ULTIMATE.init(); {21077#true} is VALID [2022-04-28 12:29:32,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {21077#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);~counter~0 := 0; {21085#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:32,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {21085#(<= ~counter~0 0)} assume true; {21085#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:32,166 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21085#(<= ~counter~0 0)} {21077#true} #108#return; {21085#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:32,166 INFO L272 TraceCheckUtils]: 4: Hoare triple {21085#(<= ~counter~0 0)} call #t~ret9 := main(); {21085#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:32,166 INFO L290 TraceCheckUtils]: 5: Hoare triple {21085#(<= ~counter~0 0)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {21085#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:32,167 INFO L272 TraceCheckUtils]: 6: Hoare triple {21085#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {21085#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:32,167 INFO L290 TraceCheckUtils]: 7: Hoare triple {21085#(<= ~counter~0 0)} ~cond := #in~cond; {21085#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:32,167 INFO L290 TraceCheckUtils]: 8: Hoare triple {21085#(<= ~counter~0 0)} assume !(0 == ~cond); {21085#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:32,167 INFO L290 TraceCheckUtils]: 9: Hoare triple {21085#(<= ~counter~0 0)} assume true; {21085#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:32,168 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21085#(<= ~counter~0 0)} {21085#(<= ~counter~0 0)} #94#return; {21085#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:32,168 INFO L272 TraceCheckUtils]: 11: Hoare triple {21085#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {21085#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:32,169 INFO L290 TraceCheckUtils]: 12: Hoare triple {21085#(<= ~counter~0 0)} ~cond := #in~cond; {21085#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:32,169 INFO L290 TraceCheckUtils]: 13: Hoare triple {21085#(<= ~counter~0 0)} assume !(0 == ~cond); {21085#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:32,169 INFO L290 TraceCheckUtils]: 14: Hoare triple {21085#(<= ~counter~0 0)} assume true; {21085#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:32,170 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {21085#(<= ~counter~0 0)} {21085#(<= ~counter~0 0)} #96#return; {21085#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:32,170 INFO L290 TraceCheckUtils]: 16: Hoare triple {21085#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {21085#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:32,171 INFO L290 TraceCheckUtils]: 17: Hoare triple {21085#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21134#(<= ~counter~0 1)} is VALID [2022-04-28 12:29:32,171 INFO L290 TraceCheckUtils]: 18: Hoare triple {21134#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {21134#(<= ~counter~0 1)} is VALID [2022-04-28 12:29:32,171 INFO L290 TraceCheckUtils]: 19: Hoare triple {21134#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {21134#(<= ~counter~0 1)} is VALID [2022-04-28 12:29:32,172 INFO L290 TraceCheckUtils]: 20: Hoare triple {21134#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21144#(<= ~counter~0 2)} is VALID [2022-04-28 12:29:32,172 INFO L290 TraceCheckUtils]: 21: Hoare triple {21144#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {21144#(<= ~counter~0 2)} is VALID [2022-04-28 12:29:32,172 INFO L290 TraceCheckUtils]: 22: Hoare triple {21144#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {21144#(<= ~counter~0 2)} is VALID [2022-04-28 12:29:32,173 INFO L290 TraceCheckUtils]: 23: Hoare triple {21144#(<= ~counter~0 2)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {21144#(<= ~counter~0 2)} is VALID [2022-04-28 12:29:32,173 INFO L290 TraceCheckUtils]: 24: Hoare triple {21144#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21157#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:32,173 INFO L290 TraceCheckUtils]: 25: Hoare triple {21157#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {21157#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:32,174 INFO L290 TraceCheckUtils]: 26: Hoare triple {21157#(<= ~counter~0 3)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {21157#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:32,174 INFO L290 TraceCheckUtils]: 27: Hoare triple {21157#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21167#(<= ~counter~0 4)} is VALID [2022-04-28 12:29:32,174 INFO L290 TraceCheckUtils]: 28: Hoare triple {21167#(<= ~counter~0 4)} assume !!(#t~post7 < 10);havoc #t~post7; {21167#(<= ~counter~0 4)} is VALID [2022-04-28 12:29:32,175 INFO L290 TraceCheckUtils]: 29: Hoare triple {21167#(<= ~counter~0 4)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {21167#(<= ~counter~0 4)} is VALID [2022-04-28 12:29:32,175 INFO L290 TraceCheckUtils]: 30: Hoare triple {21167#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {21177#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:32,176 INFO L290 TraceCheckUtils]: 31: Hoare triple {21177#(<= ~counter~0 5)} assume !!(#t~post8 < 10);havoc #t~post8; {21177#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:32,176 INFO L272 TraceCheckUtils]: 32: Hoare triple {21177#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {21177#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:32,176 INFO L290 TraceCheckUtils]: 33: Hoare triple {21177#(<= ~counter~0 5)} ~cond := #in~cond; {21177#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:32,177 INFO L290 TraceCheckUtils]: 34: Hoare triple {21177#(<= ~counter~0 5)} assume !(0 == ~cond); {21177#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:32,177 INFO L290 TraceCheckUtils]: 35: Hoare triple {21177#(<= ~counter~0 5)} assume true; {21177#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:32,178 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {21177#(<= ~counter~0 5)} {21177#(<= ~counter~0 5)} #98#return; {21177#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:32,178 INFO L272 TraceCheckUtils]: 37: Hoare triple {21177#(<= ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {21177#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:32,178 INFO L290 TraceCheckUtils]: 38: Hoare triple {21177#(<= ~counter~0 5)} ~cond := #in~cond; {21177#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:32,179 INFO L290 TraceCheckUtils]: 39: Hoare triple {21177#(<= ~counter~0 5)} assume !(0 == ~cond); {21177#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:32,179 INFO L290 TraceCheckUtils]: 40: Hoare triple {21177#(<= ~counter~0 5)} assume true; {21177#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:32,180 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {21177#(<= ~counter~0 5)} {21177#(<= ~counter~0 5)} #100#return; {21177#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:32,180 INFO L272 TraceCheckUtils]: 42: Hoare triple {21177#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {21177#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:32,180 INFO L290 TraceCheckUtils]: 43: Hoare triple {21177#(<= ~counter~0 5)} ~cond := #in~cond; {21177#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:32,181 INFO L290 TraceCheckUtils]: 44: Hoare triple {21177#(<= ~counter~0 5)} assume !(0 == ~cond); {21177#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:32,181 INFO L290 TraceCheckUtils]: 45: Hoare triple {21177#(<= ~counter~0 5)} assume true; {21177#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:32,181 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {21177#(<= ~counter~0 5)} {21177#(<= ~counter~0 5)} #102#return; {21177#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:32,182 INFO L272 TraceCheckUtils]: 47: Hoare triple {21177#(<= ~counter~0 5)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {21177#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:32,182 INFO L290 TraceCheckUtils]: 48: Hoare triple {21177#(<= ~counter~0 5)} ~cond := #in~cond; {21177#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:32,183 INFO L290 TraceCheckUtils]: 49: Hoare triple {21177#(<= ~counter~0 5)} assume !(0 == ~cond); {21177#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:32,183 INFO L290 TraceCheckUtils]: 50: Hoare triple {21177#(<= ~counter~0 5)} assume true; {21177#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:32,183 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {21177#(<= ~counter~0 5)} {21177#(<= ~counter~0 5)} #104#return; {21177#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:32,184 INFO L290 TraceCheckUtils]: 52: Hoare triple {21177#(<= ~counter~0 5)} assume !(~c~0 >= 2 * ~v~0); {21177#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:32,184 INFO L290 TraceCheckUtils]: 53: Hoare triple {21177#(<= ~counter~0 5)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {21177#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:32,184 INFO L290 TraceCheckUtils]: 54: Hoare triple {21177#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21250#(<= |main_#t~post7| 5)} is VALID [2022-04-28 12:29:32,185 INFO L290 TraceCheckUtils]: 55: Hoare triple {21250#(<= |main_#t~post7| 5)} assume !(#t~post7 < 10);havoc #t~post7; {21078#false} is VALID [2022-04-28 12:29:32,185 INFO L290 TraceCheckUtils]: 56: Hoare triple {21078#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; {21078#false} is VALID [2022-04-28 12:29:32,185 INFO L290 TraceCheckUtils]: 57: Hoare triple {21078#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21078#false} is VALID [2022-04-28 12:29:32,185 INFO L290 TraceCheckUtils]: 58: Hoare triple {21078#false} assume !(#t~post6 < 10);havoc #t~post6; {21078#false} is VALID [2022-04-28 12:29:32,185 INFO L272 TraceCheckUtils]: 59: Hoare triple {21078#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)); {21078#false} is VALID [2022-04-28 12:29:32,185 INFO L290 TraceCheckUtils]: 60: Hoare triple {21078#false} ~cond := #in~cond; {21078#false} is VALID [2022-04-28 12:29:32,185 INFO L290 TraceCheckUtils]: 61: Hoare triple {21078#false} assume 0 == ~cond; {21078#false} is VALID [2022-04-28 12:29:32,185 INFO L290 TraceCheckUtils]: 62: Hoare triple {21078#false} assume !false; {21078#false} is VALID [2022-04-28 12:29:32,185 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 12:29:32,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:29:32,483 INFO L290 TraceCheckUtils]: 62: Hoare triple {21078#false} assume !false; {21078#false} is VALID [2022-04-28 12:29:32,484 INFO L290 TraceCheckUtils]: 61: Hoare triple {21078#false} assume 0 == ~cond; {21078#false} is VALID [2022-04-28 12:29:32,484 INFO L290 TraceCheckUtils]: 60: Hoare triple {21078#false} ~cond := #in~cond; {21078#false} is VALID [2022-04-28 12:29:32,484 INFO L272 TraceCheckUtils]: 59: Hoare triple {21078#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)); {21078#false} is VALID [2022-04-28 12:29:32,484 INFO L290 TraceCheckUtils]: 58: Hoare triple {21078#false} assume !(#t~post6 < 10);havoc #t~post6; {21078#false} is VALID [2022-04-28 12:29:32,484 INFO L290 TraceCheckUtils]: 57: Hoare triple {21078#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21078#false} is VALID [2022-04-28 12:29:32,484 INFO L290 TraceCheckUtils]: 56: Hoare triple {21078#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; {21078#false} is VALID [2022-04-28 12:29:32,484 INFO L290 TraceCheckUtils]: 55: Hoare triple {21296#(< |main_#t~post7| 10)} assume !(#t~post7 < 10);havoc #t~post7; {21078#false} is VALID [2022-04-28 12:29:32,485 INFO L290 TraceCheckUtils]: 54: Hoare triple {21300#(< ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21296#(< |main_#t~post7| 10)} is VALID [2022-04-28 12:29:32,485 INFO L290 TraceCheckUtils]: 53: Hoare triple {21300#(< ~counter~0 10)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {21300#(< ~counter~0 10)} is VALID [2022-04-28 12:29:32,485 INFO L290 TraceCheckUtils]: 52: Hoare triple {21300#(< ~counter~0 10)} assume !(~c~0 >= 2 * ~v~0); {21300#(< ~counter~0 10)} is VALID [2022-04-28 12:29:32,486 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {21077#true} {21300#(< ~counter~0 10)} #104#return; {21300#(< ~counter~0 10)} is VALID [2022-04-28 12:29:32,486 INFO L290 TraceCheckUtils]: 50: Hoare triple {21077#true} assume true; {21077#true} is VALID [2022-04-28 12:29:32,486 INFO L290 TraceCheckUtils]: 49: Hoare triple {21077#true} assume !(0 == ~cond); {21077#true} is VALID [2022-04-28 12:29:32,486 INFO L290 TraceCheckUtils]: 48: Hoare triple {21077#true} ~cond := #in~cond; {21077#true} is VALID [2022-04-28 12:29:32,486 INFO L272 TraceCheckUtils]: 47: Hoare triple {21300#(< ~counter~0 10)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {21077#true} is VALID [2022-04-28 12:29:32,487 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {21077#true} {21300#(< ~counter~0 10)} #102#return; {21300#(< ~counter~0 10)} is VALID [2022-04-28 12:29:32,487 INFO L290 TraceCheckUtils]: 45: Hoare triple {21077#true} assume true; {21077#true} is VALID [2022-04-28 12:29:32,487 INFO L290 TraceCheckUtils]: 44: Hoare triple {21077#true} assume !(0 == ~cond); {21077#true} is VALID [2022-04-28 12:29:32,487 INFO L290 TraceCheckUtils]: 43: Hoare triple {21077#true} ~cond := #in~cond; {21077#true} is VALID [2022-04-28 12:29:32,487 INFO L272 TraceCheckUtils]: 42: Hoare triple {21300#(< ~counter~0 10)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {21077#true} is VALID [2022-04-28 12:29:32,488 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {21077#true} {21300#(< ~counter~0 10)} #100#return; {21300#(< ~counter~0 10)} is VALID [2022-04-28 12:29:32,488 INFO L290 TraceCheckUtils]: 40: Hoare triple {21077#true} assume true; {21077#true} is VALID [2022-04-28 12:29:32,488 INFO L290 TraceCheckUtils]: 39: Hoare triple {21077#true} assume !(0 == ~cond); {21077#true} is VALID [2022-04-28 12:29:32,488 INFO L290 TraceCheckUtils]: 38: Hoare triple {21077#true} ~cond := #in~cond; {21077#true} is VALID [2022-04-28 12:29:32,488 INFO L272 TraceCheckUtils]: 37: Hoare triple {21300#(< ~counter~0 10)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {21077#true} is VALID [2022-04-28 12:29:32,489 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {21077#true} {21300#(< ~counter~0 10)} #98#return; {21300#(< ~counter~0 10)} is VALID [2022-04-28 12:29:32,489 INFO L290 TraceCheckUtils]: 35: Hoare triple {21077#true} assume true; {21077#true} is VALID [2022-04-28 12:29:32,489 INFO L290 TraceCheckUtils]: 34: Hoare triple {21077#true} assume !(0 == ~cond); {21077#true} is VALID [2022-04-28 12:29:32,489 INFO L290 TraceCheckUtils]: 33: Hoare triple {21077#true} ~cond := #in~cond; {21077#true} is VALID [2022-04-28 12:29:32,489 INFO L272 TraceCheckUtils]: 32: Hoare triple {21300#(< ~counter~0 10)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {21077#true} is VALID [2022-04-28 12:29:32,489 INFO L290 TraceCheckUtils]: 31: Hoare triple {21300#(< ~counter~0 10)} assume !!(#t~post8 < 10);havoc #t~post8; {21300#(< ~counter~0 10)} is VALID [2022-04-28 12:29:32,490 INFO L290 TraceCheckUtils]: 30: Hoare triple {21373#(< ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {21300#(< ~counter~0 10)} is VALID [2022-04-28 12:29:32,490 INFO L290 TraceCheckUtils]: 29: Hoare triple {21373#(< ~counter~0 9)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {21373#(< ~counter~0 9)} is VALID [2022-04-28 12:29:32,490 INFO L290 TraceCheckUtils]: 28: Hoare triple {21373#(< ~counter~0 9)} assume !!(#t~post7 < 10);havoc #t~post7; {21373#(< ~counter~0 9)} is VALID [2022-04-28 12:29:32,491 INFO L290 TraceCheckUtils]: 27: Hoare triple {21383#(< ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21373#(< ~counter~0 9)} is VALID [2022-04-28 12:29:32,491 INFO L290 TraceCheckUtils]: 26: Hoare triple {21383#(< ~counter~0 8)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {21383#(< ~counter~0 8)} is VALID [2022-04-28 12:29:32,492 INFO L290 TraceCheckUtils]: 25: Hoare triple {21383#(< ~counter~0 8)} assume !!(#t~post6 < 10);havoc #t~post6; {21383#(< ~counter~0 8)} is VALID [2022-04-28 12:29:32,492 INFO L290 TraceCheckUtils]: 24: Hoare triple {21393#(< ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21383#(< ~counter~0 8)} is VALID [2022-04-28 12:29:32,492 INFO L290 TraceCheckUtils]: 23: Hoare triple {21393#(< ~counter~0 7)} ~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; {21393#(< ~counter~0 7)} is VALID [2022-04-28 12:29:32,493 INFO L290 TraceCheckUtils]: 22: Hoare triple {21393#(< ~counter~0 7)} assume !(~c~0 >= ~b~0); {21393#(< ~counter~0 7)} is VALID [2022-04-28 12:29:32,493 INFO L290 TraceCheckUtils]: 21: Hoare triple {21393#(< ~counter~0 7)} assume !!(#t~post7 < 10);havoc #t~post7; {21393#(< ~counter~0 7)} is VALID [2022-04-28 12:29:32,493 INFO L290 TraceCheckUtils]: 20: Hoare triple {21177#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21393#(< ~counter~0 7)} is VALID [2022-04-28 12:29:32,494 INFO L290 TraceCheckUtils]: 19: Hoare triple {21177#(<= ~counter~0 5)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {21177#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:32,494 INFO L290 TraceCheckUtils]: 18: Hoare triple {21177#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {21177#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:32,495 INFO L290 TraceCheckUtils]: 17: Hoare triple {21167#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21177#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:32,495 INFO L290 TraceCheckUtils]: 16: Hoare triple {21167#(<= ~counter~0 4)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {21167#(<= ~counter~0 4)} is VALID [2022-04-28 12:29:32,495 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {21077#true} {21167#(<= ~counter~0 4)} #96#return; {21167#(<= ~counter~0 4)} is VALID [2022-04-28 12:29:32,495 INFO L290 TraceCheckUtils]: 14: Hoare triple {21077#true} assume true; {21077#true} is VALID [2022-04-28 12:29:32,495 INFO L290 TraceCheckUtils]: 13: Hoare triple {21077#true} assume !(0 == ~cond); {21077#true} is VALID [2022-04-28 12:29:32,496 INFO L290 TraceCheckUtils]: 12: Hoare triple {21077#true} ~cond := #in~cond; {21077#true} is VALID [2022-04-28 12:29:32,496 INFO L272 TraceCheckUtils]: 11: Hoare triple {21167#(<= ~counter~0 4)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {21077#true} is VALID [2022-04-28 12:29:32,496 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21077#true} {21167#(<= ~counter~0 4)} #94#return; {21167#(<= ~counter~0 4)} is VALID [2022-04-28 12:29:32,496 INFO L290 TraceCheckUtils]: 9: Hoare triple {21077#true} assume true; {21077#true} is VALID [2022-04-28 12:29:32,496 INFO L290 TraceCheckUtils]: 8: Hoare triple {21077#true} assume !(0 == ~cond); {21077#true} is VALID [2022-04-28 12:29:32,496 INFO L290 TraceCheckUtils]: 7: Hoare triple {21077#true} ~cond := #in~cond; {21077#true} is VALID [2022-04-28 12:29:32,496 INFO L272 TraceCheckUtils]: 6: Hoare triple {21167#(<= ~counter~0 4)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {21077#true} is VALID [2022-04-28 12:29:32,497 INFO L290 TraceCheckUtils]: 5: Hoare triple {21167#(<= ~counter~0 4)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {21167#(<= ~counter~0 4)} is VALID [2022-04-28 12:29:32,497 INFO L272 TraceCheckUtils]: 4: Hoare triple {21167#(<= ~counter~0 4)} call #t~ret9 := main(); {21167#(<= ~counter~0 4)} is VALID [2022-04-28 12:29:32,497 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21167#(<= ~counter~0 4)} {21077#true} #108#return; {21167#(<= ~counter~0 4)} is VALID [2022-04-28 12:29:32,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {21167#(<= ~counter~0 4)} assume true; {21167#(<= ~counter~0 4)} is VALID [2022-04-28 12:29:32,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {21077#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);~counter~0 := 0; {21167#(<= ~counter~0 4)} is VALID [2022-04-28 12:29:32,498 INFO L272 TraceCheckUtils]: 0: Hoare triple {21077#true} call ULTIMATE.init(); {21077#true} is VALID [2022-04-28 12:29:32,498 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 12:29:32,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:29:32,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806869521] [2022-04-28 12:29:32,499 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:29:32,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162227817] [2022-04-28 12:29:32,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162227817] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:29:32,499 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:29:32,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-28 12:29:32,499 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:29:32,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [454078881] [2022-04-28 12:29:32,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [454078881] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:29:32,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:29:32,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 12:29:32,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19676734] [2022-04-28 12:29:32,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:29:32,500 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 63 [2022-04-28 12:29:32,500 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:29:32,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 12:29:32,536 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:32,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 12:29:32,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:29:32,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 12:29:32,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 12:29:32,537 INFO L87 Difference]: Start difference. First operand 377 states and 551 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 12:29:33,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:33,754 INFO L93 Difference]: Finished difference Result 604 states and 873 transitions. [2022-04-28 12:29:33,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 12:29:33,755 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 63 [2022-04-28 12:29:33,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:29:33,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 12:29:33,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 158 transitions. [2022-04-28 12:29:33,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 12:29:33,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 158 transitions. [2022-04-28 12:29:33,760 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 158 transitions. [2022-04-28 12:29:33,890 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:33,907 INFO L225 Difference]: With dead ends: 604 [2022-04-28 12:29:33,907 INFO L226 Difference]: Without dead ends: 440 [2022-04-28 12:29:33,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=167, Unknown=0, NotChecked=0, Total=272 [2022-04-28 12:29:33,909 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 57 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 12:29:33,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 236 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 12:29:33,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2022-04-28 12:29:34,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 426. [2022-04-28 12:29:34,845 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:29:34,845 INFO L82 GeneralOperation]: Start isEquivalent. First operand 440 states. Second operand has 426 states, 279 states have (on average 1.3118279569892473) internal successors, (366), 290 states have internal predecessors, (366), 117 states have call successors, (117), 30 states have call predecessors, (117), 29 states have return successors, (115), 105 states have call predecessors, (115), 115 states have call successors, (115) [2022-04-28 12:29:34,846 INFO L74 IsIncluded]: Start isIncluded. First operand 440 states. Second operand has 426 states, 279 states have (on average 1.3118279569892473) internal successors, (366), 290 states have internal predecessors, (366), 117 states have call successors, (117), 30 states have call predecessors, (117), 29 states have return successors, (115), 105 states have call predecessors, (115), 115 states have call successors, (115) [2022-04-28 12:29:34,846 INFO L87 Difference]: Start difference. First operand 440 states. Second operand has 426 states, 279 states have (on average 1.3118279569892473) internal successors, (366), 290 states have internal predecessors, (366), 117 states have call successors, (117), 30 states have call predecessors, (117), 29 states have return successors, (115), 105 states have call predecessors, (115), 115 states have call successors, (115) [2022-04-28 12:29:34,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:34,861 INFO L93 Difference]: Finished difference Result 440 states and 611 transitions. [2022-04-28 12:29:34,861 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 611 transitions. [2022-04-28 12:29:34,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:29:34,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:29:34,863 INFO L74 IsIncluded]: Start isIncluded. First operand has 426 states, 279 states have (on average 1.3118279569892473) internal successors, (366), 290 states have internal predecessors, (366), 117 states have call successors, (117), 30 states have call predecessors, (117), 29 states have return successors, (115), 105 states have call predecessors, (115), 115 states have call successors, (115) Second operand 440 states. [2022-04-28 12:29:34,864 INFO L87 Difference]: Start difference. First operand has 426 states, 279 states have (on average 1.3118279569892473) internal successors, (366), 290 states have internal predecessors, (366), 117 states have call successors, (117), 30 states have call predecessors, (117), 29 states have return successors, (115), 105 states have call predecessors, (115), 115 states have call successors, (115) Second operand 440 states. [2022-04-28 12:29:34,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:34,880 INFO L93 Difference]: Finished difference Result 440 states and 611 transitions. [2022-04-28 12:29:34,880 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 611 transitions. [2022-04-28 12:29:34,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:29:34,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:29:34,881 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:29:34,881 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:29:34,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 279 states have (on average 1.3118279569892473) internal successors, (366), 290 states have internal predecessors, (366), 117 states have call successors, (117), 30 states have call predecessors, (117), 29 states have return successors, (115), 105 states have call predecessors, (115), 115 states have call successors, (115) [2022-04-28 12:29:34,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 598 transitions. [2022-04-28 12:29:34,900 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 598 transitions. Word has length 63 [2022-04-28 12:29:34,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:29:34,900 INFO L495 AbstractCegarLoop]: Abstraction has 426 states and 598 transitions. [2022-04-28 12:29:34,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 12:29:34,900 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 426 states and 598 transitions. [2022-04-28 12:29:35,737 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 598 edges. 598 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:35,737 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 598 transitions. [2022-04-28 12:29:35,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-28 12:29:35,738 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:29:35,738 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:29:35,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-28 12:29:35,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-28 12:29:35,939 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:29:35,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:29:35,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1288112160, now seen corresponding path program 3 times [2022-04-28 12:29:35,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:29:35,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1444401272] [2022-04-28 12:29:35,940 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:29:35,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1288112160, now seen corresponding path program 4 times [2022-04-28 12:29:35,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:29:35,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710926297] [2022-04-28 12:29:35,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:29:35,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:29:35,963 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:29:35,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [236341827] [2022-04-28 12:29:35,963 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 12:29:35,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:29:35,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:29:35,971 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:29:35,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-28 12:29:36,030 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 12:29:36,030 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:29:36,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 12:29:36,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:29:36,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:29:36,467 INFO L272 TraceCheckUtils]: 0: Hoare triple {24414#true} call ULTIMATE.init(); {24414#true} is VALID [2022-04-28 12:29:36,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {24414#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);~counter~0 := 0; {24422#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:36,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {24422#(<= ~counter~0 0)} assume true; {24422#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:36,469 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24422#(<= ~counter~0 0)} {24414#true} #108#return; {24422#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:36,469 INFO L272 TraceCheckUtils]: 4: Hoare triple {24422#(<= ~counter~0 0)} call #t~ret9 := main(); {24422#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:36,469 INFO L290 TraceCheckUtils]: 5: Hoare triple {24422#(<= ~counter~0 0)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {24422#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:36,470 INFO L272 TraceCheckUtils]: 6: Hoare triple {24422#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {24422#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:36,470 INFO L290 TraceCheckUtils]: 7: Hoare triple {24422#(<= ~counter~0 0)} ~cond := #in~cond; {24422#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:36,471 INFO L290 TraceCheckUtils]: 8: Hoare triple {24422#(<= ~counter~0 0)} assume !(0 == ~cond); {24422#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:36,471 INFO L290 TraceCheckUtils]: 9: Hoare triple {24422#(<= ~counter~0 0)} assume true; {24422#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:36,471 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {24422#(<= ~counter~0 0)} {24422#(<= ~counter~0 0)} #94#return; {24422#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:36,472 INFO L272 TraceCheckUtils]: 11: Hoare triple {24422#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {24422#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:36,472 INFO L290 TraceCheckUtils]: 12: Hoare triple {24422#(<= ~counter~0 0)} ~cond := #in~cond; {24422#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:36,473 INFO L290 TraceCheckUtils]: 13: Hoare triple {24422#(<= ~counter~0 0)} assume !(0 == ~cond); {24422#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:36,473 INFO L290 TraceCheckUtils]: 14: Hoare triple {24422#(<= ~counter~0 0)} assume true; {24422#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:36,474 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {24422#(<= ~counter~0 0)} {24422#(<= ~counter~0 0)} #96#return; {24422#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:36,474 INFO L290 TraceCheckUtils]: 16: Hoare triple {24422#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {24422#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:36,475 INFO L290 TraceCheckUtils]: 17: Hoare triple {24422#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24471#(<= ~counter~0 1)} is VALID [2022-04-28 12:29:36,475 INFO L290 TraceCheckUtils]: 18: Hoare triple {24471#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {24471#(<= ~counter~0 1)} is VALID [2022-04-28 12:29:36,476 INFO L290 TraceCheckUtils]: 19: Hoare triple {24471#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {24471#(<= ~counter~0 1)} is VALID [2022-04-28 12:29:36,477 INFO L290 TraceCheckUtils]: 20: Hoare triple {24471#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24481#(<= ~counter~0 2)} is VALID [2022-04-28 12:29:36,477 INFO L290 TraceCheckUtils]: 21: Hoare triple {24481#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {24481#(<= ~counter~0 2)} is VALID [2022-04-28 12:29:36,477 INFO L290 TraceCheckUtils]: 22: Hoare triple {24481#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {24481#(<= ~counter~0 2)} is VALID [2022-04-28 12:29:36,478 INFO L290 TraceCheckUtils]: 23: Hoare triple {24481#(<= ~counter~0 2)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {24481#(<= ~counter~0 2)} is VALID [2022-04-28 12:29:36,478 INFO L290 TraceCheckUtils]: 24: Hoare triple {24481#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24494#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:36,479 INFO L290 TraceCheckUtils]: 25: Hoare triple {24494#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {24494#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:36,479 INFO L290 TraceCheckUtils]: 26: Hoare triple {24494#(<= ~counter~0 3)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {24494#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:36,480 INFO L290 TraceCheckUtils]: 27: Hoare triple {24494#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24504#(<= ~counter~0 4)} is VALID [2022-04-28 12:29:36,480 INFO L290 TraceCheckUtils]: 28: Hoare triple {24504#(<= ~counter~0 4)} assume !!(#t~post7 < 10);havoc #t~post7; {24504#(<= ~counter~0 4)} is VALID [2022-04-28 12:29:36,481 INFO L290 TraceCheckUtils]: 29: Hoare triple {24504#(<= ~counter~0 4)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {24504#(<= ~counter~0 4)} is VALID [2022-04-28 12:29:36,481 INFO L290 TraceCheckUtils]: 30: Hoare triple {24504#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {24514#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:36,482 INFO L290 TraceCheckUtils]: 31: Hoare triple {24514#(<= ~counter~0 5)} assume !!(#t~post8 < 10);havoc #t~post8; {24514#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:36,482 INFO L272 TraceCheckUtils]: 32: Hoare triple {24514#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {24514#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:36,483 INFO L290 TraceCheckUtils]: 33: Hoare triple {24514#(<= ~counter~0 5)} ~cond := #in~cond; {24514#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:36,483 INFO L290 TraceCheckUtils]: 34: Hoare triple {24514#(<= ~counter~0 5)} assume !(0 == ~cond); {24514#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:36,483 INFO L290 TraceCheckUtils]: 35: Hoare triple {24514#(<= ~counter~0 5)} assume true; {24514#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:36,484 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {24514#(<= ~counter~0 5)} {24514#(<= ~counter~0 5)} #98#return; {24514#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:36,485 INFO L272 TraceCheckUtils]: 37: Hoare triple {24514#(<= ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {24514#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:36,485 INFO L290 TraceCheckUtils]: 38: Hoare triple {24514#(<= ~counter~0 5)} ~cond := #in~cond; {24514#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:36,486 INFO L290 TraceCheckUtils]: 39: Hoare triple {24514#(<= ~counter~0 5)} assume !(0 == ~cond); {24514#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:36,486 INFO L290 TraceCheckUtils]: 40: Hoare triple {24514#(<= ~counter~0 5)} assume true; {24514#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:36,487 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {24514#(<= ~counter~0 5)} {24514#(<= ~counter~0 5)} #100#return; {24514#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:36,487 INFO L272 TraceCheckUtils]: 42: Hoare triple {24514#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {24514#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:36,488 INFO L290 TraceCheckUtils]: 43: Hoare triple {24514#(<= ~counter~0 5)} ~cond := #in~cond; {24514#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:36,488 INFO L290 TraceCheckUtils]: 44: Hoare triple {24514#(<= ~counter~0 5)} assume !(0 == ~cond); {24514#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:36,488 INFO L290 TraceCheckUtils]: 45: Hoare triple {24514#(<= ~counter~0 5)} assume true; {24514#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:36,489 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {24514#(<= ~counter~0 5)} {24514#(<= ~counter~0 5)} #102#return; {24514#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:36,490 INFO L272 TraceCheckUtils]: 47: Hoare triple {24514#(<= ~counter~0 5)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {24514#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:36,490 INFO L290 TraceCheckUtils]: 48: Hoare triple {24514#(<= ~counter~0 5)} ~cond := #in~cond; {24514#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:36,490 INFO L290 TraceCheckUtils]: 49: Hoare triple {24514#(<= ~counter~0 5)} assume !(0 == ~cond); {24514#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:36,491 INFO L290 TraceCheckUtils]: 50: Hoare triple {24514#(<= ~counter~0 5)} assume true; {24514#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:36,491 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {24514#(<= ~counter~0 5)} {24514#(<= ~counter~0 5)} #104#return; {24514#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:36,492 INFO L290 TraceCheckUtils]: 52: Hoare triple {24514#(<= ~counter~0 5)} assume !(~c~0 >= 2 * ~v~0); {24514#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:36,492 INFO L290 TraceCheckUtils]: 53: Hoare triple {24514#(<= ~counter~0 5)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {24514#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:36,493 INFO L290 TraceCheckUtils]: 54: Hoare triple {24514#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24587#(<= ~counter~0 6)} is VALID [2022-04-28 12:29:36,493 INFO L290 TraceCheckUtils]: 55: Hoare triple {24587#(<= ~counter~0 6)} assume !!(#t~post7 < 10);havoc #t~post7; {24587#(<= ~counter~0 6)} is VALID [2022-04-28 12:29:36,494 INFO L290 TraceCheckUtils]: 56: Hoare triple {24587#(<= ~counter~0 6)} assume !(~c~0 >= ~b~0); {24587#(<= ~counter~0 6)} is VALID [2022-04-28 12:29:36,494 INFO L290 TraceCheckUtils]: 57: Hoare triple {24587#(<= ~counter~0 6)} ~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; {24587#(<= ~counter~0 6)} is VALID [2022-04-28 12:29:36,494 INFO L290 TraceCheckUtils]: 58: Hoare triple {24587#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24600#(<= |main_#t~post6| 6)} is VALID [2022-04-28 12:29:36,495 INFO L290 TraceCheckUtils]: 59: Hoare triple {24600#(<= |main_#t~post6| 6)} assume !(#t~post6 < 10);havoc #t~post6; {24415#false} is VALID [2022-04-28 12:29:36,495 INFO L272 TraceCheckUtils]: 60: Hoare triple {24415#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)); {24415#false} is VALID [2022-04-28 12:29:36,495 INFO L290 TraceCheckUtils]: 61: Hoare triple {24415#false} ~cond := #in~cond; {24415#false} is VALID [2022-04-28 12:29:36,495 INFO L290 TraceCheckUtils]: 62: Hoare triple {24415#false} assume 0 == ~cond; {24415#false} is VALID [2022-04-28 12:29:36,495 INFO L290 TraceCheckUtils]: 63: Hoare triple {24415#false} assume !false; {24415#false} is VALID [2022-04-28 12:29:36,495 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 12:29:36,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:29:36,816 INFO L290 TraceCheckUtils]: 63: Hoare triple {24415#false} assume !false; {24415#false} is VALID [2022-04-28 12:29:36,816 INFO L290 TraceCheckUtils]: 62: Hoare triple {24415#false} assume 0 == ~cond; {24415#false} is VALID [2022-04-28 12:29:36,816 INFO L290 TraceCheckUtils]: 61: Hoare triple {24415#false} ~cond := #in~cond; {24415#false} is VALID [2022-04-28 12:29:36,816 INFO L272 TraceCheckUtils]: 60: Hoare triple {24415#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)); {24415#false} is VALID [2022-04-28 12:29:36,817 INFO L290 TraceCheckUtils]: 59: Hoare triple {24628#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {24415#false} is VALID [2022-04-28 12:29:36,817 INFO L290 TraceCheckUtils]: 58: Hoare triple {24632#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24628#(< |main_#t~post6| 10)} is VALID [2022-04-28 12:29:36,817 INFO L290 TraceCheckUtils]: 57: Hoare triple {24632#(< ~counter~0 10)} ~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; {24632#(< ~counter~0 10)} is VALID [2022-04-28 12:29:36,818 INFO L290 TraceCheckUtils]: 56: Hoare triple {24632#(< ~counter~0 10)} assume !(~c~0 >= ~b~0); {24632#(< ~counter~0 10)} is VALID [2022-04-28 12:29:36,818 INFO L290 TraceCheckUtils]: 55: Hoare triple {24632#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {24632#(< ~counter~0 10)} is VALID [2022-04-28 12:29:36,819 INFO L290 TraceCheckUtils]: 54: Hoare triple {24645#(< ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24632#(< ~counter~0 10)} is VALID [2022-04-28 12:29:36,819 INFO L290 TraceCheckUtils]: 53: Hoare triple {24645#(< ~counter~0 9)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {24645#(< ~counter~0 9)} is VALID [2022-04-28 12:29:36,819 INFO L290 TraceCheckUtils]: 52: Hoare triple {24645#(< ~counter~0 9)} assume !(~c~0 >= 2 * ~v~0); {24645#(< ~counter~0 9)} is VALID [2022-04-28 12:29:36,820 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {24414#true} {24645#(< ~counter~0 9)} #104#return; {24645#(< ~counter~0 9)} is VALID [2022-04-28 12:29:36,820 INFO L290 TraceCheckUtils]: 50: Hoare triple {24414#true} assume true; {24414#true} is VALID [2022-04-28 12:29:36,820 INFO L290 TraceCheckUtils]: 49: Hoare triple {24414#true} assume !(0 == ~cond); {24414#true} is VALID [2022-04-28 12:29:36,820 INFO L290 TraceCheckUtils]: 48: Hoare triple {24414#true} ~cond := #in~cond; {24414#true} is VALID [2022-04-28 12:29:36,820 INFO L272 TraceCheckUtils]: 47: Hoare triple {24645#(< ~counter~0 9)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {24414#true} is VALID [2022-04-28 12:29:36,821 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {24414#true} {24645#(< ~counter~0 9)} #102#return; {24645#(< ~counter~0 9)} is VALID [2022-04-28 12:29:36,821 INFO L290 TraceCheckUtils]: 45: Hoare triple {24414#true} assume true; {24414#true} is VALID [2022-04-28 12:29:36,821 INFO L290 TraceCheckUtils]: 44: Hoare triple {24414#true} assume !(0 == ~cond); {24414#true} is VALID [2022-04-28 12:29:36,821 INFO L290 TraceCheckUtils]: 43: Hoare triple {24414#true} ~cond := #in~cond; {24414#true} is VALID [2022-04-28 12:29:36,821 INFO L272 TraceCheckUtils]: 42: Hoare triple {24645#(< ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {24414#true} is VALID [2022-04-28 12:29:36,822 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {24414#true} {24645#(< ~counter~0 9)} #100#return; {24645#(< ~counter~0 9)} is VALID [2022-04-28 12:29:36,822 INFO L290 TraceCheckUtils]: 40: Hoare triple {24414#true} assume true; {24414#true} is VALID [2022-04-28 12:29:36,822 INFO L290 TraceCheckUtils]: 39: Hoare triple {24414#true} assume !(0 == ~cond); {24414#true} is VALID [2022-04-28 12:29:36,822 INFO L290 TraceCheckUtils]: 38: Hoare triple {24414#true} ~cond := #in~cond; {24414#true} is VALID [2022-04-28 12:29:36,822 INFO L272 TraceCheckUtils]: 37: Hoare triple {24645#(< ~counter~0 9)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {24414#true} is VALID [2022-04-28 12:29:36,823 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {24414#true} {24645#(< ~counter~0 9)} #98#return; {24645#(< ~counter~0 9)} is VALID [2022-04-28 12:29:36,823 INFO L290 TraceCheckUtils]: 35: Hoare triple {24414#true} assume true; {24414#true} is VALID [2022-04-28 12:29:36,823 INFO L290 TraceCheckUtils]: 34: Hoare triple {24414#true} assume !(0 == ~cond); {24414#true} is VALID [2022-04-28 12:29:36,823 INFO L290 TraceCheckUtils]: 33: Hoare triple {24414#true} ~cond := #in~cond; {24414#true} is VALID [2022-04-28 12:29:36,823 INFO L272 TraceCheckUtils]: 32: Hoare triple {24645#(< ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {24414#true} is VALID [2022-04-28 12:29:36,823 INFO L290 TraceCheckUtils]: 31: Hoare triple {24645#(< ~counter~0 9)} assume !!(#t~post8 < 10);havoc #t~post8; {24645#(< ~counter~0 9)} is VALID [2022-04-28 12:29:36,824 INFO L290 TraceCheckUtils]: 30: Hoare triple {24718#(< ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {24645#(< ~counter~0 9)} is VALID [2022-04-28 12:29:36,824 INFO L290 TraceCheckUtils]: 29: Hoare triple {24718#(< ~counter~0 8)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {24718#(< ~counter~0 8)} is VALID [2022-04-28 12:29:36,824 INFO L290 TraceCheckUtils]: 28: Hoare triple {24718#(< ~counter~0 8)} assume !!(#t~post7 < 10);havoc #t~post7; {24718#(< ~counter~0 8)} is VALID [2022-04-28 12:29:36,825 INFO L290 TraceCheckUtils]: 27: Hoare triple {24587#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24718#(< ~counter~0 8)} is VALID [2022-04-28 12:29:36,825 INFO L290 TraceCheckUtils]: 26: Hoare triple {24587#(<= ~counter~0 6)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {24587#(<= ~counter~0 6)} is VALID [2022-04-28 12:29:36,825 INFO L290 TraceCheckUtils]: 25: Hoare triple {24587#(<= ~counter~0 6)} assume !!(#t~post6 < 10);havoc #t~post6; {24587#(<= ~counter~0 6)} is VALID [2022-04-28 12:29:36,826 INFO L290 TraceCheckUtils]: 24: Hoare triple {24514#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24587#(<= ~counter~0 6)} is VALID [2022-04-28 12:29:36,826 INFO L290 TraceCheckUtils]: 23: Hoare triple {24514#(<= ~counter~0 5)} ~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; {24514#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:36,826 INFO L290 TraceCheckUtils]: 22: Hoare triple {24514#(<= ~counter~0 5)} assume !(~c~0 >= ~b~0); {24514#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:36,827 INFO L290 TraceCheckUtils]: 21: Hoare triple {24514#(<= ~counter~0 5)} assume !!(#t~post7 < 10);havoc #t~post7; {24514#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:36,827 INFO L290 TraceCheckUtils]: 20: Hoare triple {24504#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24514#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:36,828 INFO L290 TraceCheckUtils]: 19: Hoare triple {24504#(<= ~counter~0 4)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {24504#(<= ~counter~0 4)} is VALID [2022-04-28 12:29:36,828 INFO L290 TraceCheckUtils]: 18: Hoare triple {24504#(<= ~counter~0 4)} assume !!(#t~post6 < 10);havoc #t~post6; {24504#(<= ~counter~0 4)} is VALID [2022-04-28 12:29:36,828 INFO L290 TraceCheckUtils]: 17: Hoare triple {24494#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24504#(<= ~counter~0 4)} is VALID [2022-04-28 12:29:36,829 INFO L290 TraceCheckUtils]: 16: Hoare triple {24494#(<= ~counter~0 3)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {24494#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:36,829 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {24414#true} {24494#(<= ~counter~0 3)} #96#return; {24494#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:36,829 INFO L290 TraceCheckUtils]: 14: Hoare triple {24414#true} assume true; {24414#true} is VALID [2022-04-28 12:29:36,829 INFO L290 TraceCheckUtils]: 13: Hoare triple {24414#true} assume !(0 == ~cond); {24414#true} is VALID [2022-04-28 12:29:36,829 INFO L290 TraceCheckUtils]: 12: Hoare triple {24414#true} ~cond := #in~cond; {24414#true} is VALID [2022-04-28 12:29:36,830 INFO L272 TraceCheckUtils]: 11: Hoare triple {24494#(<= ~counter~0 3)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {24414#true} is VALID [2022-04-28 12:29:36,830 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {24414#true} {24494#(<= ~counter~0 3)} #94#return; {24494#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:36,830 INFO L290 TraceCheckUtils]: 9: Hoare triple {24414#true} assume true; {24414#true} is VALID [2022-04-28 12:29:36,830 INFO L290 TraceCheckUtils]: 8: Hoare triple {24414#true} assume !(0 == ~cond); {24414#true} is VALID [2022-04-28 12:29:36,830 INFO L290 TraceCheckUtils]: 7: Hoare triple {24414#true} ~cond := #in~cond; {24414#true} is VALID [2022-04-28 12:29:36,830 INFO L272 TraceCheckUtils]: 6: Hoare triple {24494#(<= ~counter~0 3)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {24414#true} is VALID [2022-04-28 12:29:36,831 INFO L290 TraceCheckUtils]: 5: Hoare triple {24494#(<= ~counter~0 3)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {24494#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:36,831 INFO L272 TraceCheckUtils]: 4: Hoare triple {24494#(<= ~counter~0 3)} call #t~ret9 := main(); {24494#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:36,831 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24494#(<= ~counter~0 3)} {24414#true} #108#return; {24494#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:36,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {24494#(<= ~counter~0 3)} assume true; {24494#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:36,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {24414#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);~counter~0 := 0; {24494#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:36,832 INFO L272 TraceCheckUtils]: 0: Hoare triple {24414#true} call ULTIMATE.init(); {24414#true} is VALID [2022-04-28 12:29:36,832 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 12:29:36,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:29:36,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710926297] [2022-04-28 12:29:36,833 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:29:36,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236341827] [2022-04-28 12:29:36,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236341827] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:29:36,833 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:29:36,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2022-04-28 12:29:36,833 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:29:36,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1444401272] [2022-04-28 12:29:36,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1444401272] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:29:36,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:29:36,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 12:29:36,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524440577] [2022-04-28 12:29:36,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:29:36,834 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 64 [2022-04-28 12:29:36,834 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:29:36,834 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 12:29:36,891 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 12:29:36,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 12:29:36,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:29:36,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 12:29:36,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 12:29:36,892 INFO L87 Difference]: Start difference. First operand 426 states and 598 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 12:29:38,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:38,399 INFO L93 Difference]: Finished difference Result 531 states and 722 transitions. [2022-04-28 12:29:38,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 12:29:38,399 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 64 [2022-04-28 12:29:38,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:29:38,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 12:29:38,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 162 transitions. [2022-04-28 12:29:38,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 12:29:38,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 162 transitions. [2022-04-28 12:29:38,406 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 162 transitions. [2022-04-28 12:29:38,542 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:38,560 INFO L225 Difference]: With dead ends: 531 [2022-04-28 12:29:38,561 INFO L226 Difference]: Without dead ends: 524 [2022-04-28 12:29:38,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=188, Unknown=0, NotChecked=0, Total=306 [2022-04-28 12:29:38,562 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 104 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 12:29:38,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 245 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 12:29:38,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2022-04-28 12:29:39,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 503. [2022-04-28 12:29:39,772 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:29:39,773 INFO L82 GeneralOperation]: Start isEquivalent. First operand 524 states. Second operand has 503 states, 330 states have (on average 1.290909090909091) internal successors, (426), 346 states have internal predecessors, (426), 134 states have call successors, (134), 39 states have call predecessors, (134), 38 states have return successors, (131), 117 states have call predecessors, (131), 131 states have call successors, (131) [2022-04-28 12:29:39,773 INFO L74 IsIncluded]: Start isIncluded. First operand 524 states. Second operand has 503 states, 330 states have (on average 1.290909090909091) internal successors, (426), 346 states have internal predecessors, (426), 134 states have call successors, (134), 39 states have call predecessors, (134), 38 states have return successors, (131), 117 states have call predecessors, (131), 131 states have call successors, (131) [2022-04-28 12:29:39,774 INFO L87 Difference]: Start difference. First operand 524 states. Second operand has 503 states, 330 states have (on average 1.290909090909091) internal successors, (426), 346 states have internal predecessors, (426), 134 states have call successors, (134), 39 states have call predecessors, (134), 38 states have return successors, (131), 117 states have call predecessors, (131), 131 states have call successors, (131) [2022-04-28 12:29:39,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:39,795 INFO L93 Difference]: Finished difference Result 524 states and 713 transitions. [2022-04-28 12:29:39,795 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 713 transitions. [2022-04-28 12:29:39,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:29:39,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:29:39,798 INFO L74 IsIncluded]: Start isIncluded. First operand has 503 states, 330 states have (on average 1.290909090909091) internal successors, (426), 346 states have internal predecessors, (426), 134 states have call successors, (134), 39 states have call predecessors, (134), 38 states have return successors, (131), 117 states have call predecessors, (131), 131 states have call successors, (131) Second operand 524 states. [2022-04-28 12:29:39,798 INFO L87 Difference]: Start difference. First operand has 503 states, 330 states have (on average 1.290909090909091) internal successors, (426), 346 states have internal predecessors, (426), 134 states have call successors, (134), 39 states have call predecessors, (134), 38 states have return successors, (131), 117 states have call predecessors, (131), 131 states have call successors, (131) Second operand 524 states. [2022-04-28 12:29:39,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:39,818 INFO L93 Difference]: Finished difference Result 524 states and 713 transitions. [2022-04-28 12:29:39,818 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 713 transitions. [2022-04-28 12:29:39,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:29:39,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:29:39,820 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:29:39,820 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:29:39,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 330 states have (on average 1.290909090909091) internal successors, (426), 346 states have internal predecessors, (426), 134 states have call successors, (134), 39 states have call predecessors, (134), 38 states have return successors, (131), 117 states have call predecessors, (131), 131 states have call successors, (131) [2022-04-28 12:29:39,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 691 transitions. [2022-04-28 12:29:39,842 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 691 transitions. Word has length 64 [2022-04-28 12:29:39,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:29:39,842 INFO L495 AbstractCegarLoop]: Abstraction has 503 states and 691 transitions. [2022-04-28 12:29:39,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 12:29:39,842 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 503 states and 691 transitions. [2022-04-28 12:29:40,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 691 edges. 691 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:40,841 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 691 transitions. [2022-04-28 12:29:40,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-28 12:29:40,842 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:29:40,842 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 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] [2022-04-28 12:29:40,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-28 12:29:41,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:29:41,047 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:29:41,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:29:41,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1156119236, now seen corresponding path program 1 times [2022-04-28 12:29:41,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:29:41,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2010261330] [2022-04-28 12:29:41,048 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:29:41,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1156119236, now seen corresponding path program 2 times [2022-04-28 12:29:41,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:29:41,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67323215] [2022-04-28 12:29:41,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:29:41,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:29:41,062 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:29:41,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2010485992] [2022-04-28 12:29:41,063 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:29:41,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:29:41,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:29:41,092 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:29:41,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-28 12:29:41,136 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:29:41,136 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:29:41,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 12:29:41,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:29:41,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:29:41,499 INFO L272 TraceCheckUtils]: 0: Hoare triple {27935#true} call ULTIMATE.init(); {27935#true} is VALID [2022-04-28 12:29:41,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {27935#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);~counter~0 := 0; {27935#true} is VALID [2022-04-28 12:29:41,499 INFO L290 TraceCheckUtils]: 2: Hoare triple {27935#true} assume true; {27935#true} is VALID [2022-04-28 12:29:41,500 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27935#true} {27935#true} #108#return; {27935#true} is VALID [2022-04-28 12:29:41,500 INFO L272 TraceCheckUtils]: 4: Hoare triple {27935#true} call #t~ret9 := main(); {27935#true} is VALID [2022-04-28 12:29:41,500 INFO L290 TraceCheckUtils]: 5: Hoare triple {27935#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {27935#true} is VALID [2022-04-28 12:29:41,500 INFO L272 TraceCheckUtils]: 6: Hoare triple {27935#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {27935#true} is VALID [2022-04-28 12:29:41,500 INFO L290 TraceCheckUtils]: 7: Hoare triple {27935#true} ~cond := #in~cond; {27935#true} is VALID [2022-04-28 12:29:41,500 INFO L290 TraceCheckUtils]: 8: Hoare triple {27935#true} assume !(0 == ~cond); {27935#true} is VALID [2022-04-28 12:29:41,500 INFO L290 TraceCheckUtils]: 9: Hoare triple {27935#true} assume true; {27935#true} is VALID [2022-04-28 12:29:41,500 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {27935#true} {27935#true} #94#return; {27935#true} is VALID [2022-04-28 12:29:41,500 INFO L272 TraceCheckUtils]: 11: Hoare triple {27935#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {27935#true} is VALID [2022-04-28 12:29:41,501 INFO L290 TraceCheckUtils]: 12: Hoare triple {27935#true} ~cond := #in~cond; {27976#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 12:29:41,502 INFO L290 TraceCheckUtils]: 13: Hoare triple {27976#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {27980#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:29:41,502 INFO L290 TraceCheckUtils]: 14: Hoare triple {27980#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {27980#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:29:41,503 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {27980#(not (= |assume_abort_if_not_#in~cond| 0))} {27935#true} #96#return; {27987#(<= 1 main_~y~0)} is VALID [2022-04-28 12:29:41,503 INFO L290 TraceCheckUtils]: 16: Hoare triple {27987#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {27991#(<= 1 main_~b~0)} is VALID [2022-04-28 12:29:41,504 INFO L290 TraceCheckUtils]: 17: Hoare triple {27991#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27991#(<= 1 main_~b~0)} is VALID [2022-04-28 12:29:41,504 INFO L290 TraceCheckUtils]: 18: Hoare triple {27991#(<= 1 main_~b~0)} assume !!(#t~post6 < 10);havoc #t~post6; {27991#(<= 1 main_~b~0)} is VALID [2022-04-28 12:29:41,505 INFO L290 TraceCheckUtils]: 19: Hoare triple {27991#(<= 1 main_~b~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {27991#(<= 1 main_~b~0)} is VALID [2022-04-28 12:29:41,505 INFO L290 TraceCheckUtils]: 20: Hoare triple {27991#(<= 1 main_~b~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {27991#(<= 1 main_~b~0)} is VALID [2022-04-28 12:29:41,505 INFO L290 TraceCheckUtils]: 21: Hoare triple {27991#(<= 1 main_~b~0)} assume !!(#t~post7 < 10);havoc #t~post7; {27991#(<= 1 main_~b~0)} is VALID [2022-04-28 12:29:41,506 INFO L290 TraceCheckUtils]: 22: Hoare triple {27991#(<= 1 main_~b~0)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {28010#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} is VALID [2022-04-28 12:29:41,506 INFO L290 TraceCheckUtils]: 23: Hoare triple {28010#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28010#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} is VALID [2022-04-28 12:29:41,507 INFO L290 TraceCheckUtils]: 24: Hoare triple {28010#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} assume !!(#t~post8 < 10);havoc #t~post8; {28010#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} is VALID [2022-04-28 12:29:41,507 INFO L272 TraceCheckUtils]: 25: Hoare triple {28010#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {27935#true} is VALID [2022-04-28 12:29:41,507 INFO L290 TraceCheckUtils]: 26: Hoare triple {27935#true} ~cond := #in~cond; {27935#true} is VALID [2022-04-28 12:29:41,507 INFO L290 TraceCheckUtils]: 27: Hoare triple {27935#true} assume !(0 == ~cond); {27935#true} is VALID [2022-04-28 12:29:41,507 INFO L290 TraceCheckUtils]: 28: Hoare triple {27935#true} assume true; {27935#true} is VALID [2022-04-28 12:29:41,508 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {27935#true} {28010#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} #98#return; {28010#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} is VALID [2022-04-28 12:29:41,508 INFO L272 TraceCheckUtils]: 30: Hoare triple {28010#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {27935#true} is VALID [2022-04-28 12:29:41,508 INFO L290 TraceCheckUtils]: 31: Hoare triple {27935#true} ~cond := #in~cond; {27935#true} is VALID [2022-04-28 12:29:41,508 INFO L290 TraceCheckUtils]: 32: Hoare triple {27935#true} assume !(0 == ~cond); {27935#true} is VALID [2022-04-28 12:29:41,509 INFO L290 TraceCheckUtils]: 33: Hoare triple {27935#true} assume true; {27935#true} is VALID [2022-04-28 12:29:41,509 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {27935#true} {28010#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} #100#return; {28010#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} is VALID [2022-04-28 12:29:41,509 INFO L272 TraceCheckUtils]: 35: Hoare triple {28010#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {27935#true} is VALID [2022-04-28 12:29:41,510 INFO L290 TraceCheckUtils]: 36: Hoare triple {27935#true} ~cond := #in~cond; {27935#true} is VALID [2022-04-28 12:29:41,510 INFO L290 TraceCheckUtils]: 37: Hoare triple {27935#true} assume !(0 == ~cond); {27935#true} is VALID [2022-04-28 12:29:41,510 INFO L290 TraceCheckUtils]: 38: Hoare triple {27935#true} assume true; {27935#true} is VALID [2022-04-28 12:29:41,511 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {27935#true} {28010#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} #102#return; {28010#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} is VALID [2022-04-28 12:29:41,511 INFO L272 TraceCheckUtils]: 40: Hoare triple {28010#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {27935#true} is VALID [2022-04-28 12:29:41,511 INFO L290 TraceCheckUtils]: 41: Hoare triple {27935#true} ~cond := #in~cond; {27935#true} is VALID [2022-04-28 12:29:41,511 INFO L290 TraceCheckUtils]: 42: Hoare triple {27935#true} assume !(0 == ~cond); {27935#true} is VALID [2022-04-28 12:29:41,511 INFO L290 TraceCheckUtils]: 43: Hoare triple {27935#true} assume true; {27935#true} is VALID [2022-04-28 12:29:41,512 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {27935#true} {28010#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} #104#return; {28010#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} is VALID [2022-04-28 12:29:41,512 INFO L290 TraceCheckUtils]: 45: Hoare triple {28010#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {28080#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} is VALID [2022-04-28 12:29:41,513 INFO L290 TraceCheckUtils]: 46: Hoare triple {28080#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28080#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} is VALID [2022-04-28 12:29:41,513 INFO L290 TraceCheckUtils]: 47: Hoare triple {28080#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} assume !!(#t~post8 < 10);havoc #t~post8; {28080#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} is VALID [2022-04-28 12:29:41,513 INFO L272 TraceCheckUtils]: 48: Hoare triple {28080#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {27935#true} is VALID [2022-04-28 12:29:41,513 INFO L290 TraceCheckUtils]: 49: Hoare triple {27935#true} ~cond := #in~cond; {27935#true} is VALID [2022-04-28 12:29:41,514 INFO L290 TraceCheckUtils]: 50: Hoare triple {27935#true} assume !(0 == ~cond); {27935#true} is VALID [2022-04-28 12:29:41,514 INFO L290 TraceCheckUtils]: 51: Hoare triple {27935#true} assume true; {27935#true} is VALID [2022-04-28 12:29:41,514 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {27935#true} {28080#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} #98#return; {28080#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} is VALID [2022-04-28 12:29:41,515 INFO L272 TraceCheckUtils]: 53: Hoare triple {28080#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {27935#true} is VALID [2022-04-28 12:29:41,515 INFO L290 TraceCheckUtils]: 54: Hoare triple {27935#true} ~cond := #in~cond; {27935#true} is VALID [2022-04-28 12:29:41,515 INFO L290 TraceCheckUtils]: 55: Hoare triple {27935#true} assume !(0 == ~cond); {27935#true} is VALID [2022-04-28 12:29:41,515 INFO L290 TraceCheckUtils]: 56: Hoare triple {27935#true} assume true; {27935#true} is VALID [2022-04-28 12:29:41,516 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {27935#true} {28080#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} #100#return; {28080#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} is VALID [2022-04-28 12:29:41,516 INFO L272 TraceCheckUtils]: 58: Hoare triple {28080#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {27935#true} is VALID [2022-04-28 12:29:41,516 INFO L290 TraceCheckUtils]: 59: Hoare triple {27935#true} ~cond := #in~cond; {27935#true} is VALID [2022-04-28 12:29:41,516 INFO L290 TraceCheckUtils]: 60: Hoare triple {27935#true} assume !(0 == ~cond); {27935#true} is VALID [2022-04-28 12:29:41,516 INFO L290 TraceCheckUtils]: 61: Hoare triple {27935#true} assume true; {27935#true} is VALID [2022-04-28 12:29:41,517 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {27935#true} {28080#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} #102#return; {28080#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} is VALID [2022-04-28 12:29:41,518 INFO L272 TraceCheckUtils]: 63: Hoare triple {28080#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {28135#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:29:41,518 INFO L290 TraceCheckUtils]: 64: Hoare triple {28135#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {28139#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:29:41,518 INFO L290 TraceCheckUtils]: 65: Hoare triple {28139#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {27936#false} is VALID [2022-04-28 12:29:41,519 INFO L290 TraceCheckUtils]: 66: Hoare triple {27936#false} assume !false; {27936#false} is VALID [2022-04-28 12:29:41,519 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-04-28 12:29:41,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:29:41,755 INFO L290 TraceCheckUtils]: 66: Hoare triple {27936#false} assume !false; {27936#false} is VALID [2022-04-28 12:29:41,756 INFO L290 TraceCheckUtils]: 65: Hoare triple {28139#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {27936#false} is VALID [2022-04-28 12:29:41,756 INFO L290 TraceCheckUtils]: 64: Hoare triple {28135#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {28139#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:29:41,757 INFO L272 TraceCheckUtils]: 63: Hoare triple {28155#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {28135#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:29:41,757 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {27935#true} {28155#(= main_~v~0 (* main_~d~0 main_~b~0))} #102#return; {28155#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-28 12:29:41,757 INFO L290 TraceCheckUtils]: 61: Hoare triple {27935#true} assume true; {27935#true} is VALID [2022-04-28 12:29:41,757 INFO L290 TraceCheckUtils]: 60: Hoare triple {27935#true} assume !(0 == ~cond); {27935#true} is VALID [2022-04-28 12:29:41,758 INFO L290 TraceCheckUtils]: 59: Hoare triple {27935#true} ~cond := #in~cond; {27935#true} is VALID [2022-04-28 12:29:41,758 INFO L272 TraceCheckUtils]: 58: Hoare triple {28155#(= 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)); {27935#true} is VALID [2022-04-28 12:29:41,758 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {27935#true} {28155#(= main_~v~0 (* main_~d~0 main_~b~0))} #100#return; {28155#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-28 12:29:41,758 INFO L290 TraceCheckUtils]: 56: Hoare triple {27935#true} assume true; {27935#true} is VALID [2022-04-28 12:29:41,758 INFO L290 TraceCheckUtils]: 55: Hoare triple {27935#true} assume !(0 == ~cond); {27935#true} is VALID [2022-04-28 12:29:41,758 INFO L290 TraceCheckUtils]: 54: Hoare triple {27935#true} ~cond := #in~cond; {27935#true} is VALID [2022-04-28 12:29:41,759 INFO L272 TraceCheckUtils]: 53: Hoare triple {28155#(= 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)); {27935#true} is VALID [2022-04-28 12:29:41,759 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {27935#true} {28155#(= main_~v~0 (* main_~d~0 main_~b~0))} #98#return; {28155#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-28 12:29:41,759 INFO L290 TraceCheckUtils]: 51: Hoare triple {27935#true} assume true; {27935#true} is VALID [2022-04-28 12:29:41,759 INFO L290 TraceCheckUtils]: 50: Hoare triple {27935#true} assume !(0 == ~cond); {27935#true} is VALID [2022-04-28 12:29:41,759 INFO L290 TraceCheckUtils]: 49: Hoare triple {27935#true} ~cond := #in~cond; {27935#true} is VALID [2022-04-28 12:29:41,760 INFO L272 TraceCheckUtils]: 48: Hoare triple {28155#(= 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)); {27935#true} is VALID [2022-04-28 12:29:41,760 INFO L290 TraceCheckUtils]: 47: Hoare triple {28155#(= main_~v~0 (* main_~d~0 main_~b~0))} assume !!(#t~post8 < 10);havoc #t~post8; {28155#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-28 12:29:41,760 INFO L290 TraceCheckUtils]: 46: Hoare triple {28155#(= main_~v~0 (* main_~d~0 main_~b~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28155#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-28 12:29:41,762 INFO L290 TraceCheckUtils]: 45: Hoare triple {28155#(= main_~v~0 (* main_~d~0 main_~b~0))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {28155#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-28 12:29:41,763 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {27935#true} {28155#(= main_~v~0 (* main_~d~0 main_~b~0))} #104#return; {28155#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-28 12:29:41,763 INFO L290 TraceCheckUtils]: 43: Hoare triple {27935#true} assume true; {27935#true} is VALID [2022-04-28 12:29:41,763 INFO L290 TraceCheckUtils]: 42: Hoare triple {27935#true} assume !(0 == ~cond); {27935#true} is VALID [2022-04-28 12:29:41,763 INFO L290 TraceCheckUtils]: 41: Hoare triple {27935#true} ~cond := #in~cond; {27935#true} is VALID [2022-04-28 12:29:41,763 INFO L272 TraceCheckUtils]: 40: Hoare triple {28155#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {27935#true} is VALID [2022-04-28 12:29:41,764 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {27935#true} {28155#(= main_~v~0 (* main_~d~0 main_~b~0))} #102#return; {28155#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-28 12:29:41,764 INFO L290 TraceCheckUtils]: 38: Hoare triple {27935#true} assume true; {27935#true} is VALID [2022-04-28 12:29:41,764 INFO L290 TraceCheckUtils]: 37: Hoare triple {27935#true} assume !(0 == ~cond); {27935#true} is VALID [2022-04-28 12:29:41,764 INFO L290 TraceCheckUtils]: 36: Hoare triple {27935#true} ~cond := #in~cond; {27935#true} is VALID [2022-04-28 12:29:41,764 INFO L272 TraceCheckUtils]: 35: Hoare triple {28155#(= 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)); {27935#true} is VALID [2022-04-28 12:29:41,779 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {27935#true} {28155#(= main_~v~0 (* main_~d~0 main_~b~0))} #100#return; {28155#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-28 12:29:41,780 INFO L290 TraceCheckUtils]: 33: Hoare triple {27935#true} assume true; {27935#true} is VALID [2022-04-28 12:29:41,780 INFO L290 TraceCheckUtils]: 32: Hoare triple {27935#true} assume !(0 == ~cond); {27935#true} is VALID [2022-04-28 12:29:41,780 INFO L290 TraceCheckUtils]: 31: Hoare triple {27935#true} ~cond := #in~cond; {27935#true} is VALID [2022-04-28 12:29:41,780 INFO L272 TraceCheckUtils]: 30: Hoare triple {28155#(= 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)); {27935#true} is VALID [2022-04-28 12:29:41,781 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {27935#true} {28155#(= main_~v~0 (* main_~d~0 main_~b~0))} #98#return; {28155#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-28 12:29:41,781 INFO L290 TraceCheckUtils]: 28: Hoare triple {27935#true} assume true; {27935#true} is VALID [2022-04-28 12:29:41,781 INFO L290 TraceCheckUtils]: 27: Hoare triple {27935#true} assume !(0 == ~cond); {27935#true} is VALID [2022-04-28 12:29:41,781 INFO L290 TraceCheckUtils]: 26: Hoare triple {27935#true} ~cond := #in~cond; {27935#true} is VALID [2022-04-28 12:29:41,781 INFO L272 TraceCheckUtils]: 25: Hoare triple {28155#(= 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)); {27935#true} is VALID [2022-04-28 12:29:41,782 INFO L290 TraceCheckUtils]: 24: Hoare triple {28155#(= main_~v~0 (* main_~d~0 main_~b~0))} assume !!(#t~post8 < 10);havoc #t~post8; {28155#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-28 12:29:41,782 INFO L290 TraceCheckUtils]: 23: Hoare triple {28155#(= main_~v~0 (* main_~d~0 main_~b~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28155#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-28 12:29:41,782 INFO L290 TraceCheckUtils]: 22: Hoare triple {27935#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {28155#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-28 12:29:41,783 INFO L290 TraceCheckUtils]: 21: Hoare triple {27935#true} assume !!(#t~post7 < 10);havoc #t~post7; {27935#true} is VALID [2022-04-28 12:29:41,783 INFO L290 TraceCheckUtils]: 20: Hoare triple {27935#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {27935#true} is VALID [2022-04-28 12:29:41,783 INFO L290 TraceCheckUtils]: 19: Hoare triple {27935#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {27935#true} is VALID [2022-04-28 12:29:41,783 INFO L290 TraceCheckUtils]: 18: Hoare triple {27935#true} assume !!(#t~post6 < 10);havoc #t~post6; {27935#true} is VALID [2022-04-28 12:29:41,783 INFO L290 TraceCheckUtils]: 17: Hoare triple {27935#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27935#true} is VALID [2022-04-28 12:29:41,783 INFO L290 TraceCheckUtils]: 16: Hoare triple {27935#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {27935#true} is VALID [2022-04-28 12:29:41,783 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {27935#true} {27935#true} #96#return; {27935#true} is VALID [2022-04-28 12:29:41,783 INFO L290 TraceCheckUtils]: 14: Hoare triple {27935#true} assume true; {27935#true} is VALID [2022-04-28 12:29:41,784 INFO L290 TraceCheckUtils]: 13: Hoare triple {27935#true} assume !(0 == ~cond); {27935#true} is VALID [2022-04-28 12:29:41,784 INFO L290 TraceCheckUtils]: 12: Hoare triple {27935#true} ~cond := #in~cond; {27935#true} is VALID [2022-04-28 12:29:41,784 INFO L272 TraceCheckUtils]: 11: Hoare triple {27935#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {27935#true} is VALID [2022-04-28 12:29:41,784 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {27935#true} {27935#true} #94#return; {27935#true} is VALID [2022-04-28 12:29:41,784 INFO L290 TraceCheckUtils]: 9: Hoare triple {27935#true} assume true; {27935#true} is VALID [2022-04-28 12:29:41,784 INFO L290 TraceCheckUtils]: 8: Hoare triple {27935#true} assume !(0 == ~cond); {27935#true} is VALID [2022-04-28 12:29:41,784 INFO L290 TraceCheckUtils]: 7: Hoare triple {27935#true} ~cond := #in~cond; {27935#true} is VALID [2022-04-28 12:29:41,784 INFO L272 TraceCheckUtils]: 6: Hoare triple {27935#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {27935#true} is VALID [2022-04-28 12:29:41,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {27935#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {27935#true} is VALID [2022-04-28 12:29:41,785 INFO L272 TraceCheckUtils]: 4: Hoare triple {27935#true} call #t~ret9 := main(); {27935#true} is VALID [2022-04-28 12:29:41,785 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27935#true} {27935#true} #108#return; {27935#true} is VALID [2022-04-28 12:29:41,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {27935#true} assume true; {27935#true} is VALID [2022-04-28 12:29:41,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {27935#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);~counter~0 := 0; {27935#true} is VALID [2022-04-28 12:29:41,785 INFO L272 TraceCheckUtils]: 0: Hoare triple {27935#true} call ULTIMATE.init(); {27935#true} is VALID [2022-04-28 12:29:41,785 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-04-28 12:29:41,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:29:41,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67323215] [2022-04-28 12:29:41,786 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:29:41,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010485992] [2022-04-28 12:29:41,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010485992] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 12:29:41,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 12:29:41,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2022-04-28 12:29:41,786 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:29:41,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2010261330] [2022-04-28 12:29:41,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2010261330] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:29:41,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:29:41,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:29:41,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153501551] [2022-04-28 12:29:41,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:29:41,787 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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 67 [2022-04-28 12:29:41,788 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:29:41,788 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 12:29:41,820 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:41,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 12:29:41,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:29:41,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 12:29:41,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-28 12:29:41,820 INFO L87 Difference]: Start difference. First operand 503 states and 691 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 12:29:43,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:43,040 INFO L93 Difference]: Finished difference Result 517 states and 704 transitions. [2022-04-28 12:29:43,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 12:29:43,040 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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 67 [2022-04-28 12:29:43,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:29:43,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 12:29:43,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-04-28 12:29:43,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 12:29:43,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-04-28 12:29:43,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 56 transitions. [2022-04-28 12:29:43,091 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:43,111 INFO L225 Difference]: With dead ends: 517 [2022-04-28 12:29:43,111 INFO L226 Difference]: Without dead ends: 515 [2022-04-28 12:29:43,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 122 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-04-28 12:29:43,113 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 12 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:29:43,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 144 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:29:43,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2022-04-28 12:29:44,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 511. [2022-04-28 12:29:44,190 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:29:44,191 INFO L82 GeneralOperation]: Start isEquivalent. First operand 515 states. Second operand has 511 states, 336 states have (on average 1.2797619047619047) internal successors, (430), 352 states have internal predecessors, (430), 134 states have call successors, (134), 41 states have call predecessors, (134), 40 states have return successors, (131), 117 states have call predecessors, (131), 131 states have call successors, (131) [2022-04-28 12:29:44,192 INFO L74 IsIncluded]: Start isIncluded. First operand 515 states. Second operand has 511 states, 336 states have (on average 1.2797619047619047) internal successors, (430), 352 states have internal predecessors, (430), 134 states have call successors, (134), 41 states have call predecessors, (134), 40 states have return successors, (131), 117 states have call predecessors, (131), 131 states have call successors, (131) [2022-04-28 12:29:44,192 INFO L87 Difference]: Start difference. First operand 515 states. Second operand has 511 states, 336 states have (on average 1.2797619047619047) internal successors, (430), 352 states have internal predecessors, (430), 134 states have call successors, (134), 41 states have call predecessors, (134), 40 states have return successors, (131), 117 states have call predecessors, (131), 131 states have call successors, (131) [2022-04-28 12:29:44,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:44,209 INFO L93 Difference]: Finished difference Result 515 states and 699 transitions. [2022-04-28 12:29:44,209 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 699 transitions. [2022-04-28 12:29:44,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:29:44,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:29:44,211 INFO L74 IsIncluded]: Start isIncluded. First operand has 511 states, 336 states have (on average 1.2797619047619047) internal successors, (430), 352 states have internal predecessors, (430), 134 states have call successors, (134), 41 states have call predecessors, (134), 40 states have return successors, (131), 117 states have call predecessors, (131), 131 states have call successors, (131) Second operand 515 states. [2022-04-28 12:29:44,212 INFO L87 Difference]: Start difference. First operand has 511 states, 336 states have (on average 1.2797619047619047) internal successors, (430), 352 states have internal predecessors, (430), 134 states have call successors, (134), 41 states have call predecessors, (134), 40 states have return successors, (131), 117 states have call predecessors, (131), 131 states have call successors, (131) Second operand 515 states. [2022-04-28 12:29:44,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:44,228 INFO L93 Difference]: Finished difference Result 515 states and 699 transitions. [2022-04-28 12:29:44,228 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 699 transitions. [2022-04-28 12:29:44,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:29:44,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:29:44,230 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:29:44,230 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:29:44,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 336 states have (on average 1.2797619047619047) internal successors, (430), 352 states have internal predecessors, (430), 134 states have call successors, (134), 41 states have call predecessors, (134), 40 states have return successors, (131), 117 states have call predecessors, (131), 131 states have call successors, (131) [2022-04-28 12:29:44,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 695 transitions. [2022-04-28 12:29:44,254 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 695 transitions. Word has length 67 [2022-04-28 12:29:44,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:29:44,254 INFO L495 AbstractCegarLoop]: Abstraction has 511 states and 695 transitions. [2022-04-28 12:29:44,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 12:29:44,254 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 511 states and 695 transitions. [2022-04-28 12:29:45,340 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 695 edges. 695 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:45,340 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 695 transitions. [2022-04-28 12:29:45,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-28 12:29:45,341 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:29:45,341 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:29:45,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-28 12:29:45,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:29:45,563 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:29:45,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:29:45,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1261753774, now seen corresponding path program 3 times [2022-04-28 12:29:45,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:29:45,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2094595303] [2022-04-28 12:29:45,564 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:29:45,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1261753774, now seen corresponding path program 4 times [2022-04-28 12:29:45,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:29:45,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831220380] [2022-04-28 12:29:45,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:29:45,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:29:45,580 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:29:45,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1069914783] [2022-04-28 12:29:45,581 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 12:29:45,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:29:45,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:29:45,582 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:29:45,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-28 12:29:45,625 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 12:29:45,626 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:29:45,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 12:29:45,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:29:45,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:29:45,865 INFO L272 TraceCheckUtils]: 0: Hoare triple {31435#true} call ULTIMATE.init(); {31435#true} is VALID [2022-04-28 12:29:45,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {31435#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);~counter~0 := 0; {31435#true} is VALID [2022-04-28 12:29:45,866 INFO L290 TraceCheckUtils]: 2: Hoare triple {31435#true} assume true; {31435#true} is VALID [2022-04-28 12:29:45,866 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31435#true} {31435#true} #108#return; {31435#true} is VALID [2022-04-28 12:29:45,866 INFO L272 TraceCheckUtils]: 4: Hoare triple {31435#true} call #t~ret9 := main(); {31435#true} is VALID [2022-04-28 12:29:45,866 INFO L290 TraceCheckUtils]: 5: Hoare triple {31435#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {31435#true} is VALID [2022-04-28 12:29:45,866 INFO L272 TraceCheckUtils]: 6: Hoare triple {31435#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {31435#true} is VALID [2022-04-28 12:29:45,866 INFO L290 TraceCheckUtils]: 7: Hoare triple {31435#true} ~cond := #in~cond; {31435#true} is VALID [2022-04-28 12:29:45,866 INFO L290 TraceCheckUtils]: 8: Hoare triple {31435#true} assume !(0 == ~cond); {31435#true} is VALID [2022-04-28 12:29:45,866 INFO L290 TraceCheckUtils]: 9: Hoare triple {31435#true} assume true; {31435#true} is VALID [2022-04-28 12:29:45,867 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {31435#true} {31435#true} #94#return; {31435#true} is VALID [2022-04-28 12:29:45,867 INFO L272 TraceCheckUtils]: 11: Hoare triple {31435#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {31435#true} is VALID [2022-04-28 12:29:45,867 INFO L290 TraceCheckUtils]: 12: Hoare triple {31435#true} ~cond := #in~cond; {31435#true} is VALID [2022-04-28 12:29:45,867 INFO L290 TraceCheckUtils]: 13: Hoare triple {31435#true} assume !(0 == ~cond); {31435#true} is VALID [2022-04-28 12:29:45,867 INFO L290 TraceCheckUtils]: 14: Hoare triple {31435#true} assume true; {31435#true} is VALID [2022-04-28 12:29:45,867 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {31435#true} {31435#true} #96#return; {31435#true} is VALID [2022-04-28 12:29:45,867 INFO L290 TraceCheckUtils]: 16: Hoare triple {31435#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {31435#true} is VALID [2022-04-28 12:29:45,867 INFO L290 TraceCheckUtils]: 17: Hoare triple {31435#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31435#true} is VALID [2022-04-28 12:29:45,867 INFO L290 TraceCheckUtils]: 18: Hoare triple {31435#true} assume !!(#t~post6 < 10);havoc #t~post6; {31435#true} is VALID [2022-04-28 12:29:45,867 INFO L290 TraceCheckUtils]: 19: Hoare triple {31435#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {31435#true} is VALID [2022-04-28 12:29:45,867 INFO L290 TraceCheckUtils]: 20: Hoare triple {31435#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31435#true} is VALID [2022-04-28 12:29:45,868 INFO L290 TraceCheckUtils]: 21: Hoare triple {31435#true} assume !!(#t~post7 < 10);havoc #t~post7; {31435#true} is VALID [2022-04-28 12:29:45,868 INFO L290 TraceCheckUtils]: 22: Hoare triple {31435#true} assume !(~c~0 >= ~b~0); {31506#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-28 12:29:45,868 INFO L290 TraceCheckUtils]: 23: Hoare triple {31506#(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; {31510#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 12:29:45,869 INFO L290 TraceCheckUtils]: 24: Hoare triple {31510#(< main_~b~0 main_~a~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31510#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 12:29:45,869 INFO L290 TraceCheckUtils]: 25: Hoare triple {31510#(< main_~b~0 main_~a~0)} assume !!(#t~post6 < 10);havoc #t~post6; {31510#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 12:29:45,869 INFO L290 TraceCheckUtils]: 26: Hoare triple {31510#(< main_~b~0 main_~a~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {31520#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 12:29:45,869 INFO L290 TraceCheckUtils]: 27: Hoare triple {31520#(< main_~b~0 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31520#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 12:29:45,870 INFO L290 TraceCheckUtils]: 28: Hoare triple {31520#(< main_~b~0 main_~c~0)} assume !!(#t~post7 < 10);havoc #t~post7; {31520#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 12:29:45,870 INFO L290 TraceCheckUtils]: 29: Hoare triple {31520#(< main_~b~0 main_~c~0)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {31530#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 12:29:45,870 INFO L290 TraceCheckUtils]: 30: Hoare triple {31530#(< main_~v~0 main_~c~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {31530#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 12:29:45,871 INFO L290 TraceCheckUtils]: 31: Hoare triple {31530#(< main_~v~0 main_~c~0)} assume !!(#t~post8 < 10);havoc #t~post8; {31530#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 12:29:45,871 INFO L272 TraceCheckUtils]: 32: Hoare triple {31530#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {31435#true} is VALID [2022-04-28 12:29:45,871 INFO L290 TraceCheckUtils]: 33: Hoare triple {31435#true} ~cond := #in~cond; {31435#true} is VALID [2022-04-28 12:29:45,871 INFO L290 TraceCheckUtils]: 34: Hoare triple {31435#true} assume !(0 == ~cond); {31435#true} is VALID [2022-04-28 12:29:45,871 INFO L290 TraceCheckUtils]: 35: Hoare triple {31435#true} assume true; {31435#true} is VALID [2022-04-28 12:29:45,872 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {31435#true} {31530#(< main_~v~0 main_~c~0)} #98#return; {31530#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 12:29:45,872 INFO L272 TraceCheckUtils]: 37: Hoare triple {31530#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {31435#true} is VALID [2022-04-28 12:29:45,872 INFO L290 TraceCheckUtils]: 38: Hoare triple {31435#true} ~cond := #in~cond; {31435#true} is VALID [2022-04-28 12:29:45,872 INFO L290 TraceCheckUtils]: 39: Hoare triple {31435#true} assume !(0 == ~cond); {31435#true} is VALID [2022-04-28 12:29:45,872 INFO L290 TraceCheckUtils]: 40: Hoare triple {31435#true} assume true; {31435#true} is VALID [2022-04-28 12:29:45,887 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {31435#true} {31530#(< main_~v~0 main_~c~0)} #100#return; {31530#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 12:29:45,887 INFO L272 TraceCheckUtils]: 42: Hoare triple {31530#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {31435#true} is VALID [2022-04-28 12:29:45,887 INFO L290 TraceCheckUtils]: 43: Hoare triple {31435#true} ~cond := #in~cond; {31435#true} is VALID [2022-04-28 12:29:45,887 INFO L290 TraceCheckUtils]: 44: Hoare triple {31435#true} assume !(0 == ~cond); {31435#true} is VALID [2022-04-28 12:29:45,888 INFO L290 TraceCheckUtils]: 45: Hoare triple {31435#true} assume true; {31435#true} is VALID [2022-04-28 12:29:45,888 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {31435#true} {31530#(< main_~v~0 main_~c~0)} #102#return; {31530#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 12:29:45,888 INFO L272 TraceCheckUtils]: 47: Hoare triple {31530#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {31435#true} is VALID [2022-04-28 12:29:45,888 INFO L290 TraceCheckUtils]: 48: Hoare triple {31435#true} ~cond := #in~cond; {31435#true} is VALID [2022-04-28 12:29:45,888 INFO L290 TraceCheckUtils]: 49: Hoare triple {31435#true} assume !(0 == ~cond); {31435#true} is VALID [2022-04-28 12:29:45,888 INFO L290 TraceCheckUtils]: 50: Hoare triple {31435#true} assume true; {31435#true} is VALID [2022-04-28 12:29:45,889 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {31435#true} {31530#(< main_~v~0 main_~c~0)} #104#return; {31530#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 12:29:45,889 INFO L290 TraceCheckUtils]: 52: Hoare triple {31530#(< main_~v~0 main_~c~0)} assume !(~c~0 >= 2 * ~v~0); {31530#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 12:29:45,890 INFO L290 TraceCheckUtils]: 53: Hoare triple {31530#(< main_~v~0 main_~c~0)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {31603#(< 0 main_~c~0)} is VALID [2022-04-28 12:29:45,890 INFO L290 TraceCheckUtils]: 54: Hoare triple {31603#(< 0 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31603#(< 0 main_~c~0)} is VALID [2022-04-28 12:29:45,890 INFO L290 TraceCheckUtils]: 55: Hoare triple {31603#(< 0 main_~c~0)} assume !!(#t~post7 < 10);havoc #t~post7; {31603#(< 0 main_~c~0)} is VALID [2022-04-28 12:29:45,891 INFO L290 TraceCheckUtils]: 56: Hoare triple {31603#(< 0 main_~c~0)} assume !(~c~0 >= ~b~0); {31603#(< 0 main_~c~0)} is VALID [2022-04-28 12:29:45,891 INFO L290 TraceCheckUtils]: 57: Hoare triple {31603#(< 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; {31616#(< 0 main_~b~0)} is VALID [2022-04-28 12:29:45,891 INFO L290 TraceCheckUtils]: 58: Hoare triple {31616#(< 0 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31616#(< 0 main_~b~0)} is VALID [2022-04-28 12:29:45,892 INFO L290 TraceCheckUtils]: 59: Hoare triple {31616#(< 0 main_~b~0)} assume !!(#t~post6 < 10);havoc #t~post6; {31616#(< 0 main_~b~0)} is VALID [2022-04-28 12:29:45,892 INFO L290 TraceCheckUtils]: 60: Hoare triple {31616#(< 0 main_~b~0)} assume !(0 != ~b~0); {31436#false} is VALID [2022-04-28 12:29:45,892 INFO L272 TraceCheckUtils]: 61: Hoare triple {31436#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)); {31436#false} is VALID [2022-04-28 12:29:45,892 INFO L290 TraceCheckUtils]: 62: Hoare triple {31436#false} ~cond := #in~cond; {31436#false} is VALID [2022-04-28 12:29:45,892 INFO L290 TraceCheckUtils]: 63: Hoare triple {31436#false} assume 0 == ~cond; {31436#false} is VALID [2022-04-28 12:29:45,892 INFO L290 TraceCheckUtils]: 64: Hoare triple {31436#false} assume !false; {31436#false} is VALID [2022-04-28 12:29:45,893 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 12:29:45,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:29:46,113 INFO L290 TraceCheckUtils]: 64: Hoare triple {31436#false} assume !false; {31436#false} is VALID [2022-04-28 12:29:46,113 INFO L290 TraceCheckUtils]: 63: Hoare triple {31436#false} assume 0 == ~cond; {31436#false} is VALID [2022-04-28 12:29:46,113 INFO L290 TraceCheckUtils]: 62: Hoare triple {31436#false} ~cond := #in~cond; {31436#false} is VALID [2022-04-28 12:29:46,113 INFO L272 TraceCheckUtils]: 61: Hoare triple {31436#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)); {31436#false} is VALID [2022-04-28 12:29:46,114 INFO L290 TraceCheckUtils]: 60: Hoare triple {31616#(< 0 main_~b~0)} assume !(0 != ~b~0); {31436#false} is VALID [2022-04-28 12:29:46,114 INFO L290 TraceCheckUtils]: 59: Hoare triple {31616#(< 0 main_~b~0)} assume !!(#t~post6 < 10);havoc #t~post6; {31616#(< 0 main_~b~0)} is VALID [2022-04-28 12:29:46,114 INFO L290 TraceCheckUtils]: 58: Hoare triple {31616#(< 0 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31616#(< 0 main_~b~0)} is VALID [2022-04-28 12:29:46,115 INFO L290 TraceCheckUtils]: 57: Hoare triple {31603#(< 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; {31616#(< 0 main_~b~0)} is VALID [2022-04-28 12:29:46,115 INFO L290 TraceCheckUtils]: 56: Hoare triple {31603#(< 0 main_~c~0)} assume !(~c~0 >= ~b~0); {31603#(< 0 main_~c~0)} is VALID [2022-04-28 12:29:46,115 INFO L290 TraceCheckUtils]: 55: Hoare triple {31603#(< 0 main_~c~0)} assume !!(#t~post7 < 10);havoc #t~post7; {31603#(< 0 main_~c~0)} is VALID [2022-04-28 12:29:46,116 INFO L290 TraceCheckUtils]: 54: Hoare triple {31603#(< 0 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31603#(< 0 main_~c~0)} is VALID [2022-04-28 12:29:46,116 INFO L290 TraceCheckUtils]: 53: Hoare triple {31530#(< main_~v~0 main_~c~0)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {31603#(< 0 main_~c~0)} is VALID [2022-04-28 12:29:46,116 INFO L290 TraceCheckUtils]: 52: Hoare triple {31530#(< main_~v~0 main_~c~0)} assume !(~c~0 >= 2 * ~v~0); {31530#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 12:29:46,117 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {31435#true} {31530#(< main_~v~0 main_~c~0)} #104#return; {31530#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 12:29:46,117 INFO L290 TraceCheckUtils]: 50: Hoare triple {31435#true} assume true; {31435#true} is VALID [2022-04-28 12:29:46,117 INFO L290 TraceCheckUtils]: 49: Hoare triple {31435#true} assume !(0 == ~cond); {31435#true} is VALID [2022-04-28 12:29:46,117 INFO L290 TraceCheckUtils]: 48: Hoare triple {31435#true} ~cond := #in~cond; {31435#true} is VALID [2022-04-28 12:29:46,117 INFO L272 TraceCheckUtils]: 47: Hoare triple {31530#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {31435#true} is VALID [2022-04-28 12:29:46,118 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {31435#true} {31530#(< main_~v~0 main_~c~0)} #102#return; {31530#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 12:29:46,118 INFO L290 TraceCheckUtils]: 45: Hoare triple {31435#true} assume true; {31435#true} is VALID [2022-04-28 12:29:46,118 INFO L290 TraceCheckUtils]: 44: Hoare triple {31435#true} assume !(0 == ~cond); {31435#true} is VALID [2022-04-28 12:29:46,118 INFO L290 TraceCheckUtils]: 43: Hoare triple {31435#true} ~cond := #in~cond; {31435#true} is VALID [2022-04-28 12:29:46,118 INFO L272 TraceCheckUtils]: 42: Hoare triple {31530#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {31435#true} is VALID [2022-04-28 12:29:46,119 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {31435#true} {31530#(< main_~v~0 main_~c~0)} #100#return; {31530#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 12:29:46,119 INFO L290 TraceCheckUtils]: 40: Hoare triple {31435#true} assume true; {31435#true} is VALID [2022-04-28 12:29:46,119 INFO L290 TraceCheckUtils]: 39: Hoare triple {31435#true} assume !(0 == ~cond); {31435#true} is VALID [2022-04-28 12:29:46,119 INFO L290 TraceCheckUtils]: 38: Hoare triple {31435#true} ~cond := #in~cond; {31435#true} is VALID [2022-04-28 12:29:46,119 INFO L272 TraceCheckUtils]: 37: Hoare triple {31530#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {31435#true} is VALID [2022-04-28 12:29:46,120 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {31435#true} {31530#(< main_~v~0 main_~c~0)} #98#return; {31530#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 12:29:46,120 INFO L290 TraceCheckUtils]: 35: Hoare triple {31435#true} assume true; {31435#true} is VALID [2022-04-28 12:29:46,120 INFO L290 TraceCheckUtils]: 34: Hoare triple {31435#true} assume !(0 == ~cond); {31435#true} is VALID [2022-04-28 12:29:46,120 INFO L290 TraceCheckUtils]: 33: Hoare triple {31435#true} ~cond := #in~cond; {31435#true} is VALID [2022-04-28 12:29:46,120 INFO L272 TraceCheckUtils]: 32: Hoare triple {31530#(< main_~v~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {31435#true} is VALID [2022-04-28 12:29:46,120 INFO L290 TraceCheckUtils]: 31: Hoare triple {31530#(< main_~v~0 main_~c~0)} assume !!(#t~post8 < 10);havoc #t~post8; {31530#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 12:29:46,121 INFO L290 TraceCheckUtils]: 30: Hoare triple {31530#(< main_~v~0 main_~c~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {31530#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 12:29:46,121 INFO L290 TraceCheckUtils]: 29: Hoare triple {31520#(< main_~b~0 main_~c~0)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {31530#(< main_~v~0 main_~c~0)} is VALID [2022-04-28 12:29:46,121 INFO L290 TraceCheckUtils]: 28: Hoare triple {31520#(< main_~b~0 main_~c~0)} assume !!(#t~post7 < 10);havoc #t~post7; {31520#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 12:29:46,126 INFO L290 TraceCheckUtils]: 27: Hoare triple {31520#(< main_~b~0 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31520#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 12:29:46,126 INFO L290 TraceCheckUtils]: 26: Hoare triple {31510#(< main_~b~0 main_~a~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {31520#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 12:29:46,127 INFO L290 TraceCheckUtils]: 25: Hoare triple {31510#(< main_~b~0 main_~a~0)} assume !!(#t~post6 < 10);havoc #t~post6; {31510#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 12:29:46,127 INFO L290 TraceCheckUtils]: 24: Hoare triple {31510#(< main_~b~0 main_~a~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31510#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 12:29:46,127 INFO L290 TraceCheckUtils]: 23: Hoare triple {31506#(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; {31510#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 12:29:46,128 INFO L290 TraceCheckUtils]: 22: Hoare triple {31435#true} assume !(~c~0 >= ~b~0); {31506#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-28 12:29:46,128 INFO L290 TraceCheckUtils]: 21: Hoare triple {31435#true} assume !!(#t~post7 < 10);havoc #t~post7; {31435#true} is VALID [2022-04-28 12:29:46,128 INFO L290 TraceCheckUtils]: 20: Hoare triple {31435#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31435#true} is VALID [2022-04-28 12:29:46,128 INFO L290 TraceCheckUtils]: 19: Hoare triple {31435#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {31435#true} is VALID [2022-04-28 12:29:46,128 INFO L290 TraceCheckUtils]: 18: Hoare triple {31435#true} assume !!(#t~post6 < 10);havoc #t~post6; {31435#true} is VALID [2022-04-28 12:29:46,128 INFO L290 TraceCheckUtils]: 17: Hoare triple {31435#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31435#true} is VALID [2022-04-28 12:29:46,128 INFO L290 TraceCheckUtils]: 16: Hoare triple {31435#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {31435#true} is VALID [2022-04-28 12:29:46,128 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {31435#true} {31435#true} #96#return; {31435#true} is VALID [2022-04-28 12:29:46,128 INFO L290 TraceCheckUtils]: 14: Hoare triple {31435#true} assume true; {31435#true} is VALID [2022-04-28 12:29:46,129 INFO L290 TraceCheckUtils]: 13: Hoare triple {31435#true} assume !(0 == ~cond); {31435#true} is VALID [2022-04-28 12:29:46,129 INFO L290 TraceCheckUtils]: 12: Hoare triple {31435#true} ~cond := #in~cond; {31435#true} is VALID [2022-04-28 12:29:46,129 INFO L272 TraceCheckUtils]: 11: Hoare triple {31435#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {31435#true} is VALID [2022-04-28 12:29:46,129 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {31435#true} {31435#true} #94#return; {31435#true} is VALID [2022-04-28 12:29:46,129 INFO L290 TraceCheckUtils]: 9: Hoare triple {31435#true} assume true; {31435#true} is VALID [2022-04-28 12:29:46,129 INFO L290 TraceCheckUtils]: 8: Hoare triple {31435#true} assume !(0 == ~cond); {31435#true} is VALID [2022-04-28 12:29:46,129 INFO L290 TraceCheckUtils]: 7: Hoare triple {31435#true} ~cond := #in~cond; {31435#true} is VALID [2022-04-28 12:29:46,129 INFO L272 TraceCheckUtils]: 6: Hoare triple {31435#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {31435#true} is VALID [2022-04-28 12:29:46,129 INFO L290 TraceCheckUtils]: 5: Hoare triple {31435#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {31435#true} is VALID [2022-04-28 12:29:46,129 INFO L272 TraceCheckUtils]: 4: Hoare triple {31435#true} call #t~ret9 := main(); {31435#true} is VALID [2022-04-28 12:29:46,129 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31435#true} {31435#true} #108#return; {31435#true} is VALID [2022-04-28 12:29:46,129 INFO L290 TraceCheckUtils]: 2: Hoare triple {31435#true} assume true; {31435#true} is VALID [2022-04-28 12:29:46,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {31435#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);~counter~0 := 0; {31435#true} is VALID [2022-04-28 12:29:46,130 INFO L272 TraceCheckUtils]: 0: Hoare triple {31435#true} call ULTIMATE.init(); {31435#true} is VALID [2022-04-28 12:29:46,130 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 12:29:46,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:29:46,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831220380] [2022-04-28 12:29:46,130 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:29:46,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069914783] [2022-04-28 12:29:46,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069914783] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:29:46,130 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:29:46,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-04-28 12:29:46,131 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:29:46,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2094595303] [2022-04-28 12:29:46,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2094595303] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:29:46,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:29:46,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 12:29:46,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911994348] [2022-04-28 12:29:46,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:29:46,132 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 3 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 65 [2022-04-28 12:29:46,132 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:29:46,132 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 12:29:46,170 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:46,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 12:29:46,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:29:46,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 12:29:46,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-28 12:29:46,171 INFO L87 Difference]: Start difference. First operand 511 states and 695 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 12:29:49,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:49,664 INFO L93 Difference]: Finished difference Result 857 states and 1271 transitions. [2022-04-28 12:29:49,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 12:29:49,664 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 3 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 65 [2022-04-28 12:29:49,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:29:49,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 12:29:49,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 227 transitions. [2022-04-28 12:29:49,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 12:29:49,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 227 transitions. [2022-04-28 12:29:49,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 227 transitions. [2022-04-28 12:29:49,914 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 227 edges. 227 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:49,965 INFO L225 Difference]: With dead ends: 857 [2022-04-28 12:29:49,966 INFO L226 Difference]: Without dead ends: 850 [2022-04-28 12:29:49,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 127 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2022-04-28 12:29:49,967 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 81 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 12:29:49,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 452 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 12:29:49,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2022-04-28 12:29:51,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 567. [2022-04-28 12:29:51,295 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:29:51,296 INFO L82 GeneralOperation]: Start isEquivalent. First operand 850 states. Second operand has 567 states, 380 states have (on average 1.3) internal successors, (494), 395 states have internal predecessors, (494), 146 states have call successors, (146), 41 states have call predecessors, (146), 40 states have return successors, (143), 130 states have call predecessors, (143), 143 states have call successors, (143) [2022-04-28 12:29:51,297 INFO L74 IsIncluded]: Start isIncluded. First operand 850 states. Second operand has 567 states, 380 states have (on average 1.3) internal successors, (494), 395 states have internal predecessors, (494), 146 states have call successors, (146), 41 states have call predecessors, (146), 40 states have return successors, (143), 130 states have call predecessors, (143), 143 states have call successors, (143) [2022-04-28 12:29:51,297 INFO L87 Difference]: Start difference. First operand 850 states. Second operand has 567 states, 380 states have (on average 1.3) internal successors, (494), 395 states have internal predecessors, (494), 146 states have call successors, (146), 41 states have call predecessors, (146), 40 states have return successors, (143), 130 states have call predecessors, (143), 143 states have call successors, (143) [2022-04-28 12:29:51,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:51,348 INFO L93 Difference]: Finished difference Result 850 states and 1261 transitions. [2022-04-28 12:29:51,348 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1261 transitions. [2022-04-28 12:29:51,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:29:51,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:29:51,352 INFO L74 IsIncluded]: Start isIncluded. First operand has 567 states, 380 states have (on average 1.3) internal successors, (494), 395 states have internal predecessors, (494), 146 states have call successors, (146), 41 states have call predecessors, (146), 40 states have return successors, (143), 130 states have call predecessors, (143), 143 states have call successors, (143) Second operand 850 states. [2022-04-28 12:29:51,353 INFO L87 Difference]: Start difference. First operand has 567 states, 380 states have (on average 1.3) internal successors, (494), 395 states have internal predecessors, (494), 146 states have call successors, (146), 41 states have call predecessors, (146), 40 states have return successors, (143), 130 states have call predecessors, (143), 143 states have call successors, (143) Second operand 850 states. [2022-04-28 12:29:51,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:51,404 INFO L93 Difference]: Finished difference Result 850 states and 1261 transitions. [2022-04-28 12:29:51,404 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1261 transitions. [2022-04-28 12:29:51,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:29:51,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:29:51,407 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:29:51,407 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:29:51,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 380 states have (on average 1.3) internal successors, (494), 395 states have internal predecessors, (494), 146 states have call successors, (146), 41 states have call predecessors, (146), 40 states have return successors, (143), 130 states have call predecessors, (143), 143 states have call successors, (143) [2022-04-28 12:29:51,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 783 transitions. [2022-04-28 12:29:51,437 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 783 transitions. Word has length 65 [2022-04-28 12:29:51,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:29:51,437 INFO L495 AbstractCegarLoop]: Abstraction has 567 states and 783 transitions. [2022-04-28 12:29:51,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 12:29:51,437 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 567 states and 783 transitions. [2022-04-28 12:29:52,631 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 783 edges. 783 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:52,632 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 783 transitions. [2022-04-28 12:29:52,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-28 12:29:52,632 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:29:52,633 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 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, 1, 1, 1] [2022-04-28 12:29:52,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-28 12:29:52,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-04-28 12:29:52,835 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:29:52,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:29:52,836 INFO L85 PathProgramCache]: Analyzing trace with hash 365174246, now seen corresponding path program 1 times [2022-04-28 12:29:52,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:29:52,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [532127289] [2022-04-28 12:29:52,836 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:29:52,836 INFO L85 PathProgramCache]: Analyzing trace with hash 365174246, now seen corresponding path program 2 times [2022-04-28 12:29:52,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:29:52,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106114656] [2022-04-28 12:29:52,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:29:52,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:29:52,847 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:29:52,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1095750544] [2022-04-28 12:29:52,847 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:29:52,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:29:52,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:29:52,849 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:29:52,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-28 12:29:52,912 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:29:52,913 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:29:52,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 12:29:52,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:29:52,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:29:53,219 INFO L272 TraceCheckUtils]: 0: Hoare triple {36412#true} call ULTIMATE.init(); {36412#true} is VALID [2022-04-28 12:29:53,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {36412#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);~counter~0 := 0; {36420#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:53,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {36420#(<= ~counter~0 0)} assume true; {36420#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:53,220 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36420#(<= ~counter~0 0)} {36412#true} #108#return; {36420#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:53,220 INFO L272 TraceCheckUtils]: 4: Hoare triple {36420#(<= ~counter~0 0)} call #t~ret9 := main(); {36420#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:53,221 INFO L290 TraceCheckUtils]: 5: Hoare triple {36420#(<= ~counter~0 0)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {36420#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:53,221 INFO L272 TraceCheckUtils]: 6: Hoare triple {36420#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {36420#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:53,221 INFO L290 TraceCheckUtils]: 7: Hoare triple {36420#(<= ~counter~0 0)} ~cond := #in~cond; {36420#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:53,222 INFO L290 TraceCheckUtils]: 8: Hoare triple {36420#(<= ~counter~0 0)} assume !(0 == ~cond); {36420#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:53,222 INFO L290 TraceCheckUtils]: 9: Hoare triple {36420#(<= ~counter~0 0)} assume true; {36420#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:53,222 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36420#(<= ~counter~0 0)} {36420#(<= ~counter~0 0)} #94#return; {36420#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:53,223 INFO L272 TraceCheckUtils]: 11: Hoare triple {36420#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {36420#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:53,223 INFO L290 TraceCheckUtils]: 12: Hoare triple {36420#(<= ~counter~0 0)} ~cond := #in~cond; {36420#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:53,223 INFO L290 TraceCheckUtils]: 13: Hoare triple {36420#(<= ~counter~0 0)} assume !(0 == ~cond); {36420#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:53,224 INFO L290 TraceCheckUtils]: 14: Hoare triple {36420#(<= ~counter~0 0)} assume true; {36420#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:53,224 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {36420#(<= ~counter~0 0)} {36420#(<= ~counter~0 0)} #96#return; {36420#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:53,224 INFO L290 TraceCheckUtils]: 16: Hoare triple {36420#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {36420#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:53,225 INFO L290 TraceCheckUtils]: 17: Hoare triple {36420#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36469#(<= ~counter~0 1)} is VALID [2022-04-28 12:29:53,225 INFO L290 TraceCheckUtils]: 18: Hoare triple {36469#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {36469#(<= ~counter~0 1)} is VALID [2022-04-28 12:29:53,226 INFO L290 TraceCheckUtils]: 19: Hoare triple {36469#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {36469#(<= ~counter~0 1)} is VALID [2022-04-28 12:29:53,226 INFO L290 TraceCheckUtils]: 20: Hoare triple {36469#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {36479#(<= ~counter~0 2)} is VALID [2022-04-28 12:29:53,227 INFO L290 TraceCheckUtils]: 21: Hoare triple {36479#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {36479#(<= ~counter~0 2)} is VALID [2022-04-28 12:29:53,227 INFO L290 TraceCheckUtils]: 22: Hoare triple {36479#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {36479#(<= ~counter~0 2)} is VALID [2022-04-28 12:29:53,227 INFO L290 TraceCheckUtils]: 23: Hoare triple {36479#(<= ~counter~0 2)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {36479#(<= ~counter~0 2)} is VALID [2022-04-28 12:29:53,228 INFO L290 TraceCheckUtils]: 24: Hoare triple {36479#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36492#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:53,228 INFO L290 TraceCheckUtils]: 25: Hoare triple {36492#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {36492#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:53,228 INFO L290 TraceCheckUtils]: 26: Hoare triple {36492#(<= ~counter~0 3)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {36492#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:53,229 INFO L290 TraceCheckUtils]: 27: Hoare triple {36492#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {36502#(<= ~counter~0 4)} is VALID [2022-04-28 12:29:53,229 INFO L290 TraceCheckUtils]: 28: Hoare triple {36502#(<= ~counter~0 4)} assume !!(#t~post7 < 10);havoc #t~post7; {36502#(<= ~counter~0 4)} is VALID [2022-04-28 12:29:53,230 INFO L290 TraceCheckUtils]: 29: Hoare triple {36502#(<= ~counter~0 4)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {36502#(<= ~counter~0 4)} is VALID [2022-04-28 12:29:53,230 INFO L290 TraceCheckUtils]: 30: Hoare triple {36502#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {36512#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:53,230 INFO L290 TraceCheckUtils]: 31: Hoare triple {36512#(<= ~counter~0 5)} assume !!(#t~post8 < 10);havoc #t~post8; {36512#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:53,231 INFO L272 TraceCheckUtils]: 32: Hoare triple {36512#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {36512#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:53,231 INFO L290 TraceCheckUtils]: 33: Hoare triple {36512#(<= ~counter~0 5)} ~cond := #in~cond; {36512#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:53,232 INFO L290 TraceCheckUtils]: 34: Hoare triple {36512#(<= ~counter~0 5)} assume !(0 == ~cond); {36512#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:53,232 INFO L290 TraceCheckUtils]: 35: Hoare triple {36512#(<= ~counter~0 5)} assume true; {36512#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:53,232 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {36512#(<= ~counter~0 5)} {36512#(<= ~counter~0 5)} #98#return; {36512#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:53,233 INFO L272 TraceCheckUtils]: 37: Hoare triple {36512#(<= ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {36512#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:53,233 INFO L290 TraceCheckUtils]: 38: Hoare triple {36512#(<= ~counter~0 5)} ~cond := #in~cond; {36512#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:53,234 INFO L290 TraceCheckUtils]: 39: Hoare triple {36512#(<= ~counter~0 5)} assume !(0 == ~cond); {36512#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:53,234 INFO L290 TraceCheckUtils]: 40: Hoare triple {36512#(<= ~counter~0 5)} assume true; {36512#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:53,234 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {36512#(<= ~counter~0 5)} {36512#(<= ~counter~0 5)} #100#return; {36512#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:53,235 INFO L272 TraceCheckUtils]: 42: Hoare triple {36512#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {36512#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:53,235 INFO L290 TraceCheckUtils]: 43: Hoare triple {36512#(<= ~counter~0 5)} ~cond := #in~cond; {36512#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:53,236 INFO L290 TraceCheckUtils]: 44: Hoare triple {36512#(<= ~counter~0 5)} assume !(0 == ~cond); {36512#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:53,236 INFO L290 TraceCheckUtils]: 45: Hoare triple {36512#(<= ~counter~0 5)} assume true; {36512#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:53,236 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {36512#(<= ~counter~0 5)} {36512#(<= ~counter~0 5)} #102#return; {36512#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:53,237 INFO L272 TraceCheckUtils]: 47: Hoare triple {36512#(<= ~counter~0 5)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {36512#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:53,237 INFO L290 TraceCheckUtils]: 48: Hoare triple {36512#(<= ~counter~0 5)} ~cond := #in~cond; {36512#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:53,237 INFO L290 TraceCheckUtils]: 49: Hoare triple {36512#(<= ~counter~0 5)} assume !(0 == ~cond); {36512#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:53,238 INFO L290 TraceCheckUtils]: 50: Hoare triple {36512#(<= ~counter~0 5)} assume true; {36512#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:53,238 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {36512#(<= ~counter~0 5)} {36512#(<= ~counter~0 5)} #104#return; {36512#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:53,239 INFO L290 TraceCheckUtils]: 52: Hoare triple {36512#(<= ~counter~0 5)} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {36512#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:53,239 INFO L290 TraceCheckUtils]: 53: Hoare triple {36512#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {36582#(<= |main_#t~post8| 5)} is VALID [2022-04-28 12:29:53,239 INFO L290 TraceCheckUtils]: 54: Hoare triple {36582#(<= |main_#t~post8| 5)} assume !(#t~post8 < 10);havoc #t~post8; {36413#false} is VALID [2022-04-28 12:29:53,239 INFO L290 TraceCheckUtils]: 55: Hoare triple {36413#false} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {36413#false} is VALID [2022-04-28 12:29:53,239 INFO L290 TraceCheckUtils]: 56: Hoare triple {36413#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {36413#false} is VALID [2022-04-28 12:29:53,240 INFO L290 TraceCheckUtils]: 57: Hoare triple {36413#false} assume !(#t~post7 < 10);havoc #t~post7; {36413#false} is VALID [2022-04-28 12:29:53,240 INFO L290 TraceCheckUtils]: 58: Hoare triple {36413#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; {36413#false} is VALID [2022-04-28 12:29:53,240 INFO L290 TraceCheckUtils]: 59: Hoare triple {36413#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36413#false} is VALID [2022-04-28 12:29:53,240 INFO L290 TraceCheckUtils]: 60: Hoare triple {36413#false} assume !(#t~post6 < 10);havoc #t~post6; {36413#false} is VALID [2022-04-28 12:29:53,240 INFO L272 TraceCheckUtils]: 61: Hoare triple {36413#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)); {36413#false} is VALID [2022-04-28 12:29:53,240 INFO L290 TraceCheckUtils]: 62: Hoare triple {36413#false} ~cond := #in~cond; {36413#false} is VALID [2022-04-28 12:29:53,240 INFO L290 TraceCheckUtils]: 63: Hoare triple {36413#false} assume 0 == ~cond; {36413#false} is VALID [2022-04-28 12:29:53,240 INFO L290 TraceCheckUtils]: 64: Hoare triple {36413#false} assume !false; {36413#false} is VALID [2022-04-28 12:29:53,240 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 12:29:53,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:29:53,545 INFO L290 TraceCheckUtils]: 64: Hoare triple {36413#false} assume !false; {36413#false} is VALID [2022-04-28 12:29:53,545 INFO L290 TraceCheckUtils]: 63: Hoare triple {36413#false} assume 0 == ~cond; {36413#false} is VALID [2022-04-28 12:29:53,546 INFO L290 TraceCheckUtils]: 62: Hoare triple {36413#false} ~cond := #in~cond; {36413#false} is VALID [2022-04-28 12:29:53,546 INFO L272 TraceCheckUtils]: 61: Hoare triple {36413#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)); {36413#false} is VALID [2022-04-28 12:29:53,546 INFO L290 TraceCheckUtils]: 60: Hoare triple {36413#false} assume !(#t~post6 < 10);havoc #t~post6; {36413#false} is VALID [2022-04-28 12:29:53,546 INFO L290 TraceCheckUtils]: 59: Hoare triple {36413#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36413#false} is VALID [2022-04-28 12:29:53,546 INFO L290 TraceCheckUtils]: 58: Hoare triple {36413#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; {36413#false} is VALID [2022-04-28 12:29:53,546 INFO L290 TraceCheckUtils]: 57: Hoare triple {36413#false} assume !(#t~post7 < 10);havoc #t~post7; {36413#false} is VALID [2022-04-28 12:29:53,546 INFO L290 TraceCheckUtils]: 56: Hoare triple {36413#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {36413#false} is VALID [2022-04-28 12:29:53,546 INFO L290 TraceCheckUtils]: 55: Hoare triple {36413#false} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {36413#false} is VALID [2022-04-28 12:29:53,546 INFO L290 TraceCheckUtils]: 54: Hoare triple {36646#(< |main_#t~post8| 10)} assume !(#t~post8 < 10);havoc #t~post8; {36413#false} is VALID [2022-04-28 12:29:53,547 INFO L290 TraceCheckUtils]: 53: Hoare triple {36650#(< ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {36646#(< |main_#t~post8| 10)} is VALID [2022-04-28 12:29:53,547 INFO L290 TraceCheckUtils]: 52: Hoare triple {36650#(< ~counter~0 10)} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {36650#(< ~counter~0 10)} is VALID [2022-04-28 12:29:53,548 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {36412#true} {36650#(< ~counter~0 10)} #104#return; {36650#(< ~counter~0 10)} is VALID [2022-04-28 12:29:53,548 INFO L290 TraceCheckUtils]: 50: Hoare triple {36412#true} assume true; {36412#true} is VALID [2022-04-28 12:29:53,548 INFO L290 TraceCheckUtils]: 49: Hoare triple {36412#true} assume !(0 == ~cond); {36412#true} is VALID [2022-04-28 12:29:53,548 INFO L290 TraceCheckUtils]: 48: Hoare triple {36412#true} ~cond := #in~cond; {36412#true} is VALID [2022-04-28 12:29:53,548 INFO L272 TraceCheckUtils]: 47: Hoare triple {36650#(< ~counter~0 10)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {36412#true} is VALID [2022-04-28 12:29:53,548 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {36412#true} {36650#(< ~counter~0 10)} #102#return; {36650#(< ~counter~0 10)} is VALID [2022-04-28 12:29:53,549 INFO L290 TraceCheckUtils]: 45: Hoare triple {36412#true} assume true; {36412#true} is VALID [2022-04-28 12:29:53,549 INFO L290 TraceCheckUtils]: 44: Hoare triple {36412#true} assume !(0 == ~cond); {36412#true} is VALID [2022-04-28 12:29:53,549 INFO L290 TraceCheckUtils]: 43: Hoare triple {36412#true} ~cond := #in~cond; {36412#true} is VALID [2022-04-28 12:29:53,549 INFO L272 TraceCheckUtils]: 42: Hoare triple {36650#(< ~counter~0 10)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {36412#true} is VALID [2022-04-28 12:29:53,549 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {36412#true} {36650#(< ~counter~0 10)} #100#return; {36650#(< ~counter~0 10)} is VALID [2022-04-28 12:29:53,549 INFO L290 TraceCheckUtils]: 40: Hoare triple {36412#true} assume true; {36412#true} is VALID [2022-04-28 12:29:53,550 INFO L290 TraceCheckUtils]: 39: Hoare triple {36412#true} assume !(0 == ~cond); {36412#true} is VALID [2022-04-28 12:29:53,550 INFO L290 TraceCheckUtils]: 38: Hoare triple {36412#true} ~cond := #in~cond; {36412#true} is VALID [2022-04-28 12:29:53,550 INFO L272 TraceCheckUtils]: 37: Hoare triple {36650#(< ~counter~0 10)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {36412#true} is VALID [2022-04-28 12:29:53,550 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {36412#true} {36650#(< ~counter~0 10)} #98#return; {36650#(< ~counter~0 10)} is VALID [2022-04-28 12:29:53,550 INFO L290 TraceCheckUtils]: 35: Hoare triple {36412#true} assume true; {36412#true} is VALID [2022-04-28 12:29:53,550 INFO L290 TraceCheckUtils]: 34: Hoare triple {36412#true} assume !(0 == ~cond); {36412#true} is VALID [2022-04-28 12:29:53,550 INFO L290 TraceCheckUtils]: 33: Hoare triple {36412#true} ~cond := #in~cond; {36412#true} is VALID [2022-04-28 12:29:53,551 INFO L272 TraceCheckUtils]: 32: Hoare triple {36650#(< ~counter~0 10)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {36412#true} is VALID [2022-04-28 12:29:53,551 INFO L290 TraceCheckUtils]: 31: Hoare triple {36650#(< ~counter~0 10)} assume !!(#t~post8 < 10);havoc #t~post8; {36650#(< ~counter~0 10)} is VALID [2022-04-28 12:29:53,552 INFO L290 TraceCheckUtils]: 30: Hoare triple {36720#(< ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {36650#(< ~counter~0 10)} is VALID [2022-04-28 12:29:53,552 INFO L290 TraceCheckUtils]: 29: Hoare triple {36720#(< ~counter~0 9)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {36720#(< ~counter~0 9)} is VALID [2022-04-28 12:29:53,552 INFO L290 TraceCheckUtils]: 28: Hoare triple {36720#(< ~counter~0 9)} assume !!(#t~post7 < 10);havoc #t~post7; {36720#(< ~counter~0 9)} is VALID [2022-04-28 12:29:53,553 INFO L290 TraceCheckUtils]: 27: Hoare triple {36730#(< ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {36720#(< ~counter~0 9)} is VALID [2022-04-28 12:29:53,553 INFO L290 TraceCheckUtils]: 26: Hoare triple {36730#(< ~counter~0 8)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {36730#(< ~counter~0 8)} is VALID [2022-04-28 12:29:53,554 INFO L290 TraceCheckUtils]: 25: Hoare triple {36730#(< ~counter~0 8)} assume !!(#t~post6 < 10);havoc #t~post6; {36730#(< ~counter~0 8)} is VALID [2022-04-28 12:29:53,554 INFO L290 TraceCheckUtils]: 24: Hoare triple {36740#(< ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36730#(< ~counter~0 8)} is VALID [2022-04-28 12:29:53,554 INFO L290 TraceCheckUtils]: 23: Hoare triple {36740#(< ~counter~0 7)} ~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; {36740#(< ~counter~0 7)} is VALID [2022-04-28 12:29:53,555 INFO L290 TraceCheckUtils]: 22: Hoare triple {36740#(< ~counter~0 7)} assume !(~c~0 >= ~b~0); {36740#(< ~counter~0 7)} is VALID [2022-04-28 12:29:53,555 INFO L290 TraceCheckUtils]: 21: Hoare triple {36740#(< ~counter~0 7)} assume !!(#t~post7 < 10);havoc #t~post7; {36740#(< ~counter~0 7)} is VALID [2022-04-28 12:29:53,556 INFO L290 TraceCheckUtils]: 20: Hoare triple {36512#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {36740#(< ~counter~0 7)} is VALID [2022-04-28 12:29:53,556 INFO L290 TraceCheckUtils]: 19: Hoare triple {36512#(<= ~counter~0 5)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {36512#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:53,556 INFO L290 TraceCheckUtils]: 18: Hoare triple {36512#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {36512#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:53,557 INFO L290 TraceCheckUtils]: 17: Hoare triple {36502#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36512#(<= ~counter~0 5)} is VALID [2022-04-28 12:29:53,557 INFO L290 TraceCheckUtils]: 16: Hoare triple {36502#(<= ~counter~0 4)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {36502#(<= ~counter~0 4)} is VALID [2022-04-28 12:29:53,557 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {36412#true} {36502#(<= ~counter~0 4)} #96#return; {36502#(<= ~counter~0 4)} is VALID [2022-04-28 12:29:53,557 INFO L290 TraceCheckUtils]: 14: Hoare triple {36412#true} assume true; {36412#true} is VALID [2022-04-28 12:29:53,558 INFO L290 TraceCheckUtils]: 13: Hoare triple {36412#true} assume !(0 == ~cond); {36412#true} is VALID [2022-04-28 12:29:53,558 INFO L290 TraceCheckUtils]: 12: Hoare triple {36412#true} ~cond := #in~cond; {36412#true} is VALID [2022-04-28 12:29:53,558 INFO L272 TraceCheckUtils]: 11: Hoare triple {36502#(<= ~counter~0 4)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {36412#true} is VALID [2022-04-28 12:29:53,558 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36412#true} {36502#(<= ~counter~0 4)} #94#return; {36502#(<= ~counter~0 4)} is VALID [2022-04-28 12:29:53,558 INFO L290 TraceCheckUtils]: 9: Hoare triple {36412#true} assume true; {36412#true} is VALID [2022-04-28 12:29:53,558 INFO L290 TraceCheckUtils]: 8: Hoare triple {36412#true} assume !(0 == ~cond); {36412#true} is VALID [2022-04-28 12:29:53,558 INFO L290 TraceCheckUtils]: 7: Hoare triple {36412#true} ~cond := #in~cond; {36412#true} is VALID [2022-04-28 12:29:53,558 INFO L272 TraceCheckUtils]: 6: Hoare triple {36502#(<= ~counter~0 4)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {36412#true} is VALID [2022-04-28 12:29:53,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {36502#(<= ~counter~0 4)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {36502#(<= ~counter~0 4)} is VALID [2022-04-28 12:29:53,559 INFO L272 TraceCheckUtils]: 4: Hoare triple {36502#(<= ~counter~0 4)} call #t~ret9 := main(); {36502#(<= ~counter~0 4)} is VALID [2022-04-28 12:29:53,559 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36502#(<= ~counter~0 4)} {36412#true} #108#return; {36502#(<= ~counter~0 4)} is VALID [2022-04-28 12:29:53,560 INFO L290 TraceCheckUtils]: 2: Hoare triple {36502#(<= ~counter~0 4)} assume true; {36502#(<= ~counter~0 4)} is VALID [2022-04-28 12:29:53,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {36412#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);~counter~0 := 0; {36502#(<= ~counter~0 4)} is VALID [2022-04-28 12:29:53,560 INFO L272 TraceCheckUtils]: 0: Hoare triple {36412#true} call ULTIMATE.init(); {36412#true} is VALID [2022-04-28 12:29:53,560 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 12:29:53,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:29:53,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106114656] [2022-04-28 12:29:53,561 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:29:53,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095750544] [2022-04-28 12:29:53,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095750544] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:29:53,561 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:29:53,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-28 12:29:53,562 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:29:53,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [532127289] [2022-04-28 12:29:53,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [532127289] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:29:53,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:29:53,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 12:29:53,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220422990] [2022-04-28 12:29:53,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:29:53,562 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-04-28 12:29:53,563 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:29:53,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 12:29:53,604 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:53,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 12:29:53,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:29:53,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 12:29:53,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 12:29:53,606 INFO L87 Difference]: Start difference. First operand 567 states and 783 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 12:29:55,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:55,253 INFO L93 Difference]: Finished difference Result 839 states and 1203 transitions. [2022-04-28 12:29:55,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 12:29:55,254 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-04-28 12:29:55,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:29:55,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 12:29:55,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 153 transitions. [2022-04-28 12:29:55,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 12:29:55,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 153 transitions. [2022-04-28 12:29:55,257 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 153 transitions. [2022-04-28 12:29:55,396 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:55,419 INFO L225 Difference]: With dead ends: 839 [2022-04-28 12:29:55,419 INFO L226 Difference]: Without dead ends: 567 [2022-04-28 12:29:55,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2022-04-28 12:29:55,422 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 76 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 12:29:55,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 193 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 12:29:55,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2022-04-28 12:29:56,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 567. [2022-04-28 12:29:56,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:29:56,811 INFO L82 GeneralOperation]: Start isEquivalent. First operand 567 states. Second operand has 567 states, 380 states have (on average 1.2894736842105263) internal successors, (490), 395 states have internal predecessors, (490), 146 states have call successors, (146), 41 states have call predecessors, (146), 40 states have return successors, (143), 130 states have call predecessors, (143), 143 states have call successors, (143) [2022-04-28 12:29:56,812 INFO L74 IsIncluded]: Start isIncluded. First operand 567 states. Second operand has 567 states, 380 states have (on average 1.2894736842105263) internal successors, (490), 395 states have internal predecessors, (490), 146 states have call successors, (146), 41 states have call predecessors, (146), 40 states have return successors, (143), 130 states have call predecessors, (143), 143 states have call successors, (143) [2022-04-28 12:29:56,813 INFO L87 Difference]: Start difference. First operand 567 states. Second operand has 567 states, 380 states have (on average 1.2894736842105263) internal successors, (490), 395 states have internal predecessors, (490), 146 states have call successors, (146), 41 states have call predecessors, (146), 40 states have return successors, (143), 130 states have call predecessors, (143), 143 states have call successors, (143) [2022-04-28 12:29:56,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:56,832 INFO L93 Difference]: Finished difference Result 567 states and 779 transitions. [2022-04-28 12:29:56,832 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 779 transitions. [2022-04-28 12:29:56,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:29:56,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:29:56,835 INFO L74 IsIncluded]: Start isIncluded. First operand has 567 states, 380 states have (on average 1.2894736842105263) internal successors, (490), 395 states have internal predecessors, (490), 146 states have call successors, (146), 41 states have call predecessors, (146), 40 states have return successors, (143), 130 states have call predecessors, (143), 143 states have call successors, (143) Second operand 567 states. [2022-04-28 12:29:56,835 INFO L87 Difference]: Start difference. First operand has 567 states, 380 states have (on average 1.2894736842105263) internal successors, (490), 395 states have internal predecessors, (490), 146 states have call successors, (146), 41 states have call predecessors, (146), 40 states have return successors, (143), 130 states have call predecessors, (143), 143 states have call successors, (143) Second operand 567 states. [2022-04-28 12:29:56,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:56,856 INFO L93 Difference]: Finished difference Result 567 states and 779 transitions. [2022-04-28 12:29:56,856 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 779 transitions. [2022-04-28 12:29:56,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:29:56,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:29:56,858 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:29:56,858 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:29:56,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 380 states have (on average 1.2894736842105263) internal successors, (490), 395 states have internal predecessors, (490), 146 states have call successors, (146), 41 states have call predecessors, (146), 40 states have return successors, (143), 130 states have call predecessors, (143), 143 states have call successors, (143) [2022-04-28 12:29:56,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 779 transitions. [2022-04-28 12:29:56,885 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 779 transitions. Word has length 65 [2022-04-28 12:29:56,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:29:56,886 INFO L495 AbstractCegarLoop]: Abstraction has 567 states and 779 transitions. [2022-04-28 12:29:56,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 12:29:56,886 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 567 states and 779 transitions. [2022-04-28 12:29:58,101 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 779 edges. 779 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:58,101 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 779 transitions. [2022-04-28 12:29:58,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-28 12:29:58,102 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:29:58,102 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:29:58,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-04-28 12:29:58,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-28 12:29:58,327 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:29:58,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:29:58,327 INFO L85 PathProgramCache]: Analyzing trace with hash -544828664, now seen corresponding path program 1 times [2022-04-28 12:29:58,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:29:58,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [683380857] [2022-04-28 12:29:58,328 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:29:58,328 INFO L85 PathProgramCache]: Analyzing trace with hash -544828664, now seen corresponding path program 2 times [2022-04-28 12:29:58,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:29:58,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631916156] [2022-04-28 12:29:58,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:29:58,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:29:58,341 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:29:58,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1949805826] [2022-04-28 12:29:58,342 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:29:58,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:29:58,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:29:58,343 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:29:58,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-28 12:29:58,399 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:29:58,399 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:29:58,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 12:29:58,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:29:58,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:29:58,607 INFO L272 TraceCheckUtils]: 0: Hoare triple {40767#true} call ULTIMATE.init(); {40767#true} is VALID [2022-04-28 12:29:58,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {40767#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);~counter~0 := 0; {40767#true} is VALID [2022-04-28 12:29:58,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {40767#true} assume true; {40767#true} is VALID [2022-04-28 12:29:58,607 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40767#true} {40767#true} #108#return; {40767#true} is VALID [2022-04-28 12:29:58,608 INFO L272 TraceCheckUtils]: 4: Hoare triple {40767#true} call #t~ret9 := main(); {40767#true} is VALID [2022-04-28 12:29:58,608 INFO L290 TraceCheckUtils]: 5: Hoare triple {40767#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {40767#true} is VALID [2022-04-28 12:29:58,608 INFO L272 TraceCheckUtils]: 6: Hoare triple {40767#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {40767#true} is VALID [2022-04-28 12:29:58,608 INFO L290 TraceCheckUtils]: 7: Hoare triple {40767#true} ~cond := #in~cond; {40767#true} is VALID [2022-04-28 12:29:58,608 INFO L290 TraceCheckUtils]: 8: Hoare triple {40767#true} assume !(0 == ~cond); {40767#true} is VALID [2022-04-28 12:29:58,608 INFO L290 TraceCheckUtils]: 9: Hoare triple {40767#true} assume true; {40767#true} is VALID [2022-04-28 12:29:58,608 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40767#true} {40767#true} #94#return; {40767#true} is VALID [2022-04-28 12:29:58,608 INFO L272 TraceCheckUtils]: 11: Hoare triple {40767#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {40767#true} is VALID [2022-04-28 12:29:58,608 INFO L290 TraceCheckUtils]: 12: Hoare triple {40767#true} ~cond := #in~cond; {40767#true} is VALID [2022-04-28 12:29:58,609 INFO L290 TraceCheckUtils]: 13: Hoare triple {40767#true} assume !(0 == ~cond); {40767#true} is VALID [2022-04-28 12:29:58,609 INFO L290 TraceCheckUtils]: 14: Hoare triple {40767#true} assume true; {40767#true} is VALID [2022-04-28 12:29:58,609 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {40767#true} {40767#true} #96#return; {40767#true} is VALID [2022-04-28 12:29:58,609 INFO L290 TraceCheckUtils]: 16: Hoare triple {40767#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {40767#true} is VALID [2022-04-28 12:29:58,609 INFO L290 TraceCheckUtils]: 17: Hoare triple {40767#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {40767#true} is VALID [2022-04-28 12:29:58,609 INFO L290 TraceCheckUtils]: 18: Hoare triple {40767#true} assume !!(#t~post6 < 10);havoc #t~post6; {40767#true} is VALID [2022-04-28 12:29:58,609 INFO L290 TraceCheckUtils]: 19: Hoare triple {40767#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {40767#true} is VALID [2022-04-28 12:29:58,609 INFO L290 TraceCheckUtils]: 20: Hoare triple {40767#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {40767#true} is VALID [2022-04-28 12:29:58,609 INFO L290 TraceCheckUtils]: 21: Hoare triple {40767#true} assume !!(#t~post7 < 10);havoc #t~post7; {40767#true} is VALID [2022-04-28 12:29:58,610 INFO L290 TraceCheckUtils]: 22: Hoare triple {40767#true} assume !(~c~0 >= ~b~0); {40767#true} is VALID [2022-04-28 12:29:58,610 INFO L290 TraceCheckUtils]: 23: Hoare triple {40767#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; {40767#true} is VALID [2022-04-28 12:29:58,610 INFO L290 TraceCheckUtils]: 24: Hoare triple {40767#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {40767#true} is VALID [2022-04-28 12:29:58,610 INFO L290 TraceCheckUtils]: 25: Hoare triple {40767#true} assume !!(#t~post6 < 10);havoc #t~post6; {40767#true} is VALID [2022-04-28 12:29:58,610 INFO L290 TraceCheckUtils]: 26: Hoare triple {40767#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {40767#true} is VALID [2022-04-28 12:29:58,610 INFO L290 TraceCheckUtils]: 27: Hoare triple {40767#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {40767#true} is VALID [2022-04-28 12:29:58,610 INFO L290 TraceCheckUtils]: 28: Hoare triple {40767#true} assume !!(#t~post7 < 10);havoc #t~post7; {40767#true} is VALID [2022-04-28 12:29:58,611 INFO L290 TraceCheckUtils]: 29: Hoare triple {40767#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {40859#(<= main_~v~0 main_~b~0)} is VALID [2022-04-28 12:29:58,611 INFO L290 TraceCheckUtils]: 30: Hoare triple {40859#(<= main_~v~0 main_~b~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {40859#(<= main_~v~0 main_~b~0)} is VALID [2022-04-28 12:29:58,611 INFO L290 TraceCheckUtils]: 31: Hoare triple {40859#(<= main_~v~0 main_~b~0)} assume !!(#t~post8 < 10);havoc #t~post8; {40859#(<= main_~v~0 main_~b~0)} is VALID [2022-04-28 12:29:58,612 INFO L272 TraceCheckUtils]: 32: Hoare triple {40859#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {40767#true} is VALID [2022-04-28 12:29:58,612 INFO L290 TraceCheckUtils]: 33: Hoare triple {40767#true} ~cond := #in~cond; {40767#true} is VALID [2022-04-28 12:29:58,612 INFO L290 TraceCheckUtils]: 34: Hoare triple {40767#true} assume !(0 == ~cond); {40767#true} is VALID [2022-04-28 12:29:58,612 INFO L290 TraceCheckUtils]: 35: Hoare triple {40767#true} assume true; {40767#true} is VALID [2022-04-28 12:29:58,613 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {40767#true} {40859#(<= main_~v~0 main_~b~0)} #98#return; {40859#(<= main_~v~0 main_~b~0)} is VALID [2022-04-28 12:29:58,613 INFO L272 TraceCheckUtils]: 37: Hoare triple {40859#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {40767#true} is VALID [2022-04-28 12:29:58,613 INFO L290 TraceCheckUtils]: 38: Hoare triple {40767#true} ~cond := #in~cond; {40767#true} is VALID [2022-04-28 12:29:58,613 INFO L290 TraceCheckUtils]: 39: Hoare triple {40767#true} assume !(0 == ~cond); {40767#true} is VALID [2022-04-28 12:29:58,613 INFO L290 TraceCheckUtils]: 40: Hoare triple {40767#true} assume true; {40767#true} is VALID [2022-04-28 12:29:58,614 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {40767#true} {40859#(<= main_~v~0 main_~b~0)} #100#return; {40859#(<= main_~v~0 main_~b~0)} is VALID [2022-04-28 12:29:58,614 INFO L272 TraceCheckUtils]: 42: Hoare triple {40859#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {40767#true} is VALID [2022-04-28 12:29:58,614 INFO L290 TraceCheckUtils]: 43: Hoare triple {40767#true} ~cond := #in~cond; {40767#true} is VALID [2022-04-28 12:29:58,614 INFO L290 TraceCheckUtils]: 44: Hoare triple {40767#true} assume !(0 == ~cond); {40767#true} is VALID [2022-04-28 12:29:58,614 INFO L290 TraceCheckUtils]: 45: Hoare triple {40767#true} assume true; {40767#true} is VALID [2022-04-28 12:29:58,615 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {40767#true} {40859#(<= main_~v~0 main_~b~0)} #102#return; {40859#(<= main_~v~0 main_~b~0)} is VALID [2022-04-28 12:29:58,615 INFO L272 TraceCheckUtils]: 47: Hoare triple {40859#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {40767#true} is VALID [2022-04-28 12:29:58,615 INFO L290 TraceCheckUtils]: 48: Hoare triple {40767#true} ~cond := #in~cond; {40767#true} is VALID [2022-04-28 12:29:58,615 INFO L290 TraceCheckUtils]: 49: Hoare triple {40767#true} assume !(0 == ~cond); {40767#true} is VALID [2022-04-28 12:29:58,616 INFO L290 TraceCheckUtils]: 50: Hoare triple {40767#true} assume true; {40767#true} is VALID [2022-04-28 12:29:58,616 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {40767#true} {40859#(<= main_~v~0 main_~b~0)} #104#return; {40859#(<= main_~v~0 main_~b~0)} is VALID [2022-04-28 12:29:58,617 INFO L290 TraceCheckUtils]: 52: Hoare triple {40859#(<= main_~v~0 main_~b~0)} assume !(~c~0 >= 2 * ~v~0); {40929#(and (<= main_~v~0 main_~b~0) (not (<= (* main_~v~0 2) main_~c~0)))} is VALID [2022-04-28 12:29:58,618 INFO L290 TraceCheckUtils]: 53: Hoare triple {40929#(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; {40933#(< main_~c~0 main_~b~0)} is VALID [2022-04-28 12:29:58,618 INFO L290 TraceCheckUtils]: 54: Hoare triple {40933#(< main_~c~0 main_~b~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {40933#(< main_~c~0 main_~b~0)} is VALID [2022-04-28 12:29:58,618 INFO L290 TraceCheckUtils]: 55: Hoare triple {40933#(< main_~c~0 main_~b~0)} assume !!(#t~post7 < 10);havoc #t~post7; {40933#(< main_~c~0 main_~b~0)} is VALID [2022-04-28 12:29:58,619 INFO L290 TraceCheckUtils]: 56: Hoare triple {40933#(< main_~c~0 main_~b~0)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {40768#false} is VALID [2022-04-28 12:29:58,619 INFO L290 TraceCheckUtils]: 57: Hoare triple {40768#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {40768#false} is VALID [2022-04-28 12:29:58,619 INFO L290 TraceCheckUtils]: 58: Hoare triple {40768#false} assume !(#t~post8 < 10);havoc #t~post8; {40768#false} is VALID [2022-04-28 12:29:58,619 INFO L290 TraceCheckUtils]: 59: Hoare triple {40768#false} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {40768#false} is VALID [2022-04-28 12:29:58,619 INFO L290 TraceCheckUtils]: 60: Hoare triple {40768#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {40768#false} is VALID [2022-04-28 12:29:58,619 INFO L290 TraceCheckUtils]: 61: Hoare triple {40768#false} assume !(#t~post7 < 10);havoc #t~post7; {40768#false} is VALID [2022-04-28 12:29:58,619 INFO L290 TraceCheckUtils]: 62: Hoare triple {40768#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; {40768#false} is VALID [2022-04-28 12:29:58,620 INFO L290 TraceCheckUtils]: 63: Hoare triple {40768#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {40768#false} is VALID [2022-04-28 12:29:58,620 INFO L290 TraceCheckUtils]: 64: Hoare triple {40768#false} assume !(#t~post6 < 10);havoc #t~post6; {40768#false} is VALID [2022-04-28 12:29:58,620 INFO L272 TraceCheckUtils]: 65: Hoare triple {40768#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)); {40768#false} is VALID [2022-04-28 12:29:58,620 INFO L290 TraceCheckUtils]: 66: Hoare triple {40768#false} ~cond := #in~cond; {40768#false} is VALID [2022-04-28 12:29:58,620 INFO L290 TraceCheckUtils]: 67: Hoare triple {40768#false} assume 0 == ~cond; {40768#false} is VALID [2022-04-28 12:29:58,620 INFO L290 TraceCheckUtils]: 68: Hoare triple {40768#false} assume !false; {40768#false} is VALID [2022-04-28 12:29:58,620 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-04-28 12:29:58,620 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:29:58,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:29:58,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631916156] [2022-04-28 12:29:58,621 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:29:58,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949805826] [2022-04-28 12:29:58,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949805826] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:29:58,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:29:58,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:29:58,621 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:29:58,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [683380857] [2022-04-28 12:29:58,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [683380857] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:29:58,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:29:58,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:29:58,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942280372] [2022-04-28 12:29:58,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:29:58,622 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 3 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 69 [2022-04-28 12:29:58,623 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:29:58,623 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 12:29:58,671 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 12:29:58,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 12:29:58,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:29:58,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 12:29:58,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 12:29:58,672 INFO L87 Difference]: Start difference. First operand 567 states and 779 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 12:30:00,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:30:00,578 INFO L93 Difference]: Finished difference Result 980 states and 1387 transitions. [2022-04-28 12:30:00,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 12:30:00,578 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 3 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 69 [2022-04-28 12:30:00,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:30:00,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 12:30:00,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2022-04-28 12:30:00,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 12:30:00,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2022-04-28 12:30:00,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 104 transitions. [2022-04-28 12:30:00,678 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:30:00,705 INFO L225 Difference]: With dead ends: 980 [2022-04-28 12:30:00,705 INFO L226 Difference]: Without dead ends: 624 [2022-04-28 12:30:00,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 66 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 12:30:00,707 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 11 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 121 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 12:30:00,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 121 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:30:00,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2022-04-28 12:30:02,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 568. [2022-04-28 12:30:02,197 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:30:02,197 INFO L82 GeneralOperation]: Start isEquivalent. First operand 624 states. Second operand has 568 states, 395 states have (on average 1.3012658227848102) internal successors, (514), 400 states have internal predecessors, (514), 134 states have call successors, (134), 39 states have call predecessors, (134), 38 states have return successors, (131), 128 states have call predecessors, (131), 131 states have call successors, (131) [2022-04-28 12:30:02,198 INFO L74 IsIncluded]: Start isIncluded. First operand 624 states. Second operand has 568 states, 395 states have (on average 1.3012658227848102) internal successors, (514), 400 states have internal predecessors, (514), 134 states have call successors, (134), 39 states have call predecessors, (134), 38 states have return successors, (131), 128 states have call predecessors, (131), 131 states have call successors, (131) [2022-04-28 12:30:02,199 INFO L87 Difference]: Start difference. First operand 624 states. Second operand has 568 states, 395 states have (on average 1.3012658227848102) internal successors, (514), 400 states have internal predecessors, (514), 134 states have call successors, (134), 39 states have call predecessors, (134), 38 states have return successors, (131), 128 states have call predecessors, (131), 131 states have call successors, (131) [2022-04-28 12:30:02,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:30:02,220 INFO L93 Difference]: Finished difference Result 624 states and 852 transitions. [2022-04-28 12:30:02,220 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 852 transitions. [2022-04-28 12:30:02,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:30:02,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:30:02,222 INFO L74 IsIncluded]: Start isIncluded. First operand has 568 states, 395 states have (on average 1.3012658227848102) internal successors, (514), 400 states have internal predecessors, (514), 134 states have call successors, (134), 39 states have call predecessors, (134), 38 states have return successors, (131), 128 states have call predecessors, (131), 131 states have call successors, (131) Second operand 624 states. [2022-04-28 12:30:02,223 INFO L87 Difference]: Start difference. First operand has 568 states, 395 states have (on average 1.3012658227848102) internal successors, (514), 400 states have internal predecessors, (514), 134 states have call successors, (134), 39 states have call predecessors, (134), 38 states have return successors, (131), 128 states have call predecessors, (131), 131 states have call successors, (131) Second operand 624 states. [2022-04-28 12:30:02,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:30:02,244 INFO L93 Difference]: Finished difference Result 624 states and 852 transitions. [2022-04-28 12:30:02,244 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 852 transitions. [2022-04-28 12:30:02,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:30:02,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:30:02,245 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:30:02,245 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:30:02,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 395 states have (on average 1.3012658227848102) internal successors, (514), 400 states have internal predecessors, (514), 134 states have call successors, (134), 39 states have call predecessors, (134), 38 states have return successors, (131), 128 states have call predecessors, (131), 131 states have call successors, (131) [2022-04-28 12:30:02,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 779 transitions. [2022-04-28 12:30:02,271 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 779 transitions. Word has length 69 [2022-04-28 12:30:02,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:30:02,271 INFO L495 AbstractCegarLoop]: Abstraction has 568 states and 779 transitions. [2022-04-28 12:30:02,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 12:30:02,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 568 states and 779 transitions. [2022-04-28 12:30:03,444 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 779 edges. 779 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:30:03,444 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 779 transitions. [2022-04-28 12:30:03,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-28 12:30:03,445 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:30:03,445 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:30:03,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-28 12:30:03,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:30:03,645 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:30:03,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:30:03,646 INFO L85 PathProgramCache]: Analyzing trace with hash -996119216, now seen corresponding path program 3 times [2022-04-28 12:30:03,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:30:03,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [418160375] [2022-04-28 12:30:03,646 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:30:03,646 INFO L85 PathProgramCache]: Analyzing trace with hash -996119216, now seen corresponding path program 4 times [2022-04-28 12:30:03,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:30:03,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278619885] [2022-04-28 12:30:03,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:30:03,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:30:03,657 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:30:03,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [154195852] [2022-04-28 12:30:03,657 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 12:30:03,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:30:03,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:30:03,659 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:30:03,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-28 12:30:03,707 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 12:30:03,707 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:30:03,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 12:30:03,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:30:03,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:30:04,041 INFO L272 TraceCheckUtils]: 0: Hoare triple {45325#true} call ULTIMATE.init(); {45325#true} is VALID [2022-04-28 12:30:04,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {45325#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);~counter~0 := 0; {45333#(<= ~counter~0 0)} is VALID [2022-04-28 12:30:04,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {45333#(<= ~counter~0 0)} assume true; {45333#(<= ~counter~0 0)} is VALID [2022-04-28 12:30:04,042 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45333#(<= ~counter~0 0)} {45325#true} #108#return; {45333#(<= ~counter~0 0)} is VALID [2022-04-28 12:30:04,043 INFO L272 TraceCheckUtils]: 4: Hoare triple {45333#(<= ~counter~0 0)} call #t~ret9 := main(); {45333#(<= ~counter~0 0)} is VALID [2022-04-28 12:30:04,043 INFO L290 TraceCheckUtils]: 5: Hoare triple {45333#(<= ~counter~0 0)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {45333#(<= ~counter~0 0)} is VALID [2022-04-28 12:30:04,043 INFO L272 TraceCheckUtils]: 6: Hoare triple {45333#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {45333#(<= ~counter~0 0)} is VALID [2022-04-28 12:30:04,044 INFO L290 TraceCheckUtils]: 7: Hoare triple {45333#(<= ~counter~0 0)} ~cond := #in~cond; {45333#(<= ~counter~0 0)} is VALID [2022-04-28 12:30:04,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {45333#(<= ~counter~0 0)} assume !(0 == ~cond); {45333#(<= ~counter~0 0)} is VALID [2022-04-28 12:30:04,044 INFO L290 TraceCheckUtils]: 9: Hoare triple {45333#(<= ~counter~0 0)} assume true; {45333#(<= ~counter~0 0)} is VALID [2022-04-28 12:30:04,045 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {45333#(<= ~counter~0 0)} {45333#(<= ~counter~0 0)} #94#return; {45333#(<= ~counter~0 0)} is VALID [2022-04-28 12:30:04,045 INFO L272 TraceCheckUtils]: 11: Hoare triple {45333#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {45333#(<= ~counter~0 0)} is VALID [2022-04-28 12:30:04,045 INFO L290 TraceCheckUtils]: 12: Hoare triple {45333#(<= ~counter~0 0)} ~cond := #in~cond; {45333#(<= ~counter~0 0)} is VALID [2022-04-28 12:30:04,046 INFO L290 TraceCheckUtils]: 13: Hoare triple {45333#(<= ~counter~0 0)} assume !(0 == ~cond); {45333#(<= ~counter~0 0)} is VALID [2022-04-28 12:30:04,046 INFO L290 TraceCheckUtils]: 14: Hoare triple {45333#(<= ~counter~0 0)} assume true; {45333#(<= ~counter~0 0)} is VALID [2022-04-28 12:30:04,046 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {45333#(<= ~counter~0 0)} {45333#(<= ~counter~0 0)} #96#return; {45333#(<= ~counter~0 0)} is VALID [2022-04-28 12:30:04,047 INFO L290 TraceCheckUtils]: 16: Hoare triple {45333#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {45333#(<= ~counter~0 0)} is VALID [2022-04-28 12:30:04,048 INFO L290 TraceCheckUtils]: 17: Hoare triple {45333#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {45382#(<= ~counter~0 1)} is VALID [2022-04-28 12:30:04,048 INFO L290 TraceCheckUtils]: 18: Hoare triple {45382#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {45382#(<= ~counter~0 1)} is VALID [2022-04-28 12:30:04,048 INFO L290 TraceCheckUtils]: 19: Hoare triple {45382#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {45382#(<= ~counter~0 1)} is VALID [2022-04-28 12:30:04,049 INFO L290 TraceCheckUtils]: 20: Hoare triple {45382#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45392#(<= ~counter~0 2)} is VALID [2022-04-28 12:30:04,049 INFO L290 TraceCheckUtils]: 21: Hoare triple {45392#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {45392#(<= ~counter~0 2)} is VALID [2022-04-28 12:30:04,049 INFO L290 TraceCheckUtils]: 22: Hoare triple {45392#(<= ~counter~0 2)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {45392#(<= ~counter~0 2)} is VALID [2022-04-28 12:30:04,050 INFO L290 TraceCheckUtils]: 23: Hoare triple {45392#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {45402#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,050 INFO L290 TraceCheckUtils]: 24: Hoare triple {45402#(<= ~counter~0 3)} assume !!(#t~post8 < 10);havoc #t~post8; {45402#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,051 INFO L272 TraceCheckUtils]: 25: Hoare triple {45402#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {45402#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,051 INFO L290 TraceCheckUtils]: 26: Hoare triple {45402#(<= ~counter~0 3)} ~cond := #in~cond; {45402#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,051 INFO L290 TraceCheckUtils]: 27: Hoare triple {45402#(<= ~counter~0 3)} assume !(0 == ~cond); {45402#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,052 INFO L290 TraceCheckUtils]: 28: Hoare triple {45402#(<= ~counter~0 3)} assume true; {45402#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,052 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {45402#(<= ~counter~0 3)} {45402#(<= ~counter~0 3)} #98#return; {45402#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,053 INFO L272 TraceCheckUtils]: 30: Hoare triple {45402#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {45402#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,053 INFO L290 TraceCheckUtils]: 31: Hoare triple {45402#(<= ~counter~0 3)} ~cond := #in~cond; {45402#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,053 INFO L290 TraceCheckUtils]: 32: Hoare triple {45402#(<= ~counter~0 3)} assume !(0 == ~cond); {45402#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,054 INFO L290 TraceCheckUtils]: 33: Hoare triple {45402#(<= ~counter~0 3)} assume true; {45402#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,054 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {45402#(<= ~counter~0 3)} {45402#(<= ~counter~0 3)} #100#return; {45402#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,055 INFO L272 TraceCheckUtils]: 35: Hoare triple {45402#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {45402#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,055 INFO L290 TraceCheckUtils]: 36: Hoare triple {45402#(<= ~counter~0 3)} ~cond := #in~cond; {45402#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,055 INFO L290 TraceCheckUtils]: 37: Hoare triple {45402#(<= ~counter~0 3)} assume !(0 == ~cond); {45402#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,056 INFO L290 TraceCheckUtils]: 38: Hoare triple {45402#(<= ~counter~0 3)} assume true; {45402#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,056 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {45402#(<= ~counter~0 3)} {45402#(<= ~counter~0 3)} #102#return; {45402#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,057 INFO L272 TraceCheckUtils]: 40: Hoare triple {45402#(<= ~counter~0 3)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {45402#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,057 INFO L290 TraceCheckUtils]: 41: Hoare triple {45402#(<= ~counter~0 3)} ~cond := #in~cond; {45402#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,057 INFO L290 TraceCheckUtils]: 42: Hoare triple {45402#(<= ~counter~0 3)} assume !(0 == ~cond); {45402#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,057 INFO L290 TraceCheckUtils]: 43: Hoare triple {45402#(<= ~counter~0 3)} assume true; {45402#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,058 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {45402#(<= ~counter~0 3)} {45402#(<= ~counter~0 3)} #104#return; {45402#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,058 INFO L290 TraceCheckUtils]: 45: Hoare triple {45402#(<= ~counter~0 3)} assume !(~c~0 >= 2 * ~v~0); {45402#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,058 INFO L290 TraceCheckUtils]: 46: Hoare triple {45402#(<= ~counter~0 3)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {45402#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,059 INFO L290 TraceCheckUtils]: 47: Hoare triple {45402#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45475#(<= ~counter~0 4)} is VALID [2022-04-28 12:30:04,059 INFO L290 TraceCheckUtils]: 48: Hoare triple {45475#(<= ~counter~0 4)} assume !!(#t~post7 < 10);havoc #t~post7; {45475#(<= ~counter~0 4)} is VALID [2022-04-28 12:30:04,060 INFO L290 TraceCheckUtils]: 49: Hoare triple {45475#(<= ~counter~0 4)} assume !(~c~0 >= ~b~0); {45475#(<= ~counter~0 4)} is VALID [2022-04-28 12:30:04,060 INFO L290 TraceCheckUtils]: 50: Hoare triple {45475#(<= ~counter~0 4)} ~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; {45475#(<= ~counter~0 4)} is VALID [2022-04-28 12:30:04,061 INFO L290 TraceCheckUtils]: 51: Hoare triple {45475#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {45488#(<= ~counter~0 5)} is VALID [2022-04-28 12:30:04,061 INFO L290 TraceCheckUtils]: 52: Hoare triple {45488#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {45488#(<= ~counter~0 5)} is VALID [2022-04-28 12:30:04,061 INFO L290 TraceCheckUtils]: 53: Hoare triple {45488#(<= ~counter~0 5)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {45488#(<= ~counter~0 5)} is VALID [2022-04-28 12:30:04,062 INFO L290 TraceCheckUtils]: 54: Hoare triple {45488#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45498#(<= ~counter~0 6)} is VALID [2022-04-28 12:30:04,062 INFO L290 TraceCheckUtils]: 55: Hoare triple {45498#(<= ~counter~0 6)} assume !!(#t~post7 < 10);havoc #t~post7; {45498#(<= ~counter~0 6)} is VALID [2022-04-28 12:30:04,062 INFO L290 TraceCheckUtils]: 56: Hoare triple {45498#(<= ~counter~0 6)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {45498#(<= ~counter~0 6)} is VALID [2022-04-28 12:30:04,063 INFO L290 TraceCheckUtils]: 57: Hoare triple {45498#(<= ~counter~0 6)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {45508#(<= |main_#t~post8| 6)} is VALID [2022-04-28 12:30:04,063 INFO L290 TraceCheckUtils]: 58: Hoare triple {45508#(<= |main_#t~post8| 6)} assume !(#t~post8 < 10);havoc #t~post8; {45326#false} is VALID [2022-04-28 12:30:04,063 INFO L290 TraceCheckUtils]: 59: Hoare triple {45326#false} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {45326#false} is VALID [2022-04-28 12:30:04,063 INFO L290 TraceCheckUtils]: 60: Hoare triple {45326#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45326#false} is VALID [2022-04-28 12:30:04,063 INFO L290 TraceCheckUtils]: 61: Hoare triple {45326#false} assume !(#t~post7 < 10);havoc #t~post7; {45326#false} is VALID [2022-04-28 12:30:04,064 INFO L290 TraceCheckUtils]: 62: Hoare triple {45326#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; {45326#false} is VALID [2022-04-28 12:30:04,064 INFO L290 TraceCheckUtils]: 63: Hoare triple {45326#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {45326#false} is VALID [2022-04-28 12:30:04,064 INFO L290 TraceCheckUtils]: 64: Hoare triple {45326#false} assume !(#t~post6 < 10);havoc #t~post6; {45326#false} is VALID [2022-04-28 12:30:04,064 INFO L272 TraceCheckUtils]: 65: Hoare triple {45326#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)); {45326#false} is VALID [2022-04-28 12:30:04,064 INFO L290 TraceCheckUtils]: 66: Hoare triple {45326#false} ~cond := #in~cond; {45326#false} is VALID [2022-04-28 12:30:04,064 INFO L290 TraceCheckUtils]: 67: Hoare triple {45326#false} assume 0 == ~cond; {45326#false} is VALID [2022-04-28 12:30:04,064 INFO L290 TraceCheckUtils]: 68: Hoare triple {45326#false} assume !false; {45326#false} is VALID [2022-04-28 12:30:04,065 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 20 proven. 14 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 12:30:04,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:30:04,400 INFO L290 TraceCheckUtils]: 68: Hoare triple {45326#false} assume !false; {45326#false} is VALID [2022-04-28 12:30:04,401 INFO L290 TraceCheckUtils]: 67: Hoare triple {45326#false} assume 0 == ~cond; {45326#false} is VALID [2022-04-28 12:30:04,401 INFO L290 TraceCheckUtils]: 66: Hoare triple {45326#false} ~cond := #in~cond; {45326#false} is VALID [2022-04-28 12:30:04,401 INFO L272 TraceCheckUtils]: 65: Hoare triple {45326#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)); {45326#false} is VALID [2022-04-28 12:30:04,401 INFO L290 TraceCheckUtils]: 64: Hoare triple {45326#false} assume !(#t~post6 < 10);havoc #t~post6; {45326#false} is VALID [2022-04-28 12:30:04,401 INFO L290 TraceCheckUtils]: 63: Hoare triple {45326#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {45326#false} is VALID [2022-04-28 12:30:04,401 INFO L290 TraceCheckUtils]: 62: Hoare triple {45326#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; {45326#false} is VALID [2022-04-28 12:30:04,401 INFO L290 TraceCheckUtils]: 61: Hoare triple {45326#false} assume !(#t~post7 < 10);havoc #t~post7; {45326#false} is VALID [2022-04-28 12:30:04,401 INFO L290 TraceCheckUtils]: 60: Hoare triple {45326#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45326#false} is VALID [2022-04-28 12:30:04,401 INFO L290 TraceCheckUtils]: 59: Hoare triple {45326#false} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {45326#false} is VALID [2022-04-28 12:30:04,402 INFO L290 TraceCheckUtils]: 58: Hoare triple {45572#(< |main_#t~post8| 10)} assume !(#t~post8 < 10);havoc #t~post8; {45326#false} is VALID [2022-04-28 12:30:04,402 INFO L290 TraceCheckUtils]: 57: Hoare triple {45576#(< ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {45572#(< |main_#t~post8| 10)} is VALID [2022-04-28 12:30:04,402 INFO L290 TraceCheckUtils]: 56: Hoare triple {45576#(< ~counter~0 10)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {45576#(< ~counter~0 10)} is VALID [2022-04-28 12:30:04,403 INFO L290 TraceCheckUtils]: 55: Hoare triple {45576#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {45576#(< ~counter~0 10)} is VALID [2022-04-28 12:30:04,404 INFO L290 TraceCheckUtils]: 54: Hoare triple {45586#(< ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45576#(< ~counter~0 10)} is VALID [2022-04-28 12:30:04,404 INFO L290 TraceCheckUtils]: 53: Hoare triple {45586#(< ~counter~0 9)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {45586#(< ~counter~0 9)} is VALID [2022-04-28 12:30:04,404 INFO L290 TraceCheckUtils]: 52: Hoare triple {45586#(< ~counter~0 9)} assume !!(#t~post6 < 10);havoc #t~post6; {45586#(< ~counter~0 9)} is VALID [2022-04-28 12:30:04,405 INFO L290 TraceCheckUtils]: 51: Hoare triple {45596#(< ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {45586#(< ~counter~0 9)} is VALID [2022-04-28 12:30:04,405 INFO L290 TraceCheckUtils]: 50: Hoare triple {45596#(< ~counter~0 8)} ~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; {45596#(< ~counter~0 8)} is VALID [2022-04-28 12:30:04,405 INFO L290 TraceCheckUtils]: 49: Hoare triple {45596#(< ~counter~0 8)} assume !(~c~0 >= ~b~0); {45596#(< ~counter~0 8)} is VALID [2022-04-28 12:30:04,406 INFO L290 TraceCheckUtils]: 48: Hoare triple {45596#(< ~counter~0 8)} assume !!(#t~post7 < 10);havoc #t~post7; {45596#(< ~counter~0 8)} is VALID [2022-04-28 12:30:04,406 INFO L290 TraceCheckUtils]: 47: Hoare triple {45498#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45596#(< ~counter~0 8)} is VALID [2022-04-28 12:30:04,407 INFO L290 TraceCheckUtils]: 46: Hoare triple {45498#(<= ~counter~0 6)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {45498#(<= ~counter~0 6)} is VALID [2022-04-28 12:30:04,419 INFO L290 TraceCheckUtils]: 45: Hoare triple {45498#(<= ~counter~0 6)} assume !(~c~0 >= 2 * ~v~0); {45498#(<= ~counter~0 6)} is VALID [2022-04-28 12:30:04,420 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {45325#true} {45498#(<= ~counter~0 6)} #104#return; {45498#(<= ~counter~0 6)} is VALID [2022-04-28 12:30:04,420 INFO L290 TraceCheckUtils]: 43: Hoare triple {45325#true} assume true; {45325#true} is VALID [2022-04-28 12:30:04,420 INFO L290 TraceCheckUtils]: 42: Hoare triple {45325#true} assume !(0 == ~cond); {45325#true} is VALID [2022-04-28 12:30:04,421 INFO L290 TraceCheckUtils]: 41: Hoare triple {45325#true} ~cond := #in~cond; {45325#true} is VALID [2022-04-28 12:30:04,421 INFO L272 TraceCheckUtils]: 40: Hoare triple {45498#(<= ~counter~0 6)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {45325#true} is VALID [2022-04-28 12:30:04,422 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {45325#true} {45498#(<= ~counter~0 6)} #102#return; {45498#(<= ~counter~0 6)} is VALID [2022-04-28 12:30:04,422 INFO L290 TraceCheckUtils]: 38: Hoare triple {45325#true} assume true; {45325#true} is VALID [2022-04-28 12:30:04,422 INFO L290 TraceCheckUtils]: 37: Hoare triple {45325#true} assume !(0 == ~cond); {45325#true} is VALID [2022-04-28 12:30:04,422 INFO L290 TraceCheckUtils]: 36: Hoare triple {45325#true} ~cond := #in~cond; {45325#true} is VALID [2022-04-28 12:30:04,422 INFO L272 TraceCheckUtils]: 35: Hoare triple {45498#(<= ~counter~0 6)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {45325#true} is VALID [2022-04-28 12:30:04,423 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {45325#true} {45498#(<= ~counter~0 6)} #100#return; {45498#(<= ~counter~0 6)} is VALID [2022-04-28 12:30:04,423 INFO L290 TraceCheckUtils]: 33: Hoare triple {45325#true} assume true; {45325#true} is VALID [2022-04-28 12:30:04,423 INFO L290 TraceCheckUtils]: 32: Hoare triple {45325#true} assume !(0 == ~cond); {45325#true} is VALID [2022-04-28 12:30:04,423 INFO L290 TraceCheckUtils]: 31: Hoare triple {45325#true} ~cond := #in~cond; {45325#true} is VALID [2022-04-28 12:30:04,423 INFO L272 TraceCheckUtils]: 30: Hoare triple {45498#(<= ~counter~0 6)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {45325#true} is VALID [2022-04-28 12:30:04,424 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {45325#true} {45498#(<= ~counter~0 6)} #98#return; {45498#(<= ~counter~0 6)} is VALID [2022-04-28 12:30:04,424 INFO L290 TraceCheckUtils]: 28: Hoare triple {45325#true} assume true; {45325#true} is VALID [2022-04-28 12:30:04,424 INFO L290 TraceCheckUtils]: 27: Hoare triple {45325#true} assume !(0 == ~cond); {45325#true} is VALID [2022-04-28 12:30:04,424 INFO L290 TraceCheckUtils]: 26: Hoare triple {45325#true} ~cond := #in~cond; {45325#true} is VALID [2022-04-28 12:30:04,424 INFO L272 TraceCheckUtils]: 25: Hoare triple {45498#(<= ~counter~0 6)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {45325#true} is VALID [2022-04-28 12:30:04,425 INFO L290 TraceCheckUtils]: 24: Hoare triple {45498#(<= ~counter~0 6)} assume !!(#t~post8 < 10);havoc #t~post8; {45498#(<= ~counter~0 6)} is VALID [2022-04-28 12:30:04,425 INFO L290 TraceCheckUtils]: 23: Hoare triple {45488#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {45498#(<= ~counter~0 6)} is VALID [2022-04-28 12:30:04,426 INFO L290 TraceCheckUtils]: 22: Hoare triple {45488#(<= ~counter~0 5)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {45488#(<= ~counter~0 5)} is VALID [2022-04-28 12:30:04,426 INFO L290 TraceCheckUtils]: 21: Hoare triple {45488#(<= ~counter~0 5)} assume !!(#t~post7 < 10);havoc #t~post7; {45488#(<= ~counter~0 5)} is VALID [2022-04-28 12:30:04,427 INFO L290 TraceCheckUtils]: 20: Hoare triple {45475#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45488#(<= ~counter~0 5)} is VALID [2022-04-28 12:30:04,427 INFO L290 TraceCheckUtils]: 19: Hoare triple {45475#(<= ~counter~0 4)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {45475#(<= ~counter~0 4)} is VALID [2022-04-28 12:30:04,427 INFO L290 TraceCheckUtils]: 18: Hoare triple {45475#(<= ~counter~0 4)} assume !!(#t~post6 < 10);havoc #t~post6; {45475#(<= ~counter~0 4)} is VALID [2022-04-28 12:30:04,428 INFO L290 TraceCheckUtils]: 17: Hoare triple {45402#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {45475#(<= ~counter~0 4)} is VALID [2022-04-28 12:30:04,428 INFO L290 TraceCheckUtils]: 16: Hoare triple {45402#(<= ~counter~0 3)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {45402#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,429 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {45325#true} {45402#(<= ~counter~0 3)} #96#return; {45402#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,429 INFO L290 TraceCheckUtils]: 14: Hoare triple {45325#true} assume true; {45325#true} is VALID [2022-04-28 12:30:04,429 INFO L290 TraceCheckUtils]: 13: Hoare triple {45325#true} assume !(0 == ~cond); {45325#true} is VALID [2022-04-28 12:30:04,429 INFO L290 TraceCheckUtils]: 12: Hoare triple {45325#true} ~cond := #in~cond; {45325#true} is VALID [2022-04-28 12:30:04,429 INFO L272 TraceCheckUtils]: 11: Hoare triple {45402#(<= ~counter~0 3)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {45325#true} is VALID [2022-04-28 12:30:04,429 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {45325#true} {45402#(<= ~counter~0 3)} #94#return; {45402#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,429 INFO L290 TraceCheckUtils]: 9: Hoare triple {45325#true} assume true; {45325#true} is VALID [2022-04-28 12:30:04,429 INFO L290 TraceCheckUtils]: 8: Hoare triple {45325#true} assume !(0 == ~cond); {45325#true} is VALID [2022-04-28 12:30:04,430 INFO L290 TraceCheckUtils]: 7: Hoare triple {45325#true} ~cond := #in~cond; {45325#true} is VALID [2022-04-28 12:30:04,430 INFO L272 TraceCheckUtils]: 6: Hoare triple {45402#(<= ~counter~0 3)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {45325#true} is VALID [2022-04-28 12:30:04,430 INFO L290 TraceCheckUtils]: 5: Hoare triple {45402#(<= ~counter~0 3)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {45402#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,430 INFO L272 TraceCheckUtils]: 4: Hoare triple {45402#(<= ~counter~0 3)} call #t~ret9 := main(); {45402#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,431 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45402#(<= ~counter~0 3)} {45325#true} #108#return; {45402#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,431 INFO L290 TraceCheckUtils]: 2: Hoare triple {45402#(<= ~counter~0 3)} assume true; {45402#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {45325#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);~counter~0 := 0; {45402#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,431 INFO L272 TraceCheckUtils]: 0: Hoare triple {45325#true} call ULTIMATE.init(); {45325#true} is VALID [2022-04-28 12:30:04,432 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 20 proven. 14 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 12:30:04,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:30:04,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278619885] [2022-04-28 12:30:04,432 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:30:04,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154195852] [2022-04-28 12:30:04,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154195852] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:30:04,432 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:30:04,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2022-04-28 12:30:04,432 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:30:04,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [418160375] [2022-04-28 12:30:04,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [418160375] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:30:04,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:30:04,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 12:30:04,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505704893] [2022-04-28 12:30:04,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:30:04,433 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 69 [2022-04-28 12:30:04,433 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:30:04,433 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 12:30:04,478 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:30:04,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 12:30:04,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:30:04,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 12:30:04,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 12:30:04,479 INFO L87 Difference]: Start difference. First operand 568 states and 779 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 12:30:06,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:30:06,464 INFO L93 Difference]: Finished difference Result 914 states and 1304 transitions. [2022-04-28 12:30:06,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 12:30:06,464 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 69 [2022-04-28 12:30:06,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:30:06,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 12:30:06,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 181 transitions. [2022-04-28 12:30:06,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 12:30:06,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 181 transitions. [2022-04-28 12:30:06,468 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 181 transitions. [2022-04-28 12:30:06,600 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:30:06,624 INFO L225 Difference]: With dead ends: 914 [2022-04-28 12:30:06,624 INFO L226 Difference]: Without dead ends: 584 [2022-04-28 12:30:06,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 124 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=191, Unknown=0, NotChecked=0, Total=306 [2022-04-28 12:30:06,626 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 96 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 12:30:06,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 256 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 12:30:06,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2022-04-28 12:30:08,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 575. [2022-04-28 12:30:08,137 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:30:08,137 INFO L82 GeneralOperation]: Start isEquivalent. First operand 584 states. Second operand has 575 states, 402 states have (on average 1.2960199004975124) internal successors, (521), 404 states have internal predecessors, (521), 134 states have call successors, (134), 39 states have call predecessors, (134), 38 states have return successors, (131), 131 states have call predecessors, (131), 131 states have call successors, (131) [2022-04-28 12:30:08,138 INFO L74 IsIncluded]: Start isIncluded. First operand 584 states. Second operand has 575 states, 402 states have (on average 1.2960199004975124) internal successors, (521), 404 states have internal predecessors, (521), 134 states have call successors, (134), 39 states have call predecessors, (134), 38 states have return successors, (131), 131 states have call predecessors, (131), 131 states have call successors, (131) [2022-04-28 12:30:08,138 INFO L87 Difference]: Start difference. First operand 584 states. Second operand has 575 states, 402 states have (on average 1.2960199004975124) internal successors, (521), 404 states have internal predecessors, (521), 134 states have call successors, (134), 39 states have call predecessors, (134), 38 states have return successors, (131), 131 states have call predecessors, (131), 131 states have call successors, (131) [2022-04-28 12:30:08,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:30:08,150 INFO L93 Difference]: Finished difference Result 584 states and 794 transitions. [2022-04-28 12:30:08,150 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 794 transitions. [2022-04-28 12:30:08,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:30:08,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:30:08,152 INFO L74 IsIncluded]: Start isIncluded. First operand has 575 states, 402 states have (on average 1.2960199004975124) internal successors, (521), 404 states have internal predecessors, (521), 134 states have call successors, (134), 39 states have call predecessors, (134), 38 states have return successors, (131), 131 states have call predecessors, (131), 131 states have call successors, (131) Second operand 584 states. [2022-04-28 12:30:08,152 INFO L87 Difference]: Start difference. First operand has 575 states, 402 states have (on average 1.2960199004975124) internal successors, (521), 404 states have internal predecessors, (521), 134 states have call successors, (134), 39 states have call predecessors, (134), 38 states have return successors, (131), 131 states have call predecessors, (131), 131 states have call successors, (131) Second operand 584 states. [2022-04-28 12:30:08,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:30:08,171 INFO L93 Difference]: Finished difference Result 584 states and 794 transitions. [2022-04-28 12:30:08,171 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 794 transitions. [2022-04-28 12:30:08,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:30:08,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:30:08,172 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:30:08,172 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:30:08,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 402 states have (on average 1.2960199004975124) internal successors, (521), 404 states have internal predecessors, (521), 134 states have call successors, (134), 39 states have call predecessors, (134), 38 states have return successors, (131), 131 states have call predecessors, (131), 131 states have call successors, (131) [2022-04-28 12:30:08,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 786 transitions. [2022-04-28 12:30:08,198 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 786 transitions. Word has length 69 [2022-04-28 12:30:08,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:30:08,198 INFO L495 AbstractCegarLoop]: Abstraction has 575 states and 786 transitions. [2022-04-28 12:30:08,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 12:30:08,198 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 575 states and 786 transitions. [2022-04-28 12:30:09,407 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 786 edges. 786 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:30:09,407 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 786 transitions. [2022-04-28 12:30:09,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-28 12:30:09,408 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:30:09,408 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:30:09,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-28 12:30:09,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:30:09,608 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:30:09,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:30:09,609 INFO L85 PathProgramCache]: Analyzing trace with hash 862858316, now seen corresponding path program 3 times [2022-04-28 12:30:09,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:30:09,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [495581050] [2022-04-28 12:30:09,609 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:30:09,609 INFO L85 PathProgramCache]: Analyzing trace with hash 862858316, now seen corresponding path program 4 times [2022-04-28 12:30:09,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:30:09,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547412037] [2022-04-28 12:30:09,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:30:09,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:30:09,623 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:30:09,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1205427292] [2022-04-28 12:30:09,624 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 12:30:09,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:30:09,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:30:09,625 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:30:09,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-28 12:30:09,684 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 12:30:09,684 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:30:09,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 12:30:09,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:30:09,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:30:10,040 INFO L272 TraceCheckUtils]: 0: Hoare triple {49906#true} call ULTIMATE.init(); {49906#true} is VALID [2022-04-28 12:30:10,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {49906#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);~counter~0 := 0; {49914#(<= ~counter~0 0)} is VALID [2022-04-28 12:30:10,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {49914#(<= ~counter~0 0)} assume true; {49914#(<= ~counter~0 0)} is VALID [2022-04-28 12:30:10,041 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49914#(<= ~counter~0 0)} {49906#true} #108#return; {49914#(<= ~counter~0 0)} is VALID [2022-04-28 12:30:10,042 INFO L272 TraceCheckUtils]: 4: Hoare triple {49914#(<= ~counter~0 0)} call #t~ret9 := main(); {49914#(<= ~counter~0 0)} is VALID [2022-04-28 12:30:10,042 INFO L290 TraceCheckUtils]: 5: Hoare triple {49914#(<= ~counter~0 0)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {49914#(<= ~counter~0 0)} is VALID [2022-04-28 12:30:10,042 INFO L272 TraceCheckUtils]: 6: Hoare triple {49914#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {49914#(<= ~counter~0 0)} is VALID [2022-04-28 12:30:10,043 INFO L290 TraceCheckUtils]: 7: Hoare triple {49914#(<= ~counter~0 0)} ~cond := #in~cond; {49914#(<= ~counter~0 0)} is VALID [2022-04-28 12:30:10,043 INFO L290 TraceCheckUtils]: 8: Hoare triple {49914#(<= ~counter~0 0)} assume !(0 == ~cond); {49914#(<= ~counter~0 0)} is VALID [2022-04-28 12:30:10,043 INFO L290 TraceCheckUtils]: 9: Hoare triple {49914#(<= ~counter~0 0)} assume true; {49914#(<= ~counter~0 0)} is VALID [2022-04-28 12:30:10,044 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {49914#(<= ~counter~0 0)} {49914#(<= ~counter~0 0)} #94#return; {49914#(<= ~counter~0 0)} is VALID [2022-04-28 12:30:10,044 INFO L272 TraceCheckUtils]: 11: Hoare triple {49914#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {49914#(<= ~counter~0 0)} is VALID [2022-04-28 12:30:10,044 INFO L290 TraceCheckUtils]: 12: Hoare triple {49914#(<= ~counter~0 0)} ~cond := #in~cond; {49914#(<= ~counter~0 0)} is VALID [2022-04-28 12:30:10,045 INFO L290 TraceCheckUtils]: 13: Hoare triple {49914#(<= ~counter~0 0)} assume !(0 == ~cond); {49914#(<= ~counter~0 0)} is VALID [2022-04-28 12:30:10,045 INFO L290 TraceCheckUtils]: 14: Hoare triple {49914#(<= ~counter~0 0)} assume true; {49914#(<= ~counter~0 0)} is VALID [2022-04-28 12:30:10,045 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {49914#(<= ~counter~0 0)} {49914#(<= ~counter~0 0)} #96#return; {49914#(<= ~counter~0 0)} is VALID [2022-04-28 12:30:10,046 INFO L290 TraceCheckUtils]: 16: Hoare triple {49914#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {49914#(<= ~counter~0 0)} is VALID [2022-04-28 12:30:10,047 INFO L290 TraceCheckUtils]: 17: Hoare triple {49914#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49963#(<= ~counter~0 1)} is VALID [2022-04-28 12:30:10,047 INFO L290 TraceCheckUtils]: 18: Hoare triple {49963#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {49963#(<= ~counter~0 1)} is VALID [2022-04-28 12:30:10,047 INFO L290 TraceCheckUtils]: 19: Hoare triple {49963#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {49963#(<= ~counter~0 1)} is VALID [2022-04-28 12:30:10,048 INFO L290 TraceCheckUtils]: 20: Hoare triple {49963#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {49973#(<= ~counter~0 2)} is VALID [2022-04-28 12:30:10,048 INFO L290 TraceCheckUtils]: 21: Hoare triple {49973#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {49973#(<= ~counter~0 2)} is VALID [2022-04-28 12:30:10,048 INFO L290 TraceCheckUtils]: 22: Hoare triple {49973#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {49973#(<= ~counter~0 2)} is VALID [2022-04-28 12:30:10,049 INFO L290 TraceCheckUtils]: 23: Hoare triple {49973#(<= ~counter~0 2)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {49973#(<= ~counter~0 2)} is VALID [2022-04-28 12:30:10,049 INFO L290 TraceCheckUtils]: 24: Hoare triple {49973#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49986#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:10,050 INFO L290 TraceCheckUtils]: 25: Hoare triple {49986#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {49986#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:10,050 INFO L290 TraceCheckUtils]: 26: Hoare triple {49986#(<= ~counter~0 3)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {49986#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:10,051 INFO L290 TraceCheckUtils]: 27: Hoare triple {49986#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {49996#(<= ~counter~0 4)} is VALID [2022-04-28 12:30:10,051 INFO L290 TraceCheckUtils]: 28: Hoare triple {49996#(<= ~counter~0 4)} assume !!(#t~post7 < 10);havoc #t~post7; {49996#(<= ~counter~0 4)} is VALID [2022-04-28 12:30:10,051 INFO L290 TraceCheckUtils]: 29: Hoare triple {49996#(<= ~counter~0 4)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {49996#(<= ~counter~0 4)} is VALID [2022-04-28 12:30:10,052 INFO L290 TraceCheckUtils]: 30: Hoare triple {49996#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {50006#(<= ~counter~0 5)} is VALID [2022-04-28 12:30:10,052 INFO L290 TraceCheckUtils]: 31: Hoare triple {50006#(<= ~counter~0 5)} assume !!(#t~post8 < 10);havoc #t~post8; {50006#(<= ~counter~0 5)} is VALID [2022-04-28 12:30:10,053 INFO L272 TraceCheckUtils]: 32: Hoare triple {50006#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {50006#(<= ~counter~0 5)} is VALID [2022-04-28 12:30:10,053 INFO L290 TraceCheckUtils]: 33: Hoare triple {50006#(<= ~counter~0 5)} ~cond := #in~cond; {50006#(<= ~counter~0 5)} is VALID [2022-04-28 12:30:10,053 INFO L290 TraceCheckUtils]: 34: Hoare triple {50006#(<= ~counter~0 5)} assume !(0 == ~cond); {50006#(<= ~counter~0 5)} is VALID [2022-04-28 12:30:10,053 INFO L290 TraceCheckUtils]: 35: Hoare triple {50006#(<= ~counter~0 5)} assume true; {50006#(<= ~counter~0 5)} is VALID [2022-04-28 12:30:10,054 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {50006#(<= ~counter~0 5)} {50006#(<= ~counter~0 5)} #98#return; {50006#(<= ~counter~0 5)} is VALID [2022-04-28 12:30:10,055 INFO L272 TraceCheckUtils]: 37: Hoare triple {50006#(<= ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {50006#(<= ~counter~0 5)} is VALID [2022-04-28 12:30:10,055 INFO L290 TraceCheckUtils]: 38: Hoare triple {50006#(<= ~counter~0 5)} ~cond := #in~cond; {50006#(<= ~counter~0 5)} is VALID [2022-04-28 12:30:10,055 INFO L290 TraceCheckUtils]: 39: Hoare triple {50006#(<= ~counter~0 5)} assume !(0 == ~cond); {50006#(<= ~counter~0 5)} is VALID [2022-04-28 12:30:10,056 INFO L290 TraceCheckUtils]: 40: Hoare triple {50006#(<= ~counter~0 5)} assume true; {50006#(<= ~counter~0 5)} is VALID [2022-04-28 12:30:10,056 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {50006#(<= ~counter~0 5)} {50006#(<= ~counter~0 5)} #100#return; {50006#(<= ~counter~0 5)} is VALID [2022-04-28 12:30:10,057 INFO L272 TraceCheckUtils]: 42: Hoare triple {50006#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {50006#(<= ~counter~0 5)} is VALID [2022-04-28 12:30:10,057 INFO L290 TraceCheckUtils]: 43: Hoare triple {50006#(<= ~counter~0 5)} ~cond := #in~cond; {50006#(<= ~counter~0 5)} is VALID [2022-04-28 12:30:10,057 INFO L290 TraceCheckUtils]: 44: Hoare triple {50006#(<= ~counter~0 5)} assume !(0 == ~cond); {50006#(<= ~counter~0 5)} is VALID [2022-04-28 12:30:10,057 INFO L290 TraceCheckUtils]: 45: Hoare triple {50006#(<= ~counter~0 5)} assume true; {50006#(<= ~counter~0 5)} is VALID [2022-04-28 12:30:10,058 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {50006#(<= ~counter~0 5)} {50006#(<= ~counter~0 5)} #102#return; {50006#(<= ~counter~0 5)} is VALID [2022-04-28 12:30:10,059 INFO L272 TraceCheckUtils]: 47: Hoare triple {50006#(<= ~counter~0 5)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {50006#(<= ~counter~0 5)} is VALID [2022-04-28 12:30:10,059 INFO L290 TraceCheckUtils]: 48: Hoare triple {50006#(<= ~counter~0 5)} ~cond := #in~cond; {50006#(<= ~counter~0 5)} is VALID [2022-04-28 12:30:10,059 INFO L290 TraceCheckUtils]: 49: Hoare triple {50006#(<= ~counter~0 5)} assume !(0 == ~cond); {50006#(<= ~counter~0 5)} is VALID [2022-04-28 12:30:10,059 INFO L290 TraceCheckUtils]: 50: Hoare triple {50006#(<= ~counter~0 5)} assume true; {50006#(<= ~counter~0 5)} is VALID [2022-04-28 12:30:10,060 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {50006#(<= ~counter~0 5)} {50006#(<= ~counter~0 5)} #104#return; {50006#(<= ~counter~0 5)} is VALID [2022-04-28 12:30:10,060 INFO L290 TraceCheckUtils]: 52: Hoare triple {50006#(<= ~counter~0 5)} assume !(~c~0 >= 2 * ~v~0); {50006#(<= ~counter~0 5)} is VALID [2022-04-28 12:30:10,060 INFO L290 TraceCheckUtils]: 53: Hoare triple {50006#(<= ~counter~0 5)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {50006#(<= ~counter~0 5)} is VALID [2022-04-28 12:30:10,061 INFO L290 TraceCheckUtils]: 54: Hoare triple {50006#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {50079#(<= ~counter~0 6)} is VALID [2022-04-28 12:30:10,061 INFO L290 TraceCheckUtils]: 55: Hoare triple {50079#(<= ~counter~0 6)} assume !!(#t~post7 < 10);havoc #t~post7; {50079#(<= ~counter~0 6)} is VALID [2022-04-28 12:30:10,062 INFO L290 TraceCheckUtils]: 56: Hoare triple {50079#(<= ~counter~0 6)} assume !(~c~0 >= ~b~0); {50079#(<= ~counter~0 6)} is VALID [2022-04-28 12:30:10,062 INFO L290 TraceCheckUtils]: 57: Hoare triple {50079#(<= ~counter~0 6)} ~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; {50079#(<= ~counter~0 6)} is VALID [2022-04-28 12:30:10,063 INFO L290 TraceCheckUtils]: 58: Hoare triple {50079#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {50092#(<= ~counter~0 7)} is VALID [2022-04-28 12:30:10,063 INFO L290 TraceCheckUtils]: 59: Hoare triple {50092#(<= ~counter~0 7)} assume !!(#t~post6 < 10);havoc #t~post6; {50092#(<= ~counter~0 7)} is VALID [2022-04-28 12:30:10,063 INFO L290 TraceCheckUtils]: 60: Hoare triple {50092#(<= ~counter~0 7)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {50092#(<= ~counter~0 7)} is VALID [2022-04-28 12:30:10,063 INFO L290 TraceCheckUtils]: 61: Hoare triple {50092#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {50102#(<= |main_#t~post7| 7)} is VALID [2022-04-28 12:30:10,064 INFO L290 TraceCheckUtils]: 62: Hoare triple {50102#(<= |main_#t~post7| 7)} assume !(#t~post7 < 10);havoc #t~post7; {49907#false} is VALID [2022-04-28 12:30:10,064 INFO L290 TraceCheckUtils]: 63: Hoare triple {49907#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; {49907#false} is VALID [2022-04-28 12:30:10,064 INFO L290 TraceCheckUtils]: 64: Hoare triple {49907#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49907#false} is VALID [2022-04-28 12:30:10,064 INFO L290 TraceCheckUtils]: 65: Hoare triple {49907#false} assume !(#t~post6 < 10);havoc #t~post6; {49907#false} is VALID [2022-04-28 12:30:10,064 INFO L272 TraceCheckUtils]: 66: Hoare triple {49907#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)); {49907#false} is VALID [2022-04-28 12:30:10,064 INFO L290 TraceCheckUtils]: 67: Hoare triple {49907#false} ~cond := #in~cond; {49907#false} is VALID [2022-04-28 12:30:10,064 INFO L290 TraceCheckUtils]: 68: Hoare triple {49907#false} assume 0 == ~cond; {49907#false} is VALID [2022-04-28 12:30:10,064 INFO L290 TraceCheckUtils]: 69: Hoare triple {49907#false} assume !false; {49907#false} is VALID [2022-04-28 12:30:10,065 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 16 proven. 25 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 12:30:10,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:30:10,420 INFO L290 TraceCheckUtils]: 69: Hoare triple {49907#false} assume !false; {49907#false} is VALID [2022-04-28 12:30:10,420 INFO L290 TraceCheckUtils]: 68: Hoare triple {49907#false} assume 0 == ~cond; {49907#false} is VALID [2022-04-28 12:30:10,420 INFO L290 TraceCheckUtils]: 67: Hoare triple {49907#false} ~cond := #in~cond; {49907#false} is VALID [2022-04-28 12:30:10,421 INFO L272 TraceCheckUtils]: 66: Hoare triple {49907#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)); {49907#false} is VALID [2022-04-28 12:30:10,421 INFO L290 TraceCheckUtils]: 65: Hoare triple {49907#false} assume !(#t~post6 < 10);havoc #t~post6; {49907#false} is VALID [2022-04-28 12:30:10,421 INFO L290 TraceCheckUtils]: 64: Hoare triple {49907#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49907#false} is VALID [2022-04-28 12:30:10,421 INFO L290 TraceCheckUtils]: 63: Hoare triple {49907#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; {49907#false} is VALID [2022-04-28 12:30:10,421 INFO L290 TraceCheckUtils]: 62: Hoare triple {50148#(< |main_#t~post7| 10)} assume !(#t~post7 < 10);havoc #t~post7; {49907#false} is VALID [2022-04-28 12:30:10,422 INFO L290 TraceCheckUtils]: 61: Hoare triple {50152#(< ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {50148#(< |main_#t~post7| 10)} is VALID [2022-04-28 12:30:10,422 INFO L290 TraceCheckUtils]: 60: Hoare triple {50152#(< ~counter~0 10)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {50152#(< ~counter~0 10)} is VALID [2022-04-28 12:30:10,422 INFO L290 TraceCheckUtils]: 59: Hoare triple {50152#(< ~counter~0 10)} assume !!(#t~post6 < 10);havoc #t~post6; {50152#(< ~counter~0 10)} is VALID [2022-04-28 12:30:10,424 INFO L290 TraceCheckUtils]: 58: Hoare triple {50162#(< ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {50152#(< ~counter~0 10)} is VALID [2022-04-28 12:30:10,424 INFO L290 TraceCheckUtils]: 57: Hoare triple {50162#(< ~counter~0 9)} ~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; {50162#(< ~counter~0 9)} is VALID [2022-04-28 12:30:10,424 INFO L290 TraceCheckUtils]: 56: Hoare triple {50162#(< ~counter~0 9)} assume !(~c~0 >= ~b~0); {50162#(< ~counter~0 9)} is VALID [2022-04-28 12:30:10,425 INFO L290 TraceCheckUtils]: 55: Hoare triple {50162#(< ~counter~0 9)} assume !!(#t~post7 < 10);havoc #t~post7; {50162#(< ~counter~0 9)} is VALID [2022-04-28 12:30:10,425 INFO L290 TraceCheckUtils]: 54: Hoare triple {50092#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {50162#(< ~counter~0 9)} is VALID [2022-04-28 12:30:10,426 INFO L290 TraceCheckUtils]: 53: Hoare triple {50092#(<= ~counter~0 7)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {50092#(<= ~counter~0 7)} is VALID [2022-04-28 12:30:10,426 INFO L290 TraceCheckUtils]: 52: Hoare triple {50092#(<= ~counter~0 7)} assume !(~c~0 >= 2 * ~v~0); {50092#(<= ~counter~0 7)} is VALID [2022-04-28 12:30:10,427 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {49906#true} {50092#(<= ~counter~0 7)} #104#return; {50092#(<= ~counter~0 7)} is VALID [2022-04-28 12:30:10,427 INFO L290 TraceCheckUtils]: 50: Hoare triple {49906#true} assume true; {49906#true} is VALID [2022-04-28 12:30:10,427 INFO L290 TraceCheckUtils]: 49: Hoare triple {49906#true} assume !(0 == ~cond); {49906#true} is VALID [2022-04-28 12:30:10,427 INFO L290 TraceCheckUtils]: 48: Hoare triple {49906#true} ~cond := #in~cond; {49906#true} is VALID [2022-04-28 12:30:10,427 INFO L272 TraceCheckUtils]: 47: Hoare triple {50092#(<= ~counter~0 7)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {49906#true} is VALID [2022-04-28 12:30:10,428 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {49906#true} {50092#(<= ~counter~0 7)} #102#return; {50092#(<= ~counter~0 7)} is VALID [2022-04-28 12:30:10,428 INFO L290 TraceCheckUtils]: 45: Hoare triple {49906#true} assume true; {49906#true} is VALID [2022-04-28 12:30:10,428 INFO L290 TraceCheckUtils]: 44: Hoare triple {49906#true} assume !(0 == ~cond); {49906#true} is VALID [2022-04-28 12:30:10,429 INFO L290 TraceCheckUtils]: 43: Hoare triple {49906#true} ~cond := #in~cond; {49906#true} is VALID [2022-04-28 12:30:10,429 INFO L272 TraceCheckUtils]: 42: Hoare triple {50092#(<= ~counter~0 7)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {49906#true} is VALID [2022-04-28 12:30:10,429 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {49906#true} {50092#(<= ~counter~0 7)} #100#return; {50092#(<= ~counter~0 7)} is VALID [2022-04-28 12:30:10,429 INFO L290 TraceCheckUtils]: 40: Hoare triple {49906#true} assume true; {49906#true} is VALID [2022-04-28 12:30:10,430 INFO L290 TraceCheckUtils]: 39: Hoare triple {49906#true} assume !(0 == ~cond); {49906#true} is VALID [2022-04-28 12:30:10,430 INFO L290 TraceCheckUtils]: 38: Hoare triple {49906#true} ~cond := #in~cond; {49906#true} is VALID [2022-04-28 12:30:10,430 INFO L272 TraceCheckUtils]: 37: Hoare triple {50092#(<= ~counter~0 7)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {49906#true} is VALID [2022-04-28 12:30:10,431 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {49906#true} {50092#(<= ~counter~0 7)} #98#return; {50092#(<= ~counter~0 7)} is VALID [2022-04-28 12:30:10,431 INFO L290 TraceCheckUtils]: 35: Hoare triple {49906#true} assume true; {49906#true} is VALID [2022-04-28 12:30:10,431 INFO L290 TraceCheckUtils]: 34: Hoare triple {49906#true} assume !(0 == ~cond); {49906#true} is VALID [2022-04-28 12:30:10,431 INFO L290 TraceCheckUtils]: 33: Hoare triple {49906#true} ~cond := #in~cond; {49906#true} is VALID [2022-04-28 12:30:10,431 INFO L272 TraceCheckUtils]: 32: Hoare triple {50092#(<= ~counter~0 7)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {49906#true} is VALID [2022-04-28 12:30:10,431 INFO L290 TraceCheckUtils]: 31: Hoare triple {50092#(<= ~counter~0 7)} assume !!(#t~post8 < 10);havoc #t~post8; {50092#(<= ~counter~0 7)} is VALID [2022-04-28 12:30:10,433 INFO L290 TraceCheckUtils]: 30: Hoare triple {50079#(<= ~counter~0 6)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {50092#(<= ~counter~0 7)} is VALID [2022-04-28 12:30:10,433 INFO L290 TraceCheckUtils]: 29: Hoare triple {50079#(<= ~counter~0 6)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {50079#(<= ~counter~0 6)} is VALID [2022-04-28 12:30:10,433 INFO L290 TraceCheckUtils]: 28: Hoare triple {50079#(<= ~counter~0 6)} assume !!(#t~post7 < 10);havoc #t~post7; {50079#(<= ~counter~0 6)} is VALID [2022-04-28 12:30:10,434 INFO L290 TraceCheckUtils]: 27: Hoare triple {50006#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {50079#(<= ~counter~0 6)} is VALID [2022-04-28 12:30:10,435 INFO L290 TraceCheckUtils]: 26: Hoare triple {50006#(<= ~counter~0 5)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {50006#(<= ~counter~0 5)} is VALID [2022-04-28 12:30:10,435 INFO L290 TraceCheckUtils]: 25: Hoare triple {50006#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {50006#(<= ~counter~0 5)} is VALID [2022-04-28 12:30:10,436 INFO L290 TraceCheckUtils]: 24: Hoare triple {49996#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {50006#(<= ~counter~0 5)} is VALID [2022-04-28 12:30:10,436 INFO L290 TraceCheckUtils]: 23: Hoare triple {49996#(<= ~counter~0 4)} ~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; {49996#(<= ~counter~0 4)} is VALID [2022-04-28 12:30:10,437 INFO L290 TraceCheckUtils]: 22: Hoare triple {49996#(<= ~counter~0 4)} assume !(~c~0 >= ~b~0); {49996#(<= ~counter~0 4)} is VALID [2022-04-28 12:30:10,437 INFO L290 TraceCheckUtils]: 21: Hoare triple {49996#(<= ~counter~0 4)} assume !!(#t~post7 < 10);havoc #t~post7; {49996#(<= ~counter~0 4)} is VALID [2022-04-28 12:30:10,438 INFO L290 TraceCheckUtils]: 20: Hoare triple {49986#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {49996#(<= ~counter~0 4)} is VALID [2022-04-28 12:30:10,438 INFO L290 TraceCheckUtils]: 19: Hoare triple {49986#(<= ~counter~0 3)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {49986#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:10,439 INFO L290 TraceCheckUtils]: 18: Hoare triple {49986#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {49986#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:10,439 INFO L290 TraceCheckUtils]: 17: Hoare triple {49973#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49986#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:10,440 INFO L290 TraceCheckUtils]: 16: Hoare triple {49973#(<= ~counter~0 2)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {49973#(<= ~counter~0 2)} is VALID [2022-04-28 12:30:10,440 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {49906#true} {49973#(<= ~counter~0 2)} #96#return; {49973#(<= ~counter~0 2)} is VALID [2022-04-28 12:30:10,441 INFO L290 TraceCheckUtils]: 14: Hoare triple {49906#true} assume true; {49906#true} is VALID [2022-04-28 12:30:10,441 INFO L290 TraceCheckUtils]: 13: Hoare triple {49906#true} assume !(0 == ~cond); {49906#true} is VALID [2022-04-28 12:30:10,441 INFO L290 TraceCheckUtils]: 12: Hoare triple {49906#true} ~cond := #in~cond; {49906#true} is VALID [2022-04-28 12:30:10,441 INFO L272 TraceCheckUtils]: 11: Hoare triple {49973#(<= ~counter~0 2)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {49906#true} is VALID [2022-04-28 12:30:10,442 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {49906#true} {49973#(<= ~counter~0 2)} #94#return; {49973#(<= ~counter~0 2)} is VALID [2022-04-28 12:30:10,442 INFO L290 TraceCheckUtils]: 9: Hoare triple {49906#true} assume true; {49906#true} is VALID [2022-04-28 12:30:10,442 INFO L290 TraceCheckUtils]: 8: Hoare triple {49906#true} assume !(0 == ~cond); {49906#true} is VALID [2022-04-28 12:30:10,442 INFO L290 TraceCheckUtils]: 7: Hoare triple {49906#true} ~cond := #in~cond; {49906#true} is VALID [2022-04-28 12:30:10,442 INFO L272 TraceCheckUtils]: 6: Hoare triple {49973#(<= ~counter~0 2)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {49906#true} is VALID [2022-04-28 12:30:10,442 INFO L290 TraceCheckUtils]: 5: Hoare triple {49973#(<= ~counter~0 2)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {49973#(<= ~counter~0 2)} is VALID [2022-04-28 12:30:10,443 INFO L272 TraceCheckUtils]: 4: Hoare triple {49973#(<= ~counter~0 2)} call #t~ret9 := main(); {49973#(<= ~counter~0 2)} is VALID [2022-04-28 12:30:10,443 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49973#(<= ~counter~0 2)} {49906#true} #108#return; {49973#(<= ~counter~0 2)} is VALID [2022-04-28 12:30:10,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {49973#(<= ~counter~0 2)} assume true; {49973#(<= ~counter~0 2)} is VALID [2022-04-28 12:30:10,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {49906#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);~counter~0 := 0; {49973#(<= ~counter~0 2)} is VALID [2022-04-28 12:30:10,445 INFO L272 TraceCheckUtils]: 0: Hoare triple {49906#true} call ULTIMATE.init(); {49906#true} is VALID [2022-04-28 12:30:10,445 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 16 proven. 25 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 12:30:10,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:30:10,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547412037] [2022-04-28 12:30:10,445 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:30:10,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205427292] [2022-04-28 12:30:10,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205427292] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:30:10,446 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:30:10,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2022-04-28 12:30:10,446 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:30:10,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [495581050] [2022-04-28 12:30:10,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [495581050] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:30:10,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:30:10,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 12:30:10,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193211733] [2022-04-28 12:30:10,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:30:10,447 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 70 [2022-04-28 12:30:10,447 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:30:10,447 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 12:30:10,501 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 12:30:10,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 12:30:10,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:30:10,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 12:30:10,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 12:30:10,502 INFO L87 Difference]: Start difference. First operand 575 states and 786 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 12:30:12,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:30:12,748 INFO L93 Difference]: Finished difference Result 918 states and 1274 transitions. [2022-04-28 12:30:12,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 12:30:12,748 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 70 [2022-04-28 12:30:12,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:30:12,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 12:30:12,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 210 transitions. [2022-04-28 12:30:12,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 12:30:12,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 210 transitions. [2022-04-28 12:30:12,752 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 210 transitions. [2022-04-28 12:30:12,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 210 edges. 210 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:30:12,950 INFO L225 Difference]: With dead ends: 918 [2022-04-28 12:30:12,950 INFO L226 Difference]: Without dead ends: 688 [2022-04-28 12:30:12,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=127, Invalid=215, Unknown=0, NotChecked=0, Total=342 [2022-04-28 12:30:12,952 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 139 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 12:30:12,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 261 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 12:30:12,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2022-04-28 12:30:14,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 658. [2022-04-28 12:30:14,548 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:30:14,549 INFO L82 GeneralOperation]: Start isEquivalent. First operand 688 states. Second operand has 658 states, 457 states have (on average 1.2735229759299782) internal successors, (582), 460 states have internal predecessors, (582), 151 states have call successors, (151), 50 states have call predecessors, (151), 49 states have return successors, (147), 147 states have call predecessors, (147), 147 states have call successors, (147) [2022-04-28 12:30:14,549 INFO L74 IsIncluded]: Start isIncluded. First operand 688 states. Second operand has 658 states, 457 states have (on average 1.2735229759299782) internal successors, (582), 460 states have internal predecessors, (582), 151 states have call successors, (151), 50 states have call predecessors, (151), 49 states have return successors, (147), 147 states have call predecessors, (147), 147 states have call successors, (147) [2022-04-28 12:30:14,550 INFO L87 Difference]: Start difference. First operand 688 states. Second operand has 658 states, 457 states have (on average 1.2735229759299782) internal successors, (582), 460 states have internal predecessors, (582), 151 states have call successors, (151), 50 states have call predecessors, (151), 49 states have return successors, (147), 147 states have call predecessors, (147), 147 states have call successors, (147) [2022-04-28 12:30:14,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:30:14,573 INFO L93 Difference]: Finished difference Result 688 states and 910 transitions. [2022-04-28 12:30:14,573 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 910 transitions. [2022-04-28 12:30:14,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:30:14,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:30:14,576 INFO L74 IsIncluded]: Start isIncluded. First operand has 658 states, 457 states have (on average 1.2735229759299782) internal successors, (582), 460 states have internal predecessors, (582), 151 states have call successors, (151), 50 states have call predecessors, (151), 49 states have return successors, (147), 147 states have call predecessors, (147), 147 states have call successors, (147) Second operand 688 states. [2022-04-28 12:30:14,576 INFO L87 Difference]: Start difference. First operand has 658 states, 457 states have (on average 1.2735229759299782) internal successors, (582), 460 states have internal predecessors, (582), 151 states have call successors, (151), 50 states have call predecessors, (151), 49 states have return successors, (147), 147 states have call predecessors, (147), 147 states have call successors, (147) Second operand 688 states. [2022-04-28 12:30:14,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:30:14,600 INFO L93 Difference]: Finished difference Result 688 states and 910 transitions. [2022-04-28 12:30:14,600 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 910 transitions. [2022-04-28 12:30:14,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:30:14,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:30:14,602 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:30:14,602 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:30:14,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 457 states have (on average 1.2735229759299782) internal successors, (582), 460 states have internal predecessors, (582), 151 states have call successors, (151), 50 states have call predecessors, (151), 49 states have return successors, (147), 147 states have call predecessors, (147), 147 states have call successors, (147) [2022-04-28 12:30:14,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 880 transitions. [2022-04-28 12:30:14,634 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 880 transitions. Word has length 70 [2022-04-28 12:30:14,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:30:14,634 INFO L495 AbstractCegarLoop]: Abstraction has 658 states and 880 transitions. [2022-04-28 12:30:14,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 12:30:14,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 658 states and 880 transitions. [2022-04-28 12:30:16,076 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 880 edges. 880 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:30:16,076 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 880 transitions. [2022-04-28 12:30:16,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-28 12:30:16,077 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:30:16,077 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 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, 1, 1, 1, 1] [2022-04-28 12:30:16,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-28 12:30:16,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-28 12:30:16,278 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:30:16,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:30:16,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1546062343, now seen corresponding path program 1 times [2022-04-28 12:30:16,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:30:16,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [490374034] [2022-04-28 12:30:16,279 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:30:16,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1546062343, now seen corresponding path program 2 times [2022-04-28 12:30:16,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:30:16,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571013072] [2022-04-28 12:30:16,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:30:16,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:30:16,291 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:30:16,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [720742738] [2022-04-28 12:30:16,291 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:30:16,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:30:16,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:30:16,292 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:30:16,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-28 12:30:16,343 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:30:16,343 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:30:16,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 12:30:16,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:30:16,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:30:16,551 INFO L272 TraceCheckUtils]: 0: Hoare triple {54877#true} call ULTIMATE.init(); {54877#true} is VALID [2022-04-28 12:30:16,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {54877#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);~counter~0 := 0; {54877#true} is VALID [2022-04-28 12:30:16,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {54877#true} assume true; {54877#true} is VALID [2022-04-28 12:30:16,552 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54877#true} {54877#true} #108#return; {54877#true} is VALID [2022-04-28 12:30:16,552 INFO L272 TraceCheckUtils]: 4: Hoare triple {54877#true} call #t~ret9 := main(); {54877#true} is VALID [2022-04-28 12:30:16,552 INFO L290 TraceCheckUtils]: 5: Hoare triple {54877#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {54877#true} is VALID [2022-04-28 12:30:16,552 INFO L272 TraceCheckUtils]: 6: Hoare triple {54877#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {54877#true} is VALID [2022-04-28 12:30:16,552 INFO L290 TraceCheckUtils]: 7: Hoare triple {54877#true} ~cond := #in~cond; {54877#true} is VALID [2022-04-28 12:30:16,552 INFO L290 TraceCheckUtils]: 8: Hoare triple {54877#true} assume !(0 == ~cond); {54877#true} is VALID [2022-04-28 12:30:16,552 INFO L290 TraceCheckUtils]: 9: Hoare triple {54877#true} assume true; {54877#true} is VALID [2022-04-28 12:30:16,552 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {54877#true} {54877#true} #94#return; {54877#true} is VALID [2022-04-28 12:30:16,553 INFO L272 TraceCheckUtils]: 11: Hoare triple {54877#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {54877#true} is VALID [2022-04-28 12:30:16,553 INFO L290 TraceCheckUtils]: 12: Hoare triple {54877#true} ~cond := #in~cond; {54877#true} is VALID [2022-04-28 12:30:16,553 INFO L290 TraceCheckUtils]: 13: Hoare triple {54877#true} assume !(0 == ~cond); {54877#true} is VALID [2022-04-28 12:30:16,553 INFO L290 TraceCheckUtils]: 14: Hoare triple {54877#true} assume true; {54877#true} is VALID [2022-04-28 12:30:16,553 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {54877#true} {54877#true} #96#return; {54877#true} is VALID [2022-04-28 12:30:16,553 INFO L290 TraceCheckUtils]: 16: Hoare triple {54877#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {54877#true} is VALID [2022-04-28 12:30:16,553 INFO L290 TraceCheckUtils]: 17: Hoare triple {54877#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {54877#true} is VALID [2022-04-28 12:30:16,553 INFO L290 TraceCheckUtils]: 18: Hoare triple {54877#true} assume !!(#t~post6 < 10);havoc #t~post6; {54877#true} is VALID [2022-04-28 12:30:16,553 INFO L290 TraceCheckUtils]: 19: Hoare triple {54877#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {54877#true} is VALID [2022-04-28 12:30:16,553 INFO L290 TraceCheckUtils]: 20: Hoare triple {54877#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {54877#true} is VALID [2022-04-28 12:30:16,553 INFO L290 TraceCheckUtils]: 21: Hoare triple {54877#true} assume !!(#t~post7 < 10);havoc #t~post7; {54877#true} is VALID [2022-04-28 12:30:16,553 INFO L290 TraceCheckUtils]: 22: Hoare triple {54877#true} assume !(~c~0 >= ~b~0); {54877#true} is VALID [2022-04-28 12:30:16,554 INFO L290 TraceCheckUtils]: 23: Hoare triple {54877#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; {54877#true} is VALID [2022-04-28 12:30:16,554 INFO L290 TraceCheckUtils]: 24: Hoare triple {54877#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {54877#true} is VALID [2022-04-28 12:30:16,554 INFO L290 TraceCheckUtils]: 25: Hoare triple {54877#true} assume !!(#t~post6 < 10);havoc #t~post6; {54877#true} is VALID [2022-04-28 12:30:16,554 INFO L290 TraceCheckUtils]: 26: Hoare triple {54877#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {54877#true} is VALID [2022-04-28 12:30:16,554 INFO L290 TraceCheckUtils]: 27: Hoare triple {54877#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {54877#true} is VALID [2022-04-28 12:30:16,554 INFO L290 TraceCheckUtils]: 28: Hoare triple {54877#true} assume !!(#t~post7 < 10);havoc #t~post7; {54877#true} is VALID [2022-04-28 12:30:16,554 INFO L290 TraceCheckUtils]: 29: Hoare triple {54877#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {54877#true} is VALID [2022-04-28 12:30:16,554 INFO L290 TraceCheckUtils]: 30: Hoare triple {54877#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {54877#true} is VALID [2022-04-28 12:30:16,554 INFO L290 TraceCheckUtils]: 31: Hoare triple {54877#true} assume !!(#t~post8 < 10);havoc #t~post8; {54877#true} is VALID [2022-04-28 12:30:16,554 INFO L272 TraceCheckUtils]: 32: Hoare triple {54877#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {54877#true} is VALID [2022-04-28 12:30:16,554 INFO L290 TraceCheckUtils]: 33: Hoare triple {54877#true} ~cond := #in~cond; {54877#true} is VALID [2022-04-28 12:30:16,554 INFO L290 TraceCheckUtils]: 34: Hoare triple {54877#true} assume !(0 == ~cond); {54877#true} is VALID [2022-04-28 12:30:16,555 INFO L290 TraceCheckUtils]: 35: Hoare triple {54877#true} assume true; {54877#true} is VALID [2022-04-28 12:30:16,555 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {54877#true} {54877#true} #98#return; {54877#true} is VALID [2022-04-28 12:30:16,555 INFO L272 TraceCheckUtils]: 37: Hoare triple {54877#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {54877#true} is VALID [2022-04-28 12:30:16,555 INFO L290 TraceCheckUtils]: 38: Hoare triple {54877#true} ~cond := #in~cond; {54996#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:30:16,555 INFO L290 TraceCheckUtils]: 39: Hoare triple {54996#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {55000#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:30:16,556 INFO L290 TraceCheckUtils]: 40: Hoare triple {55000#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {55000#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:30:16,556 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {55000#(not (= |__VERIFIER_assert_#in~cond| 0))} {54877#true} #100#return; {55007#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:30:16,556 INFO L272 TraceCheckUtils]: 42: Hoare triple {55007#(= 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)); {54877#true} is VALID [2022-04-28 12:30:16,556 INFO L290 TraceCheckUtils]: 43: Hoare triple {54877#true} ~cond := #in~cond; {54877#true} is VALID [2022-04-28 12:30:16,557 INFO L290 TraceCheckUtils]: 44: Hoare triple {54877#true} assume !(0 == ~cond); {54877#true} is VALID [2022-04-28 12:30:16,557 INFO L290 TraceCheckUtils]: 45: Hoare triple {54877#true} assume true; {54877#true} is VALID [2022-04-28 12:30:16,557 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {54877#true} {55007#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #102#return; {55007#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:30:16,557 INFO L272 TraceCheckUtils]: 47: Hoare triple {55007#(= 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)); {54877#true} is VALID [2022-04-28 12:30:16,557 INFO L290 TraceCheckUtils]: 48: Hoare triple {54877#true} ~cond := #in~cond; {54877#true} is VALID [2022-04-28 12:30:16,557 INFO L290 TraceCheckUtils]: 49: Hoare triple {54877#true} assume !(0 == ~cond); {54877#true} is VALID [2022-04-28 12:30:16,558 INFO L290 TraceCheckUtils]: 50: Hoare triple {54877#true} assume true; {54877#true} is VALID [2022-04-28 12:30:16,558 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {54877#true} {55007#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #104#return; {55007#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:30:16,559 INFO L290 TraceCheckUtils]: 52: Hoare triple {55007#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= 2 * ~v~0); {55007#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:30:16,559 INFO L290 TraceCheckUtils]: 53: Hoare triple {55007#(= 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; {55007#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:30:16,559 INFO L290 TraceCheckUtils]: 54: Hoare triple {55007#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {55007#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:30:16,560 INFO L290 TraceCheckUtils]: 55: Hoare triple {55007#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post7 < 10);havoc #t~post7; {55007#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:30:16,560 INFO L290 TraceCheckUtils]: 56: Hoare triple {55007#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= ~b~0); {55007#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:30:16,560 INFO L290 TraceCheckUtils]: 57: Hoare triple {55007#(= 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; {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:30:16,561 INFO L290 TraceCheckUtils]: 58: Hoare triple {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:30:16,561 INFO L290 TraceCheckUtils]: 59: Hoare triple {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post6 < 10);havoc #t~post6; {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:30:16,561 INFO L290 TraceCheckUtils]: 60: Hoare triple {55056#(= 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; {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:30:16,562 INFO L290 TraceCheckUtils]: 61: Hoare triple {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:30:16,562 INFO L290 TraceCheckUtils]: 62: Hoare triple {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post7 < 10);havoc #t~post7; {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:30:16,563 INFO L290 TraceCheckUtils]: 63: Hoare triple {55056#(= 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; {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:30:16,563 INFO L290 TraceCheckUtils]: 64: Hoare triple {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:30:16,563 INFO L290 TraceCheckUtils]: 65: Hoare triple {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post8 < 10);havoc #t~post8; {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:30:16,564 INFO L272 TraceCheckUtils]: 66: Hoare triple {55056#(= 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)); {55084#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:30:16,564 INFO L290 TraceCheckUtils]: 67: Hoare triple {55084#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {55088#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:30:16,565 INFO L290 TraceCheckUtils]: 68: Hoare triple {55088#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {54878#false} is VALID [2022-04-28 12:30:16,565 INFO L290 TraceCheckUtils]: 69: Hoare triple {54878#false} assume !false; {54878#false} is VALID [2022-04-28 12:30:16,565 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 32 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-28 12:30:16,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:30:28,217 INFO L290 TraceCheckUtils]: 69: Hoare triple {54878#false} assume !false; {54878#false} is VALID [2022-04-28 12:30:28,217 INFO L290 TraceCheckUtils]: 68: Hoare triple {55088#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {54878#false} is VALID [2022-04-28 12:30:28,218 INFO L290 TraceCheckUtils]: 67: Hoare triple {55084#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {55088#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:30:28,218 INFO L272 TraceCheckUtils]: 66: Hoare triple {55056#(= 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)); {55084#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:30:28,219 INFO L290 TraceCheckUtils]: 65: Hoare triple {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post8 < 10);havoc #t~post8; {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:30:28,219 INFO L290 TraceCheckUtils]: 64: Hoare triple {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:30:28,220 INFO L290 TraceCheckUtils]: 63: Hoare triple {55056#(= 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; {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:30:28,220 INFO L290 TraceCheckUtils]: 62: Hoare triple {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post7 < 10);havoc #t~post7; {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:30:28,220 INFO L290 TraceCheckUtils]: 61: Hoare triple {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:30:28,221 INFO L290 TraceCheckUtils]: 60: Hoare triple {55056#(= 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; {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:30:28,221 INFO L290 TraceCheckUtils]: 59: Hoare triple {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post6 < 10);havoc #t~post6; {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:30:28,221 INFO L290 TraceCheckUtils]: 58: Hoare triple {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:30:28,222 INFO L290 TraceCheckUtils]: 57: Hoare triple {55007#(= 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; {55056#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:30:28,222 INFO L290 TraceCheckUtils]: 56: Hoare triple {55007#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= ~b~0); {55007#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:30:28,222 INFO L290 TraceCheckUtils]: 55: Hoare triple {55007#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post7 < 10);havoc #t~post7; {55007#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:30:28,223 INFO L290 TraceCheckUtils]: 54: Hoare triple {55007#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {55007#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:30:28,223 INFO L290 TraceCheckUtils]: 53: Hoare triple {55007#(= 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; {55007#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:30:28,224 INFO L290 TraceCheckUtils]: 52: Hoare triple {55007#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= 2 * ~v~0); {55007#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:30:28,224 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {54877#true} {55007#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #104#return; {55007#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:30:28,224 INFO L290 TraceCheckUtils]: 50: Hoare triple {54877#true} assume true; {54877#true} is VALID [2022-04-28 12:30:28,224 INFO L290 TraceCheckUtils]: 49: Hoare triple {54877#true} assume !(0 == ~cond); {54877#true} is VALID [2022-04-28 12:30:28,224 INFO L290 TraceCheckUtils]: 48: Hoare triple {54877#true} ~cond := #in~cond; {54877#true} is VALID [2022-04-28 12:30:28,225 INFO L272 TraceCheckUtils]: 47: Hoare triple {55007#(= 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)); {54877#true} is VALID [2022-04-28 12:30:28,225 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {54877#true} {55007#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #102#return; {55007#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:30:28,225 INFO L290 TraceCheckUtils]: 45: Hoare triple {54877#true} assume true; {54877#true} is VALID [2022-04-28 12:30:28,225 INFO L290 TraceCheckUtils]: 44: Hoare triple {54877#true} assume !(0 == ~cond); {54877#true} is VALID [2022-04-28 12:30:28,225 INFO L290 TraceCheckUtils]: 43: Hoare triple {54877#true} ~cond := #in~cond; {54877#true} is VALID [2022-04-28 12:30:28,226 INFO L272 TraceCheckUtils]: 42: Hoare triple {55007#(= 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)); {54877#true} is VALID [2022-04-28 12:30:28,226 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {55000#(not (= |__VERIFIER_assert_#in~cond| 0))} {54877#true} #100#return; {55007#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:30:28,226 INFO L290 TraceCheckUtils]: 40: Hoare triple {55000#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {55000#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:30:28,227 INFO L290 TraceCheckUtils]: 39: Hoare triple {55188#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {55000#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:30:28,227 INFO L290 TraceCheckUtils]: 38: Hoare triple {54877#true} ~cond := #in~cond; {55188#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 12:30:28,227 INFO L272 TraceCheckUtils]: 37: Hoare triple {54877#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {54877#true} is VALID [2022-04-28 12:30:28,227 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {54877#true} {54877#true} #98#return; {54877#true} is VALID [2022-04-28 12:30:28,227 INFO L290 TraceCheckUtils]: 35: Hoare triple {54877#true} assume true; {54877#true} is VALID [2022-04-28 12:30:28,227 INFO L290 TraceCheckUtils]: 34: Hoare triple {54877#true} assume !(0 == ~cond); {54877#true} is VALID [2022-04-28 12:30:28,228 INFO L290 TraceCheckUtils]: 33: Hoare triple {54877#true} ~cond := #in~cond; {54877#true} is VALID [2022-04-28 12:30:28,228 INFO L272 TraceCheckUtils]: 32: Hoare triple {54877#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {54877#true} is VALID [2022-04-28 12:30:28,228 INFO L290 TraceCheckUtils]: 31: Hoare triple {54877#true} assume !!(#t~post8 < 10);havoc #t~post8; {54877#true} is VALID [2022-04-28 12:30:28,228 INFO L290 TraceCheckUtils]: 30: Hoare triple {54877#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {54877#true} is VALID [2022-04-28 12:30:28,228 INFO L290 TraceCheckUtils]: 29: Hoare triple {54877#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {54877#true} is VALID [2022-04-28 12:30:28,228 INFO L290 TraceCheckUtils]: 28: Hoare triple {54877#true} assume !!(#t~post7 < 10);havoc #t~post7; {54877#true} is VALID [2022-04-28 12:30:28,228 INFO L290 TraceCheckUtils]: 27: Hoare triple {54877#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {54877#true} is VALID [2022-04-28 12:30:28,228 INFO L290 TraceCheckUtils]: 26: Hoare triple {54877#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {54877#true} is VALID [2022-04-28 12:30:28,228 INFO L290 TraceCheckUtils]: 25: Hoare triple {54877#true} assume !!(#t~post6 < 10);havoc #t~post6; {54877#true} is VALID [2022-04-28 12:30:28,228 INFO L290 TraceCheckUtils]: 24: Hoare triple {54877#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {54877#true} is VALID [2022-04-28 12:30:28,228 INFO L290 TraceCheckUtils]: 23: Hoare triple {54877#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; {54877#true} is VALID [2022-04-28 12:30:28,228 INFO L290 TraceCheckUtils]: 22: Hoare triple {54877#true} assume !(~c~0 >= ~b~0); {54877#true} is VALID [2022-04-28 12:30:28,229 INFO L290 TraceCheckUtils]: 21: Hoare triple {54877#true} assume !!(#t~post7 < 10);havoc #t~post7; {54877#true} is VALID [2022-04-28 12:30:28,229 INFO L290 TraceCheckUtils]: 20: Hoare triple {54877#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {54877#true} is VALID [2022-04-28 12:30:28,229 INFO L290 TraceCheckUtils]: 19: Hoare triple {54877#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {54877#true} is VALID [2022-04-28 12:30:28,229 INFO L290 TraceCheckUtils]: 18: Hoare triple {54877#true} assume !!(#t~post6 < 10);havoc #t~post6; {54877#true} is VALID [2022-04-28 12:30:28,229 INFO L290 TraceCheckUtils]: 17: Hoare triple {54877#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {54877#true} is VALID [2022-04-28 12:30:28,229 INFO L290 TraceCheckUtils]: 16: Hoare triple {54877#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {54877#true} is VALID [2022-04-28 12:30:28,229 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {54877#true} {54877#true} #96#return; {54877#true} is VALID [2022-04-28 12:30:28,229 INFO L290 TraceCheckUtils]: 14: Hoare triple {54877#true} assume true; {54877#true} is VALID [2022-04-28 12:30:28,229 INFO L290 TraceCheckUtils]: 13: Hoare triple {54877#true} assume !(0 == ~cond); {54877#true} is VALID [2022-04-28 12:30:28,229 INFO L290 TraceCheckUtils]: 12: Hoare triple {54877#true} ~cond := #in~cond; {54877#true} is VALID [2022-04-28 12:30:28,229 INFO L272 TraceCheckUtils]: 11: Hoare triple {54877#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {54877#true} is VALID [2022-04-28 12:30:28,229 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {54877#true} {54877#true} #94#return; {54877#true} is VALID [2022-04-28 12:30:28,230 INFO L290 TraceCheckUtils]: 9: Hoare triple {54877#true} assume true; {54877#true} is VALID [2022-04-28 12:30:28,230 INFO L290 TraceCheckUtils]: 8: Hoare triple {54877#true} assume !(0 == ~cond); {54877#true} is VALID [2022-04-28 12:30:28,230 INFO L290 TraceCheckUtils]: 7: Hoare triple {54877#true} ~cond := #in~cond; {54877#true} is VALID [2022-04-28 12:30:28,230 INFO L272 TraceCheckUtils]: 6: Hoare triple {54877#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {54877#true} is VALID [2022-04-28 12:30:28,230 INFO L290 TraceCheckUtils]: 5: Hoare triple {54877#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {54877#true} is VALID [2022-04-28 12:30:28,230 INFO L272 TraceCheckUtils]: 4: Hoare triple {54877#true} call #t~ret9 := main(); {54877#true} is VALID [2022-04-28 12:30:28,230 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54877#true} {54877#true} #108#return; {54877#true} is VALID [2022-04-28 12:30:28,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {54877#true} assume true; {54877#true} is VALID [2022-04-28 12:30:28,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {54877#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);~counter~0 := 0; {54877#true} is VALID [2022-04-28 12:30:28,230 INFO L272 TraceCheckUtils]: 0: Hoare triple {54877#true} call ULTIMATE.init(); {54877#true} is VALID [2022-04-28 12:30:28,231 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 32 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-28 12:30:28,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:30:28,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571013072] [2022-04-28 12:30:28,231 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:30:28,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720742738] [2022-04-28 12:30:28,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720742738] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:30:28,231 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:30:28,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-28 12:30:28,231 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:30:28,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [490374034] [2022-04-28 12:30:28,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [490374034] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:30:28,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:30:28,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 12:30:28,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966101008] [2022-04-28 12:30:28,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:30:28,232 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2022-04-28 12:30:28,232 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:30:28,232 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 12:30:28,275 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:30:28,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 12:30:28,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:30:28,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 12:30:28,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-28 12:30:28,276 INFO L87 Difference]: Start difference. First operand 658 states and 880 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 12:30:30,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:30:30,672 INFO L93 Difference]: Finished difference Result 757 states and 1022 transitions. [2022-04-28 12:30:30,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 12:30:30,673 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2022-04-28 12:30:30,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:30:30,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 12:30:30,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 85 transitions. [2022-04-28 12:30:30,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 12:30:30,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 85 transitions. [2022-04-28 12:30:30,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 85 transitions. [2022-04-28 12:30:30,742 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 12:30:30,770 INFO L225 Difference]: With dead ends: 757 [2022-04-28 12:30:30,770 INFO L226 Difference]: Without dead ends: 755 [2022-04-28 12:30:30,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 132 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 12:30:30,771 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 30 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 12:30:30,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 212 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 12:30:30,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2022-04-28 12:30:32,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 748. [2022-04-28 12:30:32,716 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:30:32,717 INFO L82 GeneralOperation]: Start isEquivalent. First operand 755 states. Second operand has 748 states, 537 states have (on average 1.297951582867784) internal successors, (697), 546 states have internal predecessors, (697), 160 states have call successors, (160), 51 states have call predecessors, (160), 50 states have return successors, (156), 150 states have call predecessors, (156), 156 states have call successors, (156) [2022-04-28 12:30:32,718 INFO L74 IsIncluded]: Start isIncluded. First operand 755 states. Second operand has 748 states, 537 states have (on average 1.297951582867784) internal successors, (697), 546 states have internal predecessors, (697), 160 states have call successors, (160), 51 states have call predecessors, (160), 50 states have return successors, (156), 150 states have call predecessors, (156), 156 states have call successors, (156) [2022-04-28 12:30:32,718 INFO L87 Difference]: Start difference. First operand 755 states. Second operand has 748 states, 537 states have (on average 1.297951582867784) internal successors, (697), 546 states have internal predecessors, (697), 160 states have call successors, (160), 51 states have call predecessors, (160), 50 states have return successors, (156), 150 states have call predecessors, (156), 156 states have call successors, (156) [2022-04-28 12:30:32,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:30:32,736 INFO L93 Difference]: Finished difference Result 755 states and 1020 transitions. [2022-04-28 12:30:32,736 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1020 transitions. [2022-04-28 12:30:32,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:30:32,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:30:32,738 INFO L74 IsIncluded]: Start isIncluded. First operand has 748 states, 537 states have (on average 1.297951582867784) internal successors, (697), 546 states have internal predecessors, (697), 160 states have call successors, (160), 51 states have call predecessors, (160), 50 states have return successors, (156), 150 states have call predecessors, (156), 156 states have call successors, (156) Second operand 755 states. [2022-04-28 12:30:32,739 INFO L87 Difference]: Start difference. First operand has 748 states, 537 states have (on average 1.297951582867784) internal successors, (697), 546 states have internal predecessors, (697), 160 states have call successors, (160), 51 states have call predecessors, (160), 50 states have return successors, (156), 150 states have call predecessors, (156), 156 states have call successors, (156) Second operand 755 states. [2022-04-28 12:30:32,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:30:32,766 INFO L93 Difference]: Finished difference Result 755 states and 1020 transitions. [2022-04-28 12:30:32,766 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1020 transitions. [2022-04-28 12:30:32,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:30:32,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:30:32,768 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:30:32,768 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:30:32,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 537 states have (on average 1.297951582867784) internal successors, (697), 546 states have internal predecessors, (697), 160 states have call successors, (160), 51 states have call predecessors, (160), 50 states have return successors, (156), 150 states have call predecessors, (156), 156 states have call successors, (156) [2022-04-28 12:30:32,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1013 transitions. [2022-04-28 12:30:32,812 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1013 transitions. Word has length 70 [2022-04-28 12:30:32,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:30:32,813 INFO L495 AbstractCegarLoop]: Abstraction has 748 states and 1013 transitions. [2022-04-28 12:30:32,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 12:30:32,813 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 748 states and 1013 transitions. [2022-04-28 12:30:34,488 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1013 edges. 1013 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:30:34,489 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1013 transitions. [2022-04-28 12:30:34,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-28 12:30:34,490 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:30:34,490 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 4, 3, 3, 3, 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] [2022-04-28 12:30:34,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-04-28 12:30:34,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-28 12:30:34,703 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:30:34,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:30:34,704 INFO L85 PathProgramCache]: Analyzing trace with hash -705069158, now seen corresponding path program 3 times [2022-04-28 12:30:34,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:30:34,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2062530990] [2022-04-28 12:30:34,704 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:30:34,704 INFO L85 PathProgramCache]: Analyzing trace with hash -705069158, now seen corresponding path program 4 times [2022-04-28 12:30:34,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:30:34,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31056477] [2022-04-28 12:30:34,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:30:34,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:30:34,715 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:30:34,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [162065207] [2022-04-28 12:30:34,716 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 12:30:34,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:30:34,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:30:34,717 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:30:34,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-28 12:30:34,770 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 12:30:34,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:30:34,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 65 conjunts are in the unsatisfiable core [2022-04-28 12:30:34,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:30:34,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:30:35,730 INFO L272 TraceCheckUtils]: 0: Hoare triple {59832#true} call ULTIMATE.init(); {59832#true} is VALID [2022-04-28 12:30:35,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {59832#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);~counter~0 := 0; {59832#true} is VALID [2022-04-28 12:30:35,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {59832#true} assume true; {59832#true} is VALID [2022-04-28 12:30:35,731 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59832#true} {59832#true} #108#return; {59832#true} is VALID [2022-04-28 12:30:35,731 INFO L272 TraceCheckUtils]: 4: Hoare triple {59832#true} call #t~ret9 := main(); {59832#true} is VALID [2022-04-28 12:30:35,731 INFO L290 TraceCheckUtils]: 5: Hoare triple {59832#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {59832#true} is VALID [2022-04-28 12:30:35,731 INFO L272 TraceCheckUtils]: 6: Hoare triple {59832#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {59832#true} is VALID [2022-04-28 12:30:35,731 INFO L290 TraceCheckUtils]: 7: Hoare triple {59832#true} ~cond := #in~cond; {59832#true} is VALID [2022-04-28 12:30:35,731 INFO L290 TraceCheckUtils]: 8: Hoare triple {59832#true} assume !(0 == ~cond); {59832#true} is VALID [2022-04-28 12:30:35,731 INFO L290 TraceCheckUtils]: 9: Hoare triple {59832#true} assume true; {59832#true} is VALID [2022-04-28 12:30:35,731 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {59832#true} {59832#true} #94#return; {59832#true} is VALID [2022-04-28 12:30:35,731 INFO L272 TraceCheckUtils]: 11: Hoare triple {59832#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {59832#true} is VALID [2022-04-28 12:30:35,732 INFO L290 TraceCheckUtils]: 12: Hoare triple {59832#true} ~cond := #in~cond; {59832#true} is VALID [2022-04-28 12:30:35,732 INFO L290 TraceCheckUtils]: 13: Hoare triple {59832#true} assume !(0 == ~cond); {59832#true} is VALID [2022-04-28 12:30:35,732 INFO L290 TraceCheckUtils]: 14: Hoare triple {59832#true} assume true; {59832#true} is VALID [2022-04-28 12:30:35,732 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {59832#true} {59832#true} #96#return; {59832#true} is VALID [2022-04-28 12:30:35,732 INFO L290 TraceCheckUtils]: 16: Hoare triple {59832#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {59885#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:35,733 INFO L290 TraceCheckUtils]: 17: Hoare triple {59885#(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))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {59885#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:35,733 INFO L290 TraceCheckUtils]: 18: Hoare triple {59885#(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 !!(#t~post6 < 10);havoc #t~post6; {59885#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:35,733 INFO L290 TraceCheckUtils]: 19: Hoare triple {59885#(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; {59895#(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 12:30:35,734 INFO L290 TraceCheckUtils]: 20: Hoare triple {59895#(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))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {59895#(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 12:30:35,734 INFO L290 TraceCheckUtils]: 21: Hoare triple {59895#(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 !!(#t~post7 < 10);havoc #t~post7; {59895#(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 12:30:35,735 INFO L290 TraceCheckUtils]: 22: Hoare triple {59895#(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); {59895#(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 12:30:35,735 INFO L290 TraceCheckUtils]: 23: Hoare triple {59895#(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; {59908#(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) (= main_~q~0 1))} is VALID [2022-04-28 12:30:35,736 INFO L290 TraceCheckUtils]: 24: Hoare triple {59908#(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) (= main_~q~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {59908#(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) (= main_~q~0 1))} is VALID [2022-04-28 12:30:35,736 INFO L290 TraceCheckUtils]: 25: Hoare triple {59908#(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) (= main_~q~0 1))} assume !!(#t~post6 < 10);havoc #t~post6; {59908#(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) (= main_~q~0 1))} is VALID [2022-04-28 12:30:35,736 INFO L290 TraceCheckUtils]: 26: Hoare triple {59908#(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) (= main_~q~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {59918#(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) (= main_~q~0 1))} is VALID [2022-04-28 12:30:35,737 INFO L290 TraceCheckUtils]: 27: Hoare triple {59918#(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) (= main_~q~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {59918#(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) (= main_~q~0 1))} is VALID [2022-04-28 12:30:35,737 INFO L290 TraceCheckUtils]: 28: Hoare triple {59918#(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) (= main_~q~0 1))} assume !!(#t~post7 < 10);havoc #t~post7; {59918#(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) (= main_~q~0 1))} is VALID [2022-04-28 12:30:35,738 INFO L290 TraceCheckUtils]: 29: Hoare triple {59918#(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) (= main_~q~0 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {59928#(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) (= main_~q~0 1))} is VALID [2022-04-28 12:30:35,738 INFO L290 TraceCheckUtils]: 30: Hoare triple {59928#(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) (= main_~q~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {59928#(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) (= main_~q~0 1))} is VALID [2022-04-28 12:30:35,739 INFO L290 TraceCheckUtils]: 31: Hoare triple {59928#(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) (= main_~q~0 1))} assume !!(#t~post8 < 10);havoc #t~post8; {59928#(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) (= main_~q~0 1))} is VALID [2022-04-28 12:30:35,739 INFO L272 TraceCheckUtils]: 32: Hoare triple {59928#(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) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {59832#true} is VALID [2022-04-28 12:30:35,739 INFO L290 TraceCheckUtils]: 33: Hoare triple {59832#true} ~cond := #in~cond; {59941#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:30:35,739 INFO L290 TraceCheckUtils]: 34: Hoare triple {59941#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {59945#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:30:35,740 INFO L290 TraceCheckUtils]: 35: Hoare triple {59945#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {59945#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:30:35,741 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {59945#(not (= |__VERIFIER_assert_#in~cond| 0))} {59928#(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) (= main_~q~0 1))} #98#return; {59952#(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_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:30:35,741 INFO L272 TraceCheckUtils]: 37: Hoare triple {59952#(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_~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)); {59832#true} is VALID [2022-04-28 12:30:35,741 INFO L290 TraceCheckUtils]: 38: Hoare triple {59832#true} ~cond := #in~cond; {59941#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:30:35,741 INFO L290 TraceCheckUtils]: 39: Hoare triple {59941#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {59945#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:30:35,742 INFO L290 TraceCheckUtils]: 40: Hoare triple {59945#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {59945#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:30:35,743 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {59945#(not (= |__VERIFIER_assert_#in~cond| 0))} {59952#(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_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #100#return; {59968#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 1) (= main_~x~0 main_~v~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 12:30:35,743 INFO L272 TraceCheckUtils]: 42: Hoare triple {59968#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 1) (= main_~x~0 main_~v~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)); {59832#true} is VALID [2022-04-28 12:30:35,743 INFO L290 TraceCheckUtils]: 43: Hoare triple {59832#true} ~cond := #in~cond; {59832#true} is VALID [2022-04-28 12:30:35,743 INFO L290 TraceCheckUtils]: 44: Hoare triple {59832#true} assume !(0 == ~cond); {59832#true} is VALID [2022-04-28 12:30:35,743 INFO L290 TraceCheckUtils]: 45: Hoare triple {59832#true} assume true; {59832#true} is VALID [2022-04-28 12:30:35,744 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {59832#true} {59968#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 1) (= main_~x~0 main_~v~0) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #102#return; {59968#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 1) (= main_~x~0 main_~v~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 12:30:35,744 INFO L272 TraceCheckUtils]: 47: Hoare triple {59968#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 1) (= main_~x~0 main_~v~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)); {59832#true} is VALID [2022-04-28 12:30:35,744 INFO L290 TraceCheckUtils]: 48: Hoare triple {59832#true} ~cond := #in~cond; {59832#true} is VALID [2022-04-28 12:30:35,744 INFO L290 TraceCheckUtils]: 49: Hoare triple {59832#true} assume !(0 == ~cond); {59832#true} is VALID [2022-04-28 12:30:35,744 INFO L290 TraceCheckUtils]: 50: Hoare triple {59832#true} assume true; {59832#true} is VALID [2022-04-28 12:30:35,745 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {59832#true} {59968#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 1) (= main_~x~0 main_~v~0) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #104#return; {59968#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 1) (= main_~x~0 main_~v~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 12:30:35,745 INFO L290 TraceCheckUtils]: 52: Hoare triple {59968#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 1) (= main_~x~0 main_~v~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); {59968#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 1) (= main_~x~0 main_~v~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 12:30:35,746 INFO L290 TraceCheckUtils]: 53: Hoare triple {59968#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~d~0 1) (= main_~x~0 main_~v~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; {60005#(and (= main_~s~0 0) (= (+ main_~c~0 main_~x~0) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= main_~q~0 1))} is VALID [2022-04-28 12:30:35,747 INFO L290 TraceCheckUtils]: 54: Hoare triple {60005#(and (= main_~s~0 0) (= (+ main_~c~0 main_~x~0) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= main_~q~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60005#(and (= main_~s~0 0) (= (+ main_~c~0 main_~x~0) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= main_~q~0 1))} is VALID [2022-04-28 12:30:35,747 INFO L290 TraceCheckUtils]: 55: Hoare triple {60005#(and (= main_~s~0 0) (= (+ main_~c~0 main_~x~0) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= main_~q~0 1))} assume !!(#t~post7 < 10);havoc #t~post7; {60005#(and (= main_~s~0 0) (= (+ main_~c~0 main_~x~0) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= main_~q~0 1))} is VALID [2022-04-28 12:30:35,747 INFO L290 TraceCheckUtils]: 56: Hoare triple {60005#(and (= main_~s~0 0) (= (+ main_~c~0 main_~x~0) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= main_~q~0 1))} assume !(~c~0 >= ~b~0); {60005#(and (= main_~s~0 0) (= (+ main_~c~0 main_~x~0) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= main_~q~0 1))} is VALID [2022-04-28 12:30:35,748 INFO L290 TraceCheckUtils]: 57: Hoare triple {60005#(and (= main_~s~0 0) (= (+ main_~c~0 main_~x~0) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= main_~q~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; {60018#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} is VALID [2022-04-28 12:30:35,748 INFO L290 TraceCheckUtils]: 58: Hoare triple {60018#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60018#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} is VALID [2022-04-28 12:30:35,749 INFO L290 TraceCheckUtils]: 59: Hoare triple {60018#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} assume !!(#t~post6 < 10);havoc #t~post6; {60018#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} is VALID [2022-04-28 12:30:35,749 INFO L290 TraceCheckUtils]: 60: Hoare triple {60018#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {60018#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} is VALID [2022-04-28 12:30:35,750 INFO L290 TraceCheckUtils]: 61: Hoare triple {60018#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60018#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} is VALID [2022-04-28 12:30:35,750 INFO L290 TraceCheckUtils]: 62: Hoare triple {60018#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} assume !!(#t~post7 < 10);havoc #t~post7; {60018#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} is VALID [2022-04-28 12:30:35,750 INFO L290 TraceCheckUtils]: 63: Hoare triple {60018#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {60018#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} is VALID [2022-04-28 12:30:35,751 INFO L290 TraceCheckUtils]: 64: Hoare triple {60018#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60018#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} is VALID [2022-04-28 12:30:35,751 INFO L290 TraceCheckUtils]: 65: Hoare triple {60018#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} assume !!(#t~post8 < 10);havoc #t~post8; {60018#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} is VALID [2022-04-28 12:30:35,751 INFO L272 TraceCheckUtils]: 66: Hoare triple {60018#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {59832#true} is VALID [2022-04-28 12:30:35,751 INFO L290 TraceCheckUtils]: 67: Hoare triple {59832#true} ~cond := #in~cond; {59832#true} is VALID [2022-04-28 12:30:35,751 INFO L290 TraceCheckUtils]: 68: Hoare triple {59832#true} assume !(0 == ~cond); {59832#true} is VALID [2022-04-28 12:30:35,752 INFO L290 TraceCheckUtils]: 69: Hoare triple {59832#true} assume true; {59832#true} is VALID [2022-04-28 12:30:35,752 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {59832#true} {60018#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} #98#return; {60018#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} is VALID [2022-04-28 12:30:35,753 INFO L272 TraceCheckUtils]: 71: Hoare triple {60018#(and (= main_~s~0 1) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {60061#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:30:35,753 INFO L290 TraceCheckUtils]: 72: Hoare triple {60061#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {60065#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:30:35,753 INFO L290 TraceCheckUtils]: 73: Hoare triple {60065#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {59833#false} is VALID [2022-04-28 12:30:35,754 INFO L290 TraceCheckUtils]: 74: Hoare triple {59833#false} assume !false; {59833#false} is VALID [2022-04-28 12:30:35,754 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 8 proven. 52 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-28 12:30:35,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:31:02,272 INFO L290 TraceCheckUtils]: 74: Hoare triple {59833#false} assume !false; {59833#false} is VALID [2022-04-28 12:31:02,272 INFO L290 TraceCheckUtils]: 73: Hoare triple {60065#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {59833#false} is VALID [2022-04-28 12:31:02,273 INFO L290 TraceCheckUtils]: 72: Hoare triple {60061#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {60065#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:31:02,273 INFO L272 TraceCheckUtils]: 71: Hoare triple {60081#(= 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)); {60061#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:31:02,274 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {59832#true} {60081#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #98#return; {60081#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:31:02,274 INFO L290 TraceCheckUtils]: 69: Hoare triple {59832#true} assume true; {59832#true} is VALID [2022-04-28 12:31:02,274 INFO L290 TraceCheckUtils]: 68: Hoare triple {59832#true} assume !(0 == ~cond); {59832#true} is VALID [2022-04-28 12:31:02,274 INFO L290 TraceCheckUtils]: 67: Hoare triple {59832#true} ~cond := #in~cond; {59832#true} is VALID [2022-04-28 12:31:02,274 INFO L272 TraceCheckUtils]: 66: Hoare triple {60081#(= 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)); {59832#true} is VALID [2022-04-28 12:31:02,275 INFO L290 TraceCheckUtils]: 65: Hoare triple {60081#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post8 < 10);havoc #t~post8; {60081#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:31:02,275 INFO L290 TraceCheckUtils]: 64: Hoare triple {60081#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60081#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:31:02,275 INFO L290 TraceCheckUtils]: 63: Hoare triple {60081#(= 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; {60081#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:31:02,276 INFO L290 TraceCheckUtils]: 62: Hoare triple {60081#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post7 < 10);havoc #t~post7; {60081#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:31:02,276 INFO L290 TraceCheckUtils]: 61: Hoare triple {60081#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60081#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:31:02,277 INFO L290 TraceCheckUtils]: 60: Hoare triple {60081#(= 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; {60081#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:31:02,277 INFO L290 TraceCheckUtils]: 59: Hoare triple {60081#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post6 < 10);havoc #t~post6; {60081#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:31:02,277 INFO L290 TraceCheckUtils]: 58: Hoare triple {60081#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60081#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:31:04,279 WARN L290 TraceCheckUtils]: 57: Hoare triple {60124#(= (+ (* 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; {60081#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is UNKNOWN [2022-04-28 12:31:04,280 INFO L290 TraceCheckUtils]: 56: Hoare triple {60124#(= (+ (* 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); {60124#(= (+ (* 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 12:31:04,280 INFO L290 TraceCheckUtils]: 55: Hoare triple {60124#(= (+ (* 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 !!(#t~post7 < 10);havoc #t~post7; {60124#(= (+ (* 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 12:31:04,280 INFO L290 TraceCheckUtils]: 54: Hoare triple {60124#(= (+ (* 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)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60124#(= (+ (* 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 12:31:04,706 INFO L290 TraceCheckUtils]: 53: Hoare triple {60137#(= (+ 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; {60124#(= (+ (* 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 12:31:04,707 INFO L290 TraceCheckUtils]: 52: Hoare triple {60137#(= (+ 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); {60137#(= (+ 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 12:31:04,707 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {59832#true} {60137#(= (+ 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)))} #104#return; {60137#(= (+ 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 12:31:04,707 INFO L290 TraceCheckUtils]: 50: Hoare triple {59832#true} assume true; {59832#true} is VALID [2022-04-28 12:31:04,708 INFO L290 TraceCheckUtils]: 49: Hoare triple {59832#true} assume !(0 == ~cond); {59832#true} is VALID [2022-04-28 12:31:04,708 INFO L290 TraceCheckUtils]: 48: Hoare triple {59832#true} ~cond := #in~cond; {59832#true} is VALID [2022-04-28 12:31:04,708 INFO L272 TraceCheckUtils]: 47: Hoare triple {60137#(= (+ 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)); {59832#true} is VALID [2022-04-28 12:31:04,708 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {59832#true} {60137#(= (+ 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)))} #102#return; {60137#(= (+ 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 12:31:04,709 INFO L290 TraceCheckUtils]: 45: Hoare triple {59832#true} assume true; {59832#true} is VALID [2022-04-28 12:31:04,709 INFO L290 TraceCheckUtils]: 44: Hoare triple {59832#true} assume !(0 == ~cond); {59832#true} is VALID [2022-04-28 12:31:04,709 INFO L290 TraceCheckUtils]: 43: Hoare triple {59832#true} ~cond := #in~cond; {59832#true} is VALID [2022-04-28 12:31:04,709 INFO L272 TraceCheckUtils]: 42: Hoare triple {60137#(= (+ 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)); {59832#true} is VALID [2022-04-28 12:31:04,710 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {59945#(not (= |__VERIFIER_assert_#in~cond| 0))} {60174#(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)))))} #100#return; {60137#(= (+ 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 12:31:04,710 INFO L290 TraceCheckUtils]: 40: Hoare triple {59945#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {59945#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:31:04,710 INFO L290 TraceCheckUtils]: 39: Hoare triple {60184#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {59945#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:31:04,711 INFO L290 TraceCheckUtils]: 38: Hoare triple {59832#true} ~cond := #in~cond; {60184#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 12:31:04,711 INFO L272 TraceCheckUtils]: 37: Hoare triple {60174#(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)); {59832#true} is VALID [2022-04-28 12:31:04,712 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {59945#(not (= |__VERIFIER_assert_#in~cond| 0))} {60191#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ 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)))))} #98#return; {60174#(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 12:31:04,712 INFO L290 TraceCheckUtils]: 35: Hoare triple {59945#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {59945#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:31:04,713 INFO L290 TraceCheckUtils]: 34: Hoare triple {60184#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {59945#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:31:04,713 INFO L290 TraceCheckUtils]: 33: Hoare triple {59832#true} ~cond := #in~cond; {60184#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 12:31:04,713 INFO L272 TraceCheckUtils]: 32: Hoare triple {60191#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ 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)); {59832#true} is VALID [2022-04-28 12:31:04,713 INFO L290 TraceCheckUtils]: 31: Hoare triple {60191#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ 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 !!(#t~post8 < 10);havoc #t~post8; {60191#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ 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 12:31:04,714 INFO L290 TraceCheckUtils]: 30: Hoare triple {60191#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ 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)))))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60191#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ 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 12:31:04,715 INFO L290 TraceCheckUtils]: 29: Hoare triple {60213#(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_~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; {60191#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ 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 12:31:04,715 INFO L290 TraceCheckUtils]: 28: Hoare triple {60213#(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_~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 !!(#t~post7 < 10);havoc #t~post7; {60213#(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_~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 12:31:04,716 INFO L290 TraceCheckUtils]: 27: Hoare triple {60213#(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_~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))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60213#(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_~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 12:31:04,717 INFO L290 TraceCheckUtils]: 26: Hoare triple {59832#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {60213#(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_~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 12:31:04,717 INFO L290 TraceCheckUtils]: 25: Hoare triple {59832#true} assume !!(#t~post6 < 10);havoc #t~post6; {59832#true} is VALID [2022-04-28 12:31:04,717 INFO L290 TraceCheckUtils]: 24: Hoare triple {59832#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {59832#true} is VALID [2022-04-28 12:31:04,717 INFO L290 TraceCheckUtils]: 23: Hoare triple {59832#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; {59832#true} is VALID [2022-04-28 12:31:04,717 INFO L290 TraceCheckUtils]: 22: Hoare triple {59832#true} assume !(~c~0 >= ~b~0); {59832#true} is VALID [2022-04-28 12:31:04,717 INFO L290 TraceCheckUtils]: 21: Hoare triple {59832#true} assume !!(#t~post7 < 10);havoc #t~post7; {59832#true} is VALID [2022-04-28 12:31:04,717 INFO L290 TraceCheckUtils]: 20: Hoare triple {59832#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {59832#true} is VALID [2022-04-28 12:31:04,717 INFO L290 TraceCheckUtils]: 19: Hoare triple {59832#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {59832#true} is VALID [2022-04-28 12:31:04,717 INFO L290 TraceCheckUtils]: 18: Hoare triple {59832#true} assume !!(#t~post6 < 10);havoc #t~post6; {59832#true} is VALID [2022-04-28 12:31:04,717 INFO L290 TraceCheckUtils]: 17: Hoare triple {59832#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {59832#true} is VALID [2022-04-28 12:31:04,718 INFO L290 TraceCheckUtils]: 16: Hoare triple {59832#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {59832#true} is VALID [2022-04-28 12:31:04,718 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {59832#true} {59832#true} #96#return; {59832#true} is VALID [2022-04-28 12:31:04,718 INFO L290 TraceCheckUtils]: 14: Hoare triple {59832#true} assume true; {59832#true} is VALID [2022-04-28 12:31:04,718 INFO L290 TraceCheckUtils]: 13: Hoare triple {59832#true} assume !(0 == ~cond); {59832#true} is VALID [2022-04-28 12:31:04,718 INFO L290 TraceCheckUtils]: 12: Hoare triple {59832#true} ~cond := #in~cond; {59832#true} is VALID [2022-04-28 12:31:04,718 INFO L272 TraceCheckUtils]: 11: Hoare triple {59832#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {59832#true} is VALID [2022-04-28 12:31:04,718 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {59832#true} {59832#true} #94#return; {59832#true} is VALID [2022-04-28 12:31:04,718 INFO L290 TraceCheckUtils]: 9: Hoare triple {59832#true} assume true; {59832#true} is VALID [2022-04-28 12:31:04,718 INFO L290 TraceCheckUtils]: 8: Hoare triple {59832#true} assume !(0 == ~cond); {59832#true} is VALID [2022-04-28 12:31:04,718 INFO L290 TraceCheckUtils]: 7: Hoare triple {59832#true} ~cond := #in~cond; {59832#true} is VALID [2022-04-28 12:31:04,718 INFO L272 TraceCheckUtils]: 6: Hoare triple {59832#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {59832#true} is VALID [2022-04-28 12:31:04,718 INFO L290 TraceCheckUtils]: 5: Hoare triple {59832#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {59832#true} is VALID [2022-04-28 12:31:04,719 INFO L272 TraceCheckUtils]: 4: Hoare triple {59832#true} call #t~ret9 := main(); {59832#true} is VALID [2022-04-28 12:31:04,719 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59832#true} {59832#true} #108#return; {59832#true} is VALID [2022-04-28 12:31:04,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {59832#true} assume true; {59832#true} is VALID [2022-04-28 12:31:04,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {59832#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);~counter~0 := 0; {59832#true} is VALID [2022-04-28 12:31:04,719 INFO L272 TraceCheckUtils]: 0: Hoare triple {59832#true} call ULTIMATE.init(); {59832#true} is VALID [2022-04-28 12:31:04,719 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 27 proven. 30 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-28 12:31:04,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:31:04,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31056477] [2022-04-28 12:31:04,720 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:31:04,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162065207] [2022-04-28 12:31:04,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162065207] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:31:04,720 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:31:04,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 22 [2022-04-28 12:31:04,720 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:31:04,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2062530990] [2022-04-28 12:31:04,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2062530990] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:31:04,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:31:04,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 12:31:04,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859142122] [2022-04-28 12:31:04,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:31:04,721 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) Word has length 75 [2022-04-28 12:31:04,721 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:31:04,721 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-28 12:31:04,780 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:31:04,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 12:31:04,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:31:04,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 12:31:04,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2022-04-28 12:31:04,781 INFO L87 Difference]: Start difference. First operand 748 states and 1013 transitions. Second operand has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-28 12:31:08,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:31:08,827 INFO L93 Difference]: Finished difference Result 840 states and 1136 transitions. [2022-04-28 12:31:08,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 12:31:08,827 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) Word has length 75 [2022-04-28 12:31:08,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:31:08,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-28 12:31:08,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 172 transitions. [2022-04-28 12:31:08,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-28 12:31:08,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 172 transitions. [2022-04-28 12:31:08,831 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 172 transitions. [2022-04-28 12:31:09,013 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:31:09,054 INFO L225 Difference]: With dead ends: 840 [2022-04-28 12:31:09,054 INFO L226 Difference]: Without dead ends: 838 [2022-04-28 12:31:09,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=540, Unknown=0, NotChecked=0, Total=650 [2022-04-28 12:31:09,055 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 83 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 12:31:09,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 446 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 12:31:09,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2022-04-28 12:31:11,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 813. [2022-04-28 12:31:11,095 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:31:11,096 INFO L82 GeneralOperation]: Start isEquivalent. First operand 838 states. Second operand has 813 states, 579 states have (on average 1.302245250431779) internal successors, (754), 589 states have internal predecessors, (754), 178 states have call successors, (178), 56 states have call predecessors, (178), 55 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-28 12:31:11,096 INFO L74 IsIncluded]: Start isIncluded. First operand 838 states. Second operand has 813 states, 579 states have (on average 1.302245250431779) internal successors, (754), 589 states have internal predecessors, (754), 178 states have call successors, (178), 56 states have call predecessors, (178), 55 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-28 12:31:11,097 INFO L87 Difference]: Start difference. First operand 838 states. Second operand has 813 states, 579 states have (on average 1.302245250431779) internal successors, (754), 589 states have internal predecessors, (754), 178 states have call successors, (178), 56 states have call predecessors, (178), 55 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-28 12:31:11,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:31:11,127 INFO L93 Difference]: Finished difference Result 838 states and 1134 transitions. [2022-04-28 12:31:11,127 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1134 transitions. [2022-04-28 12:31:11,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:31:11,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:31:11,129 INFO L74 IsIncluded]: Start isIncluded. First operand has 813 states, 579 states have (on average 1.302245250431779) internal successors, (754), 589 states have internal predecessors, (754), 178 states have call successors, (178), 56 states have call predecessors, (178), 55 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) Second operand 838 states. [2022-04-28 12:31:11,130 INFO L87 Difference]: Start difference. First operand has 813 states, 579 states have (on average 1.302245250431779) internal successors, (754), 589 states have internal predecessors, (754), 178 states have call successors, (178), 56 states have call predecessors, (178), 55 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) Second operand 838 states. [2022-04-28 12:31:11,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:31:11,153 INFO L93 Difference]: Finished difference Result 838 states and 1134 transitions. [2022-04-28 12:31:11,153 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1134 transitions. [2022-04-28 12:31:11,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:31:11,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:31:11,154 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:31:11,154 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:31:11,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 579 states have (on average 1.302245250431779) internal successors, (754), 589 states have internal predecessors, (754), 178 states have call successors, (178), 56 states have call predecessors, (178), 55 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-28 12:31:11,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1106 transitions. [2022-04-28 12:31:11,184 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1106 transitions. Word has length 75 [2022-04-28 12:31:11,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:31:11,184 INFO L495 AbstractCegarLoop]: Abstraction has 813 states and 1106 transitions. [2022-04-28 12:31:11,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-28 12:31:11,185 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 813 states and 1106 transitions. [2022-04-28 12:31:13,022 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1106 edges. 1106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:31:13,022 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1106 transitions. [2022-04-28 12:31:13,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-28 12:31:13,023 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:31:13,023 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:31:13,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-04-28 12:31:13,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-28 12:31:13,223 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:31:13,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:31:13,224 INFO L85 PathProgramCache]: Analyzing trace with hash -949871629, now seen corresponding path program 5 times [2022-04-28 12:31:13,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:31:13,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [776987667] [2022-04-28 12:31:13,224 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:31:13,224 INFO L85 PathProgramCache]: Analyzing trace with hash -949871629, now seen corresponding path program 6 times [2022-04-28 12:31:13,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:31:13,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671276125] [2022-04-28 12:31:13,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:31:13,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:31:13,235 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:31:13,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1855473218] [2022-04-28 12:31:13,236 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 12:31:13,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:31:13,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:31:13,237 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:31:13,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-28 12:31:13,299 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 12:31:13,299 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:31:13,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 12:31:13,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:31:13,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:31:13,671 INFO L272 TraceCheckUtils]: 0: Hoare triple {65293#true} call ULTIMATE.init(); {65293#true} is VALID [2022-04-28 12:31:13,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {65293#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);~counter~0 := 0; {65301#(<= ~counter~0 0)} is VALID [2022-04-28 12:31:13,672 INFO L290 TraceCheckUtils]: 2: Hoare triple {65301#(<= ~counter~0 0)} assume true; {65301#(<= ~counter~0 0)} is VALID [2022-04-28 12:31:13,672 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65301#(<= ~counter~0 0)} {65293#true} #108#return; {65301#(<= ~counter~0 0)} is VALID [2022-04-28 12:31:13,673 INFO L272 TraceCheckUtils]: 4: Hoare triple {65301#(<= ~counter~0 0)} call #t~ret9 := main(); {65301#(<= ~counter~0 0)} is VALID [2022-04-28 12:31:13,673 INFO L290 TraceCheckUtils]: 5: Hoare triple {65301#(<= ~counter~0 0)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {65301#(<= ~counter~0 0)} is VALID [2022-04-28 12:31:13,674 INFO L272 TraceCheckUtils]: 6: Hoare triple {65301#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {65301#(<= ~counter~0 0)} is VALID [2022-04-28 12:31:13,674 INFO L290 TraceCheckUtils]: 7: Hoare triple {65301#(<= ~counter~0 0)} ~cond := #in~cond; {65301#(<= ~counter~0 0)} is VALID [2022-04-28 12:31:13,674 INFO L290 TraceCheckUtils]: 8: Hoare triple {65301#(<= ~counter~0 0)} assume !(0 == ~cond); {65301#(<= ~counter~0 0)} is VALID [2022-04-28 12:31:13,674 INFO L290 TraceCheckUtils]: 9: Hoare triple {65301#(<= ~counter~0 0)} assume true; {65301#(<= ~counter~0 0)} is VALID [2022-04-28 12:31:13,675 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {65301#(<= ~counter~0 0)} {65301#(<= ~counter~0 0)} #94#return; {65301#(<= ~counter~0 0)} is VALID [2022-04-28 12:31:13,675 INFO L272 TraceCheckUtils]: 11: Hoare triple {65301#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {65301#(<= ~counter~0 0)} is VALID [2022-04-28 12:31:13,675 INFO L290 TraceCheckUtils]: 12: Hoare triple {65301#(<= ~counter~0 0)} ~cond := #in~cond; {65301#(<= ~counter~0 0)} is VALID [2022-04-28 12:31:13,676 INFO L290 TraceCheckUtils]: 13: Hoare triple {65301#(<= ~counter~0 0)} assume !(0 == ~cond); {65301#(<= ~counter~0 0)} is VALID [2022-04-28 12:31:13,676 INFO L290 TraceCheckUtils]: 14: Hoare triple {65301#(<= ~counter~0 0)} assume true; {65301#(<= ~counter~0 0)} is VALID [2022-04-28 12:31:13,676 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {65301#(<= ~counter~0 0)} {65301#(<= ~counter~0 0)} #96#return; {65301#(<= ~counter~0 0)} is VALID [2022-04-28 12:31:13,677 INFO L290 TraceCheckUtils]: 16: Hoare triple {65301#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {65301#(<= ~counter~0 0)} is VALID [2022-04-28 12:31:13,678 INFO L290 TraceCheckUtils]: 17: Hoare triple {65301#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65350#(<= ~counter~0 1)} is VALID [2022-04-28 12:31:13,678 INFO L290 TraceCheckUtils]: 18: Hoare triple {65350#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {65350#(<= ~counter~0 1)} is VALID [2022-04-28 12:31:13,679 INFO L290 TraceCheckUtils]: 19: Hoare triple {65350#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {65350#(<= ~counter~0 1)} is VALID [2022-04-28 12:31:13,679 INFO L290 TraceCheckUtils]: 20: Hoare triple {65350#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65360#(<= ~counter~0 2)} is VALID [2022-04-28 12:31:13,679 INFO L290 TraceCheckUtils]: 21: Hoare triple {65360#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {65360#(<= ~counter~0 2)} is VALID [2022-04-28 12:31:13,680 INFO L290 TraceCheckUtils]: 22: Hoare triple {65360#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {65360#(<= ~counter~0 2)} is VALID [2022-04-28 12:31:13,680 INFO L290 TraceCheckUtils]: 23: Hoare triple {65360#(<= ~counter~0 2)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {65360#(<= ~counter~0 2)} is VALID [2022-04-28 12:31:13,681 INFO L290 TraceCheckUtils]: 24: Hoare triple {65360#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65373#(<= ~counter~0 3)} is VALID [2022-04-28 12:31:13,681 INFO L290 TraceCheckUtils]: 25: Hoare triple {65373#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {65373#(<= ~counter~0 3)} is VALID [2022-04-28 12:31:13,681 INFO L290 TraceCheckUtils]: 26: Hoare triple {65373#(<= ~counter~0 3)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {65373#(<= ~counter~0 3)} is VALID [2022-04-28 12:31:13,682 INFO L290 TraceCheckUtils]: 27: Hoare triple {65373#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65383#(<= ~counter~0 4)} is VALID [2022-04-28 12:31:13,682 INFO L290 TraceCheckUtils]: 28: Hoare triple {65383#(<= ~counter~0 4)} assume !!(#t~post7 < 10);havoc #t~post7; {65383#(<= ~counter~0 4)} is VALID [2022-04-28 12:31:13,683 INFO L290 TraceCheckUtils]: 29: Hoare triple {65383#(<= ~counter~0 4)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {65383#(<= ~counter~0 4)} is VALID [2022-04-28 12:31:13,683 INFO L290 TraceCheckUtils]: 30: Hoare triple {65383#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65393#(<= ~counter~0 5)} is VALID [2022-04-28 12:31:13,687 INFO L290 TraceCheckUtils]: 31: Hoare triple {65393#(<= ~counter~0 5)} assume !!(#t~post8 < 10);havoc #t~post8; {65393#(<= ~counter~0 5)} is VALID [2022-04-28 12:31:13,688 INFO L272 TraceCheckUtils]: 32: Hoare triple {65393#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {65393#(<= ~counter~0 5)} is VALID [2022-04-28 12:31:13,688 INFO L290 TraceCheckUtils]: 33: Hoare triple {65393#(<= ~counter~0 5)} ~cond := #in~cond; {65393#(<= ~counter~0 5)} is VALID [2022-04-28 12:31:13,689 INFO L290 TraceCheckUtils]: 34: Hoare triple {65393#(<= ~counter~0 5)} assume !(0 == ~cond); {65393#(<= ~counter~0 5)} is VALID [2022-04-28 12:31:13,689 INFO L290 TraceCheckUtils]: 35: Hoare triple {65393#(<= ~counter~0 5)} assume true; {65393#(<= ~counter~0 5)} is VALID [2022-04-28 12:31:13,690 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {65393#(<= ~counter~0 5)} {65393#(<= ~counter~0 5)} #98#return; {65393#(<= ~counter~0 5)} is VALID [2022-04-28 12:31:13,690 INFO L272 TraceCheckUtils]: 37: Hoare triple {65393#(<= ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {65393#(<= ~counter~0 5)} is VALID [2022-04-28 12:31:13,691 INFO L290 TraceCheckUtils]: 38: Hoare triple {65393#(<= ~counter~0 5)} ~cond := #in~cond; {65393#(<= ~counter~0 5)} is VALID [2022-04-28 12:31:13,691 INFO L290 TraceCheckUtils]: 39: Hoare triple {65393#(<= ~counter~0 5)} assume !(0 == ~cond); {65393#(<= ~counter~0 5)} is VALID [2022-04-28 12:31:13,691 INFO L290 TraceCheckUtils]: 40: Hoare triple {65393#(<= ~counter~0 5)} assume true; {65393#(<= ~counter~0 5)} is VALID [2022-04-28 12:31:13,692 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {65393#(<= ~counter~0 5)} {65393#(<= ~counter~0 5)} #100#return; {65393#(<= ~counter~0 5)} is VALID [2022-04-28 12:31:13,693 INFO L272 TraceCheckUtils]: 42: Hoare triple {65393#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {65393#(<= ~counter~0 5)} is VALID [2022-04-28 12:31:13,693 INFO L290 TraceCheckUtils]: 43: Hoare triple {65393#(<= ~counter~0 5)} ~cond := #in~cond; {65393#(<= ~counter~0 5)} is VALID [2022-04-28 12:31:13,694 INFO L290 TraceCheckUtils]: 44: Hoare triple {65393#(<= ~counter~0 5)} assume !(0 == ~cond); {65393#(<= ~counter~0 5)} is VALID [2022-04-28 12:31:13,694 INFO L290 TraceCheckUtils]: 45: Hoare triple {65393#(<= ~counter~0 5)} assume true; {65393#(<= ~counter~0 5)} is VALID [2022-04-28 12:31:13,695 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {65393#(<= ~counter~0 5)} {65393#(<= ~counter~0 5)} #102#return; {65393#(<= ~counter~0 5)} is VALID [2022-04-28 12:31:13,695 INFO L272 TraceCheckUtils]: 47: Hoare triple {65393#(<= ~counter~0 5)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {65393#(<= ~counter~0 5)} is VALID [2022-04-28 12:31:13,696 INFO L290 TraceCheckUtils]: 48: Hoare triple {65393#(<= ~counter~0 5)} ~cond := #in~cond; {65393#(<= ~counter~0 5)} is VALID [2022-04-28 12:31:13,696 INFO L290 TraceCheckUtils]: 49: Hoare triple {65393#(<= ~counter~0 5)} assume !(0 == ~cond); {65393#(<= ~counter~0 5)} is VALID [2022-04-28 12:31:13,696 INFO L290 TraceCheckUtils]: 50: Hoare triple {65393#(<= ~counter~0 5)} assume true; {65393#(<= ~counter~0 5)} is VALID [2022-04-28 12:31:13,697 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {65393#(<= ~counter~0 5)} {65393#(<= ~counter~0 5)} #104#return; {65393#(<= ~counter~0 5)} is VALID [2022-04-28 12:31:13,697 INFO L290 TraceCheckUtils]: 52: Hoare triple {65393#(<= ~counter~0 5)} assume !(~c~0 >= 2 * ~v~0); {65393#(<= ~counter~0 5)} is VALID [2022-04-28 12:31:13,698 INFO L290 TraceCheckUtils]: 53: Hoare triple {65393#(<= ~counter~0 5)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {65393#(<= ~counter~0 5)} is VALID [2022-04-28 12:31:13,699 INFO L290 TraceCheckUtils]: 54: Hoare triple {65393#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65466#(<= ~counter~0 6)} is VALID [2022-04-28 12:31:13,699 INFO L290 TraceCheckUtils]: 55: Hoare triple {65466#(<= ~counter~0 6)} assume !!(#t~post7 < 10);havoc #t~post7; {65466#(<= ~counter~0 6)} is VALID [2022-04-28 12:31:13,700 INFO L290 TraceCheckUtils]: 56: Hoare triple {65466#(<= ~counter~0 6)} assume !(~c~0 >= ~b~0); {65466#(<= ~counter~0 6)} is VALID [2022-04-28 12:31:13,700 INFO L290 TraceCheckUtils]: 57: Hoare triple {65466#(<= ~counter~0 6)} ~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; {65466#(<= ~counter~0 6)} is VALID [2022-04-28 12:31:13,701 INFO L290 TraceCheckUtils]: 58: Hoare triple {65466#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65479#(<= ~counter~0 7)} is VALID [2022-04-28 12:31:13,701 INFO L290 TraceCheckUtils]: 59: Hoare triple {65479#(<= ~counter~0 7)} assume !!(#t~post6 < 10);havoc #t~post6; {65479#(<= ~counter~0 7)} is VALID [2022-04-28 12:31:13,701 INFO L290 TraceCheckUtils]: 60: Hoare triple {65479#(<= ~counter~0 7)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {65479#(<= ~counter~0 7)} is VALID [2022-04-28 12:31:13,702 INFO L290 TraceCheckUtils]: 61: Hoare triple {65479#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65489#(<= ~counter~0 8)} is VALID [2022-04-28 12:31:13,702 INFO L290 TraceCheckUtils]: 62: Hoare triple {65489#(<= ~counter~0 8)} assume !!(#t~post7 < 10);havoc #t~post7; {65489#(<= ~counter~0 8)} is VALID [2022-04-28 12:31:13,703 INFO L290 TraceCheckUtils]: 63: Hoare triple {65489#(<= ~counter~0 8)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {65489#(<= ~counter~0 8)} is VALID [2022-04-28 12:31:13,703 INFO L290 TraceCheckUtils]: 64: Hoare triple {65489#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65499#(<= |main_#t~post8| 8)} is VALID [2022-04-28 12:31:13,703 INFO L290 TraceCheckUtils]: 65: Hoare triple {65499#(<= |main_#t~post8| 8)} assume !(#t~post8 < 10);havoc #t~post8; {65294#false} is VALID [2022-04-28 12:31:13,704 INFO L290 TraceCheckUtils]: 66: Hoare triple {65294#false} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {65294#false} is VALID [2022-04-28 12:31:13,704 INFO L290 TraceCheckUtils]: 67: Hoare triple {65294#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65294#false} is VALID [2022-04-28 12:31:13,704 INFO L290 TraceCheckUtils]: 68: Hoare triple {65294#false} assume !(#t~post7 < 10);havoc #t~post7; {65294#false} is VALID [2022-04-28 12:31:13,704 INFO L290 TraceCheckUtils]: 69: Hoare triple {65294#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; {65294#false} is VALID [2022-04-28 12:31:13,704 INFO L290 TraceCheckUtils]: 70: Hoare triple {65294#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65294#false} is VALID [2022-04-28 12:31:13,704 INFO L290 TraceCheckUtils]: 71: Hoare triple {65294#false} assume !(#t~post6 < 10);havoc #t~post6; {65294#false} is VALID [2022-04-28 12:31:13,704 INFO L272 TraceCheckUtils]: 72: Hoare triple {65294#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)); {65294#false} is VALID [2022-04-28 12:31:13,704 INFO L290 TraceCheckUtils]: 73: Hoare triple {65294#false} ~cond := #in~cond; {65294#false} is VALID [2022-04-28 12:31:13,704 INFO L290 TraceCheckUtils]: 74: Hoare triple {65294#false} assume 0 == ~cond; {65294#false} is VALID [2022-04-28 12:31:13,704 INFO L290 TraceCheckUtils]: 75: Hoare triple {65294#false} assume !false; {65294#false} is VALID [2022-04-28 12:31:13,705 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 25 proven. 30 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 12:31:13,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:31:14,050 INFO L290 TraceCheckUtils]: 75: Hoare triple {65294#false} assume !false; {65294#false} is VALID [2022-04-28 12:31:14,050 INFO L290 TraceCheckUtils]: 74: Hoare triple {65294#false} assume 0 == ~cond; {65294#false} is VALID [2022-04-28 12:31:14,050 INFO L290 TraceCheckUtils]: 73: Hoare triple {65294#false} ~cond := #in~cond; {65294#false} is VALID [2022-04-28 12:31:14,050 INFO L272 TraceCheckUtils]: 72: Hoare triple {65294#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)); {65294#false} is VALID [2022-04-28 12:31:14,050 INFO L290 TraceCheckUtils]: 71: Hoare triple {65294#false} assume !(#t~post6 < 10);havoc #t~post6; {65294#false} is VALID [2022-04-28 12:31:14,050 INFO L290 TraceCheckUtils]: 70: Hoare triple {65294#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65294#false} is VALID [2022-04-28 12:31:14,050 INFO L290 TraceCheckUtils]: 69: Hoare triple {65294#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; {65294#false} is VALID [2022-04-28 12:31:14,051 INFO L290 TraceCheckUtils]: 68: Hoare triple {65294#false} assume !(#t~post7 < 10);havoc #t~post7; {65294#false} is VALID [2022-04-28 12:31:14,051 INFO L290 TraceCheckUtils]: 67: Hoare triple {65294#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65294#false} is VALID [2022-04-28 12:31:14,051 INFO L290 TraceCheckUtils]: 66: Hoare triple {65294#false} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {65294#false} is VALID [2022-04-28 12:31:14,051 INFO L290 TraceCheckUtils]: 65: Hoare triple {65563#(< |main_#t~post8| 10)} assume !(#t~post8 < 10);havoc #t~post8; {65294#false} is VALID [2022-04-28 12:31:14,051 INFO L290 TraceCheckUtils]: 64: Hoare triple {65567#(< ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65563#(< |main_#t~post8| 10)} is VALID [2022-04-28 12:31:14,052 INFO L290 TraceCheckUtils]: 63: Hoare triple {65567#(< ~counter~0 10)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {65567#(< ~counter~0 10)} is VALID [2022-04-28 12:31:14,052 INFO L290 TraceCheckUtils]: 62: Hoare triple {65567#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {65567#(< ~counter~0 10)} is VALID [2022-04-28 12:31:14,053 INFO L290 TraceCheckUtils]: 61: Hoare triple {65489#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65567#(< ~counter~0 10)} is VALID [2022-04-28 12:31:14,053 INFO L290 TraceCheckUtils]: 60: Hoare triple {65489#(<= ~counter~0 8)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {65489#(<= ~counter~0 8)} is VALID [2022-04-28 12:31:14,054 INFO L290 TraceCheckUtils]: 59: Hoare triple {65489#(<= ~counter~0 8)} assume !!(#t~post6 < 10);havoc #t~post6; {65489#(<= ~counter~0 8)} is VALID [2022-04-28 12:31:14,054 INFO L290 TraceCheckUtils]: 58: Hoare triple {65479#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65489#(<= ~counter~0 8)} is VALID [2022-04-28 12:31:14,055 INFO L290 TraceCheckUtils]: 57: Hoare triple {65479#(<= ~counter~0 7)} ~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; {65479#(<= ~counter~0 7)} is VALID [2022-04-28 12:31:14,055 INFO L290 TraceCheckUtils]: 56: Hoare triple {65479#(<= ~counter~0 7)} assume !(~c~0 >= ~b~0); {65479#(<= ~counter~0 7)} is VALID [2022-04-28 12:31:14,055 INFO L290 TraceCheckUtils]: 55: Hoare triple {65479#(<= ~counter~0 7)} assume !!(#t~post7 < 10);havoc #t~post7; {65479#(<= ~counter~0 7)} is VALID [2022-04-28 12:31:14,056 INFO L290 TraceCheckUtils]: 54: Hoare triple {65466#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65479#(<= ~counter~0 7)} is VALID [2022-04-28 12:31:14,056 INFO L290 TraceCheckUtils]: 53: Hoare triple {65466#(<= ~counter~0 6)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {65466#(<= ~counter~0 6)} is VALID [2022-04-28 12:31:14,056 INFO L290 TraceCheckUtils]: 52: Hoare triple {65466#(<= ~counter~0 6)} assume !(~c~0 >= 2 * ~v~0); {65466#(<= ~counter~0 6)} is VALID [2022-04-28 12:31:14,057 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {65293#true} {65466#(<= ~counter~0 6)} #104#return; {65466#(<= ~counter~0 6)} is VALID [2022-04-28 12:31:14,057 INFO L290 TraceCheckUtils]: 50: Hoare triple {65293#true} assume true; {65293#true} is VALID [2022-04-28 12:31:14,057 INFO L290 TraceCheckUtils]: 49: Hoare triple {65293#true} assume !(0 == ~cond); {65293#true} is VALID [2022-04-28 12:31:14,057 INFO L290 TraceCheckUtils]: 48: Hoare triple {65293#true} ~cond := #in~cond; {65293#true} is VALID [2022-04-28 12:31:14,057 INFO L272 TraceCheckUtils]: 47: Hoare triple {65466#(<= ~counter~0 6)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {65293#true} is VALID [2022-04-28 12:31:14,058 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {65293#true} {65466#(<= ~counter~0 6)} #102#return; {65466#(<= ~counter~0 6)} is VALID [2022-04-28 12:31:14,058 INFO L290 TraceCheckUtils]: 45: Hoare triple {65293#true} assume true; {65293#true} is VALID [2022-04-28 12:31:14,058 INFO L290 TraceCheckUtils]: 44: Hoare triple {65293#true} assume !(0 == ~cond); {65293#true} is VALID [2022-04-28 12:31:14,058 INFO L290 TraceCheckUtils]: 43: Hoare triple {65293#true} ~cond := #in~cond; {65293#true} is VALID [2022-04-28 12:31:14,058 INFO L272 TraceCheckUtils]: 42: Hoare triple {65466#(<= ~counter~0 6)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {65293#true} is VALID [2022-04-28 12:31:14,059 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {65293#true} {65466#(<= ~counter~0 6)} #100#return; {65466#(<= ~counter~0 6)} is VALID [2022-04-28 12:31:14,059 INFO L290 TraceCheckUtils]: 40: Hoare triple {65293#true} assume true; {65293#true} is VALID [2022-04-28 12:31:14,059 INFO L290 TraceCheckUtils]: 39: Hoare triple {65293#true} assume !(0 == ~cond); {65293#true} is VALID [2022-04-28 12:31:14,059 INFO L290 TraceCheckUtils]: 38: Hoare triple {65293#true} ~cond := #in~cond; {65293#true} is VALID [2022-04-28 12:31:14,059 INFO L272 TraceCheckUtils]: 37: Hoare triple {65466#(<= ~counter~0 6)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {65293#true} is VALID [2022-04-28 12:31:14,060 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {65293#true} {65466#(<= ~counter~0 6)} #98#return; {65466#(<= ~counter~0 6)} is VALID [2022-04-28 12:31:14,060 INFO L290 TraceCheckUtils]: 35: Hoare triple {65293#true} assume true; {65293#true} is VALID [2022-04-28 12:31:14,060 INFO L290 TraceCheckUtils]: 34: Hoare triple {65293#true} assume !(0 == ~cond); {65293#true} is VALID [2022-04-28 12:31:14,060 INFO L290 TraceCheckUtils]: 33: Hoare triple {65293#true} ~cond := #in~cond; {65293#true} is VALID [2022-04-28 12:31:14,060 INFO L272 TraceCheckUtils]: 32: Hoare triple {65466#(<= ~counter~0 6)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {65293#true} is VALID [2022-04-28 12:31:14,060 INFO L290 TraceCheckUtils]: 31: Hoare triple {65466#(<= ~counter~0 6)} assume !!(#t~post8 < 10);havoc #t~post8; {65466#(<= ~counter~0 6)} is VALID [2022-04-28 12:31:14,061 INFO L290 TraceCheckUtils]: 30: Hoare triple {65393#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65466#(<= ~counter~0 6)} is VALID [2022-04-28 12:31:14,061 INFO L290 TraceCheckUtils]: 29: Hoare triple {65393#(<= ~counter~0 5)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {65393#(<= ~counter~0 5)} is VALID [2022-04-28 12:31:14,061 INFO L290 TraceCheckUtils]: 28: Hoare triple {65393#(<= ~counter~0 5)} assume !!(#t~post7 < 10);havoc #t~post7; {65393#(<= ~counter~0 5)} is VALID [2022-04-28 12:31:14,062 INFO L290 TraceCheckUtils]: 27: Hoare triple {65383#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65393#(<= ~counter~0 5)} is VALID [2022-04-28 12:31:14,062 INFO L290 TraceCheckUtils]: 26: Hoare triple {65383#(<= ~counter~0 4)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {65383#(<= ~counter~0 4)} is VALID [2022-04-28 12:31:14,063 INFO L290 TraceCheckUtils]: 25: Hoare triple {65383#(<= ~counter~0 4)} assume !!(#t~post6 < 10);havoc #t~post6; {65383#(<= ~counter~0 4)} is VALID [2022-04-28 12:31:14,063 INFO L290 TraceCheckUtils]: 24: Hoare triple {65373#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65383#(<= ~counter~0 4)} is VALID [2022-04-28 12:31:14,064 INFO L290 TraceCheckUtils]: 23: Hoare triple {65373#(<= ~counter~0 3)} ~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; {65373#(<= ~counter~0 3)} is VALID [2022-04-28 12:31:14,064 INFO L290 TraceCheckUtils]: 22: Hoare triple {65373#(<= ~counter~0 3)} assume !(~c~0 >= ~b~0); {65373#(<= ~counter~0 3)} is VALID [2022-04-28 12:31:14,064 INFO L290 TraceCheckUtils]: 21: Hoare triple {65373#(<= ~counter~0 3)} assume !!(#t~post7 < 10);havoc #t~post7; {65373#(<= ~counter~0 3)} is VALID [2022-04-28 12:31:14,065 INFO L290 TraceCheckUtils]: 20: Hoare triple {65360#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65373#(<= ~counter~0 3)} is VALID [2022-04-28 12:31:14,065 INFO L290 TraceCheckUtils]: 19: Hoare triple {65360#(<= ~counter~0 2)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {65360#(<= ~counter~0 2)} is VALID [2022-04-28 12:31:14,065 INFO L290 TraceCheckUtils]: 18: Hoare triple {65360#(<= ~counter~0 2)} assume !!(#t~post6 < 10);havoc #t~post6; {65360#(<= ~counter~0 2)} is VALID [2022-04-28 12:31:14,066 INFO L290 TraceCheckUtils]: 17: Hoare triple {65350#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65360#(<= ~counter~0 2)} is VALID [2022-04-28 12:31:14,066 INFO L290 TraceCheckUtils]: 16: Hoare triple {65350#(<= ~counter~0 1)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {65350#(<= ~counter~0 1)} is VALID [2022-04-28 12:31:14,067 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {65293#true} {65350#(<= ~counter~0 1)} #96#return; {65350#(<= ~counter~0 1)} is VALID [2022-04-28 12:31:14,067 INFO L290 TraceCheckUtils]: 14: Hoare triple {65293#true} assume true; {65293#true} is VALID [2022-04-28 12:31:14,067 INFO L290 TraceCheckUtils]: 13: Hoare triple {65293#true} assume !(0 == ~cond); {65293#true} is VALID [2022-04-28 12:31:14,067 INFO L290 TraceCheckUtils]: 12: Hoare triple {65293#true} ~cond := #in~cond; {65293#true} is VALID [2022-04-28 12:31:14,067 INFO L272 TraceCheckUtils]: 11: Hoare triple {65350#(<= ~counter~0 1)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {65293#true} is VALID [2022-04-28 12:31:14,068 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {65293#true} {65350#(<= ~counter~0 1)} #94#return; {65350#(<= ~counter~0 1)} is VALID [2022-04-28 12:31:14,068 INFO L290 TraceCheckUtils]: 9: Hoare triple {65293#true} assume true; {65293#true} is VALID [2022-04-28 12:31:14,068 INFO L290 TraceCheckUtils]: 8: Hoare triple {65293#true} assume !(0 == ~cond); {65293#true} is VALID [2022-04-28 12:31:14,068 INFO L290 TraceCheckUtils]: 7: Hoare triple {65293#true} ~cond := #in~cond; {65293#true} is VALID [2022-04-28 12:31:14,068 INFO L272 TraceCheckUtils]: 6: Hoare triple {65350#(<= ~counter~0 1)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {65293#true} is VALID [2022-04-28 12:31:14,068 INFO L290 TraceCheckUtils]: 5: Hoare triple {65350#(<= ~counter~0 1)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {65350#(<= ~counter~0 1)} is VALID [2022-04-28 12:31:14,069 INFO L272 TraceCheckUtils]: 4: Hoare triple {65350#(<= ~counter~0 1)} call #t~ret9 := main(); {65350#(<= ~counter~0 1)} is VALID [2022-04-28 12:31:14,069 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65350#(<= ~counter~0 1)} {65293#true} #108#return; {65350#(<= ~counter~0 1)} is VALID [2022-04-28 12:31:14,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {65350#(<= ~counter~0 1)} assume true; {65350#(<= ~counter~0 1)} is VALID [2022-04-28 12:31:14,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {65293#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);~counter~0 := 0; {65350#(<= ~counter~0 1)} is VALID [2022-04-28 12:31:14,070 INFO L272 TraceCheckUtils]: 0: Hoare triple {65293#true} call ULTIMATE.init(); {65293#true} is VALID [2022-04-28 12:31:14,070 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 25 proven. 30 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 12:31:14,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:31:14,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671276125] [2022-04-28 12:31:14,070 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:31:14,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855473218] [2022-04-28 12:31:14,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855473218] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:31:14,071 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:31:14,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2022-04-28 12:31:14,071 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:31:14,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [776987667] [2022-04-28 12:31:14,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [776987667] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:31:14,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:31:14,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 12:31:14,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319957921] [2022-04-28 12:31:14,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:31:14,072 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 76 [2022-04-28 12:31:14,072 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:31:14,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 4.0) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 12:31:14,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:31:14,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 12:31:14,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:31:14,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 12:31:14,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 12:31:14,132 INFO L87 Difference]: Start difference. First operand 813 states and 1106 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 12:31:17,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:31:17,289 INFO L93 Difference]: Finished difference Result 1433 states and 1997 transitions. [2022-04-28 12:31:17,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 12:31:17,289 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 76 [2022-04-28 12:31:17,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:31:17,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 12:31:17,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 239 transitions. [2022-04-28 12:31:17,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 12:31:17,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 239 transitions. [2022-04-28 12:31:17,293 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 239 transitions. [2022-04-28 12:31:17,481 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 239 edges. 239 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:31:17,522 INFO L225 Difference]: With dead ends: 1433 [2022-04-28 12:31:17,522 INFO L226 Difference]: Without dead ends: 975 [2022-04-28 12:31:17,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 138 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2022-04-28 12:31:17,524 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 166 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 12:31:17,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 286 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 12:31:17,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2022-04-28 12:31:20,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 947. [2022-04-28 12:31:20,021 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:31:20,022 INFO L82 GeneralOperation]: Start isEquivalent. First operand 975 states. Second operand has 947 states, 673 states have (on average 1.274888558692422) internal successors, (858), 683 states have internal predecessors, (858), 205 states have call successors, (205), 69 states have call predecessors, (205), 68 states have return successors, (200), 194 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-28 12:31:20,022 INFO L74 IsIncluded]: Start isIncluded. First operand 975 states. Second operand has 947 states, 673 states have (on average 1.274888558692422) internal successors, (858), 683 states have internal predecessors, (858), 205 states have call successors, (205), 69 states have call predecessors, (205), 68 states have return successors, (200), 194 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-28 12:31:20,023 INFO L87 Difference]: Start difference. First operand 975 states. Second operand has 947 states, 673 states have (on average 1.274888558692422) internal successors, (858), 683 states have internal predecessors, (858), 205 states have call successors, (205), 69 states have call predecessors, (205), 68 states have return successors, (200), 194 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-28 12:31:20,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:31:20,054 INFO L93 Difference]: Finished difference Result 975 states and 1288 transitions. [2022-04-28 12:31:20,054 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1288 transitions. [2022-04-28 12:31:20,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:31:20,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:31:20,056 INFO L74 IsIncluded]: Start isIncluded. First operand has 947 states, 673 states have (on average 1.274888558692422) internal successors, (858), 683 states have internal predecessors, (858), 205 states have call successors, (205), 69 states have call predecessors, (205), 68 states have return successors, (200), 194 states have call predecessors, (200), 200 states have call successors, (200) Second operand 975 states. [2022-04-28 12:31:20,057 INFO L87 Difference]: Start difference. First operand has 947 states, 673 states have (on average 1.274888558692422) internal successors, (858), 683 states have internal predecessors, (858), 205 states have call successors, (205), 69 states have call predecessors, (205), 68 states have return successors, (200), 194 states have call predecessors, (200), 200 states have call successors, (200) Second operand 975 states. [2022-04-28 12:31:20,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:31:20,086 INFO L93 Difference]: Finished difference Result 975 states and 1288 transitions. [2022-04-28 12:31:20,086 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1288 transitions. [2022-04-28 12:31:20,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:31:20,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:31:20,088 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:31:20,088 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:31:20,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 673 states have (on average 1.274888558692422) internal successors, (858), 683 states have internal predecessors, (858), 205 states have call successors, (205), 69 states have call predecessors, (205), 68 states have return successors, (200), 194 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-28 12:31:20,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1263 transitions. [2022-04-28 12:31:20,129 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1263 transitions. Word has length 76 [2022-04-28 12:31:20,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:31:20,129 INFO L495 AbstractCegarLoop]: Abstraction has 947 states and 1263 transitions. [2022-04-28 12:31:20,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 12:31:20,130 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 947 states and 1263 transitions. [2022-04-28 12:31:22,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1263 edges. 1263 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:31:22,288 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1263 transitions. [2022-04-28 12:31:22,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-28 12:31:22,289 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:31:22,289 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:31:22,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-28 12:31:22,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-28 12:31:22,490 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:31:22,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:31:22,490 INFO L85 PathProgramCache]: Analyzing trace with hash -362795852, now seen corresponding path program 1 times [2022-04-28 12:31:22,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:31:22,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1985181388] [2022-04-28 12:31:22,491 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:31:22,491 INFO L85 PathProgramCache]: Analyzing trace with hash -362795852, now seen corresponding path program 2 times [2022-04-28 12:31:22,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:31:22,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540054445] [2022-04-28 12:31:22,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:31:22,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:31:22,501 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:31:22,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2049483496] [2022-04-28 12:31:22,501 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:31:22,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:31:22,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:31:22,502 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:31:22,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-28 12:31:22,562 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:31:22,562 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:31:22,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 56 conjunts are in the unsatisfiable core [2022-04-28 12:31:22,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:31:22,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:31:23,502 INFO L272 TraceCheckUtils]: 0: Hoare triple {72484#true} call ULTIMATE.init(); {72484#true} is VALID [2022-04-28 12:31:23,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {72484#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);~counter~0 := 0; {72484#true} is VALID [2022-04-28 12:31:23,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {72484#true} assume true; {72484#true} is VALID [2022-04-28 12:31:23,502 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {72484#true} {72484#true} #108#return; {72484#true} is VALID [2022-04-28 12:31:23,503 INFO L272 TraceCheckUtils]: 4: Hoare triple {72484#true} call #t~ret9 := main(); {72484#true} is VALID [2022-04-28 12:31:23,503 INFO L290 TraceCheckUtils]: 5: Hoare triple {72484#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {72484#true} is VALID [2022-04-28 12:31:23,503 INFO L272 TraceCheckUtils]: 6: Hoare triple {72484#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {72484#true} is VALID [2022-04-28 12:31:23,503 INFO L290 TraceCheckUtils]: 7: Hoare triple {72484#true} ~cond := #in~cond; {72484#true} is VALID [2022-04-28 12:31:23,503 INFO L290 TraceCheckUtils]: 8: Hoare triple {72484#true} assume !(0 == ~cond); {72484#true} is VALID [2022-04-28 12:31:23,503 INFO L290 TraceCheckUtils]: 9: Hoare triple {72484#true} assume true; {72484#true} is VALID [2022-04-28 12:31:23,503 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {72484#true} {72484#true} #94#return; {72484#true} is VALID [2022-04-28 12:31:23,503 INFO L272 TraceCheckUtils]: 11: Hoare triple {72484#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {72484#true} is VALID [2022-04-28 12:31:23,503 INFO L290 TraceCheckUtils]: 12: Hoare triple {72484#true} ~cond := #in~cond; {72484#true} is VALID [2022-04-28 12:31:23,503 INFO L290 TraceCheckUtils]: 13: Hoare triple {72484#true} assume !(0 == ~cond); {72484#true} is VALID [2022-04-28 12:31:23,503 INFO L290 TraceCheckUtils]: 14: Hoare triple {72484#true} assume true; {72484#true} is VALID [2022-04-28 12:31:23,503 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {72484#true} {72484#true} #96#return; {72484#true} is VALID [2022-04-28 12:31:23,504 INFO L290 TraceCheckUtils]: 16: Hoare triple {72484#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {72537#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:31:23,504 INFO L290 TraceCheckUtils]: 17: Hoare triple {72537#(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))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {72537#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:31:23,505 INFO L290 TraceCheckUtils]: 18: Hoare triple {72537#(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 !!(#t~post6 < 10);havoc #t~post6; {72537#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:31:23,505 INFO L290 TraceCheckUtils]: 19: Hoare triple {72537#(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; {72547#(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 12:31:23,506 INFO L290 TraceCheckUtils]: 20: Hoare triple {72547#(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))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {72547#(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 12:31:23,506 INFO L290 TraceCheckUtils]: 21: Hoare triple {72547#(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 !!(#t~post7 < 10);havoc #t~post7; {72547#(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 12:31:23,506 INFO L290 TraceCheckUtils]: 22: Hoare triple {72547#(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; {72557#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:31:23,507 INFO L290 TraceCheckUtils]: 23: Hoare triple {72557#(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))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {72557#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:31:23,507 INFO L290 TraceCheckUtils]: 24: Hoare triple {72557#(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 !!(#t~post8 < 10);havoc #t~post8; {72557#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:31:23,507 INFO L272 TraceCheckUtils]: 25: Hoare triple {72557#(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)); {72484#true} is VALID [2022-04-28 12:31:23,507 INFO L290 TraceCheckUtils]: 26: Hoare triple {72484#true} ~cond := #in~cond; {72484#true} is VALID [2022-04-28 12:31:23,508 INFO L290 TraceCheckUtils]: 27: Hoare triple {72484#true} assume !(0 == ~cond); {72484#true} is VALID [2022-04-28 12:31:23,508 INFO L290 TraceCheckUtils]: 28: Hoare triple {72484#true} assume true; {72484#true} is VALID [2022-04-28 12:31:23,508 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {72484#true} {72557#(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))} #98#return; {72557#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:31:23,509 INFO L272 TraceCheckUtils]: 30: Hoare triple {72557#(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)); {72484#true} is VALID [2022-04-28 12:31:23,509 INFO L290 TraceCheckUtils]: 31: Hoare triple {72484#true} ~cond := #in~cond; {72484#true} is VALID [2022-04-28 12:31:23,509 INFO L290 TraceCheckUtils]: 32: Hoare triple {72484#true} assume !(0 == ~cond); {72484#true} is VALID [2022-04-28 12:31:23,509 INFO L290 TraceCheckUtils]: 33: Hoare triple {72484#true} assume true; {72484#true} is VALID [2022-04-28 12:31:23,510 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {72484#true} {72557#(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))} #100#return; {72557#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:31:23,510 INFO L272 TraceCheckUtils]: 35: Hoare triple {72557#(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)); {72484#true} is VALID [2022-04-28 12:31:23,510 INFO L290 TraceCheckUtils]: 36: Hoare triple {72484#true} ~cond := #in~cond; {72484#true} is VALID [2022-04-28 12:31:23,510 INFO L290 TraceCheckUtils]: 37: Hoare triple {72484#true} assume !(0 == ~cond); {72484#true} is VALID [2022-04-28 12:31:23,510 INFO L290 TraceCheckUtils]: 38: Hoare triple {72484#true} assume true; {72484#true} is VALID [2022-04-28 12:31:23,511 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {72484#true} {72557#(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; {72557#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:31:23,511 INFO L272 TraceCheckUtils]: 40: Hoare triple {72557#(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)); {72484#true} is VALID [2022-04-28 12:31:23,511 INFO L290 TraceCheckUtils]: 41: Hoare triple {72484#true} ~cond := #in~cond; {72484#true} is VALID [2022-04-28 12:31:23,511 INFO L290 TraceCheckUtils]: 42: Hoare triple {72484#true} assume !(0 == ~cond); {72484#true} is VALID [2022-04-28 12:31:23,511 INFO L290 TraceCheckUtils]: 43: Hoare triple {72484#true} assume true; {72484#true} is VALID [2022-04-28 12:31:23,512 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {72484#true} {72557#(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; {72557#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:31:23,512 INFO L290 TraceCheckUtils]: 45: Hoare triple {72557#(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; {72627#(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 12:31:23,513 INFO L290 TraceCheckUtils]: 46: Hoare triple {72627#(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))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {72627#(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 12:31:23,513 INFO L290 TraceCheckUtils]: 47: Hoare triple {72627#(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 !!(#t~post8 < 10);havoc #t~post8; {72627#(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 12:31:23,513 INFO L272 TraceCheckUtils]: 48: Hoare triple {72627#(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)); {72484#true} is VALID [2022-04-28 12:31:23,513 INFO L290 TraceCheckUtils]: 49: Hoare triple {72484#true} ~cond := #in~cond; {72484#true} is VALID [2022-04-28 12:31:23,513 INFO L290 TraceCheckUtils]: 50: Hoare triple {72484#true} assume !(0 == ~cond); {72484#true} is VALID [2022-04-28 12:31:23,513 INFO L290 TraceCheckUtils]: 51: Hoare triple {72484#true} assume true; {72484#true} is VALID [2022-04-28 12:31:23,514 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {72484#true} {72627#(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))} #98#return; {72627#(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 12:31:23,514 INFO L272 TraceCheckUtils]: 53: Hoare triple {72627#(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)); {72484#true} is VALID [2022-04-28 12:31:23,515 INFO L290 TraceCheckUtils]: 54: Hoare triple {72484#true} ~cond := #in~cond; {72655#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:31:23,515 INFO L290 TraceCheckUtils]: 55: Hoare triple {72655#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {72659#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:31:23,515 INFO L290 TraceCheckUtils]: 56: Hoare triple {72659#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {72659#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:31:23,516 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {72659#(not (= |__VERIFIER_assert_#in~cond| 0))} {72627#(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))} #100#return; {72627#(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 12:31:23,516 INFO L272 TraceCheckUtils]: 58: Hoare triple {72627#(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)); {72484#true} is VALID [2022-04-28 12:31:23,516 INFO L290 TraceCheckUtils]: 59: Hoare triple {72484#true} ~cond := #in~cond; {72484#true} is VALID [2022-04-28 12:31:23,516 INFO L290 TraceCheckUtils]: 60: Hoare triple {72484#true} assume !(0 == ~cond); {72484#true} is VALID [2022-04-28 12:31:23,517 INFO L290 TraceCheckUtils]: 61: Hoare triple {72484#true} assume true; {72484#true} is VALID [2022-04-28 12:31:23,517 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {72484#true} {72627#(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; {72627#(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 12:31:23,517 INFO L272 TraceCheckUtils]: 63: Hoare triple {72627#(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)); {72484#true} is VALID [2022-04-28 12:31:23,517 INFO L290 TraceCheckUtils]: 64: Hoare triple {72484#true} ~cond := #in~cond; {72484#true} is VALID [2022-04-28 12:31:23,518 INFO L290 TraceCheckUtils]: 65: Hoare triple {72484#true} assume !(0 == ~cond); {72484#true} is VALID [2022-04-28 12:31:23,518 INFO L290 TraceCheckUtils]: 66: Hoare triple {72484#true} assume true; {72484#true} is VALID [2022-04-28 12:31:23,518 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {72484#true} {72627#(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; {72627#(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 12:31:23,519 INFO L290 TraceCheckUtils]: 68: Hoare triple {72627#(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); {72627#(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 12:31:23,520 INFO L290 TraceCheckUtils]: 69: Hoare triple {72627#(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; {72702#(and (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 12:31:23,520 INFO L290 TraceCheckUtils]: 70: Hoare triple {72702#(and (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {72702#(and (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 12:31:23,520 INFO L290 TraceCheckUtils]: 71: Hoare triple {72702#(and (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~p~0 1))} assume !!(#t~post7 < 10);havoc #t~post7; {72702#(and (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 12:31:23,521 INFO L290 TraceCheckUtils]: 72: Hoare triple {72702#(and (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {72702#(and (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 12:31:23,521 INFO L290 TraceCheckUtils]: 73: Hoare triple {72702#(and (= (+ main_~c~0 (* main_~b~0 2)) main_~x~0) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 2) (= 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; {72715#(and (= main_~p~0 0) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~a~0))) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~q~0 1) (= (+ main_~s~0 (* main_~r~0 2)) 0))} is VALID [2022-04-28 12:31:23,522 INFO L290 TraceCheckUtils]: 74: Hoare triple {72715#(and (= main_~p~0 0) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~a~0))) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~q~0 1) (= (+ main_~s~0 (* main_~r~0 2)) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {72715#(and (= main_~p~0 0) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~a~0))) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~q~0 1) (= (+ main_~s~0 (* main_~r~0 2)) 0))} is VALID [2022-04-28 12:31:23,522 INFO L290 TraceCheckUtils]: 75: Hoare triple {72715#(and (= main_~p~0 0) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~a~0))) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~q~0 1) (= (+ main_~s~0 (* main_~r~0 2)) 0))} assume !!(#t~post6 < 10);havoc #t~post6; {72715#(and (= main_~p~0 0) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~a~0))) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~q~0 1) (= (+ main_~s~0 (* main_~r~0 2)) 0))} is VALID [2022-04-28 12:31:23,523 INFO L290 TraceCheckUtils]: 76: Hoare triple {72715#(and (= main_~p~0 0) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~a~0))) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~q~0 1) (= (+ main_~s~0 (* main_~r~0 2)) 0))} assume !(0 != ~b~0); {72725#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ main_~x~0 (* (- 2) main_~a~0)) 0) (= main_~q~0 1) (= (+ main_~s~0 (* main_~r~0 2)) 0))} is VALID [2022-04-28 12:31:23,524 INFO L272 TraceCheckUtils]: 77: Hoare triple {72725#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ main_~x~0 (* (- 2) main_~a~0)) 0) (= 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)); {72729#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:31:23,524 INFO L290 TraceCheckUtils]: 78: Hoare triple {72729#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {72733#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:31:23,524 INFO L290 TraceCheckUtils]: 79: Hoare triple {72733#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {72485#false} is VALID [2022-04-28 12:31:23,524 INFO L290 TraceCheckUtils]: 80: Hoare triple {72485#false} assume !false; {72485#false} is VALID [2022-04-28 12:31:23,525 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 30 proven. 20 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2022-04-28 12:31:23,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:31:30,777 INFO L290 TraceCheckUtils]: 80: Hoare triple {72485#false} assume !false; {72485#false} is VALID [2022-04-28 12:31:30,778 INFO L290 TraceCheckUtils]: 79: Hoare triple {72733#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {72485#false} is VALID [2022-04-28 12:31:30,778 INFO L290 TraceCheckUtils]: 78: Hoare triple {72729#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {72733#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:31:30,779 INFO L272 TraceCheckUtils]: 77: Hoare triple {72749#(= (+ (* 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)); {72729#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:31:30,780 INFO L290 TraceCheckUtils]: 76: Hoare triple {72753#(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); {72749#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:31:30,780 INFO L290 TraceCheckUtils]: 75: Hoare triple {72753#(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 !!(#t~post6 < 10);havoc #t~post6; {72753#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-28 12:31:30,781 INFO L290 TraceCheckUtils]: 74: Hoare triple {72753#(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)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {72753#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-28 12:31:30,877 INFO L290 TraceCheckUtils]: 73: Hoare triple {72763#(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; {72753#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-28 12:31:30,878 INFO L290 TraceCheckUtils]: 72: Hoare triple {72763#(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); {72763#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:31:30,879 INFO L290 TraceCheckUtils]: 71: Hoare triple {72763#(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 !!(#t~post7 < 10);havoc #t~post7; {72763#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:31:30,879 INFO L290 TraceCheckUtils]: 70: Hoare triple {72763#(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))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {72763#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:31:30,916 INFO L290 TraceCheckUtils]: 69: Hoare triple {72776#(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; {72763#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:31:30,917 INFO L290 TraceCheckUtils]: 68: Hoare triple {72776#(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); {72776#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:31:30,918 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {72484#true} {72776#(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))))} #104#return; {72776#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:31:30,918 INFO L290 TraceCheckUtils]: 66: Hoare triple {72484#true} assume true; {72484#true} is VALID [2022-04-28 12:31:30,918 INFO L290 TraceCheckUtils]: 65: Hoare triple {72484#true} assume !(0 == ~cond); {72484#true} is VALID [2022-04-28 12:31:30,918 INFO L290 TraceCheckUtils]: 64: Hoare triple {72484#true} ~cond := #in~cond; {72484#true} is VALID [2022-04-28 12:31:30,918 INFO L272 TraceCheckUtils]: 63: Hoare triple {72776#(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)); {72484#true} is VALID [2022-04-28 12:31:30,919 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {72484#true} {72776#(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))))} #102#return; {72776#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:31:30,919 INFO L290 TraceCheckUtils]: 61: Hoare triple {72484#true} assume true; {72484#true} is VALID [2022-04-28 12:31:30,919 INFO L290 TraceCheckUtils]: 60: Hoare triple {72484#true} assume !(0 == ~cond); {72484#true} is VALID [2022-04-28 12:31:30,919 INFO L290 TraceCheckUtils]: 59: Hoare triple {72484#true} ~cond := #in~cond; {72484#true} is VALID [2022-04-28 12:31:30,919 INFO L272 TraceCheckUtils]: 58: Hoare triple {72776#(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)); {72484#true} is VALID [2022-04-28 12:31:30,921 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {72659#(not (= |__VERIFIER_assert_#in~cond| 0))} {72813#(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))))} #100#return; {72776#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:31:30,921 INFO L290 TraceCheckUtils]: 56: Hoare triple {72659#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {72659#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:31:30,922 INFO L290 TraceCheckUtils]: 55: Hoare triple {72823#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {72659#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:31:30,922 INFO L290 TraceCheckUtils]: 54: Hoare triple {72484#true} ~cond := #in~cond; {72823#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 12:31:30,922 INFO L272 TraceCheckUtils]: 53: Hoare triple {72813#(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)); {72484#true} is VALID [2022-04-28 12:31:30,923 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {72484#true} {72813#(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))))} #98#return; {72813#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:31:30,923 INFO L290 TraceCheckUtils]: 51: Hoare triple {72484#true} assume true; {72484#true} is VALID [2022-04-28 12:31:30,923 INFO L290 TraceCheckUtils]: 50: Hoare triple {72484#true} assume !(0 == ~cond); {72484#true} is VALID [2022-04-28 12:31:30,923 INFO L290 TraceCheckUtils]: 49: Hoare triple {72484#true} ~cond := #in~cond; {72484#true} is VALID [2022-04-28 12:31:30,924 INFO L272 TraceCheckUtils]: 48: Hoare triple {72813#(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 ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {72484#true} is VALID [2022-04-28 12:31:30,924 INFO L290 TraceCheckUtils]: 47: Hoare triple {72813#(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))))} assume !!(#t~post8 < 10);havoc #t~post8; {72813#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:31:30,925 INFO L290 TraceCheckUtils]: 46: Hoare triple {72813#(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))))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {72813#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:31:31,044 INFO L290 TraceCheckUtils]: 45: Hoare triple {72851#(or (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))))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {72813#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:31:31,045 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {72484#true} {72851#(or (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))))} #104#return; {72851#(or (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))))} is VALID [2022-04-28 12:31:31,045 INFO L290 TraceCheckUtils]: 43: Hoare triple {72484#true} assume true; {72484#true} is VALID [2022-04-28 12:31:31,045 INFO L290 TraceCheckUtils]: 42: Hoare triple {72484#true} assume !(0 == ~cond); {72484#true} is VALID [2022-04-28 12:31:31,045 INFO L290 TraceCheckUtils]: 41: Hoare triple {72484#true} ~cond := #in~cond; {72484#true} is VALID [2022-04-28 12:31:31,045 INFO L272 TraceCheckUtils]: 40: Hoare triple {72851#(or (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))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {72484#true} is VALID [2022-04-28 12:31:31,046 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {72484#true} {72851#(or (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))))} #102#return; {72851#(or (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))))} is VALID [2022-04-28 12:31:31,046 INFO L290 TraceCheckUtils]: 38: Hoare triple {72484#true} assume true; {72484#true} is VALID [2022-04-28 12:31:31,046 INFO L290 TraceCheckUtils]: 37: Hoare triple {72484#true} assume !(0 == ~cond); {72484#true} is VALID [2022-04-28 12:31:31,046 INFO L290 TraceCheckUtils]: 36: Hoare triple {72484#true} ~cond := #in~cond; {72484#true} is VALID [2022-04-28 12:31:31,046 INFO L272 TraceCheckUtils]: 35: Hoare triple {72851#(or (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))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {72484#true} is VALID [2022-04-28 12:31:31,047 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {72484#true} {72851#(or (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))))} #100#return; {72851#(or (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))))} is VALID [2022-04-28 12:31:31,047 INFO L290 TraceCheckUtils]: 33: Hoare triple {72484#true} assume true; {72484#true} is VALID [2022-04-28 12:31:31,047 INFO L290 TraceCheckUtils]: 32: Hoare triple {72484#true} assume !(0 == ~cond); {72484#true} is VALID [2022-04-28 12:31:31,047 INFO L290 TraceCheckUtils]: 31: Hoare triple {72484#true} ~cond := #in~cond; {72484#true} is VALID [2022-04-28 12:31:31,047 INFO L272 TraceCheckUtils]: 30: Hoare triple {72851#(or (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))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {72484#true} is VALID [2022-04-28 12:31:31,048 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {72484#true} {72851#(or (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))))} #98#return; {72851#(or (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))))} is VALID [2022-04-28 12:31:31,048 INFO L290 TraceCheckUtils]: 28: Hoare triple {72484#true} assume true; {72484#true} is VALID [2022-04-28 12:31:31,048 INFO L290 TraceCheckUtils]: 27: Hoare triple {72484#true} assume !(0 == ~cond); {72484#true} is VALID [2022-04-28 12:31:31,049 INFO L290 TraceCheckUtils]: 26: Hoare triple {72484#true} ~cond := #in~cond; {72484#true} is VALID [2022-04-28 12:31:31,049 INFO L272 TraceCheckUtils]: 25: Hoare triple {72851#(or (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))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {72484#true} is VALID [2022-04-28 12:31:31,049 INFO L290 TraceCheckUtils]: 24: Hoare triple {72851#(or (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))))} assume !!(#t~post8 < 10);havoc #t~post8; {72851#(or (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))))} is VALID [2022-04-28 12:31:31,050 INFO L290 TraceCheckUtils]: 23: Hoare triple {72851#(or (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))))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {72851#(or (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))))} is VALID [2022-04-28 12:31:31,051 INFO L290 TraceCheckUtils]: 22: Hoare triple {72921#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~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; {72851#(or (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))))} is VALID [2022-04-28 12:31:31,051 INFO L290 TraceCheckUtils]: 21: Hoare triple {72921#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~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 !!(#t~post7 < 10);havoc #t~post7; {72921#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~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 12:31:31,052 INFO L290 TraceCheckUtils]: 20: Hoare triple {72921#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~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))))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {72921#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~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 12:31:31,053 INFO L290 TraceCheckUtils]: 19: Hoare triple {72931#(or (not (= main_~a~0 (* main_~b~0 2))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~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; {72921#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~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 12:31:31,053 INFO L290 TraceCheckUtils]: 18: Hoare triple {72931#(or (not (= main_~a~0 (* main_~b~0 2))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~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 !!(#t~post6 < 10);havoc #t~post6; {72931#(or (not (= main_~a~0 (* main_~b~0 2))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~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 12:31:31,054 INFO L290 TraceCheckUtils]: 17: Hoare triple {72931#(or (not (= main_~a~0 (* main_~b~0 2))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~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))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {72931#(or (not (= main_~a~0 (* main_~b~0 2))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~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 12:31:31,054 INFO L290 TraceCheckUtils]: 16: Hoare triple {72484#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {72931#(or (not (= main_~a~0 (* main_~b~0 2))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~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 12:31:31,055 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {72484#true} {72484#true} #96#return; {72484#true} is VALID [2022-04-28 12:31:31,055 INFO L290 TraceCheckUtils]: 14: Hoare triple {72484#true} assume true; {72484#true} is VALID [2022-04-28 12:31:31,055 INFO L290 TraceCheckUtils]: 13: Hoare triple {72484#true} assume !(0 == ~cond); {72484#true} is VALID [2022-04-28 12:31:31,055 INFO L290 TraceCheckUtils]: 12: Hoare triple {72484#true} ~cond := #in~cond; {72484#true} is VALID [2022-04-28 12:31:31,055 INFO L272 TraceCheckUtils]: 11: Hoare triple {72484#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {72484#true} is VALID [2022-04-28 12:31:31,055 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {72484#true} {72484#true} #94#return; {72484#true} is VALID [2022-04-28 12:31:31,055 INFO L290 TraceCheckUtils]: 9: Hoare triple {72484#true} assume true; {72484#true} is VALID [2022-04-28 12:31:31,055 INFO L290 TraceCheckUtils]: 8: Hoare triple {72484#true} assume !(0 == ~cond); {72484#true} is VALID [2022-04-28 12:31:31,056 INFO L290 TraceCheckUtils]: 7: Hoare triple {72484#true} ~cond := #in~cond; {72484#true} is VALID [2022-04-28 12:31:31,056 INFO L272 TraceCheckUtils]: 6: Hoare triple {72484#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {72484#true} is VALID [2022-04-28 12:31:31,056 INFO L290 TraceCheckUtils]: 5: Hoare triple {72484#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {72484#true} is VALID [2022-04-28 12:31:31,056 INFO L272 TraceCheckUtils]: 4: Hoare triple {72484#true} call #t~ret9 := main(); {72484#true} is VALID [2022-04-28 12:31:31,056 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {72484#true} {72484#true} #108#return; {72484#true} is VALID [2022-04-28 12:31:31,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {72484#true} assume true; {72484#true} is VALID [2022-04-28 12:31:31,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {72484#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);~counter~0 := 0; {72484#true} is VALID [2022-04-28 12:31:31,056 INFO L272 TraceCheckUtils]: 0: Hoare triple {72484#true} call ULTIMATE.init(); {72484#true} is VALID [2022-04-28 12:31:31,057 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 30 proven. 20 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2022-04-28 12:31:31,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:31:31,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540054445] [2022-04-28 12:31:31,057 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:31:31,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049483496] [2022-04-28 12:31:31,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049483496] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:31:31,058 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:31:31,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 22 [2022-04-28 12:31:31,058 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:31:31,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1985181388] [2022-04-28 12:31:31,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1985181388] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:31:31,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:31:31,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 12:31:31,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729762583] [2022-04-28 12:31:31,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:31:31,059 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 4 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 81 [2022-04-28 12:31:31,059 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:31:31,059 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 4 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 12:31:31,125 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:31:31,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 12:31:31,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:31:31,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 12:31:31,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2022-04-28 12:31:31,126 INFO L87 Difference]: Start difference. First operand 947 states and 1263 transitions. Second operand has 13 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 4 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 12:31:36,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:31:36,133 INFO L93 Difference]: Finished difference Result 1025 states and 1371 transitions. [2022-04-28 12:31:36,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 12:31:36,133 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 4 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 81 [2022-04-28 12:31:36,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:31:36,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 4 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 12:31:36,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 162 transitions. [2022-04-28 12:31:36,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 4 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 12:31:36,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 162 transitions. [2022-04-28 12:31:36,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 162 transitions. [2022-04-28 12:31:36,323 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:31:36,371 INFO L225 Difference]: With dead ends: 1025 [2022-04-28 12:31:36,371 INFO L226 Difference]: Without dead ends: 1022 [2022-04-28 12:31:36,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 140 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=132, Invalid=680, Unknown=0, NotChecked=0, Total=812 [2022-04-28 12:31:36,372 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 76 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:31:36,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 422 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 12:31:36,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2022-04-28 12:31:38,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 957. [2022-04-28 12:31:38,805 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:31:38,807 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1022 states. Second operand has 957 states, 679 states have (on average 1.2695139911634756) internal successors, (862), 689 states have internal predecessors, (862), 207 states have call successors, (207), 71 states have call predecessors, (207), 70 states have return successors, (203), 196 states have call predecessors, (203), 203 states have call successors, (203) [2022-04-28 12:31:38,808 INFO L74 IsIncluded]: Start isIncluded. First operand 1022 states. Second operand has 957 states, 679 states have (on average 1.2695139911634756) internal successors, (862), 689 states have internal predecessors, (862), 207 states have call successors, (207), 71 states have call predecessors, (207), 70 states have return successors, (203), 196 states have call predecessors, (203), 203 states have call successors, (203) [2022-04-28 12:31:38,809 INFO L87 Difference]: Start difference. First operand 1022 states. Second operand has 957 states, 679 states have (on average 1.2695139911634756) internal successors, (862), 689 states have internal predecessors, (862), 207 states have call successors, (207), 71 states have call predecessors, (207), 70 states have return successors, (203), 196 states have call predecessors, (203), 203 states have call successors, (203) [2022-04-28 12:31:38,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:31:38,839 INFO L93 Difference]: Finished difference Result 1022 states and 1364 transitions. [2022-04-28 12:31:38,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1364 transitions. [2022-04-28 12:31:38,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:31:38,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:31:38,841 INFO L74 IsIncluded]: Start isIncluded. First operand has 957 states, 679 states have (on average 1.2695139911634756) internal successors, (862), 689 states have internal predecessors, (862), 207 states have call successors, (207), 71 states have call predecessors, (207), 70 states have return successors, (203), 196 states have call predecessors, (203), 203 states have call successors, (203) Second operand 1022 states. [2022-04-28 12:31:38,842 INFO L87 Difference]: Start difference. First operand has 957 states, 679 states have (on average 1.2695139911634756) internal successors, (862), 689 states have internal predecessors, (862), 207 states have call successors, (207), 71 states have call predecessors, (207), 70 states have return successors, (203), 196 states have call predecessors, (203), 203 states have call successors, (203) Second operand 1022 states. [2022-04-28 12:31:38,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:31:38,872 INFO L93 Difference]: Finished difference Result 1022 states and 1364 transitions. [2022-04-28 12:31:38,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1364 transitions. [2022-04-28 12:31:38,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:31:38,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:31:38,873 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:31:38,873 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:31:38,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 957 states, 679 states have (on average 1.2695139911634756) internal successors, (862), 689 states have internal predecessors, (862), 207 states have call successors, (207), 71 states have call predecessors, (207), 70 states have return successors, (203), 196 states have call predecessors, (203), 203 states have call successors, (203) [2022-04-28 12:31:38,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1272 transitions. [2022-04-28 12:31:38,913 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1272 transitions. Word has length 81 [2022-04-28 12:31:38,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:31:38,913 INFO L495 AbstractCegarLoop]: Abstraction has 957 states and 1272 transitions. [2022-04-28 12:31:38,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 4 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 12:31:38,913 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 957 states and 1272 transitions. [2022-04-28 12:31:41,280 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1272 edges. 1272 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:31:41,280 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1272 transitions. [2022-04-28 12:31:41,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-28 12:31:41,281 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:31:41,281 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:31:41,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-28 12:31:41,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-28 12:31:41,501 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:31:41,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:31:41,501 INFO L85 PathProgramCache]: Analyzing trace with hash -2112645673, now seen corresponding path program 1 times [2022-04-28 12:31:41,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:31:41,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1382244461] [2022-04-28 12:31:41,502 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:31:41,502 INFO L85 PathProgramCache]: Analyzing trace with hash -2112645673, now seen corresponding path program 2 times [2022-04-28 12:31:41,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:31:41,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373095396] [2022-04-28 12:31:41,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:31:41,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:31:41,516 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:31:41,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [204456745] [2022-04-28 12:31:41,516 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:31:41,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:31:41,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:31:41,517 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:31:41,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-28 12:31:41,591 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:31:41,591 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:31:41,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 12:31:41,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:31:41,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:31:42,014 INFO L272 TraceCheckUtils]: 0: Hoare triple {79013#true} call ULTIMATE.init(); {79013#true} is VALID [2022-04-28 12:31:42,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {79013#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);~counter~0 := 0; {79021#(<= ~counter~0 0)} is VALID [2022-04-28 12:31:42,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {79021#(<= ~counter~0 0)} assume true; {79021#(<= ~counter~0 0)} is VALID [2022-04-28 12:31:42,015 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79021#(<= ~counter~0 0)} {79013#true} #108#return; {79021#(<= ~counter~0 0)} is VALID [2022-04-28 12:31:42,015 INFO L272 TraceCheckUtils]: 4: Hoare triple {79021#(<= ~counter~0 0)} call #t~ret9 := main(); {79021#(<= ~counter~0 0)} is VALID [2022-04-28 12:31:42,016 INFO L290 TraceCheckUtils]: 5: Hoare triple {79021#(<= ~counter~0 0)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {79021#(<= ~counter~0 0)} is VALID [2022-04-28 12:31:42,016 INFO L272 TraceCheckUtils]: 6: Hoare triple {79021#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {79021#(<= ~counter~0 0)} is VALID [2022-04-28 12:31:42,016 INFO L290 TraceCheckUtils]: 7: Hoare triple {79021#(<= ~counter~0 0)} ~cond := #in~cond; {79021#(<= ~counter~0 0)} is VALID [2022-04-28 12:31:42,017 INFO L290 TraceCheckUtils]: 8: Hoare triple {79021#(<= ~counter~0 0)} assume !(0 == ~cond); {79021#(<= ~counter~0 0)} is VALID [2022-04-28 12:31:42,017 INFO L290 TraceCheckUtils]: 9: Hoare triple {79021#(<= ~counter~0 0)} assume true; {79021#(<= ~counter~0 0)} is VALID [2022-04-28 12:31:42,017 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {79021#(<= ~counter~0 0)} {79021#(<= ~counter~0 0)} #94#return; {79021#(<= ~counter~0 0)} is VALID [2022-04-28 12:31:42,018 INFO L272 TraceCheckUtils]: 11: Hoare triple {79021#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {79021#(<= ~counter~0 0)} is VALID [2022-04-28 12:31:42,018 INFO L290 TraceCheckUtils]: 12: Hoare triple {79021#(<= ~counter~0 0)} ~cond := #in~cond; {79021#(<= ~counter~0 0)} is VALID [2022-04-28 12:31:42,018 INFO L290 TraceCheckUtils]: 13: Hoare triple {79021#(<= ~counter~0 0)} assume !(0 == ~cond); {79021#(<= ~counter~0 0)} is VALID [2022-04-28 12:31:42,019 INFO L290 TraceCheckUtils]: 14: Hoare triple {79021#(<= ~counter~0 0)} assume true; {79021#(<= ~counter~0 0)} is VALID [2022-04-28 12:31:42,019 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {79021#(<= ~counter~0 0)} {79021#(<= ~counter~0 0)} #96#return; {79021#(<= ~counter~0 0)} is VALID [2022-04-28 12:31:42,019 INFO L290 TraceCheckUtils]: 16: Hoare triple {79021#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {79021#(<= ~counter~0 0)} is VALID [2022-04-28 12:31:42,021 INFO L290 TraceCheckUtils]: 17: Hoare triple {79021#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79070#(<= ~counter~0 1)} is VALID [2022-04-28 12:31:42,021 INFO L290 TraceCheckUtils]: 18: Hoare triple {79070#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {79070#(<= ~counter~0 1)} is VALID [2022-04-28 12:31:42,021 INFO L290 TraceCheckUtils]: 19: Hoare triple {79070#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {79070#(<= ~counter~0 1)} is VALID [2022-04-28 12:31:42,022 INFO L290 TraceCheckUtils]: 20: Hoare triple {79070#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79080#(<= ~counter~0 2)} is VALID [2022-04-28 12:31:42,022 INFO L290 TraceCheckUtils]: 21: Hoare triple {79080#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {79080#(<= ~counter~0 2)} is VALID [2022-04-28 12:31:42,023 INFO L290 TraceCheckUtils]: 22: Hoare triple {79080#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {79080#(<= ~counter~0 2)} is VALID [2022-04-28 12:31:42,023 INFO L290 TraceCheckUtils]: 23: Hoare triple {79080#(<= ~counter~0 2)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {79080#(<= ~counter~0 2)} is VALID [2022-04-28 12:31:42,024 INFO L290 TraceCheckUtils]: 24: Hoare triple {79080#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79093#(<= ~counter~0 3)} is VALID [2022-04-28 12:31:42,024 INFO L290 TraceCheckUtils]: 25: Hoare triple {79093#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {79093#(<= ~counter~0 3)} is VALID [2022-04-28 12:31:42,024 INFO L290 TraceCheckUtils]: 26: Hoare triple {79093#(<= ~counter~0 3)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {79093#(<= ~counter~0 3)} is VALID [2022-04-28 12:31:42,025 INFO L290 TraceCheckUtils]: 27: Hoare triple {79093#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79103#(<= ~counter~0 4)} is VALID [2022-04-28 12:31:42,025 INFO L290 TraceCheckUtils]: 28: Hoare triple {79103#(<= ~counter~0 4)} assume !!(#t~post7 < 10);havoc #t~post7; {79103#(<= ~counter~0 4)} is VALID [2022-04-28 12:31:42,025 INFO L290 TraceCheckUtils]: 29: Hoare triple {79103#(<= ~counter~0 4)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {79103#(<= ~counter~0 4)} is VALID [2022-04-28 12:31:42,026 INFO L290 TraceCheckUtils]: 30: Hoare triple {79103#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79113#(<= ~counter~0 5)} is VALID [2022-04-28 12:31:42,026 INFO L290 TraceCheckUtils]: 31: Hoare triple {79113#(<= ~counter~0 5)} assume !!(#t~post8 < 10);havoc #t~post8; {79113#(<= ~counter~0 5)} is VALID [2022-04-28 12:31:42,027 INFO L272 TraceCheckUtils]: 32: Hoare triple {79113#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {79113#(<= ~counter~0 5)} is VALID [2022-04-28 12:31:42,027 INFO L290 TraceCheckUtils]: 33: Hoare triple {79113#(<= ~counter~0 5)} ~cond := #in~cond; {79113#(<= ~counter~0 5)} is VALID [2022-04-28 12:31:42,028 INFO L290 TraceCheckUtils]: 34: Hoare triple {79113#(<= ~counter~0 5)} assume !(0 == ~cond); {79113#(<= ~counter~0 5)} is VALID [2022-04-28 12:31:42,028 INFO L290 TraceCheckUtils]: 35: Hoare triple {79113#(<= ~counter~0 5)} assume true; {79113#(<= ~counter~0 5)} is VALID [2022-04-28 12:31:42,028 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {79113#(<= ~counter~0 5)} {79113#(<= ~counter~0 5)} #98#return; {79113#(<= ~counter~0 5)} is VALID [2022-04-28 12:31:42,029 INFO L272 TraceCheckUtils]: 37: Hoare triple {79113#(<= ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {79113#(<= ~counter~0 5)} is VALID [2022-04-28 12:31:42,029 INFO L290 TraceCheckUtils]: 38: Hoare triple {79113#(<= ~counter~0 5)} ~cond := #in~cond; {79113#(<= ~counter~0 5)} is VALID [2022-04-28 12:31:42,029 INFO L290 TraceCheckUtils]: 39: Hoare triple {79113#(<= ~counter~0 5)} assume !(0 == ~cond); {79113#(<= ~counter~0 5)} is VALID [2022-04-28 12:31:42,030 INFO L290 TraceCheckUtils]: 40: Hoare triple {79113#(<= ~counter~0 5)} assume true; {79113#(<= ~counter~0 5)} is VALID [2022-04-28 12:31:42,030 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {79113#(<= ~counter~0 5)} {79113#(<= ~counter~0 5)} #100#return; {79113#(<= ~counter~0 5)} is VALID [2022-04-28 12:31:42,031 INFO L272 TraceCheckUtils]: 42: Hoare triple {79113#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {79113#(<= ~counter~0 5)} is VALID [2022-04-28 12:31:42,031 INFO L290 TraceCheckUtils]: 43: Hoare triple {79113#(<= ~counter~0 5)} ~cond := #in~cond; {79113#(<= ~counter~0 5)} is VALID [2022-04-28 12:31:42,031 INFO L290 TraceCheckUtils]: 44: Hoare triple {79113#(<= ~counter~0 5)} assume !(0 == ~cond); {79113#(<= ~counter~0 5)} is VALID [2022-04-28 12:31:42,032 INFO L290 TraceCheckUtils]: 45: Hoare triple {79113#(<= ~counter~0 5)} assume true; {79113#(<= ~counter~0 5)} is VALID [2022-04-28 12:31:42,032 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {79113#(<= ~counter~0 5)} {79113#(<= ~counter~0 5)} #102#return; {79113#(<= ~counter~0 5)} is VALID [2022-04-28 12:31:42,033 INFO L272 TraceCheckUtils]: 47: Hoare triple {79113#(<= ~counter~0 5)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {79113#(<= ~counter~0 5)} is VALID [2022-04-28 12:31:42,033 INFO L290 TraceCheckUtils]: 48: Hoare triple {79113#(<= ~counter~0 5)} ~cond := #in~cond; {79113#(<= ~counter~0 5)} is VALID [2022-04-28 12:31:42,033 INFO L290 TraceCheckUtils]: 49: Hoare triple {79113#(<= ~counter~0 5)} assume !(0 == ~cond); {79113#(<= ~counter~0 5)} is VALID [2022-04-28 12:31:42,034 INFO L290 TraceCheckUtils]: 50: Hoare triple {79113#(<= ~counter~0 5)} assume true; {79113#(<= ~counter~0 5)} is VALID [2022-04-28 12:31:42,034 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {79113#(<= ~counter~0 5)} {79113#(<= ~counter~0 5)} #104#return; {79113#(<= ~counter~0 5)} is VALID [2022-04-28 12:31:42,034 INFO L290 TraceCheckUtils]: 52: Hoare triple {79113#(<= ~counter~0 5)} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {79113#(<= ~counter~0 5)} is VALID [2022-04-28 12:31:42,035 INFO L290 TraceCheckUtils]: 53: Hoare triple {79113#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79183#(<= ~counter~0 6)} is VALID [2022-04-28 12:31:42,036 INFO L290 TraceCheckUtils]: 54: Hoare triple {79183#(<= ~counter~0 6)} assume !!(#t~post8 < 10);havoc #t~post8; {79183#(<= ~counter~0 6)} is VALID [2022-04-28 12:31:42,036 INFO L272 TraceCheckUtils]: 55: Hoare triple {79183#(<= ~counter~0 6)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {79183#(<= ~counter~0 6)} is VALID [2022-04-28 12:31:42,036 INFO L290 TraceCheckUtils]: 56: Hoare triple {79183#(<= ~counter~0 6)} ~cond := #in~cond; {79183#(<= ~counter~0 6)} is VALID [2022-04-28 12:31:42,037 INFO L290 TraceCheckUtils]: 57: Hoare triple {79183#(<= ~counter~0 6)} assume !(0 == ~cond); {79183#(<= ~counter~0 6)} is VALID [2022-04-28 12:31:42,037 INFO L290 TraceCheckUtils]: 58: Hoare triple {79183#(<= ~counter~0 6)} assume true; {79183#(<= ~counter~0 6)} is VALID [2022-04-28 12:31:42,038 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {79183#(<= ~counter~0 6)} {79183#(<= ~counter~0 6)} #98#return; {79183#(<= ~counter~0 6)} is VALID [2022-04-28 12:31:42,038 INFO L272 TraceCheckUtils]: 60: Hoare triple {79183#(<= ~counter~0 6)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {79183#(<= ~counter~0 6)} is VALID [2022-04-28 12:31:42,038 INFO L290 TraceCheckUtils]: 61: Hoare triple {79183#(<= ~counter~0 6)} ~cond := #in~cond; {79183#(<= ~counter~0 6)} is VALID [2022-04-28 12:31:42,039 INFO L290 TraceCheckUtils]: 62: Hoare triple {79183#(<= ~counter~0 6)} assume !(0 == ~cond); {79183#(<= ~counter~0 6)} is VALID [2022-04-28 12:31:42,039 INFO L290 TraceCheckUtils]: 63: Hoare triple {79183#(<= ~counter~0 6)} assume true; {79183#(<= ~counter~0 6)} is VALID [2022-04-28 12:31:42,040 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {79183#(<= ~counter~0 6)} {79183#(<= ~counter~0 6)} #100#return; {79183#(<= ~counter~0 6)} is VALID [2022-04-28 12:31:42,040 INFO L272 TraceCheckUtils]: 65: Hoare triple {79183#(<= ~counter~0 6)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {79183#(<= ~counter~0 6)} is VALID [2022-04-28 12:31:42,040 INFO L290 TraceCheckUtils]: 66: Hoare triple {79183#(<= ~counter~0 6)} ~cond := #in~cond; {79183#(<= ~counter~0 6)} is VALID [2022-04-28 12:31:42,041 INFO L290 TraceCheckUtils]: 67: Hoare triple {79183#(<= ~counter~0 6)} assume !(0 == ~cond); {79183#(<= ~counter~0 6)} is VALID [2022-04-28 12:31:42,041 INFO L290 TraceCheckUtils]: 68: Hoare triple {79183#(<= ~counter~0 6)} assume true; {79183#(<= ~counter~0 6)} is VALID [2022-04-28 12:31:42,042 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {79183#(<= ~counter~0 6)} {79183#(<= ~counter~0 6)} #102#return; {79183#(<= ~counter~0 6)} is VALID [2022-04-28 12:31:42,042 INFO L272 TraceCheckUtils]: 70: Hoare triple {79183#(<= ~counter~0 6)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {79183#(<= ~counter~0 6)} is VALID [2022-04-28 12:31:42,042 INFO L290 TraceCheckUtils]: 71: Hoare triple {79183#(<= ~counter~0 6)} ~cond := #in~cond; {79183#(<= ~counter~0 6)} is VALID [2022-04-28 12:31:42,043 INFO L290 TraceCheckUtils]: 72: Hoare triple {79183#(<= ~counter~0 6)} assume !(0 == ~cond); {79183#(<= ~counter~0 6)} is VALID [2022-04-28 12:31:42,043 INFO L290 TraceCheckUtils]: 73: Hoare triple {79183#(<= ~counter~0 6)} assume true; {79183#(<= ~counter~0 6)} is VALID [2022-04-28 12:31:42,044 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {79183#(<= ~counter~0 6)} {79183#(<= ~counter~0 6)} #104#return; {79183#(<= ~counter~0 6)} is VALID [2022-04-28 12:31:42,044 INFO L290 TraceCheckUtils]: 75: Hoare triple {79183#(<= ~counter~0 6)} assume !(~c~0 >= 2 * ~v~0); {79183#(<= ~counter~0 6)} is VALID [2022-04-28 12:31:42,044 INFO L290 TraceCheckUtils]: 76: Hoare triple {79183#(<= ~counter~0 6)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {79183#(<= ~counter~0 6)} is VALID [2022-04-28 12:31:42,045 INFO L290 TraceCheckUtils]: 77: Hoare triple {79183#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79256#(<= ~counter~0 7)} is VALID [2022-04-28 12:31:42,045 INFO L290 TraceCheckUtils]: 78: Hoare triple {79256#(<= ~counter~0 7)} assume !!(#t~post7 < 10);havoc #t~post7; {79256#(<= ~counter~0 7)} is VALID [2022-04-28 12:31:42,046 INFO L290 TraceCheckUtils]: 79: Hoare triple {79256#(<= ~counter~0 7)} assume !(~c~0 >= ~b~0); {79256#(<= ~counter~0 7)} is VALID [2022-04-28 12:31:42,046 INFO L290 TraceCheckUtils]: 80: Hoare triple {79256#(<= ~counter~0 7)} ~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; {79256#(<= ~counter~0 7)} is VALID [2022-04-28 12:31:42,046 INFO L290 TraceCheckUtils]: 81: Hoare triple {79256#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79269#(<= |main_#t~post6| 7)} is VALID [2022-04-28 12:31:42,047 INFO L290 TraceCheckUtils]: 82: Hoare triple {79269#(<= |main_#t~post6| 7)} assume !(#t~post6 < 10);havoc #t~post6; {79014#false} is VALID [2022-04-28 12:31:42,047 INFO L272 TraceCheckUtils]: 83: Hoare triple {79014#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)); {79014#false} is VALID [2022-04-28 12:31:42,047 INFO L290 TraceCheckUtils]: 84: Hoare triple {79014#false} ~cond := #in~cond; {79014#false} is VALID [2022-04-28 12:31:42,047 INFO L290 TraceCheckUtils]: 85: Hoare triple {79014#false} assume 0 == ~cond; {79014#false} is VALID [2022-04-28 12:31:42,047 INFO L290 TraceCheckUtils]: 86: Hoare triple {79014#false} assume !false; {79014#false} is VALID [2022-04-28 12:31:42,047 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 16 proven. 88 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-28 12:31:42,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:31:42,515 INFO L290 TraceCheckUtils]: 86: Hoare triple {79014#false} assume !false; {79014#false} is VALID [2022-04-28 12:31:42,515 INFO L290 TraceCheckUtils]: 85: Hoare triple {79014#false} assume 0 == ~cond; {79014#false} is VALID [2022-04-28 12:31:42,515 INFO L290 TraceCheckUtils]: 84: Hoare triple {79014#false} ~cond := #in~cond; {79014#false} is VALID [2022-04-28 12:31:42,515 INFO L272 TraceCheckUtils]: 83: Hoare triple {79014#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)); {79014#false} is VALID [2022-04-28 12:31:42,518 INFO L290 TraceCheckUtils]: 82: Hoare triple {79297#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {79014#false} is VALID [2022-04-28 12:31:42,519 INFO L290 TraceCheckUtils]: 81: Hoare triple {79301#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79297#(< |main_#t~post6| 10)} is VALID [2022-04-28 12:31:42,519 INFO L290 TraceCheckUtils]: 80: Hoare triple {79301#(< ~counter~0 10)} ~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; {79301#(< ~counter~0 10)} is VALID [2022-04-28 12:31:42,520 INFO L290 TraceCheckUtils]: 79: Hoare triple {79301#(< ~counter~0 10)} assume !(~c~0 >= ~b~0); {79301#(< ~counter~0 10)} is VALID [2022-04-28 12:31:42,520 INFO L290 TraceCheckUtils]: 78: Hoare triple {79301#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {79301#(< ~counter~0 10)} is VALID [2022-04-28 12:31:42,522 INFO L290 TraceCheckUtils]: 77: Hoare triple {79314#(< ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79301#(< ~counter~0 10)} is VALID [2022-04-28 12:31:42,522 INFO L290 TraceCheckUtils]: 76: Hoare triple {79314#(< ~counter~0 9)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {79314#(< ~counter~0 9)} is VALID [2022-04-28 12:31:42,522 INFO L290 TraceCheckUtils]: 75: Hoare triple {79314#(< ~counter~0 9)} assume !(~c~0 >= 2 * ~v~0); {79314#(< ~counter~0 9)} is VALID [2022-04-28 12:31:42,523 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {79013#true} {79314#(< ~counter~0 9)} #104#return; {79314#(< ~counter~0 9)} is VALID [2022-04-28 12:31:42,523 INFO L290 TraceCheckUtils]: 73: Hoare triple {79013#true} assume true; {79013#true} is VALID [2022-04-28 12:31:42,523 INFO L290 TraceCheckUtils]: 72: Hoare triple {79013#true} assume !(0 == ~cond); {79013#true} is VALID [2022-04-28 12:31:42,523 INFO L290 TraceCheckUtils]: 71: Hoare triple {79013#true} ~cond := #in~cond; {79013#true} is VALID [2022-04-28 12:31:42,523 INFO L272 TraceCheckUtils]: 70: Hoare triple {79314#(< ~counter~0 9)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {79013#true} is VALID [2022-04-28 12:31:42,524 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {79013#true} {79314#(< ~counter~0 9)} #102#return; {79314#(< ~counter~0 9)} is VALID [2022-04-28 12:31:42,524 INFO L290 TraceCheckUtils]: 68: Hoare triple {79013#true} assume true; {79013#true} is VALID [2022-04-28 12:31:42,524 INFO L290 TraceCheckUtils]: 67: Hoare triple {79013#true} assume !(0 == ~cond); {79013#true} is VALID [2022-04-28 12:31:42,524 INFO L290 TraceCheckUtils]: 66: Hoare triple {79013#true} ~cond := #in~cond; {79013#true} is VALID [2022-04-28 12:31:42,525 INFO L272 TraceCheckUtils]: 65: Hoare triple {79314#(< ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {79013#true} is VALID [2022-04-28 12:31:42,525 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {79013#true} {79314#(< ~counter~0 9)} #100#return; {79314#(< ~counter~0 9)} is VALID [2022-04-28 12:31:42,525 INFO L290 TraceCheckUtils]: 63: Hoare triple {79013#true} assume true; {79013#true} is VALID [2022-04-28 12:31:42,526 INFO L290 TraceCheckUtils]: 62: Hoare triple {79013#true} assume !(0 == ~cond); {79013#true} is VALID [2022-04-28 12:31:42,526 INFO L290 TraceCheckUtils]: 61: Hoare triple {79013#true} ~cond := #in~cond; {79013#true} is VALID [2022-04-28 12:31:42,526 INFO L272 TraceCheckUtils]: 60: Hoare triple {79314#(< ~counter~0 9)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {79013#true} is VALID [2022-04-28 12:31:42,526 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {79013#true} {79314#(< ~counter~0 9)} #98#return; {79314#(< ~counter~0 9)} is VALID [2022-04-28 12:31:42,527 INFO L290 TraceCheckUtils]: 58: Hoare triple {79013#true} assume true; {79013#true} is VALID [2022-04-28 12:31:42,527 INFO L290 TraceCheckUtils]: 57: Hoare triple {79013#true} assume !(0 == ~cond); {79013#true} is VALID [2022-04-28 12:31:42,527 INFO L290 TraceCheckUtils]: 56: Hoare triple {79013#true} ~cond := #in~cond; {79013#true} is VALID [2022-04-28 12:31:42,527 INFO L272 TraceCheckUtils]: 55: Hoare triple {79314#(< ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {79013#true} is VALID [2022-04-28 12:31:42,527 INFO L290 TraceCheckUtils]: 54: Hoare triple {79314#(< ~counter~0 9)} assume !!(#t~post8 < 10);havoc #t~post8; {79314#(< ~counter~0 9)} is VALID [2022-04-28 12:31:42,528 INFO L290 TraceCheckUtils]: 53: Hoare triple {79256#(<= ~counter~0 7)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79314#(< ~counter~0 9)} is VALID [2022-04-28 12:31:42,529 INFO L290 TraceCheckUtils]: 52: Hoare triple {79256#(<= ~counter~0 7)} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {79256#(<= ~counter~0 7)} is VALID [2022-04-28 12:31:42,529 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {79013#true} {79256#(<= ~counter~0 7)} #104#return; {79256#(<= ~counter~0 7)} is VALID [2022-04-28 12:31:42,529 INFO L290 TraceCheckUtils]: 50: Hoare triple {79013#true} assume true; {79013#true} is VALID [2022-04-28 12:31:42,529 INFO L290 TraceCheckUtils]: 49: Hoare triple {79013#true} assume !(0 == ~cond); {79013#true} is VALID [2022-04-28 12:31:42,529 INFO L290 TraceCheckUtils]: 48: Hoare triple {79013#true} ~cond := #in~cond; {79013#true} is VALID [2022-04-28 12:31:42,530 INFO L272 TraceCheckUtils]: 47: Hoare triple {79256#(<= ~counter~0 7)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {79013#true} is VALID [2022-04-28 12:31:42,530 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {79013#true} {79256#(<= ~counter~0 7)} #102#return; {79256#(<= ~counter~0 7)} is VALID [2022-04-28 12:31:42,530 INFO L290 TraceCheckUtils]: 45: Hoare triple {79013#true} assume true; {79013#true} is VALID [2022-04-28 12:31:42,530 INFO L290 TraceCheckUtils]: 44: Hoare triple {79013#true} assume !(0 == ~cond); {79013#true} is VALID [2022-04-28 12:31:42,531 INFO L290 TraceCheckUtils]: 43: Hoare triple {79013#true} ~cond := #in~cond; {79013#true} is VALID [2022-04-28 12:31:42,531 INFO L272 TraceCheckUtils]: 42: Hoare triple {79256#(<= ~counter~0 7)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {79013#true} is VALID [2022-04-28 12:31:42,531 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {79013#true} {79256#(<= ~counter~0 7)} #100#return; {79256#(<= ~counter~0 7)} is VALID [2022-04-28 12:31:42,531 INFO L290 TraceCheckUtils]: 40: Hoare triple {79013#true} assume true; {79013#true} is VALID [2022-04-28 12:31:42,532 INFO L290 TraceCheckUtils]: 39: Hoare triple {79013#true} assume !(0 == ~cond); {79013#true} is VALID [2022-04-28 12:31:42,532 INFO L290 TraceCheckUtils]: 38: Hoare triple {79013#true} ~cond := #in~cond; {79013#true} is VALID [2022-04-28 12:31:42,532 INFO L272 TraceCheckUtils]: 37: Hoare triple {79256#(<= ~counter~0 7)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {79013#true} is VALID [2022-04-28 12:31:42,533 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {79013#true} {79256#(<= ~counter~0 7)} #98#return; {79256#(<= ~counter~0 7)} is VALID [2022-04-28 12:31:42,533 INFO L290 TraceCheckUtils]: 35: Hoare triple {79013#true} assume true; {79013#true} is VALID [2022-04-28 12:31:42,533 INFO L290 TraceCheckUtils]: 34: Hoare triple {79013#true} assume !(0 == ~cond); {79013#true} is VALID [2022-04-28 12:31:42,533 INFO L290 TraceCheckUtils]: 33: Hoare triple {79013#true} ~cond := #in~cond; {79013#true} is VALID [2022-04-28 12:31:42,533 INFO L272 TraceCheckUtils]: 32: Hoare triple {79256#(<= ~counter~0 7)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {79013#true} is VALID [2022-04-28 12:31:42,533 INFO L290 TraceCheckUtils]: 31: Hoare triple {79256#(<= ~counter~0 7)} assume !!(#t~post8 < 10);havoc #t~post8; {79256#(<= ~counter~0 7)} is VALID [2022-04-28 12:31:42,535 INFO L290 TraceCheckUtils]: 30: Hoare triple {79183#(<= ~counter~0 6)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79256#(<= ~counter~0 7)} is VALID [2022-04-28 12:31:42,535 INFO L290 TraceCheckUtils]: 29: Hoare triple {79183#(<= ~counter~0 6)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {79183#(<= ~counter~0 6)} is VALID [2022-04-28 12:31:42,536 INFO L290 TraceCheckUtils]: 28: Hoare triple {79183#(<= ~counter~0 6)} assume !!(#t~post7 < 10);havoc #t~post7; {79183#(<= ~counter~0 6)} is VALID [2022-04-28 12:31:42,537 INFO L290 TraceCheckUtils]: 27: Hoare triple {79113#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79183#(<= ~counter~0 6)} is VALID [2022-04-28 12:31:42,537 INFO L290 TraceCheckUtils]: 26: Hoare triple {79113#(<= ~counter~0 5)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {79113#(<= ~counter~0 5)} is VALID [2022-04-28 12:31:42,537 INFO L290 TraceCheckUtils]: 25: Hoare triple {79113#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {79113#(<= ~counter~0 5)} is VALID [2022-04-28 12:31:42,538 INFO L290 TraceCheckUtils]: 24: Hoare triple {79103#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79113#(<= ~counter~0 5)} is VALID [2022-04-28 12:31:42,539 INFO L290 TraceCheckUtils]: 23: Hoare triple {79103#(<= ~counter~0 4)} ~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; {79103#(<= ~counter~0 4)} is VALID [2022-04-28 12:31:42,539 INFO L290 TraceCheckUtils]: 22: Hoare triple {79103#(<= ~counter~0 4)} assume !(~c~0 >= ~b~0); {79103#(<= ~counter~0 4)} is VALID [2022-04-28 12:31:42,539 INFO L290 TraceCheckUtils]: 21: Hoare triple {79103#(<= ~counter~0 4)} assume !!(#t~post7 < 10);havoc #t~post7; {79103#(<= ~counter~0 4)} is VALID [2022-04-28 12:31:42,540 INFO L290 TraceCheckUtils]: 20: Hoare triple {79093#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79103#(<= ~counter~0 4)} is VALID [2022-04-28 12:31:42,540 INFO L290 TraceCheckUtils]: 19: Hoare triple {79093#(<= ~counter~0 3)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {79093#(<= ~counter~0 3)} is VALID [2022-04-28 12:31:42,541 INFO L290 TraceCheckUtils]: 18: Hoare triple {79093#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {79093#(<= ~counter~0 3)} is VALID [2022-04-28 12:31:42,542 INFO L290 TraceCheckUtils]: 17: Hoare triple {79080#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79093#(<= ~counter~0 3)} is VALID [2022-04-28 12:31:42,542 INFO L290 TraceCheckUtils]: 16: Hoare triple {79080#(<= ~counter~0 2)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {79080#(<= ~counter~0 2)} is VALID [2022-04-28 12:31:42,543 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {79013#true} {79080#(<= ~counter~0 2)} #96#return; {79080#(<= ~counter~0 2)} is VALID [2022-04-28 12:31:42,543 INFO L290 TraceCheckUtils]: 14: Hoare triple {79013#true} assume true; {79013#true} is VALID [2022-04-28 12:31:42,543 INFO L290 TraceCheckUtils]: 13: Hoare triple {79013#true} assume !(0 == ~cond); {79013#true} is VALID [2022-04-28 12:31:42,543 INFO L290 TraceCheckUtils]: 12: Hoare triple {79013#true} ~cond := #in~cond; {79013#true} is VALID [2022-04-28 12:31:42,543 INFO L272 TraceCheckUtils]: 11: Hoare triple {79080#(<= ~counter~0 2)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {79013#true} is VALID [2022-04-28 12:31:42,544 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {79013#true} {79080#(<= ~counter~0 2)} #94#return; {79080#(<= ~counter~0 2)} is VALID [2022-04-28 12:31:42,544 INFO L290 TraceCheckUtils]: 9: Hoare triple {79013#true} assume true; {79013#true} is VALID [2022-04-28 12:31:42,544 INFO L290 TraceCheckUtils]: 8: Hoare triple {79013#true} assume !(0 == ~cond); {79013#true} is VALID [2022-04-28 12:31:42,544 INFO L290 TraceCheckUtils]: 7: Hoare triple {79013#true} ~cond := #in~cond; {79013#true} is VALID [2022-04-28 12:31:42,544 INFO L272 TraceCheckUtils]: 6: Hoare triple {79080#(<= ~counter~0 2)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {79013#true} is VALID [2022-04-28 12:31:42,544 INFO L290 TraceCheckUtils]: 5: Hoare triple {79080#(<= ~counter~0 2)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {79080#(<= ~counter~0 2)} is VALID [2022-04-28 12:31:42,545 INFO L272 TraceCheckUtils]: 4: Hoare triple {79080#(<= ~counter~0 2)} call #t~ret9 := main(); {79080#(<= ~counter~0 2)} is VALID [2022-04-28 12:31:42,545 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79080#(<= ~counter~0 2)} {79013#true} #108#return; {79080#(<= ~counter~0 2)} is VALID [2022-04-28 12:31:42,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {79080#(<= ~counter~0 2)} assume true; {79080#(<= ~counter~0 2)} is VALID [2022-04-28 12:31:42,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {79013#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);~counter~0 := 0; {79080#(<= ~counter~0 2)} is VALID [2022-04-28 12:31:42,546 INFO L272 TraceCheckUtils]: 0: Hoare triple {79013#true} call ULTIMATE.init(); {79013#true} is VALID [2022-04-28 12:31:42,547 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 16 proven. 24 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-28 12:31:42,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:31:42,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373095396] [2022-04-28 12:31:42,547 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:31:42,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204456745] [2022-04-28 12:31:42,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204456745] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:31:42,547 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:31:42,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2022-04-28 12:31:42,548 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:31:42,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1382244461] [2022-04-28 12:31:42,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1382244461] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:31:42,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:31:42,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 12:31:42,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129153673] [2022-04-28 12:31:42,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:31:42,549 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 5 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 87 [2022-04-28 12:31:42,549 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:31:42,549 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 5 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 12:31:42,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:31:42,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 12:31:42,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:31:42,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 12:31:42,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 12:31:42,620 INFO L87 Difference]: Start difference. First operand 957 states and 1272 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 5 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 12:31:45,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:31:45,578 INFO L93 Difference]: Finished difference Result 966 states and 1279 transitions. [2022-04-28 12:31:45,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 12:31:45,578 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 5 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 87 [2022-04-28 12:31:45,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:31:45,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 5 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 12:31:45,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 180 transitions. [2022-04-28 12:31:45,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 5 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 12:31:45,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 180 transitions. [2022-04-28 12:31:45,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 180 transitions. [2022-04-28 12:31:45,729 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:31:45,769 INFO L225 Difference]: With dead ends: 966 [2022-04-28 12:31:45,769 INFO L226 Difference]: Without dead ends: 959 [2022-04-28 12:31:45,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 160 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=213, Unknown=0, NotChecked=0, Total=342 [2022-04-28 12:31:45,770 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 122 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 12:31:45,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 261 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 12:31:45,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2022-04-28 12:31:48,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 957. [2022-04-28 12:31:48,162 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:31:48,163 INFO L82 GeneralOperation]: Start isEquivalent. First operand 959 states. Second operand has 957 states, 679 states have (on average 1.2665684830633284) internal successors, (860), 689 states have internal predecessors, (860), 207 states have call successors, (207), 71 states have call predecessors, (207), 70 states have return successors, (203), 196 states have call predecessors, (203), 203 states have call successors, (203) [2022-04-28 12:31:48,163 INFO L74 IsIncluded]: Start isIncluded. First operand 959 states. Second operand has 957 states, 679 states have (on average 1.2665684830633284) internal successors, (860), 689 states have internal predecessors, (860), 207 states have call successors, (207), 71 states have call predecessors, (207), 70 states have return successors, (203), 196 states have call predecessors, (203), 203 states have call successors, (203) [2022-04-28 12:31:48,164 INFO L87 Difference]: Start difference. First operand 959 states. Second operand has 957 states, 679 states have (on average 1.2665684830633284) internal successors, (860), 689 states have internal predecessors, (860), 207 states have call successors, (207), 71 states have call predecessors, (207), 70 states have return successors, (203), 196 states have call predecessors, (203), 203 states have call successors, (203) [2022-04-28 12:31:48,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:31:48,194 INFO L93 Difference]: Finished difference Result 959 states and 1271 transitions. [2022-04-28 12:31:48,194 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1271 transitions. [2022-04-28 12:31:48,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:31:48,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:31:48,197 INFO L74 IsIncluded]: Start isIncluded. First operand has 957 states, 679 states have (on average 1.2665684830633284) internal successors, (860), 689 states have internal predecessors, (860), 207 states have call successors, (207), 71 states have call predecessors, (207), 70 states have return successors, (203), 196 states have call predecessors, (203), 203 states have call successors, (203) Second operand 959 states. [2022-04-28 12:31:48,198 INFO L87 Difference]: Start difference. First operand has 957 states, 679 states have (on average 1.2665684830633284) internal successors, (860), 689 states have internal predecessors, (860), 207 states have call successors, (207), 71 states have call predecessors, (207), 70 states have return successors, (203), 196 states have call predecessors, (203), 203 states have call successors, (203) Second operand 959 states. [2022-04-28 12:31:48,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:31:48,233 INFO L93 Difference]: Finished difference Result 959 states and 1271 transitions. [2022-04-28 12:31:48,233 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1271 transitions. [2022-04-28 12:31:48,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:31:48,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:31:48,235 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:31:48,235 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:31:48,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 957 states, 679 states have (on average 1.2665684830633284) internal successors, (860), 689 states have internal predecessors, (860), 207 states have call successors, (207), 71 states have call predecessors, (207), 70 states have return successors, (203), 196 states have call predecessors, (203), 203 states have call successors, (203) [2022-04-28 12:31:48,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1270 transitions. [2022-04-28 12:31:48,277 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1270 transitions. Word has length 87 [2022-04-28 12:31:48,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:31:48,277 INFO L495 AbstractCegarLoop]: Abstraction has 957 states and 1270 transitions. [2022-04-28 12:31:48,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 5 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 12:31:48,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 957 states and 1270 transitions. [2022-04-28 12:31:50,716 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1270 edges. 1270 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:31:50,717 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1270 transitions. [2022-04-28 12:31:50,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-04-28 12:31:50,717 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:31:50,717 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:31:50,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-28 12:31:50,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:31:50,918 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:31:50,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:31:50,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1082523945, now seen corresponding path program 3 times [2022-04-28 12:31:50,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:31:50,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [125365860] [2022-04-28 12:31:50,919 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:31:50,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1082523945, now seen corresponding path program 4 times [2022-04-28 12:31:50,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:31:50,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038865475] [2022-04-28 12:31:50,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:31:50,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:31:50,932 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:31:50,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [107742937] [2022-04-28 12:31:50,933 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 12:31:50,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:31:50,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:31:50,934 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:31:50,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-28 12:31:51,007 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 12:31:51,007 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:31:51,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 78 conjunts are in the unsatisfiable core [2022-04-28 12:31:51,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:31:51,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:32:21,540 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 12:32:31,560 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 12:32:38,199 INFO L272 TraceCheckUtils]: 0: Hoare triple {85322#true} call ULTIMATE.init(); {85322#true} is VALID [2022-04-28 12:32:38,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {85322#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);~counter~0 := 0; {85322#true} is VALID [2022-04-28 12:32:38,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {85322#true} assume true; {85322#true} is VALID [2022-04-28 12:32:38,200 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {85322#true} {85322#true} #108#return; {85322#true} is VALID [2022-04-28 12:32:38,200 INFO L272 TraceCheckUtils]: 4: Hoare triple {85322#true} call #t~ret9 := main(); {85322#true} is VALID [2022-04-28 12:32:38,200 INFO L290 TraceCheckUtils]: 5: Hoare triple {85322#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {85322#true} is VALID [2022-04-28 12:32:38,200 INFO L272 TraceCheckUtils]: 6: Hoare triple {85322#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {85322#true} is VALID [2022-04-28 12:32:38,200 INFO L290 TraceCheckUtils]: 7: Hoare triple {85322#true} ~cond := #in~cond; {85322#true} is VALID [2022-04-28 12:32:38,200 INFO L290 TraceCheckUtils]: 8: Hoare triple {85322#true} assume !(0 == ~cond); {85322#true} is VALID [2022-04-28 12:32:38,200 INFO L290 TraceCheckUtils]: 9: Hoare triple {85322#true} assume true; {85322#true} is VALID [2022-04-28 12:32:38,200 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {85322#true} {85322#true} #94#return; {85322#true} is VALID [2022-04-28 12:32:38,201 INFO L272 TraceCheckUtils]: 11: Hoare triple {85322#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {85322#true} is VALID [2022-04-28 12:32:38,201 INFO L290 TraceCheckUtils]: 12: Hoare triple {85322#true} ~cond := #in~cond; {85322#true} is VALID [2022-04-28 12:32:38,201 INFO L290 TraceCheckUtils]: 13: Hoare triple {85322#true} assume !(0 == ~cond); {85322#true} is VALID [2022-04-28 12:32:38,201 INFO L290 TraceCheckUtils]: 14: Hoare triple {85322#true} assume true; {85322#true} is VALID [2022-04-28 12:32:38,201 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {85322#true} {85322#true} #96#return; {85322#true} is VALID [2022-04-28 12:32:38,211 INFO L290 TraceCheckUtils]: 16: Hoare triple {85322#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {85375#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:32:38,212 INFO L290 TraceCheckUtils]: 17: Hoare triple {85375#(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))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {85375#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:32:38,212 INFO L290 TraceCheckUtils]: 18: Hoare triple {85375#(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 !!(#t~post6 < 10);havoc #t~post6; {85375#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:32:38,213 INFO L290 TraceCheckUtils]: 19: Hoare triple {85375#(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; {85385#(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 12:32:38,213 INFO L290 TraceCheckUtils]: 20: Hoare triple {85385#(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))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {85385#(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 12:32:38,214 INFO L290 TraceCheckUtils]: 21: Hoare triple {85385#(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 !!(#t~post7 < 10);havoc #t~post7; {85385#(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 12:32:38,214 INFO L290 TraceCheckUtils]: 22: Hoare triple {85385#(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); {85385#(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 12:32:38,215 INFO L290 TraceCheckUtils]: 23: Hoare triple {85385#(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; {85398#(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) (= main_~q~0 1))} is VALID [2022-04-28 12:32:38,215 INFO L290 TraceCheckUtils]: 24: Hoare triple {85398#(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) (= main_~q~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {85398#(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) (= main_~q~0 1))} is VALID [2022-04-28 12:32:38,216 INFO L290 TraceCheckUtils]: 25: Hoare triple {85398#(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) (= main_~q~0 1))} assume !!(#t~post6 < 10);havoc #t~post6; {85398#(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) (= main_~q~0 1))} is VALID [2022-04-28 12:32:38,216 INFO L290 TraceCheckUtils]: 26: Hoare triple {85398#(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) (= main_~q~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {85408#(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) (= main_~q~0 1))} is VALID [2022-04-28 12:32:38,217 INFO L290 TraceCheckUtils]: 27: Hoare triple {85408#(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) (= main_~q~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {85408#(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) (= main_~q~0 1))} is VALID [2022-04-28 12:32:38,217 INFO L290 TraceCheckUtils]: 28: Hoare triple {85408#(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) (= main_~q~0 1))} assume !!(#t~post7 < 10);havoc #t~post7; {85408#(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) (= main_~q~0 1))} is VALID [2022-04-28 12:32:38,218 INFO L290 TraceCheckUtils]: 29: Hoare triple {85408#(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) (= main_~q~0 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {85418#(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_~q~0 1))} is VALID [2022-04-28 12:32:38,218 INFO L290 TraceCheckUtils]: 30: Hoare triple {85418#(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_~q~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {85418#(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_~q~0 1))} is VALID [2022-04-28 12:32:38,219 INFO L290 TraceCheckUtils]: 31: Hoare triple {85418#(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_~q~0 1))} assume !!(#t~post8 < 10);havoc #t~post8; {85418#(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_~q~0 1))} is VALID [2022-04-28 12:32:38,219 INFO L272 TraceCheckUtils]: 32: Hoare triple {85418#(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_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {85322#true} is VALID [2022-04-28 12:32:38,219 INFO L290 TraceCheckUtils]: 33: Hoare triple {85322#true} ~cond := #in~cond; {85431#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:32:38,219 INFO L290 TraceCheckUtils]: 34: Hoare triple {85431#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {85435#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:32:38,220 INFO L290 TraceCheckUtils]: 35: Hoare triple {85435#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {85435#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:32:38,221 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {85435#(not (= |__VERIFIER_assert_#in~cond| 0))} {85418#(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_~q~0 1))} #98#return; {85442#(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_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:32:38,221 INFO L272 TraceCheckUtils]: 37: Hoare triple {85442#(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_~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)); {85322#true} is VALID [2022-04-28 12:32:38,221 INFO L290 TraceCheckUtils]: 38: Hoare triple {85322#true} ~cond := #in~cond; {85322#true} is VALID [2022-04-28 12:32:38,221 INFO L290 TraceCheckUtils]: 39: Hoare triple {85322#true} assume !(0 == ~cond); {85322#true} is VALID [2022-04-28 12:32:38,221 INFO L290 TraceCheckUtils]: 40: Hoare triple {85322#true} assume true; {85322#true} is VALID [2022-04-28 12:32:38,222 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {85322#true} {85442#(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_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #100#return; {85442#(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_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:32:38,222 INFO L272 TraceCheckUtils]: 42: Hoare triple {85442#(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_~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)); {85322#true} is VALID [2022-04-28 12:32:38,222 INFO L290 TraceCheckUtils]: 43: Hoare triple {85322#true} ~cond := #in~cond; {85322#true} is VALID [2022-04-28 12:32:38,222 INFO L290 TraceCheckUtils]: 44: Hoare triple {85322#true} assume !(0 == ~cond); {85322#true} is VALID [2022-04-28 12:32:38,222 INFO L290 TraceCheckUtils]: 45: Hoare triple {85322#true} assume true; {85322#true} is VALID [2022-04-28 12:32:38,223 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {85322#true} {85442#(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_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #102#return; {85442#(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_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:32:38,223 INFO L272 TraceCheckUtils]: 47: Hoare triple {85442#(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_~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)); {85322#true} is VALID [2022-04-28 12:32:38,223 INFO L290 TraceCheckUtils]: 48: Hoare triple {85322#true} ~cond := #in~cond; {85322#true} is VALID [2022-04-28 12:32:38,223 INFO L290 TraceCheckUtils]: 49: Hoare triple {85322#true} assume !(0 == ~cond); {85322#true} is VALID [2022-04-28 12:32:38,223 INFO L290 TraceCheckUtils]: 50: Hoare triple {85322#true} assume true; {85322#true} is VALID [2022-04-28 12:32:38,224 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {85322#true} {85442#(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_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #104#return; {85442#(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_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 12:32:38,226 INFO L290 TraceCheckUtils]: 52: Hoare triple {85442#(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_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {85491#(and (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 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 12:32:38,226 INFO L290 TraceCheckUtils]: 53: Hoare triple {85491#(and (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {85491#(and (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 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 12:32:38,227 INFO L290 TraceCheckUtils]: 54: Hoare triple {85491#(and (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !!(#t~post8 < 10);havoc #t~post8; {85491#(and (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 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 12:32:38,227 INFO L272 TraceCheckUtils]: 55: Hoare triple {85491#(and (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 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 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {85322#true} is VALID [2022-04-28 12:32:38,227 INFO L290 TraceCheckUtils]: 56: Hoare triple {85322#true} ~cond := #in~cond; {85322#true} is VALID [2022-04-28 12:32:38,227 INFO L290 TraceCheckUtils]: 57: Hoare triple {85322#true} assume !(0 == ~cond); {85322#true} is VALID [2022-04-28 12:32:38,227 INFO L290 TraceCheckUtils]: 58: Hoare triple {85322#true} assume true; {85322#true} is VALID [2022-04-28 12:32:38,228 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {85322#true} {85491#(and (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #98#return; {85491#(and (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 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 12:32:38,228 INFO L272 TraceCheckUtils]: 60: Hoare triple {85491#(and (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 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)); {85322#true} is VALID [2022-04-28 12:32:38,228 INFO L290 TraceCheckUtils]: 61: Hoare triple {85322#true} ~cond := #in~cond; {85431#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:32:38,228 INFO L290 TraceCheckUtils]: 62: Hoare triple {85431#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {85435#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:32:38,229 INFO L290 TraceCheckUtils]: 63: Hoare triple {85435#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {85435#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:32:38,229 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {85435#(not (= |__VERIFIER_assert_#in~cond| 0))} {85491#(and (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #100#return; {85491#(and (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 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 12:32:38,230 INFO L272 TraceCheckUtils]: 65: Hoare triple {85491#(and (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 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)); {85322#true} is VALID [2022-04-28 12:32:38,230 INFO L290 TraceCheckUtils]: 66: Hoare triple {85322#true} ~cond := #in~cond; {85322#true} is VALID [2022-04-28 12:32:38,230 INFO L290 TraceCheckUtils]: 67: Hoare triple {85322#true} assume !(0 == ~cond); {85322#true} is VALID [2022-04-28 12:32:38,230 INFO L290 TraceCheckUtils]: 68: Hoare triple {85322#true} assume true; {85322#true} is VALID [2022-04-28 12:32:38,231 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {85322#true} {85491#(and (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #102#return; {85491#(and (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 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 12:32:38,231 INFO L272 TraceCheckUtils]: 70: Hoare triple {85491#(and (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 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)); {85322#true} is VALID [2022-04-28 12:32:38,231 INFO L290 TraceCheckUtils]: 71: Hoare triple {85322#true} ~cond := #in~cond; {85431#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:32:38,231 INFO L290 TraceCheckUtils]: 72: Hoare triple {85431#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {85435#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:32:38,232 INFO L290 TraceCheckUtils]: 73: Hoare triple {85435#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {85435#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:32:38,233 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {85435#(not (= |__VERIFIER_assert_#in~cond| 0))} {85491#(and (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 0) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #104#return; {85558#(and (= main_~v~0 (* main_~d~0 main_~b~0)) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 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 12:32:38,233 INFO L290 TraceCheckUtils]: 75: Hoare triple {85558#(and (= main_~v~0 (* main_~d~0 main_~b~0)) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 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); {85558#(and (= main_~v~0 (* main_~d~0 main_~b~0)) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 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 12:32:38,236 INFO L290 TraceCheckUtils]: 76: Hoare triple {85558#(and (= main_~v~0 (* main_~d~0 main_~b~0)) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (mod main_~d~0 2) 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; {85565#(and (= main_~s~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 0) (= main_~r~0 1) (= (mod main_~k~0 2) 0) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~q~0 1))} is VALID [2022-04-28 12:32:38,237 INFO L290 TraceCheckUtils]: 77: Hoare triple {85565#(and (= main_~s~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 0) (= main_~r~0 1) (= (mod main_~k~0 2) 0) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~q~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {85565#(and (= main_~s~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 0) (= main_~r~0 1) (= (mod main_~k~0 2) 0) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~q~0 1))} is VALID [2022-04-28 12:32:38,237 INFO L290 TraceCheckUtils]: 78: Hoare triple {85565#(and (= main_~s~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 0) (= main_~r~0 1) (= (mod main_~k~0 2) 0) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~q~0 1))} assume !!(#t~post7 < 10);havoc #t~post7; {85565#(and (= main_~s~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 0) (= main_~r~0 1) (= (mod main_~k~0 2) 0) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~q~0 1))} is VALID [2022-04-28 12:32:38,238 INFO L290 TraceCheckUtils]: 79: Hoare triple {85565#(and (= main_~s~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 0) (= main_~r~0 1) (= (mod main_~k~0 2) 0) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~q~0 1))} assume !(~c~0 >= ~b~0); {85565#(and (= main_~s~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 0) (= main_~r~0 1) (= (mod main_~k~0 2) 0) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~q~0 1))} is VALID [2022-04-28 12:32:38,243 INFO L290 TraceCheckUtils]: 80: Hoare triple {85565#(and (= main_~s~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 0) (= main_~r~0 1) (= (mod main_~k~0 2) 0) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~q~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; {85578#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~a~0 main_~x~0) (= main_~p~0 1) (or (and (= main_~y~0 (+ main_~b~0 (* (* (div main_~a~0 main_~a~0) main_~a~0) 2))) (= (+ main_~q~0 (* (* (div main_~a~0 main_~a~0) main_~p~0) 2)) 0)) (and (= main_~a~0 0) (= (div (+ main_~y~0 (* (- 1) main_~b~0)) 2) 0) (= (mod main_~q~0 2) 0) (= (mod (+ main_~b~0 main_~y~0) 2) 0))))} is VALID [2022-04-28 12:32:38,245 INFO L290 TraceCheckUtils]: 81: Hoare triple {85578#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~a~0 main_~x~0) (= main_~p~0 1) (or (and (= main_~y~0 (+ main_~b~0 (* (* (div main_~a~0 main_~a~0) main_~a~0) 2))) (= (+ main_~q~0 (* (* (div main_~a~0 main_~a~0) main_~p~0) 2)) 0)) (and (= main_~a~0 0) (= (div (+ main_~y~0 (* (- 1) main_~b~0)) 2) 0) (= (mod main_~q~0 2) 0) (= (mod (+ main_~b~0 main_~y~0) 2) 0))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {85578#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~a~0 main_~x~0) (= main_~p~0 1) (or (and (= main_~y~0 (+ main_~b~0 (* (* (div main_~a~0 main_~a~0) main_~a~0) 2))) (= (+ main_~q~0 (* (* (div main_~a~0 main_~a~0) main_~p~0) 2)) 0)) (and (= main_~a~0 0) (= (div (+ main_~y~0 (* (- 1) main_~b~0)) 2) 0) (= (mod main_~q~0 2) 0) (= (mod (+ main_~b~0 main_~y~0) 2) 0))))} is VALID [2022-04-28 12:32:38,246 INFO L290 TraceCheckUtils]: 82: Hoare triple {85578#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~a~0 main_~x~0) (= main_~p~0 1) (or (and (= main_~y~0 (+ main_~b~0 (* (* (div main_~a~0 main_~a~0) main_~a~0) 2))) (= (+ main_~q~0 (* (* (div main_~a~0 main_~a~0) main_~p~0) 2)) 0)) (and (= main_~a~0 0) (= (div (+ main_~y~0 (* (- 1) main_~b~0)) 2) 0) (= (mod main_~q~0 2) 0) (= (mod (+ main_~b~0 main_~y~0) 2) 0))))} assume !!(#t~post6 < 10);havoc #t~post6; {85578#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~a~0 main_~x~0) (= main_~p~0 1) (or (and (= main_~y~0 (+ main_~b~0 (* (* (div main_~a~0 main_~a~0) main_~a~0) 2))) (= (+ main_~q~0 (* (* (div main_~a~0 main_~a~0) main_~p~0) 2)) 0)) (and (= main_~a~0 0) (= (div (+ main_~y~0 (* (- 1) main_~b~0)) 2) 0) (= (mod main_~q~0 2) 0) (= (mod (+ main_~b~0 main_~y~0) 2) 0))))} is VALID [2022-04-28 12:32:38,247 INFO L290 TraceCheckUtils]: 83: Hoare triple {85578#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~a~0 main_~x~0) (= main_~p~0 1) (or (and (= main_~y~0 (+ main_~b~0 (* (* (div main_~a~0 main_~a~0) main_~a~0) 2))) (= (+ main_~q~0 (* (* (div main_~a~0 main_~a~0) main_~p~0) 2)) 0)) (and (= main_~a~0 0) (= (div (+ main_~y~0 (* (- 1) main_~b~0)) 2) 0) (= (mod main_~q~0 2) 0) (= (mod (+ main_~b~0 main_~y~0) 2) 0))))} assume !(0 != ~b~0); {85588#(and (= main_~r~0 0) (or (and (= main_~a~0 0) (= (div main_~y~0 2) 0) (= (mod main_~y~0 2) 0) (= (mod main_~q~0 2) 0)) (and (= main_~y~0 (* (* (div main_~a~0 main_~a~0) main_~a~0) 2)) (= (+ main_~q~0 (* (* (div main_~a~0 main_~a~0) main_~p~0) 2)) 0))) (= main_~s~0 1) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:32:38,252 INFO L272 TraceCheckUtils]: 84: Hoare triple {85588#(and (= main_~r~0 0) (or (and (= main_~a~0 0) (= (div main_~y~0 2) 0) (= (mod main_~y~0 2) 0) (= (mod main_~q~0 2) 0)) (and (= main_~y~0 (* (* (div main_~a~0 main_~a~0) main_~a~0) 2)) (= (+ main_~q~0 (* (* (div main_~a~0 main_~a~0) main_~p~0) 2)) 0))) (= main_~s~0 1) (= 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)); {85592#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:32:38,252 INFO L290 TraceCheckUtils]: 85: Hoare triple {85592#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {85596#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:32:38,253 INFO L290 TraceCheckUtils]: 86: Hoare triple {85596#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {85323#false} is VALID [2022-04-28 12:32:38,253 INFO L290 TraceCheckUtils]: 87: Hoare triple {85323#false} assume !false; {85323#false} is VALID [2022-04-28 12:32:38,253 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 40 proven. 47 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-04-28 12:32:38,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:33:17,155 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 12:33:18,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:33:18,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038865475] [2022-04-28 12:33:18,654 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:33:18,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107742937] [2022-04-28 12:33:18,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107742937] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 12:33:18,654 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 12:33:18,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2022-04-28 12:33:18,654 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:33:18,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [125365860] [2022-04-28 12:33:18,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [125365860] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:33:18,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:33:18,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 12:33:18,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493822489] [2022-04-28 12:33:18,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:33:18,655 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.6875) internal successors, (43), 15 states have internal predecessors, (43), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 88 [2022-04-28 12:33:18,655 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:33:18,655 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 2.6875) internal successors, (43), 15 states have internal predecessors, (43), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 12:33:18,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:33:18,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 12:33:18,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:33:18,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 12:33:18,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=504, Unknown=0, NotChecked=0, Total=600 [2022-04-28 12:33:18,864 INFO L87 Difference]: Start difference. First operand 957 states and 1270 transitions. Second operand has 17 states, 16 states have (on average 2.6875) internal successors, (43), 15 states have internal predecessors, (43), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 12:33:29,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:33:29,704 INFO L93 Difference]: Finished difference Result 1069 states and 1430 transitions. [2022-04-28 12:33:29,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 12:33:29,704 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.6875) internal successors, (43), 15 states have internal predecessors, (43), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 88 [2022-04-28 12:33:29,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:33:29,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.6875) internal successors, (43), 15 states have internal predecessors, (43), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 12:33:29,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 202 transitions. [2022-04-28 12:33:29,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.6875) internal successors, (43), 15 states have internal predecessors, (43), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 12:33:29,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 202 transitions. [2022-04-28 12:33:29,707 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 202 transitions. [2022-04-28 12:33:30,032 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 202 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:33:30,101 INFO L225 Difference]: With dead ends: 1069 [2022-04-28 12:33:30,102 INFO L226 Difference]: Without dead ends: 1066 [2022-04-28 12:33:30,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2022-04-28 12:33:30,102 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 91 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 1243 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 1298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-04-28 12:33:30,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 726 Invalid, 1298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1243 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-04-28 12:33:30,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2022-04-28 12:33:32,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 1023. [2022-04-28 12:33:32,727 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:33:32,728 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1066 states. Second operand has 1023 states, 720 states have (on average 1.275) internal successors, (918), 731 states have internal predecessors, (918), 229 states have call successors, (229), 74 states have call predecessors, (229), 73 states have return successors, (225), 217 states have call predecessors, (225), 225 states have call successors, (225) [2022-04-28 12:33:32,729 INFO L74 IsIncluded]: Start isIncluded. First operand 1066 states. Second operand has 1023 states, 720 states have (on average 1.275) internal successors, (918), 731 states have internal predecessors, (918), 229 states have call successors, (229), 74 states have call predecessors, (229), 73 states have return successors, (225), 217 states have call predecessors, (225), 225 states have call successors, (225) [2022-04-28 12:33:32,730 INFO L87 Difference]: Start difference. First operand 1066 states. Second operand has 1023 states, 720 states have (on average 1.275) internal successors, (918), 731 states have internal predecessors, (918), 229 states have call successors, (229), 74 states have call predecessors, (229), 73 states have return successors, (225), 217 states have call predecessors, (225), 225 states have call successors, (225) [2022-04-28 12:33:32,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:33:32,764 INFO L93 Difference]: Finished difference Result 1066 states and 1425 transitions. [2022-04-28 12:33:32,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1425 transitions. [2022-04-28 12:33:32,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:33:32,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:33:32,767 INFO L74 IsIncluded]: Start isIncluded. First operand has 1023 states, 720 states have (on average 1.275) internal successors, (918), 731 states have internal predecessors, (918), 229 states have call successors, (229), 74 states have call predecessors, (229), 73 states have return successors, (225), 217 states have call predecessors, (225), 225 states have call successors, (225) Second operand 1066 states. [2022-04-28 12:33:32,767 INFO L87 Difference]: Start difference. First operand has 1023 states, 720 states have (on average 1.275) internal successors, (918), 731 states have internal predecessors, (918), 229 states have call successors, (229), 74 states have call predecessors, (229), 73 states have return successors, (225), 217 states have call predecessors, (225), 225 states have call successors, (225) Second operand 1066 states. [2022-04-28 12:33:32,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:33:32,803 INFO L93 Difference]: Finished difference Result 1066 states and 1425 transitions. [2022-04-28 12:33:32,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1425 transitions. [2022-04-28 12:33:32,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:33:32,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:33:32,805 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:33:32,805 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:33:32,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 720 states have (on average 1.275) internal successors, (918), 731 states have internal predecessors, (918), 229 states have call successors, (229), 74 states have call predecessors, (229), 73 states have return successors, (225), 217 states have call predecessors, (225), 225 states have call successors, (225) [2022-04-28 12:33:32,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1372 transitions. [2022-04-28 12:33:32,862 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1372 transitions. Word has length 88 [2022-04-28 12:33:32,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:33:32,862 INFO L495 AbstractCegarLoop]: Abstraction has 1023 states and 1372 transitions. [2022-04-28 12:33:32,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.6875) internal successors, (43), 15 states have internal predecessors, (43), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 12:33:32,862 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1023 states and 1372 transitions. [2022-04-28 12:33:35,784 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1372 edges. 1372 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:33:35,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1372 transitions. [2022-04-28 12:33:35,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-28 12:33:35,785 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:33:35,785 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:33:35,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-28 12:33:35,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-04-28 12:33:35,989 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:33:35,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:33:35,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1791236545, now seen corresponding path program 5 times [2022-04-28 12:33:35,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:33:35,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [461964201] [2022-04-28 12:33:35,990 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:33:35,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1791236545, now seen corresponding path program 6 times [2022-04-28 12:33:35,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:33:35,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078435989] [2022-04-28 12:33:35,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:33:35,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:33:36,002 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:33:36,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [285878088] [2022-04-28 12:33:36,002 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 12:33:36,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:33:36,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:33:36,003 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:33:36,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-28 12:33:36,094 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 12:33:36,094 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:33:36,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 12:33:36,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:33:36,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:33:36,592 INFO L272 TraceCheckUtils]: 0: Hoare triple {92051#true} call ULTIMATE.init(); {92051#true} is VALID [2022-04-28 12:33:36,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {92051#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);~counter~0 := 0; {92059#(<= ~counter~0 0)} is VALID [2022-04-28 12:33:36,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {92059#(<= ~counter~0 0)} assume true; {92059#(<= ~counter~0 0)} is VALID [2022-04-28 12:33:36,594 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {92059#(<= ~counter~0 0)} {92051#true} #108#return; {92059#(<= ~counter~0 0)} is VALID [2022-04-28 12:33:36,594 INFO L272 TraceCheckUtils]: 4: Hoare triple {92059#(<= ~counter~0 0)} call #t~ret9 := main(); {92059#(<= ~counter~0 0)} is VALID [2022-04-28 12:33:36,594 INFO L290 TraceCheckUtils]: 5: Hoare triple {92059#(<= ~counter~0 0)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {92059#(<= ~counter~0 0)} is VALID [2022-04-28 12:33:36,595 INFO L272 TraceCheckUtils]: 6: Hoare triple {92059#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {92059#(<= ~counter~0 0)} is VALID [2022-04-28 12:33:36,595 INFO L290 TraceCheckUtils]: 7: Hoare triple {92059#(<= ~counter~0 0)} ~cond := #in~cond; {92059#(<= ~counter~0 0)} is VALID [2022-04-28 12:33:36,595 INFO L290 TraceCheckUtils]: 8: Hoare triple {92059#(<= ~counter~0 0)} assume !(0 == ~cond); {92059#(<= ~counter~0 0)} is VALID [2022-04-28 12:33:36,595 INFO L290 TraceCheckUtils]: 9: Hoare triple {92059#(<= ~counter~0 0)} assume true; {92059#(<= ~counter~0 0)} is VALID [2022-04-28 12:33:36,596 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {92059#(<= ~counter~0 0)} {92059#(<= ~counter~0 0)} #94#return; {92059#(<= ~counter~0 0)} is VALID [2022-04-28 12:33:36,596 INFO L272 TraceCheckUtils]: 11: Hoare triple {92059#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {92059#(<= ~counter~0 0)} is VALID [2022-04-28 12:33:36,597 INFO L290 TraceCheckUtils]: 12: Hoare triple {92059#(<= ~counter~0 0)} ~cond := #in~cond; {92059#(<= ~counter~0 0)} is VALID [2022-04-28 12:33:36,597 INFO L290 TraceCheckUtils]: 13: Hoare triple {92059#(<= ~counter~0 0)} assume !(0 == ~cond); {92059#(<= ~counter~0 0)} is VALID [2022-04-28 12:33:36,597 INFO L290 TraceCheckUtils]: 14: Hoare triple {92059#(<= ~counter~0 0)} assume true; {92059#(<= ~counter~0 0)} is VALID [2022-04-28 12:33:36,597 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {92059#(<= ~counter~0 0)} {92059#(<= ~counter~0 0)} #96#return; {92059#(<= ~counter~0 0)} is VALID [2022-04-28 12:33:36,598 INFO L290 TraceCheckUtils]: 16: Hoare triple {92059#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {92059#(<= ~counter~0 0)} is VALID [2022-04-28 12:33:36,599 INFO L290 TraceCheckUtils]: 17: Hoare triple {92059#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {92108#(<= ~counter~0 1)} is VALID [2022-04-28 12:33:36,600 INFO L290 TraceCheckUtils]: 18: Hoare triple {92108#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {92108#(<= ~counter~0 1)} is VALID [2022-04-28 12:33:36,600 INFO L290 TraceCheckUtils]: 19: Hoare triple {92108#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {92108#(<= ~counter~0 1)} is VALID [2022-04-28 12:33:36,601 INFO L290 TraceCheckUtils]: 20: Hoare triple {92108#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {92118#(<= ~counter~0 2)} is VALID [2022-04-28 12:33:36,601 INFO L290 TraceCheckUtils]: 21: Hoare triple {92118#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {92118#(<= ~counter~0 2)} is VALID [2022-04-28 12:33:36,601 INFO L290 TraceCheckUtils]: 22: Hoare triple {92118#(<= ~counter~0 2)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {92118#(<= ~counter~0 2)} is VALID [2022-04-28 12:33:36,602 INFO L290 TraceCheckUtils]: 23: Hoare triple {92118#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {92128#(<= ~counter~0 3)} is VALID [2022-04-28 12:33:36,602 INFO L290 TraceCheckUtils]: 24: Hoare triple {92128#(<= ~counter~0 3)} assume !!(#t~post8 < 10);havoc #t~post8; {92128#(<= ~counter~0 3)} is VALID [2022-04-28 12:33:36,603 INFO L272 TraceCheckUtils]: 25: Hoare triple {92128#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {92128#(<= ~counter~0 3)} is VALID [2022-04-28 12:33:36,603 INFO L290 TraceCheckUtils]: 26: Hoare triple {92128#(<= ~counter~0 3)} ~cond := #in~cond; {92128#(<= ~counter~0 3)} is VALID [2022-04-28 12:33:36,604 INFO L290 TraceCheckUtils]: 27: Hoare triple {92128#(<= ~counter~0 3)} assume !(0 == ~cond); {92128#(<= ~counter~0 3)} is VALID [2022-04-28 12:33:36,604 INFO L290 TraceCheckUtils]: 28: Hoare triple {92128#(<= ~counter~0 3)} assume true; {92128#(<= ~counter~0 3)} is VALID [2022-04-28 12:33:36,605 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {92128#(<= ~counter~0 3)} {92128#(<= ~counter~0 3)} #98#return; {92128#(<= ~counter~0 3)} is VALID [2022-04-28 12:33:36,605 INFO L272 TraceCheckUtils]: 30: Hoare triple {92128#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {92128#(<= ~counter~0 3)} is VALID [2022-04-28 12:33:36,605 INFO L290 TraceCheckUtils]: 31: Hoare triple {92128#(<= ~counter~0 3)} ~cond := #in~cond; {92128#(<= ~counter~0 3)} is VALID [2022-04-28 12:33:36,606 INFO L290 TraceCheckUtils]: 32: Hoare triple {92128#(<= ~counter~0 3)} assume !(0 == ~cond); {92128#(<= ~counter~0 3)} is VALID [2022-04-28 12:33:36,606 INFO L290 TraceCheckUtils]: 33: Hoare triple {92128#(<= ~counter~0 3)} assume true; {92128#(<= ~counter~0 3)} is VALID [2022-04-28 12:33:36,607 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {92128#(<= ~counter~0 3)} {92128#(<= ~counter~0 3)} #100#return; {92128#(<= ~counter~0 3)} is VALID [2022-04-28 12:33:36,607 INFO L272 TraceCheckUtils]: 35: Hoare triple {92128#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {92128#(<= ~counter~0 3)} is VALID [2022-04-28 12:33:36,607 INFO L290 TraceCheckUtils]: 36: Hoare triple {92128#(<= ~counter~0 3)} ~cond := #in~cond; {92128#(<= ~counter~0 3)} is VALID [2022-04-28 12:33:36,608 INFO L290 TraceCheckUtils]: 37: Hoare triple {92128#(<= ~counter~0 3)} assume !(0 == ~cond); {92128#(<= ~counter~0 3)} is VALID [2022-04-28 12:33:36,608 INFO L290 TraceCheckUtils]: 38: Hoare triple {92128#(<= ~counter~0 3)} assume true; {92128#(<= ~counter~0 3)} is VALID [2022-04-28 12:33:36,608 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {92128#(<= ~counter~0 3)} {92128#(<= ~counter~0 3)} #102#return; {92128#(<= ~counter~0 3)} is VALID [2022-04-28 12:33:36,609 INFO L272 TraceCheckUtils]: 40: Hoare triple {92128#(<= ~counter~0 3)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {92128#(<= ~counter~0 3)} is VALID [2022-04-28 12:33:36,609 INFO L290 TraceCheckUtils]: 41: Hoare triple {92128#(<= ~counter~0 3)} ~cond := #in~cond; {92128#(<= ~counter~0 3)} is VALID [2022-04-28 12:33:36,609 INFO L290 TraceCheckUtils]: 42: Hoare triple {92128#(<= ~counter~0 3)} assume !(0 == ~cond); {92128#(<= ~counter~0 3)} is VALID [2022-04-28 12:33:36,610 INFO L290 TraceCheckUtils]: 43: Hoare triple {92128#(<= ~counter~0 3)} assume true; {92128#(<= ~counter~0 3)} is VALID [2022-04-28 12:33:36,610 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {92128#(<= ~counter~0 3)} {92128#(<= ~counter~0 3)} #104#return; {92128#(<= ~counter~0 3)} is VALID [2022-04-28 12:33:36,611 INFO L290 TraceCheckUtils]: 45: Hoare triple {92128#(<= ~counter~0 3)} assume !(~c~0 >= 2 * ~v~0); {92128#(<= ~counter~0 3)} is VALID [2022-04-28 12:33:36,611 INFO L290 TraceCheckUtils]: 46: Hoare triple {92128#(<= ~counter~0 3)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {92128#(<= ~counter~0 3)} is VALID [2022-04-28 12:33:36,612 INFO L290 TraceCheckUtils]: 47: Hoare triple {92128#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {92201#(<= ~counter~0 4)} is VALID [2022-04-28 12:33:36,612 INFO L290 TraceCheckUtils]: 48: Hoare triple {92201#(<= ~counter~0 4)} assume !!(#t~post7 < 10);havoc #t~post7; {92201#(<= ~counter~0 4)} is VALID [2022-04-28 12:33:36,612 INFO L290 TraceCheckUtils]: 49: Hoare triple {92201#(<= ~counter~0 4)} assume !(~c~0 >= ~b~0); {92201#(<= ~counter~0 4)} is VALID [2022-04-28 12:33:36,613 INFO L290 TraceCheckUtils]: 50: Hoare triple {92201#(<= ~counter~0 4)} ~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; {92201#(<= ~counter~0 4)} is VALID [2022-04-28 12:33:36,613 INFO L290 TraceCheckUtils]: 51: Hoare triple {92201#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {92214#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:36,614 INFO L290 TraceCheckUtils]: 52: Hoare triple {92214#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {92214#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:36,614 INFO L290 TraceCheckUtils]: 53: Hoare triple {92214#(<= ~counter~0 5)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {92214#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:36,615 INFO L290 TraceCheckUtils]: 54: Hoare triple {92214#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {92224#(<= ~counter~0 6)} is VALID [2022-04-28 12:33:36,615 INFO L290 TraceCheckUtils]: 55: Hoare triple {92224#(<= ~counter~0 6)} assume !!(#t~post7 < 10);havoc #t~post7; {92224#(<= ~counter~0 6)} is VALID [2022-04-28 12:33:36,615 INFO L290 TraceCheckUtils]: 56: Hoare triple {92224#(<= ~counter~0 6)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {92224#(<= ~counter~0 6)} is VALID [2022-04-28 12:33:36,616 INFO L290 TraceCheckUtils]: 57: Hoare triple {92224#(<= ~counter~0 6)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {92234#(<= ~counter~0 7)} is VALID [2022-04-28 12:33:36,616 INFO L290 TraceCheckUtils]: 58: Hoare triple {92234#(<= ~counter~0 7)} assume !!(#t~post8 < 10);havoc #t~post8; {92234#(<= ~counter~0 7)} is VALID [2022-04-28 12:33:36,617 INFO L272 TraceCheckUtils]: 59: Hoare triple {92234#(<= ~counter~0 7)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {92234#(<= ~counter~0 7)} is VALID [2022-04-28 12:33:36,617 INFO L290 TraceCheckUtils]: 60: Hoare triple {92234#(<= ~counter~0 7)} ~cond := #in~cond; {92234#(<= ~counter~0 7)} is VALID [2022-04-28 12:33:36,618 INFO L290 TraceCheckUtils]: 61: Hoare triple {92234#(<= ~counter~0 7)} assume !(0 == ~cond); {92234#(<= ~counter~0 7)} is VALID [2022-04-28 12:33:36,618 INFO L290 TraceCheckUtils]: 62: Hoare triple {92234#(<= ~counter~0 7)} assume true; {92234#(<= ~counter~0 7)} is VALID [2022-04-28 12:33:36,618 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {92234#(<= ~counter~0 7)} {92234#(<= ~counter~0 7)} #98#return; {92234#(<= ~counter~0 7)} is VALID [2022-04-28 12:33:36,619 INFO L272 TraceCheckUtils]: 64: Hoare triple {92234#(<= ~counter~0 7)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {92234#(<= ~counter~0 7)} is VALID [2022-04-28 12:33:36,619 INFO L290 TraceCheckUtils]: 65: Hoare triple {92234#(<= ~counter~0 7)} ~cond := #in~cond; {92234#(<= ~counter~0 7)} is VALID [2022-04-28 12:33:36,620 INFO L290 TraceCheckUtils]: 66: Hoare triple {92234#(<= ~counter~0 7)} assume !(0 == ~cond); {92234#(<= ~counter~0 7)} is VALID [2022-04-28 12:33:36,620 INFO L290 TraceCheckUtils]: 67: Hoare triple {92234#(<= ~counter~0 7)} assume true; {92234#(<= ~counter~0 7)} is VALID [2022-04-28 12:33:36,620 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {92234#(<= ~counter~0 7)} {92234#(<= ~counter~0 7)} #100#return; {92234#(<= ~counter~0 7)} is VALID [2022-04-28 12:33:36,621 INFO L272 TraceCheckUtils]: 69: Hoare triple {92234#(<= ~counter~0 7)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {92234#(<= ~counter~0 7)} is VALID [2022-04-28 12:33:36,621 INFO L290 TraceCheckUtils]: 70: Hoare triple {92234#(<= ~counter~0 7)} ~cond := #in~cond; {92234#(<= ~counter~0 7)} is VALID [2022-04-28 12:33:36,621 INFO L290 TraceCheckUtils]: 71: Hoare triple {92234#(<= ~counter~0 7)} assume !(0 == ~cond); {92234#(<= ~counter~0 7)} is VALID [2022-04-28 12:33:36,622 INFO L290 TraceCheckUtils]: 72: Hoare triple {92234#(<= ~counter~0 7)} assume true; {92234#(<= ~counter~0 7)} is VALID [2022-04-28 12:33:36,622 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {92234#(<= ~counter~0 7)} {92234#(<= ~counter~0 7)} #102#return; {92234#(<= ~counter~0 7)} is VALID [2022-04-28 12:33:36,623 INFO L272 TraceCheckUtils]: 74: Hoare triple {92234#(<= ~counter~0 7)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {92234#(<= ~counter~0 7)} is VALID [2022-04-28 12:33:36,623 INFO L290 TraceCheckUtils]: 75: Hoare triple {92234#(<= ~counter~0 7)} ~cond := #in~cond; {92234#(<= ~counter~0 7)} is VALID [2022-04-28 12:33:36,623 INFO L290 TraceCheckUtils]: 76: Hoare triple {92234#(<= ~counter~0 7)} assume !(0 == ~cond); {92234#(<= ~counter~0 7)} is VALID [2022-04-28 12:33:36,624 INFO L290 TraceCheckUtils]: 77: Hoare triple {92234#(<= ~counter~0 7)} assume true; {92234#(<= ~counter~0 7)} is VALID [2022-04-28 12:33:36,624 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {92234#(<= ~counter~0 7)} {92234#(<= ~counter~0 7)} #104#return; {92234#(<= ~counter~0 7)} is VALID [2022-04-28 12:33:36,624 INFO L290 TraceCheckUtils]: 79: Hoare triple {92234#(<= ~counter~0 7)} assume !(~c~0 >= 2 * ~v~0); {92234#(<= ~counter~0 7)} is VALID [2022-04-28 12:33:36,625 INFO L290 TraceCheckUtils]: 80: Hoare triple {92234#(<= ~counter~0 7)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {92234#(<= ~counter~0 7)} is VALID [2022-04-28 12:33:36,625 INFO L290 TraceCheckUtils]: 81: Hoare triple {92234#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {92307#(<= ~counter~0 8)} is VALID [2022-04-28 12:33:36,626 INFO L290 TraceCheckUtils]: 82: Hoare triple {92307#(<= ~counter~0 8)} assume !!(#t~post7 < 10);havoc #t~post7; {92307#(<= ~counter~0 8)} is VALID [2022-04-28 12:33:36,626 INFO L290 TraceCheckUtils]: 83: Hoare triple {92307#(<= ~counter~0 8)} assume !(~c~0 >= ~b~0); {92307#(<= ~counter~0 8)} is VALID [2022-04-28 12:33:36,626 INFO L290 TraceCheckUtils]: 84: Hoare triple {92307#(<= ~counter~0 8)} ~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; {92307#(<= ~counter~0 8)} is VALID [2022-04-28 12:33:36,627 INFO L290 TraceCheckUtils]: 85: Hoare triple {92307#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {92320#(<= |main_#t~post6| 8)} is VALID [2022-04-28 12:33:36,627 INFO L290 TraceCheckUtils]: 86: Hoare triple {92320#(<= |main_#t~post6| 8)} assume !(#t~post6 < 10);havoc #t~post6; {92052#false} is VALID [2022-04-28 12:33:36,627 INFO L272 TraceCheckUtils]: 87: Hoare triple {92052#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)); {92052#false} is VALID [2022-04-28 12:33:36,627 INFO L290 TraceCheckUtils]: 88: Hoare triple {92052#false} ~cond := #in~cond; {92052#false} is VALID [2022-04-28 12:33:36,627 INFO L290 TraceCheckUtils]: 89: Hoare triple {92052#false} assume 0 == ~cond; {92052#false} is VALID [2022-04-28 12:33:36,627 INFO L290 TraceCheckUtils]: 90: Hoare triple {92052#false} assume !false; {92052#false} is VALID [2022-04-28 12:33:36,628 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 16 proven. 98 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-28 12:33:36,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:33:37,015 INFO L290 TraceCheckUtils]: 90: Hoare triple {92052#false} assume !false; {92052#false} is VALID [2022-04-28 12:33:37,015 INFO L290 TraceCheckUtils]: 89: Hoare triple {92052#false} assume 0 == ~cond; {92052#false} is VALID [2022-04-28 12:33:37,015 INFO L290 TraceCheckUtils]: 88: Hoare triple {92052#false} ~cond := #in~cond; {92052#false} is VALID [2022-04-28 12:33:37,015 INFO L272 TraceCheckUtils]: 87: Hoare triple {92052#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)); {92052#false} is VALID [2022-04-28 12:33:37,016 INFO L290 TraceCheckUtils]: 86: Hoare triple {92348#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {92052#false} is VALID [2022-04-28 12:33:37,016 INFO L290 TraceCheckUtils]: 85: Hoare triple {92352#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {92348#(< |main_#t~post6| 10)} is VALID [2022-04-28 12:33:37,016 INFO L290 TraceCheckUtils]: 84: Hoare triple {92352#(< ~counter~0 10)} ~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; {92352#(< ~counter~0 10)} is VALID [2022-04-28 12:33:37,016 INFO L290 TraceCheckUtils]: 83: Hoare triple {92352#(< ~counter~0 10)} assume !(~c~0 >= ~b~0); {92352#(< ~counter~0 10)} is VALID [2022-04-28 12:33:37,017 INFO L290 TraceCheckUtils]: 82: Hoare triple {92352#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {92352#(< ~counter~0 10)} is VALID [2022-04-28 12:33:37,018 INFO L290 TraceCheckUtils]: 81: Hoare triple {92307#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {92352#(< ~counter~0 10)} is VALID [2022-04-28 12:33:37,019 INFO L290 TraceCheckUtils]: 80: Hoare triple {92307#(<= ~counter~0 8)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {92307#(<= ~counter~0 8)} is VALID [2022-04-28 12:33:37,019 INFO L290 TraceCheckUtils]: 79: Hoare triple {92307#(<= ~counter~0 8)} assume !(~c~0 >= 2 * ~v~0); {92307#(<= ~counter~0 8)} is VALID [2022-04-28 12:33:37,019 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {92051#true} {92307#(<= ~counter~0 8)} #104#return; {92307#(<= ~counter~0 8)} is VALID [2022-04-28 12:33:37,020 INFO L290 TraceCheckUtils]: 77: Hoare triple {92051#true} assume true; {92051#true} is VALID [2022-04-28 12:33:37,020 INFO L290 TraceCheckUtils]: 76: Hoare triple {92051#true} assume !(0 == ~cond); {92051#true} is VALID [2022-04-28 12:33:37,020 INFO L290 TraceCheckUtils]: 75: Hoare triple {92051#true} ~cond := #in~cond; {92051#true} is VALID [2022-04-28 12:33:37,020 INFO L272 TraceCheckUtils]: 74: Hoare triple {92307#(<= ~counter~0 8)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {92051#true} is VALID [2022-04-28 12:33:37,020 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {92051#true} {92307#(<= ~counter~0 8)} #102#return; {92307#(<= ~counter~0 8)} is VALID [2022-04-28 12:33:37,020 INFO L290 TraceCheckUtils]: 72: Hoare triple {92051#true} assume true; {92051#true} is VALID [2022-04-28 12:33:37,021 INFO L290 TraceCheckUtils]: 71: Hoare triple {92051#true} assume !(0 == ~cond); {92051#true} is VALID [2022-04-28 12:33:37,021 INFO L290 TraceCheckUtils]: 70: Hoare triple {92051#true} ~cond := #in~cond; {92051#true} is VALID [2022-04-28 12:33:37,021 INFO L272 TraceCheckUtils]: 69: Hoare triple {92307#(<= ~counter~0 8)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {92051#true} is VALID [2022-04-28 12:33:37,021 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {92051#true} {92307#(<= ~counter~0 8)} #100#return; {92307#(<= ~counter~0 8)} is VALID [2022-04-28 12:33:37,021 INFO L290 TraceCheckUtils]: 67: Hoare triple {92051#true} assume true; {92051#true} is VALID [2022-04-28 12:33:37,021 INFO L290 TraceCheckUtils]: 66: Hoare triple {92051#true} assume !(0 == ~cond); {92051#true} is VALID [2022-04-28 12:33:37,022 INFO L290 TraceCheckUtils]: 65: Hoare triple {92051#true} ~cond := #in~cond; {92051#true} is VALID [2022-04-28 12:33:37,022 INFO L272 TraceCheckUtils]: 64: Hoare triple {92307#(<= ~counter~0 8)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {92051#true} is VALID [2022-04-28 12:33:37,022 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {92051#true} {92307#(<= ~counter~0 8)} #98#return; {92307#(<= ~counter~0 8)} is VALID [2022-04-28 12:33:37,022 INFO L290 TraceCheckUtils]: 62: Hoare triple {92051#true} assume true; {92051#true} is VALID [2022-04-28 12:33:37,022 INFO L290 TraceCheckUtils]: 61: Hoare triple {92051#true} assume !(0 == ~cond); {92051#true} is VALID [2022-04-28 12:33:37,022 INFO L290 TraceCheckUtils]: 60: Hoare triple {92051#true} ~cond := #in~cond; {92051#true} is VALID [2022-04-28 12:33:37,023 INFO L272 TraceCheckUtils]: 59: Hoare triple {92307#(<= ~counter~0 8)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {92051#true} is VALID [2022-04-28 12:33:37,023 INFO L290 TraceCheckUtils]: 58: Hoare triple {92307#(<= ~counter~0 8)} assume !!(#t~post8 < 10);havoc #t~post8; {92307#(<= ~counter~0 8)} is VALID [2022-04-28 12:33:37,024 INFO L290 TraceCheckUtils]: 57: Hoare triple {92234#(<= ~counter~0 7)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {92307#(<= ~counter~0 8)} is VALID [2022-04-28 12:33:37,024 INFO L290 TraceCheckUtils]: 56: Hoare triple {92234#(<= ~counter~0 7)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {92234#(<= ~counter~0 7)} is VALID [2022-04-28 12:33:37,024 INFO L290 TraceCheckUtils]: 55: Hoare triple {92234#(<= ~counter~0 7)} assume !!(#t~post7 < 10);havoc #t~post7; {92234#(<= ~counter~0 7)} is VALID [2022-04-28 12:33:37,025 INFO L290 TraceCheckUtils]: 54: Hoare triple {92224#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {92234#(<= ~counter~0 7)} is VALID [2022-04-28 12:33:37,025 INFO L290 TraceCheckUtils]: 53: Hoare triple {92224#(<= ~counter~0 6)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {92224#(<= ~counter~0 6)} is VALID [2022-04-28 12:33:37,026 INFO L290 TraceCheckUtils]: 52: Hoare triple {92224#(<= ~counter~0 6)} assume !!(#t~post6 < 10);havoc #t~post6; {92224#(<= ~counter~0 6)} is VALID [2022-04-28 12:33:37,026 INFO L290 TraceCheckUtils]: 51: Hoare triple {92214#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {92224#(<= ~counter~0 6)} is VALID [2022-04-28 12:33:37,027 INFO L290 TraceCheckUtils]: 50: Hoare triple {92214#(<= ~counter~0 5)} ~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; {92214#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:37,027 INFO L290 TraceCheckUtils]: 49: Hoare triple {92214#(<= ~counter~0 5)} assume !(~c~0 >= ~b~0); {92214#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:37,027 INFO L290 TraceCheckUtils]: 48: Hoare triple {92214#(<= ~counter~0 5)} assume !!(#t~post7 < 10);havoc #t~post7; {92214#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:37,028 INFO L290 TraceCheckUtils]: 47: Hoare triple {92201#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {92214#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:37,028 INFO L290 TraceCheckUtils]: 46: Hoare triple {92201#(<= ~counter~0 4)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {92201#(<= ~counter~0 4)} is VALID [2022-04-28 12:33:37,029 INFO L290 TraceCheckUtils]: 45: Hoare triple {92201#(<= ~counter~0 4)} assume !(~c~0 >= 2 * ~v~0); {92201#(<= ~counter~0 4)} is VALID [2022-04-28 12:33:37,029 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {92051#true} {92201#(<= ~counter~0 4)} #104#return; {92201#(<= ~counter~0 4)} is VALID [2022-04-28 12:33:37,029 INFO L290 TraceCheckUtils]: 43: Hoare triple {92051#true} assume true; {92051#true} is VALID [2022-04-28 12:33:37,029 INFO L290 TraceCheckUtils]: 42: Hoare triple {92051#true} assume !(0 == ~cond); {92051#true} is VALID [2022-04-28 12:33:37,029 INFO L290 TraceCheckUtils]: 41: Hoare triple {92051#true} ~cond := #in~cond; {92051#true} is VALID [2022-04-28 12:33:37,029 INFO L272 TraceCheckUtils]: 40: Hoare triple {92201#(<= ~counter~0 4)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {92051#true} is VALID [2022-04-28 12:33:37,030 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {92051#true} {92201#(<= ~counter~0 4)} #102#return; {92201#(<= ~counter~0 4)} is VALID [2022-04-28 12:33:37,030 INFO L290 TraceCheckUtils]: 38: Hoare triple {92051#true} assume true; {92051#true} is VALID [2022-04-28 12:33:37,030 INFO L290 TraceCheckUtils]: 37: Hoare triple {92051#true} assume !(0 == ~cond); {92051#true} is VALID [2022-04-28 12:33:37,030 INFO L290 TraceCheckUtils]: 36: Hoare triple {92051#true} ~cond := #in~cond; {92051#true} is VALID [2022-04-28 12:33:37,030 INFO L272 TraceCheckUtils]: 35: Hoare triple {92201#(<= ~counter~0 4)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {92051#true} is VALID [2022-04-28 12:33:37,031 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {92051#true} {92201#(<= ~counter~0 4)} #100#return; {92201#(<= ~counter~0 4)} is VALID [2022-04-28 12:33:37,031 INFO L290 TraceCheckUtils]: 33: Hoare triple {92051#true} assume true; {92051#true} is VALID [2022-04-28 12:33:37,031 INFO L290 TraceCheckUtils]: 32: Hoare triple {92051#true} assume !(0 == ~cond); {92051#true} is VALID [2022-04-28 12:33:37,031 INFO L290 TraceCheckUtils]: 31: Hoare triple {92051#true} ~cond := #in~cond; {92051#true} is VALID [2022-04-28 12:33:37,031 INFO L272 TraceCheckUtils]: 30: Hoare triple {92201#(<= ~counter~0 4)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {92051#true} is VALID [2022-04-28 12:33:37,032 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {92051#true} {92201#(<= ~counter~0 4)} #98#return; {92201#(<= ~counter~0 4)} is VALID [2022-04-28 12:33:37,032 INFO L290 TraceCheckUtils]: 28: Hoare triple {92051#true} assume true; {92051#true} is VALID [2022-04-28 12:33:37,032 INFO L290 TraceCheckUtils]: 27: Hoare triple {92051#true} assume !(0 == ~cond); {92051#true} is VALID [2022-04-28 12:33:37,032 INFO L290 TraceCheckUtils]: 26: Hoare triple {92051#true} ~cond := #in~cond; {92051#true} is VALID [2022-04-28 12:33:37,032 INFO L272 TraceCheckUtils]: 25: Hoare triple {92201#(<= ~counter~0 4)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {92051#true} is VALID [2022-04-28 12:33:37,032 INFO L290 TraceCheckUtils]: 24: Hoare triple {92201#(<= ~counter~0 4)} assume !!(#t~post8 < 10);havoc #t~post8; {92201#(<= ~counter~0 4)} is VALID [2022-04-28 12:33:37,033 INFO L290 TraceCheckUtils]: 23: Hoare triple {92128#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {92201#(<= ~counter~0 4)} is VALID [2022-04-28 12:33:37,034 INFO L290 TraceCheckUtils]: 22: Hoare triple {92128#(<= ~counter~0 3)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {92128#(<= ~counter~0 3)} is VALID [2022-04-28 12:33:37,034 INFO L290 TraceCheckUtils]: 21: Hoare triple {92128#(<= ~counter~0 3)} assume !!(#t~post7 < 10);havoc #t~post7; {92128#(<= ~counter~0 3)} is VALID [2022-04-28 12:33:37,035 INFO L290 TraceCheckUtils]: 20: Hoare triple {92118#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {92128#(<= ~counter~0 3)} is VALID [2022-04-28 12:33:37,035 INFO L290 TraceCheckUtils]: 19: Hoare triple {92118#(<= ~counter~0 2)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {92118#(<= ~counter~0 2)} is VALID [2022-04-28 12:33:37,035 INFO L290 TraceCheckUtils]: 18: Hoare triple {92118#(<= ~counter~0 2)} assume !!(#t~post6 < 10);havoc #t~post6; {92118#(<= ~counter~0 2)} is VALID [2022-04-28 12:33:37,036 INFO L290 TraceCheckUtils]: 17: Hoare triple {92108#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {92118#(<= ~counter~0 2)} is VALID [2022-04-28 12:33:37,036 INFO L290 TraceCheckUtils]: 16: Hoare triple {92108#(<= ~counter~0 1)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {92108#(<= ~counter~0 1)} is VALID [2022-04-28 12:33:37,037 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {92051#true} {92108#(<= ~counter~0 1)} #96#return; {92108#(<= ~counter~0 1)} is VALID [2022-04-28 12:33:37,037 INFO L290 TraceCheckUtils]: 14: Hoare triple {92051#true} assume true; {92051#true} is VALID [2022-04-28 12:33:37,037 INFO L290 TraceCheckUtils]: 13: Hoare triple {92051#true} assume !(0 == ~cond); {92051#true} is VALID [2022-04-28 12:33:37,037 INFO L290 TraceCheckUtils]: 12: Hoare triple {92051#true} ~cond := #in~cond; {92051#true} is VALID [2022-04-28 12:33:37,037 INFO L272 TraceCheckUtils]: 11: Hoare triple {92108#(<= ~counter~0 1)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {92051#true} is VALID [2022-04-28 12:33:37,038 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {92051#true} {92108#(<= ~counter~0 1)} #94#return; {92108#(<= ~counter~0 1)} is VALID [2022-04-28 12:33:37,038 INFO L290 TraceCheckUtils]: 9: Hoare triple {92051#true} assume true; {92051#true} is VALID [2022-04-28 12:33:37,038 INFO L290 TraceCheckUtils]: 8: Hoare triple {92051#true} assume !(0 == ~cond); {92051#true} is VALID [2022-04-28 12:33:37,038 INFO L290 TraceCheckUtils]: 7: Hoare triple {92051#true} ~cond := #in~cond; {92051#true} is VALID [2022-04-28 12:33:37,038 INFO L272 TraceCheckUtils]: 6: Hoare triple {92108#(<= ~counter~0 1)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {92051#true} is VALID [2022-04-28 12:33:37,038 INFO L290 TraceCheckUtils]: 5: Hoare triple {92108#(<= ~counter~0 1)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {92108#(<= ~counter~0 1)} is VALID [2022-04-28 12:33:37,039 INFO L272 TraceCheckUtils]: 4: Hoare triple {92108#(<= ~counter~0 1)} call #t~ret9 := main(); {92108#(<= ~counter~0 1)} is VALID [2022-04-28 12:33:37,039 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {92108#(<= ~counter~0 1)} {92051#true} #108#return; {92108#(<= ~counter~0 1)} is VALID [2022-04-28 12:33:37,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {92108#(<= ~counter~0 1)} assume true; {92108#(<= ~counter~0 1)} is VALID [2022-04-28 12:33:37,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {92051#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);~counter~0 := 0; {92108#(<= ~counter~0 1)} is VALID [2022-04-28 12:33:37,040 INFO L272 TraceCheckUtils]: 0: Hoare triple {92051#true} call ULTIMATE.init(); {92051#true} is VALID [2022-04-28 12:33:37,040 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 16 proven. 34 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-28 12:33:37,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:33:37,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078435989] [2022-04-28 12:33:37,041 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:33:37,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285878088] [2022-04-28 12:33:37,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285878088] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:33:37,041 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:33:37,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2022-04-28 12:33:37,041 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:33:37,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [461964201] [2022-04-28 12:33:37,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [461964201] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:33:37,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:33:37,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 12:33:37,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651557392] [2022-04-28 12:33:37,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:33:37,042 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 5 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 91 [2022-04-28 12:33:37,042 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:33:37,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 5 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 12:33:37,111 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:33:37,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 12:33:37,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:33:37,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 12:33:37,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 12:33:37,112 INFO L87 Difference]: Start difference. First operand 1023 states and 1372 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 5 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 12:33:40,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:33:40,604 INFO L93 Difference]: Finished difference Result 1058 states and 1407 transitions. [2022-04-28 12:33:40,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 12:33:40,604 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 5 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 91 [2022-04-28 12:33:40,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:33:40,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 5 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 12:33:40,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 208 transitions. [2022-04-28 12:33:40,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 5 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 12:33:40,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 208 transitions. [2022-04-28 12:33:40,607 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 208 transitions. [2022-04-28 12:33:40,795 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 208 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:33:40,843 INFO L225 Difference]: With dead ends: 1058 [2022-04-28 12:33:40,844 INFO L226 Difference]: Without dead ends: 1051 [2022-04-28 12:33:40,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=140, Invalid=240, Unknown=0, NotChecked=0, Total=380 [2022-04-28 12:33:40,844 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 152 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 12:33:40,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 287 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 12:33:40,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2022-04-28 12:33:43,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 1034. [2022-04-28 12:33:43,524 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:33:43,526 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1051 states. Second operand has 1034 states, 731 states have (on average 1.2708618331053352) internal successors, (929), 742 states have internal predecessors, (929), 229 states have call successors, (229), 74 states have call predecessors, (229), 73 states have return successors, (225), 217 states have call predecessors, (225), 225 states have call successors, (225) [2022-04-28 12:33:43,526 INFO L74 IsIncluded]: Start isIncluded. First operand 1051 states. Second operand has 1034 states, 731 states have (on average 1.2708618331053352) internal successors, (929), 742 states have internal predecessors, (929), 229 states have call successors, (229), 74 states have call predecessors, (229), 73 states have return successors, (225), 217 states have call predecessors, (225), 225 states have call successors, (225) [2022-04-28 12:33:43,527 INFO L87 Difference]: Start difference. First operand 1051 states. Second operand has 1034 states, 731 states have (on average 1.2708618331053352) internal successors, (929), 742 states have internal predecessors, (929), 229 states have call successors, (229), 74 states have call predecessors, (229), 73 states have return successors, (225), 217 states have call predecessors, (225), 225 states have call successors, (225) [2022-04-28 12:33:43,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:33:43,577 INFO L93 Difference]: Finished difference Result 1051 states and 1398 transitions. [2022-04-28 12:33:43,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1398 transitions. [2022-04-28 12:33:43,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:33:43,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:33:43,581 INFO L74 IsIncluded]: Start isIncluded. First operand has 1034 states, 731 states have (on average 1.2708618331053352) internal successors, (929), 742 states have internal predecessors, (929), 229 states have call successors, (229), 74 states have call predecessors, (229), 73 states have return successors, (225), 217 states have call predecessors, (225), 225 states have call successors, (225) Second operand 1051 states. [2022-04-28 12:33:43,582 INFO L87 Difference]: Start difference. First operand has 1034 states, 731 states have (on average 1.2708618331053352) internal successors, (929), 742 states have internal predecessors, (929), 229 states have call successors, (229), 74 states have call predecessors, (229), 73 states have return successors, (225), 217 states have call predecessors, (225), 225 states have call successors, (225) Second operand 1051 states. [2022-04-28 12:33:43,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:33:43,632 INFO L93 Difference]: Finished difference Result 1051 states and 1398 transitions. [2022-04-28 12:33:43,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1398 transitions. [2022-04-28 12:33:43,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:33:43,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:33:43,635 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:33:43,635 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:33:43,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 731 states have (on average 1.2708618331053352) internal successors, (929), 742 states have internal predecessors, (929), 229 states have call successors, (229), 74 states have call predecessors, (229), 73 states have return successors, (225), 217 states have call predecessors, (225), 225 states have call successors, (225) [2022-04-28 12:33:43,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1383 transitions. [2022-04-28 12:33:43,709 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1383 transitions. Word has length 91 [2022-04-28 12:33:43,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:33:43,709 INFO L495 AbstractCegarLoop]: Abstraction has 1034 states and 1383 transitions. [2022-04-28 12:33:43,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 5 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 12:33:43,710 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1034 states and 1383 transitions. [2022-04-28 12:33:46,910 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1383 edges. 1383 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:33:46,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1383 transitions. [2022-04-28 12:33:46,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-28 12:33:46,911 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:33:46,911 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:33:46,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-04-28 12:33:47,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:33:47,116 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:33:47,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:33:47,116 INFO L85 PathProgramCache]: Analyzing trace with hash -554609469, now seen corresponding path program 1 times [2022-04-28 12:33:47,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:33:47,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [196684764] [2022-04-28 12:33:47,117 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:33:47,117 INFO L85 PathProgramCache]: Analyzing trace with hash -554609469, now seen corresponding path program 2 times [2022-04-28 12:33:47,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:33:47,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892376208] [2022-04-28 12:33:47,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:33:47,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:33:47,128 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:33:47,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1923242492] [2022-04-28 12:33:47,129 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:33:47,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:33:47,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:33:47,130 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:33:47,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-04-28 12:33:47,189 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:33:47,189 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:33:47,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 12:33:47,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:33:47,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:33:47,651 INFO L272 TraceCheckUtils]: 0: Hoare triple {98908#true} call ULTIMATE.init(); {98908#true} is VALID [2022-04-28 12:33:47,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {98908#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);~counter~0 := 0; {98916#(<= ~counter~0 0)} is VALID [2022-04-28 12:33:47,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {98916#(<= ~counter~0 0)} assume true; {98916#(<= ~counter~0 0)} is VALID [2022-04-28 12:33:47,653 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {98916#(<= ~counter~0 0)} {98908#true} #108#return; {98916#(<= ~counter~0 0)} is VALID [2022-04-28 12:33:47,653 INFO L272 TraceCheckUtils]: 4: Hoare triple {98916#(<= ~counter~0 0)} call #t~ret9 := main(); {98916#(<= ~counter~0 0)} is VALID [2022-04-28 12:33:47,653 INFO L290 TraceCheckUtils]: 5: Hoare triple {98916#(<= ~counter~0 0)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {98916#(<= ~counter~0 0)} is VALID [2022-04-28 12:33:47,654 INFO L272 TraceCheckUtils]: 6: Hoare triple {98916#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {98916#(<= ~counter~0 0)} is VALID [2022-04-28 12:33:47,654 INFO L290 TraceCheckUtils]: 7: Hoare triple {98916#(<= ~counter~0 0)} ~cond := #in~cond; {98916#(<= ~counter~0 0)} is VALID [2022-04-28 12:33:47,654 INFO L290 TraceCheckUtils]: 8: Hoare triple {98916#(<= ~counter~0 0)} assume !(0 == ~cond); {98916#(<= ~counter~0 0)} is VALID [2022-04-28 12:33:47,655 INFO L290 TraceCheckUtils]: 9: Hoare triple {98916#(<= ~counter~0 0)} assume true; {98916#(<= ~counter~0 0)} is VALID [2022-04-28 12:33:47,655 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {98916#(<= ~counter~0 0)} {98916#(<= ~counter~0 0)} #94#return; {98916#(<= ~counter~0 0)} is VALID [2022-04-28 12:33:47,655 INFO L272 TraceCheckUtils]: 11: Hoare triple {98916#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {98916#(<= ~counter~0 0)} is VALID [2022-04-28 12:33:47,656 INFO L290 TraceCheckUtils]: 12: Hoare triple {98916#(<= ~counter~0 0)} ~cond := #in~cond; {98916#(<= ~counter~0 0)} is VALID [2022-04-28 12:33:47,656 INFO L290 TraceCheckUtils]: 13: Hoare triple {98916#(<= ~counter~0 0)} assume !(0 == ~cond); {98916#(<= ~counter~0 0)} is VALID [2022-04-28 12:33:47,656 INFO L290 TraceCheckUtils]: 14: Hoare triple {98916#(<= ~counter~0 0)} assume true; {98916#(<= ~counter~0 0)} is VALID [2022-04-28 12:33:47,657 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {98916#(<= ~counter~0 0)} {98916#(<= ~counter~0 0)} #96#return; {98916#(<= ~counter~0 0)} is VALID [2022-04-28 12:33:47,657 INFO L290 TraceCheckUtils]: 16: Hoare triple {98916#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {98916#(<= ~counter~0 0)} is VALID [2022-04-28 12:33:47,659 INFO L290 TraceCheckUtils]: 17: Hoare triple {98916#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {98965#(<= ~counter~0 1)} is VALID [2022-04-28 12:33:47,659 INFO L290 TraceCheckUtils]: 18: Hoare triple {98965#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {98965#(<= ~counter~0 1)} is VALID [2022-04-28 12:33:47,659 INFO L290 TraceCheckUtils]: 19: Hoare triple {98965#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {98965#(<= ~counter~0 1)} is VALID [2022-04-28 12:33:47,660 INFO L290 TraceCheckUtils]: 20: Hoare triple {98965#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {98975#(<= ~counter~0 2)} is VALID [2022-04-28 12:33:47,661 INFO L290 TraceCheckUtils]: 21: Hoare triple {98975#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {98975#(<= ~counter~0 2)} is VALID [2022-04-28 12:33:47,661 INFO L290 TraceCheckUtils]: 22: Hoare triple {98975#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {98975#(<= ~counter~0 2)} is VALID [2022-04-28 12:33:47,661 INFO L290 TraceCheckUtils]: 23: Hoare triple {98975#(<= ~counter~0 2)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {98975#(<= ~counter~0 2)} is VALID [2022-04-28 12:33:47,663 INFO L290 TraceCheckUtils]: 24: Hoare triple {98975#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {98988#(<= ~counter~0 3)} is VALID [2022-04-28 12:33:47,663 INFO L290 TraceCheckUtils]: 25: Hoare triple {98988#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {98988#(<= ~counter~0 3)} is VALID [2022-04-28 12:33:47,663 INFO L290 TraceCheckUtils]: 26: Hoare triple {98988#(<= ~counter~0 3)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {98988#(<= ~counter~0 3)} is VALID [2022-04-28 12:33:47,664 INFO L290 TraceCheckUtils]: 27: Hoare triple {98988#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {98998#(<= ~counter~0 4)} is VALID [2022-04-28 12:33:47,664 INFO L290 TraceCheckUtils]: 28: Hoare triple {98998#(<= ~counter~0 4)} assume !!(#t~post7 < 10);havoc #t~post7; {98998#(<= ~counter~0 4)} is VALID [2022-04-28 12:33:47,665 INFO L290 TraceCheckUtils]: 29: Hoare triple {98998#(<= ~counter~0 4)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {98998#(<= ~counter~0 4)} is VALID [2022-04-28 12:33:47,665 INFO L290 TraceCheckUtils]: 30: Hoare triple {98998#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {99008#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:47,666 INFO L290 TraceCheckUtils]: 31: Hoare triple {99008#(<= ~counter~0 5)} assume !!(#t~post8 < 10);havoc #t~post8; {99008#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:47,667 INFO L272 TraceCheckUtils]: 32: Hoare triple {99008#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {99008#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:47,667 INFO L290 TraceCheckUtils]: 33: Hoare triple {99008#(<= ~counter~0 5)} ~cond := #in~cond; {99008#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:47,668 INFO L290 TraceCheckUtils]: 34: Hoare triple {99008#(<= ~counter~0 5)} assume !(0 == ~cond); {99008#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:47,668 INFO L290 TraceCheckUtils]: 35: Hoare triple {99008#(<= ~counter~0 5)} assume true; {99008#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:47,669 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {99008#(<= ~counter~0 5)} {99008#(<= ~counter~0 5)} #98#return; {99008#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:47,670 INFO L272 TraceCheckUtils]: 37: Hoare triple {99008#(<= ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {99008#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:47,670 INFO L290 TraceCheckUtils]: 38: Hoare triple {99008#(<= ~counter~0 5)} ~cond := #in~cond; {99008#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:47,670 INFO L290 TraceCheckUtils]: 39: Hoare triple {99008#(<= ~counter~0 5)} assume !(0 == ~cond); {99008#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:47,671 INFO L290 TraceCheckUtils]: 40: Hoare triple {99008#(<= ~counter~0 5)} assume true; {99008#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:47,671 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {99008#(<= ~counter~0 5)} {99008#(<= ~counter~0 5)} #100#return; {99008#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:47,672 INFO L272 TraceCheckUtils]: 42: Hoare triple {99008#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {99008#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:47,672 INFO L290 TraceCheckUtils]: 43: Hoare triple {99008#(<= ~counter~0 5)} ~cond := #in~cond; {99008#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:47,672 INFO L290 TraceCheckUtils]: 44: Hoare triple {99008#(<= ~counter~0 5)} assume !(0 == ~cond); {99008#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:47,672 INFO L290 TraceCheckUtils]: 45: Hoare triple {99008#(<= ~counter~0 5)} assume true; {99008#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:47,673 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {99008#(<= ~counter~0 5)} {99008#(<= ~counter~0 5)} #102#return; {99008#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:47,673 INFO L272 TraceCheckUtils]: 47: Hoare triple {99008#(<= ~counter~0 5)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {99008#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:47,674 INFO L290 TraceCheckUtils]: 48: Hoare triple {99008#(<= ~counter~0 5)} ~cond := #in~cond; {99008#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:47,674 INFO L290 TraceCheckUtils]: 49: Hoare triple {99008#(<= ~counter~0 5)} assume !(0 == ~cond); {99008#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:47,674 INFO L290 TraceCheckUtils]: 50: Hoare triple {99008#(<= ~counter~0 5)} assume true; {99008#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:47,675 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {99008#(<= ~counter~0 5)} {99008#(<= ~counter~0 5)} #104#return; {99008#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:47,675 INFO L290 TraceCheckUtils]: 52: Hoare triple {99008#(<= ~counter~0 5)} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {99008#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:47,677 INFO L290 TraceCheckUtils]: 53: Hoare triple {99008#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {99078#(<= ~counter~0 6)} is VALID [2022-04-28 12:33:47,677 INFO L290 TraceCheckUtils]: 54: Hoare triple {99078#(<= ~counter~0 6)} assume !!(#t~post8 < 10);havoc #t~post8; {99078#(<= ~counter~0 6)} is VALID [2022-04-28 12:33:47,678 INFO L272 TraceCheckUtils]: 55: Hoare triple {99078#(<= ~counter~0 6)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {99078#(<= ~counter~0 6)} is VALID [2022-04-28 12:33:47,678 INFO L290 TraceCheckUtils]: 56: Hoare triple {99078#(<= ~counter~0 6)} ~cond := #in~cond; {99078#(<= ~counter~0 6)} is VALID [2022-04-28 12:33:47,678 INFO L290 TraceCheckUtils]: 57: Hoare triple {99078#(<= ~counter~0 6)} assume !(0 == ~cond); {99078#(<= ~counter~0 6)} is VALID [2022-04-28 12:33:47,678 INFO L290 TraceCheckUtils]: 58: Hoare triple {99078#(<= ~counter~0 6)} assume true; {99078#(<= ~counter~0 6)} is VALID [2022-04-28 12:33:47,679 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {99078#(<= ~counter~0 6)} {99078#(<= ~counter~0 6)} #98#return; {99078#(<= ~counter~0 6)} is VALID [2022-04-28 12:33:47,680 INFO L272 TraceCheckUtils]: 60: Hoare triple {99078#(<= ~counter~0 6)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {99078#(<= ~counter~0 6)} is VALID [2022-04-28 12:33:47,680 INFO L290 TraceCheckUtils]: 61: Hoare triple {99078#(<= ~counter~0 6)} ~cond := #in~cond; {99078#(<= ~counter~0 6)} is VALID [2022-04-28 12:33:47,680 INFO L290 TraceCheckUtils]: 62: Hoare triple {99078#(<= ~counter~0 6)} assume !(0 == ~cond); {99078#(<= ~counter~0 6)} is VALID [2022-04-28 12:33:47,680 INFO L290 TraceCheckUtils]: 63: Hoare triple {99078#(<= ~counter~0 6)} assume true; {99078#(<= ~counter~0 6)} is VALID [2022-04-28 12:33:47,681 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {99078#(<= ~counter~0 6)} {99078#(<= ~counter~0 6)} #100#return; {99078#(<= ~counter~0 6)} is VALID [2022-04-28 12:33:47,682 INFO L272 TraceCheckUtils]: 65: Hoare triple {99078#(<= ~counter~0 6)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {99078#(<= ~counter~0 6)} is VALID [2022-04-28 12:33:47,682 INFO L290 TraceCheckUtils]: 66: Hoare triple {99078#(<= ~counter~0 6)} ~cond := #in~cond; {99078#(<= ~counter~0 6)} is VALID [2022-04-28 12:33:47,682 INFO L290 TraceCheckUtils]: 67: Hoare triple {99078#(<= ~counter~0 6)} assume !(0 == ~cond); {99078#(<= ~counter~0 6)} is VALID [2022-04-28 12:33:47,682 INFO L290 TraceCheckUtils]: 68: Hoare triple {99078#(<= ~counter~0 6)} assume true; {99078#(<= ~counter~0 6)} is VALID [2022-04-28 12:33:47,683 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {99078#(<= ~counter~0 6)} {99078#(<= ~counter~0 6)} #102#return; {99078#(<= ~counter~0 6)} is VALID [2022-04-28 12:33:47,683 INFO L272 TraceCheckUtils]: 70: Hoare triple {99078#(<= ~counter~0 6)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {99078#(<= ~counter~0 6)} is VALID [2022-04-28 12:33:47,684 INFO L290 TraceCheckUtils]: 71: Hoare triple {99078#(<= ~counter~0 6)} ~cond := #in~cond; {99078#(<= ~counter~0 6)} is VALID [2022-04-28 12:33:47,684 INFO L290 TraceCheckUtils]: 72: Hoare triple {99078#(<= ~counter~0 6)} assume !(0 == ~cond); {99078#(<= ~counter~0 6)} is VALID [2022-04-28 12:33:47,684 INFO L290 TraceCheckUtils]: 73: Hoare triple {99078#(<= ~counter~0 6)} assume true; {99078#(<= ~counter~0 6)} is VALID [2022-04-28 12:33:47,685 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {99078#(<= ~counter~0 6)} {99078#(<= ~counter~0 6)} #104#return; {99078#(<= ~counter~0 6)} is VALID [2022-04-28 12:33:47,685 INFO L290 TraceCheckUtils]: 75: Hoare triple {99078#(<= ~counter~0 6)} assume !(~c~0 >= 2 * ~v~0); {99078#(<= ~counter~0 6)} is VALID [2022-04-28 12:33:47,685 INFO L290 TraceCheckUtils]: 76: Hoare triple {99078#(<= ~counter~0 6)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {99078#(<= ~counter~0 6)} is VALID [2022-04-28 12:33:47,686 INFO L290 TraceCheckUtils]: 77: Hoare triple {99078#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99151#(<= ~counter~0 7)} is VALID [2022-04-28 12:33:47,687 INFO L290 TraceCheckUtils]: 78: Hoare triple {99151#(<= ~counter~0 7)} assume !!(#t~post7 < 10);havoc #t~post7; {99151#(<= ~counter~0 7)} is VALID [2022-04-28 12:33:47,687 INFO L290 TraceCheckUtils]: 79: Hoare triple {99151#(<= ~counter~0 7)} assume !(~c~0 >= ~b~0); {99151#(<= ~counter~0 7)} is VALID [2022-04-28 12:33:47,687 INFO L290 TraceCheckUtils]: 80: Hoare triple {99151#(<= ~counter~0 7)} ~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; {99151#(<= ~counter~0 7)} is VALID [2022-04-28 12:33:47,688 INFO L290 TraceCheckUtils]: 81: Hoare triple {99151#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {99164#(<= ~counter~0 8)} is VALID [2022-04-28 12:33:47,688 INFO L290 TraceCheckUtils]: 82: Hoare triple {99164#(<= ~counter~0 8)} assume !!(#t~post6 < 10);havoc #t~post6; {99164#(<= ~counter~0 8)} is VALID [2022-04-28 12:33:47,689 INFO L290 TraceCheckUtils]: 83: Hoare triple {99164#(<= ~counter~0 8)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {99164#(<= ~counter~0 8)} is VALID [2022-04-28 12:33:47,689 INFO L290 TraceCheckUtils]: 84: Hoare triple {99164#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99174#(<= |main_#t~post7| 8)} is VALID [2022-04-28 12:33:47,689 INFO L290 TraceCheckUtils]: 85: Hoare triple {99174#(<= |main_#t~post7| 8)} assume !(#t~post7 < 10);havoc #t~post7; {98909#false} is VALID [2022-04-28 12:33:47,690 INFO L290 TraceCheckUtils]: 86: Hoare triple {98909#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; {98909#false} is VALID [2022-04-28 12:33:47,690 INFO L290 TraceCheckUtils]: 87: Hoare triple {98909#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {98909#false} is VALID [2022-04-28 12:33:47,690 INFO L290 TraceCheckUtils]: 88: Hoare triple {98909#false} assume !(#t~post6 < 10);havoc #t~post6; {98909#false} is VALID [2022-04-28 12:33:47,690 INFO L272 TraceCheckUtils]: 89: Hoare triple {98909#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)); {98909#false} is VALID [2022-04-28 12:33:47,690 INFO L290 TraceCheckUtils]: 90: Hoare triple {98909#false} ~cond := #in~cond; {98909#false} is VALID [2022-04-28 12:33:47,690 INFO L290 TraceCheckUtils]: 91: Hoare triple {98909#false} assume 0 == ~cond; {98909#false} is VALID [2022-04-28 12:33:47,690 INFO L290 TraceCheckUtils]: 92: Hoare triple {98909#false} assume !false; {98909#false} is VALID [2022-04-28 12:33:47,690 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 24 proven. 96 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-28 12:33:47,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:33:48,130 INFO L290 TraceCheckUtils]: 92: Hoare triple {98909#false} assume !false; {98909#false} is VALID [2022-04-28 12:33:48,130 INFO L290 TraceCheckUtils]: 91: Hoare triple {98909#false} assume 0 == ~cond; {98909#false} is VALID [2022-04-28 12:33:48,130 INFO L290 TraceCheckUtils]: 90: Hoare triple {98909#false} ~cond := #in~cond; {98909#false} is VALID [2022-04-28 12:33:48,130 INFO L272 TraceCheckUtils]: 89: Hoare triple {98909#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)); {98909#false} is VALID [2022-04-28 12:33:48,131 INFO L290 TraceCheckUtils]: 88: Hoare triple {98909#false} assume !(#t~post6 < 10);havoc #t~post6; {98909#false} is VALID [2022-04-28 12:33:48,131 INFO L290 TraceCheckUtils]: 87: Hoare triple {98909#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {98909#false} is VALID [2022-04-28 12:33:48,131 INFO L290 TraceCheckUtils]: 86: Hoare triple {98909#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; {98909#false} is VALID [2022-04-28 12:33:48,131 INFO L290 TraceCheckUtils]: 85: Hoare triple {99220#(< |main_#t~post7| 10)} assume !(#t~post7 < 10);havoc #t~post7; {98909#false} is VALID [2022-04-28 12:33:48,132 INFO L290 TraceCheckUtils]: 84: Hoare triple {99224#(< ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99220#(< |main_#t~post7| 10)} is VALID [2022-04-28 12:33:48,132 INFO L290 TraceCheckUtils]: 83: Hoare triple {99224#(< ~counter~0 10)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {99224#(< ~counter~0 10)} is VALID [2022-04-28 12:33:48,132 INFO L290 TraceCheckUtils]: 82: Hoare triple {99224#(< ~counter~0 10)} assume !!(#t~post6 < 10);havoc #t~post6; {99224#(< ~counter~0 10)} is VALID [2022-04-28 12:33:48,134 INFO L290 TraceCheckUtils]: 81: Hoare triple {99164#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {99224#(< ~counter~0 10)} is VALID [2022-04-28 12:33:48,135 INFO L290 TraceCheckUtils]: 80: Hoare triple {99164#(<= ~counter~0 8)} ~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; {99164#(<= ~counter~0 8)} is VALID [2022-04-28 12:33:48,135 INFO L290 TraceCheckUtils]: 79: Hoare triple {99164#(<= ~counter~0 8)} assume !(~c~0 >= ~b~0); {99164#(<= ~counter~0 8)} is VALID [2022-04-28 12:33:48,136 INFO L290 TraceCheckUtils]: 78: Hoare triple {99164#(<= ~counter~0 8)} assume !!(#t~post7 < 10);havoc #t~post7; {99164#(<= ~counter~0 8)} is VALID [2022-04-28 12:33:48,137 INFO L290 TraceCheckUtils]: 77: Hoare triple {99151#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99164#(<= ~counter~0 8)} is VALID [2022-04-28 12:33:48,137 INFO L290 TraceCheckUtils]: 76: Hoare triple {99151#(<= ~counter~0 7)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {99151#(<= ~counter~0 7)} is VALID [2022-04-28 12:33:48,138 INFO L290 TraceCheckUtils]: 75: Hoare triple {99151#(<= ~counter~0 7)} assume !(~c~0 >= 2 * ~v~0); {99151#(<= ~counter~0 7)} is VALID [2022-04-28 12:33:48,138 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {98908#true} {99151#(<= ~counter~0 7)} #104#return; {99151#(<= ~counter~0 7)} is VALID [2022-04-28 12:33:48,139 INFO L290 TraceCheckUtils]: 73: Hoare triple {98908#true} assume true; {98908#true} is VALID [2022-04-28 12:33:48,139 INFO L290 TraceCheckUtils]: 72: Hoare triple {98908#true} assume !(0 == ~cond); {98908#true} is VALID [2022-04-28 12:33:48,139 INFO L290 TraceCheckUtils]: 71: Hoare triple {98908#true} ~cond := #in~cond; {98908#true} is VALID [2022-04-28 12:33:48,139 INFO L272 TraceCheckUtils]: 70: Hoare triple {99151#(<= ~counter~0 7)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {98908#true} is VALID [2022-04-28 12:33:48,140 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {98908#true} {99151#(<= ~counter~0 7)} #102#return; {99151#(<= ~counter~0 7)} is VALID [2022-04-28 12:33:48,140 INFO L290 TraceCheckUtils]: 68: Hoare triple {98908#true} assume true; {98908#true} is VALID [2022-04-28 12:33:48,140 INFO L290 TraceCheckUtils]: 67: Hoare triple {98908#true} assume !(0 == ~cond); {98908#true} is VALID [2022-04-28 12:33:48,140 INFO L290 TraceCheckUtils]: 66: Hoare triple {98908#true} ~cond := #in~cond; {98908#true} is VALID [2022-04-28 12:33:48,140 INFO L272 TraceCheckUtils]: 65: Hoare triple {99151#(<= ~counter~0 7)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {98908#true} is VALID [2022-04-28 12:33:48,141 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {98908#true} {99151#(<= ~counter~0 7)} #100#return; {99151#(<= ~counter~0 7)} is VALID [2022-04-28 12:33:48,141 INFO L290 TraceCheckUtils]: 63: Hoare triple {98908#true} assume true; {98908#true} is VALID [2022-04-28 12:33:48,141 INFO L290 TraceCheckUtils]: 62: Hoare triple {98908#true} assume !(0 == ~cond); {98908#true} is VALID [2022-04-28 12:33:48,141 INFO L290 TraceCheckUtils]: 61: Hoare triple {98908#true} ~cond := #in~cond; {98908#true} is VALID [2022-04-28 12:33:48,141 INFO L272 TraceCheckUtils]: 60: Hoare triple {99151#(<= ~counter~0 7)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {98908#true} is VALID [2022-04-28 12:33:48,142 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {98908#true} {99151#(<= ~counter~0 7)} #98#return; {99151#(<= ~counter~0 7)} is VALID [2022-04-28 12:33:48,142 INFO L290 TraceCheckUtils]: 58: Hoare triple {98908#true} assume true; {98908#true} is VALID [2022-04-28 12:33:48,142 INFO L290 TraceCheckUtils]: 57: Hoare triple {98908#true} assume !(0 == ~cond); {98908#true} is VALID [2022-04-28 12:33:48,142 INFO L290 TraceCheckUtils]: 56: Hoare triple {98908#true} ~cond := #in~cond; {98908#true} is VALID [2022-04-28 12:33:48,142 INFO L272 TraceCheckUtils]: 55: Hoare triple {99151#(<= ~counter~0 7)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {98908#true} is VALID [2022-04-28 12:33:48,143 INFO L290 TraceCheckUtils]: 54: Hoare triple {99151#(<= ~counter~0 7)} assume !!(#t~post8 < 10);havoc #t~post8; {99151#(<= ~counter~0 7)} is VALID [2022-04-28 12:33:48,144 INFO L290 TraceCheckUtils]: 53: Hoare triple {99078#(<= ~counter~0 6)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {99151#(<= ~counter~0 7)} is VALID [2022-04-28 12:33:48,145 INFO L290 TraceCheckUtils]: 52: Hoare triple {99078#(<= ~counter~0 6)} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {99078#(<= ~counter~0 6)} is VALID [2022-04-28 12:33:48,145 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {98908#true} {99078#(<= ~counter~0 6)} #104#return; {99078#(<= ~counter~0 6)} is VALID [2022-04-28 12:33:48,146 INFO L290 TraceCheckUtils]: 50: Hoare triple {98908#true} assume true; {98908#true} is VALID [2022-04-28 12:33:48,146 INFO L290 TraceCheckUtils]: 49: Hoare triple {98908#true} assume !(0 == ~cond); {98908#true} is VALID [2022-04-28 12:33:48,146 INFO L290 TraceCheckUtils]: 48: Hoare triple {98908#true} ~cond := #in~cond; {98908#true} is VALID [2022-04-28 12:33:48,146 INFO L272 TraceCheckUtils]: 47: Hoare triple {99078#(<= ~counter~0 6)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {98908#true} is VALID [2022-04-28 12:33:48,147 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {98908#true} {99078#(<= ~counter~0 6)} #102#return; {99078#(<= ~counter~0 6)} is VALID [2022-04-28 12:33:48,147 INFO L290 TraceCheckUtils]: 45: Hoare triple {98908#true} assume true; {98908#true} is VALID [2022-04-28 12:33:48,147 INFO L290 TraceCheckUtils]: 44: Hoare triple {98908#true} assume !(0 == ~cond); {98908#true} is VALID [2022-04-28 12:33:48,147 INFO L290 TraceCheckUtils]: 43: Hoare triple {98908#true} ~cond := #in~cond; {98908#true} is VALID [2022-04-28 12:33:48,147 INFO L272 TraceCheckUtils]: 42: Hoare triple {99078#(<= ~counter~0 6)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {98908#true} is VALID [2022-04-28 12:33:48,148 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {98908#true} {99078#(<= ~counter~0 6)} #100#return; {99078#(<= ~counter~0 6)} is VALID [2022-04-28 12:33:48,148 INFO L290 TraceCheckUtils]: 40: Hoare triple {98908#true} assume true; {98908#true} is VALID [2022-04-28 12:33:48,148 INFO L290 TraceCheckUtils]: 39: Hoare triple {98908#true} assume !(0 == ~cond); {98908#true} is VALID [2022-04-28 12:33:48,148 INFO L290 TraceCheckUtils]: 38: Hoare triple {98908#true} ~cond := #in~cond; {98908#true} is VALID [2022-04-28 12:33:48,148 INFO L272 TraceCheckUtils]: 37: Hoare triple {99078#(<= ~counter~0 6)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {98908#true} is VALID [2022-04-28 12:33:48,149 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {98908#true} {99078#(<= ~counter~0 6)} #98#return; {99078#(<= ~counter~0 6)} is VALID [2022-04-28 12:33:48,149 INFO L290 TraceCheckUtils]: 35: Hoare triple {98908#true} assume true; {98908#true} is VALID [2022-04-28 12:33:48,149 INFO L290 TraceCheckUtils]: 34: Hoare triple {98908#true} assume !(0 == ~cond); {98908#true} is VALID [2022-04-28 12:33:48,149 INFO L290 TraceCheckUtils]: 33: Hoare triple {98908#true} ~cond := #in~cond; {98908#true} is VALID [2022-04-28 12:33:48,149 INFO L272 TraceCheckUtils]: 32: Hoare triple {99078#(<= ~counter~0 6)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {98908#true} is VALID [2022-04-28 12:33:48,150 INFO L290 TraceCheckUtils]: 31: Hoare triple {99078#(<= ~counter~0 6)} assume !!(#t~post8 < 10);havoc #t~post8; {99078#(<= ~counter~0 6)} is VALID [2022-04-28 12:33:48,151 INFO L290 TraceCheckUtils]: 30: Hoare triple {99008#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {99078#(<= ~counter~0 6)} is VALID [2022-04-28 12:33:48,152 INFO L290 TraceCheckUtils]: 29: Hoare triple {99008#(<= ~counter~0 5)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {99008#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:48,152 INFO L290 TraceCheckUtils]: 28: Hoare triple {99008#(<= ~counter~0 5)} assume !!(#t~post7 < 10);havoc #t~post7; {99008#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:48,153 INFO L290 TraceCheckUtils]: 27: Hoare triple {98998#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99008#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:48,154 INFO L290 TraceCheckUtils]: 26: Hoare triple {98998#(<= ~counter~0 4)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {98998#(<= ~counter~0 4)} is VALID [2022-04-28 12:33:48,154 INFO L290 TraceCheckUtils]: 25: Hoare triple {98998#(<= ~counter~0 4)} assume !!(#t~post6 < 10);havoc #t~post6; {98998#(<= ~counter~0 4)} is VALID [2022-04-28 12:33:48,155 INFO L290 TraceCheckUtils]: 24: Hoare triple {98988#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {98998#(<= ~counter~0 4)} is VALID [2022-04-28 12:33:48,155 INFO L290 TraceCheckUtils]: 23: Hoare triple {98988#(<= ~counter~0 3)} ~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; {98988#(<= ~counter~0 3)} is VALID [2022-04-28 12:33:48,156 INFO L290 TraceCheckUtils]: 22: Hoare triple {98988#(<= ~counter~0 3)} assume !(~c~0 >= ~b~0); {98988#(<= ~counter~0 3)} is VALID [2022-04-28 12:33:48,156 INFO L290 TraceCheckUtils]: 21: Hoare triple {98988#(<= ~counter~0 3)} assume !!(#t~post7 < 10);havoc #t~post7; {98988#(<= ~counter~0 3)} is VALID [2022-04-28 12:33:48,157 INFO L290 TraceCheckUtils]: 20: Hoare triple {98975#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {98988#(<= ~counter~0 3)} is VALID [2022-04-28 12:33:48,158 INFO L290 TraceCheckUtils]: 19: Hoare triple {98975#(<= ~counter~0 2)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {98975#(<= ~counter~0 2)} is VALID [2022-04-28 12:33:48,158 INFO L290 TraceCheckUtils]: 18: Hoare triple {98975#(<= ~counter~0 2)} assume !!(#t~post6 < 10);havoc #t~post6; {98975#(<= ~counter~0 2)} is VALID [2022-04-28 12:33:48,159 INFO L290 TraceCheckUtils]: 17: Hoare triple {98965#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {98975#(<= ~counter~0 2)} is VALID [2022-04-28 12:33:48,160 INFO L290 TraceCheckUtils]: 16: Hoare triple {98965#(<= ~counter~0 1)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {98965#(<= ~counter~0 1)} is VALID [2022-04-28 12:33:48,160 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {98908#true} {98965#(<= ~counter~0 1)} #96#return; {98965#(<= ~counter~0 1)} is VALID [2022-04-28 12:33:48,160 INFO L290 TraceCheckUtils]: 14: Hoare triple {98908#true} assume true; {98908#true} is VALID [2022-04-28 12:33:48,160 INFO L290 TraceCheckUtils]: 13: Hoare triple {98908#true} assume !(0 == ~cond); {98908#true} is VALID [2022-04-28 12:33:48,160 INFO L290 TraceCheckUtils]: 12: Hoare triple {98908#true} ~cond := #in~cond; {98908#true} is VALID [2022-04-28 12:33:48,161 INFO L272 TraceCheckUtils]: 11: Hoare triple {98965#(<= ~counter~0 1)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {98908#true} is VALID [2022-04-28 12:33:48,161 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {98908#true} {98965#(<= ~counter~0 1)} #94#return; {98965#(<= ~counter~0 1)} is VALID [2022-04-28 12:33:48,161 INFO L290 TraceCheckUtils]: 9: Hoare triple {98908#true} assume true; {98908#true} is VALID [2022-04-28 12:33:48,161 INFO L290 TraceCheckUtils]: 8: Hoare triple {98908#true} assume !(0 == ~cond); {98908#true} is VALID [2022-04-28 12:33:48,161 INFO L290 TraceCheckUtils]: 7: Hoare triple {98908#true} ~cond := #in~cond; {98908#true} is VALID [2022-04-28 12:33:48,162 INFO L272 TraceCheckUtils]: 6: Hoare triple {98965#(<= ~counter~0 1)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {98908#true} is VALID [2022-04-28 12:33:48,162 INFO L290 TraceCheckUtils]: 5: Hoare triple {98965#(<= ~counter~0 1)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {98965#(<= ~counter~0 1)} is VALID [2022-04-28 12:33:48,162 INFO L272 TraceCheckUtils]: 4: Hoare triple {98965#(<= ~counter~0 1)} call #t~ret9 := main(); {98965#(<= ~counter~0 1)} is VALID [2022-04-28 12:33:48,163 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {98965#(<= ~counter~0 1)} {98908#true} #108#return; {98965#(<= ~counter~0 1)} is VALID [2022-04-28 12:33:48,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {98965#(<= ~counter~0 1)} assume true; {98965#(<= ~counter~0 1)} is VALID [2022-04-28 12:33:48,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {98908#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);~counter~0 := 0; {98965#(<= ~counter~0 1)} is VALID [2022-04-28 12:33:48,164 INFO L272 TraceCheckUtils]: 0: Hoare triple {98908#true} call ULTIMATE.init(); {98908#true} is VALID [2022-04-28 12:33:48,164 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 24 proven. 32 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-28 12:33:48,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:33:48,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892376208] [2022-04-28 12:33:48,165 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:33:48,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923242492] [2022-04-28 12:33:48,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923242492] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:33:48,165 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:33:48,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2022-04-28 12:33:48,165 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:33:48,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [196684764] [2022-04-28 12:33:48,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [196684764] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:33:48,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:33:48,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 12:33:48,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718742283] [2022-04-28 12:33:48,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:33:48,166 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 11 states have internal predecessors, (48), 5 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 93 [2022-04-28 12:33:48,167 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:33:48,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 4.0) internal successors, (48), 11 states have internal predecessors, (48), 5 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 12:33:48,242 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 12:33:48,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 12:33:48,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:33:48,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 12:33:48,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 12:33:48,243 INFO L87 Difference]: Start difference. First operand 1034 states and 1383 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 11 states have internal predecessors, (48), 5 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 12:33:51,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:33:51,839 INFO L93 Difference]: Finished difference Result 1378 states and 1899 transitions. [2022-04-28 12:33:51,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 12:33:51,839 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 11 states have internal predecessors, (48), 5 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 93 [2022-04-28 12:33:51,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:33:51,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 11 states have internal predecessors, (48), 5 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 12:33:51,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 233 transitions. [2022-04-28 12:33:51,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 11 states have internal predecessors, (48), 5 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 12:33:51,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 233 transitions. [2022-04-28 12:33:51,842 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 233 transitions. [2022-04-28 12:33:52,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 233 edges. 233 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:33:52,101 INFO L225 Difference]: With dead ends: 1378 [2022-04-28 12:33:52,101 INFO L226 Difference]: Without dead ends: 1058 [2022-04-28 12:33:52,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 172 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=138, Invalid=242, Unknown=0, NotChecked=0, Total=380 [2022-04-28 12:33:52,103 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 164 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 12:33:52,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 290 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 12:33:52,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2022-04-28 12:33:54,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 1054. [2022-04-28 12:33:54,893 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:33:54,894 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1058 states. Second operand has 1054 states, 751 states have (on average 1.2623169107856191) internal successors, (948), 762 states have internal predecessors, (948), 229 states have call successors, (229), 74 states have call predecessors, (229), 73 states have return successors, (225), 217 states have call predecessors, (225), 225 states have call successors, (225) [2022-04-28 12:33:54,895 INFO L74 IsIncluded]: Start isIncluded. First operand 1058 states. Second operand has 1054 states, 751 states have (on average 1.2623169107856191) internal successors, (948), 762 states have internal predecessors, (948), 229 states have call successors, (229), 74 states have call predecessors, (229), 73 states have return successors, (225), 217 states have call predecessors, (225), 225 states have call successors, (225) [2022-04-28 12:33:54,895 INFO L87 Difference]: Start difference. First operand 1058 states. Second operand has 1054 states, 751 states have (on average 1.2623169107856191) internal successors, (948), 762 states have internal predecessors, (948), 229 states have call successors, (229), 74 states have call predecessors, (229), 73 states have return successors, (225), 217 states have call predecessors, (225), 225 states have call successors, (225) [2022-04-28 12:33:54,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:33:54,927 INFO L93 Difference]: Finished difference Result 1058 states and 1404 transitions. [2022-04-28 12:33:54,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1404 transitions. [2022-04-28 12:33:54,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:33:54,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:33:54,929 INFO L74 IsIncluded]: Start isIncluded. First operand has 1054 states, 751 states have (on average 1.2623169107856191) internal successors, (948), 762 states have internal predecessors, (948), 229 states have call successors, (229), 74 states have call predecessors, (229), 73 states have return successors, (225), 217 states have call predecessors, (225), 225 states have call successors, (225) Second operand 1058 states. [2022-04-28 12:33:54,930 INFO L87 Difference]: Start difference. First operand has 1054 states, 751 states have (on average 1.2623169107856191) internal successors, (948), 762 states have internal predecessors, (948), 229 states have call successors, (229), 74 states have call predecessors, (229), 73 states have return successors, (225), 217 states have call predecessors, (225), 225 states have call successors, (225) Second operand 1058 states. [2022-04-28 12:33:54,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:33:54,961 INFO L93 Difference]: Finished difference Result 1058 states and 1404 transitions. [2022-04-28 12:33:54,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1404 transitions. [2022-04-28 12:33:54,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:33:54,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:33:54,963 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:33:54,963 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:33:54,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1054 states, 751 states have (on average 1.2623169107856191) internal successors, (948), 762 states have internal predecessors, (948), 229 states have call successors, (229), 74 states have call predecessors, (229), 73 states have return successors, (225), 217 states have call predecessors, (225), 225 states have call successors, (225) [2022-04-28 12:33:55,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1402 transitions. [2022-04-28 12:33:55,010 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1402 transitions. Word has length 93 [2022-04-28 12:33:55,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:33:55,010 INFO L495 AbstractCegarLoop]: Abstraction has 1054 states and 1402 transitions. [2022-04-28 12:33:55,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 11 states have internal predecessors, (48), 5 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 12:33:55,010 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1054 states and 1402 transitions. [2022-04-28 12:33:58,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1402 edges. 1402 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:33:58,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1402 transitions. [2022-04-28 12:33:58,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-28 12:33:58,150 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:33:58,150 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:33:58,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-04-28 12:33:58,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:33:58,351 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:33:58,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:33:58,352 INFO L85 PathProgramCache]: Analyzing trace with hash -2034142563, now seen corresponding path program 5 times [2022-04-28 12:33:58,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:33:58,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [427475435] [2022-04-28 12:33:58,352 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:33:58,352 INFO L85 PathProgramCache]: Analyzing trace with hash -2034142563, now seen corresponding path program 6 times [2022-04-28 12:33:58,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:33:58,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125696097] [2022-04-28 12:33:58,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:33:58,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:33:58,368 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:33:58,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [838822631] [2022-04-28 12:33:58,368 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 12:33:58,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:33:58,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:33:58,370 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:33:58,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-04-28 12:33:58,549 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 12:33:58,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:33:58,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 12:33:58,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:33:58,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:33:59,037 INFO L272 TraceCheckUtils]: 0: Hoare triple {106471#true} call ULTIMATE.init(); {106471#true} is VALID [2022-04-28 12:33:59,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {106471#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);~counter~0 := 0; {106479#(<= ~counter~0 0)} is VALID [2022-04-28 12:33:59,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {106479#(<= ~counter~0 0)} assume true; {106479#(<= ~counter~0 0)} is VALID [2022-04-28 12:33:59,039 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {106479#(<= ~counter~0 0)} {106471#true} #108#return; {106479#(<= ~counter~0 0)} is VALID [2022-04-28 12:33:59,040 INFO L272 TraceCheckUtils]: 4: Hoare triple {106479#(<= ~counter~0 0)} call #t~ret9 := main(); {106479#(<= ~counter~0 0)} is VALID [2022-04-28 12:33:59,040 INFO L290 TraceCheckUtils]: 5: Hoare triple {106479#(<= ~counter~0 0)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {106479#(<= ~counter~0 0)} is VALID [2022-04-28 12:33:59,040 INFO L272 TraceCheckUtils]: 6: Hoare triple {106479#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {106479#(<= ~counter~0 0)} is VALID [2022-04-28 12:33:59,041 INFO L290 TraceCheckUtils]: 7: Hoare triple {106479#(<= ~counter~0 0)} ~cond := #in~cond; {106479#(<= ~counter~0 0)} is VALID [2022-04-28 12:33:59,041 INFO L290 TraceCheckUtils]: 8: Hoare triple {106479#(<= ~counter~0 0)} assume !(0 == ~cond); {106479#(<= ~counter~0 0)} is VALID [2022-04-28 12:33:59,042 INFO L290 TraceCheckUtils]: 9: Hoare triple {106479#(<= ~counter~0 0)} assume true; {106479#(<= ~counter~0 0)} is VALID [2022-04-28 12:33:59,042 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {106479#(<= ~counter~0 0)} {106479#(<= ~counter~0 0)} #94#return; {106479#(<= ~counter~0 0)} is VALID [2022-04-28 12:33:59,043 INFO L272 TraceCheckUtils]: 11: Hoare triple {106479#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {106479#(<= ~counter~0 0)} is VALID [2022-04-28 12:33:59,043 INFO L290 TraceCheckUtils]: 12: Hoare triple {106479#(<= ~counter~0 0)} ~cond := #in~cond; {106479#(<= ~counter~0 0)} is VALID [2022-04-28 12:33:59,043 INFO L290 TraceCheckUtils]: 13: Hoare triple {106479#(<= ~counter~0 0)} assume !(0 == ~cond); {106479#(<= ~counter~0 0)} is VALID [2022-04-28 12:33:59,044 INFO L290 TraceCheckUtils]: 14: Hoare triple {106479#(<= ~counter~0 0)} assume true; {106479#(<= ~counter~0 0)} is VALID [2022-04-28 12:33:59,044 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {106479#(<= ~counter~0 0)} {106479#(<= ~counter~0 0)} #96#return; {106479#(<= ~counter~0 0)} is VALID [2022-04-28 12:33:59,045 INFO L290 TraceCheckUtils]: 16: Hoare triple {106479#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {106479#(<= ~counter~0 0)} is VALID [2022-04-28 12:33:59,047 INFO L290 TraceCheckUtils]: 17: Hoare triple {106479#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {106528#(<= ~counter~0 1)} is VALID [2022-04-28 12:33:59,047 INFO L290 TraceCheckUtils]: 18: Hoare triple {106528#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {106528#(<= ~counter~0 1)} is VALID [2022-04-28 12:33:59,047 INFO L290 TraceCheckUtils]: 19: Hoare triple {106528#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {106528#(<= ~counter~0 1)} is VALID [2022-04-28 12:33:59,048 INFO L290 TraceCheckUtils]: 20: Hoare triple {106528#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {106538#(<= ~counter~0 2)} is VALID [2022-04-28 12:33:59,049 INFO L290 TraceCheckUtils]: 21: Hoare triple {106538#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {106538#(<= ~counter~0 2)} is VALID [2022-04-28 12:33:59,049 INFO L290 TraceCheckUtils]: 22: Hoare triple {106538#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {106538#(<= ~counter~0 2)} is VALID [2022-04-28 12:33:59,050 INFO L290 TraceCheckUtils]: 23: Hoare triple {106538#(<= ~counter~0 2)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {106538#(<= ~counter~0 2)} is VALID [2022-04-28 12:33:59,051 INFO L290 TraceCheckUtils]: 24: Hoare triple {106538#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {106551#(<= ~counter~0 3)} is VALID [2022-04-28 12:33:59,051 INFO L290 TraceCheckUtils]: 25: Hoare triple {106551#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {106551#(<= ~counter~0 3)} is VALID [2022-04-28 12:33:59,051 INFO L290 TraceCheckUtils]: 26: Hoare triple {106551#(<= ~counter~0 3)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {106551#(<= ~counter~0 3)} is VALID [2022-04-28 12:33:59,052 INFO L290 TraceCheckUtils]: 27: Hoare triple {106551#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {106561#(<= ~counter~0 4)} is VALID [2022-04-28 12:33:59,053 INFO L290 TraceCheckUtils]: 28: Hoare triple {106561#(<= ~counter~0 4)} assume !!(#t~post7 < 10);havoc #t~post7; {106561#(<= ~counter~0 4)} is VALID [2022-04-28 12:33:59,053 INFO L290 TraceCheckUtils]: 29: Hoare triple {106561#(<= ~counter~0 4)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {106561#(<= ~counter~0 4)} is VALID [2022-04-28 12:33:59,054 INFO L290 TraceCheckUtils]: 30: Hoare triple {106561#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {106571#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:59,055 INFO L290 TraceCheckUtils]: 31: Hoare triple {106571#(<= ~counter~0 5)} assume !!(#t~post8 < 10);havoc #t~post8; {106571#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:59,055 INFO L272 TraceCheckUtils]: 32: Hoare triple {106571#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {106571#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:59,056 INFO L290 TraceCheckUtils]: 33: Hoare triple {106571#(<= ~counter~0 5)} ~cond := #in~cond; {106571#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:59,056 INFO L290 TraceCheckUtils]: 34: Hoare triple {106571#(<= ~counter~0 5)} assume !(0 == ~cond); {106571#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:59,057 INFO L290 TraceCheckUtils]: 35: Hoare triple {106571#(<= ~counter~0 5)} assume true; {106571#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:59,058 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {106571#(<= ~counter~0 5)} {106571#(<= ~counter~0 5)} #98#return; {106571#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:59,058 INFO L272 TraceCheckUtils]: 37: Hoare triple {106571#(<= ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {106571#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:59,059 INFO L290 TraceCheckUtils]: 38: Hoare triple {106571#(<= ~counter~0 5)} ~cond := #in~cond; {106571#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:59,059 INFO L290 TraceCheckUtils]: 39: Hoare triple {106571#(<= ~counter~0 5)} assume !(0 == ~cond); {106571#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:59,060 INFO L290 TraceCheckUtils]: 40: Hoare triple {106571#(<= ~counter~0 5)} assume true; {106571#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:59,061 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {106571#(<= ~counter~0 5)} {106571#(<= ~counter~0 5)} #100#return; {106571#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:59,061 INFO L272 TraceCheckUtils]: 42: Hoare triple {106571#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {106571#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:59,061 INFO L290 TraceCheckUtils]: 43: Hoare triple {106571#(<= ~counter~0 5)} ~cond := #in~cond; {106571#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:59,062 INFO L290 TraceCheckUtils]: 44: Hoare triple {106571#(<= ~counter~0 5)} assume !(0 == ~cond); {106571#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:59,062 INFO L290 TraceCheckUtils]: 45: Hoare triple {106571#(<= ~counter~0 5)} assume true; {106571#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:59,063 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {106571#(<= ~counter~0 5)} {106571#(<= ~counter~0 5)} #102#return; {106571#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:59,063 INFO L272 TraceCheckUtils]: 47: Hoare triple {106571#(<= ~counter~0 5)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {106571#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:59,063 INFO L290 TraceCheckUtils]: 48: Hoare triple {106571#(<= ~counter~0 5)} ~cond := #in~cond; {106571#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:59,064 INFO L290 TraceCheckUtils]: 49: Hoare triple {106571#(<= ~counter~0 5)} assume !(0 == ~cond); {106571#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:59,064 INFO L290 TraceCheckUtils]: 50: Hoare triple {106571#(<= ~counter~0 5)} assume true; {106571#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:59,064 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {106571#(<= ~counter~0 5)} {106571#(<= ~counter~0 5)} #104#return; {106571#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:59,065 INFO L290 TraceCheckUtils]: 52: Hoare triple {106571#(<= ~counter~0 5)} assume !(~c~0 >= 2 * ~v~0); {106571#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:59,065 INFO L290 TraceCheckUtils]: 53: Hoare triple {106571#(<= ~counter~0 5)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {106571#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:59,066 INFO L290 TraceCheckUtils]: 54: Hoare triple {106571#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {106644#(<= ~counter~0 6)} is VALID [2022-04-28 12:33:59,066 INFO L290 TraceCheckUtils]: 55: Hoare triple {106644#(<= ~counter~0 6)} assume !!(#t~post7 < 10);havoc #t~post7; {106644#(<= ~counter~0 6)} is VALID [2022-04-28 12:33:59,067 INFO L290 TraceCheckUtils]: 56: Hoare triple {106644#(<= ~counter~0 6)} assume !(~c~0 >= ~b~0); {106644#(<= ~counter~0 6)} is VALID [2022-04-28 12:33:59,067 INFO L290 TraceCheckUtils]: 57: Hoare triple {106644#(<= ~counter~0 6)} ~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; {106644#(<= ~counter~0 6)} is VALID [2022-04-28 12:33:59,068 INFO L290 TraceCheckUtils]: 58: Hoare triple {106644#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {106657#(<= ~counter~0 7)} is VALID [2022-04-28 12:33:59,068 INFO L290 TraceCheckUtils]: 59: Hoare triple {106657#(<= ~counter~0 7)} assume !!(#t~post6 < 10);havoc #t~post6; {106657#(<= ~counter~0 7)} is VALID [2022-04-28 12:33:59,068 INFO L290 TraceCheckUtils]: 60: Hoare triple {106657#(<= ~counter~0 7)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {106657#(<= ~counter~0 7)} is VALID [2022-04-28 12:33:59,069 INFO L290 TraceCheckUtils]: 61: Hoare triple {106657#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {106667#(<= ~counter~0 8)} is VALID [2022-04-28 12:33:59,070 INFO L290 TraceCheckUtils]: 62: Hoare triple {106667#(<= ~counter~0 8)} assume !!(#t~post7 < 10);havoc #t~post7; {106667#(<= ~counter~0 8)} is VALID [2022-04-28 12:33:59,070 INFO L290 TraceCheckUtils]: 63: Hoare triple {106667#(<= ~counter~0 8)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {106667#(<= ~counter~0 8)} is VALID [2022-04-28 12:33:59,071 INFO L290 TraceCheckUtils]: 64: Hoare triple {106667#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {106677#(<= ~counter~0 9)} is VALID [2022-04-28 12:33:59,071 INFO L290 TraceCheckUtils]: 65: Hoare triple {106677#(<= ~counter~0 9)} assume !!(#t~post8 < 10);havoc #t~post8; {106677#(<= ~counter~0 9)} is VALID [2022-04-28 12:33:59,072 INFO L272 TraceCheckUtils]: 66: Hoare triple {106677#(<= ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {106677#(<= ~counter~0 9)} is VALID [2022-04-28 12:33:59,072 INFO L290 TraceCheckUtils]: 67: Hoare triple {106677#(<= ~counter~0 9)} ~cond := #in~cond; {106677#(<= ~counter~0 9)} is VALID [2022-04-28 12:33:59,072 INFO L290 TraceCheckUtils]: 68: Hoare triple {106677#(<= ~counter~0 9)} assume !(0 == ~cond); {106677#(<= ~counter~0 9)} is VALID [2022-04-28 12:33:59,073 INFO L290 TraceCheckUtils]: 69: Hoare triple {106677#(<= ~counter~0 9)} assume true; {106677#(<= ~counter~0 9)} is VALID [2022-04-28 12:33:59,076 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {106677#(<= ~counter~0 9)} {106677#(<= ~counter~0 9)} #98#return; {106677#(<= ~counter~0 9)} is VALID [2022-04-28 12:33:59,076 INFO L272 TraceCheckUtils]: 71: Hoare triple {106677#(<= ~counter~0 9)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {106677#(<= ~counter~0 9)} is VALID [2022-04-28 12:33:59,077 INFO L290 TraceCheckUtils]: 72: Hoare triple {106677#(<= ~counter~0 9)} ~cond := #in~cond; {106677#(<= ~counter~0 9)} is VALID [2022-04-28 12:33:59,077 INFO L290 TraceCheckUtils]: 73: Hoare triple {106677#(<= ~counter~0 9)} assume !(0 == ~cond); {106677#(<= ~counter~0 9)} is VALID [2022-04-28 12:33:59,078 INFO L290 TraceCheckUtils]: 74: Hoare triple {106677#(<= ~counter~0 9)} assume true; {106677#(<= ~counter~0 9)} is VALID [2022-04-28 12:33:59,079 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {106677#(<= ~counter~0 9)} {106677#(<= ~counter~0 9)} #100#return; {106677#(<= ~counter~0 9)} is VALID [2022-04-28 12:33:59,079 INFO L272 TraceCheckUtils]: 76: Hoare triple {106677#(<= ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {106677#(<= ~counter~0 9)} is VALID [2022-04-28 12:33:59,080 INFO L290 TraceCheckUtils]: 77: Hoare triple {106677#(<= ~counter~0 9)} ~cond := #in~cond; {106677#(<= ~counter~0 9)} is VALID [2022-04-28 12:33:59,080 INFO L290 TraceCheckUtils]: 78: Hoare triple {106677#(<= ~counter~0 9)} assume !(0 == ~cond); {106677#(<= ~counter~0 9)} is VALID [2022-04-28 12:33:59,081 INFO L290 TraceCheckUtils]: 79: Hoare triple {106677#(<= ~counter~0 9)} assume true; {106677#(<= ~counter~0 9)} is VALID [2022-04-28 12:33:59,081 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {106677#(<= ~counter~0 9)} {106677#(<= ~counter~0 9)} #102#return; {106677#(<= ~counter~0 9)} is VALID [2022-04-28 12:33:59,082 INFO L272 TraceCheckUtils]: 81: Hoare triple {106677#(<= ~counter~0 9)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {106677#(<= ~counter~0 9)} is VALID [2022-04-28 12:33:59,082 INFO L290 TraceCheckUtils]: 82: Hoare triple {106677#(<= ~counter~0 9)} ~cond := #in~cond; {106677#(<= ~counter~0 9)} is VALID [2022-04-28 12:33:59,083 INFO L290 TraceCheckUtils]: 83: Hoare triple {106677#(<= ~counter~0 9)} assume !(0 == ~cond); {106677#(<= ~counter~0 9)} is VALID [2022-04-28 12:33:59,083 INFO L290 TraceCheckUtils]: 84: Hoare triple {106677#(<= ~counter~0 9)} assume true; {106677#(<= ~counter~0 9)} is VALID [2022-04-28 12:33:59,084 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {106677#(<= ~counter~0 9)} {106677#(<= ~counter~0 9)} #104#return; {106677#(<= ~counter~0 9)} is VALID [2022-04-28 12:33:59,084 INFO L290 TraceCheckUtils]: 86: Hoare triple {106677#(<= ~counter~0 9)} assume !(~c~0 >= 2 * ~v~0); {106677#(<= ~counter~0 9)} is VALID [2022-04-28 12:33:59,085 INFO L290 TraceCheckUtils]: 87: Hoare triple {106677#(<= ~counter~0 9)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {106677#(<= ~counter~0 9)} is VALID [2022-04-28 12:33:59,085 INFO L290 TraceCheckUtils]: 88: Hoare triple {106677#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {106750#(<= |main_#t~post7| 9)} is VALID [2022-04-28 12:33:59,086 INFO L290 TraceCheckUtils]: 89: Hoare triple {106750#(<= |main_#t~post7| 9)} assume !(#t~post7 < 10);havoc #t~post7; {106472#false} is VALID [2022-04-28 12:33:59,086 INFO L290 TraceCheckUtils]: 90: Hoare triple {106472#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; {106472#false} is VALID [2022-04-28 12:33:59,086 INFO L290 TraceCheckUtils]: 91: Hoare triple {106472#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {106472#false} is VALID [2022-04-28 12:33:59,086 INFO L290 TraceCheckUtils]: 92: Hoare triple {106472#false} assume !(#t~post6 < 10);havoc #t~post6; {106472#false} is VALID [2022-04-28 12:33:59,086 INFO L272 TraceCheckUtils]: 93: Hoare triple {106472#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)); {106472#false} is VALID [2022-04-28 12:33:59,087 INFO L290 TraceCheckUtils]: 94: Hoare triple {106472#false} ~cond := #in~cond; {106472#false} is VALID [2022-04-28 12:33:59,087 INFO L290 TraceCheckUtils]: 95: Hoare triple {106472#false} assume 0 == ~cond; {106472#false} is VALID [2022-04-28 12:33:59,087 INFO L290 TraceCheckUtils]: 96: Hoare triple {106472#false} assume !false; {106472#false} is VALID [2022-04-28 12:33:59,087 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 24 proven. 108 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-28 12:33:59,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:33:59,581 INFO L290 TraceCheckUtils]: 96: Hoare triple {106472#false} assume !false; {106472#false} is VALID [2022-04-28 12:33:59,582 INFO L290 TraceCheckUtils]: 95: Hoare triple {106472#false} assume 0 == ~cond; {106472#false} is VALID [2022-04-28 12:33:59,582 INFO L290 TraceCheckUtils]: 94: Hoare triple {106472#false} ~cond := #in~cond; {106472#false} is VALID [2022-04-28 12:33:59,582 INFO L272 TraceCheckUtils]: 93: Hoare triple {106472#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)); {106472#false} is VALID [2022-04-28 12:33:59,582 INFO L290 TraceCheckUtils]: 92: Hoare triple {106472#false} assume !(#t~post6 < 10);havoc #t~post6; {106472#false} is VALID [2022-04-28 12:33:59,582 INFO L290 TraceCheckUtils]: 91: Hoare triple {106472#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {106472#false} is VALID [2022-04-28 12:33:59,582 INFO L290 TraceCheckUtils]: 90: Hoare triple {106472#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; {106472#false} is VALID [2022-04-28 12:33:59,582 INFO L290 TraceCheckUtils]: 89: Hoare triple {106750#(<= |main_#t~post7| 9)} assume !(#t~post7 < 10);havoc #t~post7; {106472#false} is VALID [2022-04-28 12:33:59,583 INFO L290 TraceCheckUtils]: 88: Hoare triple {106677#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {106750#(<= |main_#t~post7| 9)} is VALID [2022-04-28 12:33:59,583 INFO L290 TraceCheckUtils]: 87: Hoare triple {106677#(<= ~counter~0 9)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {106677#(<= ~counter~0 9)} is VALID [2022-04-28 12:33:59,583 INFO L290 TraceCheckUtils]: 86: Hoare triple {106677#(<= ~counter~0 9)} assume !(~c~0 >= 2 * ~v~0); {106677#(<= ~counter~0 9)} is VALID [2022-04-28 12:33:59,584 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {106471#true} {106677#(<= ~counter~0 9)} #104#return; {106677#(<= ~counter~0 9)} is VALID [2022-04-28 12:33:59,584 INFO L290 TraceCheckUtils]: 84: Hoare triple {106471#true} assume true; {106471#true} is VALID [2022-04-28 12:33:59,584 INFO L290 TraceCheckUtils]: 83: Hoare triple {106471#true} assume !(0 == ~cond); {106471#true} is VALID [2022-04-28 12:33:59,584 INFO L290 TraceCheckUtils]: 82: Hoare triple {106471#true} ~cond := #in~cond; {106471#true} is VALID [2022-04-28 12:33:59,584 INFO L272 TraceCheckUtils]: 81: Hoare triple {106677#(<= ~counter~0 9)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {106471#true} is VALID [2022-04-28 12:33:59,585 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {106471#true} {106677#(<= ~counter~0 9)} #102#return; {106677#(<= ~counter~0 9)} is VALID [2022-04-28 12:33:59,585 INFO L290 TraceCheckUtils]: 79: Hoare triple {106471#true} assume true; {106471#true} is VALID [2022-04-28 12:33:59,585 INFO L290 TraceCheckUtils]: 78: Hoare triple {106471#true} assume !(0 == ~cond); {106471#true} is VALID [2022-04-28 12:33:59,585 INFO L290 TraceCheckUtils]: 77: Hoare triple {106471#true} ~cond := #in~cond; {106471#true} is VALID [2022-04-28 12:33:59,585 INFO L272 TraceCheckUtils]: 76: Hoare triple {106677#(<= ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {106471#true} is VALID [2022-04-28 12:33:59,586 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {106471#true} {106677#(<= ~counter~0 9)} #100#return; {106677#(<= ~counter~0 9)} is VALID [2022-04-28 12:33:59,586 INFO L290 TraceCheckUtils]: 74: Hoare triple {106471#true} assume true; {106471#true} is VALID [2022-04-28 12:33:59,586 INFO L290 TraceCheckUtils]: 73: Hoare triple {106471#true} assume !(0 == ~cond); {106471#true} is VALID [2022-04-28 12:33:59,586 INFO L290 TraceCheckUtils]: 72: Hoare triple {106471#true} ~cond := #in~cond; {106471#true} is VALID [2022-04-28 12:33:59,586 INFO L272 TraceCheckUtils]: 71: Hoare triple {106677#(<= ~counter~0 9)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {106471#true} is VALID [2022-04-28 12:33:59,587 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {106471#true} {106677#(<= ~counter~0 9)} #98#return; {106677#(<= ~counter~0 9)} is VALID [2022-04-28 12:33:59,587 INFO L290 TraceCheckUtils]: 69: Hoare triple {106471#true} assume true; {106471#true} is VALID [2022-04-28 12:33:59,587 INFO L290 TraceCheckUtils]: 68: Hoare triple {106471#true} assume !(0 == ~cond); {106471#true} is VALID [2022-04-28 12:33:59,587 INFO L290 TraceCheckUtils]: 67: Hoare triple {106471#true} ~cond := #in~cond; {106471#true} is VALID [2022-04-28 12:33:59,587 INFO L272 TraceCheckUtils]: 66: Hoare triple {106677#(<= ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {106471#true} is VALID [2022-04-28 12:33:59,587 INFO L290 TraceCheckUtils]: 65: Hoare triple {106677#(<= ~counter~0 9)} assume !!(#t~post8 < 10);havoc #t~post8; {106677#(<= ~counter~0 9)} is VALID [2022-04-28 12:33:59,589 INFO L290 TraceCheckUtils]: 64: Hoare triple {106667#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {106677#(<= ~counter~0 9)} is VALID [2022-04-28 12:33:59,589 INFO L290 TraceCheckUtils]: 63: Hoare triple {106667#(<= ~counter~0 8)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {106667#(<= ~counter~0 8)} is VALID [2022-04-28 12:33:59,590 INFO L290 TraceCheckUtils]: 62: Hoare triple {106667#(<= ~counter~0 8)} assume !!(#t~post7 < 10);havoc #t~post7; {106667#(<= ~counter~0 8)} is VALID [2022-04-28 12:33:59,590 INFO L290 TraceCheckUtils]: 61: Hoare triple {106657#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {106667#(<= ~counter~0 8)} is VALID [2022-04-28 12:33:59,591 INFO L290 TraceCheckUtils]: 60: Hoare triple {106657#(<= ~counter~0 7)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {106657#(<= ~counter~0 7)} is VALID [2022-04-28 12:33:59,591 INFO L290 TraceCheckUtils]: 59: Hoare triple {106657#(<= ~counter~0 7)} assume !!(#t~post6 < 10);havoc #t~post6; {106657#(<= ~counter~0 7)} is VALID [2022-04-28 12:33:59,592 INFO L290 TraceCheckUtils]: 58: Hoare triple {106644#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {106657#(<= ~counter~0 7)} is VALID [2022-04-28 12:33:59,592 INFO L290 TraceCheckUtils]: 57: Hoare triple {106644#(<= ~counter~0 6)} ~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; {106644#(<= ~counter~0 6)} is VALID [2022-04-28 12:33:59,592 INFO L290 TraceCheckUtils]: 56: Hoare triple {106644#(<= ~counter~0 6)} assume !(~c~0 >= ~b~0); {106644#(<= ~counter~0 6)} is VALID [2022-04-28 12:33:59,593 INFO L290 TraceCheckUtils]: 55: Hoare triple {106644#(<= ~counter~0 6)} assume !!(#t~post7 < 10);havoc #t~post7; {106644#(<= ~counter~0 6)} is VALID [2022-04-28 12:33:59,593 INFO L290 TraceCheckUtils]: 54: Hoare triple {106571#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {106644#(<= ~counter~0 6)} is VALID [2022-04-28 12:33:59,594 INFO L290 TraceCheckUtils]: 53: Hoare triple {106571#(<= ~counter~0 5)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {106571#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:59,594 INFO L290 TraceCheckUtils]: 52: Hoare triple {106571#(<= ~counter~0 5)} assume !(~c~0 >= 2 * ~v~0); {106571#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:59,595 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {106471#true} {106571#(<= ~counter~0 5)} #104#return; {106571#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:59,595 INFO L290 TraceCheckUtils]: 50: Hoare triple {106471#true} assume true; {106471#true} is VALID [2022-04-28 12:33:59,595 INFO L290 TraceCheckUtils]: 49: Hoare triple {106471#true} assume !(0 == ~cond); {106471#true} is VALID [2022-04-28 12:33:59,595 INFO L290 TraceCheckUtils]: 48: Hoare triple {106471#true} ~cond := #in~cond; {106471#true} is VALID [2022-04-28 12:33:59,595 INFO L272 TraceCheckUtils]: 47: Hoare triple {106571#(<= ~counter~0 5)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {106471#true} is VALID [2022-04-28 12:33:59,595 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {106471#true} {106571#(<= ~counter~0 5)} #102#return; {106571#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:59,596 INFO L290 TraceCheckUtils]: 45: Hoare triple {106471#true} assume true; {106471#true} is VALID [2022-04-28 12:33:59,596 INFO L290 TraceCheckUtils]: 44: Hoare triple {106471#true} assume !(0 == ~cond); {106471#true} is VALID [2022-04-28 12:33:59,596 INFO L290 TraceCheckUtils]: 43: Hoare triple {106471#true} ~cond := #in~cond; {106471#true} is VALID [2022-04-28 12:33:59,596 INFO L272 TraceCheckUtils]: 42: Hoare triple {106571#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {106471#true} is VALID [2022-04-28 12:33:59,596 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {106471#true} {106571#(<= ~counter~0 5)} #100#return; {106571#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:59,596 INFO L290 TraceCheckUtils]: 40: Hoare triple {106471#true} assume true; {106471#true} is VALID [2022-04-28 12:33:59,597 INFO L290 TraceCheckUtils]: 39: Hoare triple {106471#true} assume !(0 == ~cond); {106471#true} is VALID [2022-04-28 12:33:59,597 INFO L290 TraceCheckUtils]: 38: Hoare triple {106471#true} ~cond := #in~cond; {106471#true} is VALID [2022-04-28 12:33:59,597 INFO L272 TraceCheckUtils]: 37: Hoare triple {106571#(<= ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {106471#true} is VALID [2022-04-28 12:33:59,599 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {106471#true} {106571#(<= ~counter~0 5)} #98#return; {106571#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:59,600 INFO L290 TraceCheckUtils]: 35: Hoare triple {106471#true} assume true; {106471#true} is VALID [2022-04-28 12:33:59,600 INFO L290 TraceCheckUtils]: 34: Hoare triple {106471#true} assume !(0 == ~cond); {106471#true} is VALID [2022-04-28 12:33:59,600 INFO L290 TraceCheckUtils]: 33: Hoare triple {106471#true} ~cond := #in~cond; {106471#true} is VALID [2022-04-28 12:33:59,600 INFO L272 TraceCheckUtils]: 32: Hoare triple {106571#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {106471#true} is VALID [2022-04-28 12:33:59,600 INFO L290 TraceCheckUtils]: 31: Hoare triple {106571#(<= ~counter~0 5)} assume !!(#t~post8 < 10);havoc #t~post8; {106571#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:59,601 INFO L290 TraceCheckUtils]: 30: Hoare triple {106561#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {106571#(<= ~counter~0 5)} is VALID [2022-04-28 12:33:59,602 INFO L290 TraceCheckUtils]: 29: Hoare triple {106561#(<= ~counter~0 4)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {106561#(<= ~counter~0 4)} is VALID [2022-04-28 12:33:59,602 INFO L290 TraceCheckUtils]: 28: Hoare triple {106561#(<= ~counter~0 4)} assume !!(#t~post7 < 10);havoc #t~post7; {106561#(<= ~counter~0 4)} is VALID [2022-04-28 12:33:59,603 INFO L290 TraceCheckUtils]: 27: Hoare triple {106551#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {106561#(<= ~counter~0 4)} is VALID [2022-04-28 12:33:59,604 INFO L290 TraceCheckUtils]: 26: Hoare triple {106551#(<= ~counter~0 3)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {106551#(<= ~counter~0 3)} is VALID [2022-04-28 12:33:59,604 INFO L290 TraceCheckUtils]: 25: Hoare triple {106551#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {106551#(<= ~counter~0 3)} is VALID [2022-04-28 12:33:59,605 INFO L290 TraceCheckUtils]: 24: Hoare triple {106538#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {106551#(<= ~counter~0 3)} is VALID [2022-04-28 12:33:59,605 INFO L290 TraceCheckUtils]: 23: Hoare triple {106538#(<= ~counter~0 2)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {106538#(<= ~counter~0 2)} is VALID [2022-04-28 12:33:59,606 INFO L290 TraceCheckUtils]: 22: Hoare triple {106538#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {106538#(<= ~counter~0 2)} is VALID [2022-04-28 12:33:59,606 INFO L290 TraceCheckUtils]: 21: Hoare triple {106538#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {106538#(<= ~counter~0 2)} is VALID [2022-04-28 12:33:59,607 INFO L290 TraceCheckUtils]: 20: Hoare triple {106528#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {106538#(<= ~counter~0 2)} is VALID [2022-04-28 12:33:59,607 INFO L290 TraceCheckUtils]: 19: Hoare triple {106528#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {106528#(<= ~counter~0 1)} is VALID [2022-04-28 12:33:59,608 INFO L290 TraceCheckUtils]: 18: Hoare triple {106528#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {106528#(<= ~counter~0 1)} is VALID [2022-04-28 12:33:59,609 INFO L290 TraceCheckUtils]: 17: Hoare triple {106479#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {106528#(<= ~counter~0 1)} is VALID [2022-04-28 12:33:59,609 INFO L290 TraceCheckUtils]: 16: Hoare triple {106479#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {106479#(<= ~counter~0 0)} is VALID [2022-04-28 12:33:59,610 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {106471#true} {106479#(<= ~counter~0 0)} #96#return; {106479#(<= ~counter~0 0)} is VALID [2022-04-28 12:33:59,610 INFO L290 TraceCheckUtils]: 14: Hoare triple {106471#true} assume true; {106471#true} is VALID [2022-04-28 12:33:59,610 INFO L290 TraceCheckUtils]: 13: Hoare triple {106471#true} assume !(0 == ~cond); {106471#true} is VALID [2022-04-28 12:33:59,610 INFO L290 TraceCheckUtils]: 12: Hoare triple {106471#true} ~cond := #in~cond; {106471#true} is VALID [2022-04-28 12:33:59,610 INFO L272 TraceCheckUtils]: 11: Hoare triple {106479#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {106471#true} is VALID [2022-04-28 12:33:59,611 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {106471#true} {106479#(<= ~counter~0 0)} #94#return; {106479#(<= ~counter~0 0)} is VALID [2022-04-28 12:33:59,611 INFO L290 TraceCheckUtils]: 9: Hoare triple {106471#true} assume true; {106471#true} is VALID [2022-04-28 12:33:59,611 INFO L290 TraceCheckUtils]: 8: Hoare triple {106471#true} assume !(0 == ~cond); {106471#true} is VALID [2022-04-28 12:33:59,611 INFO L290 TraceCheckUtils]: 7: Hoare triple {106471#true} ~cond := #in~cond; {106471#true} is VALID [2022-04-28 12:33:59,611 INFO L272 TraceCheckUtils]: 6: Hoare triple {106479#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {106471#true} is VALID [2022-04-28 12:33:59,612 INFO L290 TraceCheckUtils]: 5: Hoare triple {106479#(<= ~counter~0 0)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {106479#(<= ~counter~0 0)} is VALID [2022-04-28 12:33:59,612 INFO L272 TraceCheckUtils]: 4: Hoare triple {106479#(<= ~counter~0 0)} call #t~ret9 := main(); {106479#(<= ~counter~0 0)} is VALID [2022-04-28 12:33:59,612 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {106479#(<= ~counter~0 0)} {106471#true} #108#return; {106479#(<= ~counter~0 0)} is VALID [2022-04-28 12:33:59,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {106479#(<= ~counter~0 0)} assume true; {106479#(<= ~counter~0 0)} is VALID [2022-04-28 12:33:59,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {106471#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);~counter~0 := 0; {106479#(<= ~counter~0 0)} is VALID [2022-04-28 12:33:59,613 INFO L272 TraceCheckUtils]: 0: Hoare triple {106471#true} call ULTIMATE.init(); {106471#true} is VALID [2022-04-28 12:33:59,614 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 24 proven. 44 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-28 12:33:59,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:33:59,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125696097] [2022-04-28 12:33:59,614 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:33:59,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838822631] [2022-04-28 12:33:59,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838822631] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:33:59,614 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:33:59,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2022-04-28 12:33:59,614 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:33:59,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [427475435] [2022-04-28 12:33:59,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [427475435] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:33:59,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:33:59,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 12:33:59,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176371293] [2022-04-28 12:33:59,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:33:59,615 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 12 states have internal predecessors, (52), 5 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 97 [2022-04-28 12:33:59,615 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:33:59,615 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 4.0) internal successors, (52), 12 states have internal predecessors, (52), 5 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 12:33:59,695 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:33:59,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 12:33:59,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:33:59,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 12:33:59,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2022-04-28 12:33:59,696 INFO L87 Difference]: Start difference. First operand 1054 states and 1402 transitions. Second operand has 13 states, 13 states have (on average 4.0) internal successors, (52), 12 states have internal predecessors, (52), 5 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 12:34:03,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:34:03,781 INFO L93 Difference]: Finished difference Result 1535 states and 2087 transitions. [2022-04-28 12:34:03,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 12:34:03,781 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 12 states have internal predecessors, (52), 5 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 97 [2022-04-28 12:34:03,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:34:03,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.0) internal successors, (52), 12 states have internal predecessors, (52), 5 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 12:34:03,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 261 transitions. [2022-04-28 12:34:03,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.0) internal successors, (52), 12 states have internal predecessors, (52), 5 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 12:34:03,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 261 transitions. [2022-04-28 12:34:03,785 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 261 transitions. [2022-04-28 12:34:04,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 261 edges. 261 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:34:04,107 INFO L225 Difference]: With dead ends: 1535 [2022-04-28 12:34:04,107 INFO L226 Difference]: Without dead ends: 1215 [2022-04-28 12:34:04,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=139, Invalid=241, Unknown=0, NotChecked=0, Total=380 [2022-04-28 12:34:04,108 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 176 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 12:34:04,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 319 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 12:34:04,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2022-04-28 12:34:07,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 1160. [2022-04-28 12:34:07,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:34:07,325 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1215 states. Second operand has 1160 states, 809 states have (on average 1.2571075401730532) internal successors, (1017), 821 states have internal predecessors, (1017), 262 states have call successors, (262), 89 states have call predecessors, (262), 88 states have return successors, (257), 249 states have call predecessors, (257), 257 states have call successors, (257) [2022-04-28 12:34:07,326 INFO L74 IsIncluded]: Start isIncluded. First operand 1215 states. Second operand has 1160 states, 809 states have (on average 1.2571075401730532) internal successors, (1017), 821 states have internal predecessors, (1017), 262 states have call successors, (262), 89 states have call predecessors, (262), 88 states have return successors, (257), 249 states have call predecessors, (257), 257 states have call successors, (257) [2022-04-28 12:34:07,327 INFO L87 Difference]: Start difference. First operand 1215 states. Second operand has 1160 states, 809 states have (on average 1.2571075401730532) internal successors, (1017), 821 states have internal predecessors, (1017), 262 states have call successors, (262), 89 states have call predecessors, (262), 88 states have return successors, (257), 249 states have call predecessors, (257), 257 states have call successors, (257) [2022-04-28 12:34:07,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:34:07,367 INFO L93 Difference]: Finished difference Result 1215 states and 1591 transitions. [2022-04-28 12:34:07,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1591 transitions. [2022-04-28 12:34:07,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:34:07,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:34:07,370 INFO L74 IsIncluded]: Start isIncluded. First operand has 1160 states, 809 states have (on average 1.2571075401730532) internal successors, (1017), 821 states have internal predecessors, (1017), 262 states have call successors, (262), 89 states have call predecessors, (262), 88 states have return successors, (257), 249 states have call predecessors, (257), 257 states have call successors, (257) Second operand 1215 states. [2022-04-28 12:34:07,371 INFO L87 Difference]: Start difference. First operand has 1160 states, 809 states have (on average 1.2571075401730532) internal successors, (1017), 821 states have internal predecessors, (1017), 262 states have call successors, (262), 89 states have call predecessors, (262), 88 states have return successors, (257), 249 states have call predecessors, (257), 257 states have call successors, (257) Second operand 1215 states. [2022-04-28 12:34:07,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:34:07,417 INFO L93 Difference]: Finished difference Result 1215 states and 1591 transitions. [2022-04-28 12:34:07,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1591 transitions. [2022-04-28 12:34:07,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:34:07,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:34:07,418 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:34:07,418 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:34:07,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1160 states, 809 states have (on average 1.2571075401730532) internal successors, (1017), 821 states have internal predecessors, (1017), 262 states have call successors, (262), 89 states have call predecessors, (262), 88 states have return successors, (257), 249 states have call predecessors, (257), 257 states have call successors, (257) [2022-04-28 12:34:07,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1536 transitions. [2022-04-28 12:34:07,474 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1536 transitions. Word has length 97 [2022-04-28 12:34:07,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:34:07,474 INFO L495 AbstractCegarLoop]: Abstraction has 1160 states and 1536 transitions. [2022-04-28 12:34:07,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 12 states have internal predecessors, (52), 5 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 12:34:07,475 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1160 states and 1536 transitions. [2022-04-28 12:34:11,049 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1536 edges. 1536 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:34:11,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1536 transitions. [2022-04-28 12:34:11,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-28 12:34:11,050 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:34:11,050 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:34:11,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2022-04-28 12:34:11,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-04-28 12:34:11,251 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:34:11,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:34:11,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1787026468, now seen corresponding path program 7 times [2022-04-28 12:34:11,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:34:11,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1457201381] [2022-04-28 12:34:11,251 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:34:11,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1787026468, now seen corresponding path program 8 times [2022-04-28 12:34:11,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:34:11,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51205725] [2022-04-28 12:34:11,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:34:11,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:34:11,269 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:34:11,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1071409996] [2022-04-28 12:34:11,269 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:34:11,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:34:11,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:34:11,270 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:34:11,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-04-28 12:34:11,338 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:34:11,338 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-28 12:34:11,338 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 12:34:11,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 12:34:11,409 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 12:34:11,409 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-28 12:34:11,409 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-28 12:34:11,412 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 12:34:11,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-04-28 12:34:11,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-04-28 12:34:11,641 INFO L356 BasicCegarLoop]: Path program histogram: [8, 6, 6, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-28 12:34:11,644 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 12:34:11,667 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 12:34:11,667 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-28 12:34:11,667 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 12:34:11,667 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 12:34:11,668 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 12:34:11,668 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-28 12:34:11,668 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-28 12:34:11,668 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 12:34:11,668 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 12:34:11,668 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 12:34:11,668 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 12:34:11,668 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-28 12:34:11,668 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-28 12:34:11,668 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-28 12:34:11,668 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-28 12:34:11,668 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-28 12:34:11,668 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-28 12:34:11,668 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-28 12:34:11,669 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-28 12:34:11,669 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2022-04-28 12:34:11,669 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-28 12:34:11,669 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-28 12:34:11,669 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-28 12:34:11,669 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-28 12:34:11,669 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2022-04-28 12:34:11,669 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-28 12:34:11,669 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-28 12:34:11,669 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-28 12:34:11,669 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 12:34:11,669 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 12:34:11,669 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 12:34:11,669 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 12:34:11,669 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 12:34:11,669 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-28 12:34:11,669 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-28 12:34:11,670 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2022-04-28 12:34:11,670 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2022-04-28 12:34:11,670 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-28 12:34:11,670 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-28 12:34:11,670 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-04-28 12:34:11,670 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-04-28 12:34:11,670 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-28 12:34:11,670 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-28 12:34:11,670 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2022-04-28 12:34:11,670 WARN L170 areAnnotationChecker]: L34-4 has no Hoare annotation [2022-04-28 12:34:11,670 WARN L170 areAnnotationChecker]: L34-4 has no Hoare annotation [2022-04-28 12:34:11,670 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-28 12:34:11,670 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-28 12:34:11,670 WARN L170 areAnnotationChecker]: L48-4 has no Hoare annotation [2022-04-28 12:34:11,670 WARN L170 areAnnotationChecker]: L48-3 has no Hoare annotation [2022-04-28 12:34:11,671 WARN L170 areAnnotationChecker]: L48-3 has no Hoare annotation [2022-04-28 12:34:11,671 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 12:34:11,671 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-28 12:34:11,671 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-28 12:34:11,671 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2022-04-28 12:34:11,671 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2022-04-28 12:34:11,671 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-04-28 12:34:11,671 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-04-28 12:34:11,671 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-28 12:34:11,671 WARN L170 areAnnotationChecker]: L41-4 has no Hoare annotation [2022-04-28 12:34:11,671 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2022-04-28 12:34:11,671 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2022-04-28 12:34:11,671 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-28 12:34:11,671 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-28 12:34:11,671 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-04-28 12:34:11,672 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-04-28 12:34:11,672 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 12:34:11,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 12:34:11 BoogieIcfgContainer [2022-04-28 12:34:11,673 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 12:34:11,677 INFO L158 Benchmark]: Toolchain (without parser) took 333413.93ms. Allocated memory was 196.1MB in the beginning and 327.2MB in the end (delta: 131.1MB). Free memory was 139.6MB in the beginning and 165.9MB in the end (delta: -26.3MB). Peak memory consumption was 106.2MB. Max. memory is 8.0GB. [2022-04-28 12:34:11,677 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 196.1MB. Free memory is still 155.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 12:34:11,678 INFO L158 Benchmark]: CACSL2BoogieTranslator took 318.29ms. Allocated memory was 196.1MB in the beginning and 272.6MB in the end (delta: 76.5MB). Free memory was 139.4MB in the beginning and 244.7MB in the end (delta: -105.3MB). Peak memory consumption was 13.1MB. Max. memory is 8.0GB. [2022-04-28 12:34:11,678 INFO L158 Benchmark]: Boogie Preprocessor took 37.54ms. Allocated memory is still 272.6MB. Free memory was 244.7MB in the beginning and 243.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 12:34:11,682 INFO L158 Benchmark]: RCFGBuilder took 372.67ms. Allocated memory is still 272.6MB. Free memory was 243.2MB in the beginning and 228.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-04-28 12:34:11,683 INFO L158 Benchmark]: TraceAbstraction took 332678.55ms. Allocated memory was 272.6MB in the beginning and 327.2MB in the end (delta: 54.5MB). Free memory was 228.0MB in the beginning and 165.9MB in the end (delta: 62.1MB). Peak memory consumption was 117.6MB. Max. memory is 8.0GB. [2022-04-28 12:34:11,684 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 196.1MB. Free memory is still 155.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 318.29ms. Allocated memory was 196.1MB in the beginning and 272.6MB in the end (delta: 76.5MB). Free memory was 139.4MB in the beginning and 244.7MB in the end (delta: -105.3MB). Peak memory consumption was 13.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.54ms. Allocated memory is still 272.6MB. Free memory was 244.7MB in the beginning and 243.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 372.67ms. Allocated memory is still 272.6MB. Free memory was 243.2MB in the beginning and 228.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 332678.55ms. Allocated memory was 272.6MB in the beginning and 327.2MB in the end (delta: 54.5MB). Free memory was 228.0MB in the beginning and 165.9MB in the end (delta: 62.1MB). Peak memory consumption was 117.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L18] int counter = 0; [L20] int x, y; [L21] long long a, b, p, q, r, s; [L22] x = __VERIFIER_nondet_int() [L23] y = __VERIFIER_nondet_int() [L24] CALL assume_abort_if_not(x >= 1) [L8] COND FALSE !(!cond) [L24] RET assume_abort_if_not(x >= 1) [L25] CALL assume_abort_if_not(y >= 1) [L8] COND FALSE !(!cond) [L25] RET assume_abort_if_not(y >= 1) [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 [L34] EXPR counter++ [L34] COND TRUE counter++<10 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 [L41] EXPR counter++ [L41] COND TRUE counter++<10 [L42] COND TRUE !(c >= b) [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k [L34] EXPR counter++ [L34] COND TRUE counter++<10 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 [L41] EXPR counter++ [L41] COND TRUE counter++<10 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b [L48] EXPR counter++ [L48] COND TRUE counter++<10 [L49] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) [L49] RET __VERIFIER_assert(a == y * r + x * p) [L50] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(b == x * q + y * s) [L51] CALL __VERIFIER_assert(a == k * b + c) [L11] COND FALSE !(!(cond)) [L51] RET __VERIFIER_assert(a == k * b + c) [L52] CALL __VERIFIER_assert(v == b * d) [L11] COND FALSE !(!(cond)) [L52] RET __VERIFIER_assert(v == b * d) [L54] COND TRUE !(c >= 2 * v) [L59] c = c - v [L60] k = k + d [L41] EXPR counter++ [L41] COND TRUE counter++<10 [L42] COND TRUE !(c >= b) [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k [L34] EXPR counter++ [L34] COND TRUE counter++<10 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 [L41] EXPR counter++ [L41] COND TRUE counter++<10 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b [L48] EXPR counter++ [L48] COND TRUE counter++<10 [L49] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) [L49] RET __VERIFIER_assert(a == y * r + x * p) [L50] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(b == x * q + y * s) [L51] CALL __VERIFIER_assert(a == k * b + c) [L11] COND FALSE !(!(cond)) [L51] RET __VERIFIER_assert(a == k * b + c) [L52] CALL __VERIFIER_assert(v == b * d) [L11] COND FALSE !(!(cond)) [L52] RET __VERIFIER_assert(v == b * d) [L54] COND TRUE !(c >= 2 * v) [L59] c = c - v [L60] k = k + d [L41] EXPR counter++ [L41] COND TRUE counter++<10 [L42] COND TRUE !(c >= b) [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k [L34] EXPR counter++ [L34] COND FALSE !(counter++<10) [L73] CALL __VERIFIER_assert(p*x - q*x + r*y - s*y == a) [L11] COND TRUE !(cond) [L13] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 332.6s, OverallIterations: 35, TraceHistogramMax: 9, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 71.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2388 SdHoareTripleChecker+Valid, 9.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2274 mSDsluCounter, 8586 SdHoareTripleChecker+Invalid, 9.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6658 mSDsCounter, 1191 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6011 IncrementalHoareTripleChecker+Invalid, 7202 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1191 mSolverCounterUnsat, 1928 mSDtfsCounter, 6011 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3502 GetRequests, 3037 SyntacticMatches, 22 SemanticMatches, 443 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 938 ImplicationChecksByTransitivity, 6.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1160occurred in iteration=34, InterpolantAutomatonStates: 364, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 40.3s AutomataMinimizationTime, 34 MinimizatonAttempts, 848 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-28 12:34:11,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...