/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/cohendiv-ll_unwindbound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 11:23:56,603 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 11:23:56,617 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 11:23:56,655 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 11:23:56,655 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 11:23:56,656 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 11:23:56,657 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 11:23:56,658 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 11:23:56,661 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 11:23:56,664 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 11:23:56,664 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 11:23:56,667 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 11:23:56,667 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 11:23:56,669 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 11:23:56,670 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 11:23:56,671 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 11:23:56,672 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 11:23:56,672 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 11:23:56,677 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 11:23:56,681 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 11:23:56,683 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 11:23:56,683 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 11:23:56,684 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 11:23:56,686 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 11:23:56,688 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 11:23:56,691 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 11:23:56,691 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 11:23:56,691 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 11:23:56,692 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 11:23:56,692 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 11:23:56,692 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 11:23:56,692 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 11:23:56,693 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 11:23:56,693 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 11:23:56,694 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 11:23:56,694 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 11:23:56,694 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 11:23:56,694 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 11:23:56,695 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 11:23:56,695 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 11:23:56,695 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 11:23:56,699 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 11:23:56,699 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 11:23:56,707 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 11:23:56,708 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 11:23:56,708 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 11:23:56,708 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 11:23:56,708 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 11:23:56,709 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 11:23:56,709 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 11:23:56,709 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 11:23:56,709 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 11:23:56,709 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 11:23:56,709 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 11:23:56,710 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 11:23:56,710 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 11:23:56,710 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 11:23:56,710 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 11:23:56,710 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 11:23:56,710 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 11:23:56,710 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 11:23:56,710 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 11:23:56,710 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 11:23:56,710 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 11:23:56,710 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 11:23:56,710 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 11:23:56,890 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 11:23:56,908 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 11:23:56,910 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 11:23:56,911 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 11:23:56,919 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 11:23:56,919 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_unwindbound5.c [2022-04-28 11:23:56,956 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/491e68fc7/0f748f6337a1422fa74dd96c0b47d3b5/FLAG4ce1b1886 [2022-04-28 11:23:57,301 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 11:23:57,302 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_unwindbound5.c [2022-04-28 11:23:57,305 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/491e68fc7/0f748f6337a1422fa74dd96c0b47d3b5/FLAG4ce1b1886 [2022-04-28 11:23:57,735 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/491e68fc7/0f748f6337a1422fa74dd96c0b47d3b5 [2022-04-28 11:23:57,737 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 11:23:57,738 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 11:23:57,738 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 11:23:57,738 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 11:23:57,741 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 11:23:57,741 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 11:23:57" (1/1) ... [2022-04-28 11:23:57,743 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e06c078 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:23:57, skipping insertion in model container [2022-04-28 11:23:57,743 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 11:23:57" (1/1) ... [2022-04-28 11:23:57,747 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 11:23:57,756 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 11:23:57,860 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/cohendiv-ll_unwindbound5.c[576,589] [2022-04-28 11:23:57,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 11:23:57,878 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 11:23:57,888 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/cohendiv-ll_unwindbound5.c[576,589] [2022-04-28 11:23:57,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 11:23:57,906 INFO L208 MainTranslator]: Completed translation [2022-04-28 11:23:57,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:23:57 WrapperNode [2022-04-28 11:23:57,907 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 11:23:57,907 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 11:23:57,907 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 11:23:57,908 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 11:23:57,915 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:23:57" (1/1) ... [2022-04-28 11:23:57,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:23:57" (1/1) ... [2022-04-28 11:23:57,920 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:23:57" (1/1) ... [2022-04-28 11:23:57,920 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:23:57" (1/1) ... [2022-04-28 11:23:57,933 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:23:57" (1/1) ... [2022-04-28 11:23:57,938 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:23:57" (1/1) ... [2022-04-28 11:23:57,943 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:23:57" (1/1) ... [2022-04-28 11:23:57,946 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 11:23:57,947 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 11:23:57,947 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 11:23:57,947 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 11:23:57,948 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:23:57" (1/1) ... [2022-04-28 11:23:57,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 11:23:57,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:23:57,970 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 11:23:57,971 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 11:23:58,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 11:23:58,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 11:23:58,009 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 11:23:58,009 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 11:23:58,010 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 11:23:58,010 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 11:23:58,010 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 11:23:58,010 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 11:23:58,010 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 11:23:58,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 11:23:58,010 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 11:23:58,010 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 11:23:58,010 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 11:23:58,010 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 11:23:58,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 11:23:58,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 11:23:58,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 11:23:58,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 11:23:58,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 11:23:58,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 11:23:58,057 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 11:23:58,058 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 11:23:58,220 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 11:23:58,224 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 11:23:58,225 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 11:23:58,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 11:23:58 BoogieIcfgContainer [2022-04-28 11:23:58,226 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 11:23:58,227 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 11:23:58,227 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 11:23:58,241 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 11:23:58,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 11:23:57" (1/3) ... [2022-04-28 11:23:58,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3110b7d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 11:23:58, skipping insertion in model container [2022-04-28 11:23:58,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:23:57" (2/3) ... [2022-04-28 11:23:58,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3110b7d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 11:23:58, skipping insertion in model container [2022-04-28 11:23:58,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 11:23:58" (3/3) ... [2022-04-28 11:23:58,243 INFO L111 eAbstractionObserver]: Analyzing ICFG cohendiv-ll_unwindbound5.c [2022-04-28 11:23:58,252 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 11:23:58,252 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 11:23:58,319 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 11:23:58,323 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@5514fe22, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@50895839 [2022-04-28 11:23:58,323 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 11:23:58,333 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 11:23:58,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 11:23:58,338 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:23:58,338 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:23:58,339 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:23:58,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:23:58,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1588022502, now seen corresponding path program 1 times [2022-04-28 11:23:58,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:23:58,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [634084125] [2022-04-28 11:23:58,356 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:23:58,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1588022502, now seen corresponding path program 2 times [2022-04-28 11:23:58,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:23:58,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857929991] [2022-04-28 11:23:58,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:23:58,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:23:58,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:23:58,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 11:23:58,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:23:58,540 INFO L290 TraceCheckUtils]: 0: Hoare triple {50#(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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {41#true} is VALID [2022-04-28 11:23:58,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume true; {41#true} is VALID [2022-04-28 11:23:58,541 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41#true} {41#true} #93#return; {41#true} is VALID [2022-04-28 11:23:58,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 11:23:58,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:23:58,547 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-28 11:23:58,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-28 11:23:58,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-28 11:23:58,548 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {41#true} #77#return; {42#false} is VALID [2022-04-28 11:23:58,549 INFO L272 TraceCheckUtils]: 0: Hoare triple {41#true} call ULTIMATE.init(); {50#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 11:23:58,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {50#(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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {41#true} is VALID [2022-04-28 11:23:58,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#true} assume true; {41#true} is VALID [2022-04-28 11:23:58,550 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#true} {41#true} #93#return; {41#true} is VALID [2022-04-28 11:23:58,550 INFO L272 TraceCheckUtils]: 4: Hoare triple {41#true} call #t~ret8 := main(); {41#true} is VALID [2022-04-28 11:23:58,550 INFO L290 TraceCheckUtils]: 5: Hoare triple {41#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {41#true} is VALID [2022-04-28 11:23:58,550 INFO L272 TraceCheckUtils]: 6: Hoare triple {41#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {41#true} is VALID [2022-04-28 11:23:58,550 INFO L290 TraceCheckUtils]: 7: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-28 11:23:58,554 INFO L290 TraceCheckUtils]: 8: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-28 11:23:58,554 INFO L290 TraceCheckUtils]: 9: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-28 11:23:58,554 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {42#false} {41#true} #77#return; {42#false} is VALID [2022-04-28 11:23:58,554 INFO L290 TraceCheckUtils]: 11: Hoare triple {42#false} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {42#false} is VALID [2022-04-28 11:23:58,554 INFO L290 TraceCheckUtils]: 12: Hoare triple {42#false} assume !true; {42#false} is VALID [2022-04-28 11:23:58,554 INFO L272 TraceCheckUtils]: 13: Hoare triple {42#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {42#false} is VALID [2022-04-28 11:23:58,555 INFO L290 TraceCheckUtils]: 14: Hoare triple {42#false} ~cond := #in~cond; {42#false} is VALID [2022-04-28 11:23:58,555 INFO L290 TraceCheckUtils]: 15: Hoare triple {42#false} assume 0 == ~cond; {42#false} is VALID [2022-04-28 11:23:58,555 INFO L290 TraceCheckUtils]: 16: Hoare triple {42#false} assume !false; {42#false} is VALID [2022-04-28 11:23:58,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 11:23:58,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:23:58,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857929991] [2022-04-28 11:23:58,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857929991] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:23:58,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:23:58,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 11:23:58,558 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:23:58,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [634084125] [2022-04-28 11:23:58,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [634084125] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:23:58,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:23:58,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 11:23:58,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556351601] [2022-04-28 11:23:58,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:23:58,562 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 11:23:58,564 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:23:58,565 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:23:58,586 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:23:58,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 11:23:58,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:23:58,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 11:23:58,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 11:23:58,610 INFO L87 Difference]: Start difference. First operand has 38 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:23:58,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:23:58,790 INFO L93 Difference]: Finished difference Result 68 states and 101 transitions. [2022-04-28 11:23:58,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 11:23:58,790 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 11:23:58,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:23:58,791 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:23:58,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-28 11:23:58,803 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:23:58,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-28 11:23:58,807 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 101 transitions. [2022-04-28 11:23:58,894 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:23:58,902 INFO L225 Difference]: With dead ends: 68 [2022-04-28 11:23:58,902 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 11:23:58,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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 11:23:58,908 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:23:58,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 49 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:23:58,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 11:23:58,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-04-28 11:23:58,931 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:23:58,932 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 11:23:58,933 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 11:23:58,933 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 11:23:58,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:23:58,936 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-28 11:23:58,936 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-28 11:23:58,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:23:58,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:23:58,937 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 34 states. [2022-04-28 11:23:58,937 INFO L87 Difference]: Start difference. First operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 34 states. [2022-04-28 11:23:58,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:23:58,940 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-28 11:23:58,940 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-28 11:23:58,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:23:58,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:23:58,941 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:23:58,941 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:23:58,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 11:23:58,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2022-04-28 11:23:58,944 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 17 [2022-04-28 11:23:58,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:23:58,944 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2022-04-28 11:23:58,945 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:23:58,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 42 transitions. [2022-04-28 11:23:58,975 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:23:58,975 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2022-04-28 11:23:58,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 11:23:58,976 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:23:58,976 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:23:58,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 11:23:58,976 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:23:58,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:23:58,977 INFO L85 PathProgramCache]: Analyzing trace with hash 766070672, now seen corresponding path program 1 times [2022-04-28 11:23:58,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:23:58,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2120994115] [2022-04-28 11:23:58,977 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:23:58,977 INFO L85 PathProgramCache]: Analyzing trace with hash 766070672, now seen corresponding path program 2 times [2022-04-28 11:23:58,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:23:58,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803557993] [2022-04-28 11:23:58,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:23:58,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:23:59,010 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:23:59,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1319841016] [2022-04-28 11:23:59,011 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:23:59,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:23:59,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:23:59,027 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 11:23:59,028 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 11:23:59,087 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 11:23:59,087 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:23:59,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 11:23:59,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:23:59,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:23:59,244 INFO L272 TraceCheckUtils]: 0: Hoare triple {323#true} call ULTIMATE.init(); {323#true} is VALID [2022-04-28 11:23:59,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {323#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {331#(<= ~counter~0 0)} is VALID [2022-04-28 11:23:59,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {331#(<= ~counter~0 0)} assume true; {331#(<= ~counter~0 0)} is VALID [2022-04-28 11:23:59,246 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {331#(<= ~counter~0 0)} {323#true} #93#return; {331#(<= ~counter~0 0)} is VALID [2022-04-28 11:23:59,246 INFO L272 TraceCheckUtils]: 4: Hoare triple {331#(<= ~counter~0 0)} call #t~ret8 := main(); {331#(<= ~counter~0 0)} is VALID [2022-04-28 11:23:59,247 INFO L290 TraceCheckUtils]: 5: Hoare triple {331#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {331#(<= ~counter~0 0)} is VALID [2022-04-28 11:23:59,247 INFO L272 TraceCheckUtils]: 6: Hoare triple {331#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {331#(<= ~counter~0 0)} is VALID [2022-04-28 11:23:59,248 INFO L290 TraceCheckUtils]: 7: Hoare triple {331#(<= ~counter~0 0)} ~cond := #in~cond; {331#(<= ~counter~0 0)} is VALID [2022-04-28 11:23:59,248 INFO L290 TraceCheckUtils]: 8: Hoare triple {331#(<= ~counter~0 0)} assume !(0 == ~cond); {331#(<= ~counter~0 0)} is VALID [2022-04-28 11:23:59,248 INFO L290 TraceCheckUtils]: 9: Hoare triple {331#(<= ~counter~0 0)} assume true; {331#(<= ~counter~0 0)} is VALID [2022-04-28 11:23:59,260 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {331#(<= ~counter~0 0)} {331#(<= ~counter~0 0)} #77#return; {331#(<= ~counter~0 0)} is VALID [2022-04-28 11:23:59,260 INFO L290 TraceCheckUtils]: 11: Hoare triple {331#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {331#(<= ~counter~0 0)} is VALID [2022-04-28 11:23:59,261 INFO L290 TraceCheckUtils]: 12: Hoare triple {331#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {365#(<= |main_#t~post6| 0)} is VALID [2022-04-28 11:23:59,261 INFO L290 TraceCheckUtils]: 13: Hoare triple {365#(<= |main_#t~post6| 0)} assume !(#t~post6 < 5);havoc #t~post6; {324#false} is VALID [2022-04-28 11:23:59,261 INFO L272 TraceCheckUtils]: 14: Hoare triple {324#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {324#false} is VALID [2022-04-28 11:23:59,262 INFO L290 TraceCheckUtils]: 15: Hoare triple {324#false} ~cond := #in~cond; {324#false} is VALID [2022-04-28 11:23:59,262 INFO L290 TraceCheckUtils]: 16: Hoare triple {324#false} assume 0 == ~cond; {324#false} is VALID [2022-04-28 11:23:59,262 INFO L290 TraceCheckUtils]: 17: Hoare triple {324#false} assume !false; {324#false} is VALID [2022-04-28 11:23:59,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 11:23:59,262 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:23:59,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:23:59,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803557993] [2022-04-28 11:23:59,263 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:23:59,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319841016] [2022-04-28 11:23:59,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319841016] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:23:59,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:23:59,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 11:23:59,264 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:23:59,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2120994115] [2022-04-28 11:23:59,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2120994115] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:23:59,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:23:59,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 11:23:59,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014691628] [2022-04-28 11:23:59,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:23:59,265 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-28 11:23:59,265 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:23:59,265 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 11:23:59,279 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:23:59,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 11:23:59,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:23:59,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 11:23:59,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 11:23:59,280 INFO L87 Difference]: Start difference. First operand 33 states and 42 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 11:23:59,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:23:59,368 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-28 11:23:59,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 11:23:59,368 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-28 11:23:59,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:23:59,369 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 11:23:59,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-04-28 11:23:59,373 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 11:23:59,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-04-28 11:23:59,377 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 51 transitions. [2022-04-28 11:23:59,416 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 11:23:59,419 INFO L225 Difference]: With dead ends: 42 [2022-04-28 11:23:59,419 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 11:23:59,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 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 11:23:59,421 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:23:59,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:23:59,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 11:23:59,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-28 11:23:59,437 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:23:59,438 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 11:23:59,438 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 11:23:59,438 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 11:23:59,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:23:59,440 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-28 11:23:59,440 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-28 11:23:59,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:23:59,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:23:59,443 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 35 states. [2022-04-28 11:23:59,443 INFO L87 Difference]: Start difference. First operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 35 states. [2022-04-28 11:23:59,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:23:59,445 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-28 11:23:59,445 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-28 11:23:59,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:23:59,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:23:59,446 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:23:59,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:23:59,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 11:23:59,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2022-04-28 11:23:59,453 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 18 [2022-04-28 11:23:59,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:23:59,453 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2022-04-28 11:23:59,453 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, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 11:23:59,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 44 transitions. [2022-04-28 11:23:59,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:23:59,499 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-28 11:23:59,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 11:23:59,502 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:23:59,503 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:23:59,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 11:23:59,719 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 11:23:59,719 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:23:59,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:23:59,720 INFO L85 PathProgramCache]: Analyzing trace with hash 767560222, now seen corresponding path program 1 times [2022-04-28 11:23:59,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:23:59,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [49243857] [2022-04-28 11:23:59,721 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:23:59,721 INFO L85 PathProgramCache]: Analyzing trace with hash 767560222, now seen corresponding path program 2 times [2022-04-28 11:23:59,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:23:59,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386405389] [2022-04-28 11:23:59,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:23:59,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:23:59,740 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:23:59,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [600480254] [2022-04-28 11:23:59,740 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:23:59,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:23:59,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:23:59,746 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 11:23:59,769 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 11:23:59,791 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 11:23:59,792 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:23:59,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 11:23:59,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:23:59,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:24:03,635 INFO L272 TraceCheckUtils]: 0: Hoare triple {604#true} call ULTIMATE.init(); {604#true} is VALID [2022-04-28 11:24:03,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {604#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {604#true} is VALID [2022-04-28 11:24:03,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {604#true} assume true; {604#true} is VALID [2022-04-28 11:24:03,636 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {604#true} {604#true} #93#return; {604#true} is VALID [2022-04-28 11:24:03,636 INFO L272 TraceCheckUtils]: 4: Hoare triple {604#true} call #t~ret8 := main(); {604#true} is VALID [2022-04-28 11:24:03,636 INFO L290 TraceCheckUtils]: 5: Hoare triple {604#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {604#true} is VALID [2022-04-28 11:24:03,636 INFO L272 TraceCheckUtils]: 6: Hoare triple {604#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {604#true} is VALID [2022-04-28 11:24:03,636 INFO L290 TraceCheckUtils]: 7: Hoare triple {604#true} ~cond := #in~cond; {604#true} is VALID [2022-04-28 11:24:03,636 INFO L290 TraceCheckUtils]: 8: Hoare triple {604#true} assume !(0 == ~cond); {604#true} is VALID [2022-04-28 11:24:03,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {604#true} assume true; {604#true} is VALID [2022-04-28 11:24:03,637 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {604#true} {604#true} #77#return; {604#true} is VALID [2022-04-28 11:24:03,637 INFO L290 TraceCheckUtils]: 11: Hoare triple {604#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {642#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-28 11:24:03,638 INFO L290 TraceCheckUtils]: 12: Hoare triple {642#(and (= main_~a~0 0) (= main_~b~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {642#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-28 11:24:03,638 INFO L290 TraceCheckUtils]: 13: Hoare triple {642#(and (= main_~a~0 0) (= main_~b~0 0))} assume !!(#t~post6 < 5);havoc #t~post6; {642#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-28 11:24:03,639 INFO L272 TraceCheckUtils]: 14: Hoare triple {642#(and (= main_~a~0 0) (= main_~b~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {652#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:24:03,639 INFO L290 TraceCheckUtils]: 15: Hoare triple {652#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {656#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:24:03,640 INFO L290 TraceCheckUtils]: 16: Hoare triple {656#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {605#false} is VALID [2022-04-28 11:24:03,640 INFO L290 TraceCheckUtils]: 17: Hoare triple {605#false} assume !false; {605#false} is VALID [2022-04-28 11:24:03,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 11:24:03,640 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:24:03,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:24:03,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386405389] [2022-04-28 11:24:03,641 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:24:03,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600480254] [2022-04-28 11:24:03,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600480254] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:24:03,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:24:03,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:24:03,641 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:24:03,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [49243857] [2022-04-28 11:24:03,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [49243857] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:24:03,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:24:03,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:24:03,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144072796] [2022-04-28 11:24:03,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:24:03,642 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-28 11:24:03,642 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:24:03,643 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:24:03,655 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:03,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:24:03,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:24:03,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:24:03,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:24:03,656 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:24:03,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:03,804 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-28 11:24:03,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:24:03,804 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-28 11:24:03,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:24:03,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:24:03,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-04-28 11:24:03,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:24:03,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-04-28 11:24:03,807 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 56 transitions. [2022-04-28 11:24:03,846 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 11:24:03,848 INFO L225 Difference]: With dead ends: 45 [2022-04-28 11:24:03,848 INFO L226 Difference]: Without dead ends: 43 [2022-04-28 11:24:03,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 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 11:24:03,849 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:24:03,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 145 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:24:03,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-28 11:24:03,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2022-04-28 11:24:03,868 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:24:03,868 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 11:24:03,868 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 11:24:03,869 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 11:24:03,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:03,870 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-04-28 11:24:03,871 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-04-28 11:24:03,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:24:03,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:24:03,871 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 43 states. [2022-04-28 11:24:03,872 INFO L87 Difference]: Start difference. First operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 43 states. [2022-04-28 11:24:03,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:03,873 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-04-28 11:24:03,873 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-04-28 11:24:03,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:24:03,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:24:03,874 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:24:03,874 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:24:03,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 11:24:03,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2022-04-28 11:24:03,875 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 18 [2022-04-28 11:24:03,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:24:03,875 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2022-04-28 11:24:03,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:24:03,876 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 49 transitions. [2022-04-28 11:24:03,908 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 11:24:03,909 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-04-28 11:24:03,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 11:24:03,909 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:24:03,909 INFO L195 NwaCegarLoop]: trace histogram [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 11:24:03,925 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 11:24:04,111 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 11:24:04,112 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:24:04,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:24:04,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1016228092, now seen corresponding path program 1 times [2022-04-28 11:24:04,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:24:04,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [161952759] [2022-04-28 11:24:04,113 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:24:04,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1016228092, now seen corresponding path program 2 times [2022-04-28 11:24:04,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:24:04,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408722991] [2022-04-28 11:24:04,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:24:04,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:24:04,123 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:24:04,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1629100719] [2022-04-28 11:24:04,123 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:24:04,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:24:04,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:24:04,124 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 11:24:04,125 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 11:24:04,157 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:24:04,158 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:24:04,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 11:24:04,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:24:04,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:24:08,297 INFO L272 TraceCheckUtils]: 0: Hoare triple {920#true} call ULTIMATE.init(); {920#true} is VALID [2022-04-28 11:24:08,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {920#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {920#true} is VALID [2022-04-28 11:24:08,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {920#true} assume true; {920#true} is VALID [2022-04-28 11:24:08,297 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {920#true} {920#true} #93#return; {920#true} is VALID [2022-04-28 11:24:08,297 INFO L272 TraceCheckUtils]: 4: Hoare triple {920#true} call #t~ret8 := main(); {920#true} is VALID [2022-04-28 11:24:08,298 INFO L290 TraceCheckUtils]: 5: Hoare triple {920#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {920#true} is VALID [2022-04-28 11:24:08,298 INFO L272 TraceCheckUtils]: 6: Hoare triple {920#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {920#true} is VALID [2022-04-28 11:24:08,298 INFO L290 TraceCheckUtils]: 7: Hoare triple {920#true} ~cond := #in~cond; {920#true} is VALID [2022-04-28 11:24:08,298 INFO L290 TraceCheckUtils]: 8: Hoare triple {920#true} assume !(0 == ~cond); {920#true} is VALID [2022-04-28 11:24:08,298 INFO L290 TraceCheckUtils]: 9: Hoare triple {920#true} assume true; {920#true} is VALID [2022-04-28 11:24:08,298 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {920#true} {920#true} #77#return; {920#true} is VALID [2022-04-28 11:24:08,299 INFO L290 TraceCheckUtils]: 11: Hoare triple {920#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:24:08,299 INFO L290 TraceCheckUtils]: 12: Hoare triple {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:24:08,302 INFO L290 TraceCheckUtils]: 13: Hoare triple {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 5);havoc #t~post6; {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:24:08,303 INFO L272 TraceCheckUtils]: 14: Hoare triple {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {920#true} is VALID [2022-04-28 11:24:08,303 INFO L290 TraceCheckUtils]: 15: Hoare triple {920#true} ~cond := #in~cond; {920#true} is VALID [2022-04-28 11:24:08,303 INFO L290 TraceCheckUtils]: 16: Hoare triple {920#true} assume !(0 == ~cond); {920#true} is VALID [2022-04-28 11:24:08,303 INFO L290 TraceCheckUtils]: 17: Hoare triple {920#true} assume true; {920#true} is VALID [2022-04-28 11:24:08,304 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {920#true} {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #79#return; {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:24:08,304 INFO L272 TraceCheckUtils]: 19: Hoare triple {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {983#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:24:08,305 INFO L290 TraceCheckUtils]: 20: Hoare triple {983#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {987#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:24:08,305 INFO L290 TraceCheckUtils]: 21: Hoare triple {987#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {921#false} is VALID [2022-04-28 11:24:08,305 INFO L290 TraceCheckUtils]: 22: Hoare triple {921#false} assume !false; {921#false} is VALID [2022-04-28 11:24:08,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 11:24:08,305 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:24:08,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:24:08,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408722991] [2022-04-28 11:24:08,306 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:24:08,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629100719] [2022-04-28 11:24:08,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629100719] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:24:08,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:24:08,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:24:08,306 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:24:08,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [161952759] [2022-04-28 11:24:08,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [161952759] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:24:08,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:24:08,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:24:08,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090448660] [2022-04-28 11:24:08,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:24:08,307 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-28 11:24:08,307 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:24:08,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:24:08,322 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:08,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:24:08,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:24:08,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:24:08,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:24:08,322 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:24:08,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:08,497 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2022-04-28 11:24:08,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:24:08,497 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-28 11:24:08,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:24:08,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:24:08,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-28 11:24:08,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:24:08,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-28 11:24:08,500 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 71 transitions. [2022-04-28 11:24:08,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:08,552 INFO L225 Difference]: With dead ends: 58 [2022-04-28 11:24:08,552 INFO L226 Difference]: Without dead ends: 55 [2022-04-28 11:24:08,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 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 11:24:08,553 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 13 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:24:08,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 139 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:24:08,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-28 11:24:08,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2022-04-28 11:24:08,583 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:24:08,584 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 11:24:08,584 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 11:24:08,584 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 11:24:08,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:08,586 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-28 11:24:08,586 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-28 11:24:08,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:24:08,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:24:08,587 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 55 states. [2022-04-28 11:24:08,587 INFO L87 Difference]: Start difference. First operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 55 states. [2022-04-28 11:24:08,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:08,589 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-28 11:24:08,589 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-28 11:24:08,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:24:08,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:24:08,590 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:24:08,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:24:08,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 11:24:08,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2022-04-28 11:24:08,591 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 23 [2022-04-28 11:24:08,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:24:08,592 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2022-04-28 11:24:08,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 11:24:08,592 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 69 transitions. [2022-04-28 11:24:08,651 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:08,651 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2022-04-28 11:24:08,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 11:24:08,653 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:24:08,653 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:24:08,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-28 11:24:08,859 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 11:24:08,860 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:24:08,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:24:08,860 INFO L85 PathProgramCache]: Analyzing trace with hash 2019703110, now seen corresponding path program 1 times [2022-04-28 11:24:08,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:24:08,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1273683277] [2022-04-28 11:24:08,861 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:24:08,861 INFO L85 PathProgramCache]: Analyzing trace with hash 2019703110, now seen corresponding path program 2 times [2022-04-28 11:24:08,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:24:08,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991627146] [2022-04-28 11:24:08,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:24:08,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:24:08,885 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:24:08,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1763316344] [2022-04-28 11:24:08,886 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:24:08,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:24:08,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:24:08,892 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 11:24:08,894 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 11:24:08,931 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:24:08,931 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:24:08,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 11:24:08,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:24:08,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:24:09,029 INFO L272 TraceCheckUtils]: 0: Hoare triple {1329#true} call ULTIMATE.init(); {1329#true} is VALID [2022-04-28 11:24:09,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {1329#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1329#true} is VALID [2022-04-28 11:24:09,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {1329#true} assume true; {1329#true} is VALID [2022-04-28 11:24:09,030 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1329#true} {1329#true} #93#return; {1329#true} is VALID [2022-04-28 11:24:09,030 INFO L272 TraceCheckUtils]: 4: Hoare triple {1329#true} call #t~ret8 := main(); {1329#true} is VALID [2022-04-28 11:24:09,030 INFO L290 TraceCheckUtils]: 5: Hoare triple {1329#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {1329#true} is VALID [2022-04-28 11:24:09,030 INFO L272 TraceCheckUtils]: 6: Hoare triple {1329#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1329#true} is VALID [2022-04-28 11:24:09,030 INFO L290 TraceCheckUtils]: 7: Hoare triple {1329#true} ~cond := #in~cond; {1329#true} is VALID [2022-04-28 11:24:09,030 INFO L290 TraceCheckUtils]: 8: Hoare triple {1329#true} assume !(0 == ~cond); {1329#true} is VALID [2022-04-28 11:24:09,030 INFO L290 TraceCheckUtils]: 9: Hoare triple {1329#true} assume true; {1329#true} is VALID [2022-04-28 11:24:09,031 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1329#true} {1329#true} #77#return; {1329#true} is VALID [2022-04-28 11:24:09,031 INFO L290 TraceCheckUtils]: 11: Hoare triple {1329#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {1329#true} is VALID [2022-04-28 11:24:09,031 INFO L290 TraceCheckUtils]: 12: Hoare triple {1329#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1329#true} is VALID [2022-04-28 11:24:09,031 INFO L290 TraceCheckUtils]: 13: Hoare triple {1329#true} assume !!(#t~post6 < 5);havoc #t~post6; {1329#true} is VALID [2022-04-28 11:24:09,031 INFO L272 TraceCheckUtils]: 14: Hoare triple {1329#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1329#true} is VALID [2022-04-28 11:24:09,031 INFO L290 TraceCheckUtils]: 15: Hoare triple {1329#true} ~cond := #in~cond; {1329#true} is VALID [2022-04-28 11:24:09,031 INFO L290 TraceCheckUtils]: 16: Hoare triple {1329#true} assume !(0 == ~cond); {1329#true} is VALID [2022-04-28 11:24:09,031 INFO L290 TraceCheckUtils]: 17: Hoare triple {1329#true} assume true; {1329#true} is VALID [2022-04-28 11:24:09,031 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1329#true} {1329#true} #79#return; {1329#true} is VALID [2022-04-28 11:24:09,031 INFO L272 TraceCheckUtils]: 19: Hoare triple {1329#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {1329#true} is VALID [2022-04-28 11:24:09,032 INFO L290 TraceCheckUtils]: 20: Hoare triple {1329#true} ~cond := #in~cond; {1329#true} is VALID [2022-04-28 11:24:09,032 INFO L290 TraceCheckUtils]: 21: Hoare triple {1329#true} assume !(0 == ~cond); {1329#true} is VALID [2022-04-28 11:24:09,032 INFO L290 TraceCheckUtils]: 22: Hoare triple {1329#true} assume true; {1329#true} is VALID [2022-04-28 11:24:09,032 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1329#true} {1329#true} #81#return; {1329#true} is VALID [2022-04-28 11:24:09,033 INFO L290 TraceCheckUtils]: 24: Hoare triple {1329#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {1406#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} is VALID [2022-04-28 11:24:09,034 INFO L290 TraceCheckUtils]: 25: Hoare triple {1406#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1406#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} is VALID [2022-04-28 11:24:09,034 INFO L290 TraceCheckUtils]: 26: Hoare triple {1406#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} assume !!(#t~post7 < 5);havoc #t~post7; {1406#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} is VALID [2022-04-28 11:24:09,035 INFO L272 TraceCheckUtils]: 27: Hoare triple {1406#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1416#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:24:09,035 INFO L290 TraceCheckUtils]: 28: Hoare triple {1416#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1420#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:24:09,036 INFO L290 TraceCheckUtils]: 29: Hoare triple {1420#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1330#false} is VALID [2022-04-28 11:24:09,036 INFO L290 TraceCheckUtils]: 30: Hoare triple {1330#false} assume !false; {1330#false} is VALID [2022-04-28 11:24:09,036 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 11:24:09,036 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:24:09,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:24:09,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991627146] [2022-04-28 11:24:09,036 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:24:09,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763316344] [2022-04-28 11:24:09,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763316344] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:24:09,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:24:09,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:24:09,037 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:24:09,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1273683277] [2022-04-28 11:24:09,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1273683277] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:24:09,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:24:09,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:24:09,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601930379] [2022-04-28 11:24:09,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:24:09,037 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), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2022-04-28 11:24:09,038 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:24:09,038 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), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 11:24:09,070 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:09,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:24:09,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:24:09,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:24:09,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:24:09,071 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 11:24:09,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:09,291 INFO L93 Difference]: Finished difference Result 83 states and 113 transitions. [2022-04-28 11:24:09,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:24:09,291 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), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2022-04-28 11:24:09,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:24:09,292 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), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 11:24:09,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-04-28 11:24:09,293 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), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 11:24:09,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-04-28 11:24:09,294 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 72 transitions. [2022-04-28 11:24:09,343 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 11:24:09,346 INFO L225 Difference]: With dead ends: 83 [2022-04-28 11:24:09,347 INFO L226 Difference]: Without dead ends: 81 [2022-04-28 11:24:09,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 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 11:24:09,348 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 13 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:24:09,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 145 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:24:09,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-28 11:24:09,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2022-04-28 11:24:09,369 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:24:09,369 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 74 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 46 states have internal predecessors, (56), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:24:09,369 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 74 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 46 states have internal predecessors, (56), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:24:09,371 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 74 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 46 states have internal predecessors, (56), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:24:09,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:09,381 INFO L93 Difference]: Finished difference Result 81 states and 111 transitions. [2022-04-28 11:24:09,381 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 111 transitions. [2022-04-28 11:24:09,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:24:09,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:24:09,382 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 46 states have internal predecessors, (56), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 81 states. [2022-04-28 11:24:09,383 INFO L87 Difference]: Start difference. First operand has 74 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 46 states have internal predecessors, (56), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 81 states. [2022-04-28 11:24:09,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:09,389 INFO L93 Difference]: Finished difference Result 81 states and 111 transitions. [2022-04-28 11:24:09,389 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 111 transitions. [2022-04-28 11:24:09,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:24:09,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:24:09,391 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:24:09,391 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:24:09,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 46 states have internal predecessors, (56), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:24:09,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 100 transitions. [2022-04-28 11:24:09,393 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 100 transitions. Word has length 31 [2022-04-28 11:24:09,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:24:09,394 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 100 transitions. [2022-04-28 11:24:09,394 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), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 11:24:09,394 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 100 transitions. [2022-04-28 11:24:09,469 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:09,469 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 100 transitions. [2022-04-28 11:24:09,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 11:24:09,470 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:24:09,470 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-04-28 11:24:09,489 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 11:24:09,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 11:24:09,683 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:24:09,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:24:09,684 INFO L85 PathProgramCache]: Analyzing trace with hash 202176206, now seen corresponding path program 1 times [2022-04-28 11:24:09,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:24:09,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [615859848] [2022-04-28 11:24:15,519 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:24:15,519 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:24:15,519 INFO L85 PathProgramCache]: Analyzing trace with hash 202176206, now seen corresponding path program 2 times [2022-04-28 11:24:15,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:24:15,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481499483] [2022-04-28 11:24:15,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:24:15,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:24:15,531 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:24:15,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [981422980] [2022-04-28 11:24:15,531 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:24:15,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:24:15,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:24:15,532 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 11:24:15,533 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 11:24:15,566 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:24:15,566 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:24:15,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 11:24:15,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:24:15,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:24:15,725 INFO L272 TraceCheckUtils]: 0: Hoare triple {1904#true} call ULTIMATE.init(); {1904#true} is VALID [2022-04-28 11:24:15,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {1904#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1912#(<= ~counter~0 0)} is VALID [2022-04-28 11:24:15,727 INFO L290 TraceCheckUtils]: 2: Hoare triple {1912#(<= ~counter~0 0)} assume true; {1912#(<= ~counter~0 0)} is VALID [2022-04-28 11:24:15,727 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1912#(<= ~counter~0 0)} {1904#true} #93#return; {1912#(<= ~counter~0 0)} is VALID [2022-04-28 11:24:15,728 INFO L272 TraceCheckUtils]: 4: Hoare triple {1912#(<= ~counter~0 0)} call #t~ret8 := main(); {1912#(<= ~counter~0 0)} is VALID [2022-04-28 11:24:15,729 INFO L290 TraceCheckUtils]: 5: Hoare triple {1912#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {1912#(<= ~counter~0 0)} is VALID [2022-04-28 11:24:15,738 INFO L272 TraceCheckUtils]: 6: Hoare triple {1912#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1912#(<= ~counter~0 0)} is VALID [2022-04-28 11:24:15,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {1912#(<= ~counter~0 0)} ~cond := #in~cond; {1912#(<= ~counter~0 0)} is VALID [2022-04-28 11:24:15,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {1912#(<= ~counter~0 0)} assume !(0 == ~cond); {1912#(<= ~counter~0 0)} is VALID [2022-04-28 11:24:15,755 INFO L290 TraceCheckUtils]: 9: Hoare triple {1912#(<= ~counter~0 0)} assume true; {1912#(<= ~counter~0 0)} is VALID [2022-04-28 11:24:15,756 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1912#(<= ~counter~0 0)} {1912#(<= ~counter~0 0)} #77#return; {1912#(<= ~counter~0 0)} is VALID [2022-04-28 11:24:15,756 INFO L290 TraceCheckUtils]: 11: Hoare triple {1912#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {1912#(<= ~counter~0 0)} is VALID [2022-04-28 11:24:15,756 INFO L290 TraceCheckUtils]: 12: Hoare triple {1912#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1946#(<= ~counter~0 1)} is VALID [2022-04-28 11:24:15,757 INFO L290 TraceCheckUtils]: 13: Hoare triple {1946#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {1946#(<= ~counter~0 1)} is VALID [2022-04-28 11:24:15,757 INFO L272 TraceCheckUtils]: 14: Hoare triple {1946#(<= ~counter~0 1)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1946#(<= ~counter~0 1)} is VALID [2022-04-28 11:24:15,757 INFO L290 TraceCheckUtils]: 15: Hoare triple {1946#(<= ~counter~0 1)} ~cond := #in~cond; {1946#(<= ~counter~0 1)} is VALID [2022-04-28 11:24:15,758 INFO L290 TraceCheckUtils]: 16: Hoare triple {1946#(<= ~counter~0 1)} assume !(0 == ~cond); {1946#(<= ~counter~0 1)} is VALID [2022-04-28 11:24:15,758 INFO L290 TraceCheckUtils]: 17: Hoare triple {1946#(<= ~counter~0 1)} assume true; {1946#(<= ~counter~0 1)} is VALID [2022-04-28 11:24:15,758 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1946#(<= ~counter~0 1)} {1946#(<= ~counter~0 1)} #79#return; {1946#(<= ~counter~0 1)} is VALID [2022-04-28 11:24:15,759 INFO L272 TraceCheckUtils]: 19: Hoare triple {1946#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {1946#(<= ~counter~0 1)} is VALID [2022-04-28 11:24:15,759 INFO L290 TraceCheckUtils]: 20: Hoare triple {1946#(<= ~counter~0 1)} ~cond := #in~cond; {1946#(<= ~counter~0 1)} is VALID [2022-04-28 11:24:15,759 INFO L290 TraceCheckUtils]: 21: Hoare triple {1946#(<= ~counter~0 1)} assume !(0 == ~cond); {1946#(<= ~counter~0 1)} is VALID [2022-04-28 11:24:15,760 INFO L290 TraceCheckUtils]: 22: Hoare triple {1946#(<= ~counter~0 1)} assume true; {1946#(<= ~counter~0 1)} is VALID [2022-04-28 11:24:15,760 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1946#(<= ~counter~0 1)} {1946#(<= ~counter~0 1)} #81#return; {1946#(<= ~counter~0 1)} is VALID [2022-04-28 11:24:15,760 INFO L290 TraceCheckUtils]: 24: Hoare triple {1946#(<= ~counter~0 1)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {1946#(<= ~counter~0 1)} is VALID [2022-04-28 11:24:15,761 INFO L290 TraceCheckUtils]: 25: Hoare triple {1946#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1986#(<= |main_#t~post7| 1)} is VALID [2022-04-28 11:24:15,761 INFO L290 TraceCheckUtils]: 26: Hoare triple {1986#(<= |main_#t~post7| 1)} assume !(#t~post7 < 5);havoc #t~post7; {1905#false} is VALID [2022-04-28 11:24:15,761 INFO L290 TraceCheckUtils]: 27: Hoare triple {1905#false} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {1905#false} is VALID [2022-04-28 11:24:15,761 INFO L290 TraceCheckUtils]: 28: Hoare triple {1905#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1905#false} is VALID [2022-04-28 11:24:15,761 INFO L290 TraceCheckUtils]: 29: Hoare triple {1905#false} assume !(#t~post6 < 5);havoc #t~post6; {1905#false} is VALID [2022-04-28 11:24:15,761 INFO L272 TraceCheckUtils]: 30: Hoare triple {1905#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {1905#false} is VALID [2022-04-28 11:24:15,762 INFO L290 TraceCheckUtils]: 31: Hoare triple {1905#false} ~cond := #in~cond; {1905#false} is VALID [2022-04-28 11:24:15,762 INFO L290 TraceCheckUtils]: 32: Hoare triple {1905#false} assume 0 == ~cond; {1905#false} is VALID [2022-04-28 11:24:15,762 INFO L290 TraceCheckUtils]: 33: Hoare triple {1905#false} assume !false; {1905#false} is VALID [2022-04-28 11:24:15,762 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 11:24:15,762 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:24:15,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:24:15,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481499483] [2022-04-28 11:24:15,762 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:24:15,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981422980] [2022-04-28 11:24:15,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981422980] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:24:15,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:24:15,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:24:15,763 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:24:15,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [615859848] [2022-04-28 11:24:15,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [615859848] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:24:15,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:24:15,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:24:15,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847671457] [2022-04-28 11:24:15,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:24:15,763 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), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 34 [2022-04-28 11:24:15,763 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:24:15,763 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), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 11:24:15,779 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 11:24:15,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:24:15,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:24:15,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:24:15,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:24:15,780 INFO L87 Difference]: Start difference. First operand 74 states and 100 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 11:24:15,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:15,880 INFO L93 Difference]: Finished difference Result 113 states and 153 transitions. [2022-04-28 11:24:15,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:24:15,880 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), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 34 [2022-04-28 11:24:15,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:24:15,881 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), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 11:24:15,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2022-04-28 11:24:15,882 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), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 11:24:15,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2022-04-28 11:24:15,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 85 transitions. [2022-04-28 11:24:15,936 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 11:24:15,937 INFO L225 Difference]: With dead ends: 113 [2022-04-28 11:24:15,937 INFO L226 Difference]: Without dead ends: 78 [2022-04-28 11:24:15,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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 11:24:15,938 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:24:15,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 114 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:24:15,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-28 11:24:15,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-04-28 11:24:15,966 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:24:15,966 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 78 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:24:15,966 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 78 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:24:15,967 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 78 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:24:15,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:15,969 INFO L93 Difference]: Finished difference Result 78 states and 102 transitions. [2022-04-28 11:24:15,969 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 102 transitions. [2022-04-28 11:24:15,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:24:15,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:24:15,970 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 78 states. [2022-04-28 11:24:15,970 INFO L87 Difference]: Start difference. First operand has 78 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 78 states. [2022-04-28 11:24:15,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:15,972 INFO L93 Difference]: Finished difference Result 78 states and 102 transitions. [2022-04-28 11:24:15,972 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 102 transitions. [2022-04-28 11:24:15,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:24:15,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:24:15,973 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:24:15,973 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:24:15,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:24:15,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 102 transitions. [2022-04-28 11:24:15,975 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 102 transitions. Word has length 34 [2022-04-28 11:24:15,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:24:15,975 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 102 transitions. [2022-04-28 11:24:15,975 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), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 11:24:15,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 102 transitions. [2022-04-28 11:24:16,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:16,050 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 102 transitions. [2022-04-28 11:24:16,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 11:24:16,051 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:24:16,051 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 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 11:24:16,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-28 11:24:16,260 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 11:24:16,261 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:24:16,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:24:16,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1813008070, now seen corresponding path program 1 times [2022-04-28 11:24:16,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:24:16,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [414635601] [2022-04-28 11:24:16,262 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:24:16,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1813008070, now seen corresponding path program 2 times [2022-04-28 11:24:16,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:24:16,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181368683] [2022-04-28 11:24:16,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:24:16,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:24:16,281 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:24:16,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [314682591] [2022-04-28 11:24:16,281 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:24:16,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:24:16,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:24:16,285 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 11:24:16,285 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 11:24:16,319 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:24:16,319 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:24:16,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 11:24:16,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:24:16,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:24:16,496 INFO L272 TraceCheckUtils]: 0: Hoare triple {2548#true} call ULTIMATE.init(); {2548#true} is VALID [2022-04-28 11:24:16,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {2548#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2548#true} is VALID [2022-04-28 11:24:16,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-28 11:24:16,497 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2548#true} {2548#true} #93#return; {2548#true} is VALID [2022-04-28 11:24:16,497 INFO L272 TraceCheckUtils]: 4: Hoare triple {2548#true} call #t~ret8 := main(); {2548#true} is VALID [2022-04-28 11:24:16,497 INFO L290 TraceCheckUtils]: 5: Hoare triple {2548#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {2548#true} is VALID [2022-04-28 11:24:16,497 INFO L272 TraceCheckUtils]: 6: Hoare triple {2548#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2548#true} is VALID [2022-04-28 11:24:16,497 INFO L290 TraceCheckUtils]: 7: Hoare triple {2548#true} ~cond := #in~cond; {2574#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 11:24:16,498 INFO L290 TraceCheckUtils]: 8: Hoare triple {2574#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2578#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:24:16,498 INFO L290 TraceCheckUtils]: 9: Hoare triple {2578#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2578#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:24:16,498 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2578#(not (= |assume_abort_if_not_#in~cond| 0))} {2548#true} #77#return; {2585#(<= 1 main_~y~0)} is VALID [2022-04-28 11:24:16,499 INFO L290 TraceCheckUtils]: 11: Hoare triple {2585#(<= 1 main_~y~0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {2585#(<= 1 main_~y~0)} is VALID [2022-04-28 11:24:16,499 INFO L290 TraceCheckUtils]: 12: Hoare triple {2585#(<= 1 main_~y~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2585#(<= 1 main_~y~0)} is VALID [2022-04-28 11:24:16,499 INFO L290 TraceCheckUtils]: 13: Hoare triple {2585#(<= 1 main_~y~0)} assume !!(#t~post6 < 5);havoc #t~post6; {2585#(<= 1 main_~y~0)} is VALID [2022-04-28 11:24:16,499 INFO L272 TraceCheckUtils]: 14: Hoare triple {2585#(<= 1 main_~y~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2548#true} is VALID [2022-04-28 11:24:16,499 INFO L290 TraceCheckUtils]: 15: Hoare triple {2548#true} ~cond := #in~cond; {2548#true} is VALID [2022-04-28 11:24:16,499 INFO L290 TraceCheckUtils]: 16: Hoare triple {2548#true} assume !(0 == ~cond); {2548#true} is VALID [2022-04-28 11:24:16,500 INFO L290 TraceCheckUtils]: 17: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-28 11:24:16,500 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2548#true} {2585#(<= 1 main_~y~0)} #79#return; {2585#(<= 1 main_~y~0)} is VALID [2022-04-28 11:24:16,500 INFO L272 TraceCheckUtils]: 19: Hoare triple {2585#(<= 1 main_~y~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2548#true} is VALID [2022-04-28 11:24:16,500 INFO L290 TraceCheckUtils]: 20: Hoare triple {2548#true} ~cond := #in~cond; {2548#true} is VALID [2022-04-28 11:24:16,500 INFO L290 TraceCheckUtils]: 21: Hoare triple {2548#true} assume !(0 == ~cond); {2548#true} is VALID [2022-04-28 11:24:16,500 INFO L290 TraceCheckUtils]: 22: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-28 11:24:16,501 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2548#true} {2585#(<= 1 main_~y~0)} #81#return; {2585#(<= 1 main_~y~0)} is VALID [2022-04-28 11:24:16,501 INFO L290 TraceCheckUtils]: 24: Hoare triple {2585#(<= 1 main_~y~0)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {2628#(<= 1 main_~r~0)} is VALID [2022-04-28 11:24:16,501 INFO L290 TraceCheckUtils]: 25: Hoare triple {2628#(<= 1 main_~r~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2628#(<= 1 main_~r~0)} is VALID [2022-04-28 11:24:16,502 INFO L290 TraceCheckUtils]: 26: Hoare triple {2628#(<= 1 main_~r~0)} assume !!(#t~post7 < 5);havoc #t~post7; {2628#(<= 1 main_~r~0)} is VALID [2022-04-28 11:24:16,502 INFO L272 TraceCheckUtils]: 27: Hoare triple {2628#(<= 1 main_~r~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2548#true} is VALID [2022-04-28 11:24:16,502 INFO L290 TraceCheckUtils]: 28: Hoare triple {2548#true} ~cond := #in~cond; {2548#true} is VALID [2022-04-28 11:24:16,502 INFO L290 TraceCheckUtils]: 29: Hoare triple {2548#true} assume !(0 == ~cond); {2548#true} is VALID [2022-04-28 11:24:16,502 INFO L290 TraceCheckUtils]: 30: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-28 11:24:16,502 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2548#true} {2628#(<= 1 main_~r~0)} #83#return; {2628#(<= 1 main_~r~0)} is VALID [2022-04-28 11:24:16,503 INFO L272 TraceCheckUtils]: 32: Hoare triple {2628#(<= 1 main_~r~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2548#true} is VALID [2022-04-28 11:24:16,503 INFO L290 TraceCheckUtils]: 33: Hoare triple {2548#true} ~cond := #in~cond; {2548#true} is VALID [2022-04-28 11:24:16,503 INFO L290 TraceCheckUtils]: 34: Hoare triple {2548#true} assume !(0 == ~cond); {2548#true} is VALID [2022-04-28 11:24:16,503 INFO L290 TraceCheckUtils]: 35: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-28 11:24:16,504 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2548#true} {2628#(<= 1 main_~r~0)} #85#return; {2628#(<= 1 main_~r~0)} is VALID [2022-04-28 11:24:16,505 INFO L272 TraceCheckUtils]: 37: Hoare triple {2628#(<= 1 main_~r~0)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {2668#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:24:16,505 INFO L290 TraceCheckUtils]: 38: Hoare triple {2668#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2672#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:24:16,505 INFO L290 TraceCheckUtils]: 39: Hoare triple {2672#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2549#false} is VALID [2022-04-28 11:24:16,505 INFO L290 TraceCheckUtils]: 40: Hoare triple {2549#false} assume !false; {2549#false} is VALID [2022-04-28 11:24:16,506 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 11:24:16,506 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:24:16,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:24:16,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181368683] [2022-04-28 11:24:16,506 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:24:16,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314682591] [2022-04-28 11:24:16,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314682591] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:24:16,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:24:16,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 11:24:16,506 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:24:16,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [414635601] [2022-04-28 11:24:16,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [414635601] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:24:16,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:24:16,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 11:24:16,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914038604] [2022-04-28 11:24:16,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:24:16,507 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 41 [2022-04-28 11:24:16,507 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:24:16,507 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 11:24:16,531 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 11:24:16,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 11:24:16,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:24:16,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 11:24:16,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-28 11:24:16,532 INFO L87 Difference]: Start difference. First operand 78 states and 102 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 11:24:16,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:16,810 INFO L93 Difference]: Finished difference Result 84 states and 107 transitions. [2022-04-28 11:24:16,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 11:24:16,811 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 41 [2022-04-28 11:24:16,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:24:16,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 11:24:16,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-28 11:24:16,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 11:24:16,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-28 11:24:16,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-28 11:24:16,845 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 11:24:16,847 INFO L225 Difference]: With dead ends: 84 [2022-04-28 11:24:16,847 INFO L226 Difference]: Without dead ends: 82 [2022-04-28 11:24:16,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-28 11:24:16,848 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 20 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:24:16,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 167 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:24:16,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-28 11:24:16,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-04-28 11:24:16,922 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:24:16,922 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 82 states, 50 states have (on average 1.22) internal successors, (61), 52 states have internal predecessors, (61), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:24:16,922 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 82 states, 50 states have (on average 1.22) internal successors, (61), 52 states have internal predecessors, (61), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:24:16,923 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 82 states, 50 states have (on average 1.22) internal successors, (61), 52 states have internal predecessors, (61), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:24:16,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:16,925 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2022-04-28 11:24:16,925 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2022-04-28 11:24:16,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:24:16,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:24:16,926 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 50 states have (on average 1.22) internal successors, (61), 52 states have internal predecessors, (61), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 82 states. [2022-04-28 11:24:16,926 INFO L87 Difference]: Start difference. First operand has 82 states, 50 states have (on average 1.22) internal successors, (61), 52 states have internal predecessors, (61), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 82 states. [2022-04-28 11:24:16,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:16,928 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2022-04-28 11:24:16,929 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2022-04-28 11:24:16,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:24:16,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:24:16,930 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:24:16,931 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:24:16,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 50 states have (on average 1.22) internal successors, (61), 52 states have internal predecessors, (61), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:24:16,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 105 transitions. [2022-04-28 11:24:16,934 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 105 transitions. Word has length 41 [2022-04-28 11:24:16,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:24:16,934 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 105 transitions. [2022-04-28 11:24:16,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 11:24:16,934 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 105 transitions. [2022-04-28 11:24:17,014 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:17,015 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2022-04-28 11:24:17,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-28 11:24:17,016 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:24:17,016 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 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 11:24:17,037 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 11:24:17,226 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 11:24:17,226 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:24:17,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:24:17,227 INFO L85 PathProgramCache]: Analyzing trace with hash -683043127, now seen corresponding path program 1 times [2022-04-28 11:24:17,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:24:17,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1822631569] [2022-04-28 11:24:17,227 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:24:17,227 INFO L85 PathProgramCache]: Analyzing trace with hash -683043127, now seen corresponding path program 2 times [2022-04-28 11:24:17,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:24:17,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964650373] [2022-04-28 11:24:17,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:24:17,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:24:17,240 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:24:17,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [368058524] [2022-04-28 11:24:17,241 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:24:17,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:24:17,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:24:17,243 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 11:24:17,244 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 11:24:17,282 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:24:17,282 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:24:17,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 11:24:17,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:24:17,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:24:17,456 INFO L272 TraceCheckUtils]: 0: Hoare triple {3180#true} call ULTIMATE.init(); {3180#true} is VALID [2022-04-28 11:24:17,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {3180#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3180#true} is VALID [2022-04-28 11:24:17,456 INFO L290 TraceCheckUtils]: 2: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-28 11:24:17,456 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3180#true} {3180#true} #93#return; {3180#true} is VALID [2022-04-28 11:24:17,456 INFO L272 TraceCheckUtils]: 4: Hoare triple {3180#true} call #t~ret8 := main(); {3180#true} is VALID [2022-04-28 11:24:17,456 INFO L290 TraceCheckUtils]: 5: Hoare triple {3180#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {3180#true} is VALID [2022-04-28 11:24:17,456 INFO L272 TraceCheckUtils]: 6: Hoare triple {3180#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3180#true} is VALID [2022-04-28 11:24:17,456 INFO L290 TraceCheckUtils]: 7: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-28 11:24:17,457 INFO L290 TraceCheckUtils]: 8: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-28 11:24:17,457 INFO L290 TraceCheckUtils]: 9: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-28 11:24:17,457 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3180#true} {3180#true} #77#return; {3180#true} is VALID [2022-04-28 11:24:17,457 INFO L290 TraceCheckUtils]: 11: Hoare triple {3180#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {3180#true} is VALID [2022-04-28 11:24:17,457 INFO L290 TraceCheckUtils]: 12: Hoare triple {3180#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3180#true} is VALID [2022-04-28 11:24:17,457 INFO L290 TraceCheckUtils]: 13: Hoare triple {3180#true} assume !!(#t~post6 < 5);havoc #t~post6; {3180#true} is VALID [2022-04-28 11:24:17,457 INFO L272 TraceCheckUtils]: 14: Hoare triple {3180#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3180#true} is VALID [2022-04-28 11:24:17,457 INFO L290 TraceCheckUtils]: 15: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-28 11:24:17,457 INFO L290 TraceCheckUtils]: 16: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-28 11:24:17,457 INFO L290 TraceCheckUtils]: 17: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-28 11:24:17,457 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3180#true} {3180#true} #79#return; {3180#true} is VALID [2022-04-28 11:24:17,457 INFO L272 TraceCheckUtils]: 19: Hoare triple {3180#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3180#true} is VALID [2022-04-28 11:24:17,457 INFO L290 TraceCheckUtils]: 20: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-28 11:24:17,457 INFO L290 TraceCheckUtils]: 21: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-28 11:24:17,458 INFO L290 TraceCheckUtils]: 22: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-28 11:24:17,458 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3180#true} {3180#true} #81#return; {3180#true} is VALID [2022-04-28 11:24:17,458 INFO L290 TraceCheckUtils]: 24: Hoare triple {3180#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {3180#true} is VALID [2022-04-28 11:24:17,458 INFO L290 TraceCheckUtils]: 25: Hoare triple {3180#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3180#true} is VALID [2022-04-28 11:24:17,458 INFO L290 TraceCheckUtils]: 26: Hoare triple {3180#true} assume !!(#t~post7 < 5);havoc #t~post7; {3180#true} is VALID [2022-04-28 11:24:17,458 INFO L272 TraceCheckUtils]: 27: Hoare triple {3180#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3180#true} is VALID [2022-04-28 11:24:17,460 INFO L290 TraceCheckUtils]: 28: Hoare triple {3180#true} ~cond := #in~cond; {3269#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:24:17,460 INFO L290 TraceCheckUtils]: 29: Hoare triple {3269#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3273#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:24:17,461 INFO L290 TraceCheckUtils]: 30: Hoare triple {3273#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3273#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:24:17,461 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3273#(not (= |__VERIFIER_assert_#in~cond| 0))} {3180#true} #83#return; {3280#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-28 11:24:17,461 INFO L272 TraceCheckUtils]: 32: Hoare triple {3280#(= main_~b~0 (* main_~a~0 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3180#true} is VALID [2022-04-28 11:24:17,461 INFO L290 TraceCheckUtils]: 33: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-28 11:24:17,461 INFO L290 TraceCheckUtils]: 34: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-28 11:24:17,461 INFO L290 TraceCheckUtils]: 35: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-28 11:24:17,462 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3180#true} {3280#(= main_~b~0 (* main_~a~0 main_~y~0))} #85#return; {3280#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-28 11:24:17,462 INFO L272 TraceCheckUtils]: 37: Hoare triple {3280#(= main_~b~0 (* main_~a~0 main_~y~0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {3180#true} is VALID [2022-04-28 11:24:17,462 INFO L290 TraceCheckUtils]: 38: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-28 11:24:17,462 INFO L290 TraceCheckUtils]: 39: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-28 11:24:17,462 INFO L290 TraceCheckUtils]: 40: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-28 11:24:17,463 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3180#true} {3280#(= main_~b~0 (* main_~a~0 main_~y~0))} #87#return; {3280#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-28 11:24:17,463 INFO L290 TraceCheckUtils]: 42: Hoare triple {3280#(= main_~b~0 (* main_~a~0 main_~y~0))} assume !!(~r~0 >= 2 * ~b~0); {3314#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} is VALID [2022-04-28 11:24:17,464 INFO L272 TraceCheckUtils]: 43: Hoare triple {3314#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {3318#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:24:17,464 INFO L290 TraceCheckUtils]: 44: Hoare triple {3318#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3322#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:24:17,464 INFO L290 TraceCheckUtils]: 45: Hoare triple {3322#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3181#false} is VALID [2022-04-28 11:24:17,465 INFO L290 TraceCheckUtils]: 46: Hoare triple {3181#false} assume !false; {3181#false} is VALID [2022-04-28 11:24:17,465 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 11:24:17,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:24:24,059 INFO L290 TraceCheckUtils]: 46: Hoare triple {3181#false} assume !false; {3181#false} is VALID [2022-04-28 11:24:24,060 INFO L290 TraceCheckUtils]: 45: Hoare triple {3322#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3181#false} is VALID [2022-04-28 11:24:24,060 INFO L290 TraceCheckUtils]: 44: Hoare triple {3318#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3322#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:24:24,061 INFO L272 TraceCheckUtils]: 43: Hoare triple {3314#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {3318#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:24:24,061 INFO L290 TraceCheckUtils]: 42: Hoare triple {3341#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} assume !!(~r~0 >= 2 * ~b~0); {3314#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} is VALID [2022-04-28 11:24:24,062 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3180#true} {3341#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} #87#return; {3341#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-28 11:24:24,062 INFO L290 TraceCheckUtils]: 40: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-28 11:24:24,062 INFO L290 TraceCheckUtils]: 39: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-28 11:24:24,062 INFO L290 TraceCheckUtils]: 38: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-28 11:24:24,062 INFO L272 TraceCheckUtils]: 37: Hoare triple {3341#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {3180#true} is VALID [2022-04-28 11:24:24,063 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3180#true} {3341#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} #85#return; {3341#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-28 11:24:24,063 INFO L290 TraceCheckUtils]: 35: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-28 11:24:24,063 INFO L290 TraceCheckUtils]: 34: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-28 11:24:24,063 INFO L290 TraceCheckUtils]: 33: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-28 11:24:24,063 INFO L272 TraceCheckUtils]: 32: Hoare triple {3341#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3180#true} is VALID [2022-04-28 11:24:24,064 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3273#(not (= |__VERIFIER_assert_#in~cond| 0))} {3180#true} #83#return; {3341#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-28 11:24:24,065 INFO L290 TraceCheckUtils]: 30: Hoare triple {3273#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3273#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:24:24,065 INFO L290 TraceCheckUtils]: 29: Hoare triple {3384#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3273#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:24:24,065 INFO L290 TraceCheckUtils]: 28: Hoare triple {3180#true} ~cond := #in~cond; {3384#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:24:24,065 INFO L272 TraceCheckUtils]: 27: Hoare triple {3180#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3180#true} is VALID [2022-04-28 11:24:24,065 INFO L290 TraceCheckUtils]: 26: Hoare triple {3180#true} assume !!(#t~post7 < 5);havoc #t~post7; {3180#true} is VALID [2022-04-28 11:24:24,066 INFO L290 TraceCheckUtils]: 25: Hoare triple {3180#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3180#true} is VALID [2022-04-28 11:24:24,066 INFO L290 TraceCheckUtils]: 24: Hoare triple {3180#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {3180#true} is VALID [2022-04-28 11:24:24,066 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3180#true} {3180#true} #81#return; {3180#true} is VALID [2022-04-28 11:24:24,066 INFO L290 TraceCheckUtils]: 22: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-28 11:24:24,066 INFO L290 TraceCheckUtils]: 21: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-28 11:24:24,066 INFO L290 TraceCheckUtils]: 20: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-28 11:24:24,066 INFO L272 TraceCheckUtils]: 19: Hoare triple {3180#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3180#true} is VALID [2022-04-28 11:24:24,066 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3180#true} {3180#true} #79#return; {3180#true} is VALID [2022-04-28 11:24:24,066 INFO L290 TraceCheckUtils]: 17: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-28 11:24:24,066 INFO L290 TraceCheckUtils]: 16: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-28 11:24:24,066 INFO L290 TraceCheckUtils]: 15: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-28 11:24:24,066 INFO L272 TraceCheckUtils]: 14: Hoare triple {3180#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3180#true} is VALID [2022-04-28 11:24:24,066 INFO L290 TraceCheckUtils]: 13: Hoare triple {3180#true} assume !!(#t~post6 < 5);havoc #t~post6; {3180#true} is VALID [2022-04-28 11:24:24,066 INFO L290 TraceCheckUtils]: 12: Hoare triple {3180#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3180#true} is VALID [2022-04-28 11:24:24,067 INFO L290 TraceCheckUtils]: 11: Hoare triple {3180#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {3180#true} is VALID [2022-04-28 11:24:24,067 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3180#true} {3180#true} #77#return; {3180#true} is VALID [2022-04-28 11:24:24,067 INFO L290 TraceCheckUtils]: 9: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-28 11:24:24,067 INFO L290 TraceCheckUtils]: 8: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-28 11:24:24,067 INFO L290 TraceCheckUtils]: 7: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-28 11:24:24,067 INFO L272 TraceCheckUtils]: 6: Hoare triple {3180#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3180#true} is VALID [2022-04-28 11:24:24,067 INFO L290 TraceCheckUtils]: 5: Hoare triple {3180#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {3180#true} is VALID [2022-04-28 11:24:24,067 INFO L272 TraceCheckUtils]: 4: Hoare triple {3180#true} call #t~ret8 := main(); {3180#true} is VALID [2022-04-28 11:24:24,067 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3180#true} {3180#true} #93#return; {3180#true} is VALID [2022-04-28 11:24:24,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-28 11:24:24,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {3180#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3180#true} is VALID [2022-04-28 11:24:24,067 INFO L272 TraceCheckUtils]: 0: Hoare triple {3180#true} call ULTIMATE.init(); {3180#true} is VALID [2022-04-28 11:24:24,067 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 11:24:24,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:24:24,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964650373] [2022-04-28 11:24:24,068 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:24:24,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368058524] [2022-04-28 11:24:24,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368058524] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:24:24,068 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:24:24,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-28 11:24:24,068 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:24:24,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1822631569] [2022-04-28 11:24:24,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1822631569] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:24:24,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:24:24,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 11:24:24,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360376489] [2022-04-28 11:24:24,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:24:24,069 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 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 47 [2022-04-28 11:24:24,069 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:24:24,069 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 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 11:24:24,096 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 11:24:24,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 11:24:24,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:24:24,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 11:24:24,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:24:24,097 INFO L87 Difference]: Start difference. First operand 82 states and 105 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 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 11:24:24,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:24,414 INFO L93 Difference]: Finished difference Result 88 states and 110 transitions. [2022-04-28 11:24:24,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 11:24:24,414 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 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 47 [2022-04-28 11:24:24,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:24:24,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 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 11:24:24,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-28 11:24:24,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 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 11:24:24,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-28 11:24:24,417 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-28 11:24:24,451 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 11:24:24,453 INFO L225 Difference]: With dead ends: 88 [2022-04-28 11:24:24,453 INFO L226 Difference]: Without dead ends: 86 [2022-04-28 11:24:24,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-04-28 11:24:24,454 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 22 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:24:24,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 115 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:24:24,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-28 11:24:24,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-04-28 11:24:24,524 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:24:24,525 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 86 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 55 states have internal predecessors, (64), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:24:24,525 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 86 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 55 states have internal predecessors, (64), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:24:24,526 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 86 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 55 states have internal predecessors, (64), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:24:24,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:24,530 INFO L93 Difference]: Finished difference Result 86 states and 108 transitions. [2022-04-28 11:24:24,530 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2022-04-28 11:24:24,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:24:24,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:24:24,551 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 55 states have internal predecessors, (64), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 86 states. [2022-04-28 11:24:24,552 INFO L87 Difference]: Start difference. First operand has 86 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 55 states have internal predecessors, (64), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 86 states. [2022-04-28 11:24:24,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:24,554 INFO L93 Difference]: Finished difference Result 86 states and 108 transitions. [2022-04-28 11:24:24,554 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2022-04-28 11:24:24,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:24:24,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:24:24,555 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:24:24,555 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:24:24,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 55 states have internal predecessors, (64), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:24:24,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 108 transitions. [2022-04-28 11:24:24,557 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 108 transitions. Word has length 47 [2022-04-28 11:24:24,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:24:24,558 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 108 transitions. [2022-04-28 11:24:24,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 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 11:24:24,558 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 108 transitions. [2022-04-28 11:24:24,656 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:24,656 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2022-04-28 11:24:24,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 11:24:24,656 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:24:24,657 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 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 11:24:24,675 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 11:24:24,857 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 11:24:24,857 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:24:24,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:24:24,858 INFO L85 PathProgramCache]: Analyzing trace with hash -589126939, now seen corresponding path program 1 times [2022-04-28 11:24:24,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:24:24,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [910093291] [2022-04-28 11:24:39,061 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:24:39,061 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:24:39,061 INFO L85 PathProgramCache]: Analyzing trace with hash -589126939, now seen corresponding path program 2 times [2022-04-28 11:24:39,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:24:39,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141052243] [2022-04-28 11:24:39,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:24:39,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:24:39,086 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:24:39,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [410885955] [2022-04-28 11:24:39,087 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:24:39,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:24:39,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:24:39,091 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 11:24:39,092 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 11:24:39,132 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:24:39,132 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:24:39,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 11:24:39,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:24:39,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:24:39,385 INFO L272 TraceCheckUtils]: 0: Hoare triple {3997#true} call ULTIMATE.init(); {3997#true} is VALID [2022-04-28 11:24:39,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {3997#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4005#(<= ~counter~0 0)} is VALID [2022-04-28 11:24:39,387 INFO L290 TraceCheckUtils]: 2: Hoare triple {4005#(<= ~counter~0 0)} assume true; {4005#(<= ~counter~0 0)} is VALID [2022-04-28 11:24:39,387 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4005#(<= ~counter~0 0)} {3997#true} #93#return; {4005#(<= ~counter~0 0)} is VALID [2022-04-28 11:24:39,387 INFO L272 TraceCheckUtils]: 4: Hoare triple {4005#(<= ~counter~0 0)} call #t~ret8 := main(); {4005#(<= ~counter~0 0)} is VALID [2022-04-28 11:24:39,388 INFO L290 TraceCheckUtils]: 5: Hoare triple {4005#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {4005#(<= ~counter~0 0)} is VALID [2022-04-28 11:24:39,388 INFO L272 TraceCheckUtils]: 6: Hoare triple {4005#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4005#(<= ~counter~0 0)} is VALID [2022-04-28 11:24:39,389 INFO L290 TraceCheckUtils]: 7: Hoare triple {4005#(<= ~counter~0 0)} ~cond := #in~cond; {4005#(<= ~counter~0 0)} is VALID [2022-04-28 11:24:39,389 INFO L290 TraceCheckUtils]: 8: Hoare triple {4005#(<= ~counter~0 0)} assume !(0 == ~cond); {4005#(<= ~counter~0 0)} is VALID [2022-04-28 11:24:39,389 INFO L290 TraceCheckUtils]: 9: Hoare triple {4005#(<= ~counter~0 0)} assume true; {4005#(<= ~counter~0 0)} is VALID [2022-04-28 11:24:39,390 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4005#(<= ~counter~0 0)} {4005#(<= ~counter~0 0)} #77#return; {4005#(<= ~counter~0 0)} is VALID [2022-04-28 11:24:39,424 INFO L290 TraceCheckUtils]: 11: Hoare triple {4005#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {4005#(<= ~counter~0 0)} is VALID [2022-04-28 11:24:39,424 INFO L290 TraceCheckUtils]: 12: Hoare triple {4005#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4039#(<= ~counter~0 1)} is VALID [2022-04-28 11:24:39,424 INFO L290 TraceCheckUtils]: 13: Hoare triple {4039#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {4039#(<= ~counter~0 1)} is VALID [2022-04-28 11:24:39,425 INFO L272 TraceCheckUtils]: 14: Hoare triple {4039#(<= ~counter~0 1)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {4039#(<= ~counter~0 1)} is VALID [2022-04-28 11:24:39,426 INFO L290 TraceCheckUtils]: 15: Hoare triple {4039#(<= ~counter~0 1)} ~cond := #in~cond; {4039#(<= ~counter~0 1)} is VALID [2022-04-28 11:24:39,426 INFO L290 TraceCheckUtils]: 16: Hoare triple {4039#(<= ~counter~0 1)} assume !(0 == ~cond); {4039#(<= ~counter~0 1)} is VALID [2022-04-28 11:24:39,426 INFO L290 TraceCheckUtils]: 17: Hoare triple {4039#(<= ~counter~0 1)} assume true; {4039#(<= ~counter~0 1)} is VALID [2022-04-28 11:24:39,427 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4039#(<= ~counter~0 1)} {4039#(<= ~counter~0 1)} #79#return; {4039#(<= ~counter~0 1)} is VALID [2022-04-28 11:24:39,427 INFO L272 TraceCheckUtils]: 19: Hoare triple {4039#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {4039#(<= ~counter~0 1)} is VALID [2022-04-28 11:24:39,427 INFO L290 TraceCheckUtils]: 20: Hoare triple {4039#(<= ~counter~0 1)} ~cond := #in~cond; {4039#(<= ~counter~0 1)} is VALID [2022-04-28 11:24:39,427 INFO L290 TraceCheckUtils]: 21: Hoare triple {4039#(<= ~counter~0 1)} assume !(0 == ~cond); {4039#(<= ~counter~0 1)} is VALID [2022-04-28 11:24:39,428 INFO L290 TraceCheckUtils]: 22: Hoare triple {4039#(<= ~counter~0 1)} assume true; {4039#(<= ~counter~0 1)} is VALID [2022-04-28 11:24:39,428 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4039#(<= ~counter~0 1)} {4039#(<= ~counter~0 1)} #81#return; {4039#(<= ~counter~0 1)} is VALID [2022-04-28 11:24:39,428 INFO L290 TraceCheckUtils]: 24: Hoare triple {4039#(<= ~counter~0 1)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {4039#(<= ~counter~0 1)} is VALID [2022-04-28 11:24:39,429 INFO L290 TraceCheckUtils]: 25: Hoare triple {4039#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:24:39,429 INFO L290 TraceCheckUtils]: 26: Hoare triple {4079#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:24:39,429 INFO L272 TraceCheckUtils]: 27: Hoare triple {4079#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:24:39,429 INFO L290 TraceCheckUtils]: 28: Hoare triple {4079#(<= ~counter~0 2)} ~cond := #in~cond; {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:24:39,430 INFO L290 TraceCheckUtils]: 29: Hoare triple {4079#(<= ~counter~0 2)} assume !(0 == ~cond); {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:24:39,430 INFO L290 TraceCheckUtils]: 30: Hoare triple {4079#(<= ~counter~0 2)} assume true; {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:24:39,430 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4079#(<= ~counter~0 2)} {4079#(<= ~counter~0 2)} #83#return; {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:24:39,431 INFO L272 TraceCheckUtils]: 32: Hoare triple {4079#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:24:39,431 INFO L290 TraceCheckUtils]: 33: Hoare triple {4079#(<= ~counter~0 2)} ~cond := #in~cond; {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:24:39,431 INFO L290 TraceCheckUtils]: 34: Hoare triple {4079#(<= ~counter~0 2)} assume !(0 == ~cond); {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:24:39,431 INFO L290 TraceCheckUtils]: 35: Hoare triple {4079#(<= ~counter~0 2)} assume true; {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:24:39,432 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4079#(<= ~counter~0 2)} {4079#(<= ~counter~0 2)} #85#return; {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:24:39,432 INFO L272 TraceCheckUtils]: 37: Hoare triple {4079#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:24:39,432 INFO L290 TraceCheckUtils]: 38: Hoare triple {4079#(<= ~counter~0 2)} ~cond := #in~cond; {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:24:39,432 INFO L290 TraceCheckUtils]: 39: Hoare triple {4079#(<= ~counter~0 2)} assume !(0 == ~cond); {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:24:39,432 INFO L290 TraceCheckUtils]: 40: Hoare triple {4079#(<= ~counter~0 2)} assume true; {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:24:39,433 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4079#(<= ~counter~0 2)} {4079#(<= ~counter~0 2)} #87#return; {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:24:39,433 INFO L290 TraceCheckUtils]: 42: Hoare triple {4079#(<= ~counter~0 2)} assume !(~r~0 >= 2 * ~b~0); {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:24:39,433 INFO L290 TraceCheckUtils]: 43: Hoare triple {4079#(<= ~counter~0 2)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:24:39,434 INFO L290 TraceCheckUtils]: 44: Hoare triple {4079#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4137#(<= |main_#t~post6| 2)} is VALID [2022-04-28 11:24:39,434 INFO L290 TraceCheckUtils]: 45: Hoare triple {4137#(<= |main_#t~post6| 2)} assume !(#t~post6 < 5);havoc #t~post6; {3998#false} is VALID [2022-04-28 11:24:39,434 INFO L272 TraceCheckUtils]: 46: Hoare triple {3998#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3998#false} is VALID [2022-04-28 11:24:39,434 INFO L290 TraceCheckUtils]: 47: Hoare triple {3998#false} ~cond := #in~cond; {3998#false} is VALID [2022-04-28 11:24:39,434 INFO L290 TraceCheckUtils]: 48: Hoare triple {3998#false} assume 0 == ~cond; {3998#false} is VALID [2022-04-28 11:24:39,434 INFO L290 TraceCheckUtils]: 49: Hoare triple {3998#false} assume !false; {3998#false} is VALID [2022-04-28 11:24:39,434 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 11:24:39,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:24:39,632 INFO L290 TraceCheckUtils]: 49: Hoare triple {3998#false} assume !false; {3998#false} is VALID [2022-04-28 11:24:39,632 INFO L290 TraceCheckUtils]: 48: Hoare triple {3998#false} assume 0 == ~cond; {3998#false} is VALID [2022-04-28 11:24:39,633 INFO L290 TraceCheckUtils]: 47: Hoare triple {3998#false} ~cond := #in~cond; {3998#false} is VALID [2022-04-28 11:24:39,633 INFO L272 TraceCheckUtils]: 46: Hoare triple {3998#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3998#false} is VALID [2022-04-28 11:24:39,633 INFO L290 TraceCheckUtils]: 45: Hoare triple {4165#(< |main_#t~post6| 5)} assume !(#t~post6 < 5);havoc #t~post6; {3998#false} is VALID [2022-04-28 11:24:39,633 INFO L290 TraceCheckUtils]: 44: Hoare triple {4169#(< ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4165#(< |main_#t~post6| 5)} is VALID [2022-04-28 11:24:39,633 INFO L290 TraceCheckUtils]: 43: Hoare triple {4169#(< ~counter~0 5)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {4169#(< ~counter~0 5)} is VALID [2022-04-28 11:24:39,634 INFO L290 TraceCheckUtils]: 42: Hoare triple {4169#(< ~counter~0 5)} assume !(~r~0 >= 2 * ~b~0); {4169#(< ~counter~0 5)} is VALID [2022-04-28 11:24:39,634 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3997#true} {4169#(< ~counter~0 5)} #87#return; {4169#(< ~counter~0 5)} is VALID [2022-04-28 11:24:39,634 INFO L290 TraceCheckUtils]: 40: Hoare triple {3997#true} assume true; {3997#true} is VALID [2022-04-28 11:24:39,634 INFO L290 TraceCheckUtils]: 39: Hoare triple {3997#true} assume !(0 == ~cond); {3997#true} is VALID [2022-04-28 11:24:39,634 INFO L290 TraceCheckUtils]: 38: Hoare triple {3997#true} ~cond := #in~cond; {3997#true} is VALID [2022-04-28 11:24:39,634 INFO L272 TraceCheckUtils]: 37: Hoare triple {4169#(< ~counter~0 5)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {3997#true} is VALID [2022-04-28 11:24:39,635 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3997#true} {4169#(< ~counter~0 5)} #85#return; {4169#(< ~counter~0 5)} is VALID [2022-04-28 11:24:39,635 INFO L290 TraceCheckUtils]: 35: Hoare triple {3997#true} assume true; {3997#true} is VALID [2022-04-28 11:24:39,635 INFO L290 TraceCheckUtils]: 34: Hoare triple {3997#true} assume !(0 == ~cond); {3997#true} is VALID [2022-04-28 11:24:39,635 INFO L290 TraceCheckUtils]: 33: Hoare triple {3997#true} ~cond := #in~cond; {3997#true} is VALID [2022-04-28 11:24:39,635 INFO L272 TraceCheckUtils]: 32: Hoare triple {4169#(< ~counter~0 5)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3997#true} is VALID [2022-04-28 11:24:39,636 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3997#true} {4169#(< ~counter~0 5)} #83#return; {4169#(< ~counter~0 5)} is VALID [2022-04-28 11:24:39,636 INFO L290 TraceCheckUtils]: 30: Hoare triple {3997#true} assume true; {3997#true} is VALID [2022-04-28 11:24:39,636 INFO L290 TraceCheckUtils]: 29: Hoare triple {3997#true} assume !(0 == ~cond); {3997#true} is VALID [2022-04-28 11:24:39,636 INFO L290 TraceCheckUtils]: 28: Hoare triple {3997#true} ~cond := #in~cond; {3997#true} is VALID [2022-04-28 11:24:39,636 INFO L272 TraceCheckUtils]: 27: Hoare triple {4169#(< ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3997#true} is VALID [2022-04-28 11:24:39,636 INFO L290 TraceCheckUtils]: 26: Hoare triple {4169#(< ~counter~0 5)} assume !!(#t~post7 < 5);havoc #t~post7; {4169#(< ~counter~0 5)} is VALID [2022-04-28 11:24:39,637 INFO L290 TraceCheckUtils]: 25: Hoare triple {4227#(< ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4169#(< ~counter~0 5)} is VALID [2022-04-28 11:24:39,637 INFO L290 TraceCheckUtils]: 24: Hoare triple {4227#(< ~counter~0 4)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {4227#(< ~counter~0 4)} is VALID [2022-04-28 11:24:39,638 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3997#true} {4227#(< ~counter~0 4)} #81#return; {4227#(< ~counter~0 4)} is VALID [2022-04-28 11:24:39,638 INFO L290 TraceCheckUtils]: 22: Hoare triple {3997#true} assume true; {3997#true} is VALID [2022-04-28 11:24:39,638 INFO L290 TraceCheckUtils]: 21: Hoare triple {3997#true} assume !(0 == ~cond); {3997#true} is VALID [2022-04-28 11:24:39,638 INFO L290 TraceCheckUtils]: 20: Hoare triple {3997#true} ~cond := #in~cond; {3997#true} is VALID [2022-04-28 11:24:39,638 INFO L272 TraceCheckUtils]: 19: Hoare triple {4227#(< ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3997#true} is VALID [2022-04-28 11:24:39,638 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3997#true} {4227#(< ~counter~0 4)} #79#return; {4227#(< ~counter~0 4)} is VALID [2022-04-28 11:24:39,638 INFO L290 TraceCheckUtils]: 17: Hoare triple {3997#true} assume true; {3997#true} is VALID [2022-04-28 11:24:39,638 INFO L290 TraceCheckUtils]: 16: Hoare triple {3997#true} assume !(0 == ~cond); {3997#true} is VALID [2022-04-28 11:24:39,638 INFO L290 TraceCheckUtils]: 15: Hoare triple {3997#true} ~cond := #in~cond; {3997#true} is VALID [2022-04-28 11:24:39,638 INFO L272 TraceCheckUtils]: 14: Hoare triple {4227#(< ~counter~0 4)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3997#true} is VALID [2022-04-28 11:24:39,639 INFO L290 TraceCheckUtils]: 13: Hoare triple {4227#(< ~counter~0 4)} assume !!(#t~post6 < 5);havoc #t~post6; {4227#(< ~counter~0 4)} is VALID [2022-04-28 11:24:39,639 INFO L290 TraceCheckUtils]: 12: Hoare triple {4079#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4227#(< ~counter~0 4)} is VALID [2022-04-28 11:24:39,639 INFO L290 TraceCheckUtils]: 11: Hoare triple {4079#(<= ~counter~0 2)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:24:39,640 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3997#true} {4079#(<= ~counter~0 2)} #77#return; {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:24:39,640 INFO L290 TraceCheckUtils]: 9: Hoare triple {3997#true} assume true; {3997#true} is VALID [2022-04-28 11:24:39,640 INFO L290 TraceCheckUtils]: 8: Hoare triple {3997#true} assume !(0 == ~cond); {3997#true} is VALID [2022-04-28 11:24:39,640 INFO L290 TraceCheckUtils]: 7: Hoare triple {3997#true} ~cond := #in~cond; {3997#true} is VALID [2022-04-28 11:24:39,640 INFO L272 TraceCheckUtils]: 6: Hoare triple {4079#(<= ~counter~0 2)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3997#true} is VALID [2022-04-28 11:24:39,643 INFO L290 TraceCheckUtils]: 5: Hoare triple {4079#(<= ~counter~0 2)} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:24:39,644 INFO L272 TraceCheckUtils]: 4: Hoare triple {4079#(<= ~counter~0 2)} call #t~ret8 := main(); {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:24:39,646 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4079#(<= ~counter~0 2)} {3997#true} #93#return; {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:24:39,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {4079#(<= ~counter~0 2)} assume true; {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:24:39,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {3997#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4079#(<= ~counter~0 2)} is VALID [2022-04-28 11:24:39,648 INFO L272 TraceCheckUtils]: 0: Hoare triple {3997#true} call ULTIMATE.init(); {3997#true} is VALID [2022-04-28 11:24:39,648 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 11:24:39,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:24:39,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141052243] [2022-04-28 11:24:39,648 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:24:39,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410885955] [2022-04-28 11:24:39,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410885955] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:24:39,648 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:24:39,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-04-28 11:24:39,649 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:24:39,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [910093291] [2022-04-28 11:24:39,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [910093291] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:24:39,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:24:39,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:24:39,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325873099] [2022-04-28 11:24:39,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:24:39,649 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 50 [2022-04-28 11:24:39,649 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:24:39,650 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-28 11:24:39,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:39,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 11:24:39,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:24:39,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 11:24:39,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-28 11:24:39,675 INFO L87 Difference]: Start difference. First operand 86 states and 108 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-28 11:24:39,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:39,908 INFO L93 Difference]: Finished difference Result 115 states and 134 transitions. [2022-04-28 11:24:39,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:24:39,909 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 50 [2022-04-28 11:24:39,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:24:39,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-28 11:24:39,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2022-04-28 11:24:39,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-28 11:24:39,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2022-04-28 11:24:39,911 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 79 transitions. [2022-04-28 11:24:39,963 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:39,965 INFO L225 Difference]: With dead ends: 115 [2022-04-28 11:24:39,965 INFO L226 Difference]: Without dead ends: 108 [2022-04-28 11:24:39,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:24:39,965 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 11 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:24:39,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 145 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:24:39,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-04-28 11:24:40,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2022-04-28 11:24:40,063 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:24:40,063 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand has 106 states, 68 states have (on average 1.161764705882353) internal successors, (79), 71 states have internal predecessors, (79), 24 states have call successors, (24), 14 states have call predecessors, (24), 13 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 11:24:40,063 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand has 106 states, 68 states have (on average 1.161764705882353) internal successors, (79), 71 states have internal predecessors, (79), 24 states have call successors, (24), 14 states have call predecessors, (24), 13 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 11:24:40,064 INFO L87 Difference]: Start difference. First operand 108 states. Second operand has 106 states, 68 states have (on average 1.161764705882353) internal successors, (79), 71 states have internal predecessors, (79), 24 states have call successors, (24), 14 states have call predecessors, (24), 13 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 11:24:40,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:40,066 INFO L93 Difference]: Finished difference Result 108 states and 127 transitions. [2022-04-28 11:24:40,066 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 127 transitions. [2022-04-28 11:24:40,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:24:40,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:24:40,067 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 68 states have (on average 1.161764705882353) internal successors, (79), 71 states have internal predecessors, (79), 24 states have call successors, (24), 14 states have call predecessors, (24), 13 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) Second operand 108 states. [2022-04-28 11:24:40,067 INFO L87 Difference]: Start difference. First operand has 106 states, 68 states have (on average 1.161764705882353) internal successors, (79), 71 states have internal predecessors, (79), 24 states have call successors, (24), 14 states have call predecessors, (24), 13 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) Second operand 108 states. [2022-04-28 11:24:40,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:40,069 INFO L93 Difference]: Finished difference Result 108 states and 127 transitions. [2022-04-28 11:24:40,069 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 127 transitions. [2022-04-28 11:24:40,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:24:40,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:24:40,069 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:24:40,069 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:24:40,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 68 states have (on average 1.161764705882353) internal successors, (79), 71 states have internal predecessors, (79), 24 states have call successors, (24), 14 states have call predecessors, (24), 13 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 11:24:40,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 125 transitions. [2022-04-28 11:24:40,071 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 125 transitions. Word has length 50 [2022-04-28 11:24:40,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:24:40,071 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 125 transitions. [2022-04-28 11:24:40,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-28 11:24:40,071 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 106 states and 125 transitions. [2022-04-28 11:24:40,200 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:40,200 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 125 transitions. [2022-04-28 11:24:40,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-28 11:24:40,200 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:24:40,200 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 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 11:24:40,233 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 11:24:40,401 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 11:24:40,401 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:24:40,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:24:40,401 INFO L85 PathProgramCache]: Analyzing trace with hash -484699953, now seen corresponding path program 1 times [2022-04-28 11:24:40,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:24:40,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [693265004] [2022-04-28 11:24:51,882 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:24:51,882 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:24:51,883 INFO L85 PathProgramCache]: Analyzing trace with hash -484699953, now seen corresponding path program 2 times [2022-04-28 11:24:51,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:24:51,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881269312] [2022-04-28 11:24:51,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:24:51,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:24:51,891 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:24:51,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1207704282] [2022-04-28 11:24:51,892 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:24:51,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:24:51,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:24:51,908 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 11:24:51,909 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 11:24:51,949 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:24:51,950 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:24:51,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 11:24:51,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:24:51,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:24:52,231 INFO L272 TraceCheckUtils]: 0: Hoare triple {4965#true} call ULTIMATE.init(); {4965#true} is VALID [2022-04-28 11:24:52,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {4965#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4965#true} is VALID [2022-04-28 11:24:52,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {4965#true} assume true; {4965#true} is VALID [2022-04-28 11:24:52,231 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4965#true} {4965#true} #93#return; {4965#true} is VALID [2022-04-28 11:24:52,231 INFO L272 TraceCheckUtils]: 4: Hoare triple {4965#true} call #t~ret8 := main(); {4965#true} is VALID [2022-04-28 11:24:52,231 INFO L290 TraceCheckUtils]: 5: Hoare triple {4965#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {4965#true} is VALID [2022-04-28 11:24:52,231 INFO L272 TraceCheckUtils]: 6: Hoare triple {4965#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4965#true} is VALID [2022-04-28 11:24:52,231 INFO L290 TraceCheckUtils]: 7: Hoare triple {4965#true} ~cond := #in~cond; {4965#true} is VALID [2022-04-28 11:24:52,231 INFO L290 TraceCheckUtils]: 8: Hoare triple {4965#true} assume !(0 == ~cond); {4965#true} is VALID [2022-04-28 11:24:52,231 INFO L290 TraceCheckUtils]: 9: Hoare triple {4965#true} assume true; {4965#true} is VALID [2022-04-28 11:24:52,231 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4965#true} {4965#true} #77#return; {4965#true} is VALID [2022-04-28 11:24:52,232 INFO L290 TraceCheckUtils]: 11: Hoare triple {4965#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {5003#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:24:52,232 INFO L290 TraceCheckUtils]: 12: Hoare triple {5003#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5003#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:24:52,232 INFO L290 TraceCheckUtils]: 13: Hoare triple {5003#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 5);havoc #t~post6; {5003#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:24:52,232 INFO L272 TraceCheckUtils]: 14: Hoare triple {5003#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {4965#true} is VALID [2022-04-28 11:24:52,232 INFO L290 TraceCheckUtils]: 15: Hoare triple {4965#true} ~cond := #in~cond; {4965#true} is VALID [2022-04-28 11:24:52,233 INFO L290 TraceCheckUtils]: 16: Hoare triple {4965#true} assume !(0 == ~cond); {4965#true} is VALID [2022-04-28 11:24:52,233 INFO L290 TraceCheckUtils]: 17: Hoare triple {4965#true} assume true; {4965#true} is VALID [2022-04-28 11:24:52,233 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4965#true} {5003#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #79#return; {5003#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:24:52,233 INFO L272 TraceCheckUtils]: 19: Hoare triple {5003#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {4965#true} is VALID [2022-04-28 11:24:52,233 INFO L290 TraceCheckUtils]: 20: Hoare triple {4965#true} ~cond := #in~cond; {4965#true} is VALID [2022-04-28 11:24:52,233 INFO L290 TraceCheckUtils]: 21: Hoare triple {4965#true} assume !(0 == ~cond); {4965#true} is VALID [2022-04-28 11:24:52,233 INFO L290 TraceCheckUtils]: 22: Hoare triple {4965#true} assume true; {4965#true} is VALID [2022-04-28 11:24:52,234 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4965#true} {5003#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #81#return; {5003#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:24:52,234 INFO L290 TraceCheckUtils]: 24: Hoare triple {5003#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {5043#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:24:52,235 INFO L290 TraceCheckUtils]: 25: Hoare triple {5043#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5043#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:24:52,235 INFO L290 TraceCheckUtils]: 26: Hoare triple {5043#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(#t~post7 < 5);havoc #t~post7; {5043#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:24:52,235 INFO L272 TraceCheckUtils]: 27: Hoare triple {5043#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {4965#true} is VALID [2022-04-28 11:24:52,235 INFO L290 TraceCheckUtils]: 28: Hoare triple {4965#true} ~cond := #in~cond; {4965#true} is VALID [2022-04-28 11:24:52,235 INFO L290 TraceCheckUtils]: 29: Hoare triple {4965#true} assume !(0 == ~cond); {4965#true} is VALID [2022-04-28 11:24:52,235 INFO L290 TraceCheckUtils]: 30: Hoare triple {4965#true} assume true; {4965#true} is VALID [2022-04-28 11:24:52,236 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4965#true} {5043#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #83#return; {5043#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:24:52,236 INFO L272 TraceCheckUtils]: 32: Hoare triple {5043#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {4965#true} is VALID [2022-04-28 11:24:52,236 INFO L290 TraceCheckUtils]: 33: Hoare triple {4965#true} ~cond := #in~cond; {4965#true} is VALID [2022-04-28 11:24:52,236 INFO L290 TraceCheckUtils]: 34: Hoare triple {4965#true} assume !(0 == ~cond); {4965#true} is VALID [2022-04-28 11:24:52,236 INFO L290 TraceCheckUtils]: 35: Hoare triple {4965#true} assume true; {4965#true} is VALID [2022-04-28 11:24:52,236 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4965#true} {5043#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #85#return; {5043#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:24:52,237 INFO L272 TraceCheckUtils]: 37: Hoare triple {5043#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {4965#true} is VALID [2022-04-28 11:24:52,237 INFO L290 TraceCheckUtils]: 38: Hoare triple {4965#true} ~cond := #in~cond; {4965#true} is VALID [2022-04-28 11:24:52,237 INFO L290 TraceCheckUtils]: 39: Hoare triple {4965#true} assume !(0 == ~cond); {4965#true} is VALID [2022-04-28 11:24:52,237 INFO L290 TraceCheckUtils]: 40: Hoare triple {4965#true} assume true; {4965#true} is VALID [2022-04-28 11:24:52,237 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4965#true} {5043#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #87#return; {5043#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:24:52,238 INFO L290 TraceCheckUtils]: 42: Hoare triple {5043#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !(~r~0 >= 2 * ~b~0); {5043#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:24:52,238 INFO L290 TraceCheckUtils]: 43: Hoare triple {5043#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {5101#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~r~0) (= main_~q~0 1))} is VALID [2022-04-28 11:24:52,238 INFO L290 TraceCheckUtils]: 44: Hoare triple {5101#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~r~0) (= main_~q~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5101#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~r~0) (= main_~q~0 1))} is VALID [2022-04-28 11:24:52,239 INFO L290 TraceCheckUtils]: 45: Hoare triple {5101#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~r~0) (= main_~q~0 1))} assume !!(#t~post6 < 5);havoc #t~post6; {5101#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~r~0) (= main_~q~0 1))} is VALID [2022-04-28 11:24:52,239 INFO L272 TraceCheckUtils]: 46: Hoare triple {5101#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~r~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {4965#true} is VALID [2022-04-28 11:24:52,239 INFO L290 TraceCheckUtils]: 47: Hoare triple {4965#true} ~cond := #in~cond; {4965#true} is VALID [2022-04-28 11:24:52,239 INFO L290 TraceCheckUtils]: 48: Hoare triple {4965#true} assume !(0 == ~cond); {4965#true} is VALID [2022-04-28 11:24:52,239 INFO L290 TraceCheckUtils]: 49: Hoare triple {4965#true} assume true; {4965#true} is VALID [2022-04-28 11:24:52,239 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4965#true} {5101#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~r~0) (= main_~q~0 1))} #79#return; {5101#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~r~0) (= main_~q~0 1))} is VALID [2022-04-28 11:24:52,240 INFO L272 TraceCheckUtils]: 51: Hoare triple {5101#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~r~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {5126#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:24:52,240 INFO L290 TraceCheckUtils]: 52: Hoare triple {5126#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5130#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:24:52,241 INFO L290 TraceCheckUtils]: 53: Hoare triple {5130#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4966#false} is VALID [2022-04-28 11:24:52,241 INFO L290 TraceCheckUtils]: 54: Hoare triple {4966#false} assume !false; {4966#false} is VALID [2022-04-28 11:24:52,241 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 11:24:52,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:25:10,876 INFO L290 TraceCheckUtils]: 54: Hoare triple {4966#false} assume !false; {4966#false} is VALID [2022-04-28 11:25:10,877 INFO L290 TraceCheckUtils]: 53: Hoare triple {5130#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4966#false} is VALID [2022-04-28 11:25:10,877 INFO L290 TraceCheckUtils]: 52: Hoare triple {5126#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5130#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:25:10,878 INFO L272 TraceCheckUtils]: 51: Hoare triple {5146#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {5126#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:25:10,878 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4965#true} {5146#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #79#return; {5146#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:25:10,878 INFO L290 TraceCheckUtils]: 49: Hoare triple {4965#true} assume true; {4965#true} is VALID [2022-04-28 11:25:10,878 INFO L290 TraceCheckUtils]: 48: Hoare triple {4965#true} assume !(0 == ~cond); {4965#true} is VALID [2022-04-28 11:25:10,878 INFO L290 TraceCheckUtils]: 47: Hoare triple {4965#true} ~cond := #in~cond; {4965#true} is VALID [2022-04-28 11:25:10,878 INFO L272 TraceCheckUtils]: 46: Hoare triple {5146#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {4965#true} is VALID [2022-04-28 11:25:10,879 INFO L290 TraceCheckUtils]: 45: Hoare triple {5146#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(#t~post6 < 5);havoc #t~post6; {5146#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:25:10,879 INFO L290 TraceCheckUtils]: 44: Hoare triple {5146#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5146#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:25:10,898 INFO L290 TraceCheckUtils]: 43: Hoare triple {5171#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {5146#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:25:10,899 INFO L290 TraceCheckUtils]: 42: Hoare triple {5171#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} assume !(~r~0 >= 2 * ~b~0); {5171#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:25:10,900 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4965#true} {5171#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} #87#return; {5171#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:25:10,900 INFO L290 TraceCheckUtils]: 40: Hoare triple {4965#true} assume true; {4965#true} is VALID [2022-04-28 11:25:10,900 INFO L290 TraceCheckUtils]: 39: Hoare triple {4965#true} assume !(0 == ~cond); {4965#true} is VALID [2022-04-28 11:25:10,900 INFO L290 TraceCheckUtils]: 38: Hoare triple {4965#true} ~cond := #in~cond; {4965#true} is VALID [2022-04-28 11:25:10,900 INFO L272 TraceCheckUtils]: 37: Hoare triple {5171#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {4965#true} is VALID [2022-04-28 11:25:10,900 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4965#true} {5171#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} #85#return; {5171#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:25:10,900 INFO L290 TraceCheckUtils]: 35: Hoare triple {4965#true} assume true; {4965#true} is VALID [2022-04-28 11:25:10,901 INFO L290 TraceCheckUtils]: 34: Hoare triple {4965#true} assume !(0 == ~cond); {4965#true} is VALID [2022-04-28 11:25:10,901 INFO L290 TraceCheckUtils]: 33: Hoare triple {4965#true} ~cond := #in~cond; {4965#true} is VALID [2022-04-28 11:25:10,901 INFO L272 TraceCheckUtils]: 32: Hoare triple {5171#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {4965#true} is VALID [2022-04-28 11:25:10,901 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4965#true} {5171#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} #83#return; {5171#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:25:10,901 INFO L290 TraceCheckUtils]: 30: Hoare triple {4965#true} assume true; {4965#true} is VALID [2022-04-28 11:25:10,901 INFO L290 TraceCheckUtils]: 29: Hoare triple {4965#true} assume !(0 == ~cond); {4965#true} is VALID [2022-04-28 11:25:10,902 INFO L290 TraceCheckUtils]: 28: Hoare triple {4965#true} ~cond := #in~cond; {4965#true} is VALID [2022-04-28 11:25:10,902 INFO L272 TraceCheckUtils]: 27: Hoare triple {5171#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {4965#true} is VALID [2022-04-28 11:25:10,902 INFO L290 TraceCheckUtils]: 26: Hoare triple {5171#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} assume !!(#t~post7 < 5);havoc #t~post7; {5171#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:25:10,902 INFO L290 TraceCheckUtils]: 25: Hoare triple {5171#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5171#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:25:10,903 INFO L290 TraceCheckUtils]: 24: Hoare triple {5003#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {5171#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:25:10,903 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4965#true} {5003#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #81#return; {5003#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:25:10,903 INFO L290 TraceCheckUtils]: 22: Hoare triple {4965#true} assume true; {4965#true} is VALID [2022-04-28 11:25:10,903 INFO L290 TraceCheckUtils]: 21: Hoare triple {4965#true} assume !(0 == ~cond); {4965#true} is VALID [2022-04-28 11:25:10,903 INFO L290 TraceCheckUtils]: 20: Hoare triple {4965#true} ~cond := #in~cond; {4965#true} is VALID [2022-04-28 11:25:10,903 INFO L272 TraceCheckUtils]: 19: Hoare triple {5003#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {4965#true} is VALID [2022-04-28 11:25:10,904 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4965#true} {5003#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #79#return; {5003#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:25:10,904 INFO L290 TraceCheckUtils]: 17: Hoare triple {4965#true} assume true; {4965#true} is VALID [2022-04-28 11:25:10,904 INFO L290 TraceCheckUtils]: 16: Hoare triple {4965#true} assume !(0 == ~cond); {4965#true} is VALID [2022-04-28 11:25:10,904 INFO L290 TraceCheckUtils]: 15: Hoare triple {4965#true} ~cond := #in~cond; {4965#true} is VALID [2022-04-28 11:25:10,904 INFO L272 TraceCheckUtils]: 14: Hoare triple {5003#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {4965#true} is VALID [2022-04-28 11:25:10,904 INFO L290 TraceCheckUtils]: 13: Hoare triple {5003#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 5);havoc #t~post6; {5003#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:25:10,905 INFO L290 TraceCheckUtils]: 12: Hoare triple {5003#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5003#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:25:10,905 INFO L290 TraceCheckUtils]: 11: Hoare triple {4965#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {5003#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:25:10,905 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4965#true} {4965#true} #77#return; {4965#true} is VALID [2022-04-28 11:25:10,905 INFO L290 TraceCheckUtils]: 9: Hoare triple {4965#true} assume true; {4965#true} is VALID [2022-04-28 11:25:10,905 INFO L290 TraceCheckUtils]: 8: Hoare triple {4965#true} assume !(0 == ~cond); {4965#true} is VALID [2022-04-28 11:25:10,905 INFO L290 TraceCheckUtils]: 7: Hoare triple {4965#true} ~cond := #in~cond; {4965#true} is VALID [2022-04-28 11:25:10,905 INFO L272 TraceCheckUtils]: 6: Hoare triple {4965#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4965#true} is VALID [2022-04-28 11:25:10,905 INFO L290 TraceCheckUtils]: 5: Hoare triple {4965#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {4965#true} is VALID [2022-04-28 11:25:10,905 INFO L272 TraceCheckUtils]: 4: Hoare triple {4965#true} call #t~ret8 := main(); {4965#true} is VALID [2022-04-28 11:25:10,906 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4965#true} {4965#true} #93#return; {4965#true} is VALID [2022-04-28 11:25:10,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {4965#true} assume true; {4965#true} is VALID [2022-04-28 11:25:10,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {4965#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4965#true} is VALID [2022-04-28 11:25:10,906 INFO L272 TraceCheckUtils]: 0: Hoare triple {4965#true} call ULTIMATE.init(); {4965#true} is VALID [2022-04-28 11:25:10,906 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 11:25:10,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:25:10,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881269312] [2022-04-28 11:25:10,906 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:25:10,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207704282] [2022-04-28 11:25:10,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207704282] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:25:10,906 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:25:10,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-04-28 11:25:10,907 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:25:10,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [693265004] [2022-04-28 11:25:10,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [693265004] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:25:10,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:25:10,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 11:25:10,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545949973] [2022-04-28 11:25:10,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:25:10,907 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 55 [2022-04-28 11:25:10,907 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:25:10,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 11:25:10,947 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:25:10,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 11:25:10,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:25:10,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 11:25:10,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-28 11:25:10,948 INFO L87 Difference]: Start difference. First operand 106 states and 125 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 11:25:11,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:25:11,527 INFO L93 Difference]: Finished difference Result 134 states and 166 transitions. [2022-04-28 11:25:11,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:25:11,527 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 55 [2022-04-28 11:25:11,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:25:11,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 11:25:11,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 107 transitions. [2022-04-28 11:25:11,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 11:25:11,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 107 transitions. [2022-04-28 11:25:11,530 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 107 transitions. [2022-04-28 11:25:11,611 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:25:11,613 INFO L225 Difference]: With dead ends: 134 [2022-04-28 11:25:11,613 INFO L226 Difference]: Without dead ends: 131 [2022-04-28 11:25:11,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:25:11,613 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 24 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 11:25:11,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 237 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 11:25:11,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-04-28 11:25:11,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2022-04-28 11:25:11,731 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:25:11,732 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand has 127 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 82 states have internal predecessors, (94), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 11:25:11,732 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand has 127 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 82 states have internal predecessors, (94), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 11:25:11,732 INFO L87 Difference]: Start difference. First operand 131 states. Second operand has 127 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 82 states have internal predecessors, (94), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 11:25:11,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:25:11,734 INFO L93 Difference]: Finished difference Result 131 states and 162 transitions. [2022-04-28 11:25:11,734 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 162 transitions. [2022-04-28 11:25:11,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:25:11,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:25:11,735 INFO L74 IsIncluded]: Start isIncluded. First operand has 127 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 82 states have internal predecessors, (94), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) Second operand 131 states. [2022-04-28 11:25:11,735 INFO L87 Difference]: Start difference. First operand has 127 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 82 states have internal predecessors, (94), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) Second operand 131 states. [2022-04-28 11:25:11,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:25:11,737 INFO L93 Difference]: Finished difference Result 131 states and 162 transitions. [2022-04-28 11:25:11,737 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 162 transitions. [2022-04-28 11:25:11,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:25:11,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:25:11,738 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:25:11,738 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:25:11,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 82 states have internal predecessors, (94), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 11:25:11,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 158 transitions. [2022-04-28 11:25:11,741 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 158 transitions. Word has length 55 [2022-04-28 11:25:11,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:25:11,742 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 158 transitions. [2022-04-28 11:25:11,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 11:25:11,742 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 127 states and 158 transitions. [2022-04-28 11:25:11,879 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 11:25:11,880 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 158 transitions. [2022-04-28 11:25:11,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-28 11:25:11,880 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:25:11,880 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:25:11,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-28 11:25:12,080 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 11:25:12,081 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:25:12,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:25:12,081 INFO L85 PathProgramCache]: Analyzing trace with hash 765609565, now seen corresponding path program 1 times [2022-04-28 11:25:12,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:25:12,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1558248688] [2022-04-28 11:25:24,814 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:25:24,815 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:25:24,815 INFO L85 PathProgramCache]: Analyzing trace with hash 765609565, now seen corresponding path program 2 times [2022-04-28 11:25:24,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:25:24,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399137251] [2022-04-28 11:25:24,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:25:24,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:25:24,835 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:25:24,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1913554907] [2022-04-28 11:25:24,835 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:25:24,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:25:24,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:25:24,843 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 11:25:24,846 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 11:25:24,882 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:25:24,882 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:25:24,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 11:25:24,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:25:24,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:25:25,104 INFO L272 TraceCheckUtils]: 0: Hoare triple {6089#true} call ULTIMATE.init(); {6089#true} is VALID [2022-04-28 11:25:25,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {6089#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6097#(<= ~counter~0 0)} is VALID [2022-04-28 11:25:25,105 INFO L290 TraceCheckUtils]: 2: Hoare triple {6097#(<= ~counter~0 0)} assume true; {6097#(<= ~counter~0 0)} is VALID [2022-04-28 11:25:25,105 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6097#(<= ~counter~0 0)} {6089#true} #93#return; {6097#(<= ~counter~0 0)} is VALID [2022-04-28 11:25:25,106 INFO L272 TraceCheckUtils]: 4: Hoare triple {6097#(<= ~counter~0 0)} call #t~ret8 := main(); {6097#(<= ~counter~0 0)} is VALID [2022-04-28 11:25:25,106 INFO L290 TraceCheckUtils]: 5: Hoare triple {6097#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {6097#(<= ~counter~0 0)} is VALID [2022-04-28 11:25:25,106 INFO L272 TraceCheckUtils]: 6: Hoare triple {6097#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6097#(<= ~counter~0 0)} is VALID [2022-04-28 11:25:25,107 INFO L290 TraceCheckUtils]: 7: Hoare triple {6097#(<= ~counter~0 0)} ~cond := #in~cond; {6097#(<= ~counter~0 0)} is VALID [2022-04-28 11:25:25,107 INFO L290 TraceCheckUtils]: 8: Hoare triple {6097#(<= ~counter~0 0)} assume !(0 == ~cond); {6097#(<= ~counter~0 0)} is VALID [2022-04-28 11:25:25,107 INFO L290 TraceCheckUtils]: 9: Hoare triple {6097#(<= ~counter~0 0)} assume true; {6097#(<= ~counter~0 0)} is VALID [2022-04-28 11:25:25,108 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6097#(<= ~counter~0 0)} {6097#(<= ~counter~0 0)} #77#return; {6097#(<= ~counter~0 0)} is VALID [2022-04-28 11:25:25,108 INFO L290 TraceCheckUtils]: 11: Hoare triple {6097#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {6097#(<= ~counter~0 0)} is VALID [2022-04-28 11:25:25,108 INFO L290 TraceCheckUtils]: 12: Hoare triple {6097#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6131#(<= ~counter~0 1)} is VALID [2022-04-28 11:25:25,109 INFO L290 TraceCheckUtils]: 13: Hoare triple {6131#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {6131#(<= ~counter~0 1)} is VALID [2022-04-28 11:25:25,109 INFO L272 TraceCheckUtils]: 14: Hoare triple {6131#(<= ~counter~0 1)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {6131#(<= ~counter~0 1)} is VALID [2022-04-28 11:25:25,109 INFO L290 TraceCheckUtils]: 15: Hoare triple {6131#(<= ~counter~0 1)} ~cond := #in~cond; {6131#(<= ~counter~0 1)} is VALID [2022-04-28 11:25:25,110 INFO L290 TraceCheckUtils]: 16: Hoare triple {6131#(<= ~counter~0 1)} assume !(0 == ~cond); {6131#(<= ~counter~0 1)} is VALID [2022-04-28 11:25:25,110 INFO L290 TraceCheckUtils]: 17: Hoare triple {6131#(<= ~counter~0 1)} assume true; {6131#(<= ~counter~0 1)} is VALID [2022-04-28 11:25:25,110 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6131#(<= ~counter~0 1)} {6131#(<= ~counter~0 1)} #79#return; {6131#(<= ~counter~0 1)} is VALID [2022-04-28 11:25:25,111 INFO L272 TraceCheckUtils]: 19: Hoare triple {6131#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {6131#(<= ~counter~0 1)} is VALID [2022-04-28 11:25:25,111 INFO L290 TraceCheckUtils]: 20: Hoare triple {6131#(<= ~counter~0 1)} ~cond := #in~cond; {6131#(<= ~counter~0 1)} is VALID [2022-04-28 11:25:25,111 INFO L290 TraceCheckUtils]: 21: Hoare triple {6131#(<= ~counter~0 1)} assume !(0 == ~cond); {6131#(<= ~counter~0 1)} is VALID [2022-04-28 11:25:25,112 INFO L290 TraceCheckUtils]: 22: Hoare triple {6131#(<= ~counter~0 1)} assume true; {6131#(<= ~counter~0 1)} is VALID [2022-04-28 11:25:25,112 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6131#(<= ~counter~0 1)} {6131#(<= ~counter~0 1)} #81#return; {6131#(<= ~counter~0 1)} is VALID [2022-04-28 11:25:25,112 INFO L290 TraceCheckUtils]: 24: Hoare triple {6131#(<= ~counter~0 1)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {6131#(<= ~counter~0 1)} is VALID [2022-04-28 11:25:25,113 INFO L290 TraceCheckUtils]: 25: Hoare triple {6131#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6171#(<= ~counter~0 2)} is VALID [2022-04-28 11:25:25,113 INFO L290 TraceCheckUtils]: 26: Hoare triple {6171#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {6171#(<= ~counter~0 2)} is VALID [2022-04-28 11:25:25,115 INFO L272 TraceCheckUtils]: 27: Hoare triple {6171#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {6171#(<= ~counter~0 2)} is VALID [2022-04-28 11:25:25,115 INFO L290 TraceCheckUtils]: 28: Hoare triple {6171#(<= ~counter~0 2)} ~cond := #in~cond; {6171#(<= ~counter~0 2)} is VALID [2022-04-28 11:25:25,115 INFO L290 TraceCheckUtils]: 29: Hoare triple {6171#(<= ~counter~0 2)} assume !(0 == ~cond); {6171#(<= ~counter~0 2)} is VALID [2022-04-28 11:25:25,115 INFO L290 TraceCheckUtils]: 30: Hoare triple {6171#(<= ~counter~0 2)} assume true; {6171#(<= ~counter~0 2)} is VALID [2022-04-28 11:25:25,116 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6171#(<= ~counter~0 2)} {6171#(<= ~counter~0 2)} #83#return; {6171#(<= ~counter~0 2)} is VALID [2022-04-28 11:25:25,116 INFO L272 TraceCheckUtils]: 32: Hoare triple {6171#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {6171#(<= ~counter~0 2)} is VALID [2022-04-28 11:25:25,117 INFO L290 TraceCheckUtils]: 33: Hoare triple {6171#(<= ~counter~0 2)} ~cond := #in~cond; {6171#(<= ~counter~0 2)} is VALID [2022-04-28 11:25:25,117 INFO L290 TraceCheckUtils]: 34: Hoare triple {6171#(<= ~counter~0 2)} assume !(0 == ~cond); {6171#(<= ~counter~0 2)} is VALID [2022-04-28 11:25:25,117 INFO L290 TraceCheckUtils]: 35: Hoare triple {6171#(<= ~counter~0 2)} assume true; {6171#(<= ~counter~0 2)} is VALID [2022-04-28 11:25:25,118 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6171#(<= ~counter~0 2)} {6171#(<= ~counter~0 2)} #85#return; {6171#(<= ~counter~0 2)} is VALID [2022-04-28 11:25:25,118 INFO L272 TraceCheckUtils]: 37: Hoare triple {6171#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {6171#(<= ~counter~0 2)} is VALID [2022-04-28 11:25:25,118 INFO L290 TraceCheckUtils]: 38: Hoare triple {6171#(<= ~counter~0 2)} ~cond := #in~cond; {6171#(<= ~counter~0 2)} is VALID [2022-04-28 11:25:25,118 INFO L290 TraceCheckUtils]: 39: Hoare triple {6171#(<= ~counter~0 2)} assume !(0 == ~cond); {6171#(<= ~counter~0 2)} is VALID [2022-04-28 11:25:25,119 INFO L290 TraceCheckUtils]: 40: Hoare triple {6171#(<= ~counter~0 2)} assume true; {6171#(<= ~counter~0 2)} is VALID [2022-04-28 11:25:25,119 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6171#(<= ~counter~0 2)} {6171#(<= ~counter~0 2)} #87#return; {6171#(<= ~counter~0 2)} is VALID [2022-04-28 11:25:25,119 INFO L290 TraceCheckUtils]: 42: Hoare triple {6171#(<= ~counter~0 2)} assume !!(~r~0 >= 2 * ~b~0); {6171#(<= ~counter~0 2)} is VALID [2022-04-28 11:25:25,120 INFO L272 TraceCheckUtils]: 43: Hoare triple {6171#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {6171#(<= ~counter~0 2)} is VALID [2022-04-28 11:25:25,120 INFO L290 TraceCheckUtils]: 44: Hoare triple {6171#(<= ~counter~0 2)} ~cond := #in~cond; {6171#(<= ~counter~0 2)} is VALID [2022-04-28 11:25:25,120 INFO L290 TraceCheckUtils]: 45: Hoare triple {6171#(<= ~counter~0 2)} assume !(0 == ~cond); {6171#(<= ~counter~0 2)} is VALID [2022-04-28 11:25:25,120 INFO L290 TraceCheckUtils]: 46: Hoare triple {6171#(<= ~counter~0 2)} assume true; {6171#(<= ~counter~0 2)} is VALID [2022-04-28 11:25:25,121 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6171#(<= ~counter~0 2)} {6171#(<= ~counter~0 2)} #89#return; {6171#(<= ~counter~0 2)} is VALID [2022-04-28 11:25:25,121 INFO L290 TraceCheckUtils]: 48: Hoare triple {6171#(<= ~counter~0 2)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {6171#(<= ~counter~0 2)} is VALID [2022-04-28 11:25:25,122 INFO L290 TraceCheckUtils]: 49: Hoare triple {6171#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6244#(<= |main_#t~post7| 2)} is VALID [2022-04-28 11:25:25,122 INFO L290 TraceCheckUtils]: 50: Hoare triple {6244#(<= |main_#t~post7| 2)} assume !(#t~post7 < 5);havoc #t~post7; {6090#false} is VALID [2022-04-28 11:25:25,122 INFO L290 TraceCheckUtils]: 51: Hoare triple {6090#false} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {6090#false} is VALID [2022-04-28 11:25:25,122 INFO L290 TraceCheckUtils]: 52: Hoare triple {6090#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6090#false} is VALID [2022-04-28 11:25:25,122 INFO L290 TraceCheckUtils]: 53: Hoare triple {6090#false} assume !(#t~post6 < 5);havoc #t~post6; {6090#false} is VALID [2022-04-28 11:25:25,122 INFO L272 TraceCheckUtils]: 54: Hoare triple {6090#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {6090#false} is VALID [2022-04-28 11:25:25,122 INFO L290 TraceCheckUtils]: 55: Hoare triple {6090#false} ~cond := #in~cond; {6090#false} is VALID [2022-04-28 11:25:25,122 INFO L290 TraceCheckUtils]: 56: Hoare triple {6090#false} assume 0 == ~cond; {6090#false} is VALID [2022-04-28 11:25:25,122 INFO L290 TraceCheckUtils]: 57: Hoare triple {6090#false} assume !false; {6090#false} is VALID [2022-04-28 11:25:25,123 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 14 proven. 34 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 11:25:25,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:25:25,336 INFO L290 TraceCheckUtils]: 57: Hoare triple {6090#false} assume !false; {6090#false} is VALID [2022-04-28 11:25:25,337 INFO L290 TraceCheckUtils]: 56: Hoare triple {6090#false} assume 0 == ~cond; {6090#false} is VALID [2022-04-28 11:25:25,337 INFO L290 TraceCheckUtils]: 55: Hoare triple {6090#false} ~cond := #in~cond; {6090#false} is VALID [2022-04-28 11:25:25,337 INFO L272 TraceCheckUtils]: 54: Hoare triple {6090#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {6090#false} is VALID [2022-04-28 11:25:25,337 INFO L290 TraceCheckUtils]: 53: Hoare triple {6090#false} assume !(#t~post6 < 5);havoc #t~post6; {6090#false} is VALID [2022-04-28 11:25:25,337 INFO L290 TraceCheckUtils]: 52: Hoare triple {6090#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6090#false} is VALID [2022-04-28 11:25:25,337 INFO L290 TraceCheckUtils]: 51: Hoare triple {6090#false} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {6090#false} is VALID [2022-04-28 11:25:25,337 INFO L290 TraceCheckUtils]: 50: Hoare triple {6290#(< |main_#t~post7| 5)} assume !(#t~post7 < 5);havoc #t~post7; {6090#false} is VALID [2022-04-28 11:25:25,337 INFO L290 TraceCheckUtils]: 49: Hoare triple {6294#(< ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6290#(< |main_#t~post7| 5)} is VALID [2022-04-28 11:25:25,338 INFO L290 TraceCheckUtils]: 48: Hoare triple {6294#(< ~counter~0 5)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {6294#(< ~counter~0 5)} is VALID [2022-04-28 11:25:25,338 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6089#true} {6294#(< ~counter~0 5)} #89#return; {6294#(< ~counter~0 5)} is VALID [2022-04-28 11:25:25,338 INFO L290 TraceCheckUtils]: 46: Hoare triple {6089#true} assume true; {6089#true} is VALID [2022-04-28 11:25:25,338 INFO L290 TraceCheckUtils]: 45: Hoare triple {6089#true} assume !(0 == ~cond); {6089#true} is VALID [2022-04-28 11:25:25,338 INFO L290 TraceCheckUtils]: 44: Hoare triple {6089#true} ~cond := #in~cond; {6089#true} is VALID [2022-04-28 11:25:25,338 INFO L272 TraceCheckUtils]: 43: Hoare triple {6294#(< ~counter~0 5)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {6089#true} is VALID [2022-04-28 11:25:25,339 INFO L290 TraceCheckUtils]: 42: Hoare triple {6294#(< ~counter~0 5)} assume !!(~r~0 >= 2 * ~b~0); {6294#(< ~counter~0 5)} is VALID [2022-04-28 11:25:25,339 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6089#true} {6294#(< ~counter~0 5)} #87#return; {6294#(< ~counter~0 5)} is VALID [2022-04-28 11:25:25,339 INFO L290 TraceCheckUtils]: 40: Hoare triple {6089#true} assume true; {6089#true} is VALID [2022-04-28 11:25:25,339 INFO L290 TraceCheckUtils]: 39: Hoare triple {6089#true} assume !(0 == ~cond); {6089#true} is VALID [2022-04-28 11:25:25,339 INFO L290 TraceCheckUtils]: 38: Hoare triple {6089#true} ~cond := #in~cond; {6089#true} is VALID [2022-04-28 11:25:25,339 INFO L272 TraceCheckUtils]: 37: Hoare triple {6294#(< ~counter~0 5)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {6089#true} is VALID [2022-04-28 11:25:25,340 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6089#true} {6294#(< ~counter~0 5)} #85#return; {6294#(< ~counter~0 5)} is VALID [2022-04-28 11:25:25,340 INFO L290 TraceCheckUtils]: 35: Hoare triple {6089#true} assume true; {6089#true} is VALID [2022-04-28 11:25:25,340 INFO L290 TraceCheckUtils]: 34: Hoare triple {6089#true} assume !(0 == ~cond); {6089#true} is VALID [2022-04-28 11:25:25,340 INFO L290 TraceCheckUtils]: 33: Hoare triple {6089#true} ~cond := #in~cond; {6089#true} is VALID [2022-04-28 11:25:25,340 INFO L272 TraceCheckUtils]: 32: Hoare triple {6294#(< ~counter~0 5)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {6089#true} is VALID [2022-04-28 11:25:25,340 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6089#true} {6294#(< ~counter~0 5)} #83#return; {6294#(< ~counter~0 5)} is VALID [2022-04-28 11:25:25,340 INFO L290 TraceCheckUtils]: 30: Hoare triple {6089#true} assume true; {6089#true} is VALID [2022-04-28 11:25:25,340 INFO L290 TraceCheckUtils]: 29: Hoare triple {6089#true} assume !(0 == ~cond); {6089#true} is VALID [2022-04-28 11:25:25,340 INFO L290 TraceCheckUtils]: 28: Hoare triple {6089#true} ~cond := #in~cond; {6089#true} is VALID [2022-04-28 11:25:25,340 INFO L272 TraceCheckUtils]: 27: Hoare triple {6294#(< ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {6089#true} is VALID [2022-04-28 11:25:25,341 INFO L290 TraceCheckUtils]: 26: Hoare triple {6294#(< ~counter~0 5)} assume !!(#t~post7 < 5);havoc #t~post7; {6294#(< ~counter~0 5)} is VALID [2022-04-28 11:25:25,341 INFO L290 TraceCheckUtils]: 25: Hoare triple {6367#(< ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6294#(< ~counter~0 5)} is VALID [2022-04-28 11:25:25,341 INFO L290 TraceCheckUtils]: 24: Hoare triple {6367#(< ~counter~0 4)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {6367#(< ~counter~0 4)} is VALID [2022-04-28 11:25:25,342 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6089#true} {6367#(< ~counter~0 4)} #81#return; {6367#(< ~counter~0 4)} is VALID [2022-04-28 11:25:25,342 INFO L290 TraceCheckUtils]: 22: Hoare triple {6089#true} assume true; {6089#true} is VALID [2022-04-28 11:25:25,342 INFO L290 TraceCheckUtils]: 21: Hoare triple {6089#true} assume !(0 == ~cond); {6089#true} is VALID [2022-04-28 11:25:25,342 INFO L290 TraceCheckUtils]: 20: Hoare triple {6089#true} ~cond := #in~cond; {6089#true} is VALID [2022-04-28 11:25:25,342 INFO L272 TraceCheckUtils]: 19: Hoare triple {6367#(< ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {6089#true} is VALID [2022-04-28 11:25:25,343 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6089#true} {6367#(< ~counter~0 4)} #79#return; {6367#(< ~counter~0 4)} is VALID [2022-04-28 11:25:25,343 INFO L290 TraceCheckUtils]: 17: Hoare triple {6089#true} assume true; {6089#true} is VALID [2022-04-28 11:25:25,343 INFO L290 TraceCheckUtils]: 16: Hoare triple {6089#true} assume !(0 == ~cond); {6089#true} is VALID [2022-04-28 11:25:25,343 INFO L290 TraceCheckUtils]: 15: Hoare triple {6089#true} ~cond := #in~cond; {6089#true} is VALID [2022-04-28 11:25:25,343 INFO L272 TraceCheckUtils]: 14: Hoare triple {6367#(< ~counter~0 4)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {6089#true} is VALID [2022-04-28 11:25:25,343 INFO L290 TraceCheckUtils]: 13: Hoare triple {6367#(< ~counter~0 4)} assume !!(#t~post6 < 5);havoc #t~post6; {6367#(< ~counter~0 4)} is VALID [2022-04-28 11:25:25,343 INFO L290 TraceCheckUtils]: 12: Hoare triple {6171#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6367#(< ~counter~0 4)} is VALID [2022-04-28 11:25:25,344 INFO L290 TraceCheckUtils]: 11: Hoare triple {6171#(<= ~counter~0 2)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {6171#(<= ~counter~0 2)} is VALID [2022-04-28 11:25:25,344 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6089#true} {6171#(<= ~counter~0 2)} #77#return; {6171#(<= ~counter~0 2)} is VALID [2022-04-28 11:25:25,344 INFO L290 TraceCheckUtils]: 9: Hoare triple {6089#true} assume true; {6089#true} is VALID [2022-04-28 11:25:25,344 INFO L290 TraceCheckUtils]: 8: Hoare triple {6089#true} assume !(0 == ~cond); {6089#true} is VALID [2022-04-28 11:25:25,344 INFO L290 TraceCheckUtils]: 7: Hoare triple {6089#true} ~cond := #in~cond; {6089#true} is VALID [2022-04-28 11:25:25,344 INFO L272 TraceCheckUtils]: 6: Hoare triple {6171#(<= ~counter~0 2)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6089#true} is VALID [2022-04-28 11:25:25,344 INFO L290 TraceCheckUtils]: 5: Hoare triple {6171#(<= ~counter~0 2)} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {6171#(<= ~counter~0 2)} is VALID [2022-04-28 11:25:25,345 INFO L272 TraceCheckUtils]: 4: Hoare triple {6171#(<= ~counter~0 2)} call #t~ret8 := main(); {6171#(<= ~counter~0 2)} is VALID [2022-04-28 11:25:25,345 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6171#(<= ~counter~0 2)} {6089#true} #93#return; {6171#(<= ~counter~0 2)} is VALID [2022-04-28 11:25:25,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {6171#(<= ~counter~0 2)} assume true; {6171#(<= ~counter~0 2)} is VALID [2022-04-28 11:25:25,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {6089#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6171#(<= ~counter~0 2)} is VALID [2022-04-28 11:25:25,346 INFO L272 TraceCheckUtils]: 0: Hoare triple {6089#true} call ULTIMATE.init(); {6089#true} is VALID [2022-04-28 11:25:25,346 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 11:25:25,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:25:25,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399137251] [2022-04-28 11:25:25,346 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:25:25,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913554907] [2022-04-28 11:25:25,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913554907] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:25:25,356 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:25:25,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-04-28 11:25:25,356 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:25:25,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1558248688] [2022-04-28 11:25:25,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1558248688] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:25:25,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:25:25,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:25:25,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671166697] [2022-04-28 11:25:25,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:25:25,357 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 58 [2022-04-28 11:25:25,357 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:25:25,357 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 11:25:25,385 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:25:25,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 11:25:25,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:25:25,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 11:25:25,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-28 11:25:25,386 INFO L87 Difference]: Start difference. First operand 127 states and 158 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 11:25:25,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:25:25,627 INFO L93 Difference]: Finished difference Result 173 states and 218 transitions. [2022-04-28 11:25:25,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:25:25,627 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 58 [2022-04-28 11:25:25,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:25:25,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 11:25:25,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 103 transitions. [2022-04-28 11:25:25,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 11:25:25,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 103 transitions. [2022-04-28 11:25:25,630 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 103 transitions. [2022-04-28 11:25:25,696 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:25:25,708 INFO L225 Difference]: With dead ends: 173 [2022-04-28 11:25:25,708 INFO L226 Difference]: Without dead ends: 130 [2022-04-28 11:25:25,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:25:25,709 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 16 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:25:25,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 129 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:25:25,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-04-28 11:25:25,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-04-28 11:25:25,815 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:25:25,816 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand has 130 states, 82 states have (on average 1.1829268292682926) internal successors, (97), 84 states have internal predecessors, (97), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 11:25:25,816 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand has 130 states, 82 states have (on average 1.1829268292682926) internal successors, (97), 84 states have internal predecessors, (97), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 11:25:25,816 INFO L87 Difference]: Start difference. First operand 130 states. Second operand has 130 states, 82 states have (on average 1.1829268292682926) internal successors, (97), 84 states have internal predecessors, (97), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 11:25:25,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:25:25,820 INFO L93 Difference]: Finished difference Result 130 states and 161 transitions. [2022-04-28 11:25:25,820 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 161 transitions. [2022-04-28 11:25:25,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:25:25,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:25:25,821 INFO L74 IsIncluded]: Start isIncluded. First operand has 130 states, 82 states have (on average 1.1829268292682926) internal successors, (97), 84 states have internal predecessors, (97), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) Second operand 130 states. [2022-04-28 11:25:25,821 INFO L87 Difference]: Start difference. First operand has 130 states, 82 states have (on average 1.1829268292682926) internal successors, (97), 84 states have internal predecessors, (97), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) Second operand 130 states. [2022-04-28 11:25:25,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:25:25,824 INFO L93 Difference]: Finished difference Result 130 states and 161 transitions. [2022-04-28 11:25:25,825 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 161 transitions. [2022-04-28 11:25:25,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:25:25,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:25:25,825 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:25:25,825 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:25:25,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 82 states have (on average 1.1829268292682926) internal successors, (97), 84 states have internal predecessors, (97), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 11:25:25,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 161 transitions. [2022-04-28 11:25:25,829 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 161 transitions. Word has length 58 [2022-04-28 11:25:25,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:25:25,829 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 161 transitions. [2022-04-28 11:25:25,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 11:25:25,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 130 states and 161 transitions. [2022-04-28 11:25:25,984 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:25:25,984 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 161 transitions. [2022-04-28 11:25:25,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-28 11:25:25,985 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:25:25,985 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 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] [2022-04-28 11:25:26,002 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 11:25:26,185 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 11:25:26,186 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:25:26,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:25:26,186 INFO L85 PathProgramCache]: Analyzing trace with hash 78053411, now seen corresponding path program 1 times [2022-04-28 11:25:26,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:25:26,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1414209120] [2022-04-28 11:25:41,972 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:25:41,972 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:25:41,972 INFO L85 PathProgramCache]: Analyzing trace with hash 78053411, now seen corresponding path program 2 times [2022-04-28 11:25:41,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:25:41,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603791980] [2022-04-28 11:25:41,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:25:41,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:25:41,982 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:25:41,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1763446589] [2022-04-28 11:25:41,982 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:25:41,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:25:41,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:25:41,983 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 11:25:42,001 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 11:25:42,039 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:25:42,039 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:25:42,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 11:25:42,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:25:42,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:25:42,227 INFO L272 TraceCheckUtils]: 0: Hoare triple {7313#true} call ULTIMATE.init(); {7313#true} is VALID [2022-04-28 11:25:42,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {7313#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7313#true} is VALID [2022-04-28 11:25:42,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {7313#true} assume true; {7313#true} is VALID [2022-04-28 11:25:42,227 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7313#true} {7313#true} #93#return; {7313#true} is VALID [2022-04-28 11:25:42,227 INFO L272 TraceCheckUtils]: 4: Hoare triple {7313#true} call #t~ret8 := main(); {7313#true} is VALID [2022-04-28 11:25:42,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {7313#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {7313#true} is VALID [2022-04-28 11:25:42,227 INFO L272 TraceCheckUtils]: 6: Hoare triple {7313#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7313#true} is VALID [2022-04-28 11:25:42,227 INFO L290 TraceCheckUtils]: 7: Hoare triple {7313#true} ~cond := #in~cond; {7313#true} is VALID [2022-04-28 11:25:42,227 INFO L290 TraceCheckUtils]: 8: Hoare triple {7313#true} assume !(0 == ~cond); {7313#true} is VALID [2022-04-28 11:25:42,227 INFO L290 TraceCheckUtils]: 9: Hoare triple {7313#true} assume true; {7313#true} is VALID [2022-04-28 11:25:42,227 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7313#true} {7313#true} #77#return; {7313#true} is VALID [2022-04-28 11:25:42,227 INFO L290 TraceCheckUtils]: 11: Hoare triple {7313#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {7313#true} is VALID [2022-04-28 11:25:42,228 INFO L290 TraceCheckUtils]: 12: Hoare triple {7313#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7313#true} is VALID [2022-04-28 11:25:42,228 INFO L290 TraceCheckUtils]: 13: Hoare triple {7313#true} assume !!(#t~post6 < 5);havoc #t~post6; {7313#true} is VALID [2022-04-28 11:25:42,228 INFO L272 TraceCheckUtils]: 14: Hoare triple {7313#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {7313#true} is VALID [2022-04-28 11:25:42,228 INFO L290 TraceCheckUtils]: 15: Hoare triple {7313#true} ~cond := #in~cond; {7313#true} is VALID [2022-04-28 11:25:42,228 INFO L290 TraceCheckUtils]: 16: Hoare triple {7313#true} assume !(0 == ~cond); {7313#true} is VALID [2022-04-28 11:25:42,228 INFO L290 TraceCheckUtils]: 17: Hoare triple {7313#true} assume true; {7313#true} is VALID [2022-04-28 11:25:42,228 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7313#true} {7313#true} #79#return; {7313#true} is VALID [2022-04-28 11:25:42,228 INFO L272 TraceCheckUtils]: 19: Hoare triple {7313#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {7313#true} is VALID [2022-04-28 11:25:42,228 INFO L290 TraceCheckUtils]: 20: Hoare triple {7313#true} ~cond := #in~cond; {7313#true} is VALID [2022-04-28 11:25:42,228 INFO L290 TraceCheckUtils]: 21: Hoare triple {7313#true} assume !(0 == ~cond); {7313#true} is VALID [2022-04-28 11:25:42,228 INFO L290 TraceCheckUtils]: 22: Hoare triple {7313#true} assume true; {7313#true} is VALID [2022-04-28 11:25:42,228 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7313#true} {7313#true} #81#return; {7313#true} is VALID [2022-04-28 11:25:42,229 INFO L290 TraceCheckUtils]: 24: Hoare triple {7313#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {7390#(<= main_~b~0 main_~y~0)} is VALID [2022-04-28 11:25:42,229 INFO L290 TraceCheckUtils]: 25: Hoare triple {7390#(<= main_~b~0 main_~y~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7390#(<= main_~b~0 main_~y~0)} is VALID [2022-04-28 11:25:42,229 INFO L290 TraceCheckUtils]: 26: Hoare triple {7390#(<= main_~b~0 main_~y~0)} assume !!(#t~post7 < 5);havoc #t~post7; {7390#(<= main_~b~0 main_~y~0)} is VALID [2022-04-28 11:25:42,230 INFO L272 TraceCheckUtils]: 27: Hoare triple {7390#(<= main_~b~0 main_~y~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {7313#true} is VALID [2022-04-28 11:25:42,230 INFO L290 TraceCheckUtils]: 28: Hoare triple {7313#true} ~cond := #in~cond; {7313#true} is VALID [2022-04-28 11:25:42,230 INFO L290 TraceCheckUtils]: 29: Hoare triple {7313#true} assume !(0 == ~cond); {7313#true} is VALID [2022-04-28 11:25:42,230 INFO L290 TraceCheckUtils]: 30: Hoare triple {7313#true} assume true; {7313#true} is VALID [2022-04-28 11:25:42,230 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {7313#true} {7390#(<= main_~b~0 main_~y~0)} #83#return; {7390#(<= main_~b~0 main_~y~0)} is VALID [2022-04-28 11:25:42,230 INFO L272 TraceCheckUtils]: 32: Hoare triple {7390#(<= main_~b~0 main_~y~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {7313#true} is VALID [2022-04-28 11:25:42,230 INFO L290 TraceCheckUtils]: 33: Hoare triple {7313#true} ~cond := #in~cond; {7313#true} is VALID [2022-04-28 11:25:42,230 INFO L290 TraceCheckUtils]: 34: Hoare triple {7313#true} assume !(0 == ~cond); {7313#true} is VALID [2022-04-28 11:25:42,230 INFO L290 TraceCheckUtils]: 35: Hoare triple {7313#true} assume true; {7313#true} is VALID [2022-04-28 11:25:42,231 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7313#true} {7390#(<= main_~b~0 main_~y~0)} #85#return; {7390#(<= main_~b~0 main_~y~0)} is VALID [2022-04-28 11:25:42,231 INFO L272 TraceCheckUtils]: 37: Hoare triple {7390#(<= main_~b~0 main_~y~0)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {7313#true} is VALID [2022-04-28 11:25:42,231 INFO L290 TraceCheckUtils]: 38: Hoare triple {7313#true} ~cond := #in~cond; {7313#true} is VALID [2022-04-28 11:25:42,231 INFO L290 TraceCheckUtils]: 39: Hoare triple {7313#true} assume !(0 == ~cond); {7313#true} is VALID [2022-04-28 11:25:42,231 INFO L290 TraceCheckUtils]: 40: Hoare triple {7313#true} assume true; {7313#true} is VALID [2022-04-28 11:25:42,231 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7313#true} {7390#(<= main_~b~0 main_~y~0)} #87#return; {7390#(<= main_~b~0 main_~y~0)} is VALID [2022-04-28 11:25:42,232 INFO L290 TraceCheckUtils]: 42: Hoare triple {7390#(<= main_~b~0 main_~y~0)} assume !(~r~0 >= 2 * ~b~0); {7445#(and (not (<= (* main_~b~0 2) main_~r~0)) (<= main_~b~0 main_~y~0))} is VALID [2022-04-28 11:25:42,232 INFO L290 TraceCheckUtils]: 43: Hoare triple {7445#(and (not (<= (* main_~b~0 2) main_~r~0)) (<= main_~b~0 main_~y~0))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {7449#(< main_~r~0 main_~y~0)} is VALID [2022-04-28 11:25:42,233 INFO L290 TraceCheckUtils]: 44: Hoare triple {7449#(< main_~r~0 main_~y~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7449#(< main_~r~0 main_~y~0)} is VALID [2022-04-28 11:25:42,233 INFO L290 TraceCheckUtils]: 45: Hoare triple {7449#(< main_~r~0 main_~y~0)} assume !!(#t~post6 < 5);havoc #t~post6; {7449#(< main_~r~0 main_~y~0)} is VALID [2022-04-28 11:25:42,233 INFO L272 TraceCheckUtils]: 46: Hoare triple {7449#(< main_~r~0 main_~y~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {7313#true} is VALID [2022-04-28 11:25:42,233 INFO L290 TraceCheckUtils]: 47: Hoare triple {7313#true} ~cond := #in~cond; {7313#true} is VALID [2022-04-28 11:25:42,233 INFO L290 TraceCheckUtils]: 48: Hoare triple {7313#true} assume !(0 == ~cond); {7313#true} is VALID [2022-04-28 11:25:42,233 INFO L290 TraceCheckUtils]: 49: Hoare triple {7313#true} assume true; {7313#true} is VALID [2022-04-28 11:25:42,234 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7313#true} {7449#(< main_~r~0 main_~y~0)} #79#return; {7449#(< main_~r~0 main_~y~0)} is VALID [2022-04-28 11:25:42,234 INFO L272 TraceCheckUtils]: 51: Hoare triple {7449#(< main_~r~0 main_~y~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {7313#true} is VALID [2022-04-28 11:25:42,234 INFO L290 TraceCheckUtils]: 52: Hoare triple {7313#true} ~cond := #in~cond; {7313#true} is VALID [2022-04-28 11:25:42,234 INFO L290 TraceCheckUtils]: 53: Hoare triple {7313#true} assume !(0 == ~cond); {7313#true} is VALID [2022-04-28 11:25:42,234 INFO L290 TraceCheckUtils]: 54: Hoare triple {7313#true} assume true; {7313#true} is VALID [2022-04-28 11:25:42,234 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {7313#true} {7449#(< main_~r~0 main_~y~0)} #81#return; {7449#(< main_~r~0 main_~y~0)} is VALID [2022-04-28 11:25:42,235 INFO L290 TraceCheckUtils]: 56: Hoare triple {7449#(< main_~r~0 main_~y~0)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {7314#false} is VALID [2022-04-28 11:25:42,235 INFO L290 TraceCheckUtils]: 57: Hoare triple {7314#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7314#false} is VALID [2022-04-28 11:25:42,235 INFO L290 TraceCheckUtils]: 58: Hoare triple {7314#false} assume !(#t~post7 < 5);havoc #t~post7; {7314#false} is VALID [2022-04-28 11:25:42,235 INFO L290 TraceCheckUtils]: 59: Hoare triple {7314#false} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {7314#false} is VALID [2022-04-28 11:25:42,235 INFO L290 TraceCheckUtils]: 60: Hoare triple {7314#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7314#false} is VALID [2022-04-28 11:25:42,235 INFO L290 TraceCheckUtils]: 61: Hoare triple {7314#false} assume !(#t~post6 < 5);havoc #t~post6; {7314#false} is VALID [2022-04-28 11:25:42,235 INFO L272 TraceCheckUtils]: 62: Hoare triple {7314#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {7314#false} is VALID [2022-04-28 11:25:42,235 INFO L290 TraceCheckUtils]: 63: Hoare triple {7314#false} ~cond := #in~cond; {7314#false} is VALID [2022-04-28 11:25:42,235 INFO L290 TraceCheckUtils]: 64: Hoare triple {7314#false} assume 0 == ~cond; {7314#false} is VALID [2022-04-28 11:25:42,235 INFO L290 TraceCheckUtils]: 65: Hoare triple {7314#false} assume !false; {7314#false} is VALID [2022-04-28 11:25:42,235 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-28 11:25:42,235 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:25:42,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:25:42,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603791980] [2022-04-28 11:25:42,236 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:25:42,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763446589] [2022-04-28 11:25:42,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763446589] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:25:42,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:25:42,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:25:42,236 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:25:42,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1414209120] [2022-04-28 11:25:42,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1414209120] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:25:42,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:25:42,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:25:42,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808111634] [2022-04-28 11:25:42,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:25:42,237 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 66 [2022-04-28 11:25:42,237 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:25:42,237 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 11:25:42,269 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:25:42,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:25:42,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:25:42,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:25:42,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:25:42,270 INFO L87 Difference]: Start difference. First operand 130 states and 161 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 11:25:42,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:25:42,538 INFO L93 Difference]: Finished difference Result 190 states and 240 transitions. [2022-04-28 11:25:42,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 11:25:42,539 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 66 [2022-04-28 11:25:42,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:25:42,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 11:25:42,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2022-04-28 11:25:42,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 11:25:42,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2022-04-28 11:25:42,541 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 109 transitions. [2022-04-28 11:25:42,617 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 11:25:42,619 INFO L225 Difference]: With dead ends: 190 [2022-04-28 11:25:42,619 INFO L226 Difference]: Without dead ends: 119 [2022-04-28 11:25:42,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 63 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 11:25:42,622 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 11 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:25:42,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 120 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:25:42,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-04-28 11:25:42,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 112. [2022-04-28 11:25:42,737 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:25:42,738 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand has 112 states, 72 states have (on average 1.1527777777777777) internal successors, (83), 74 states have internal predecessors, (83), 26 states have call successors, (26), 14 states have call predecessors, (26), 13 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:25:42,739 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand has 112 states, 72 states have (on average 1.1527777777777777) internal successors, (83), 74 states have internal predecessors, (83), 26 states have call successors, (26), 14 states have call predecessors, (26), 13 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:25:42,739 INFO L87 Difference]: Start difference. First operand 119 states. Second operand has 112 states, 72 states have (on average 1.1527777777777777) internal successors, (83), 74 states have internal predecessors, (83), 26 states have call successors, (26), 14 states have call predecessors, (26), 13 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:25:42,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:25:42,741 INFO L93 Difference]: Finished difference Result 119 states and 143 transitions. [2022-04-28 11:25:42,741 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 143 transitions. [2022-04-28 11:25:42,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:25:42,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:25:42,742 INFO L74 IsIncluded]: Start isIncluded. First operand has 112 states, 72 states have (on average 1.1527777777777777) internal successors, (83), 74 states have internal predecessors, (83), 26 states have call successors, (26), 14 states have call predecessors, (26), 13 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 119 states. [2022-04-28 11:25:42,742 INFO L87 Difference]: Start difference. First operand has 112 states, 72 states have (on average 1.1527777777777777) internal successors, (83), 74 states have internal predecessors, (83), 26 states have call successors, (26), 14 states have call predecessors, (26), 13 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 119 states. [2022-04-28 11:25:42,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:25:42,745 INFO L93 Difference]: Finished difference Result 119 states and 143 transitions. [2022-04-28 11:25:42,745 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 143 transitions. [2022-04-28 11:25:42,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:25:42,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:25:42,745 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:25:42,745 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:25:42,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 72 states have (on average 1.1527777777777777) internal successors, (83), 74 states have internal predecessors, (83), 26 states have call successors, (26), 14 states have call predecessors, (26), 13 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:25:42,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 133 transitions. [2022-04-28 11:25:42,750 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 133 transitions. Word has length 66 [2022-04-28 11:25:42,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:25:42,750 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 133 transitions. [2022-04-28 11:25:42,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 11:25:42,750 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 112 states and 133 transitions. [2022-04-28 11:25:42,871 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:25:42,872 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 133 transitions. [2022-04-28 11:25:42,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-28 11:25:42,872 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:25:42,872 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 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 11:25:42,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-04-28 11:25:43,089 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 11:25:43,091 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:25:43,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:25:43,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1361251212, now seen corresponding path program 1 times [2022-04-28 11:25:43,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:25:43,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1255771067] [2022-04-28 11:26:02,741 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:26:02,741 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:26:02,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1361251212, now seen corresponding path program 2 times [2022-04-28 11:26:02,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:26:02,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629363172] [2022-04-28 11:26:02,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:26:02,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:26:02,750 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:26:02,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1885706376] [2022-04-28 11:26:02,750 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:26:02,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:26:02,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:26:02,752 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 11:26:02,753 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 11:26:02,799 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:26:02,799 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:26:02,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 11:26:02,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:26:02,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:26:03,062 INFO L272 TraceCheckUtils]: 0: Hoare triple {8360#true} call ULTIMATE.init(); {8360#true} is VALID [2022-04-28 11:26:03,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {8360#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8368#(<= ~counter~0 0)} is VALID [2022-04-28 11:26:03,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {8368#(<= ~counter~0 0)} assume true; {8368#(<= ~counter~0 0)} is VALID [2022-04-28 11:26:03,064 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8368#(<= ~counter~0 0)} {8360#true} #93#return; {8368#(<= ~counter~0 0)} is VALID [2022-04-28 11:26:03,064 INFO L272 TraceCheckUtils]: 4: Hoare triple {8368#(<= ~counter~0 0)} call #t~ret8 := main(); {8368#(<= ~counter~0 0)} is VALID [2022-04-28 11:26:03,064 INFO L290 TraceCheckUtils]: 5: Hoare triple {8368#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {8368#(<= ~counter~0 0)} is VALID [2022-04-28 11:26:03,064 INFO L272 TraceCheckUtils]: 6: Hoare triple {8368#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8368#(<= ~counter~0 0)} is VALID [2022-04-28 11:26:03,065 INFO L290 TraceCheckUtils]: 7: Hoare triple {8368#(<= ~counter~0 0)} ~cond := #in~cond; {8368#(<= ~counter~0 0)} is VALID [2022-04-28 11:26:03,065 INFO L290 TraceCheckUtils]: 8: Hoare triple {8368#(<= ~counter~0 0)} assume !(0 == ~cond); {8368#(<= ~counter~0 0)} is VALID [2022-04-28 11:26:03,065 INFO L290 TraceCheckUtils]: 9: Hoare triple {8368#(<= ~counter~0 0)} assume true; {8368#(<= ~counter~0 0)} is VALID [2022-04-28 11:26:03,066 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8368#(<= ~counter~0 0)} {8368#(<= ~counter~0 0)} #77#return; {8368#(<= ~counter~0 0)} is VALID [2022-04-28 11:26:03,066 INFO L290 TraceCheckUtils]: 11: Hoare triple {8368#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {8368#(<= ~counter~0 0)} is VALID [2022-04-28 11:26:03,066 INFO L290 TraceCheckUtils]: 12: Hoare triple {8368#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8402#(<= ~counter~0 1)} is VALID [2022-04-28 11:26:03,067 INFO L290 TraceCheckUtils]: 13: Hoare triple {8402#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {8402#(<= ~counter~0 1)} is VALID [2022-04-28 11:26:03,067 INFO L272 TraceCheckUtils]: 14: Hoare triple {8402#(<= ~counter~0 1)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {8402#(<= ~counter~0 1)} is VALID [2022-04-28 11:26:03,067 INFO L290 TraceCheckUtils]: 15: Hoare triple {8402#(<= ~counter~0 1)} ~cond := #in~cond; {8402#(<= ~counter~0 1)} is VALID [2022-04-28 11:26:03,068 INFO L290 TraceCheckUtils]: 16: Hoare triple {8402#(<= ~counter~0 1)} assume !(0 == ~cond); {8402#(<= ~counter~0 1)} is VALID [2022-04-28 11:26:03,068 INFO L290 TraceCheckUtils]: 17: Hoare triple {8402#(<= ~counter~0 1)} assume true; {8402#(<= ~counter~0 1)} is VALID [2022-04-28 11:26:03,068 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8402#(<= ~counter~0 1)} {8402#(<= ~counter~0 1)} #79#return; {8402#(<= ~counter~0 1)} is VALID [2022-04-28 11:26:03,069 INFO L272 TraceCheckUtils]: 19: Hoare triple {8402#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {8402#(<= ~counter~0 1)} is VALID [2022-04-28 11:26:03,069 INFO L290 TraceCheckUtils]: 20: Hoare triple {8402#(<= ~counter~0 1)} ~cond := #in~cond; {8402#(<= ~counter~0 1)} is VALID [2022-04-28 11:26:03,069 INFO L290 TraceCheckUtils]: 21: Hoare triple {8402#(<= ~counter~0 1)} assume !(0 == ~cond); {8402#(<= ~counter~0 1)} is VALID [2022-04-28 11:26:03,069 INFO L290 TraceCheckUtils]: 22: Hoare triple {8402#(<= ~counter~0 1)} assume true; {8402#(<= ~counter~0 1)} is VALID [2022-04-28 11:26:03,070 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8402#(<= ~counter~0 1)} {8402#(<= ~counter~0 1)} #81#return; {8402#(<= ~counter~0 1)} is VALID [2022-04-28 11:26:03,070 INFO L290 TraceCheckUtils]: 24: Hoare triple {8402#(<= ~counter~0 1)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {8402#(<= ~counter~0 1)} is VALID [2022-04-28 11:26:03,070 INFO L290 TraceCheckUtils]: 25: Hoare triple {8402#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8442#(<= ~counter~0 2)} is VALID [2022-04-28 11:26:03,071 INFO L290 TraceCheckUtils]: 26: Hoare triple {8442#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {8442#(<= ~counter~0 2)} is VALID [2022-04-28 11:26:03,071 INFO L272 TraceCheckUtils]: 27: Hoare triple {8442#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {8442#(<= ~counter~0 2)} is VALID [2022-04-28 11:26:03,071 INFO L290 TraceCheckUtils]: 28: Hoare triple {8442#(<= ~counter~0 2)} ~cond := #in~cond; {8442#(<= ~counter~0 2)} is VALID [2022-04-28 11:26:03,072 INFO L290 TraceCheckUtils]: 29: Hoare triple {8442#(<= ~counter~0 2)} assume !(0 == ~cond); {8442#(<= ~counter~0 2)} is VALID [2022-04-28 11:26:03,072 INFO L290 TraceCheckUtils]: 30: Hoare triple {8442#(<= ~counter~0 2)} assume true; {8442#(<= ~counter~0 2)} is VALID [2022-04-28 11:26:03,072 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {8442#(<= ~counter~0 2)} {8442#(<= ~counter~0 2)} #83#return; {8442#(<= ~counter~0 2)} is VALID [2022-04-28 11:26:03,073 INFO L272 TraceCheckUtils]: 32: Hoare triple {8442#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {8442#(<= ~counter~0 2)} is VALID [2022-04-28 11:26:03,073 INFO L290 TraceCheckUtils]: 33: Hoare triple {8442#(<= ~counter~0 2)} ~cond := #in~cond; {8442#(<= ~counter~0 2)} is VALID [2022-04-28 11:26:03,073 INFO L290 TraceCheckUtils]: 34: Hoare triple {8442#(<= ~counter~0 2)} assume !(0 == ~cond); {8442#(<= ~counter~0 2)} is VALID [2022-04-28 11:26:03,073 INFO L290 TraceCheckUtils]: 35: Hoare triple {8442#(<= ~counter~0 2)} assume true; {8442#(<= ~counter~0 2)} is VALID [2022-04-28 11:26:03,074 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8442#(<= ~counter~0 2)} {8442#(<= ~counter~0 2)} #85#return; {8442#(<= ~counter~0 2)} is VALID [2022-04-28 11:26:03,074 INFO L272 TraceCheckUtils]: 37: Hoare triple {8442#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {8442#(<= ~counter~0 2)} is VALID [2022-04-28 11:26:03,074 INFO L290 TraceCheckUtils]: 38: Hoare triple {8442#(<= ~counter~0 2)} ~cond := #in~cond; {8442#(<= ~counter~0 2)} is VALID [2022-04-28 11:26:03,075 INFO L290 TraceCheckUtils]: 39: Hoare triple {8442#(<= ~counter~0 2)} assume !(0 == ~cond); {8442#(<= ~counter~0 2)} is VALID [2022-04-28 11:26:03,075 INFO L290 TraceCheckUtils]: 40: Hoare triple {8442#(<= ~counter~0 2)} assume true; {8442#(<= ~counter~0 2)} is VALID [2022-04-28 11:26:03,075 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {8442#(<= ~counter~0 2)} {8442#(<= ~counter~0 2)} #87#return; {8442#(<= ~counter~0 2)} is VALID [2022-04-28 11:26:03,075 INFO L290 TraceCheckUtils]: 42: Hoare triple {8442#(<= ~counter~0 2)} assume !!(~r~0 >= 2 * ~b~0); {8442#(<= ~counter~0 2)} is VALID [2022-04-28 11:26:03,076 INFO L272 TraceCheckUtils]: 43: Hoare triple {8442#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {8442#(<= ~counter~0 2)} is VALID [2022-04-28 11:26:03,076 INFO L290 TraceCheckUtils]: 44: Hoare triple {8442#(<= ~counter~0 2)} ~cond := #in~cond; {8442#(<= ~counter~0 2)} is VALID [2022-04-28 11:26:03,076 INFO L290 TraceCheckUtils]: 45: Hoare triple {8442#(<= ~counter~0 2)} assume !(0 == ~cond); {8442#(<= ~counter~0 2)} is VALID [2022-04-28 11:26:03,077 INFO L290 TraceCheckUtils]: 46: Hoare triple {8442#(<= ~counter~0 2)} assume true; {8442#(<= ~counter~0 2)} is VALID [2022-04-28 11:26:03,077 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8442#(<= ~counter~0 2)} {8442#(<= ~counter~0 2)} #89#return; {8442#(<= ~counter~0 2)} is VALID [2022-04-28 11:26:03,077 INFO L290 TraceCheckUtils]: 48: Hoare triple {8442#(<= ~counter~0 2)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {8442#(<= ~counter~0 2)} is VALID [2022-04-28 11:26:03,078 INFO L290 TraceCheckUtils]: 49: Hoare triple {8442#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8515#(<= ~counter~0 3)} is VALID [2022-04-28 11:26:03,078 INFO L290 TraceCheckUtils]: 50: Hoare triple {8515#(<= ~counter~0 3)} assume !!(#t~post7 < 5);havoc #t~post7; {8515#(<= ~counter~0 3)} is VALID [2022-04-28 11:26:03,078 INFO L272 TraceCheckUtils]: 51: Hoare triple {8515#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {8515#(<= ~counter~0 3)} is VALID [2022-04-28 11:26:03,078 INFO L290 TraceCheckUtils]: 52: Hoare triple {8515#(<= ~counter~0 3)} ~cond := #in~cond; {8515#(<= ~counter~0 3)} is VALID [2022-04-28 11:26:03,079 INFO L290 TraceCheckUtils]: 53: Hoare triple {8515#(<= ~counter~0 3)} assume !(0 == ~cond); {8515#(<= ~counter~0 3)} is VALID [2022-04-28 11:26:03,079 INFO L290 TraceCheckUtils]: 54: Hoare triple {8515#(<= ~counter~0 3)} assume true; {8515#(<= ~counter~0 3)} is VALID [2022-04-28 11:26:03,080 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8515#(<= ~counter~0 3)} {8515#(<= ~counter~0 3)} #83#return; {8515#(<= ~counter~0 3)} is VALID [2022-04-28 11:26:03,080 INFO L272 TraceCheckUtils]: 56: Hoare triple {8515#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {8515#(<= ~counter~0 3)} is VALID [2022-04-28 11:26:03,081 INFO L290 TraceCheckUtils]: 57: Hoare triple {8515#(<= ~counter~0 3)} ~cond := #in~cond; {8515#(<= ~counter~0 3)} is VALID [2022-04-28 11:26:03,081 INFO L290 TraceCheckUtils]: 58: Hoare triple {8515#(<= ~counter~0 3)} assume !(0 == ~cond); {8515#(<= ~counter~0 3)} is VALID [2022-04-28 11:26:03,081 INFO L290 TraceCheckUtils]: 59: Hoare triple {8515#(<= ~counter~0 3)} assume true; {8515#(<= ~counter~0 3)} is VALID [2022-04-28 11:26:03,081 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {8515#(<= ~counter~0 3)} {8515#(<= ~counter~0 3)} #85#return; {8515#(<= ~counter~0 3)} is VALID [2022-04-28 11:26:03,082 INFO L272 TraceCheckUtils]: 61: Hoare triple {8515#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {8515#(<= ~counter~0 3)} is VALID [2022-04-28 11:26:03,082 INFO L290 TraceCheckUtils]: 62: Hoare triple {8515#(<= ~counter~0 3)} ~cond := #in~cond; {8515#(<= ~counter~0 3)} is VALID [2022-04-28 11:26:03,082 INFO L290 TraceCheckUtils]: 63: Hoare triple {8515#(<= ~counter~0 3)} assume !(0 == ~cond); {8515#(<= ~counter~0 3)} is VALID [2022-04-28 11:26:03,082 INFO L290 TraceCheckUtils]: 64: Hoare triple {8515#(<= ~counter~0 3)} assume true; {8515#(<= ~counter~0 3)} is VALID [2022-04-28 11:26:03,083 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {8515#(<= ~counter~0 3)} {8515#(<= ~counter~0 3)} #87#return; {8515#(<= ~counter~0 3)} is VALID [2022-04-28 11:26:03,083 INFO L290 TraceCheckUtils]: 66: Hoare triple {8515#(<= ~counter~0 3)} assume !(~r~0 >= 2 * ~b~0); {8515#(<= ~counter~0 3)} is VALID [2022-04-28 11:26:03,083 INFO L290 TraceCheckUtils]: 67: Hoare triple {8515#(<= ~counter~0 3)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {8515#(<= ~counter~0 3)} is VALID [2022-04-28 11:26:03,084 INFO L290 TraceCheckUtils]: 68: Hoare triple {8515#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8573#(<= |main_#t~post6| 3)} is VALID [2022-04-28 11:26:03,084 INFO L290 TraceCheckUtils]: 69: Hoare triple {8573#(<= |main_#t~post6| 3)} assume !(#t~post6 < 5);havoc #t~post6; {8361#false} is VALID [2022-04-28 11:26:03,084 INFO L272 TraceCheckUtils]: 70: Hoare triple {8361#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {8361#false} is VALID [2022-04-28 11:26:03,084 INFO L290 TraceCheckUtils]: 71: Hoare triple {8361#false} ~cond := #in~cond; {8361#false} is VALID [2022-04-28 11:26:03,084 INFO L290 TraceCheckUtils]: 72: Hoare triple {8361#false} assume 0 == ~cond; {8361#false} is VALID [2022-04-28 11:26:03,084 INFO L290 TraceCheckUtils]: 73: Hoare triple {8361#false} assume !false; {8361#false} is VALID [2022-04-28 11:26:03,084 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 18 proven. 112 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 11:26:03,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:26:03,337 INFO L290 TraceCheckUtils]: 73: Hoare triple {8361#false} assume !false; {8361#false} is VALID [2022-04-28 11:26:03,337 INFO L290 TraceCheckUtils]: 72: Hoare triple {8361#false} assume 0 == ~cond; {8361#false} is VALID [2022-04-28 11:26:03,337 INFO L290 TraceCheckUtils]: 71: Hoare triple {8361#false} ~cond := #in~cond; {8361#false} is VALID [2022-04-28 11:26:03,337 INFO L272 TraceCheckUtils]: 70: Hoare triple {8361#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {8361#false} is VALID [2022-04-28 11:26:03,337 INFO L290 TraceCheckUtils]: 69: Hoare triple {8601#(< |main_#t~post6| 5)} assume !(#t~post6 < 5);havoc #t~post6; {8361#false} is VALID [2022-04-28 11:26:03,338 INFO L290 TraceCheckUtils]: 68: Hoare triple {8605#(< ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8601#(< |main_#t~post6| 5)} is VALID [2022-04-28 11:26:03,338 INFO L290 TraceCheckUtils]: 67: Hoare triple {8605#(< ~counter~0 5)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {8605#(< ~counter~0 5)} is VALID [2022-04-28 11:26:03,338 INFO L290 TraceCheckUtils]: 66: Hoare triple {8605#(< ~counter~0 5)} assume !(~r~0 >= 2 * ~b~0); {8605#(< ~counter~0 5)} is VALID [2022-04-28 11:26:03,339 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {8360#true} {8605#(< ~counter~0 5)} #87#return; {8605#(< ~counter~0 5)} is VALID [2022-04-28 11:26:03,339 INFO L290 TraceCheckUtils]: 64: Hoare triple {8360#true} assume true; {8360#true} is VALID [2022-04-28 11:26:03,339 INFO L290 TraceCheckUtils]: 63: Hoare triple {8360#true} assume !(0 == ~cond); {8360#true} is VALID [2022-04-28 11:26:03,339 INFO L290 TraceCheckUtils]: 62: Hoare triple {8360#true} ~cond := #in~cond; {8360#true} is VALID [2022-04-28 11:26:03,339 INFO L272 TraceCheckUtils]: 61: Hoare triple {8605#(< ~counter~0 5)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {8360#true} is VALID [2022-04-28 11:26:03,356 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {8360#true} {8605#(< ~counter~0 5)} #85#return; {8605#(< ~counter~0 5)} is VALID [2022-04-28 11:26:03,356 INFO L290 TraceCheckUtils]: 59: Hoare triple {8360#true} assume true; {8360#true} is VALID [2022-04-28 11:26:03,356 INFO L290 TraceCheckUtils]: 58: Hoare triple {8360#true} assume !(0 == ~cond); {8360#true} is VALID [2022-04-28 11:26:03,356 INFO L290 TraceCheckUtils]: 57: Hoare triple {8360#true} ~cond := #in~cond; {8360#true} is VALID [2022-04-28 11:26:03,356 INFO L272 TraceCheckUtils]: 56: Hoare triple {8605#(< ~counter~0 5)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {8360#true} is VALID [2022-04-28 11:26:03,357 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8360#true} {8605#(< ~counter~0 5)} #83#return; {8605#(< ~counter~0 5)} is VALID [2022-04-28 11:26:03,357 INFO L290 TraceCheckUtils]: 54: Hoare triple {8360#true} assume true; {8360#true} is VALID [2022-04-28 11:26:03,357 INFO L290 TraceCheckUtils]: 53: Hoare triple {8360#true} assume !(0 == ~cond); {8360#true} is VALID [2022-04-28 11:26:03,357 INFO L290 TraceCheckUtils]: 52: Hoare triple {8360#true} ~cond := #in~cond; {8360#true} is VALID [2022-04-28 11:26:03,357 INFO L272 TraceCheckUtils]: 51: Hoare triple {8605#(< ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {8360#true} is VALID [2022-04-28 11:26:03,357 INFO L290 TraceCheckUtils]: 50: Hoare triple {8605#(< ~counter~0 5)} assume !!(#t~post7 < 5);havoc #t~post7; {8605#(< ~counter~0 5)} is VALID [2022-04-28 11:26:03,358 INFO L290 TraceCheckUtils]: 49: Hoare triple {8515#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8605#(< ~counter~0 5)} is VALID [2022-04-28 11:26:03,358 INFO L290 TraceCheckUtils]: 48: Hoare triple {8515#(<= ~counter~0 3)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {8515#(<= ~counter~0 3)} is VALID [2022-04-28 11:26:03,359 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8360#true} {8515#(<= ~counter~0 3)} #89#return; {8515#(<= ~counter~0 3)} is VALID [2022-04-28 11:26:03,359 INFO L290 TraceCheckUtils]: 46: Hoare triple {8360#true} assume true; {8360#true} is VALID [2022-04-28 11:26:03,359 INFO L290 TraceCheckUtils]: 45: Hoare triple {8360#true} assume !(0 == ~cond); {8360#true} is VALID [2022-04-28 11:26:03,359 INFO L290 TraceCheckUtils]: 44: Hoare triple {8360#true} ~cond := #in~cond; {8360#true} is VALID [2022-04-28 11:26:03,359 INFO L272 TraceCheckUtils]: 43: Hoare triple {8515#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {8360#true} is VALID [2022-04-28 11:26:03,359 INFO L290 TraceCheckUtils]: 42: Hoare triple {8515#(<= ~counter~0 3)} assume !!(~r~0 >= 2 * ~b~0); {8515#(<= ~counter~0 3)} is VALID [2022-04-28 11:26:03,360 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {8360#true} {8515#(<= ~counter~0 3)} #87#return; {8515#(<= ~counter~0 3)} is VALID [2022-04-28 11:26:03,360 INFO L290 TraceCheckUtils]: 40: Hoare triple {8360#true} assume true; {8360#true} is VALID [2022-04-28 11:26:03,360 INFO L290 TraceCheckUtils]: 39: Hoare triple {8360#true} assume !(0 == ~cond); {8360#true} is VALID [2022-04-28 11:26:03,360 INFO L290 TraceCheckUtils]: 38: Hoare triple {8360#true} ~cond := #in~cond; {8360#true} is VALID [2022-04-28 11:26:03,360 INFO L272 TraceCheckUtils]: 37: Hoare triple {8515#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {8360#true} is VALID [2022-04-28 11:26:03,361 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8360#true} {8515#(<= ~counter~0 3)} #85#return; {8515#(<= ~counter~0 3)} is VALID [2022-04-28 11:26:03,361 INFO L290 TraceCheckUtils]: 35: Hoare triple {8360#true} assume true; {8360#true} is VALID [2022-04-28 11:26:03,361 INFO L290 TraceCheckUtils]: 34: Hoare triple {8360#true} assume !(0 == ~cond); {8360#true} is VALID [2022-04-28 11:26:03,361 INFO L290 TraceCheckUtils]: 33: Hoare triple {8360#true} ~cond := #in~cond; {8360#true} is VALID [2022-04-28 11:26:03,361 INFO L272 TraceCheckUtils]: 32: Hoare triple {8515#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {8360#true} is VALID [2022-04-28 11:26:03,362 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {8360#true} {8515#(<= ~counter~0 3)} #83#return; {8515#(<= ~counter~0 3)} is VALID [2022-04-28 11:26:03,362 INFO L290 TraceCheckUtils]: 30: Hoare triple {8360#true} assume true; {8360#true} is VALID [2022-04-28 11:26:03,362 INFO L290 TraceCheckUtils]: 29: Hoare triple {8360#true} assume !(0 == ~cond); {8360#true} is VALID [2022-04-28 11:26:03,362 INFO L290 TraceCheckUtils]: 28: Hoare triple {8360#true} ~cond := #in~cond; {8360#true} is VALID [2022-04-28 11:26:03,362 INFO L272 TraceCheckUtils]: 27: Hoare triple {8515#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {8360#true} is VALID [2022-04-28 11:26:03,362 INFO L290 TraceCheckUtils]: 26: Hoare triple {8515#(<= ~counter~0 3)} assume !!(#t~post7 < 5);havoc #t~post7; {8515#(<= ~counter~0 3)} is VALID [2022-04-28 11:26:03,363 INFO L290 TraceCheckUtils]: 25: Hoare triple {8442#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8515#(<= ~counter~0 3)} is VALID [2022-04-28 11:26:03,363 INFO L290 TraceCheckUtils]: 24: Hoare triple {8442#(<= ~counter~0 2)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {8442#(<= ~counter~0 2)} is VALID [2022-04-28 11:26:03,364 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8360#true} {8442#(<= ~counter~0 2)} #81#return; {8442#(<= ~counter~0 2)} is VALID [2022-04-28 11:26:03,364 INFO L290 TraceCheckUtils]: 22: Hoare triple {8360#true} assume true; {8360#true} is VALID [2022-04-28 11:26:03,364 INFO L290 TraceCheckUtils]: 21: Hoare triple {8360#true} assume !(0 == ~cond); {8360#true} is VALID [2022-04-28 11:26:03,364 INFO L290 TraceCheckUtils]: 20: Hoare triple {8360#true} ~cond := #in~cond; {8360#true} is VALID [2022-04-28 11:26:03,364 INFO L272 TraceCheckUtils]: 19: Hoare triple {8442#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {8360#true} is VALID [2022-04-28 11:26:03,365 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8360#true} {8442#(<= ~counter~0 2)} #79#return; {8442#(<= ~counter~0 2)} is VALID [2022-04-28 11:26:03,365 INFO L290 TraceCheckUtils]: 17: Hoare triple {8360#true} assume true; {8360#true} is VALID [2022-04-28 11:26:03,365 INFO L290 TraceCheckUtils]: 16: Hoare triple {8360#true} assume !(0 == ~cond); {8360#true} is VALID [2022-04-28 11:26:03,365 INFO L290 TraceCheckUtils]: 15: Hoare triple {8360#true} ~cond := #in~cond; {8360#true} is VALID [2022-04-28 11:26:03,365 INFO L272 TraceCheckUtils]: 14: Hoare triple {8442#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {8360#true} is VALID [2022-04-28 11:26:03,365 INFO L290 TraceCheckUtils]: 13: Hoare triple {8442#(<= ~counter~0 2)} assume !!(#t~post6 < 5);havoc #t~post6; {8442#(<= ~counter~0 2)} is VALID [2022-04-28 11:26:03,366 INFO L290 TraceCheckUtils]: 12: Hoare triple {8402#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8442#(<= ~counter~0 2)} is VALID [2022-04-28 11:26:03,366 INFO L290 TraceCheckUtils]: 11: Hoare triple {8402#(<= ~counter~0 1)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {8402#(<= ~counter~0 1)} is VALID [2022-04-28 11:26:03,366 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8360#true} {8402#(<= ~counter~0 1)} #77#return; {8402#(<= ~counter~0 1)} is VALID [2022-04-28 11:26:03,366 INFO L290 TraceCheckUtils]: 9: Hoare triple {8360#true} assume true; {8360#true} is VALID [2022-04-28 11:26:03,366 INFO L290 TraceCheckUtils]: 8: Hoare triple {8360#true} assume !(0 == ~cond); {8360#true} is VALID [2022-04-28 11:26:03,366 INFO L290 TraceCheckUtils]: 7: Hoare triple {8360#true} ~cond := #in~cond; {8360#true} is VALID [2022-04-28 11:26:03,367 INFO L272 TraceCheckUtils]: 6: Hoare triple {8402#(<= ~counter~0 1)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8360#true} is VALID [2022-04-28 11:26:03,367 INFO L290 TraceCheckUtils]: 5: Hoare triple {8402#(<= ~counter~0 1)} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {8402#(<= ~counter~0 1)} is VALID [2022-04-28 11:26:03,367 INFO L272 TraceCheckUtils]: 4: Hoare triple {8402#(<= ~counter~0 1)} call #t~ret8 := main(); {8402#(<= ~counter~0 1)} is VALID [2022-04-28 11:26:03,368 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8402#(<= ~counter~0 1)} {8360#true} #93#return; {8402#(<= ~counter~0 1)} is VALID [2022-04-28 11:26:03,368 INFO L290 TraceCheckUtils]: 2: Hoare triple {8402#(<= ~counter~0 1)} assume true; {8402#(<= ~counter~0 1)} is VALID [2022-04-28 11:26:03,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {8360#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8402#(<= ~counter~0 1)} is VALID [2022-04-28 11:26:03,368 INFO L272 TraceCheckUtils]: 0: Hoare triple {8360#true} call ULTIMATE.init(); {8360#true} is VALID [2022-04-28 11:26:03,369 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-28 11:26:03,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:26:03,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629363172] [2022-04-28 11:26:03,369 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:26:03,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885706376] [2022-04-28 11:26:03,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885706376] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:26:03,369 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:26:03,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-04-28 11:26:03,369 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:26:03,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1255771067] [2022-04-28 11:26:03,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1255771067] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:26:03,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:26:03,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 11:26:03,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005467103] [2022-04-28 11:26:03,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:26:03,370 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) Word has length 74 [2022-04-28 11:26:03,370 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:26:03,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-28 11:26:03,409 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 11:26:03,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 11:26:03,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:26:03,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 11:26:03,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-28 11:26:03,409 INFO L87 Difference]: Start difference. First operand 112 states and 133 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-28 11:26:03,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:26:03,753 INFO L93 Difference]: Finished difference Result 141 states and 164 transitions. [2022-04-28 11:26:03,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 11:26:03,753 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) Word has length 74 [2022-04-28 11:26:03,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:26:03,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-28 11:26:03,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2022-04-28 11:26:03,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-28 11:26:03,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2022-04-28 11:26:03,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 94 transitions. [2022-04-28 11:26:03,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:26:03,822 INFO L225 Difference]: With dead ends: 141 [2022-04-28 11:26:03,822 INFO L226 Difference]: Without dead ends: 134 [2022-04-28 11:26:03,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 139 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:26:03,823 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 20 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:26:03,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 163 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:26:03,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-04-28 11:26:03,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2022-04-28 11:26:03,944 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:26:03,944 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand has 132 states, 85 states have (on average 1.1411764705882352) internal successors, (97), 88 states have internal predecessors, (97), 30 states have call successors, (30), 17 states have call predecessors, (30), 16 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 11:26:03,944 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand has 132 states, 85 states have (on average 1.1411764705882352) internal successors, (97), 88 states have internal predecessors, (97), 30 states have call successors, (30), 17 states have call predecessors, (30), 16 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 11:26:03,944 INFO L87 Difference]: Start difference. First operand 134 states. Second operand has 132 states, 85 states have (on average 1.1411764705882352) internal successors, (97), 88 states have internal predecessors, (97), 30 states have call successors, (30), 17 states have call predecessors, (30), 16 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 11:26:03,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:26:03,947 INFO L93 Difference]: Finished difference Result 134 states and 157 transitions. [2022-04-28 11:26:03,947 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 157 transitions. [2022-04-28 11:26:03,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:26:03,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:26:03,947 INFO L74 IsIncluded]: Start isIncluded. First operand has 132 states, 85 states have (on average 1.1411764705882352) internal successors, (97), 88 states have internal predecessors, (97), 30 states have call successors, (30), 17 states have call predecessors, (30), 16 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) Second operand 134 states. [2022-04-28 11:26:03,948 INFO L87 Difference]: Start difference. First operand has 132 states, 85 states have (on average 1.1411764705882352) internal successors, (97), 88 states have internal predecessors, (97), 30 states have call successors, (30), 17 states have call predecessors, (30), 16 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) Second operand 134 states. [2022-04-28 11:26:03,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:26:03,950 INFO L93 Difference]: Finished difference Result 134 states and 157 transitions. [2022-04-28 11:26:03,950 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 157 transitions. [2022-04-28 11:26:03,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:26:03,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:26:03,950 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:26:03,950 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:26:03,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 85 states have (on average 1.1411764705882352) internal successors, (97), 88 states have internal predecessors, (97), 30 states have call successors, (30), 17 states have call predecessors, (30), 16 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 11:26:03,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 155 transitions. [2022-04-28 11:26:03,953 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 155 transitions. Word has length 74 [2022-04-28 11:26:03,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:26:03,953 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 155 transitions. [2022-04-28 11:26:03,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-28 11:26:03,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 132 states and 155 transitions. [2022-04-28 11:26:04,113 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 11:26:04,113 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 155 transitions. [2022-04-28 11:26:04,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-28 11:26:04,113 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:26:04,113 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 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 11:26:04,133 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 11:26:04,314 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 11:26:04,314 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:26:04,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:26:04,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1777426592, now seen corresponding path program 1 times [2022-04-28 11:26:04,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:26:04,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1701358441] [2022-04-28 11:26:04,599 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:26:23,044 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:26:23,044 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:26:23,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1777426592, now seen corresponding path program 2 times [2022-04-28 11:26:23,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:26:23,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984175039] [2022-04-28 11:26:23,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:26:23,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:26:23,054 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:26:23,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1395116919] [2022-04-28 11:26:23,054 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:26:23,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:26:23,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:26:23,055 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 11:26:23,056 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 11:26:23,102 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:26:23,102 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:26:23,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 11:26:23,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:26:23,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:26:24,581 INFO L272 TraceCheckUtils]: 0: Hoare triple {9628#true} call ULTIMATE.init(); {9628#true} is VALID [2022-04-28 11:26:24,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {9628#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9628#true} is VALID [2022-04-28 11:26:24,582 INFO L290 TraceCheckUtils]: 2: Hoare triple {9628#true} assume true; {9628#true} is VALID [2022-04-28 11:26:24,582 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9628#true} {9628#true} #93#return; {9628#true} is VALID [2022-04-28 11:26:24,582 INFO L272 TraceCheckUtils]: 4: Hoare triple {9628#true} call #t~ret8 := main(); {9628#true} is VALID [2022-04-28 11:26:24,582 INFO L290 TraceCheckUtils]: 5: Hoare triple {9628#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {9628#true} is VALID [2022-04-28 11:26:24,582 INFO L272 TraceCheckUtils]: 6: Hoare triple {9628#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {9628#true} is VALID [2022-04-28 11:26:24,582 INFO L290 TraceCheckUtils]: 7: Hoare triple {9628#true} ~cond := #in~cond; {9654#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 11:26:24,582 INFO L290 TraceCheckUtils]: 8: Hoare triple {9654#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {9658#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:26:24,583 INFO L290 TraceCheckUtils]: 9: Hoare triple {9658#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {9658#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:26:24,583 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9658#(not (= |assume_abort_if_not_#in~cond| 0))} {9628#true} #77#return; {9665#(<= 1 main_~y~0)} is VALID [2022-04-28 11:26:24,583 INFO L290 TraceCheckUtils]: 11: Hoare triple {9665#(<= 1 main_~y~0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {9669#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:26:24,584 INFO L290 TraceCheckUtils]: 12: Hoare triple {9669#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9669#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:26:24,584 INFO L290 TraceCheckUtils]: 13: Hoare triple {9669#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} assume !!(#t~post6 < 5);havoc #t~post6; {9669#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:26:24,584 INFO L272 TraceCheckUtils]: 14: Hoare triple {9669#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {9628#true} is VALID [2022-04-28 11:26:24,584 INFO L290 TraceCheckUtils]: 15: Hoare triple {9628#true} ~cond := #in~cond; {9628#true} is VALID [2022-04-28 11:26:24,584 INFO L290 TraceCheckUtils]: 16: Hoare triple {9628#true} assume !(0 == ~cond); {9628#true} is VALID [2022-04-28 11:26:24,584 INFO L290 TraceCheckUtils]: 17: Hoare triple {9628#true} assume true; {9628#true} is VALID [2022-04-28 11:26:24,585 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {9628#true} {9669#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} #79#return; {9669#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:26:24,585 INFO L272 TraceCheckUtils]: 19: Hoare triple {9669#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {9628#true} is VALID [2022-04-28 11:26:24,585 INFO L290 TraceCheckUtils]: 20: Hoare triple {9628#true} ~cond := #in~cond; {9628#true} is VALID [2022-04-28 11:26:24,585 INFO L290 TraceCheckUtils]: 21: Hoare triple {9628#true} assume !(0 == ~cond); {9628#true} is VALID [2022-04-28 11:26:24,585 INFO L290 TraceCheckUtils]: 22: Hoare triple {9628#true} assume true; {9628#true} is VALID [2022-04-28 11:26:24,585 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9628#true} {9669#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} #81#return; {9669#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:26:24,586 INFO L290 TraceCheckUtils]: 24: Hoare triple {9669#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {9709#(and (= main_~x~0 main_~r~0) (<= 1 main_~a~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:26:24,586 INFO L290 TraceCheckUtils]: 25: Hoare triple {9709#(and (= main_~x~0 main_~r~0) (<= 1 main_~a~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9709#(and (= main_~x~0 main_~r~0) (<= 1 main_~a~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:26:24,587 INFO L290 TraceCheckUtils]: 26: Hoare triple {9709#(and (= main_~x~0 main_~r~0) (<= 1 main_~a~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} assume !!(#t~post7 < 5);havoc #t~post7; {9709#(and (= main_~x~0 main_~r~0) (<= 1 main_~a~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:26:24,587 INFO L272 TraceCheckUtils]: 27: Hoare triple {9709#(and (= main_~x~0 main_~r~0) (<= 1 main_~a~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {9628#true} is VALID [2022-04-28 11:26:24,587 INFO L290 TraceCheckUtils]: 28: Hoare triple {9628#true} ~cond := #in~cond; {9628#true} is VALID [2022-04-28 11:26:24,587 INFO L290 TraceCheckUtils]: 29: Hoare triple {9628#true} assume !(0 == ~cond); {9628#true} is VALID [2022-04-28 11:26:24,587 INFO L290 TraceCheckUtils]: 30: Hoare triple {9628#true} assume true; {9628#true} is VALID [2022-04-28 11:26:24,587 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {9628#true} {9709#(and (= main_~x~0 main_~r~0) (<= 1 main_~a~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} #83#return; {9709#(and (= main_~x~0 main_~r~0) (<= 1 main_~a~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:26:24,587 INFO L272 TraceCheckUtils]: 32: Hoare triple {9709#(and (= main_~x~0 main_~r~0) (<= 1 main_~a~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {9628#true} is VALID [2022-04-28 11:26:24,587 INFO L290 TraceCheckUtils]: 33: Hoare triple {9628#true} ~cond := #in~cond; {9628#true} is VALID [2022-04-28 11:26:24,587 INFO L290 TraceCheckUtils]: 34: Hoare triple {9628#true} assume !(0 == ~cond); {9628#true} is VALID [2022-04-28 11:26:24,588 INFO L290 TraceCheckUtils]: 35: Hoare triple {9628#true} assume true; {9628#true} is VALID [2022-04-28 11:26:24,588 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {9628#true} {9709#(and (= main_~x~0 main_~r~0) (<= 1 main_~a~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} #85#return; {9709#(and (= main_~x~0 main_~r~0) (<= 1 main_~a~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:26:24,588 INFO L272 TraceCheckUtils]: 37: Hoare triple {9709#(and (= main_~x~0 main_~r~0) (<= 1 main_~a~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {9628#true} is VALID [2022-04-28 11:26:24,588 INFO L290 TraceCheckUtils]: 38: Hoare triple {9628#true} ~cond := #in~cond; {9628#true} is VALID [2022-04-28 11:26:24,588 INFO L290 TraceCheckUtils]: 39: Hoare triple {9628#true} assume !(0 == ~cond); {9628#true} is VALID [2022-04-28 11:26:24,588 INFO L290 TraceCheckUtils]: 40: Hoare triple {9628#true} assume true; {9628#true} is VALID [2022-04-28 11:26:24,589 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {9628#true} {9709#(and (= main_~x~0 main_~r~0) (<= 1 main_~a~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} #87#return; {9709#(and (= main_~x~0 main_~r~0) (<= 1 main_~a~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:26:24,589 INFO L290 TraceCheckUtils]: 42: Hoare triple {9709#(and (= main_~x~0 main_~r~0) (<= 1 main_~a~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} assume !!(~r~0 >= 2 * ~b~0); {9709#(and (= main_~x~0 main_~r~0) (<= 1 main_~a~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:26:24,589 INFO L272 TraceCheckUtils]: 43: Hoare triple {9709#(and (= main_~x~0 main_~r~0) (<= 1 main_~a~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {9628#true} is VALID [2022-04-28 11:26:24,589 INFO L290 TraceCheckUtils]: 44: Hoare triple {9628#true} ~cond := #in~cond; {9628#true} is VALID [2022-04-28 11:26:24,589 INFO L290 TraceCheckUtils]: 45: Hoare triple {9628#true} assume !(0 == ~cond); {9628#true} is VALID [2022-04-28 11:26:24,589 INFO L290 TraceCheckUtils]: 46: Hoare triple {9628#true} assume true; {9628#true} is VALID [2022-04-28 11:26:24,590 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {9628#true} {9709#(and (= main_~x~0 main_~r~0) (<= 1 main_~a~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} #89#return; {9709#(and (= main_~x~0 main_~r~0) (<= 1 main_~a~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:26:24,591 INFO L290 TraceCheckUtils]: 48: Hoare triple {9709#(and (= main_~x~0 main_~r~0) (<= 1 main_~a~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {9782#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:26:24,591 INFO L290 TraceCheckUtils]: 49: Hoare triple {9782#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9782#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:26:24,592 INFO L290 TraceCheckUtils]: 50: Hoare triple {9782#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} assume !!(#t~post7 < 5);havoc #t~post7; {9782#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:26:24,592 INFO L272 TraceCheckUtils]: 51: Hoare triple {9782#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {9628#true} is VALID [2022-04-28 11:26:24,592 INFO L290 TraceCheckUtils]: 52: Hoare triple {9628#true} ~cond := #in~cond; {9628#true} is VALID [2022-04-28 11:26:24,592 INFO L290 TraceCheckUtils]: 53: Hoare triple {9628#true} assume !(0 == ~cond); {9628#true} is VALID [2022-04-28 11:26:24,592 INFO L290 TraceCheckUtils]: 54: Hoare triple {9628#true} assume true; {9628#true} is VALID [2022-04-28 11:26:24,592 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {9628#true} {9782#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} #83#return; {9782#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:26:24,592 INFO L272 TraceCheckUtils]: 56: Hoare triple {9782#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {9628#true} is VALID [2022-04-28 11:26:24,592 INFO L290 TraceCheckUtils]: 57: Hoare triple {9628#true} ~cond := #in~cond; {9628#true} is VALID [2022-04-28 11:26:24,593 INFO L290 TraceCheckUtils]: 58: Hoare triple {9628#true} assume !(0 == ~cond); {9628#true} is VALID [2022-04-28 11:26:24,593 INFO L290 TraceCheckUtils]: 59: Hoare triple {9628#true} assume true; {9628#true} is VALID [2022-04-28 11:26:24,593 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {9628#true} {9782#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} #85#return; {9782#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:26:24,593 INFO L272 TraceCheckUtils]: 61: Hoare triple {9782#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {9628#true} is VALID [2022-04-28 11:26:24,593 INFO L290 TraceCheckUtils]: 62: Hoare triple {9628#true} ~cond := #in~cond; {9628#true} is VALID [2022-04-28 11:26:24,593 INFO L290 TraceCheckUtils]: 63: Hoare triple {9628#true} assume !(0 == ~cond); {9628#true} is VALID [2022-04-28 11:26:24,593 INFO L290 TraceCheckUtils]: 64: Hoare triple {9628#true} assume true; {9628#true} is VALID [2022-04-28 11:26:24,594 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {9628#true} {9782#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} #87#return; {9782#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:26:24,594 INFO L290 TraceCheckUtils]: 66: Hoare triple {9782#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} assume !(~r~0 >= 2 * ~b~0); {9782#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:26:24,595 INFO L290 TraceCheckUtils]: 67: Hoare triple {9782#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {9840#(and (= (+ (* (- 1) main_~a~0) main_~q~0) 0) (= (mod main_~a~0 2) 0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~x~0 (+ main_~b~0 main_~r~0)) (<= 1 main_~y~0))} is VALID [2022-04-28 11:26:24,595 INFO L290 TraceCheckUtils]: 68: Hoare triple {9840#(and (= (+ (* (- 1) main_~a~0) main_~q~0) 0) (= (mod main_~a~0 2) 0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~x~0 (+ main_~b~0 main_~r~0)) (<= 1 main_~y~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9840#(and (= (+ (* (- 1) main_~a~0) main_~q~0) 0) (= (mod main_~a~0 2) 0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~x~0 (+ main_~b~0 main_~r~0)) (<= 1 main_~y~0))} is VALID [2022-04-28 11:26:24,596 INFO L290 TraceCheckUtils]: 69: Hoare triple {9840#(and (= (+ (* (- 1) main_~a~0) main_~q~0) 0) (= (mod main_~a~0 2) 0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~x~0 (+ main_~b~0 main_~r~0)) (<= 1 main_~y~0))} assume !!(#t~post6 < 5);havoc #t~post6; {9840#(and (= (+ (* (- 1) main_~a~0) main_~q~0) 0) (= (mod main_~a~0 2) 0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~x~0 (+ main_~b~0 main_~r~0)) (<= 1 main_~y~0))} is VALID [2022-04-28 11:26:24,596 INFO L272 TraceCheckUtils]: 70: Hoare triple {9840#(and (= (+ (* (- 1) main_~a~0) main_~q~0) 0) (= (mod main_~a~0 2) 0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~x~0 (+ main_~b~0 main_~r~0)) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {9628#true} is VALID [2022-04-28 11:26:24,596 INFO L290 TraceCheckUtils]: 71: Hoare triple {9628#true} ~cond := #in~cond; {9853#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:26:24,596 INFO L290 TraceCheckUtils]: 72: Hoare triple {9853#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {9857#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:26:24,596 INFO L290 TraceCheckUtils]: 73: Hoare triple {9857#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9857#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:26:24,599 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {9857#(not (= |__VERIFIER_assert_#in~cond| 0))} {9840#(and (= (+ (* (- 1) main_~a~0) main_~q~0) 0) (= (mod main_~a~0 2) 0) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (<= (div (- main_~b~0) (- 2)) main_~y~0) (= main_~x~0 (+ main_~b~0 main_~r~0)) (<= 1 main_~y~0))} #79#return; {9864#(and (<= 1 (div (* (- 1) main_~q~0) (- 2))) (= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0)) (= (mod main_~q~0 2) 0) (<= 1 main_~y~0) (<= (div (+ main_~r~0 (* (- 1) main_~x~0)) (- 2)) main_~y~0))} is VALID [2022-04-28 11:26:24,600 INFO L272 TraceCheckUtils]: 75: Hoare triple {9864#(and (<= 1 (div (* (- 1) main_~q~0) (- 2))) (= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0)) (= (mod main_~q~0 2) 0) (<= 1 main_~y~0) (<= (div (+ main_~r~0 (* (- 1) main_~x~0)) (- 2)) main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {9868#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:26:24,600 INFO L290 TraceCheckUtils]: 76: Hoare triple {9868#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9872#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:26:24,600 INFO L290 TraceCheckUtils]: 77: Hoare triple {9872#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9629#false} is VALID [2022-04-28 11:26:24,600 INFO L290 TraceCheckUtils]: 78: Hoare triple {9629#false} assume !false; {9629#false} is VALID [2022-04-28 11:26:24,601 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 46 proven. 11 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-04-28 11:26:24,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:26:34,476 INFO L290 TraceCheckUtils]: 78: Hoare triple {9629#false} assume !false; {9629#false} is VALID [2022-04-28 11:26:34,476 INFO L290 TraceCheckUtils]: 77: Hoare triple {9872#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9629#false} is VALID [2022-04-28 11:26:34,476 INFO L290 TraceCheckUtils]: 76: Hoare triple {9868#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9872#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:26:34,477 INFO L272 TraceCheckUtils]: 75: Hoare triple {9888#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {9868#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:26:34,478 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {9857#(not (= |__VERIFIER_assert_#in~cond| 0))} {9892#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} #79#return; {9888#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:26:34,478 INFO L290 TraceCheckUtils]: 73: Hoare triple {9857#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9857#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:26:34,478 INFO L290 TraceCheckUtils]: 72: Hoare triple {9902#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {9857#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:26:34,478 INFO L290 TraceCheckUtils]: 71: Hoare triple {9628#true} ~cond := #in~cond; {9902#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:26:34,478 INFO L272 TraceCheckUtils]: 70: Hoare triple {9892#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {9628#true} is VALID [2022-04-28 11:26:34,479 INFO L290 TraceCheckUtils]: 69: Hoare triple {9892#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} assume !!(#t~post6 < 5);havoc #t~post6; {9892#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} is VALID [2022-04-28 11:26:34,479 INFO L290 TraceCheckUtils]: 68: Hoare triple {9892#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9892#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} is VALID [2022-04-28 11:26:34,486 INFO L290 TraceCheckUtils]: 67: Hoare triple {9892#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {9892#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} is VALID [2022-04-28 11:26:34,487 INFO L290 TraceCheckUtils]: 66: Hoare triple {9892#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} assume !(~r~0 >= 2 * ~b~0); {9892#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} is VALID [2022-04-28 11:26:34,487 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {9628#true} {9892#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} #87#return; {9892#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} is VALID [2022-04-28 11:26:34,487 INFO L290 TraceCheckUtils]: 64: Hoare triple {9628#true} assume true; {9628#true} is VALID [2022-04-28 11:26:34,487 INFO L290 TraceCheckUtils]: 63: Hoare triple {9628#true} assume !(0 == ~cond); {9628#true} is VALID [2022-04-28 11:26:34,487 INFO L290 TraceCheckUtils]: 62: Hoare triple {9628#true} ~cond := #in~cond; {9628#true} is VALID [2022-04-28 11:26:34,487 INFO L272 TraceCheckUtils]: 61: Hoare triple {9892#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {9628#true} is VALID [2022-04-28 11:26:34,488 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {9628#true} {9892#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} #85#return; {9892#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} is VALID [2022-04-28 11:26:34,488 INFO L290 TraceCheckUtils]: 59: Hoare triple {9628#true} assume true; {9628#true} is VALID [2022-04-28 11:26:34,488 INFO L290 TraceCheckUtils]: 58: Hoare triple {9628#true} assume !(0 == ~cond); {9628#true} is VALID [2022-04-28 11:26:34,488 INFO L290 TraceCheckUtils]: 57: Hoare triple {9628#true} ~cond := #in~cond; {9628#true} is VALID [2022-04-28 11:26:34,488 INFO L272 TraceCheckUtils]: 56: Hoare triple {9892#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {9628#true} is VALID [2022-04-28 11:26:34,489 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {9628#true} {9892#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} #83#return; {9892#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} is VALID [2022-04-28 11:26:34,489 INFO L290 TraceCheckUtils]: 54: Hoare triple {9628#true} assume true; {9628#true} is VALID [2022-04-28 11:26:34,489 INFO L290 TraceCheckUtils]: 53: Hoare triple {9628#true} assume !(0 == ~cond); {9628#true} is VALID [2022-04-28 11:26:34,489 INFO L290 TraceCheckUtils]: 52: Hoare triple {9628#true} ~cond := #in~cond; {9628#true} is VALID [2022-04-28 11:26:34,489 INFO L272 TraceCheckUtils]: 51: Hoare triple {9892#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {9628#true} is VALID [2022-04-28 11:26:34,489 INFO L290 TraceCheckUtils]: 50: Hoare triple {9892#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} assume !!(#t~post7 < 5);havoc #t~post7; {9892#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} is VALID [2022-04-28 11:26:34,489 INFO L290 TraceCheckUtils]: 49: Hoare triple {9892#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9892#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} is VALID [2022-04-28 11:26:34,491 INFO L290 TraceCheckUtils]: 48: Hoare triple {9972#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))))} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {9892#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (= main_~b~0 (* main_~a~0 main_~y~0))))} is VALID [2022-04-28 11:26:34,491 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {9628#true} {9972#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))))} #89#return; {9972#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))))} is VALID [2022-04-28 11:26:34,491 INFO L290 TraceCheckUtils]: 46: Hoare triple {9628#true} assume true; {9628#true} is VALID [2022-04-28 11:26:34,491 INFO L290 TraceCheckUtils]: 45: Hoare triple {9628#true} assume !(0 == ~cond); {9628#true} is VALID [2022-04-28 11:26:34,491 INFO L290 TraceCheckUtils]: 44: Hoare triple {9628#true} ~cond := #in~cond; {9628#true} is VALID [2022-04-28 11:26:34,491 INFO L272 TraceCheckUtils]: 43: Hoare triple {9972#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))))} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {9628#true} is VALID [2022-04-28 11:26:34,492 INFO L290 TraceCheckUtils]: 42: Hoare triple {9972#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))))} assume !!(~r~0 >= 2 * ~b~0); {9972#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))))} is VALID [2022-04-28 11:26:34,492 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {9628#true} {9972#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))))} #87#return; {9972#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))))} is VALID [2022-04-28 11:26:34,492 INFO L290 TraceCheckUtils]: 40: Hoare triple {9628#true} assume true; {9628#true} is VALID [2022-04-28 11:26:34,492 INFO L290 TraceCheckUtils]: 39: Hoare triple {9628#true} assume !(0 == ~cond); {9628#true} is VALID [2022-04-28 11:26:34,492 INFO L290 TraceCheckUtils]: 38: Hoare triple {9628#true} ~cond := #in~cond; {9628#true} is VALID [2022-04-28 11:26:34,492 INFO L272 TraceCheckUtils]: 37: Hoare triple {9972#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {9628#true} is VALID [2022-04-28 11:26:34,493 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {9628#true} {9972#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))))} #85#return; {9972#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))))} is VALID [2022-04-28 11:26:34,493 INFO L290 TraceCheckUtils]: 35: Hoare triple {9628#true} assume true; {9628#true} is VALID [2022-04-28 11:26:34,493 INFO L290 TraceCheckUtils]: 34: Hoare triple {9628#true} assume !(0 == ~cond); {9628#true} is VALID [2022-04-28 11:26:34,493 INFO L290 TraceCheckUtils]: 33: Hoare triple {9628#true} ~cond := #in~cond; {9628#true} is VALID [2022-04-28 11:26:34,493 INFO L272 TraceCheckUtils]: 32: Hoare triple {9972#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {9628#true} is VALID [2022-04-28 11:26:34,494 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {9628#true} {9972#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))))} #83#return; {9972#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))))} is VALID [2022-04-28 11:26:34,494 INFO L290 TraceCheckUtils]: 30: Hoare triple {9628#true} assume true; {9628#true} is VALID [2022-04-28 11:26:34,494 INFO L290 TraceCheckUtils]: 29: Hoare triple {9628#true} assume !(0 == ~cond); {9628#true} is VALID [2022-04-28 11:26:34,494 INFO L290 TraceCheckUtils]: 28: Hoare triple {9628#true} ~cond := #in~cond; {9628#true} is VALID [2022-04-28 11:26:34,494 INFO L272 TraceCheckUtils]: 27: Hoare triple {9972#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {9628#true} is VALID [2022-04-28 11:26:34,494 INFO L290 TraceCheckUtils]: 26: Hoare triple {9972#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))))} assume !!(#t~post7 < 5);havoc #t~post7; {9972#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))))} is VALID [2022-04-28 11:26:34,495 INFO L290 TraceCheckUtils]: 25: Hoare triple {9972#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9972#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))))} is VALID [2022-04-28 11:26:34,495 INFO L290 TraceCheckUtils]: 24: Hoare triple {9888#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {9972#(or (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (not (<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))))} is VALID [2022-04-28 11:26:34,495 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9628#true} {9888#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #81#return; {9888#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:26:34,495 INFO L290 TraceCheckUtils]: 22: Hoare triple {9628#true} assume true; {9628#true} is VALID [2022-04-28 11:26:34,495 INFO L290 TraceCheckUtils]: 21: Hoare triple {9628#true} assume !(0 == ~cond); {9628#true} is VALID [2022-04-28 11:26:34,496 INFO L290 TraceCheckUtils]: 20: Hoare triple {9628#true} ~cond := #in~cond; {9628#true} is VALID [2022-04-28 11:26:34,496 INFO L272 TraceCheckUtils]: 19: Hoare triple {9888#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {9628#true} is VALID [2022-04-28 11:26:34,496 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {9628#true} {9888#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #79#return; {9888#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:26:34,496 INFO L290 TraceCheckUtils]: 17: Hoare triple {9628#true} assume true; {9628#true} is VALID [2022-04-28 11:26:34,496 INFO L290 TraceCheckUtils]: 16: Hoare triple {9628#true} assume !(0 == ~cond); {9628#true} is VALID [2022-04-28 11:26:34,496 INFO L290 TraceCheckUtils]: 15: Hoare triple {9628#true} ~cond := #in~cond; {9628#true} is VALID [2022-04-28 11:26:34,496 INFO L272 TraceCheckUtils]: 14: Hoare triple {9888#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {9628#true} is VALID [2022-04-28 11:26:34,496 INFO L290 TraceCheckUtils]: 13: Hoare triple {9888#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(#t~post6 < 5);havoc #t~post6; {9888#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:26:34,497 INFO L290 TraceCheckUtils]: 12: Hoare triple {9888#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9888#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:26:34,497 INFO L290 TraceCheckUtils]: 11: Hoare triple {9628#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {9888#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:26:34,497 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9628#true} {9628#true} #77#return; {9628#true} is VALID [2022-04-28 11:26:34,497 INFO L290 TraceCheckUtils]: 9: Hoare triple {9628#true} assume true; {9628#true} is VALID [2022-04-28 11:26:34,497 INFO L290 TraceCheckUtils]: 8: Hoare triple {9628#true} assume !(0 == ~cond); {9628#true} is VALID [2022-04-28 11:26:34,497 INFO L290 TraceCheckUtils]: 7: Hoare triple {9628#true} ~cond := #in~cond; {9628#true} is VALID [2022-04-28 11:26:34,497 INFO L272 TraceCheckUtils]: 6: Hoare triple {9628#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {9628#true} is VALID [2022-04-28 11:26:34,497 INFO L290 TraceCheckUtils]: 5: Hoare triple {9628#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {9628#true} is VALID [2022-04-28 11:26:34,497 INFO L272 TraceCheckUtils]: 4: Hoare triple {9628#true} call #t~ret8 := main(); {9628#true} is VALID [2022-04-28 11:26:34,498 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9628#true} {9628#true} #93#return; {9628#true} is VALID [2022-04-28 11:26:34,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {9628#true} assume true; {9628#true} is VALID [2022-04-28 11:26:34,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {9628#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9628#true} is VALID [2022-04-28 11:26:34,498 INFO L272 TraceCheckUtils]: 0: Hoare triple {9628#true} call ULTIMATE.init(); {9628#true} is VALID [2022-04-28 11:26:34,498 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 46 proven. 10 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-04-28 11:26:34,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:26:34,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984175039] [2022-04-28 11:26:34,498 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:26:34,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395116919] [2022-04-28 11:26:34,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395116919] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:26:34,498 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:26:34,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 18 [2022-04-28 11:26:34,499 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:26:34,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1701358441] [2022-04-28 11:26:34,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1701358441] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:26:34,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:26:34,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 11:26:34,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925862654] [2022-04-28 11:26:34,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:26:34,499 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) Word has length 79 [2022-04-28 11:26:34,500 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:26:34,500 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 11:26:34,544 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:26:34,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 11:26:34,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:26:34,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 11:26:34,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2022-04-28 11:26:34,545 INFO L87 Difference]: Start difference. First operand 132 states and 155 transitions. Second operand has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 11:26:39,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:26:39,139 INFO L93 Difference]: Finished difference Result 161 states and 197 transitions. [2022-04-28 11:26:39,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 11:26:39,139 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) Word has length 79 [2022-04-28 11:26:39,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:26:39,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 11:26:39,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 119 transitions. [2022-04-28 11:26:39,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 11:26:39,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 119 transitions. [2022-04-28 11:26:39,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 119 transitions. [2022-04-28 11:26:39,250 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:26:39,253 INFO L225 Difference]: With dead ends: 161 [2022-04-28 11:26:39,253 INFO L226 Difference]: Without dead ends: 158 [2022-04-28 11:26:39,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 138 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2022-04-28 11:26:39,253 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 51 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-28 11:26:39,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 284 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-28 11:26:39,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-04-28 11:26:39,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 153. [2022-04-28 11:26:39,439 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:26:39,439 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand has 153 states, 96 states have (on average 1.1666666666666667) internal successors, (112), 99 states have internal predecessors, (112), 39 states have call successors, (39), 18 states have call predecessors, (39), 17 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 11:26:39,439 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand has 153 states, 96 states have (on average 1.1666666666666667) internal successors, (112), 99 states have internal predecessors, (112), 39 states have call successors, (39), 18 states have call predecessors, (39), 17 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 11:26:39,439 INFO L87 Difference]: Start difference. First operand 158 states. Second operand has 153 states, 96 states have (on average 1.1666666666666667) internal successors, (112), 99 states have internal predecessors, (112), 39 states have call successors, (39), 18 states have call predecessors, (39), 17 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 11:26:39,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:26:39,442 INFO L93 Difference]: Finished difference Result 158 states and 193 transitions. [2022-04-28 11:26:39,442 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 193 transitions. [2022-04-28 11:26:39,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:26:39,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:26:39,442 INFO L74 IsIncluded]: Start isIncluded. First operand has 153 states, 96 states have (on average 1.1666666666666667) internal successors, (112), 99 states have internal predecessors, (112), 39 states have call successors, (39), 18 states have call predecessors, (39), 17 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) Second operand 158 states. [2022-04-28 11:26:39,443 INFO L87 Difference]: Start difference. First operand has 153 states, 96 states have (on average 1.1666666666666667) internal successors, (112), 99 states have internal predecessors, (112), 39 states have call successors, (39), 18 states have call predecessors, (39), 17 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) Second operand 158 states. [2022-04-28 11:26:39,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:26:39,445 INFO L93 Difference]: Finished difference Result 158 states and 193 transitions. [2022-04-28 11:26:39,445 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 193 transitions. [2022-04-28 11:26:39,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:26:39,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:26:39,445 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:26:39,445 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:26:39,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 96 states have (on average 1.1666666666666667) internal successors, (112), 99 states have internal predecessors, (112), 39 states have call successors, (39), 18 states have call predecessors, (39), 17 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 11:26:39,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 188 transitions. [2022-04-28 11:26:39,448 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 188 transitions. Word has length 79 [2022-04-28 11:26:39,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:26:39,448 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 188 transitions. [2022-04-28 11:26:39,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 11:26:39,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 153 states and 188 transitions. [2022-04-28 11:26:39,649 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:26:39,649 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 188 transitions. [2022-04-28 11:26:39,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-28 11:26:39,650 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:26:39,650 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:26:39,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-04-28 11:26:39,866 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 11:26:39,866 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:26:39,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:26:39,867 INFO L85 PathProgramCache]: Analyzing trace with hash -554329876, now seen corresponding path program 3 times [2022-04-28 11:26:39,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:26:39,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1275156697] [2022-04-28 11:26:59,226 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:26:59,226 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:26:59,226 INFO L85 PathProgramCache]: Analyzing trace with hash -554329876, now seen corresponding path program 4 times [2022-04-28 11:26:59,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:26:59,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786472587] [2022-04-28 11:26:59,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:26:59,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:26:59,236 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:26:59,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [690169360] [2022-04-28 11:26:59,236 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:26:59,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:26:59,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:26:59,237 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 11:26:59,238 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 11:26:59,284 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:26:59,284 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:26:59,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 11:26:59,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:26:59,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:26:59,852 INFO L272 TraceCheckUtils]: 0: Hoare triple {11071#true} call ULTIMATE.init(); {11071#true} is VALID [2022-04-28 11:26:59,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {11071#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {11071#true} is VALID [2022-04-28 11:26:59,853 INFO L290 TraceCheckUtils]: 2: Hoare triple {11071#true} assume true; {11071#true} is VALID [2022-04-28 11:26:59,853 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11071#true} {11071#true} #93#return; {11071#true} is VALID [2022-04-28 11:26:59,853 INFO L272 TraceCheckUtils]: 4: Hoare triple {11071#true} call #t~ret8 := main(); {11071#true} is VALID [2022-04-28 11:26:59,853 INFO L290 TraceCheckUtils]: 5: Hoare triple {11071#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {11071#true} is VALID [2022-04-28 11:26:59,853 INFO L272 TraceCheckUtils]: 6: Hoare triple {11071#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11071#true} is VALID [2022-04-28 11:26:59,853 INFO L290 TraceCheckUtils]: 7: Hoare triple {11071#true} ~cond := #in~cond; {11097#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 11:26:59,853 INFO L290 TraceCheckUtils]: 8: Hoare triple {11097#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {11101#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:26:59,854 INFO L290 TraceCheckUtils]: 9: Hoare triple {11101#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {11101#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:26:59,854 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11101#(not (= |assume_abort_if_not_#in~cond| 0))} {11071#true} #77#return; {11108#(<= 1 main_~y~0)} is VALID [2022-04-28 11:26:59,855 INFO L290 TraceCheckUtils]: 11: Hoare triple {11108#(<= 1 main_~y~0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {11112#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:26:59,856 INFO L290 TraceCheckUtils]: 12: Hoare triple {11112#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11112#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:26:59,856 INFO L290 TraceCheckUtils]: 13: Hoare triple {11112#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} assume !!(#t~post6 < 5);havoc #t~post6; {11112#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:26:59,856 INFO L272 TraceCheckUtils]: 14: Hoare triple {11112#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {11071#true} is VALID [2022-04-28 11:26:59,856 INFO L290 TraceCheckUtils]: 15: Hoare triple {11071#true} ~cond := #in~cond; {11071#true} is VALID [2022-04-28 11:26:59,856 INFO L290 TraceCheckUtils]: 16: Hoare triple {11071#true} assume !(0 == ~cond); {11071#true} is VALID [2022-04-28 11:26:59,856 INFO L290 TraceCheckUtils]: 17: Hoare triple {11071#true} assume true; {11071#true} is VALID [2022-04-28 11:26:59,857 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {11071#true} {11112#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} #79#return; {11112#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:26:59,857 INFO L272 TraceCheckUtils]: 19: Hoare triple {11112#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {11071#true} is VALID [2022-04-28 11:26:59,857 INFO L290 TraceCheckUtils]: 20: Hoare triple {11071#true} ~cond := #in~cond; {11071#true} is VALID [2022-04-28 11:26:59,857 INFO L290 TraceCheckUtils]: 21: Hoare triple {11071#true} assume !(0 == ~cond); {11071#true} is VALID [2022-04-28 11:26:59,857 INFO L290 TraceCheckUtils]: 22: Hoare triple {11071#true} assume true; {11071#true} is VALID [2022-04-28 11:26:59,857 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11071#true} {11112#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} #81#return; {11112#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:26:59,858 INFO L290 TraceCheckUtils]: 24: Hoare triple {11112#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {11152#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:26:59,858 INFO L290 TraceCheckUtils]: 25: Hoare triple {11152#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11152#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:26:59,858 INFO L290 TraceCheckUtils]: 26: Hoare triple {11152#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} assume !!(#t~post7 < 5);havoc #t~post7; {11152#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:26:59,858 INFO L272 TraceCheckUtils]: 27: Hoare triple {11152#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {11071#true} is VALID [2022-04-28 11:26:59,858 INFO L290 TraceCheckUtils]: 28: Hoare triple {11071#true} ~cond := #in~cond; {11071#true} is VALID [2022-04-28 11:26:59,859 INFO L290 TraceCheckUtils]: 29: Hoare triple {11071#true} assume !(0 == ~cond); {11071#true} is VALID [2022-04-28 11:26:59,859 INFO L290 TraceCheckUtils]: 30: Hoare triple {11071#true} assume true; {11071#true} is VALID [2022-04-28 11:26:59,859 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {11071#true} {11152#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} #83#return; {11152#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:26:59,859 INFO L272 TraceCheckUtils]: 32: Hoare triple {11152#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {11071#true} is VALID [2022-04-28 11:26:59,859 INFO L290 TraceCheckUtils]: 33: Hoare triple {11071#true} ~cond := #in~cond; {11071#true} is VALID [2022-04-28 11:26:59,859 INFO L290 TraceCheckUtils]: 34: Hoare triple {11071#true} assume !(0 == ~cond); {11071#true} is VALID [2022-04-28 11:26:59,859 INFO L290 TraceCheckUtils]: 35: Hoare triple {11071#true} assume true; {11071#true} is VALID [2022-04-28 11:26:59,860 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {11071#true} {11152#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} #85#return; {11152#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:26:59,860 INFO L272 TraceCheckUtils]: 37: Hoare triple {11152#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {11071#true} is VALID [2022-04-28 11:26:59,860 INFO L290 TraceCheckUtils]: 38: Hoare triple {11071#true} ~cond := #in~cond; {11071#true} is VALID [2022-04-28 11:26:59,860 INFO L290 TraceCheckUtils]: 39: Hoare triple {11071#true} assume !(0 == ~cond); {11071#true} is VALID [2022-04-28 11:26:59,860 INFO L290 TraceCheckUtils]: 40: Hoare triple {11071#true} assume true; {11071#true} is VALID [2022-04-28 11:26:59,860 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {11071#true} {11152#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} #87#return; {11152#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:26:59,861 INFO L290 TraceCheckUtils]: 42: Hoare triple {11152#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} assume !!(~r~0 >= 2 * ~b~0); {11152#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:26:59,861 INFO L272 TraceCheckUtils]: 43: Hoare triple {11152#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {11071#true} is VALID [2022-04-28 11:26:59,861 INFO L290 TraceCheckUtils]: 44: Hoare triple {11071#true} ~cond := #in~cond; {11071#true} is VALID [2022-04-28 11:26:59,861 INFO L290 TraceCheckUtils]: 45: Hoare triple {11071#true} assume !(0 == ~cond); {11071#true} is VALID [2022-04-28 11:26:59,861 INFO L290 TraceCheckUtils]: 46: Hoare triple {11071#true} assume true; {11071#true} is VALID [2022-04-28 11:26:59,862 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {11071#true} {11152#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} #89#return; {11152#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:26:59,862 INFO L290 TraceCheckUtils]: 48: Hoare triple {11152#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {11225#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2) (<= 1 main_~y~0))} is VALID [2022-04-28 11:26:59,862 INFO L290 TraceCheckUtils]: 49: Hoare triple {11225#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2) (<= 1 main_~y~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11225#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2) (<= 1 main_~y~0))} is VALID [2022-04-28 11:26:59,863 INFO L290 TraceCheckUtils]: 50: Hoare triple {11225#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2) (<= 1 main_~y~0))} assume !!(#t~post7 < 5);havoc #t~post7; {11225#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2) (<= 1 main_~y~0))} is VALID [2022-04-28 11:26:59,863 INFO L272 TraceCheckUtils]: 51: Hoare triple {11225#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {11071#true} is VALID [2022-04-28 11:26:59,863 INFO L290 TraceCheckUtils]: 52: Hoare triple {11071#true} ~cond := #in~cond; {11071#true} is VALID [2022-04-28 11:26:59,863 INFO L290 TraceCheckUtils]: 53: Hoare triple {11071#true} assume !(0 == ~cond); {11071#true} is VALID [2022-04-28 11:26:59,863 INFO L290 TraceCheckUtils]: 54: Hoare triple {11071#true} assume true; {11071#true} is VALID [2022-04-28 11:26:59,863 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {11071#true} {11225#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2) (<= 1 main_~y~0))} #83#return; {11225#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2) (<= 1 main_~y~0))} is VALID [2022-04-28 11:26:59,864 INFO L272 TraceCheckUtils]: 56: Hoare triple {11225#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {11071#true} is VALID [2022-04-28 11:26:59,864 INFO L290 TraceCheckUtils]: 57: Hoare triple {11071#true} ~cond := #in~cond; {11071#true} is VALID [2022-04-28 11:26:59,864 INFO L290 TraceCheckUtils]: 58: Hoare triple {11071#true} assume !(0 == ~cond); {11071#true} is VALID [2022-04-28 11:26:59,864 INFO L290 TraceCheckUtils]: 59: Hoare triple {11071#true} assume true; {11071#true} is VALID [2022-04-28 11:26:59,864 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {11071#true} {11225#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2) (<= 1 main_~y~0))} #85#return; {11225#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2) (<= 1 main_~y~0))} is VALID [2022-04-28 11:26:59,864 INFO L272 TraceCheckUtils]: 61: Hoare triple {11225#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {11071#true} is VALID [2022-04-28 11:26:59,864 INFO L290 TraceCheckUtils]: 62: Hoare triple {11071#true} ~cond := #in~cond; {11071#true} is VALID [2022-04-28 11:26:59,864 INFO L290 TraceCheckUtils]: 63: Hoare triple {11071#true} assume !(0 == ~cond); {11071#true} is VALID [2022-04-28 11:26:59,864 INFO L290 TraceCheckUtils]: 64: Hoare triple {11071#true} assume true; {11071#true} is VALID [2022-04-28 11:26:59,865 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {11071#true} {11225#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2) (<= 1 main_~y~0))} #87#return; {11225#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2) (<= 1 main_~y~0))} is VALID [2022-04-28 11:26:59,865 INFO L290 TraceCheckUtils]: 66: Hoare triple {11225#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2) (<= 1 main_~y~0))} assume !!(~r~0 >= 2 * ~b~0); {11225#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2) (<= 1 main_~y~0))} is VALID [2022-04-28 11:26:59,865 INFO L272 TraceCheckUtils]: 67: Hoare triple {11225#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {11071#true} is VALID [2022-04-28 11:26:59,865 INFO L290 TraceCheckUtils]: 68: Hoare triple {11071#true} ~cond := #in~cond; {11071#true} is VALID [2022-04-28 11:26:59,865 INFO L290 TraceCheckUtils]: 69: Hoare triple {11071#true} assume !(0 == ~cond); {11071#true} is VALID [2022-04-28 11:26:59,865 INFO L290 TraceCheckUtils]: 70: Hoare triple {11071#true} assume true; {11071#true} is VALID [2022-04-28 11:26:59,866 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {11071#true} {11225#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2) (<= 1 main_~y~0))} #89#return; {11225#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2) (<= 1 main_~y~0))} is VALID [2022-04-28 11:26:59,867 INFO L290 TraceCheckUtils]: 72: Hoare triple {11225#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (= main_~q~0 0) (= main_~a~0 2) (<= 1 main_~y~0))} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {11298#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 4)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 4))} is VALID [2022-04-28 11:26:59,867 INFO L290 TraceCheckUtils]: 73: Hoare triple {11298#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 4)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 4))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11298#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 4)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 4))} is VALID [2022-04-28 11:26:59,867 INFO L290 TraceCheckUtils]: 74: Hoare triple {11298#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 4)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 4))} assume !(#t~post7 < 5);havoc #t~post7; {11298#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 4)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 4))} is VALID [2022-04-28 11:26:59,868 INFO L290 TraceCheckUtils]: 75: Hoare triple {11298#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 4)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 4))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {11308#(and (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= main_~q~0 4) (<= 1 main_~y~0))} is VALID [2022-04-28 11:26:59,868 INFO L290 TraceCheckUtils]: 76: Hoare triple {11308#(and (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= main_~q~0 4) (<= 1 main_~y~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11308#(and (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= main_~q~0 4) (<= 1 main_~y~0))} is VALID [2022-04-28 11:26:59,869 INFO L290 TraceCheckUtils]: 77: Hoare triple {11308#(and (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= main_~q~0 4) (<= 1 main_~y~0))} assume !(#t~post6 < 5);havoc #t~post6; {11308#(and (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= main_~q~0 4) (<= 1 main_~y~0))} is VALID [2022-04-28 11:26:59,869 INFO L272 TraceCheckUtils]: 78: Hoare triple {11308#(and (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= main_~q~0 4) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {11318#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:26:59,869 INFO L290 TraceCheckUtils]: 79: Hoare triple {11318#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11322#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:26:59,870 INFO L290 TraceCheckUtils]: 80: Hoare triple {11322#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11072#false} is VALID [2022-04-28 11:26:59,870 INFO L290 TraceCheckUtils]: 81: Hoare triple {11072#false} assume !false; {11072#false} is VALID [2022-04-28 11:26:59,870 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 20 proven. 14 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-28 11:26:59,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:27:00,235 INFO L290 TraceCheckUtils]: 81: Hoare triple {11072#false} assume !false; {11072#false} is VALID [2022-04-28 11:27:00,236 INFO L290 TraceCheckUtils]: 80: Hoare triple {11322#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11072#false} is VALID [2022-04-28 11:27:00,237 INFO L290 TraceCheckUtils]: 79: Hoare triple {11318#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11322#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:27:00,237 INFO L272 TraceCheckUtils]: 78: Hoare triple {11338#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {11318#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:27:00,238 INFO L290 TraceCheckUtils]: 77: Hoare triple {11338#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !(#t~post6 < 5);havoc #t~post6; {11338#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:27:00,238 INFO L290 TraceCheckUtils]: 76: Hoare triple {11338#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11338#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:27:00,245 INFO L290 TraceCheckUtils]: 75: Hoare triple {11348#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {11338#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:27:00,245 INFO L290 TraceCheckUtils]: 74: Hoare triple {11348#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} assume !(#t~post7 < 5);havoc #t~post7; {11348#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:27:00,246 INFO L290 TraceCheckUtils]: 73: Hoare triple {11348#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11348#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:27:00,249 INFO L290 TraceCheckUtils]: 72: Hoare triple {11358#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {11348#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:27:00,249 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {11071#true} {11358#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} #89#return; {11358#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:27:00,250 INFO L290 TraceCheckUtils]: 70: Hoare triple {11071#true} assume true; {11071#true} is VALID [2022-04-28 11:27:00,250 INFO L290 TraceCheckUtils]: 69: Hoare triple {11071#true} assume !(0 == ~cond); {11071#true} is VALID [2022-04-28 11:27:00,250 INFO L290 TraceCheckUtils]: 68: Hoare triple {11071#true} ~cond := #in~cond; {11071#true} is VALID [2022-04-28 11:27:00,250 INFO L272 TraceCheckUtils]: 67: Hoare triple {11358#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {11071#true} is VALID [2022-04-28 11:27:00,250 INFO L290 TraceCheckUtils]: 66: Hoare triple {11358#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} assume !!(~r~0 >= 2 * ~b~0); {11358#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:27:00,251 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {11071#true} {11358#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} #87#return; {11358#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:27:00,251 INFO L290 TraceCheckUtils]: 64: Hoare triple {11071#true} assume true; {11071#true} is VALID [2022-04-28 11:27:00,251 INFO L290 TraceCheckUtils]: 63: Hoare triple {11071#true} assume !(0 == ~cond); {11071#true} is VALID [2022-04-28 11:27:00,251 INFO L290 TraceCheckUtils]: 62: Hoare triple {11071#true} ~cond := #in~cond; {11071#true} is VALID [2022-04-28 11:27:00,251 INFO L272 TraceCheckUtils]: 61: Hoare triple {11358#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {11071#true} is VALID [2022-04-28 11:27:00,251 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {11071#true} {11358#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} #85#return; {11358#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:27:00,251 INFO L290 TraceCheckUtils]: 59: Hoare triple {11071#true} assume true; {11071#true} is VALID [2022-04-28 11:27:00,251 INFO L290 TraceCheckUtils]: 58: Hoare triple {11071#true} assume !(0 == ~cond); {11071#true} is VALID [2022-04-28 11:27:00,251 INFO L290 TraceCheckUtils]: 57: Hoare triple {11071#true} ~cond := #in~cond; {11071#true} is VALID [2022-04-28 11:27:00,251 INFO L272 TraceCheckUtils]: 56: Hoare triple {11358#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {11071#true} is VALID [2022-04-28 11:27:00,252 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {11071#true} {11358#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} #83#return; {11358#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:27:00,252 INFO L290 TraceCheckUtils]: 54: Hoare triple {11071#true} assume true; {11071#true} is VALID [2022-04-28 11:27:00,252 INFO L290 TraceCheckUtils]: 53: Hoare triple {11071#true} assume !(0 == ~cond); {11071#true} is VALID [2022-04-28 11:27:00,252 INFO L290 TraceCheckUtils]: 52: Hoare triple {11071#true} ~cond := #in~cond; {11071#true} is VALID [2022-04-28 11:27:00,252 INFO L272 TraceCheckUtils]: 51: Hoare triple {11358#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {11071#true} is VALID [2022-04-28 11:27:00,257 INFO L290 TraceCheckUtils]: 50: Hoare triple {11358#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} assume !!(#t~post7 < 5);havoc #t~post7; {11358#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:27:00,258 INFO L290 TraceCheckUtils]: 49: Hoare triple {11358#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11358#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:27:00,260 INFO L290 TraceCheckUtils]: 48: Hoare triple {11431#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {11358#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:27:00,261 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {11071#true} {11431#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} #89#return; {11431#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} is VALID [2022-04-28 11:27:00,261 INFO L290 TraceCheckUtils]: 46: Hoare triple {11071#true} assume true; {11071#true} is VALID [2022-04-28 11:27:00,261 INFO L290 TraceCheckUtils]: 45: Hoare triple {11071#true} assume !(0 == ~cond); {11071#true} is VALID [2022-04-28 11:27:00,261 INFO L290 TraceCheckUtils]: 44: Hoare triple {11071#true} ~cond := #in~cond; {11071#true} is VALID [2022-04-28 11:27:00,261 INFO L272 TraceCheckUtils]: 43: Hoare triple {11431#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {11071#true} is VALID [2022-04-28 11:27:00,262 INFO L290 TraceCheckUtils]: 42: Hoare triple {11431#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} assume !!(~r~0 >= 2 * ~b~0); {11431#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} is VALID [2022-04-28 11:27:00,262 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {11071#true} {11431#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} #87#return; {11431#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} is VALID [2022-04-28 11:27:00,262 INFO L290 TraceCheckUtils]: 40: Hoare triple {11071#true} assume true; {11071#true} is VALID [2022-04-28 11:27:00,262 INFO L290 TraceCheckUtils]: 39: Hoare triple {11071#true} assume !(0 == ~cond); {11071#true} is VALID [2022-04-28 11:27:00,262 INFO L290 TraceCheckUtils]: 38: Hoare triple {11071#true} ~cond := #in~cond; {11071#true} is VALID [2022-04-28 11:27:00,262 INFO L272 TraceCheckUtils]: 37: Hoare triple {11431#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {11071#true} is VALID [2022-04-28 11:27:00,263 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {11071#true} {11431#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} #85#return; {11431#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} is VALID [2022-04-28 11:27:00,263 INFO L290 TraceCheckUtils]: 35: Hoare triple {11071#true} assume true; {11071#true} is VALID [2022-04-28 11:27:00,263 INFO L290 TraceCheckUtils]: 34: Hoare triple {11071#true} assume !(0 == ~cond); {11071#true} is VALID [2022-04-28 11:27:00,263 INFO L290 TraceCheckUtils]: 33: Hoare triple {11071#true} ~cond := #in~cond; {11071#true} is VALID [2022-04-28 11:27:00,263 INFO L272 TraceCheckUtils]: 32: Hoare triple {11431#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {11071#true} is VALID [2022-04-28 11:27:00,263 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {11071#true} {11431#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} #83#return; {11431#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} is VALID [2022-04-28 11:27:00,264 INFO L290 TraceCheckUtils]: 30: Hoare triple {11071#true} assume true; {11071#true} is VALID [2022-04-28 11:27:00,264 INFO L290 TraceCheckUtils]: 29: Hoare triple {11071#true} assume !(0 == ~cond); {11071#true} is VALID [2022-04-28 11:27:00,264 INFO L290 TraceCheckUtils]: 28: Hoare triple {11071#true} ~cond := #in~cond; {11071#true} is VALID [2022-04-28 11:27:00,264 INFO L272 TraceCheckUtils]: 27: Hoare triple {11431#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {11071#true} is VALID [2022-04-28 11:27:00,264 INFO L290 TraceCheckUtils]: 26: Hoare triple {11431#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} assume !!(#t~post7 < 5);havoc #t~post7; {11431#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} is VALID [2022-04-28 11:27:00,264 INFO L290 TraceCheckUtils]: 25: Hoare triple {11431#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11431#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} is VALID [2022-04-28 11:27:00,265 INFO L290 TraceCheckUtils]: 24: Hoare triple {11338#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {11431#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} is VALID [2022-04-28 11:27:00,265 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11071#true} {11338#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #81#return; {11338#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:27:00,265 INFO L290 TraceCheckUtils]: 22: Hoare triple {11071#true} assume true; {11071#true} is VALID [2022-04-28 11:27:00,265 INFO L290 TraceCheckUtils]: 21: Hoare triple {11071#true} assume !(0 == ~cond); {11071#true} is VALID [2022-04-28 11:27:00,265 INFO L290 TraceCheckUtils]: 20: Hoare triple {11071#true} ~cond := #in~cond; {11071#true} is VALID [2022-04-28 11:27:00,265 INFO L272 TraceCheckUtils]: 19: Hoare triple {11338#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {11071#true} is VALID [2022-04-28 11:27:00,266 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {11071#true} {11338#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #79#return; {11338#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:27:00,266 INFO L290 TraceCheckUtils]: 17: Hoare triple {11071#true} assume true; {11071#true} is VALID [2022-04-28 11:27:00,266 INFO L290 TraceCheckUtils]: 16: Hoare triple {11071#true} assume !(0 == ~cond); {11071#true} is VALID [2022-04-28 11:27:00,266 INFO L290 TraceCheckUtils]: 15: Hoare triple {11071#true} ~cond := #in~cond; {11071#true} is VALID [2022-04-28 11:27:00,266 INFO L272 TraceCheckUtils]: 14: Hoare triple {11338#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {11071#true} is VALID [2022-04-28 11:27:00,266 INFO L290 TraceCheckUtils]: 13: Hoare triple {11338#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(#t~post6 < 5);havoc #t~post6; {11338#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:27:00,266 INFO L290 TraceCheckUtils]: 12: Hoare triple {11338#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11338#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:27:00,267 INFO L290 TraceCheckUtils]: 11: Hoare triple {11071#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {11338#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:27:00,267 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11071#true} {11071#true} #77#return; {11071#true} is VALID [2022-04-28 11:27:00,267 INFO L290 TraceCheckUtils]: 9: Hoare triple {11071#true} assume true; {11071#true} is VALID [2022-04-28 11:27:00,267 INFO L290 TraceCheckUtils]: 8: Hoare triple {11071#true} assume !(0 == ~cond); {11071#true} is VALID [2022-04-28 11:27:00,267 INFO L290 TraceCheckUtils]: 7: Hoare triple {11071#true} ~cond := #in~cond; {11071#true} is VALID [2022-04-28 11:27:00,267 INFO L272 TraceCheckUtils]: 6: Hoare triple {11071#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11071#true} is VALID [2022-04-28 11:27:00,267 INFO L290 TraceCheckUtils]: 5: Hoare triple {11071#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {11071#true} is VALID [2022-04-28 11:27:00,267 INFO L272 TraceCheckUtils]: 4: Hoare triple {11071#true} call #t~ret8 := main(); {11071#true} is VALID [2022-04-28 11:27:00,267 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11071#true} {11071#true} #93#return; {11071#true} is VALID [2022-04-28 11:27:00,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {11071#true} assume true; {11071#true} is VALID [2022-04-28 11:27:00,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {11071#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {11071#true} is VALID [2022-04-28 11:27:00,267 INFO L272 TraceCheckUtils]: 0: Hoare triple {11071#true} call ULTIMATE.init(); {11071#true} is VALID [2022-04-28 11:27:00,268 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2022-04-28 11:27:00,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:27:00,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786472587] [2022-04-28 11:27:00,268 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:27:00,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690169360] [2022-04-28 11:27:00,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690169360] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:27:00,268 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:27:00,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 16 [2022-04-28 11:27:00,268 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:27:00,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1275156697] [2022-04-28 11:27:00,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1275156697] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:27:00,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:27:00,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 11:27:00,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292928829] [2022-04-28 11:27:00,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:27:00,269 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 10 states have internal predecessors, (29), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) Word has length 82 [2022-04-28 11:27:00,269 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:27:00,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 10 states have internal predecessors, (29), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:27:00,321 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:27:00,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 11:27:00,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:27:00,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 11:27:00,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-04-28 11:27:00,322 INFO L87 Difference]: Start difference. First operand 153 states and 188 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 10 states have internal predecessors, (29), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:27:01,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:27:01,728 INFO L93 Difference]: Finished difference Result 201 states and 254 transitions. [2022-04-28 11:27:01,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 11:27:01,729 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 10 states have internal predecessors, (29), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) Word has length 82 [2022-04-28 11:27:01,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:27:01,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 10 states have internal predecessors, (29), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:27:01,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 135 transitions. [2022-04-28 11:27:01,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 10 states have internal predecessors, (29), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:27:01,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 135 transitions. [2022-04-28 11:27:01,732 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 135 transitions. [2022-04-28 11:27:01,860 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:27:01,865 INFO L225 Difference]: With dead ends: 201 [2022-04-28 11:27:01,865 INFO L226 Difference]: Without dead ends: 198 [2022-04-28 11:27:01,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 147 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-04-28 11:27:01,866 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 52 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 11:27:01,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 391 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 11:27:01,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-04-28 11:27:02,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 168. [2022-04-28 11:27:02,074 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:27:02,075 INFO L82 GeneralOperation]: Start isEquivalent. First operand 198 states. Second operand has 168 states, 106 states have (on average 1.169811320754717) internal successors, (124), 108 states have internal predecessors, (124), 42 states have call successors, (42), 20 states have call predecessors, (42), 19 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-28 11:27:02,075 INFO L74 IsIncluded]: Start isIncluded. First operand 198 states. Second operand has 168 states, 106 states have (on average 1.169811320754717) internal successors, (124), 108 states have internal predecessors, (124), 42 states have call successors, (42), 20 states have call predecessors, (42), 19 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-28 11:27:02,075 INFO L87 Difference]: Start difference. First operand 198 states. Second operand has 168 states, 106 states have (on average 1.169811320754717) internal successors, (124), 108 states have internal predecessors, (124), 42 states have call successors, (42), 20 states have call predecessors, (42), 19 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-28 11:27:02,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:27:02,079 INFO L93 Difference]: Finished difference Result 198 states and 249 transitions. [2022-04-28 11:27:02,079 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 249 transitions. [2022-04-28 11:27:02,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:27:02,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:27:02,080 INFO L74 IsIncluded]: Start isIncluded. First operand has 168 states, 106 states have (on average 1.169811320754717) internal successors, (124), 108 states have internal predecessors, (124), 42 states have call successors, (42), 20 states have call predecessors, (42), 19 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) Second operand 198 states. [2022-04-28 11:27:02,080 INFO L87 Difference]: Start difference. First operand has 168 states, 106 states have (on average 1.169811320754717) internal successors, (124), 108 states have internal predecessors, (124), 42 states have call successors, (42), 20 states have call predecessors, (42), 19 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) Second operand 198 states. [2022-04-28 11:27:02,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:27:02,084 INFO L93 Difference]: Finished difference Result 198 states and 249 transitions. [2022-04-28 11:27:02,084 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 249 transitions. [2022-04-28 11:27:02,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:27:02,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:27:02,084 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:27:02,084 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:27:02,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 106 states have (on average 1.169811320754717) internal successors, (124), 108 states have internal predecessors, (124), 42 states have call successors, (42), 20 states have call predecessors, (42), 19 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-28 11:27:02,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 206 transitions. [2022-04-28 11:27:02,087 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 206 transitions. Word has length 82 [2022-04-28 11:27:02,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:27:02,088 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 206 transitions. [2022-04-28 11:27:02,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 10 states have internal predecessors, (29), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-28 11:27:02,088 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 168 states and 206 transitions. [2022-04-28 11:27:02,323 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 206 edges. 206 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:27:02,323 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 206 transitions. [2022-04-28 11:27:02,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-04-28 11:27:02,324 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:27:02,324 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 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, 1, 1] [2022-04-28 11:27:02,343 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 11:27:02,524 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 11:27:02,524 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:27:02,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:27:02,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1891783602, now seen corresponding path program 1 times [2022-04-28 11:27:02,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:27:02,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1465146092] [2022-04-28 11:27:30,249 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:27:30,249 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:27:30,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1891783602, now seen corresponding path program 2 times [2022-04-28 11:27:30,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:27:30,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110420081] [2022-04-28 11:27:30,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:27:30,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:27:30,267 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:27:30,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1190157061] [2022-04-28 11:27:30,267 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:27:30,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:27:30,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:27:30,275 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 11:27:30,275 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 11:27:30,330 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:27:30,330 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:27:30,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 11:27:30,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:27:30,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:27:30,655 INFO L272 TraceCheckUtils]: 0: Hoare triple {12716#true} call ULTIMATE.init(); {12716#true} is VALID [2022-04-28 11:27:30,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {12716#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {12724#(<= ~counter~0 0)} is VALID [2022-04-28 11:27:30,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {12724#(<= ~counter~0 0)} assume true; {12724#(<= ~counter~0 0)} is VALID [2022-04-28 11:27:30,656 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12724#(<= ~counter~0 0)} {12716#true} #93#return; {12724#(<= ~counter~0 0)} is VALID [2022-04-28 11:27:30,656 INFO L272 TraceCheckUtils]: 4: Hoare triple {12724#(<= ~counter~0 0)} call #t~ret8 := main(); {12724#(<= ~counter~0 0)} is VALID [2022-04-28 11:27:30,656 INFO L290 TraceCheckUtils]: 5: Hoare triple {12724#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {12724#(<= ~counter~0 0)} is VALID [2022-04-28 11:27:30,657 INFO L272 TraceCheckUtils]: 6: Hoare triple {12724#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {12724#(<= ~counter~0 0)} is VALID [2022-04-28 11:27:30,657 INFO L290 TraceCheckUtils]: 7: Hoare triple {12724#(<= ~counter~0 0)} ~cond := #in~cond; {12724#(<= ~counter~0 0)} is VALID [2022-04-28 11:27:30,657 INFO L290 TraceCheckUtils]: 8: Hoare triple {12724#(<= ~counter~0 0)} assume !(0 == ~cond); {12724#(<= ~counter~0 0)} is VALID [2022-04-28 11:27:30,657 INFO L290 TraceCheckUtils]: 9: Hoare triple {12724#(<= ~counter~0 0)} assume true; {12724#(<= ~counter~0 0)} is VALID [2022-04-28 11:27:30,658 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12724#(<= ~counter~0 0)} {12724#(<= ~counter~0 0)} #77#return; {12724#(<= ~counter~0 0)} is VALID [2022-04-28 11:27:30,658 INFO L290 TraceCheckUtils]: 11: Hoare triple {12724#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {12724#(<= ~counter~0 0)} is VALID [2022-04-28 11:27:30,658 INFO L290 TraceCheckUtils]: 12: Hoare triple {12724#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12758#(<= ~counter~0 1)} is VALID [2022-04-28 11:27:30,659 INFO L290 TraceCheckUtils]: 13: Hoare triple {12758#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {12758#(<= ~counter~0 1)} is VALID [2022-04-28 11:27:30,659 INFO L272 TraceCheckUtils]: 14: Hoare triple {12758#(<= ~counter~0 1)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {12758#(<= ~counter~0 1)} is VALID [2022-04-28 11:27:30,659 INFO L290 TraceCheckUtils]: 15: Hoare triple {12758#(<= ~counter~0 1)} ~cond := #in~cond; {12758#(<= ~counter~0 1)} is VALID [2022-04-28 11:27:30,660 INFO L290 TraceCheckUtils]: 16: Hoare triple {12758#(<= ~counter~0 1)} assume !(0 == ~cond); {12758#(<= ~counter~0 1)} is VALID [2022-04-28 11:27:30,660 INFO L290 TraceCheckUtils]: 17: Hoare triple {12758#(<= ~counter~0 1)} assume true; {12758#(<= ~counter~0 1)} is VALID [2022-04-28 11:27:30,660 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12758#(<= ~counter~0 1)} {12758#(<= ~counter~0 1)} #79#return; {12758#(<= ~counter~0 1)} is VALID [2022-04-28 11:27:30,661 INFO L272 TraceCheckUtils]: 19: Hoare triple {12758#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {12758#(<= ~counter~0 1)} is VALID [2022-04-28 11:27:30,661 INFO L290 TraceCheckUtils]: 20: Hoare triple {12758#(<= ~counter~0 1)} ~cond := #in~cond; {12758#(<= ~counter~0 1)} is VALID [2022-04-28 11:27:30,661 INFO L290 TraceCheckUtils]: 21: Hoare triple {12758#(<= ~counter~0 1)} assume !(0 == ~cond); {12758#(<= ~counter~0 1)} is VALID [2022-04-28 11:27:30,661 INFO L290 TraceCheckUtils]: 22: Hoare triple {12758#(<= ~counter~0 1)} assume true; {12758#(<= ~counter~0 1)} is VALID [2022-04-28 11:27:30,662 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {12758#(<= ~counter~0 1)} {12758#(<= ~counter~0 1)} #81#return; {12758#(<= ~counter~0 1)} is VALID [2022-04-28 11:27:30,662 INFO L290 TraceCheckUtils]: 24: Hoare triple {12758#(<= ~counter~0 1)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {12758#(<= ~counter~0 1)} is VALID [2022-04-28 11:27:30,662 INFO L290 TraceCheckUtils]: 25: Hoare triple {12758#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {12798#(<= ~counter~0 2)} is VALID [2022-04-28 11:27:30,663 INFO L290 TraceCheckUtils]: 26: Hoare triple {12798#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {12798#(<= ~counter~0 2)} is VALID [2022-04-28 11:27:30,663 INFO L272 TraceCheckUtils]: 27: Hoare triple {12798#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {12798#(<= ~counter~0 2)} is VALID [2022-04-28 11:27:30,663 INFO L290 TraceCheckUtils]: 28: Hoare triple {12798#(<= ~counter~0 2)} ~cond := #in~cond; {12798#(<= ~counter~0 2)} is VALID [2022-04-28 11:27:30,664 INFO L290 TraceCheckUtils]: 29: Hoare triple {12798#(<= ~counter~0 2)} assume !(0 == ~cond); {12798#(<= ~counter~0 2)} is VALID [2022-04-28 11:27:30,664 INFO L290 TraceCheckUtils]: 30: Hoare triple {12798#(<= ~counter~0 2)} assume true; {12798#(<= ~counter~0 2)} is VALID [2022-04-28 11:27:30,664 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {12798#(<= ~counter~0 2)} {12798#(<= ~counter~0 2)} #83#return; {12798#(<= ~counter~0 2)} is VALID [2022-04-28 11:27:30,665 INFO L272 TraceCheckUtils]: 32: Hoare triple {12798#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {12798#(<= ~counter~0 2)} is VALID [2022-04-28 11:27:30,665 INFO L290 TraceCheckUtils]: 33: Hoare triple {12798#(<= ~counter~0 2)} ~cond := #in~cond; {12798#(<= ~counter~0 2)} is VALID [2022-04-28 11:27:30,665 INFO L290 TraceCheckUtils]: 34: Hoare triple {12798#(<= ~counter~0 2)} assume !(0 == ~cond); {12798#(<= ~counter~0 2)} is VALID [2022-04-28 11:27:30,665 INFO L290 TraceCheckUtils]: 35: Hoare triple {12798#(<= ~counter~0 2)} assume true; {12798#(<= ~counter~0 2)} is VALID [2022-04-28 11:27:30,666 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {12798#(<= ~counter~0 2)} {12798#(<= ~counter~0 2)} #85#return; {12798#(<= ~counter~0 2)} is VALID [2022-04-28 11:27:30,666 INFO L272 TraceCheckUtils]: 37: Hoare triple {12798#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {12798#(<= ~counter~0 2)} is VALID [2022-04-28 11:27:30,666 INFO L290 TraceCheckUtils]: 38: Hoare triple {12798#(<= ~counter~0 2)} ~cond := #in~cond; {12798#(<= ~counter~0 2)} is VALID [2022-04-28 11:27:30,667 INFO L290 TraceCheckUtils]: 39: Hoare triple {12798#(<= ~counter~0 2)} assume !(0 == ~cond); {12798#(<= ~counter~0 2)} is VALID [2022-04-28 11:27:30,667 INFO L290 TraceCheckUtils]: 40: Hoare triple {12798#(<= ~counter~0 2)} assume true; {12798#(<= ~counter~0 2)} is VALID [2022-04-28 11:27:30,667 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {12798#(<= ~counter~0 2)} {12798#(<= ~counter~0 2)} #87#return; {12798#(<= ~counter~0 2)} is VALID [2022-04-28 11:27:30,668 INFO L290 TraceCheckUtils]: 42: Hoare triple {12798#(<= ~counter~0 2)} assume !!(~r~0 >= 2 * ~b~0); {12798#(<= ~counter~0 2)} is VALID [2022-04-28 11:27:30,668 INFO L272 TraceCheckUtils]: 43: Hoare triple {12798#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {12798#(<= ~counter~0 2)} is VALID [2022-04-28 11:27:30,668 INFO L290 TraceCheckUtils]: 44: Hoare triple {12798#(<= ~counter~0 2)} ~cond := #in~cond; {12798#(<= ~counter~0 2)} is VALID [2022-04-28 11:27:30,668 INFO L290 TraceCheckUtils]: 45: Hoare triple {12798#(<= ~counter~0 2)} assume !(0 == ~cond); {12798#(<= ~counter~0 2)} is VALID [2022-04-28 11:27:30,669 INFO L290 TraceCheckUtils]: 46: Hoare triple {12798#(<= ~counter~0 2)} assume true; {12798#(<= ~counter~0 2)} is VALID [2022-04-28 11:27:30,669 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {12798#(<= ~counter~0 2)} {12798#(<= ~counter~0 2)} #89#return; {12798#(<= ~counter~0 2)} is VALID [2022-04-28 11:27:30,669 INFO L290 TraceCheckUtils]: 48: Hoare triple {12798#(<= ~counter~0 2)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {12798#(<= ~counter~0 2)} is VALID [2022-04-28 11:27:30,670 INFO L290 TraceCheckUtils]: 49: Hoare triple {12798#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {12871#(<= ~counter~0 3)} is VALID [2022-04-28 11:27:30,670 INFO L290 TraceCheckUtils]: 50: Hoare triple {12871#(<= ~counter~0 3)} assume !!(#t~post7 < 5);havoc #t~post7; {12871#(<= ~counter~0 3)} is VALID [2022-04-28 11:27:30,670 INFO L272 TraceCheckUtils]: 51: Hoare triple {12871#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {12871#(<= ~counter~0 3)} is VALID [2022-04-28 11:27:30,671 INFO L290 TraceCheckUtils]: 52: Hoare triple {12871#(<= ~counter~0 3)} ~cond := #in~cond; {12871#(<= ~counter~0 3)} is VALID [2022-04-28 11:27:30,671 INFO L290 TraceCheckUtils]: 53: Hoare triple {12871#(<= ~counter~0 3)} assume !(0 == ~cond); {12871#(<= ~counter~0 3)} is VALID [2022-04-28 11:27:30,671 INFO L290 TraceCheckUtils]: 54: Hoare triple {12871#(<= ~counter~0 3)} assume true; {12871#(<= ~counter~0 3)} is VALID [2022-04-28 11:27:30,672 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {12871#(<= ~counter~0 3)} {12871#(<= ~counter~0 3)} #83#return; {12871#(<= ~counter~0 3)} is VALID [2022-04-28 11:27:30,672 INFO L272 TraceCheckUtils]: 56: Hoare triple {12871#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {12871#(<= ~counter~0 3)} is VALID [2022-04-28 11:27:30,672 INFO L290 TraceCheckUtils]: 57: Hoare triple {12871#(<= ~counter~0 3)} ~cond := #in~cond; {12871#(<= ~counter~0 3)} is VALID [2022-04-28 11:27:30,672 INFO L290 TraceCheckUtils]: 58: Hoare triple {12871#(<= ~counter~0 3)} assume !(0 == ~cond); {12871#(<= ~counter~0 3)} is VALID [2022-04-28 11:27:30,673 INFO L290 TraceCheckUtils]: 59: Hoare triple {12871#(<= ~counter~0 3)} assume true; {12871#(<= ~counter~0 3)} is VALID [2022-04-28 11:27:30,673 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {12871#(<= ~counter~0 3)} {12871#(<= ~counter~0 3)} #85#return; {12871#(<= ~counter~0 3)} is VALID [2022-04-28 11:27:30,673 INFO L272 TraceCheckUtils]: 61: Hoare triple {12871#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {12871#(<= ~counter~0 3)} is VALID [2022-04-28 11:27:30,674 INFO L290 TraceCheckUtils]: 62: Hoare triple {12871#(<= ~counter~0 3)} ~cond := #in~cond; {12871#(<= ~counter~0 3)} is VALID [2022-04-28 11:27:30,674 INFO L290 TraceCheckUtils]: 63: Hoare triple {12871#(<= ~counter~0 3)} assume !(0 == ~cond); {12871#(<= ~counter~0 3)} is VALID [2022-04-28 11:27:30,674 INFO L290 TraceCheckUtils]: 64: Hoare triple {12871#(<= ~counter~0 3)} assume true; {12871#(<= ~counter~0 3)} is VALID [2022-04-28 11:27:30,674 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {12871#(<= ~counter~0 3)} {12871#(<= ~counter~0 3)} #87#return; {12871#(<= ~counter~0 3)} is VALID [2022-04-28 11:27:30,675 INFO L290 TraceCheckUtils]: 66: Hoare triple {12871#(<= ~counter~0 3)} assume !(~r~0 >= 2 * ~b~0); {12871#(<= ~counter~0 3)} is VALID [2022-04-28 11:27:30,675 INFO L290 TraceCheckUtils]: 67: Hoare triple {12871#(<= ~counter~0 3)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {12871#(<= ~counter~0 3)} is VALID [2022-04-28 11:27:30,675 INFO L290 TraceCheckUtils]: 68: Hoare triple {12871#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12929#(<= ~counter~0 4)} is VALID [2022-04-28 11:27:30,676 INFO L290 TraceCheckUtils]: 69: Hoare triple {12929#(<= ~counter~0 4)} assume !!(#t~post6 < 5);havoc #t~post6; {12929#(<= ~counter~0 4)} is VALID [2022-04-28 11:27:30,676 INFO L272 TraceCheckUtils]: 70: Hoare triple {12929#(<= ~counter~0 4)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {12929#(<= ~counter~0 4)} is VALID [2022-04-28 11:27:30,676 INFO L290 TraceCheckUtils]: 71: Hoare triple {12929#(<= ~counter~0 4)} ~cond := #in~cond; {12929#(<= ~counter~0 4)} is VALID [2022-04-28 11:27:30,676 INFO L290 TraceCheckUtils]: 72: Hoare triple {12929#(<= ~counter~0 4)} assume !(0 == ~cond); {12929#(<= ~counter~0 4)} is VALID [2022-04-28 11:27:30,677 INFO L290 TraceCheckUtils]: 73: Hoare triple {12929#(<= ~counter~0 4)} assume true; {12929#(<= ~counter~0 4)} is VALID [2022-04-28 11:27:30,677 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {12929#(<= ~counter~0 4)} {12929#(<= ~counter~0 4)} #79#return; {12929#(<= ~counter~0 4)} is VALID [2022-04-28 11:27:30,678 INFO L272 TraceCheckUtils]: 75: Hoare triple {12929#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {12929#(<= ~counter~0 4)} is VALID [2022-04-28 11:27:30,678 INFO L290 TraceCheckUtils]: 76: Hoare triple {12929#(<= ~counter~0 4)} ~cond := #in~cond; {12929#(<= ~counter~0 4)} is VALID [2022-04-28 11:27:30,678 INFO L290 TraceCheckUtils]: 77: Hoare triple {12929#(<= ~counter~0 4)} assume !(0 == ~cond); {12929#(<= ~counter~0 4)} is VALID [2022-04-28 11:27:30,678 INFO L290 TraceCheckUtils]: 78: Hoare triple {12929#(<= ~counter~0 4)} assume true; {12929#(<= ~counter~0 4)} is VALID [2022-04-28 11:27:30,679 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {12929#(<= ~counter~0 4)} {12929#(<= ~counter~0 4)} #81#return; {12929#(<= ~counter~0 4)} is VALID [2022-04-28 11:27:30,679 INFO L290 TraceCheckUtils]: 80: Hoare triple {12929#(<= ~counter~0 4)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {12929#(<= ~counter~0 4)} is VALID [2022-04-28 11:27:30,679 INFO L290 TraceCheckUtils]: 81: Hoare triple {12929#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {12969#(<= |main_#t~post7| 4)} is VALID [2022-04-28 11:27:30,680 INFO L290 TraceCheckUtils]: 82: Hoare triple {12969#(<= |main_#t~post7| 4)} assume !(#t~post7 < 5);havoc #t~post7; {12717#false} is VALID [2022-04-28 11:27:30,680 INFO L290 TraceCheckUtils]: 83: Hoare triple {12717#false} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {12717#false} is VALID [2022-04-28 11:27:30,680 INFO L290 TraceCheckUtils]: 84: Hoare triple {12717#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12717#false} is VALID [2022-04-28 11:27:30,680 INFO L290 TraceCheckUtils]: 85: Hoare triple {12717#false} assume !(#t~post6 < 5);havoc #t~post6; {12717#false} is VALID [2022-04-28 11:27:30,680 INFO L272 TraceCheckUtils]: 86: Hoare triple {12717#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {12717#false} is VALID [2022-04-28 11:27:30,680 INFO L290 TraceCheckUtils]: 87: Hoare triple {12717#false} ~cond := #in~cond; {12717#false} is VALID [2022-04-28 11:27:30,680 INFO L290 TraceCheckUtils]: 88: Hoare triple {12717#false} assume 0 == ~cond; {12717#false} is VALID [2022-04-28 11:27:30,680 INFO L290 TraceCheckUtils]: 89: Hoare triple {12717#false} assume !false; {12717#false} is VALID [2022-04-28 11:27:30,680 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 27 proven. 191 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-28 11:27:30,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:27:30,962 INFO L290 TraceCheckUtils]: 89: Hoare triple {12717#false} assume !false; {12717#false} is VALID [2022-04-28 11:27:30,962 INFO L290 TraceCheckUtils]: 88: Hoare triple {12717#false} assume 0 == ~cond; {12717#false} is VALID [2022-04-28 11:27:30,962 INFO L290 TraceCheckUtils]: 87: Hoare triple {12717#false} ~cond := #in~cond; {12717#false} is VALID [2022-04-28 11:27:30,962 INFO L272 TraceCheckUtils]: 86: Hoare triple {12717#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {12717#false} is VALID [2022-04-28 11:27:30,962 INFO L290 TraceCheckUtils]: 85: Hoare triple {12717#false} assume !(#t~post6 < 5);havoc #t~post6; {12717#false} is VALID [2022-04-28 11:27:30,962 INFO L290 TraceCheckUtils]: 84: Hoare triple {12717#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12717#false} is VALID [2022-04-28 11:27:30,962 INFO L290 TraceCheckUtils]: 83: Hoare triple {12717#false} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {12717#false} is VALID [2022-04-28 11:27:30,963 INFO L290 TraceCheckUtils]: 82: Hoare triple {12969#(<= |main_#t~post7| 4)} assume !(#t~post7 < 5);havoc #t~post7; {12717#false} is VALID [2022-04-28 11:27:30,963 INFO L290 TraceCheckUtils]: 81: Hoare triple {12929#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {12969#(<= |main_#t~post7| 4)} is VALID [2022-04-28 11:27:30,963 INFO L290 TraceCheckUtils]: 80: Hoare triple {12929#(<= ~counter~0 4)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {12929#(<= ~counter~0 4)} is VALID [2022-04-28 11:27:30,964 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {12716#true} {12929#(<= ~counter~0 4)} #81#return; {12929#(<= ~counter~0 4)} is VALID [2022-04-28 11:27:30,964 INFO L290 TraceCheckUtils]: 78: Hoare triple {12716#true} assume true; {12716#true} is VALID [2022-04-28 11:27:30,964 INFO L290 TraceCheckUtils]: 77: Hoare triple {12716#true} assume !(0 == ~cond); {12716#true} is VALID [2022-04-28 11:27:30,964 INFO L290 TraceCheckUtils]: 76: Hoare triple {12716#true} ~cond := #in~cond; {12716#true} is VALID [2022-04-28 11:27:30,964 INFO L272 TraceCheckUtils]: 75: Hoare triple {12929#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {12716#true} is VALID [2022-04-28 11:27:30,965 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {12716#true} {12929#(<= ~counter~0 4)} #79#return; {12929#(<= ~counter~0 4)} is VALID [2022-04-28 11:27:30,965 INFO L290 TraceCheckUtils]: 73: Hoare triple {12716#true} assume true; {12716#true} is VALID [2022-04-28 11:27:30,965 INFO L290 TraceCheckUtils]: 72: Hoare triple {12716#true} assume !(0 == ~cond); {12716#true} is VALID [2022-04-28 11:27:30,965 INFO L290 TraceCheckUtils]: 71: Hoare triple {12716#true} ~cond := #in~cond; {12716#true} is VALID [2022-04-28 11:27:30,965 INFO L272 TraceCheckUtils]: 70: Hoare triple {12929#(<= ~counter~0 4)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {12716#true} is VALID [2022-04-28 11:27:30,965 INFO L290 TraceCheckUtils]: 69: Hoare triple {12929#(<= ~counter~0 4)} assume !!(#t~post6 < 5);havoc #t~post6; {12929#(<= ~counter~0 4)} is VALID [2022-04-28 11:27:30,966 INFO L290 TraceCheckUtils]: 68: Hoare triple {12871#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12929#(<= ~counter~0 4)} is VALID [2022-04-28 11:27:30,966 INFO L290 TraceCheckUtils]: 67: Hoare triple {12871#(<= ~counter~0 3)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {12871#(<= ~counter~0 3)} is VALID [2022-04-28 11:27:30,966 INFO L290 TraceCheckUtils]: 66: Hoare triple {12871#(<= ~counter~0 3)} assume !(~r~0 >= 2 * ~b~0); {12871#(<= ~counter~0 3)} is VALID [2022-04-28 11:27:30,966 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {12716#true} {12871#(<= ~counter~0 3)} #87#return; {12871#(<= ~counter~0 3)} is VALID [2022-04-28 11:27:30,966 INFO L290 TraceCheckUtils]: 64: Hoare triple {12716#true} assume true; {12716#true} is VALID [2022-04-28 11:27:30,966 INFO L290 TraceCheckUtils]: 63: Hoare triple {12716#true} assume !(0 == ~cond); {12716#true} is VALID [2022-04-28 11:27:30,967 INFO L290 TraceCheckUtils]: 62: Hoare triple {12716#true} ~cond := #in~cond; {12716#true} is VALID [2022-04-28 11:27:30,967 INFO L272 TraceCheckUtils]: 61: Hoare triple {12871#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {12716#true} is VALID [2022-04-28 11:27:30,967 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {12716#true} {12871#(<= ~counter~0 3)} #85#return; {12871#(<= ~counter~0 3)} is VALID [2022-04-28 11:27:30,967 INFO L290 TraceCheckUtils]: 59: Hoare triple {12716#true} assume true; {12716#true} is VALID [2022-04-28 11:27:30,967 INFO L290 TraceCheckUtils]: 58: Hoare triple {12716#true} assume !(0 == ~cond); {12716#true} is VALID [2022-04-28 11:27:30,967 INFO L290 TraceCheckUtils]: 57: Hoare triple {12716#true} ~cond := #in~cond; {12716#true} is VALID [2022-04-28 11:27:30,967 INFO L272 TraceCheckUtils]: 56: Hoare triple {12871#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {12716#true} is VALID [2022-04-28 11:27:30,968 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {12716#true} {12871#(<= ~counter~0 3)} #83#return; {12871#(<= ~counter~0 3)} is VALID [2022-04-28 11:27:30,968 INFO L290 TraceCheckUtils]: 54: Hoare triple {12716#true} assume true; {12716#true} is VALID [2022-04-28 11:27:30,968 INFO L290 TraceCheckUtils]: 53: Hoare triple {12716#true} assume !(0 == ~cond); {12716#true} is VALID [2022-04-28 11:27:30,968 INFO L290 TraceCheckUtils]: 52: Hoare triple {12716#true} ~cond := #in~cond; {12716#true} is VALID [2022-04-28 11:27:30,968 INFO L272 TraceCheckUtils]: 51: Hoare triple {12871#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {12716#true} is VALID [2022-04-28 11:27:30,968 INFO L290 TraceCheckUtils]: 50: Hoare triple {12871#(<= ~counter~0 3)} assume !!(#t~post7 < 5);havoc #t~post7; {12871#(<= ~counter~0 3)} is VALID [2022-04-28 11:27:30,969 INFO L290 TraceCheckUtils]: 49: Hoare triple {12798#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {12871#(<= ~counter~0 3)} is VALID [2022-04-28 11:27:30,969 INFO L290 TraceCheckUtils]: 48: Hoare triple {12798#(<= ~counter~0 2)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {12798#(<= ~counter~0 2)} is VALID [2022-04-28 11:27:30,969 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {12716#true} {12798#(<= ~counter~0 2)} #89#return; {12798#(<= ~counter~0 2)} is VALID [2022-04-28 11:27:30,969 INFO L290 TraceCheckUtils]: 46: Hoare triple {12716#true} assume true; {12716#true} is VALID [2022-04-28 11:27:30,969 INFO L290 TraceCheckUtils]: 45: Hoare triple {12716#true} assume !(0 == ~cond); {12716#true} is VALID [2022-04-28 11:27:30,969 INFO L290 TraceCheckUtils]: 44: Hoare triple {12716#true} ~cond := #in~cond; {12716#true} is VALID [2022-04-28 11:27:30,969 INFO L272 TraceCheckUtils]: 43: Hoare triple {12798#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {12716#true} is VALID [2022-04-28 11:27:30,970 INFO L290 TraceCheckUtils]: 42: Hoare triple {12798#(<= ~counter~0 2)} assume !!(~r~0 >= 2 * ~b~0); {12798#(<= ~counter~0 2)} is VALID [2022-04-28 11:27:30,970 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {12716#true} {12798#(<= ~counter~0 2)} #87#return; {12798#(<= ~counter~0 2)} is VALID [2022-04-28 11:27:30,970 INFO L290 TraceCheckUtils]: 40: Hoare triple {12716#true} assume true; {12716#true} is VALID [2022-04-28 11:27:30,970 INFO L290 TraceCheckUtils]: 39: Hoare triple {12716#true} assume !(0 == ~cond); {12716#true} is VALID [2022-04-28 11:27:30,970 INFO L290 TraceCheckUtils]: 38: Hoare triple {12716#true} ~cond := #in~cond; {12716#true} is VALID [2022-04-28 11:27:30,970 INFO L272 TraceCheckUtils]: 37: Hoare triple {12798#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {12716#true} is VALID [2022-04-28 11:27:30,971 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {12716#true} {12798#(<= ~counter~0 2)} #85#return; {12798#(<= ~counter~0 2)} is VALID [2022-04-28 11:27:30,971 INFO L290 TraceCheckUtils]: 35: Hoare triple {12716#true} assume true; {12716#true} is VALID [2022-04-28 11:27:30,971 INFO L290 TraceCheckUtils]: 34: Hoare triple {12716#true} assume !(0 == ~cond); {12716#true} is VALID [2022-04-28 11:27:30,971 INFO L290 TraceCheckUtils]: 33: Hoare triple {12716#true} ~cond := #in~cond; {12716#true} is VALID [2022-04-28 11:27:30,971 INFO L272 TraceCheckUtils]: 32: Hoare triple {12798#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {12716#true} is VALID [2022-04-28 11:27:30,971 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {12716#true} {12798#(<= ~counter~0 2)} #83#return; {12798#(<= ~counter~0 2)} is VALID [2022-04-28 11:27:30,971 INFO L290 TraceCheckUtils]: 30: Hoare triple {12716#true} assume true; {12716#true} is VALID [2022-04-28 11:27:30,971 INFO L290 TraceCheckUtils]: 29: Hoare triple {12716#true} assume !(0 == ~cond); {12716#true} is VALID [2022-04-28 11:27:30,971 INFO L290 TraceCheckUtils]: 28: Hoare triple {12716#true} ~cond := #in~cond; {12716#true} is VALID [2022-04-28 11:27:30,972 INFO L272 TraceCheckUtils]: 27: Hoare triple {12798#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {12716#true} is VALID [2022-04-28 11:27:30,972 INFO L290 TraceCheckUtils]: 26: Hoare triple {12798#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {12798#(<= ~counter~0 2)} is VALID [2022-04-28 11:27:30,972 INFO L290 TraceCheckUtils]: 25: Hoare triple {12758#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {12798#(<= ~counter~0 2)} is VALID [2022-04-28 11:27:30,972 INFO L290 TraceCheckUtils]: 24: Hoare triple {12758#(<= ~counter~0 1)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {12758#(<= ~counter~0 1)} is VALID [2022-04-28 11:27:30,973 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {12716#true} {12758#(<= ~counter~0 1)} #81#return; {12758#(<= ~counter~0 1)} is VALID [2022-04-28 11:27:30,973 INFO L290 TraceCheckUtils]: 22: Hoare triple {12716#true} assume true; {12716#true} is VALID [2022-04-28 11:27:30,973 INFO L290 TraceCheckUtils]: 21: Hoare triple {12716#true} assume !(0 == ~cond); {12716#true} is VALID [2022-04-28 11:27:30,973 INFO L290 TraceCheckUtils]: 20: Hoare triple {12716#true} ~cond := #in~cond; {12716#true} is VALID [2022-04-28 11:27:30,973 INFO L272 TraceCheckUtils]: 19: Hoare triple {12758#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {12716#true} is VALID [2022-04-28 11:27:30,974 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12716#true} {12758#(<= ~counter~0 1)} #79#return; {12758#(<= ~counter~0 1)} is VALID [2022-04-28 11:27:30,974 INFO L290 TraceCheckUtils]: 17: Hoare triple {12716#true} assume true; {12716#true} is VALID [2022-04-28 11:27:30,974 INFO L290 TraceCheckUtils]: 16: Hoare triple {12716#true} assume !(0 == ~cond); {12716#true} is VALID [2022-04-28 11:27:30,974 INFO L290 TraceCheckUtils]: 15: Hoare triple {12716#true} ~cond := #in~cond; {12716#true} is VALID [2022-04-28 11:27:30,974 INFO L272 TraceCheckUtils]: 14: Hoare triple {12758#(<= ~counter~0 1)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {12716#true} is VALID [2022-04-28 11:27:30,974 INFO L290 TraceCheckUtils]: 13: Hoare triple {12758#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {12758#(<= ~counter~0 1)} is VALID [2022-04-28 11:27:30,974 INFO L290 TraceCheckUtils]: 12: Hoare triple {12724#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12758#(<= ~counter~0 1)} is VALID [2022-04-28 11:27:30,975 INFO L290 TraceCheckUtils]: 11: Hoare triple {12724#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {12724#(<= ~counter~0 0)} is VALID [2022-04-28 11:27:30,975 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12716#true} {12724#(<= ~counter~0 0)} #77#return; {12724#(<= ~counter~0 0)} is VALID [2022-04-28 11:27:30,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {12716#true} assume true; {12716#true} is VALID [2022-04-28 11:27:30,975 INFO L290 TraceCheckUtils]: 8: Hoare triple {12716#true} assume !(0 == ~cond); {12716#true} is VALID [2022-04-28 11:27:30,975 INFO L290 TraceCheckUtils]: 7: Hoare triple {12716#true} ~cond := #in~cond; {12716#true} is VALID [2022-04-28 11:27:30,975 INFO L272 TraceCheckUtils]: 6: Hoare triple {12724#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {12716#true} is VALID [2022-04-28 11:27:30,975 INFO L290 TraceCheckUtils]: 5: Hoare triple {12724#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {12724#(<= ~counter~0 0)} is VALID [2022-04-28 11:27:30,976 INFO L272 TraceCheckUtils]: 4: Hoare triple {12724#(<= ~counter~0 0)} call #t~ret8 := main(); {12724#(<= ~counter~0 0)} is VALID [2022-04-28 11:27:30,976 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12724#(<= ~counter~0 0)} {12716#true} #93#return; {12724#(<= ~counter~0 0)} is VALID [2022-04-28 11:27:30,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {12724#(<= ~counter~0 0)} assume true; {12724#(<= ~counter~0 0)} is VALID [2022-04-28 11:27:30,977 INFO L290 TraceCheckUtils]: 1: Hoare triple {12716#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {12724#(<= ~counter~0 0)} is VALID [2022-04-28 11:27:30,977 INFO L272 TraceCheckUtils]: 0: Hoare triple {12716#true} call ULTIMATE.init(); {12716#true} is VALID [2022-04-28 11:27:30,977 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 27 proven. 15 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-28 11:27:30,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:27:30,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110420081] [2022-04-28 11:27:30,977 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:27:30,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190157061] [2022-04-28 11:27:30,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190157061] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:27:30,977 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:27:30,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-04-28 11:27:30,977 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:27:30,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1465146092] [2022-04-28 11:27:30,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1465146092] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:27:30,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:27:30,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 11:27:30,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259853672] [2022-04-28 11:27:30,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:27:30,978 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 7 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) Word has length 90 [2022-04-28 11:27:30,978 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:27:30,978 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 7 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-28 11:27:31,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:27:31,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 11:27:31,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:27:31,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 11:27:31,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-28 11:27:31,044 INFO L87 Difference]: Start difference. First operand 168 states and 206 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 7 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-28 11:27:31,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:27:31,535 INFO L93 Difference]: Finished difference Result 269 states and 336 transitions. [2022-04-28 11:27:31,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 11:27:31,536 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 7 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) Word has length 90 [2022-04-28 11:27:31,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:27:31,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 7 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-28 11:27:31,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 143 transitions. [2022-04-28 11:27:31,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 7 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-28 11:27:31,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 143 transitions. [2022-04-28 11:27:31,538 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 143 transitions. [2022-04-28 11:27:31,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:27:31,640 INFO L225 Difference]: With dead ends: 269 [2022-04-28 11:27:31,640 INFO L226 Difference]: Without dead ends: 196 [2022-04-28 11:27:31,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 172 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-04-28 11:27:31,640 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 46 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:27:31,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 169 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:27:31,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-04-28 11:27:31,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2022-04-28 11:27:31,897 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:27:31,898 INFO L82 GeneralOperation]: Start isEquivalent. First operand 196 states. Second operand has 196 states, 127 states have (on average 1.1338582677165354) internal successors, (144), 129 states have internal predecessors, (144), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-28 11:27:31,898 INFO L74 IsIncluded]: Start isIncluded. First operand 196 states. Second operand has 196 states, 127 states have (on average 1.1338582677165354) internal successors, (144), 129 states have internal predecessors, (144), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-28 11:27:31,898 INFO L87 Difference]: Start difference. First operand 196 states. Second operand has 196 states, 127 states have (on average 1.1338582677165354) internal successors, (144), 129 states have internal predecessors, (144), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-28 11:27:31,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:27:31,902 INFO L93 Difference]: Finished difference Result 196 states and 232 transitions. [2022-04-28 11:27:31,902 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 232 transitions. [2022-04-28 11:27:31,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:27:31,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:27:31,902 INFO L74 IsIncluded]: Start isIncluded. First operand has 196 states, 127 states have (on average 1.1338582677165354) internal successors, (144), 129 states have internal predecessors, (144), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) Second operand 196 states. [2022-04-28 11:27:31,903 INFO L87 Difference]: Start difference. First operand has 196 states, 127 states have (on average 1.1338582677165354) internal successors, (144), 129 states have internal predecessors, (144), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) Second operand 196 states. [2022-04-28 11:27:31,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:27:31,906 INFO L93 Difference]: Finished difference Result 196 states and 232 transitions. [2022-04-28 11:27:31,906 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 232 transitions. [2022-04-28 11:27:31,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:27:31,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:27:31,906 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:27:31,907 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:27:31,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 127 states have (on average 1.1338582677165354) internal successors, (144), 129 states have internal predecessors, (144), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-28 11:27:31,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 232 transitions. [2022-04-28 11:27:31,910 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 232 transitions. Word has length 90 [2022-04-28 11:27:31,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:27:31,910 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 232 transitions. [2022-04-28 11:27:31,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 7 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-28 11:27:31,910 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 196 states and 232 transitions. [2022-04-28 11:27:32,189 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 232 edges. 232 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:27:32,190 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 232 transitions. [2022-04-28 11:27:32,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-04-28 11:27:32,194 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:27:32,194 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 3, 3, 3, 3, 3, 3, 3, 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] [2022-04-28 11:27:32,215 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 11:27:32,407 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 11:27:32,407 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:27:32,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:27:32,408 INFO L85 PathProgramCache]: Analyzing trace with hash 447330249, now seen corresponding path program 3 times [2022-04-28 11:27:32,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:27:32,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1568532588] [2022-04-28 11:28:02,792 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:28:02,792 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:28:02,792 INFO L85 PathProgramCache]: Analyzing trace with hash 447330249, now seen corresponding path program 4 times [2022-04-28 11:28:02,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:28:02,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022178488] [2022-04-28 11:28:02,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:28:02,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:28:02,803 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:28:02,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [158708742] [2022-04-28 11:28:02,803 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:28:02,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:28:02,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:28:02,804 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 11:28:02,804 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 11:28:02,858 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:28:02,858 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:28:02,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 11:28:02,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:28:02,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:28:04,530 INFO L272 TraceCheckUtils]: 0: Hoare triple {14591#true} call ULTIMATE.init(); {14591#true} is VALID [2022-04-28 11:28:04,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {14591#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {14591#true} is VALID [2022-04-28 11:28:04,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {14591#true} assume true; {14591#true} is VALID [2022-04-28 11:28:04,530 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14591#true} {14591#true} #93#return; {14591#true} is VALID [2022-04-28 11:28:04,530 INFO L272 TraceCheckUtils]: 4: Hoare triple {14591#true} call #t~ret8 := main(); {14591#true} is VALID [2022-04-28 11:28:04,530 INFO L290 TraceCheckUtils]: 5: Hoare triple {14591#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {14591#true} is VALID [2022-04-28 11:28:04,531 INFO L272 TraceCheckUtils]: 6: Hoare triple {14591#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {14591#true} is VALID [2022-04-28 11:28:04,531 INFO L290 TraceCheckUtils]: 7: Hoare triple {14591#true} ~cond := #in~cond; {14591#true} is VALID [2022-04-28 11:28:04,531 INFO L290 TraceCheckUtils]: 8: Hoare triple {14591#true} assume !(0 == ~cond); {14591#true} is VALID [2022-04-28 11:28:04,531 INFO L290 TraceCheckUtils]: 9: Hoare triple {14591#true} assume true; {14591#true} is VALID [2022-04-28 11:28:04,531 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14591#true} {14591#true} #77#return; {14591#true} is VALID [2022-04-28 11:28:04,531 INFO L290 TraceCheckUtils]: 11: Hoare triple {14591#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {14629#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:28:04,531 INFO L290 TraceCheckUtils]: 12: Hoare triple {14629#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14629#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:28:04,532 INFO L290 TraceCheckUtils]: 13: Hoare triple {14629#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 5);havoc #t~post6; {14629#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:28:04,532 INFO L272 TraceCheckUtils]: 14: Hoare triple {14629#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {14591#true} is VALID [2022-04-28 11:28:04,532 INFO L290 TraceCheckUtils]: 15: Hoare triple {14591#true} ~cond := #in~cond; {14591#true} is VALID [2022-04-28 11:28:04,532 INFO L290 TraceCheckUtils]: 16: Hoare triple {14591#true} assume !(0 == ~cond); {14591#true} is VALID [2022-04-28 11:28:04,532 INFO L290 TraceCheckUtils]: 17: Hoare triple {14591#true} assume true; {14591#true} is VALID [2022-04-28 11:28:04,532 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {14591#true} {14629#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #79#return; {14629#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:28:04,533 INFO L272 TraceCheckUtils]: 19: Hoare triple {14629#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {14591#true} is VALID [2022-04-28 11:28:04,533 INFO L290 TraceCheckUtils]: 20: Hoare triple {14591#true} ~cond := #in~cond; {14591#true} is VALID [2022-04-28 11:28:04,533 INFO L290 TraceCheckUtils]: 21: Hoare triple {14591#true} assume !(0 == ~cond); {14591#true} is VALID [2022-04-28 11:28:04,533 INFO L290 TraceCheckUtils]: 22: Hoare triple {14591#true} assume true; {14591#true} is VALID [2022-04-28 11:28:04,533 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {14591#true} {14629#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #81#return; {14629#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:28:04,533 INFO L290 TraceCheckUtils]: 24: Hoare triple {14629#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {14669#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:28:04,534 INFO L290 TraceCheckUtils]: 25: Hoare triple {14669#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14669#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:28:04,534 INFO L290 TraceCheckUtils]: 26: Hoare triple {14669#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(#t~post7 < 5);havoc #t~post7; {14669#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:28:04,534 INFO L272 TraceCheckUtils]: 27: Hoare triple {14669#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {14591#true} is VALID [2022-04-28 11:28:04,534 INFO L290 TraceCheckUtils]: 28: Hoare triple {14591#true} ~cond := #in~cond; {14591#true} is VALID [2022-04-28 11:28:04,534 INFO L290 TraceCheckUtils]: 29: Hoare triple {14591#true} assume !(0 == ~cond); {14591#true} is VALID [2022-04-28 11:28:04,534 INFO L290 TraceCheckUtils]: 30: Hoare triple {14591#true} assume true; {14591#true} is VALID [2022-04-28 11:28:04,535 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {14591#true} {14669#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #83#return; {14669#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:28:04,535 INFO L272 TraceCheckUtils]: 32: Hoare triple {14669#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {14591#true} is VALID [2022-04-28 11:28:04,535 INFO L290 TraceCheckUtils]: 33: Hoare triple {14591#true} ~cond := #in~cond; {14591#true} is VALID [2022-04-28 11:28:04,535 INFO L290 TraceCheckUtils]: 34: Hoare triple {14591#true} assume !(0 == ~cond); {14591#true} is VALID [2022-04-28 11:28:04,535 INFO L290 TraceCheckUtils]: 35: Hoare triple {14591#true} assume true; {14591#true} is VALID [2022-04-28 11:28:04,536 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {14591#true} {14669#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #85#return; {14669#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:28:04,536 INFO L272 TraceCheckUtils]: 37: Hoare triple {14669#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {14591#true} is VALID [2022-04-28 11:28:04,536 INFO L290 TraceCheckUtils]: 38: Hoare triple {14591#true} ~cond := #in~cond; {14591#true} is VALID [2022-04-28 11:28:04,536 INFO L290 TraceCheckUtils]: 39: Hoare triple {14591#true} assume !(0 == ~cond); {14591#true} is VALID [2022-04-28 11:28:04,536 INFO L290 TraceCheckUtils]: 40: Hoare triple {14591#true} assume true; {14591#true} is VALID [2022-04-28 11:28:04,536 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {14591#true} {14669#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #87#return; {14669#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:28:04,537 INFO L290 TraceCheckUtils]: 42: Hoare triple {14669#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(~r~0 >= 2 * ~b~0); {14669#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:28:04,537 INFO L272 TraceCheckUtils]: 43: Hoare triple {14669#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {14591#true} is VALID [2022-04-28 11:28:04,537 INFO L290 TraceCheckUtils]: 44: Hoare triple {14591#true} ~cond := #in~cond; {14591#true} is VALID [2022-04-28 11:28:04,537 INFO L290 TraceCheckUtils]: 45: Hoare triple {14591#true} assume !(0 == ~cond); {14591#true} is VALID [2022-04-28 11:28:04,537 INFO L290 TraceCheckUtils]: 46: Hoare triple {14591#true} assume true; {14591#true} is VALID [2022-04-28 11:28:04,537 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {14591#true} {14669#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #89#return; {14669#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:28:04,538 INFO L290 TraceCheckUtils]: 48: Hoare triple {14669#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {14742#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div main_~a~0 2) 1) (= main_~q~0 0))} is VALID [2022-04-28 11:28:04,539 INFO L290 TraceCheckUtils]: 49: Hoare triple {14742#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div main_~a~0 2) 1) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14742#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div main_~a~0 2) 1) (= main_~q~0 0))} is VALID [2022-04-28 11:28:04,539 INFO L290 TraceCheckUtils]: 50: Hoare triple {14742#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div main_~a~0 2) 1) (= main_~q~0 0))} assume !!(#t~post7 < 5);havoc #t~post7; {14742#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div main_~a~0 2) 1) (= main_~q~0 0))} is VALID [2022-04-28 11:28:04,539 INFO L272 TraceCheckUtils]: 51: Hoare triple {14742#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div main_~a~0 2) 1) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {14591#true} is VALID [2022-04-28 11:28:04,539 INFO L290 TraceCheckUtils]: 52: Hoare triple {14591#true} ~cond := #in~cond; {14591#true} is VALID [2022-04-28 11:28:04,539 INFO L290 TraceCheckUtils]: 53: Hoare triple {14591#true} assume !(0 == ~cond); {14591#true} is VALID [2022-04-28 11:28:04,539 INFO L290 TraceCheckUtils]: 54: Hoare triple {14591#true} assume true; {14591#true} is VALID [2022-04-28 11:28:04,540 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {14591#true} {14742#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div main_~a~0 2) 1) (= main_~q~0 0))} #83#return; {14742#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div main_~a~0 2) 1) (= main_~q~0 0))} is VALID [2022-04-28 11:28:04,540 INFO L272 TraceCheckUtils]: 56: Hoare triple {14742#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div main_~a~0 2) 1) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {14591#true} is VALID [2022-04-28 11:28:04,540 INFO L290 TraceCheckUtils]: 57: Hoare triple {14591#true} ~cond := #in~cond; {14591#true} is VALID [2022-04-28 11:28:04,540 INFO L290 TraceCheckUtils]: 58: Hoare triple {14591#true} assume !(0 == ~cond); {14591#true} is VALID [2022-04-28 11:28:04,540 INFO L290 TraceCheckUtils]: 59: Hoare triple {14591#true} assume true; {14591#true} is VALID [2022-04-28 11:28:04,541 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {14591#true} {14742#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div main_~a~0 2) 1) (= main_~q~0 0))} #85#return; {14742#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div main_~a~0 2) 1) (= main_~q~0 0))} is VALID [2022-04-28 11:28:04,541 INFO L272 TraceCheckUtils]: 61: Hoare triple {14742#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div main_~a~0 2) 1) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {14591#true} is VALID [2022-04-28 11:28:04,541 INFO L290 TraceCheckUtils]: 62: Hoare triple {14591#true} ~cond := #in~cond; {14591#true} is VALID [2022-04-28 11:28:04,541 INFO L290 TraceCheckUtils]: 63: Hoare triple {14591#true} assume !(0 == ~cond); {14591#true} is VALID [2022-04-28 11:28:04,541 INFO L290 TraceCheckUtils]: 64: Hoare triple {14591#true} assume true; {14591#true} is VALID [2022-04-28 11:28:04,541 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {14591#true} {14742#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div main_~a~0 2) 1) (= main_~q~0 0))} #87#return; {14742#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div main_~a~0 2) 1) (= main_~q~0 0))} is VALID [2022-04-28 11:28:04,542 INFO L290 TraceCheckUtils]: 66: Hoare triple {14742#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div main_~a~0 2) 1) (= main_~q~0 0))} assume !(~r~0 >= 2 * ~b~0); {14797#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (not (<= (* main_~b~0 2) main_~r~0)) (<= (div main_~a~0 2) 1) (= main_~q~0 0))} is VALID [2022-04-28 11:28:04,543 INFO L290 TraceCheckUtils]: 67: Hoare triple {14797#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (not (<= (* main_~b~0 2) main_~r~0)) (<= (div main_~a~0 2) 1) (= main_~q~0 0))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {14801#(and (not (<= (* main_~y~0 4) main_~x~0)) (<= (div main_~q~0 2) 1) (= (mod main_~q~0 2) 0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} is VALID [2022-04-28 11:28:04,543 INFO L290 TraceCheckUtils]: 68: Hoare triple {14801#(and (not (<= (* main_~y~0 4) main_~x~0)) (<= (div main_~q~0 2) 1) (= (mod main_~q~0 2) 0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14801#(and (not (<= (* main_~y~0 4) main_~x~0)) (<= (div main_~q~0 2) 1) (= (mod main_~q~0 2) 0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} is VALID [2022-04-28 11:28:04,544 INFO L290 TraceCheckUtils]: 69: Hoare triple {14801#(and (not (<= (* main_~y~0 4) main_~x~0)) (<= (div main_~q~0 2) 1) (= (mod main_~q~0 2) 0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} assume !!(#t~post6 < 5);havoc #t~post6; {14801#(and (not (<= (* main_~y~0 4) main_~x~0)) (<= (div main_~q~0 2) 1) (= (mod main_~q~0 2) 0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} is VALID [2022-04-28 11:28:04,544 INFO L272 TraceCheckUtils]: 70: Hoare triple {14801#(and (not (<= (* main_~y~0 4) main_~x~0)) (<= (div main_~q~0 2) 1) (= (mod main_~q~0 2) 0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {14591#true} is VALID [2022-04-28 11:28:04,544 INFO L290 TraceCheckUtils]: 71: Hoare triple {14591#true} ~cond := #in~cond; {14591#true} is VALID [2022-04-28 11:28:04,544 INFO L290 TraceCheckUtils]: 72: Hoare triple {14591#true} assume !(0 == ~cond); {14591#true} is VALID [2022-04-28 11:28:04,544 INFO L290 TraceCheckUtils]: 73: Hoare triple {14591#true} assume true; {14591#true} is VALID [2022-04-28 11:28:04,544 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {14591#true} {14801#(and (not (<= (* main_~y~0 4) main_~x~0)) (<= (div main_~q~0 2) 1) (= (mod main_~q~0 2) 0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} #79#return; {14801#(and (not (<= (* main_~y~0 4) main_~x~0)) (<= (div main_~q~0 2) 1) (= (mod main_~q~0 2) 0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} is VALID [2022-04-28 11:28:04,545 INFO L272 TraceCheckUtils]: 75: Hoare triple {14801#(and (not (<= (* main_~y~0 4) main_~x~0)) (<= (div main_~q~0 2) 1) (= (mod main_~q~0 2) 0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {14591#true} is VALID [2022-04-28 11:28:04,545 INFO L290 TraceCheckUtils]: 76: Hoare triple {14591#true} ~cond := #in~cond; {14591#true} is VALID [2022-04-28 11:28:04,545 INFO L290 TraceCheckUtils]: 77: Hoare triple {14591#true} assume !(0 == ~cond); {14591#true} is VALID [2022-04-28 11:28:04,545 INFO L290 TraceCheckUtils]: 78: Hoare triple {14591#true} assume true; {14591#true} is VALID [2022-04-28 11:28:04,545 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {14591#true} {14801#(and (not (<= (* main_~y~0 4) main_~x~0)) (<= (div main_~q~0 2) 1) (= (mod main_~q~0 2) 0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} #81#return; {14801#(and (not (<= (* main_~y~0 4) main_~x~0)) (<= (div main_~q~0 2) 1) (= (mod main_~q~0 2) 0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} is VALID [2022-04-28 11:28:04,546 INFO L290 TraceCheckUtils]: 80: Hoare triple {14801#(and (not (<= (* main_~y~0 4) main_~x~0)) (<= (div main_~q~0 2) 1) (= (mod main_~q~0 2) 0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {14841#(and (= main_~a~0 1) (not (<= (* main_~y~0 4) main_~x~0)) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (<= (div main_~q~0 2) 1) (= (mod main_~q~0 2) 0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} is VALID [2022-04-28 11:28:04,546 INFO L290 TraceCheckUtils]: 81: Hoare triple {14841#(and (= main_~a~0 1) (not (<= (* main_~y~0 4) main_~x~0)) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (<= (div main_~q~0 2) 1) (= (mod main_~q~0 2) 0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14841#(and (= main_~a~0 1) (not (<= (* main_~y~0 4) main_~x~0)) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (<= (div main_~q~0 2) 1) (= (mod main_~q~0 2) 0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} is VALID [2022-04-28 11:28:04,546 INFO L290 TraceCheckUtils]: 82: Hoare triple {14841#(and (= main_~a~0 1) (not (<= (* main_~y~0 4) main_~x~0)) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (<= (div main_~q~0 2) 1) (= (mod main_~q~0 2) 0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} assume !!(#t~post7 < 5);havoc #t~post7; {14841#(and (= main_~a~0 1) (not (<= (* main_~y~0 4) main_~x~0)) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (<= (div main_~q~0 2) 1) (= (mod main_~q~0 2) 0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} is VALID [2022-04-28 11:28:04,547 INFO L272 TraceCheckUtils]: 83: Hoare triple {14841#(and (= main_~a~0 1) (not (<= (* main_~y~0 4) main_~x~0)) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (<= (div main_~q~0 2) 1) (= (mod main_~q~0 2) 0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {14591#true} is VALID [2022-04-28 11:28:04,547 INFO L290 TraceCheckUtils]: 84: Hoare triple {14591#true} ~cond := #in~cond; {14591#true} is VALID [2022-04-28 11:28:04,547 INFO L290 TraceCheckUtils]: 85: Hoare triple {14591#true} assume !(0 == ~cond); {14591#true} is VALID [2022-04-28 11:28:04,547 INFO L290 TraceCheckUtils]: 86: Hoare triple {14591#true} assume true; {14591#true} is VALID [2022-04-28 11:28:04,547 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {14591#true} {14841#(and (= main_~a~0 1) (not (<= (* main_~y~0 4) main_~x~0)) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (<= (div main_~q~0 2) 1) (= (mod main_~q~0 2) 0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} #83#return; {14841#(and (= main_~a~0 1) (not (<= (* main_~y~0 4) main_~x~0)) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (<= (div main_~q~0 2) 1) (= (mod main_~q~0 2) 0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} is VALID [2022-04-28 11:28:04,547 INFO L272 TraceCheckUtils]: 88: Hoare triple {14841#(and (= main_~a~0 1) (not (<= (* main_~y~0 4) main_~x~0)) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (<= (div main_~q~0 2) 1) (= (mod main_~q~0 2) 0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {14591#true} is VALID [2022-04-28 11:28:04,548 INFO L290 TraceCheckUtils]: 89: Hoare triple {14591#true} ~cond := #in~cond; {14869#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:28:04,548 INFO L290 TraceCheckUtils]: 90: Hoare triple {14869#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {14873#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:28:04,548 INFO L290 TraceCheckUtils]: 91: Hoare triple {14873#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {14873#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:28:04,549 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {14873#(not (= |__VERIFIER_assert_#in~cond| 0))} {14841#(and (= main_~a~0 1) (not (<= (* main_~y~0 4) main_~x~0)) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (<= (div main_~q~0 2) 1) (= (mod main_~q~0 2) 0) (= main_~r~0 (+ main_~x~0 (* (- 2) main_~y~0))))} #85#return; {14880#(and (= main_~a~0 1) (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))) (< main_~x~0 (* main_~y~0 4)))} is VALID [2022-04-28 11:28:04,556 INFO L272 TraceCheckUtils]: 93: Hoare triple {14880#(and (= main_~a~0 1) (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))) (< main_~x~0 (* main_~y~0 4)))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {14591#true} is VALID [2022-04-28 11:28:04,556 INFO L290 TraceCheckUtils]: 94: Hoare triple {14591#true} ~cond := #in~cond; {14591#true} is VALID [2022-04-28 11:28:04,556 INFO L290 TraceCheckUtils]: 95: Hoare triple {14591#true} assume !(0 == ~cond); {14591#true} is VALID [2022-04-28 11:28:04,556 INFO L290 TraceCheckUtils]: 96: Hoare triple {14591#true} assume true; {14591#true} is VALID [2022-04-28 11:28:04,557 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {14591#true} {14880#(and (= main_~a~0 1) (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))) (< main_~x~0 (* main_~y~0 4)))} #87#return; {14880#(and (= main_~a~0 1) (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))) (< main_~x~0 (* main_~y~0 4)))} is VALID [2022-04-28 11:28:04,557 INFO L290 TraceCheckUtils]: 98: Hoare triple {14880#(and (= main_~a~0 1) (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))) (< main_~x~0 (* main_~y~0 4)))} assume !(~r~0 >= 2 * ~b~0); {14880#(and (= main_~a~0 1) (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))) (< main_~x~0 (* main_~y~0 4)))} is VALID [2022-04-28 11:28:04,559 INFO L290 TraceCheckUtils]: 99: Hoare triple {14880#(and (= main_~a~0 1) (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))) (< main_~x~0 (* main_~y~0 4)))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {14902#(and (<= 0 main_~r~0) (= (+ (* main_~y~0 (+ (- 1) main_~q~0)) main_~y~0 main_~r~0) main_~x~0) (< main_~x~0 (* main_~y~0 4)) (= (+ main_~r~0 (* main_~y~0 3)) main_~x~0))} is VALID [2022-04-28 11:28:04,560 INFO L290 TraceCheckUtils]: 100: Hoare triple {14902#(and (<= 0 main_~r~0) (= (+ (* main_~y~0 (+ (- 1) main_~q~0)) main_~y~0 main_~r~0) main_~x~0) (< main_~x~0 (* main_~y~0 4)) (= (+ main_~r~0 (* main_~y~0 3)) main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14902#(and (<= 0 main_~r~0) (= (+ (* main_~y~0 (+ (- 1) main_~q~0)) main_~y~0 main_~r~0) main_~x~0) (< main_~x~0 (* main_~y~0 4)) (= (+ main_~r~0 (* main_~y~0 3)) main_~x~0))} is VALID [2022-04-28 11:28:04,560 INFO L290 TraceCheckUtils]: 101: Hoare triple {14902#(and (<= 0 main_~r~0) (= (+ (* main_~y~0 (+ (- 1) main_~q~0)) main_~y~0 main_~r~0) main_~x~0) (< main_~x~0 (* main_~y~0 4)) (= (+ main_~r~0 (* main_~y~0 3)) main_~x~0))} assume !(#t~post6 < 5);havoc #t~post6; {14902#(and (<= 0 main_~r~0) (= (+ (* main_~y~0 (+ (- 1) main_~q~0)) main_~y~0 main_~r~0) main_~x~0) (< main_~x~0 (* main_~y~0 4)) (= (+ main_~r~0 (* main_~y~0 3)) main_~x~0))} is VALID [2022-04-28 11:28:04,561 INFO L272 TraceCheckUtils]: 102: Hoare triple {14902#(and (<= 0 main_~r~0) (= (+ (* main_~y~0 (+ (- 1) main_~q~0)) main_~y~0 main_~r~0) main_~x~0) (< main_~x~0 (* main_~y~0 4)) (= (+ main_~r~0 (* main_~y~0 3)) main_~x~0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {14912#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:28:04,561 INFO L290 TraceCheckUtils]: 103: Hoare triple {14912#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14916#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:28:04,561 INFO L290 TraceCheckUtils]: 104: Hoare triple {14916#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14592#false} is VALID [2022-04-28 11:28:04,561 INFO L290 TraceCheckUtils]: 105: Hoare triple {14592#false} assume !false; {14592#false} is VALID [2022-04-28 11:28:04,562 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 63 proven. 32 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-04-28 11:28:04,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:28:11,657 INFO L290 TraceCheckUtils]: 105: Hoare triple {14592#false} assume !false; {14592#false} is VALID [2022-04-28 11:28:11,657 INFO L290 TraceCheckUtils]: 104: Hoare triple {14916#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14592#false} is VALID [2022-04-28 11:28:11,657 INFO L290 TraceCheckUtils]: 103: Hoare triple {14912#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14916#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:28:11,658 INFO L272 TraceCheckUtils]: 102: Hoare triple {14932#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {14912#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:28:11,658 INFO L290 TraceCheckUtils]: 101: Hoare triple {14932#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !(#t~post6 < 5);havoc #t~post6; {14932#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:28:11,658 INFO L290 TraceCheckUtils]: 100: Hoare triple {14932#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14932#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:28:11,665 INFO L290 TraceCheckUtils]: 99: Hoare triple {14942#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {14932#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:28:11,666 INFO L290 TraceCheckUtils]: 98: Hoare triple {14942#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} assume !(~r~0 >= 2 * ~b~0); {14942#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:28:11,666 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {14591#true} {14942#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} #87#return; {14942#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:28:11,666 INFO L290 TraceCheckUtils]: 96: Hoare triple {14591#true} assume true; {14591#true} is VALID [2022-04-28 11:28:11,666 INFO L290 TraceCheckUtils]: 95: Hoare triple {14591#true} assume !(0 == ~cond); {14591#true} is VALID [2022-04-28 11:28:11,666 INFO L290 TraceCheckUtils]: 94: Hoare triple {14591#true} ~cond := #in~cond; {14591#true} is VALID [2022-04-28 11:28:11,666 INFO L272 TraceCheckUtils]: 93: Hoare triple {14942#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {14591#true} is VALID [2022-04-28 11:28:11,667 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {14873#(not (= |__VERIFIER_assert_#in~cond| 0))} {14964#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (not (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)))} #85#return; {14942#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:28:11,667 INFO L290 TraceCheckUtils]: 91: Hoare triple {14873#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {14873#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:28:11,668 INFO L290 TraceCheckUtils]: 90: Hoare triple {14974#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {14873#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:28:11,668 INFO L290 TraceCheckUtils]: 89: Hoare triple {14591#true} ~cond := #in~cond; {14974#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:28:11,668 INFO L272 TraceCheckUtils]: 88: Hoare triple {14964#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (not (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {14591#true} is VALID [2022-04-28 11:28:11,669 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {14591#true} {14964#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (not (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)))} #83#return; {14964#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (not (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)))} is VALID [2022-04-28 11:28:11,669 INFO L290 TraceCheckUtils]: 86: Hoare triple {14591#true} assume true; {14591#true} is VALID [2022-04-28 11:28:11,669 INFO L290 TraceCheckUtils]: 85: Hoare triple {14591#true} assume !(0 == ~cond); {14591#true} is VALID [2022-04-28 11:28:11,669 INFO L290 TraceCheckUtils]: 84: Hoare triple {14591#true} ~cond := #in~cond; {14591#true} is VALID [2022-04-28 11:28:11,669 INFO L272 TraceCheckUtils]: 83: Hoare triple {14964#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (not (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {14591#true} is VALID [2022-04-28 11:28:11,669 INFO L290 TraceCheckUtils]: 82: Hoare triple {14964#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (not (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)))} assume !!(#t~post7 < 5);havoc #t~post7; {14964#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (not (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)))} is VALID [2022-04-28 11:28:11,669 INFO L290 TraceCheckUtils]: 81: Hoare triple {14964#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (not (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14964#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (not (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)))} is VALID [2022-04-28 11:28:11,670 INFO L290 TraceCheckUtils]: 80: Hoare triple {14591#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {14964#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (not (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)))} is VALID [2022-04-28 11:28:11,670 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {14591#true} {14591#true} #81#return; {14591#true} is VALID [2022-04-28 11:28:11,670 INFO L290 TraceCheckUtils]: 78: Hoare triple {14591#true} assume true; {14591#true} is VALID [2022-04-28 11:28:11,670 INFO L290 TraceCheckUtils]: 77: Hoare triple {14591#true} assume !(0 == ~cond); {14591#true} is VALID [2022-04-28 11:28:11,670 INFO L290 TraceCheckUtils]: 76: Hoare triple {14591#true} ~cond := #in~cond; {14591#true} is VALID [2022-04-28 11:28:11,670 INFO L272 TraceCheckUtils]: 75: Hoare triple {14591#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {14591#true} is VALID [2022-04-28 11:28:11,670 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {14591#true} {14591#true} #79#return; {14591#true} is VALID [2022-04-28 11:28:11,670 INFO L290 TraceCheckUtils]: 73: Hoare triple {14591#true} assume true; {14591#true} is VALID [2022-04-28 11:28:11,670 INFO L290 TraceCheckUtils]: 72: Hoare triple {14591#true} assume !(0 == ~cond); {14591#true} is VALID [2022-04-28 11:28:11,670 INFO L290 TraceCheckUtils]: 71: Hoare triple {14591#true} ~cond := #in~cond; {14591#true} is VALID [2022-04-28 11:28:11,670 INFO L272 TraceCheckUtils]: 70: Hoare triple {14591#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {14591#true} is VALID [2022-04-28 11:28:11,670 INFO L290 TraceCheckUtils]: 69: Hoare triple {14591#true} assume !!(#t~post6 < 5);havoc #t~post6; {14591#true} is VALID [2022-04-28 11:28:11,670 INFO L290 TraceCheckUtils]: 68: Hoare triple {14591#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14591#true} is VALID [2022-04-28 11:28:11,671 INFO L290 TraceCheckUtils]: 67: Hoare triple {14591#true} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {14591#true} is VALID [2022-04-28 11:28:11,671 INFO L290 TraceCheckUtils]: 66: Hoare triple {14591#true} assume !(~r~0 >= 2 * ~b~0); {14591#true} is VALID [2022-04-28 11:28:11,671 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {14591#true} {14591#true} #87#return; {14591#true} is VALID [2022-04-28 11:28:11,671 INFO L290 TraceCheckUtils]: 64: Hoare triple {14591#true} assume true; {14591#true} is VALID [2022-04-28 11:28:11,671 INFO L290 TraceCheckUtils]: 63: Hoare triple {14591#true} assume !(0 == ~cond); {14591#true} is VALID [2022-04-28 11:28:11,671 INFO L290 TraceCheckUtils]: 62: Hoare triple {14591#true} ~cond := #in~cond; {14591#true} is VALID [2022-04-28 11:28:11,671 INFO L272 TraceCheckUtils]: 61: Hoare triple {14591#true} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {14591#true} is VALID [2022-04-28 11:28:11,671 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {14591#true} {14591#true} #85#return; {14591#true} is VALID [2022-04-28 11:28:11,671 INFO L290 TraceCheckUtils]: 59: Hoare triple {14591#true} assume true; {14591#true} is VALID [2022-04-28 11:28:11,671 INFO L290 TraceCheckUtils]: 58: Hoare triple {14591#true} assume !(0 == ~cond); {14591#true} is VALID [2022-04-28 11:28:11,671 INFO L290 TraceCheckUtils]: 57: Hoare triple {14591#true} ~cond := #in~cond; {14591#true} is VALID [2022-04-28 11:28:11,671 INFO L272 TraceCheckUtils]: 56: Hoare triple {14591#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {14591#true} is VALID [2022-04-28 11:28:11,671 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {14591#true} {14591#true} #83#return; {14591#true} is VALID [2022-04-28 11:28:11,671 INFO L290 TraceCheckUtils]: 54: Hoare triple {14591#true} assume true; {14591#true} is VALID [2022-04-28 11:28:11,671 INFO L290 TraceCheckUtils]: 53: Hoare triple {14591#true} assume !(0 == ~cond); {14591#true} is VALID [2022-04-28 11:28:11,671 INFO L290 TraceCheckUtils]: 52: Hoare triple {14591#true} ~cond := #in~cond; {14591#true} is VALID [2022-04-28 11:28:11,671 INFO L272 TraceCheckUtils]: 51: Hoare triple {14591#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {14591#true} is VALID [2022-04-28 11:28:11,671 INFO L290 TraceCheckUtils]: 50: Hoare triple {14591#true} assume !!(#t~post7 < 5);havoc #t~post7; {14591#true} is VALID [2022-04-28 11:28:11,671 INFO L290 TraceCheckUtils]: 49: Hoare triple {14591#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14591#true} is VALID [2022-04-28 11:28:11,672 INFO L290 TraceCheckUtils]: 48: Hoare triple {14591#true} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {14591#true} is VALID [2022-04-28 11:28:11,672 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {14591#true} {14591#true} #89#return; {14591#true} is VALID [2022-04-28 11:28:11,672 INFO L290 TraceCheckUtils]: 46: Hoare triple {14591#true} assume true; {14591#true} is VALID [2022-04-28 11:28:11,672 INFO L290 TraceCheckUtils]: 45: Hoare triple {14591#true} assume !(0 == ~cond); {14591#true} is VALID [2022-04-28 11:28:11,672 INFO L290 TraceCheckUtils]: 44: Hoare triple {14591#true} ~cond := #in~cond; {14591#true} is VALID [2022-04-28 11:28:11,672 INFO L272 TraceCheckUtils]: 43: Hoare triple {14591#true} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {14591#true} is VALID [2022-04-28 11:28:11,672 INFO L290 TraceCheckUtils]: 42: Hoare triple {14591#true} assume !!(~r~0 >= 2 * ~b~0); {14591#true} is VALID [2022-04-28 11:28:11,672 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {14591#true} {14591#true} #87#return; {14591#true} is VALID [2022-04-28 11:28:11,672 INFO L290 TraceCheckUtils]: 40: Hoare triple {14591#true} assume true; {14591#true} is VALID [2022-04-28 11:28:11,672 INFO L290 TraceCheckUtils]: 39: Hoare triple {14591#true} assume !(0 == ~cond); {14591#true} is VALID [2022-04-28 11:28:11,672 INFO L290 TraceCheckUtils]: 38: Hoare triple {14591#true} ~cond := #in~cond; {14591#true} is VALID [2022-04-28 11:28:11,672 INFO L272 TraceCheckUtils]: 37: Hoare triple {14591#true} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {14591#true} is VALID [2022-04-28 11:28:11,672 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {14591#true} {14591#true} #85#return; {14591#true} is VALID [2022-04-28 11:28:11,672 INFO L290 TraceCheckUtils]: 35: Hoare triple {14591#true} assume true; {14591#true} is VALID [2022-04-28 11:28:11,672 INFO L290 TraceCheckUtils]: 34: Hoare triple {14591#true} assume !(0 == ~cond); {14591#true} is VALID [2022-04-28 11:28:11,672 INFO L290 TraceCheckUtils]: 33: Hoare triple {14591#true} ~cond := #in~cond; {14591#true} is VALID [2022-04-28 11:28:11,672 INFO L272 TraceCheckUtils]: 32: Hoare triple {14591#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {14591#true} is VALID [2022-04-28 11:28:11,672 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {14591#true} {14591#true} #83#return; {14591#true} is VALID [2022-04-28 11:28:11,672 INFO L290 TraceCheckUtils]: 30: Hoare triple {14591#true} assume true; {14591#true} is VALID [2022-04-28 11:28:11,672 INFO L290 TraceCheckUtils]: 29: Hoare triple {14591#true} assume !(0 == ~cond); {14591#true} is VALID [2022-04-28 11:28:11,673 INFO L290 TraceCheckUtils]: 28: Hoare triple {14591#true} ~cond := #in~cond; {14591#true} is VALID [2022-04-28 11:28:11,673 INFO L272 TraceCheckUtils]: 27: Hoare triple {14591#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {14591#true} is VALID [2022-04-28 11:28:11,673 INFO L290 TraceCheckUtils]: 26: Hoare triple {14591#true} assume !!(#t~post7 < 5);havoc #t~post7; {14591#true} is VALID [2022-04-28 11:28:11,673 INFO L290 TraceCheckUtils]: 25: Hoare triple {14591#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14591#true} is VALID [2022-04-28 11:28:11,673 INFO L290 TraceCheckUtils]: 24: Hoare triple {14591#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {14591#true} is VALID [2022-04-28 11:28:11,673 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {14591#true} {14591#true} #81#return; {14591#true} is VALID [2022-04-28 11:28:11,673 INFO L290 TraceCheckUtils]: 22: Hoare triple {14591#true} assume true; {14591#true} is VALID [2022-04-28 11:28:11,673 INFO L290 TraceCheckUtils]: 21: Hoare triple {14591#true} assume !(0 == ~cond); {14591#true} is VALID [2022-04-28 11:28:11,673 INFO L290 TraceCheckUtils]: 20: Hoare triple {14591#true} ~cond := #in~cond; {14591#true} is VALID [2022-04-28 11:28:11,673 INFO L272 TraceCheckUtils]: 19: Hoare triple {14591#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {14591#true} is VALID [2022-04-28 11:28:11,673 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {14591#true} {14591#true} #79#return; {14591#true} is VALID [2022-04-28 11:28:11,673 INFO L290 TraceCheckUtils]: 17: Hoare triple {14591#true} assume true; {14591#true} is VALID [2022-04-28 11:28:11,673 INFO L290 TraceCheckUtils]: 16: Hoare triple {14591#true} assume !(0 == ~cond); {14591#true} is VALID [2022-04-28 11:28:11,673 INFO L290 TraceCheckUtils]: 15: Hoare triple {14591#true} ~cond := #in~cond; {14591#true} is VALID [2022-04-28 11:28:11,673 INFO L272 TraceCheckUtils]: 14: Hoare triple {14591#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {14591#true} is VALID [2022-04-28 11:28:11,673 INFO L290 TraceCheckUtils]: 13: Hoare triple {14591#true} assume !!(#t~post6 < 5);havoc #t~post6; {14591#true} is VALID [2022-04-28 11:28:11,673 INFO L290 TraceCheckUtils]: 12: Hoare triple {14591#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14591#true} is VALID [2022-04-28 11:28:11,673 INFO L290 TraceCheckUtils]: 11: Hoare triple {14591#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {14591#true} is VALID [2022-04-28 11:28:11,673 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14591#true} {14591#true} #77#return; {14591#true} is VALID [2022-04-28 11:28:11,674 INFO L290 TraceCheckUtils]: 9: Hoare triple {14591#true} assume true; {14591#true} is VALID [2022-04-28 11:28:11,674 INFO L290 TraceCheckUtils]: 8: Hoare triple {14591#true} assume !(0 == ~cond); {14591#true} is VALID [2022-04-28 11:28:11,674 INFO L290 TraceCheckUtils]: 7: Hoare triple {14591#true} ~cond := #in~cond; {14591#true} is VALID [2022-04-28 11:28:11,674 INFO L272 TraceCheckUtils]: 6: Hoare triple {14591#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {14591#true} is VALID [2022-04-28 11:28:11,674 INFO L290 TraceCheckUtils]: 5: Hoare triple {14591#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {14591#true} is VALID [2022-04-28 11:28:11,674 INFO L272 TraceCheckUtils]: 4: Hoare triple {14591#true} call #t~ret8 := main(); {14591#true} is VALID [2022-04-28 11:28:11,674 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14591#true} {14591#true} #93#return; {14591#true} is VALID [2022-04-28 11:28:11,674 INFO L290 TraceCheckUtils]: 2: Hoare triple {14591#true} assume true; {14591#true} is VALID [2022-04-28 11:28:11,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {14591#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {14591#true} is VALID [2022-04-28 11:28:11,674 INFO L272 TraceCheckUtils]: 0: Hoare triple {14591#true} call ULTIMATE.init(); {14591#true} is VALID [2022-04-28 11:28:11,674 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 80 proven. 4 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2022-04-28 11:28:11,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:28:11,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022178488] [2022-04-28 11:28:11,675 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:28:11,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158708742] [2022-04-28 11:28:11,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158708742] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:28:11,675 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:28:11,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 18 [2022-04-28 11:28:11,675 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:28:11,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1568532588] [2022-04-28 11:28:11,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1568532588] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:28:11,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:28:11,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 11:28:11,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993512058] [2022-04-28 11:28:11,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:28:11,675 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 13 states have internal predecessors, (36), 8 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) Word has length 106 [2022-04-28 11:28:11,676 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:28:11,676 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 13 states have internal predecessors, (36), 8 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2022-04-28 11:28:11,734 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 11:28:11,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 11:28:11,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:28:11,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 11:28:11,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-04-28 11:28:11,735 INFO L87 Difference]: Start difference. First operand 196 states and 232 transitions. Second operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 13 states have internal predecessors, (36), 8 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2022-04-28 11:28:14,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:28:14,761 INFO L93 Difference]: Finished difference Result 281 states and 343 transitions. [2022-04-28 11:28:14,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 11:28:14,761 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 13 states have internal predecessors, (36), 8 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) Word has length 106 [2022-04-28 11:28:14,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:28:14,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 13 states have internal predecessors, (36), 8 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2022-04-28 11:28:14,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 151 transitions. [2022-04-28 11:28:14,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 13 states have internal predecessors, (36), 8 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2022-04-28 11:28:14,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 151 transitions. [2022-04-28 11:28:14,764 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 151 transitions. [2022-04-28 11:28:14,899 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:28:14,902 INFO L225 Difference]: With dead ends: 281 [2022-04-28 11:28:14,902 INFO L226 Difference]: Without dead ends: 185 [2022-04-28 11:28:14,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 194 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2022-04-28 11:28:14,903 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 31 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:28:14,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 293 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-28 11:28:14,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-04-28 11:28:15,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 184. [2022-04-28 11:28:15,134 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:28:15,135 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand has 184 states, 118 states have (on average 1.1355932203389831) internal successors, (134), 120 states have internal predecessors, (134), 43 states have call successors, (43), 23 states have call predecessors, (43), 22 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-28 11:28:15,135 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand has 184 states, 118 states have (on average 1.1355932203389831) internal successors, (134), 120 states have internal predecessors, (134), 43 states have call successors, (43), 23 states have call predecessors, (43), 22 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-28 11:28:15,136 INFO L87 Difference]: Start difference. First operand 185 states. Second operand has 184 states, 118 states have (on average 1.1355932203389831) internal successors, (134), 120 states have internal predecessors, (134), 43 states have call successors, (43), 23 states have call predecessors, (43), 22 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-28 11:28:15,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:28:15,139 INFO L93 Difference]: Finished difference Result 185 states and 219 transitions. [2022-04-28 11:28:15,139 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 219 transitions. [2022-04-28 11:28:15,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:28:15,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:28:15,140 INFO L74 IsIncluded]: Start isIncluded. First operand has 184 states, 118 states have (on average 1.1355932203389831) internal successors, (134), 120 states have internal predecessors, (134), 43 states have call successors, (43), 23 states have call predecessors, (43), 22 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) Second operand 185 states. [2022-04-28 11:28:15,140 INFO L87 Difference]: Start difference. First operand has 184 states, 118 states have (on average 1.1355932203389831) internal successors, (134), 120 states have internal predecessors, (134), 43 states have call successors, (43), 23 states have call predecessors, (43), 22 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) Second operand 185 states. [2022-04-28 11:28:15,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:28:15,145 INFO L93 Difference]: Finished difference Result 185 states and 219 transitions. [2022-04-28 11:28:15,145 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 219 transitions. [2022-04-28 11:28:15,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:28:15,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:28:15,145 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:28:15,145 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:28:15,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 118 states have (on average 1.1355932203389831) internal successors, (134), 120 states have internal predecessors, (134), 43 states have call successors, (43), 23 states have call predecessors, (43), 22 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-28 11:28:15,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 218 transitions. [2022-04-28 11:28:15,149 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 218 transitions. Word has length 106 [2022-04-28 11:28:15,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:28:15,149 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 218 transitions. [2022-04-28 11:28:15,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 13 states have internal predecessors, (36), 8 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2022-04-28 11:28:15,149 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 184 states and 218 transitions. [2022-04-28 11:28:15,390 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 218 edges. 218 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:28:15,390 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 218 transitions. [2022-04-28 11:28:15,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-04-28 11:28:15,391 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:28:15,391 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 4, 3, 3, 3, 3, 3, 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] [2022-04-28 11:28:15,407 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 11:28:15,592 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 11:28:15,592 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:28:15,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:28:15,592 INFO L85 PathProgramCache]: Analyzing trace with hash 2077207105, now seen corresponding path program 3 times [2022-04-28 11:28:15,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:28:15,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1365449230] [2022-04-28 11:28:40,337 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:28:40,337 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:28:40,337 INFO L85 PathProgramCache]: Analyzing trace with hash 2077207105, now seen corresponding path program 4 times [2022-04-28 11:28:40,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:28:40,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929781054] [2022-04-28 11:28:40,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:28:40,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:28:40,362 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:28:40,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1670064109] [2022-04-28 11:28:40,362 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:28:40,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:28:40,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:28:40,363 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 11:28:40,364 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 11:28:40,423 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:28:40,423 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:28:40,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 11:28:40,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:28:40,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:30:05,409 INFO L272 TraceCheckUtils]: 0: Hoare triple {16548#true} call ULTIMATE.init(); {16548#true} is VALID [2022-04-28 11:30:05,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {16548#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {16548#true} is VALID [2022-04-28 11:30:05,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {16548#true} assume true; {16548#true} is VALID [2022-04-28 11:30:05,409 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16548#true} {16548#true} #93#return; {16548#true} is VALID [2022-04-28 11:30:05,409 INFO L272 TraceCheckUtils]: 4: Hoare triple {16548#true} call #t~ret8 := main(); {16548#true} is VALID [2022-04-28 11:30:05,410 INFO L290 TraceCheckUtils]: 5: Hoare triple {16548#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {16548#true} is VALID [2022-04-28 11:30:05,410 INFO L272 TraceCheckUtils]: 6: Hoare triple {16548#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {16548#true} is VALID [2022-04-28 11:30:05,410 INFO L290 TraceCheckUtils]: 7: Hoare triple {16548#true} ~cond := #in~cond; {16548#true} is VALID [2022-04-28 11:30:05,410 INFO L290 TraceCheckUtils]: 8: Hoare triple {16548#true} assume !(0 == ~cond); {16548#true} is VALID [2022-04-28 11:30:05,410 INFO L290 TraceCheckUtils]: 9: Hoare triple {16548#true} assume true; {16548#true} is VALID [2022-04-28 11:30:05,410 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16548#true} {16548#true} #77#return; {16548#true} is VALID [2022-04-28 11:30:05,410 INFO L290 TraceCheckUtils]: 11: Hoare triple {16548#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {16586#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:30:05,410 INFO L290 TraceCheckUtils]: 12: Hoare triple {16586#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16586#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:30:05,411 INFO L290 TraceCheckUtils]: 13: Hoare triple {16586#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 5);havoc #t~post6; {16586#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:30:05,411 INFO L272 TraceCheckUtils]: 14: Hoare triple {16586#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {16548#true} is VALID [2022-04-28 11:30:05,411 INFO L290 TraceCheckUtils]: 15: Hoare triple {16548#true} ~cond := #in~cond; {16548#true} is VALID [2022-04-28 11:30:05,411 INFO L290 TraceCheckUtils]: 16: Hoare triple {16548#true} assume !(0 == ~cond); {16548#true} is VALID [2022-04-28 11:30:05,411 INFO L290 TraceCheckUtils]: 17: Hoare triple {16548#true} assume true; {16548#true} is VALID [2022-04-28 11:30:05,411 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {16548#true} {16586#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #79#return; {16586#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:30:05,412 INFO L272 TraceCheckUtils]: 19: Hoare triple {16586#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {16548#true} is VALID [2022-04-28 11:30:05,412 INFO L290 TraceCheckUtils]: 20: Hoare triple {16548#true} ~cond := #in~cond; {16548#true} is VALID [2022-04-28 11:30:05,412 INFO L290 TraceCheckUtils]: 21: Hoare triple {16548#true} assume !(0 == ~cond); {16548#true} is VALID [2022-04-28 11:30:05,412 INFO L290 TraceCheckUtils]: 22: Hoare triple {16548#true} assume true; {16548#true} is VALID [2022-04-28 11:30:05,412 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {16548#true} {16586#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #81#return; {16586#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:30:05,412 INFO L290 TraceCheckUtils]: 24: Hoare triple {16586#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {16626#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:30:05,413 INFO L290 TraceCheckUtils]: 25: Hoare triple {16626#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16626#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:30:05,413 INFO L290 TraceCheckUtils]: 26: Hoare triple {16626#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(#t~post7 < 5);havoc #t~post7; {16626#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:30:05,413 INFO L272 TraceCheckUtils]: 27: Hoare triple {16626#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {16548#true} is VALID [2022-04-28 11:30:05,413 INFO L290 TraceCheckUtils]: 28: Hoare triple {16548#true} ~cond := #in~cond; {16548#true} is VALID [2022-04-28 11:30:05,413 INFO L290 TraceCheckUtils]: 29: Hoare triple {16548#true} assume !(0 == ~cond); {16548#true} is VALID [2022-04-28 11:30:05,413 INFO L290 TraceCheckUtils]: 30: Hoare triple {16548#true} assume true; {16548#true} is VALID [2022-04-28 11:30:05,414 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {16548#true} {16626#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #83#return; {16626#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:30:05,414 INFO L272 TraceCheckUtils]: 32: Hoare triple {16626#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {16548#true} is VALID [2022-04-28 11:30:05,414 INFO L290 TraceCheckUtils]: 33: Hoare triple {16548#true} ~cond := #in~cond; {16548#true} is VALID [2022-04-28 11:30:05,414 INFO L290 TraceCheckUtils]: 34: Hoare triple {16548#true} assume !(0 == ~cond); {16548#true} is VALID [2022-04-28 11:30:05,414 INFO L290 TraceCheckUtils]: 35: Hoare triple {16548#true} assume true; {16548#true} is VALID [2022-04-28 11:30:05,415 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {16548#true} {16626#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #85#return; {16626#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:30:05,415 INFO L272 TraceCheckUtils]: 37: Hoare triple {16626#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {16548#true} is VALID [2022-04-28 11:30:05,415 INFO L290 TraceCheckUtils]: 38: Hoare triple {16548#true} ~cond := #in~cond; {16548#true} is VALID [2022-04-28 11:30:05,415 INFO L290 TraceCheckUtils]: 39: Hoare triple {16548#true} assume !(0 == ~cond); {16548#true} is VALID [2022-04-28 11:30:05,415 INFO L290 TraceCheckUtils]: 40: Hoare triple {16548#true} assume true; {16548#true} is VALID [2022-04-28 11:30:05,415 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {16548#true} {16626#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #87#return; {16626#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:30:05,416 INFO L290 TraceCheckUtils]: 42: Hoare triple {16626#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(~r~0 >= 2 * ~b~0); {16626#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:30:05,416 INFO L272 TraceCheckUtils]: 43: Hoare triple {16626#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {16548#true} is VALID [2022-04-28 11:30:05,416 INFO L290 TraceCheckUtils]: 44: Hoare triple {16548#true} ~cond := #in~cond; {16548#true} is VALID [2022-04-28 11:30:05,416 INFO L290 TraceCheckUtils]: 45: Hoare triple {16548#true} assume !(0 == ~cond); {16548#true} is VALID [2022-04-28 11:30:05,416 INFO L290 TraceCheckUtils]: 46: Hoare triple {16548#true} assume true; {16548#true} is VALID [2022-04-28 11:30:05,416 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {16548#true} {16626#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #89#return; {16626#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:30:05,417 INFO L290 TraceCheckUtils]: 48: Hoare triple {16626#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {16699#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= main_~q~0 0))} is VALID [2022-04-28 11:30:05,418 INFO L290 TraceCheckUtils]: 49: Hoare triple {16699#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16699#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= main_~q~0 0))} is VALID [2022-04-28 11:30:05,418 INFO L290 TraceCheckUtils]: 50: Hoare triple {16699#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= main_~q~0 0))} assume !!(#t~post7 < 5);havoc #t~post7; {16699#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= main_~q~0 0))} is VALID [2022-04-28 11:30:05,418 INFO L272 TraceCheckUtils]: 51: Hoare triple {16699#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {16548#true} is VALID [2022-04-28 11:30:05,419 INFO L290 TraceCheckUtils]: 52: Hoare triple {16548#true} ~cond := #in~cond; {16712#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:30:05,419 INFO L290 TraceCheckUtils]: 53: Hoare triple {16712#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {16716#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:30:05,419 INFO L290 TraceCheckUtils]: 54: Hoare triple {16716#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {16716#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:30:05,420 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {16716#(not (= |__VERIFIER_assert_#in~cond| 0))} {16699#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= main_~q~0 0))} #83#return; {16723#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} is VALID [2022-04-28 11:30:05,420 INFO L272 TraceCheckUtils]: 56: Hoare triple {16723#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {16548#true} is VALID [2022-04-28 11:30:05,420 INFO L290 TraceCheckUtils]: 57: Hoare triple {16548#true} ~cond := #in~cond; {16548#true} is VALID [2022-04-28 11:30:05,420 INFO L290 TraceCheckUtils]: 58: Hoare triple {16548#true} assume !(0 == ~cond); {16548#true} is VALID [2022-04-28 11:30:05,420 INFO L290 TraceCheckUtils]: 59: Hoare triple {16548#true} assume true; {16548#true} is VALID [2022-04-28 11:30:05,421 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {16548#true} {16723#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} #85#return; {16723#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} is VALID [2022-04-28 11:30:05,421 INFO L272 TraceCheckUtils]: 61: Hoare triple {16723#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {16548#true} is VALID [2022-04-28 11:30:05,421 INFO L290 TraceCheckUtils]: 62: Hoare triple {16548#true} ~cond := #in~cond; {16548#true} is VALID [2022-04-28 11:30:05,421 INFO L290 TraceCheckUtils]: 63: Hoare triple {16548#true} assume !(0 == ~cond); {16548#true} is VALID [2022-04-28 11:30:05,421 INFO L290 TraceCheckUtils]: 64: Hoare triple {16548#true} assume true; {16548#true} is VALID [2022-04-28 11:30:05,422 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {16548#true} {16723#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} #87#return; {16723#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} is VALID [2022-04-28 11:30:05,422 INFO L290 TraceCheckUtils]: 66: Hoare triple {16723#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} assume !!(~r~0 >= 2 * ~b~0); {16723#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} is VALID [2022-04-28 11:30:05,422 INFO L272 TraceCheckUtils]: 67: Hoare triple {16723#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {16548#true} is VALID [2022-04-28 11:30:05,422 INFO L290 TraceCheckUtils]: 68: Hoare triple {16548#true} ~cond := #in~cond; {16548#true} is VALID [2022-04-28 11:30:05,423 INFO L290 TraceCheckUtils]: 69: Hoare triple {16548#true} assume !(0 == ~cond); {16548#true} is VALID [2022-04-28 11:30:05,423 INFO L290 TraceCheckUtils]: 70: Hoare triple {16548#true} assume true; {16548#true} is VALID [2022-04-28 11:30:05,423 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {16548#true} {16723#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} #89#return; {16723#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} is VALID [2022-04-28 11:30:05,426 INFO L290 TraceCheckUtils]: 72: Hoare triple {16723#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {16775#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~q~0 0) (= (* (* (div (- main_~a~0) (- 2)) main_~y~0) 2) main_~b~0))} is VALID [2022-04-28 11:30:05,427 INFO L290 TraceCheckUtils]: 73: Hoare triple {16775#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~q~0 0) (= (* (* (div (- main_~a~0) (- 2)) main_~y~0) 2) main_~b~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16775#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~q~0 0) (= (* (* (div (- main_~a~0) (- 2)) main_~y~0) 2) main_~b~0))} is VALID [2022-04-28 11:30:05,428 INFO L290 TraceCheckUtils]: 74: Hoare triple {16775#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~q~0 0) (= (* (* (div (- main_~a~0) (- 2)) main_~y~0) 2) main_~b~0))} assume !!(#t~post7 < 5);havoc #t~post7; {16775#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~q~0 0) (= (* (* (div (- main_~a~0) (- 2)) main_~y~0) 2) main_~b~0))} is VALID [2022-04-28 11:30:05,428 INFO L272 TraceCheckUtils]: 75: Hoare triple {16775#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~q~0 0) (= (* (* (div (- main_~a~0) (- 2)) main_~y~0) 2) main_~b~0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {16548#true} is VALID [2022-04-28 11:30:05,428 INFO L290 TraceCheckUtils]: 76: Hoare triple {16548#true} ~cond := #in~cond; {16548#true} is VALID [2022-04-28 11:30:05,428 INFO L290 TraceCheckUtils]: 77: Hoare triple {16548#true} assume !(0 == ~cond); {16548#true} is VALID [2022-04-28 11:30:05,428 INFO L290 TraceCheckUtils]: 78: Hoare triple {16548#true} assume true; {16548#true} is VALID [2022-04-28 11:30:05,428 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {16548#true} {16775#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~q~0 0) (= (* (* (div (- main_~a~0) (- 2)) main_~y~0) 2) main_~b~0))} #83#return; {16775#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~q~0 0) (= (* (* (div (- main_~a~0) (- 2)) main_~y~0) 2) main_~b~0))} is VALID [2022-04-28 11:30:05,428 INFO L272 TraceCheckUtils]: 80: Hoare triple {16775#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~q~0 0) (= (* (* (div (- main_~a~0) (- 2)) main_~y~0) 2) main_~b~0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {16548#true} is VALID [2022-04-28 11:30:05,428 INFO L290 TraceCheckUtils]: 81: Hoare triple {16548#true} ~cond := #in~cond; {16548#true} is VALID [2022-04-28 11:30:05,428 INFO L290 TraceCheckUtils]: 82: Hoare triple {16548#true} assume !(0 == ~cond); {16548#true} is VALID [2022-04-28 11:30:05,428 INFO L290 TraceCheckUtils]: 83: Hoare triple {16548#true} assume true; {16548#true} is VALID [2022-04-28 11:30:05,429 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {16548#true} {16775#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~q~0 0) (= (* (* (div (- main_~a~0) (- 2)) main_~y~0) 2) main_~b~0))} #85#return; {16775#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~q~0 0) (= (* (* (div (- main_~a~0) (- 2)) main_~y~0) 2) main_~b~0))} is VALID [2022-04-28 11:30:05,429 INFO L272 TraceCheckUtils]: 85: Hoare triple {16775#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~q~0 0) (= (* (* (div (- main_~a~0) (- 2)) main_~y~0) 2) main_~b~0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {16548#true} is VALID [2022-04-28 11:30:05,429 INFO L290 TraceCheckUtils]: 86: Hoare triple {16548#true} ~cond := #in~cond; {16548#true} is VALID [2022-04-28 11:30:05,429 INFO L290 TraceCheckUtils]: 87: Hoare triple {16548#true} assume !(0 == ~cond); {16548#true} is VALID [2022-04-28 11:30:05,429 INFO L290 TraceCheckUtils]: 88: Hoare triple {16548#true} assume true; {16548#true} is VALID [2022-04-28 11:30:05,430 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {16548#true} {16775#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~q~0 0) (= (* (* (div (- main_~a~0) (- 2)) main_~y~0) 2) main_~b~0))} #87#return; {16775#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~q~0 0) (= (* (* (div (- main_~a~0) (- 2)) main_~y~0) 2) main_~b~0))} is VALID [2022-04-28 11:30:05,430 INFO L290 TraceCheckUtils]: 90: Hoare triple {16775#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~q~0 0) (= (* (* (div (- main_~a~0) (- 2)) main_~y~0) 2) main_~b~0))} assume !(~r~0 >= 2 * ~b~0); {16830#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (not (<= (* main_~b~0 2) main_~r~0)) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~q~0 0) (= (* (* (div (- main_~a~0) (- 2)) main_~y~0) 2) main_~b~0))} is VALID [2022-04-28 11:30:05,433 INFO L290 TraceCheckUtils]: 91: Hoare triple {16830#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (not (<= (* main_~b~0 2) main_~r~0)) (= (* (div (- main_~a~0) (- 2)) main_~y~0) (* main_~y~0 2)) (= main_~q~0 0) (= (* (* (div (- main_~a~0) (- 2)) main_~y~0) 2) main_~b~0))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {16834#(and (not (<= main_~x~0 (* main_~r~0 2))) (= (* 2 (* (div (- main_~q~0) (- 2)) main_~y~0)) (+ main_~x~0 (* (- 1) main_~r~0))) (<= (div (* (- 1) (div (* (- 1) main_~q~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (mod main_~q~0 2) 0) (= (* main_~y~0 2) (* (div (- main_~q~0) (- 2)) main_~y~0)))} is VALID [2022-04-28 11:30:05,434 INFO L290 TraceCheckUtils]: 92: Hoare triple {16834#(and (not (<= main_~x~0 (* main_~r~0 2))) (= (* 2 (* (div (- main_~q~0) (- 2)) main_~y~0)) (+ main_~x~0 (* (- 1) main_~r~0))) (<= (div (* (- 1) (div (* (- 1) main_~q~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (mod main_~q~0 2) 0) (= (* main_~y~0 2) (* (div (- main_~q~0) (- 2)) main_~y~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16834#(and (not (<= main_~x~0 (* main_~r~0 2))) (= (* 2 (* (div (- main_~q~0) (- 2)) main_~y~0)) (+ main_~x~0 (* (- 1) main_~r~0))) (<= (div (* (- 1) (div (* (- 1) main_~q~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (mod main_~q~0 2) 0) (= (* main_~y~0 2) (* (div (- main_~q~0) (- 2)) main_~y~0)))} is VALID [2022-04-28 11:30:05,434 INFO L290 TraceCheckUtils]: 93: Hoare triple {16834#(and (not (<= main_~x~0 (* main_~r~0 2))) (= (* 2 (* (div (- main_~q~0) (- 2)) main_~y~0)) (+ main_~x~0 (* (- 1) main_~r~0))) (<= (div (* (- 1) (div (* (- 1) main_~q~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (mod main_~q~0 2) 0) (= (* main_~y~0 2) (* (div (- main_~q~0) (- 2)) main_~y~0)))} assume !!(#t~post6 < 5);havoc #t~post6; {16834#(and (not (<= main_~x~0 (* main_~r~0 2))) (= (* 2 (* (div (- main_~q~0) (- 2)) main_~y~0)) (+ main_~x~0 (* (- 1) main_~r~0))) (<= (div (* (- 1) (div (* (- 1) main_~q~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (mod main_~q~0 2) 0) (= (* main_~y~0 2) (* (div (- main_~q~0) (- 2)) main_~y~0)))} is VALID [2022-04-28 11:30:05,434 INFO L272 TraceCheckUtils]: 94: Hoare triple {16834#(and (not (<= main_~x~0 (* main_~r~0 2))) (= (* 2 (* (div (- main_~q~0) (- 2)) main_~y~0)) (+ main_~x~0 (* (- 1) main_~r~0))) (<= (div (* (- 1) (div (* (- 1) main_~q~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (mod main_~q~0 2) 0) (= (* main_~y~0 2) (* (div (- main_~q~0) (- 2)) main_~y~0)))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {16548#true} is VALID [2022-04-28 11:30:05,434 INFO L290 TraceCheckUtils]: 95: Hoare triple {16548#true} ~cond := #in~cond; {16548#true} is VALID [2022-04-28 11:30:05,434 INFO L290 TraceCheckUtils]: 96: Hoare triple {16548#true} assume !(0 == ~cond); {16548#true} is VALID [2022-04-28 11:30:05,435 INFO L290 TraceCheckUtils]: 97: Hoare triple {16548#true} assume true; {16548#true} is VALID [2022-04-28 11:30:05,435 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {16548#true} {16834#(and (not (<= main_~x~0 (* main_~r~0 2))) (= (* 2 (* (div (- main_~q~0) (- 2)) main_~y~0)) (+ main_~x~0 (* (- 1) main_~r~0))) (<= (div (* (- 1) (div (* (- 1) main_~q~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (mod main_~q~0 2) 0) (= (* main_~y~0 2) (* (div (- main_~q~0) (- 2)) main_~y~0)))} #79#return; {16834#(and (not (<= main_~x~0 (* main_~r~0 2))) (= (* 2 (* (div (- main_~q~0) (- 2)) main_~y~0)) (+ main_~x~0 (* (- 1) main_~r~0))) (<= (div (* (- 1) (div (* (- 1) main_~q~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (mod main_~q~0 2) 0) (= (* main_~y~0 2) (* (div (- main_~q~0) (- 2)) main_~y~0)))} is VALID [2022-04-28 11:30:05,435 INFO L272 TraceCheckUtils]: 99: Hoare triple {16834#(and (not (<= main_~x~0 (* main_~r~0 2))) (= (* 2 (* (div (- main_~q~0) (- 2)) main_~y~0)) (+ main_~x~0 (* (- 1) main_~r~0))) (<= (div (* (- 1) (div (* (- 1) main_~q~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (mod main_~q~0 2) 0) (= (* main_~y~0 2) (* (div (- main_~q~0) (- 2)) main_~y~0)))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {16548#true} is VALID [2022-04-28 11:30:05,435 INFO L290 TraceCheckUtils]: 100: Hoare triple {16548#true} ~cond := #in~cond; {16548#true} is VALID [2022-04-28 11:30:05,435 INFO L290 TraceCheckUtils]: 101: Hoare triple {16548#true} assume !(0 == ~cond); {16548#true} is VALID [2022-04-28 11:30:05,435 INFO L290 TraceCheckUtils]: 102: Hoare triple {16548#true} assume true; {16548#true} is VALID [2022-04-28 11:30:05,436 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {16548#true} {16834#(and (not (<= main_~x~0 (* main_~r~0 2))) (= (* 2 (* (div (- main_~q~0) (- 2)) main_~y~0)) (+ main_~x~0 (* (- 1) main_~r~0))) (<= (div (* (- 1) (div (* (- 1) main_~q~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (mod main_~q~0 2) 0) (= (* main_~y~0 2) (* (div (- main_~q~0) (- 2)) main_~y~0)))} #81#return; {16834#(and (not (<= main_~x~0 (* main_~r~0 2))) (= (* 2 (* (div (- main_~q~0) (- 2)) main_~y~0)) (+ main_~x~0 (* (- 1) main_~r~0))) (<= (div (* (- 1) (div (* (- 1) main_~q~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (mod main_~q~0 2) 0) (= (* main_~y~0 2) (* (div (- main_~q~0) (- 2)) main_~y~0)))} is VALID [2022-04-28 11:30:05,436 INFO L290 TraceCheckUtils]: 104: Hoare triple {16834#(and (not (<= main_~x~0 (* main_~r~0 2))) (= (* 2 (* (div (- main_~q~0) (- 2)) main_~y~0)) (+ main_~x~0 (* (- 1) main_~r~0))) (<= (div (* (- 1) (div (* (- 1) main_~q~0) (- 2))) (- 2)) 1) (= (mod (div (- main_~q~0) (- 2)) 2) 0) (= (mod main_~q~0 2) 0) (= (* main_~y~0 2) (* (div (- main_~q~0) (- 2)) main_~y~0)))} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {16874#(and (= main_~a~0 1) (<= main_~y~0 main_~r~0) (= (* main_~y~0 (div (* (- 1) main_~q~0) (- 2))) (* main_~y~0 2)) (= main_~b~0 main_~y~0) (= (mod main_~q~0 2) 0) (= main_~x~0 (+ (* 2 (* main_~y~0 (div (* (- 1) main_~q~0) (- 2)))) main_~r~0)) (< (* main_~r~0 2) main_~x~0))} is VALID [2022-04-28 11:30:05,437 INFO L290 TraceCheckUtils]: 105: Hoare triple {16874#(and (= main_~a~0 1) (<= main_~y~0 main_~r~0) (= (* main_~y~0 (div (* (- 1) main_~q~0) (- 2))) (* main_~y~0 2)) (= main_~b~0 main_~y~0) (= (mod main_~q~0 2) 0) (= main_~x~0 (+ (* 2 (* main_~y~0 (div (* (- 1) main_~q~0) (- 2)))) main_~r~0)) (< (* main_~r~0 2) main_~x~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16874#(and (= main_~a~0 1) (<= main_~y~0 main_~r~0) (= (* main_~y~0 (div (* (- 1) main_~q~0) (- 2))) (* main_~y~0 2)) (= main_~b~0 main_~y~0) (= (mod main_~q~0 2) 0) (= main_~x~0 (+ (* 2 (* main_~y~0 (div (* (- 1) main_~q~0) (- 2)))) main_~r~0)) (< (* main_~r~0 2) main_~x~0))} is VALID [2022-04-28 11:30:05,437 INFO L290 TraceCheckUtils]: 106: Hoare triple {16874#(and (= main_~a~0 1) (<= main_~y~0 main_~r~0) (= (* main_~y~0 (div (* (- 1) main_~q~0) (- 2))) (* main_~y~0 2)) (= main_~b~0 main_~y~0) (= (mod main_~q~0 2) 0) (= main_~x~0 (+ (* 2 (* main_~y~0 (div (* (- 1) main_~q~0) (- 2)))) main_~r~0)) (< (* main_~r~0 2) main_~x~0))} assume !(#t~post7 < 5);havoc #t~post7; {16874#(and (= main_~a~0 1) (<= main_~y~0 main_~r~0) (= (* main_~y~0 (div (* (- 1) main_~q~0) (- 2))) (* main_~y~0 2)) (= main_~b~0 main_~y~0) (= (mod main_~q~0 2) 0) (= main_~x~0 (+ (* 2 (* main_~y~0 (div (* (- 1) main_~q~0) (- 2)))) main_~r~0)) (< (* main_~r~0 2) main_~x~0))} is VALID [2022-04-28 11:30:05,441 INFO L290 TraceCheckUtils]: 107: Hoare triple {16874#(and (= main_~a~0 1) (<= main_~y~0 main_~r~0) (= (* main_~y~0 (div (* (- 1) main_~q~0) (- 2))) (* main_~y~0 2)) (= main_~b~0 main_~y~0) (= (mod main_~q~0 2) 0) (= main_~x~0 (+ (* 2 (* main_~y~0 (div (* (- 1) main_~q~0) (- 2)))) main_~r~0)) (< (* main_~r~0 2) main_~x~0))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {16884#(and (= (* main_~y~0 2) (* (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0)) (< main_~x~0 (* 4 (* (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0))) (<= (+ main_~y~0 (* 2 (* (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0))) main_~x~0) (= (mod (+ main_~q~0 1) 2) 0) (= (+ main_~x~0 (* (- 2) (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0) (* (- 1) main_~y~0)) main_~r~0))} is VALID [2022-04-28 11:30:05,442 INFO L290 TraceCheckUtils]: 108: Hoare triple {16884#(and (= (* main_~y~0 2) (* (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0)) (< main_~x~0 (* 4 (* (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0))) (<= (+ main_~y~0 (* 2 (* (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0))) main_~x~0) (= (mod (+ main_~q~0 1) 2) 0) (= (+ main_~x~0 (* (- 2) (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0) (* (- 1) main_~y~0)) main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16884#(and (= (* main_~y~0 2) (* (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0)) (< main_~x~0 (* 4 (* (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0))) (<= (+ main_~y~0 (* 2 (* (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0))) main_~x~0) (= (mod (+ main_~q~0 1) 2) 0) (= (+ main_~x~0 (* (- 2) (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0) (* (- 1) main_~y~0)) main_~r~0))} is VALID [2022-04-28 11:30:05,442 INFO L290 TraceCheckUtils]: 109: Hoare triple {16884#(and (= (* main_~y~0 2) (* (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0)) (< main_~x~0 (* 4 (* (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0))) (<= (+ main_~y~0 (* 2 (* (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0))) main_~x~0) (= (mod (+ main_~q~0 1) 2) 0) (= (+ main_~x~0 (* (- 2) (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0) (* (- 1) main_~y~0)) main_~r~0))} assume !(#t~post6 < 5);havoc #t~post6; {16884#(and (= (* main_~y~0 2) (* (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0)) (< main_~x~0 (* 4 (* (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0))) (<= (+ main_~y~0 (* 2 (* (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0))) main_~x~0) (= (mod (+ main_~q~0 1) 2) 0) (= (+ main_~x~0 (* (- 2) (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0) (* (- 1) main_~y~0)) main_~r~0))} is VALID [2022-04-28 11:30:05,445 INFO L272 TraceCheckUtils]: 110: Hoare triple {16884#(and (= (* main_~y~0 2) (* (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0)) (< main_~x~0 (* 4 (* (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0))) (<= (+ main_~y~0 (* 2 (* (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0))) main_~x~0) (= (mod (+ main_~q~0 1) 2) 0) (= (+ main_~x~0 (* (- 2) (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0) (* (- 1) main_~y~0)) main_~r~0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {16894#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:30:05,445 INFO L290 TraceCheckUtils]: 111: Hoare triple {16894#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16898#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:30:05,446 INFO L290 TraceCheckUtils]: 112: Hoare triple {16898#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16549#false} is VALID [2022-04-28 11:30:05,446 INFO L290 TraceCheckUtils]: 113: Hoare triple {16549#false} assume !false; {16549#false} is VALID [2022-04-28 11:30:05,446 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 47 proven. 61 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2022-04-28 11:30:05,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:30:17,045 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 11:31:07,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:31:07,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929781054] [2022-04-28 11:31:07,581 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:31:07,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670064109] [2022-04-28 11:31:07,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670064109] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:31:07,581 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:31:07,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-04-28 11:31:07,581 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:31:07,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1365449230] [2022-04-28 11:31:07,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1365449230] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:31:07,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:31:07,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 11:31:07,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678612557] [2022-04-28 11:31:07,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:31:07,582 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 6 states have call predecessors, (17), 7 states have call successors, (17) Word has length 114 [2022-04-28 11:31:07,582 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:31:07,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 6 states have call predecessors, (17), 7 states have call successors, (17) [2022-04-28 11:31:07,661 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 11:31:07,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 11:31:07,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:31:07,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 11:31:07,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=468, Unknown=1, NotChecked=0, Total=600 [2022-04-28 11:31:07,662 INFO L87 Difference]: Start difference. First operand 184 states and 218 transitions. Second operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 6 states have call predecessors, (17), 7 states have call successors, (17) [2022-04-28 11:31:17,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:31:17,679 INFO L93 Difference]: Finished difference Result 232 states and 282 transitions. [2022-04-28 11:31:17,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 11:31:17,680 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 6 states have call predecessors, (17), 7 states have call successors, (17) Word has length 114 [2022-04-28 11:31:17,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:31:17,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 6 states have call predecessors, (17), 7 states have call successors, (17) [2022-04-28 11:31:17,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 169 transitions. [2022-04-28 11:31:17,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 6 states have call predecessors, (17), 7 states have call successors, (17) [2022-04-28 11:31:17,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 169 transitions. [2022-04-28 11:31:17,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 169 transitions. [2022-04-28 11:31:17,915 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:31:17,919 INFO L225 Difference]: With dead ends: 232 [2022-04-28 11:31:17,919 INFO L226 Difference]: Without dead ends: 223 [2022-04-28 11:31:17,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 180 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=144, Invalid=557, Unknown=1, NotChecked=0, Total=702 [2022-04-28 11:31:17,919 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 48 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-04-28 11:31:17,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 382 Invalid, 948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-04-28 11:31:17,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-04-28 11:31:18,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 216. [2022-04-28 11:31:18,218 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:31:18,218 INFO L82 GeneralOperation]: Start isEquivalent. First operand 223 states. Second operand has 216 states, 138 states have (on average 1.1376811594202898) internal successors, (157), 140 states have internal predecessors, (157), 52 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2022-04-28 11:31:18,219 INFO L74 IsIncluded]: Start isIncluded. First operand 223 states. Second operand has 216 states, 138 states have (on average 1.1376811594202898) internal successors, (157), 140 states have internal predecessors, (157), 52 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2022-04-28 11:31:18,219 INFO L87 Difference]: Start difference. First operand 223 states. Second operand has 216 states, 138 states have (on average 1.1376811594202898) internal successors, (157), 140 states have internal predecessors, (157), 52 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2022-04-28 11:31:18,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:31:18,234 INFO L93 Difference]: Finished difference Result 223 states and 267 transitions. [2022-04-28 11:31:18,234 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 267 transitions. [2022-04-28 11:31:18,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:31:18,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:31:18,235 INFO L74 IsIncluded]: Start isIncluded. First operand has 216 states, 138 states have (on average 1.1376811594202898) internal successors, (157), 140 states have internal predecessors, (157), 52 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) Second operand 223 states. [2022-04-28 11:31:18,235 INFO L87 Difference]: Start difference. First operand has 216 states, 138 states have (on average 1.1376811594202898) internal successors, (157), 140 states have internal predecessors, (157), 52 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) Second operand 223 states. [2022-04-28 11:31:18,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:31:18,238 INFO L93 Difference]: Finished difference Result 223 states and 267 transitions. [2022-04-28 11:31:18,238 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 267 transitions. [2022-04-28 11:31:18,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:31:18,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:31:18,239 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:31:18,239 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:31:18,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 138 states have (on average 1.1376811594202898) internal successors, (157), 140 states have internal predecessors, (157), 52 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2022-04-28 11:31:18,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 259 transitions. [2022-04-28 11:31:18,243 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 259 transitions. Word has length 114 [2022-04-28 11:31:18,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:31:18,243 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 259 transitions. [2022-04-28 11:31:18,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 6 states have call predecessors, (17), 7 states have call successors, (17) [2022-04-28 11:31:18,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 216 states and 259 transitions. [2022-04-28 11:31:18,627 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 259 edges. 259 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:31:18,627 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 259 transitions. [2022-04-28 11:31:18,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-28 11:31:18,627 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:31:18,628 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:31:18,644 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 11:31:18,828 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 11:31:18,828 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:31:18,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:31:18,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1338024082, now seen corresponding path program 5 times [2022-04-28 11:31:18,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:31:18,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [53381442] [2022-04-28 11:32:00,035 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:32:00,035 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:32:00,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1338024082, now seen corresponding path program 6 times [2022-04-28 11:32:00,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:32:00,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929330884] [2022-04-28 11:32:00,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:32:00,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:32:00,046 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:32:00,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2007628828] [2022-04-28 11:32:00,046 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:32:00,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:32:00,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:32:00,047 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 11:32:00,048 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 11:32:00,121 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-28 11:32:00,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:32:00,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 11:32:00,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:32:00,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:32:00,740 INFO L272 TraceCheckUtils]: 0: Hoare triple {18533#true} call ULTIMATE.init(); {18533#true} is VALID [2022-04-28 11:32:00,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {18533#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {18533#true} is VALID [2022-04-28 11:32:00,740 INFO L290 TraceCheckUtils]: 2: Hoare triple {18533#true} assume true; {18533#true} is VALID [2022-04-28 11:32:00,740 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18533#true} {18533#true} #93#return; {18533#true} is VALID [2022-04-28 11:32:00,740 INFO L272 TraceCheckUtils]: 4: Hoare triple {18533#true} call #t~ret8 := main(); {18533#true} is VALID [2022-04-28 11:32:00,740 INFO L290 TraceCheckUtils]: 5: Hoare triple {18533#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {18533#true} is VALID [2022-04-28 11:32:00,740 INFO L272 TraceCheckUtils]: 6: Hoare triple {18533#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {18533#true} is VALID [2022-04-28 11:32:00,740 INFO L290 TraceCheckUtils]: 7: Hoare triple {18533#true} ~cond := #in~cond; {18533#true} is VALID [2022-04-28 11:32:00,740 INFO L290 TraceCheckUtils]: 8: Hoare triple {18533#true} assume !(0 == ~cond); {18533#true} is VALID [2022-04-28 11:32:00,741 INFO L290 TraceCheckUtils]: 9: Hoare triple {18533#true} assume true; {18533#true} is VALID [2022-04-28 11:32:00,741 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18533#true} {18533#true} #77#return; {18533#true} is VALID [2022-04-28 11:32:00,741 INFO L290 TraceCheckUtils]: 11: Hoare triple {18533#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:32:00,741 INFO L290 TraceCheckUtils]: 12: Hoare triple {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:32:00,741 INFO L290 TraceCheckUtils]: 13: Hoare triple {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 5);havoc #t~post6; {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:32:00,742 INFO L272 TraceCheckUtils]: 14: Hoare triple {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {18533#true} is VALID [2022-04-28 11:32:00,742 INFO L290 TraceCheckUtils]: 15: Hoare triple {18533#true} ~cond := #in~cond; {18533#true} is VALID [2022-04-28 11:32:00,742 INFO L290 TraceCheckUtils]: 16: Hoare triple {18533#true} assume !(0 == ~cond); {18533#true} is VALID [2022-04-28 11:32:00,742 INFO L290 TraceCheckUtils]: 17: Hoare triple {18533#true} assume true; {18533#true} is VALID [2022-04-28 11:32:00,742 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {18533#true} {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #79#return; {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:32:00,742 INFO L272 TraceCheckUtils]: 19: Hoare triple {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {18533#true} is VALID [2022-04-28 11:32:00,742 INFO L290 TraceCheckUtils]: 20: Hoare triple {18533#true} ~cond := #in~cond; {18533#true} is VALID [2022-04-28 11:32:00,742 INFO L290 TraceCheckUtils]: 21: Hoare triple {18533#true} assume !(0 == ~cond); {18533#true} is VALID [2022-04-28 11:32:00,742 INFO L290 TraceCheckUtils]: 22: Hoare triple {18533#true} assume true; {18533#true} is VALID [2022-04-28 11:32:00,743 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {18533#true} {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #81#return; {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:32:00,743 INFO L290 TraceCheckUtils]: 24: Hoare triple {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:32:00,743 INFO L290 TraceCheckUtils]: 25: Hoare triple {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:32:00,744 INFO L290 TraceCheckUtils]: 26: Hoare triple {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post7 < 5);havoc #t~post7; {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:32:00,744 INFO L272 TraceCheckUtils]: 27: Hoare triple {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {18533#true} is VALID [2022-04-28 11:32:00,744 INFO L290 TraceCheckUtils]: 28: Hoare triple {18533#true} ~cond := #in~cond; {18533#true} is VALID [2022-04-28 11:32:00,744 INFO L290 TraceCheckUtils]: 29: Hoare triple {18533#true} assume !(0 == ~cond); {18533#true} is VALID [2022-04-28 11:32:00,744 INFO L290 TraceCheckUtils]: 30: Hoare triple {18533#true} assume true; {18533#true} is VALID [2022-04-28 11:32:00,744 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {18533#true} {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #83#return; {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:32:00,744 INFO L272 TraceCheckUtils]: 32: Hoare triple {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {18533#true} is VALID [2022-04-28 11:32:00,744 INFO L290 TraceCheckUtils]: 33: Hoare triple {18533#true} ~cond := #in~cond; {18533#true} is VALID [2022-04-28 11:32:00,745 INFO L290 TraceCheckUtils]: 34: Hoare triple {18533#true} assume !(0 == ~cond); {18533#true} is VALID [2022-04-28 11:32:00,745 INFO L290 TraceCheckUtils]: 35: Hoare triple {18533#true} assume true; {18533#true} is VALID [2022-04-28 11:32:00,745 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {18533#true} {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #85#return; {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:32:00,745 INFO L272 TraceCheckUtils]: 37: Hoare triple {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {18533#true} is VALID [2022-04-28 11:32:00,745 INFO L290 TraceCheckUtils]: 38: Hoare triple {18533#true} ~cond := #in~cond; {18533#true} is VALID [2022-04-28 11:32:00,745 INFO L290 TraceCheckUtils]: 39: Hoare triple {18533#true} assume !(0 == ~cond); {18533#true} is VALID [2022-04-28 11:32:00,745 INFO L290 TraceCheckUtils]: 40: Hoare triple {18533#true} assume true; {18533#true} is VALID [2022-04-28 11:32:00,746 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {18533#true} {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #87#return; {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:32:00,746 INFO L290 TraceCheckUtils]: 42: Hoare triple {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= 2 * ~b~0); {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:32:00,746 INFO L272 TraceCheckUtils]: 43: Hoare triple {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {18533#true} is VALID [2022-04-28 11:32:00,746 INFO L290 TraceCheckUtils]: 44: Hoare triple {18533#true} ~cond := #in~cond; {18533#true} is VALID [2022-04-28 11:32:00,746 INFO L290 TraceCheckUtils]: 45: Hoare triple {18533#true} assume !(0 == ~cond); {18533#true} is VALID [2022-04-28 11:32:00,746 INFO L290 TraceCheckUtils]: 46: Hoare triple {18533#true} assume true; {18533#true} is VALID [2022-04-28 11:32:00,746 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {18533#true} {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #89#return; {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:32:00,747 INFO L290 TraceCheckUtils]: 48: Hoare triple {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:32:00,747 INFO L290 TraceCheckUtils]: 49: Hoare triple {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:32:00,747 INFO L290 TraceCheckUtils]: 50: Hoare triple {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post7 < 5);havoc #t~post7; {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:32:00,747 INFO L272 TraceCheckUtils]: 51: Hoare triple {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {18533#true} is VALID [2022-04-28 11:32:00,747 INFO L290 TraceCheckUtils]: 52: Hoare triple {18533#true} ~cond := #in~cond; {18533#true} is VALID [2022-04-28 11:32:00,747 INFO L290 TraceCheckUtils]: 53: Hoare triple {18533#true} assume !(0 == ~cond); {18533#true} is VALID [2022-04-28 11:32:00,748 INFO L290 TraceCheckUtils]: 54: Hoare triple {18533#true} assume true; {18533#true} is VALID [2022-04-28 11:32:00,748 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {18533#true} {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #83#return; {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:32:00,748 INFO L272 TraceCheckUtils]: 56: Hoare triple {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {18533#true} is VALID [2022-04-28 11:32:00,748 INFO L290 TraceCheckUtils]: 57: Hoare triple {18533#true} ~cond := #in~cond; {18533#true} is VALID [2022-04-28 11:32:00,748 INFO L290 TraceCheckUtils]: 58: Hoare triple {18533#true} assume !(0 == ~cond); {18533#true} is VALID [2022-04-28 11:32:00,748 INFO L290 TraceCheckUtils]: 59: Hoare triple {18533#true} assume true; {18533#true} is VALID [2022-04-28 11:32:00,749 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {18533#true} {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #85#return; {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:32:00,749 INFO L272 TraceCheckUtils]: 61: Hoare triple {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {18533#true} is VALID [2022-04-28 11:32:00,749 INFO L290 TraceCheckUtils]: 62: Hoare triple {18533#true} ~cond := #in~cond; {18533#true} is VALID [2022-04-28 11:32:00,749 INFO L290 TraceCheckUtils]: 63: Hoare triple {18533#true} assume !(0 == ~cond); {18533#true} is VALID [2022-04-28 11:32:00,749 INFO L290 TraceCheckUtils]: 64: Hoare triple {18533#true} assume true; {18533#true} is VALID [2022-04-28 11:32:00,749 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {18533#true} {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #87#return; {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:32:00,749 INFO L290 TraceCheckUtils]: 66: Hoare triple {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= 2 * ~b~0); {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:32:00,750 INFO L272 TraceCheckUtils]: 67: Hoare triple {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {18533#true} is VALID [2022-04-28 11:32:00,750 INFO L290 TraceCheckUtils]: 68: Hoare triple {18533#true} ~cond := #in~cond; {18533#true} is VALID [2022-04-28 11:32:00,750 INFO L290 TraceCheckUtils]: 69: Hoare triple {18533#true} assume !(0 == ~cond); {18533#true} is VALID [2022-04-28 11:32:00,750 INFO L290 TraceCheckUtils]: 70: Hoare triple {18533#true} assume true; {18533#true} is VALID [2022-04-28 11:32:00,750 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {18533#true} {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #89#return; {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:32:00,750 INFO L290 TraceCheckUtils]: 72: Hoare triple {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:32:00,751 INFO L290 TraceCheckUtils]: 73: Hoare triple {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:32:00,751 INFO L290 TraceCheckUtils]: 74: Hoare triple {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post7 < 5);havoc #t~post7; {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:32:00,751 INFO L272 TraceCheckUtils]: 75: Hoare triple {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {18533#true} is VALID [2022-04-28 11:32:00,751 INFO L290 TraceCheckUtils]: 76: Hoare triple {18533#true} ~cond := #in~cond; {18533#true} is VALID [2022-04-28 11:32:00,751 INFO L290 TraceCheckUtils]: 77: Hoare triple {18533#true} assume !(0 == ~cond); {18533#true} is VALID [2022-04-28 11:32:00,751 INFO L290 TraceCheckUtils]: 78: Hoare triple {18533#true} assume true; {18533#true} is VALID [2022-04-28 11:32:00,752 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {18533#true} {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #83#return; {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:32:00,752 INFO L272 TraceCheckUtils]: 80: Hoare triple {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {18533#true} is VALID [2022-04-28 11:32:00,752 INFO L290 TraceCheckUtils]: 81: Hoare triple {18533#true} ~cond := #in~cond; {18533#true} is VALID [2022-04-28 11:32:00,752 INFO L290 TraceCheckUtils]: 82: Hoare triple {18533#true} assume !(0 == ~cond); {18533#true} is VALID [2022-04-28 11:32:00,752 INFO L290 TraceCheckUtils]: 83: Hoare triple {18533#true} assume true; {18533#true} is VALID [2022-04-28 11:32:00,752 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {18533#true} {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #85#return; {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:32:00,752 INFO L272 TraceCheckUtils]: 85: Hoare triple {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {18533#true} is VALID [2022-04-28 11:32:00,752 INFO L290 TraceCheckUtils]: 86: Hoare triple {18533#true} ~cond := #in~cond; {18533#true} is VALID [2022-04-28 11:32:00,752 INFO L290 TraceCheckUtils]: 87: Hoare triple {18533#true} assume !(0 == ~cond); {18533#true} is VALID [2022-04-28 11:32:00,752 INFO L290 TraceCheckUtils]: 88: Hoare triple {18533#true} assume true; {18533#true} is VALID [2022-04-28 11:32:00,753 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {18533#true} {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #87#return; {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:32:00,753 INFO L290 TraceCheckUtils]: 90: Hoare triple {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= 2 * ~b~0); {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:32:00,753 INFO L272 TraceCheckUtils]: 91: Hoare triple {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {18533#true} is VALID [2022-04-28 11:32:00,753 INFO L290 TraceCheckUtils]: 92: Hoare triple {18533#true} ~cond := #in~cond; {18533#true} is VALID [2022-04-28 11:32:00,753 INFO L290 TraceCheckUtils]: 93: Hoare triple {18533#true} assume !(0 == ~cond); {18533#true} is VALID [2022-04-28 11:32:00,753 INFO L290 TraceCheckUtils]: 94: Hoare triple {18533#true} assume true; {18533#true} is VALID [2022-04-28 11:32:00,754 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {18533#true} {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #89#return; {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:32:00,754 INFO L290 TraceCheckUtils]: 96: Hoare triple {18571#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {18827#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:32:00,755 INFO L290 TraceCheckUtils]: 97: Hoare triple {18827#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18827#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:32:00,755 INFO L290 TraceCheckUtils]: 98: Hoare triple {18827#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post7 < 5);havoc #t~post7; {18827#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:32:00,755 INFO L272 TraceCheckUtils]: 99: Hoare triple {18827#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {18533#true} is VALID [2022-04-28 11:32:00,755 INFO L290 TraceCheckUtils]: 100: Hoare triple {18533#true} ~cond := #in~cond; {18840#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:32:00,756 INFO L290 TraceCheckUtils]: 101: Hoare triple {18840#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {18844#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:32:00,756 INFO L290 TraceCheckUtils]: 102: Hoare triple {18844#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18844#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:32:00,757 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {18844#(not (= |__VERIFIER_assert_#in~cond| 0))} {18827#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~q~0 0))} #83#return; {18851#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} is VALID [2022-04-28 11:32:00,757 INFO L272 TraceCheckUtils]: 104: Hoare triple {18851#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {18533#true} is VALID [2022-04-28 11:32:00,757 INFO L290 TraceCheckUtils]: 105: Hoare triple {18533#true} ~cond := #in~cond; {18533#true} is VALID [2022-04-28 11:32:00,757 INFO L290 TraceCheckUtils]: 106: Hoare triple {18533#true} assume !(0 == ~cond); {18533#true} is VALID [2022-04-28 11:32:00,757 INFO L290 TraceCheckUtils]: 107: Hoare triple {18533#true} assume true; {18533#true} is VALID [2022-04-28 11:32:00,758 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {18533#true} {18851#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} #85#return; {18851#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} is VALID [2022-04-28 11:32:00,758 INFO L272 TraceCheckUtils]: 109: Hoare triple {18851#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {18533#true} is VALID [2022-04-28 11:32:00,758 INFO L290 TraceCheckUtils]: 110: Hoare triple {18533#true} ~cond := #in~cond; {18533#true} is VALID [2022-04-28 11:32:00,758 INFO L290 TraceCheckUtils]: 111: Hoare triple {18533#true} assume !(0 == ~cond); {18533#true} is VALID [2022-04-28 11:32:00,758 INFO L290 TraceCheckUtils]: 112: Hoare triple {18533#true} assume true; {18533#true} is VALID [2022-04-28 11:32:00,765 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {18533#true} {18851#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} #87#return; {18851#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} is VALID [2022-04-28 11:32:00,765 INFO L290 TraceCheckUtils]: 114: Hoare triple {18851#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} assume !(~r~0 >= 2 * ~b~0); {18851#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} is VALID [2022-04-28 11:32:00,767 INFO L290 TraceCheckUtils]: 115: Hoare triple {18851#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {18888#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0)) (= (mod main_~q~0 2) 0))} is VALID [2022-04-28 11:32:00,768 INFO L290 TraceCheckUtils]: 116: Hoare triple {18888#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0)) (= (mod main_~q~0 2) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18888#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0)) (= (mod main_~q~0 2) 0))} is VALID [2022-04-28 11:32:00,768 INFO L290 TraceCheckUtils]: 117: Hoare triple {18888#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0)) (= (mod main_~q~0 2) 0))} assume !(#t~post6 < 5);havoc #t~post6; {18888#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0)) (= (mod main_~q~0 2) 0))} is VALID [2022-04-28 11:32:00,768 INFO L272 TraceCheckUtils]: 118: Hoare triple {18888#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0)) (= (mod main_~q~0 2) 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {18898#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:32:00,769 INFO L290 TraceCheckUtils]: 119: Hoare triple {18898#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18902#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:32:00,769 INFO L290 TraceCheckUtils]: 120: Hoare triple {18902#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18534#false} is VALID [2022-04-28 11:32:00,769 INFO L290 TraceCheckUtils]: 121: Hoare triple {18534#false} assume !false; {18534#false} is VALID [2022-04-28 11:32:00,769 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 93 proven. 9 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2022-04-28 11:32:00,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:32:07,145 INFO L290 TraceCheckUtils]: 121: Hoare triple {18534#false} assume !false; {18534#false} is VALID [2022-04-28 11:32:07,146 INFO L290 TraceCheckUtils]: 120: Hoare triple {18902#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18534#false} is VALID [2022-04-28 11:32:07,146 INFO L290 TraceCheckUtils]: 119: Hoare triple {18898#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18902#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:32:07,147 INFO L272 TraceCheckUtils]: 118: Hoare triple {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {18898#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:32:07,147 INFO L290 TraceCheckUtils]: 117: Hoare triple {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !(#t~post6 < 5);havoc #t~post6; {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:32:07,147 INFO L290 TraceCheckUtils]: 116: Hoare triple {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:32:07,154 INFO L290 TraceCheckUtils]: 115: Hoare triple {18928#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:32:07,155 INFO L290 TraceCheckUtils]: 114: Hoare triple {18928#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} assume !(~r~0 >= 2 * ~b~0); {18928#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:32:07,155 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {18533#true} {18928#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} #87#return; {18928#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:32:07,155 INFO L290 TraceCheckUtils]: 112: Hoare triple {18533#true} assume true; {18533#true} is VALID [2022-04-28 11:32:07,155 INFO L290 TraceCheckUtils]: 111: Hoare triple {18533#true} assume !(0 == ~cond); {18533#true} is VALID [2022-04-28 11:32:07,155 INFO L290 TraceCheckUtils]: 110: Hoare triple {18533#true} ~cond := #in~cond; {18533#true} is VALID [2022-04-28 11:32:07,155 INFO L272 TraceCheckUtils]: 109: Hoare triple {18928#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {18533#true} is VALID [2022-04-28 11:32:07,156 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {18533#true} {18928#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} #85#return; {18928#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:32:07,156 INFO L290 TraceCheckUtils]: 107: Hoare triple {18533#true} assume true; {18533#true} is VALID [2022-04-28 11:32:07,156 INFO L290 TraceCheckUtils]: 106: Hoare triple {18533#true} assume !(0 == ~cond); {18533#true} is VALID [2022-04-28 11:32:07,156 INFO L290 TraceCheckUtils]: 105: Hoare triple {18533#true} ~cond := #in~cond; {18533#true} is VALID [2022-04-28 11:32:07,156 INFO L272 TraceCheckUtils]: 104: Hoare triple {18928#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {18533#true} is VALID [2022-04-28 11:32:07,157 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {18844#(not (= |__VERIFIER_assert_#in~cond| 0))} {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #83#return; {18928#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:32:07,157 INFO L290 TraceCheckUtils]: 102: Hoare triple {18844#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18844#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:32:07,157 INFO L290 TraceCheckUtils]: 101: Hoare triple {18974#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {18844#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:32:07,158 INFO L290 TraceCheckUtils]: 100: Hoare triple {18533#true} ~cond := #in~cond; {18974#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:32:07,158 INFO L272 TraceCheckUtils]: 99: Hoare triple {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {18533#true} is VALID [2022-04-28 11:32:07,158 INFO L290 TraceCheckUtils]: 98: Hoare triple {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(#t~post7 < 5);havoc #t~post7; {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:32:07,158 INFO L290 TraceCheckUtils]: 97: Hoare triple {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:32:07,159 INFO L290 TraceCheckUtils]: 96: Hoare triple {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:32:07,159 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {18533#true} {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #89#return; {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:32:07,159 INFO L290 TraceCheckUtils]: 94: Hoare triple {18533#true} assume true; {18533#true} is VALID [2022-04-28 11:32:07,159 INFO L290 TraceCheckUtils]: 93: Hoare triple {18533#true} assume !(0 == ~cond); {18533#true} is VALID [2022-04-28 11:32:07,159 INFO L290 TraceCheckUtils]: 92: Hoare triple {18533#true} ~cond := #in~cond; {18533#true} is VALID [2022-04-28 11:32:07,159 INFO L272 TraceCheckUtils]: 91: Hoare triple {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {18533#true} is VALID [2022-04-28 11:32:07,159 INFO L290 TraceCheckUtils]: 90: Hoare triple {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(~r~0 >= 2 * ~b~0); {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:32:07,160 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {18533#true} {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #87#return; {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:32:07,160 INFO L290 TraceCheckUtils]: 88: Hoare triple {18533#true} assume true; {18533#true} is VALID [2022-04-28 11:32:07,160 INFO L290 TraceCheckUtils]: 87: Hoare triple {18533#true} assume !(0 == ~cond); {18533#true} is VALID [2022-04-28 11:32:07,160 INFO L290 TraceCheckUtils]: 86: Hoare triple {18533#true} ~cond := #in~cond; {18533#true} is VALID [2022-04-28 11:32:07,160 INFO L272 TraceCheckUtils]: 85: Hoare triple {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {18533#true} is VALID [2022-04-28 11:32:07,161 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {18533#true} {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #85#return; {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:32:07,161 INFO L290 TraceCheckUtils]: 83: Hoare triple {18533#true} assume true; {18533#true} is VALID [2022-04-28 11:32:07,161 INFO L290 TraceCheckUtils]: 82: Hoare triple {18533#true} assume !(0 == ~cond); {18533#true} is VALID [2022-04-28 11:32:07,161 INFO L290 TraceCheckUtils]: 81: Hoare triple {18533#true} ~cond := #in~cond; {18533#true} is VALID [2022-04-28 11:32:07,161 INFO L272 TraceCheckUtils]: 80: Hoare triple {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {18533#true} is VALID [2022-04-28 11:32:07,161 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {18533#true} {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #83#return; {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:32:07,161 INFO L290 TraceCheckUtils]: 78: Hoare triple {18533#true} assume true; {18533#true} is VALID [2022-04-28 11:32:07,161 INFO L290 TraceCheckUtils]: 77: Hoare triple {18533#true} assume !(0 == ~cond); {18533#true} is VALID [2022-04-28 11:32:07,161 INFO L290 TraceCheckUtils]: 76: Hoare triple {18533#true} ~cond := #in~cond; {18533#true} is VALID [2022-04-28 11:32:07,161 INFO L272 TraceCheckUtils]: 75: Hoare triple {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {18533#true} is VALID [2022-04-28 11:32:07,162 INFO L290 TraceCheckUtils]: 74: Hoare triple {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(#t~post7 < 5);havoc #t~post7; {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:32:07,162 INFO L290 TraceCheckUtils]: 73: Hoare triple {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:32:07,162 INFO L290 TraceCheckUtils]: 72: Hoare triple {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:32:07,163 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {18533#true} {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #89#return; {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:32:07,163 INFO L290 TraceCheckUtils]: 70: Hoare triple {18533#true} assume true; {18533#true} is VALID [2022-04-28 11:32:07,163 INFO L290 TraceCheckUtils]: 69: Hoare triple {18533#true} assume !(0 == ~cond); {18533#true} is VALID [2022-04-28 11:32:07,163 INFO L290 TraceCheckUtils]: 68: Hoare triple {18533#true} ~cond := #in~cond; {18533#true} is VALID [2022-04-28 11:32:07,163 INFO L272 TraceCheckUtils]: 67: Hoare triple {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {18533#true} is VALID [2022-04-28 11:32:07,163 INFO L290 TraceCheckUtils]: 66: Hoare triple {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(~r~0 >= 2 * ~b~0); {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:32:07,164 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {18533#true} {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #87#return; {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:32:07,164 INFO L290 TraceCheckUtils]: 64: Hoare triple {18533#true} assume true; {18533#true} is VALID [2022-04-28 11:32:07,175 INFO L290 TraceCheckUtils]: 63: Hoare triple {18533#true} assume !(0 == ~cond); {18533#true} is VALID [2022-04-28 11:32:07,176 INFO L290 TraceCheckUtils]: 62: Hoare triple {18533#true} ~cond := #in~cond; {18533#true} is VALID [2022-04-28 11:32:07,176 INFO L272 TraceCheckUtils]: 61: Hoare triple {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {18533#true} is VALID [2022-04-28 11:32:07,177 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {18533#true} {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #85#return; {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:32:07,177 INFO L290 TraceCheckUtils]: 59: Hoare triple {18533#true} assume true; {18533#true} is VALID [2022-04-28 11:32:07,177 INFO L290 TraceCheckUtils]: 58: Hoare triple {18533#true} assume !(0 == ~cond); {18533#true} is VALID [2022-04-28 11:32:07,177 INFO L290 TraceCheckUtils]: 57: Hoare triple {18533#true} ~cond := #in~cond; {18533#true} is VALID [2022-04-28 11:32:07,177 INFO L272 TraceCheckUtils]: 56: Hoare triple {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {18533#true} is VALID [2022-04-28 11:32:07,178 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {18533#true} {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #83#return; {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:32:07,178 INFO L290 TraceCheckUtils]: 54: Hoare triple {18533#true} assume true; {18533#true} is VALID [2022-04-28 11:32:07,178 INFO L290 TraceCheckUtils]: 53: Hoare triple {18533#true} assume !(0 == ~cond); {18533#true} is VALID [2022-04-28 11:32:07,178 INFO L290 TraceCheckUtils]: 52: Hoare triple {18533#true} ~cond := #in~cond; {18533#true} is VALID [2022-04-28 11:32:07,178 INFO L272 TraceCheckUtils]: 51: Hoare triple {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {18533#true} is VALID [2022-04-28 11:32:07,178 INFO L290 TraceCheckUtils]: 50: Hoare triple {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(#t~post7 < 5);havoc #t~post7; {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:32:07,178 INFO L290 TraceCheckUtils]: 49: Hoare triple {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:32:07,179 INFO L290 TraceCheckUtils]: 48: Hoare triple {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:32:07,179 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {18533#true} {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #89#return; {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:32:07,179 INFO L290 TraceCheckUtils]: 46: Hoare triple {18533#true} assume true; {18533#true} is VALID [2022-04-28 11:32:07,179 INFO L290 TraceCheckUtils]: 45: Hoare triple {18533#true} assume !(0 == ~cond); {18533#true} is VALID [2022-04-28 11:32:07,179 INFO L290 TraceCheckUtils]: 44: Hoare triple {18533#true} ~cond := #in~cond; {18533#true} is VALID [2022-04-28 11:32:07,179 INFO L272 TraceCheckUtils]: 43: Hoare triple {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {18533#true} is VALID [2022-04-28 11:32:07,180 INFO L290 TraceCheckUtils]: 42: Hoare triple {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(~r~0 >= 2 * ~b~0); {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:32:07,180 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {18533#true} {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #87#return; {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:32:07,180 INFO L290 TraceCheckUtils]: 40: Hoare triple {18533#true} assume true; {18533#true} is VALID [2022-04-28 11:32:07,180 INFO L290 TraceCheckUtils]: 39: Hoare triple {18533#true} assume !(0 == ~cond); {18533#true} is VALID [2022-04-28 11:32:07,180 INFO L290 TraceCheckUtils]: 38: Hoare triple {18533#true} ~cond := #in~cond; {18533#true} is VALID [2022-04-28 11:32:07,180 INFO L272 TraceCheckUtils]: 37: Hoare triple {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {18533#true} is VALID [2022-04-28 11:32:07,181 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {18533#true} {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #85#return; {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:32:07,181 INFO L290 TraceCheckUtils]: 35: Hoare triple {18533#true} assume true; {18533#true} is VALID [2022-04-28 11:32:07,181 INFO L290 TraceCheckUtils]: 34: Hoare triple {18533#true} assume !(0 == ~cond); {18533#true} is VALID [2022-04-28 11:32:07,181 INFO L290 TraceCheckUtils]: 33: Hoare triple {18533#true} ~cond := #in~cond; {18533#true} is VALID [2022-04-28 11:32:07,181 INFO L272 TraceCheckUtils]: 32: Hoare triple {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {18533#true} is VALID [2022-04-28 11:32:07,181 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {18533#true} {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #83#return; {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:32:07,181 INFO L290 TraceCheckUtils]: 30: Hoare triple {18533#true} assume true; {18533#true} is VALID [2022-04-28 11:32:07,181 INFO L290 TraceCheckUtils]: 29: Hoare triple {18533#true} assume !(0 == ~cond); {18533#true} is VALID [2022-04-28 11:32:07,181 INFO L290 TraceCheckUtils]: 28: Hoare triple {18533#true} ~cond := #in~cond; {18533#true} is VALID [2022-04-28 11:32:07,182 INFO L272 TraceCheckUtils]: 27: Hoare triple {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {18533#true} is VALID [2022-04-28 11:32:07,182 INFO L290 TraceCheckUtils]: 26: Hoare triple {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(#t~post7 < 5);havoc #t~post7; {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:32:07,182 INFO L290 TraceCheckUtils]: 25: Hoare triple {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:32:07,182 INFO L290 TraceCheckUtils]: 24: Hoare triple {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:32:07,183 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {18533#true} {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #81#return; {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:32:07,183 INFO L290 TraceCheckUtils]: 22: Hoare triple {18533#true} assume true; {18533#true} is VALID [2022-04-28 11:32:07,183 INFO L290 TraceCheckUtils]: 21: Hoare triple {18533#true} assume !(0 == ~cond); {18533#true} is VALID [2022-04-28 11:32:07,183 INFO L290 TraceCheckUtils]: 20: Hoare triple {18533#true} ~cond := #in~cond; {18533#true} is VALID [2022-04-28 11:32:07,183 INFO L272 TraceCheckUtils]: 19: Hoare triple {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {18533#true} is VALID [2022-04-28 11:32:07,183 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {18533#true} {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #79#return; {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:32:07,183 INFO L290 TraceCheckUtils]: 17: Hoare triple {18533#true} assume true; {18533#true} is VALID [2022-04-28 11:32:07,184 INFO L290 TraceCheckUtils]: 16: Hoare triple {18533#true} assume !(0 == ~cond); {18533#true} is VALID [2022-04-28 11:32:07,184 INFO L290 TraceCheckUtils]: 15: Hoare triple {18533#true} ~cond := #in~cond; {18533#true} is VALID [2022-04-28 11:32:07,184 INFO L272 TraceCheckUtils]: 14: Hoare triple {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {18533#true} is VALID [2022-04-28 11:32:07,184 INFO L290 TraceCheckUtils]: 13: Hoare triple {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(#t~post6 < 5);havoc #t~post6; {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:32:07,184 INFO L290 TraceCheckUtils]: 12: Hoare triple {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:32:07,184 INFO L290 TraceCheckUtils]: 11: Hoare triple {18533#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {18918#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:32:07,185 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18533#true} {18533#true} #77#return; {18533#true} is VALID [2022-04-28 11:32:07,185 INFO L290 TraceCheckUtils]: 9: Hoare triple {18533#true} assume true; {18533#true} is VALID [2022-04-28 11:32:07,185 INFO L290 TraceCheckUtils]: 8: Hoare triple {18533#true} assume !(0 == ~cond); {18533#true} is VALID [2022-04-28 11:32:07,185 INFO L290 TraceCheckUtils]: 7: Hoare triple {18533#true} ~cond := #in~cond; {18533#true} is VALID [2022-04-28 11:32:07,185 INFO L272 TraceCheckUtils]: 6: Hoare triple {18533#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {18533#true} is VALID [2022-04-28 11:32:07,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {18533#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {18533#true} is VALID [2022-04-28 11:32:07,185 INFO L272 TraceCheckUtils]: 4: Hoare triple {18533#true} call #t~ret8 := main(); {18533#true} is VALID [2022-04-28 11:32:07,185 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18533#true} {18533#true} #93#return; {18533#true} is VALID [2022-04-28 11:32:07,185 INFO L290 TraceCheckUtils]: 2: Hoare triple {18533#true} assume true; {18533#true} is VALID [2022-04-28 11:32:07,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {18533#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {18533#true} is VALID [2022-04-28 11:32:07,185 INFO L272 TraceCheckUtils]: 0: Hoare triple {18533#true} call ULTIMATE.init(); {18533#true} is VALID [2022-04-28 11:32:07,185 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 75 proven. 16 refuted. 0 times theorem prover too weak. 531 trivial. 0 not checked. [2022-04-28 11:32:07,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:32:07,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929330884] [2022-04-28 11:32:07,186 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:32:07,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007628828] [2022-04-28 11:32:07,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007628828] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:32:07,186 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:32:07,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 13 [2022-04-28 11:32:07,186 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:32:07,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [53381442] [2022-04-28 11:32:07,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [53381442] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:32:07,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:32:07,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 11:32:07,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325412330] [2022-04-28 11:32:07,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:32:07,187 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 122 [2022-04-28 11:32:07,187 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:32:07,187 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 11:32:07,233 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 11:32:07,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 11:32:07,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:32:07,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 11:32:07,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-04-28 11:32:07,234 INFO L87 Difference]: Start difference. First operand 216 states and 259 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 11:32:09,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:32:09,069 INFO L93 Difference]: Finished difference Result 250 states and 306 transitions. [2022-04-28 11:32:09,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 11:32:09,069 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 122 [2022-04-28 11:32:09,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:32:09,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 11:32:09,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2022-04-28 11:32:09,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 11:32:09,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2022-04-28 11:32:09,081 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 110 transitions. [2022-04-28 11:32:09,181 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:32:09,185 INFO L225 Difference]: With dead ends: 250 [2022-04-28 11:32:09,185 INFO L226 Difference]: Without dead ends: 247 [2022-04-28 11:32:09,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 230 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-04-28 11:32:09,186 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 31 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 11:32:09,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 202 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 11:32:09,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-04-28 11:32:09,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 244. [2022-04-28 11:32:09,495 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:32:09,495 INFO L82 GeneralOperation]: Start isEquivalent. First operand 247 states. Second operand has 244 states, 155 states have (on average 1.1483870967741936) internal successors, (178), 157 states have internal predecessors, (178), 61 states have call successors, (61), 28 states have call predecessors, (61), 27 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2022-04-28 11:32:09,496 INFO L74 IsIncluded]: Start isIncluded. First operand 247 states. Second operand has 244 states, 155 states have (on average 1.1483870967741936) internal successors, (178), 157 states have internal predecessors, (178), 61 states have call successors, (61), 28 states have call predecessors, (61), 27 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2022-04-28 11:32:09,496 INFO L87 Difference]: Start difference. First operand 247 states. Second operand has 244 states, 155 states have (on average 1.1483870967741936) internal successors, (178), 157 states have internal predecessors, (178), 61 states have call successors, (61), 28 states have call predecessors, (61), 27 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2022-04-28 11:32:09,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:32:09,499 INFO L93 Difference]: Finished difference Result 247 states and 301 transitions. [2022-04-28 11:32:09,499 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 301 transitions. [2022-04-28 11:32:09,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:32:09,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:32:09,500 INFO L74 IsIncluded]: Start isIncluded. First operand has 244 states, 155 states have (on average 1.1483870967741936) internal successors, (178), 157 states have internal predecessors, (178), 61 states have call successors, (61), 28 states have call predecessors, (61), 27 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) Second operand 247 states. [2022-04-28 11:32:09,500 INFO L87 Difference]: Start difference. First operand has 244 states, 155 states have (on average 1.1483870967741936) internal successors, (178), 157 states have internal predecessors, (178), 61 states have call successors, (61), 28 states have call predecessors, (61), 27 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) Second operand 247 states. [2022-04-28 11:32:09,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:32:09,504 INFO L93 Difference]: Finished difference Result 247 states and 301 transitions. [2022-04-28 11:32:09,504 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 301 transitions. [2022-04-28 11:32:09,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:32:09,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:32:09,504 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:32:09,504 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:32:09,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 155 states have (on average 1.1483870967741936) internal successors, (178), 157 states have internal predecessors, (178), 61 states have call successors, (61), 28 states have call predecessors, (61), 27 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2022-04-28 11:32:09,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 298 transitions. [2022-04-28 11:32:09,508 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 298 transitions. Word has length 122 [2022-04-28 11:32:09,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:32:09,508 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 298 transitions. [2022-04-28 11:32:09,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 11:32:09,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 244 states and 298 transitions. [2022-04-28 11:32:09,916 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 298 edges. 298 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:32:09,916 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 298 transitions. [2022-04-28 11:32:09,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-04-28 11:32:09,917 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:32:09,917 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:32:09,935 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 11:32:10,133 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 11:32:10,133 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:32:10,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:32:10,134 INFO L85 PathProgramCache]: Analyzing trace with hash -877539457, now seen corresponding path program 5 times [2022-04-28 11:32:10,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:32:10,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1066704762] [2022-04-28 11:32:43,001 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:32:43,001 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:32:43,001 INFO L85 PathProgramCache]: Analyzing trace with hash -877539457, now seen corresponding path program 6 times [2022-04-28 11:32:43,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:32:43,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045965409] [2022-04-28 11:32:43,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:32:43,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:32:43,018 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:32:43,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1383211600] [2022-04-28 11:32:43,019 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:32:43,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:32:43,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:32:43,020 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 11:32:43,023 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 11:32:43,075 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 11:32:43,075 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:32:43,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 11:32:43,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:32:43,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:32:43,302 INFO L272 TraceCheckUtils]: 0: Hoare triple {20763#true} call ULTIMATE.init(); {20763#true} is VALID [2022-04-28 11:32:43,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {20763#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {20763#true} is VALID [2022-04-28 11:32:43,303 INFO L290 TraceCheckUtils]: 2: Hoare triple {20763#true} assume true; {20763#true} is VALID [2022-04-28 11:32:43,303 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20763#true} {20763#true} #93#return; {20763#true} is VALID [2022-04-28 11:32:43,303 INFO L272 TraceCheckUtils]: 4: Hoare triple {20763#true} call #t~ret8 := main(); {20763#true} is VALID [2022-04-28 11:32:43,303 INFO L290 TraceCheckUtils]: 5: Hoare triple {20763#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {20763#true} is VALID [2022-04-28 11:32:43,303 INFO L272 TraceCheckUtils]: 6: Hoare triple {20763#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {20763#true} is VALID [2022-04-28 11:32:43,303 INFO L290 TraceCheckUtils]: 7: Hoare triple {20763#true} ~cond := #in~cond; {20763#true} is VALID [2022-04-28 11:32:43,303 INFO L290 TraceCheckUtils]: 8: Hoare triple {20763#true} assume !(0 == ~cond); {20763#true} is VALID [2022-04-28 11:32:43,303 INFO L290 TraceCheckUtils]: 9: Hoare triple {20763#true} assume true; {20763#true} is VALID [2022-04-28 11:32:43,303 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20763#true} {20763#true} #77#return; {20763#true} is VALID [2022-04-28 11:32:43,303 INFO L290 TraceCheckUtils]: 11: Hoare triple {20763#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {20763#true} is VALID [2022-04-28 11:32:43,303 INFO L290 TraceCheckUtils]: 12: Hoare triple {20763#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20763#true} is VALID [2022-04-28 11:32:43,303 INFO L290 TraceCheckUtils]: 13: Hoare triple {20763#true} assume !!(#t~post6 < 5);havoc #t~post6; {20763#true} is VALID [2022-04-28 11:32:43,303 INFO L272 TraceCheckUtils]: 14: Hoare triple {20763#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {20763#true} is VALID [2022-04-28 11:32:43,303 INFO L290 TraceCheckUtils]: 15: Hoare triple {20763#true} ~cond := #in~cond; {20763#true} is VALID [2022-04-28 11:32:43,303 INFO L290 TraceCheckUtils]: 16: Hoare triple {20763#true} assume !(0 == ~cond); {20763#true} is VALID [2022-04-28 11:32:43,303 INFO L290 TraceCheckUtils]: 17: Hoare triple {20763#true} assume true; {20763#true} is VALID [2022-04-28 11:32:43,304 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {20763#true} {20763#true} #79#return; {20763#true} is VALID [2022-04-28 11:32:43,304 INFO L272 TraceCheckUtils]: 19: Hoare triple {20763#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {20763#true} is VALID [2022-04-28 11:32:43,304 INFO L290 TraceCheckUtils]: 20: Hoare triple {20763#true} ~cond := #in~cond; {20763#true} is VALID [2022-04-28 11:32:43,304 INFO L290 TraceCheckUtils]: 21: Hoare triple {20763#true} assume !(0 == ~cond); {20763#true} is VALID [2022-04-28 11:32:43,304 INFO L290 TraceCheckUtils]: 22: Hoare triple {20763#true} assume true; {20763#true} is VALID [2022-04-28 11:32:43,304 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {20763#true} {20763#true} #81#return; {20763#true} is VALID [2022-04-28 11:32:43,304 INFO L290 TraceCheckUtils]: 24: Hoare triple {20763#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {20763#true} is VALID [2022-04-28 11:32:43,304 INFO L290 TraceCheckUtils]: 25: Hoare triple {20763#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20763#true} is VALID [2022-04-28 11:32:43,304 INFO L290 TraceCheckUtils]: 26: Hoare triple {20763#true} assume !!(#t~post7 < 5);havoc #t~post7; {20763#true} is VALID [2022-04-28 11:32:43,304 INFO L272 TraceCheckUtils]: 27: Hoare triple {20763#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {20763#true} is VALID [2022-04-28 11:32:43,304 INFO L290 TraceCheckUtils]: 28: Hoare triple {20763#true} ~cond := #in~cond; {20763#true} is VALID [2022-04-28 11:32:43,304 INFO L290 TraceCheckUtils]: 29: Hoare triple {20763#true} assume !(0 == ~cond); {20763#true} is VALID [2022-04-28 11:32:43,304 INFO L290 TraceCheckUtils]: 30: Hoare triple {20763#true} assume true; {20763#true} is VALID [2022-04-28 11:32:43,304 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {20763#true} {20763#true} #83#return; {20763#true} is VALID [2022-04-28 11:32:43,304 INFO L272 TraceCheckUtils]: 32: Hoare triple {20763#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {20763#true} is VALID [2022-04-28 11:32:43,304 INFO L290 TraceCheckUtils]: 33: Hoare triple {20763#true} ~cond := #in~cond; {20763#true} is VALID [2022-04-28 11:32:43,304 INFO L290 TraceCheckUtils]: 34: Hoare triple {20763#true} assume !(0 == ~cond); {20763#true} is VALID [2022-04-28 11:32:43,304 INFO L290 TraceCheckUtils]: 35: Hoare triple {20763#true} assume true; {20763#true} is VALID [2022-04-28 11:32:43,304 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {20763#true} {20763#true} #85#return; {20763#true} is VALID [2022-04-28 11:32:43,304 INFO L272 TraceCheckUtils]: 37: Hoare triple {20763#true} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {20763#true} is VALID [2022-04-28 11:32:43,305 INFO L290 TraceCheckUtils]: 38: Hoare triple {20763#true} ~cond := #in~cond; {20763#true} is VALID [2022-04-28 11:32:43,305 INFO L290 TraceCheckUtils]: 39: Hoare triple {20763#true} assume !(0 == ~cond); {20763#true} is VALID [2022-04-28 11:32:43,305 INFO L290 TraceCheckUtils]: 40: Hoare triple {20763#true} assume true; {20763#true} is VALID [2022-04-28 11:32:43,305 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {20763#true} {20763#true} #87#return; {20763#true} is VALID [2022-04-28 11:32:43,305 INFO L290 TraceCheckUtils]: 42: Hoare triple {20763#true} assume !!(~r~0 >= 2 * ~b~0); {20763#true} is VALID [2022-04-28 11:32:43,305 INFO L272 TraceCheckUtils]: 43: Hoare triple {20763#true} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {20763#true} is VALID [2022-04-28 11:32:43,305 INFO L290 TraceCheckUtils]: 44: Hoare triple {20763#true} ~cond := #in~cond; {20763#true} is VALID [2022-04-28 11:32:43,305 INFO L290 TraceCheckUtils]: 45: Hoare triple {20763#true} assume !(0 == ~cond); {20763#true} is VALID [2022-04-28 11:32:43,305 INFO L290 TraceCheckUtils]: 46: Hoare triple {20763#true} assume true; {20763#true} is VALID [2022-04-28 11:32:43,305 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {20763#true} {20763#true} #89#return; {20763#true} is VALID [2022-04-28 11:32:43,305 INFO L290 TraceCheckUtils]: 48: Hoare triple {20763#true} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {20763#true} is VALID [2022-04-28 11:32:43,305 INFO L290 TraceCheckUtils]: 49: Hoare triple {20763#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20763#true} is VALID [2022-04-28 11:32:43,305 INFO L290 TraceCheckUtils]: 50: Hoare triple {20763#true} assume !!(#t~post7 < 5);havoc #t~post7; {20763#true} is VALID [2022-04-28 11:32:43,305 INFO L272 TraceCheckUtils]: 51: Hoare triple {20763#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {20763#true} is VALID [2022-04-28 11:32:43,305 INFO L290 TraceCheckUtils]: 52: Hoare triple {20763#true} ~cond := #in~cond; {20763#true} is VALID [2022-04-28 11:32:43,305 INFO L290 TraceCheckUtils]: 53: Hoare triple {20763#true} assume !(0 == ~cond); {20763#true} is VALID [2022-04-28 11:32:43,305 INFO L290 TraceCheckUtils]: 54: Hoare triple {20763#true} assume true; {20763#true} is VALID [2022-04-28 11:32:43,305 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {20763#true} {20763#true} #83#return; {20763#true} is VALID [2022-04-28 11:32:43,305 INFO L272 TraceCheckUtils]: 56: Hoare triple {20763#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {20763#true} is VALID [2022-04-28 11:32:43,305 INFO L290 TraceCheckUtils]: 57: Hoare triple {20763#true} ~cond := #in~cond; {20763#true} is VALID [2022-04-28 11:32:43,306 INFO L290 TraceCheckUtils]: 58: Hoare triple {20763#true} assume !(0 == ~cond); {20763#true} is VALID [2022-04-28 11:32:43,306 INFO L290 TraceCheckUtils]: 59: Hoare triple {20763#true} assume true; {20763#true} is VALID [2022-04-28 11:32:43,306 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {20763#true} {20763#true} #85#return; {20763#true} is VALID [2022-04-28 11:32:43,306 INFO L272 TraceCheckUtils]: 61: Hoare triple {20763#true} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {20763#true} is VALID [2022-04-28 11:32:43,306 INFO L290 TraceCheckUtils]: 62: Hoare triple {20763#true} ~cond := #in~cond; {20763#true} is VALID [2022-04-28 11:32:43,306 INFO L290 TraceCheckUtils]: 63: Hoare triple {20763#true} assume !(0 == ~cond); {20763#true} is VALID [2022-04-28 11:32:43,306 INFO L290 TraceCheckUtils]: 64: Hoare triple {20763#true} assume true; {20763#true} is VALID [2022-04-28 11:32:43,306 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {20763#true} {20763#true} #87#return; {20763#true} is VALID [2022-04-28 11:32:43,306 INFO L290 TraceCheckUtils]: 66: Hoare triple {20763#true} assume !!(~r~0 >= 2 * ~b~0); {20763#true} is VALID [2022-04-28 11:32:43,306 INFO L272 TraceCheckUtils]: 67: Hoare triple {20763#true} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {20763#true} is VALID [2022-04-28 11:32:43,306 INFO L290 TraceCheckUtils]: 68: Hoare triple {20763#true} ~cond := #in~cond; {20763#true} is VALID [2022-04-28 11:32:43,306 INFO L290 TraceCheckUtils]: 69: Hoare triple {20763#true} assume !(0 == ~cond); {20763#true} is VALID [2022-04-28 11:32:43,306 INFO L290 TraceCheckUtils]: 70: Hoare triple {20763#true} assume true; {20763#true} is VALID [2022-04-28 11:32:43,306 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {20763#true} {20763#true} #89#return; {20763#true} is VALID [2022-04-28 11:32:43,306 INFO L290 TraceCheckUtils]: 72: Hoare triple {20763#true} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {20763#true} is VALID [2022-04-28 11:32:43,306 INFO L290 TraceCheckUtils]: 73: Hoare triple {20763#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20763#true} is VALID [2022-04-28 11:32:43,306 INFO L290 TraceCheckUtils]: 74: Hoare triple {20763#true} assume !!(#t~post7 < 5);havoc #t~post7; {20763#true} is VALID [2022-04-28 11:32:43,306 INFO L272 TraceCheckUtils]: 75: Hoare triple {20763#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {20763#true} is VALID [2022-04-28 11:32:43,306 INFO L290 TraceCheckUtils]: 76: Hoare triple {20763#true} ~cond := #in~cond; {20763#true} is VALID [2022-04-28 11:32:43,306 INFO L290 TraceCheckUtils]: 77: Hoare triple {20763#true} assume !(0 == ~cond); {20763#true} is VALID [2022-04-28 11:32:43,306 INFO L290 TraceCheckUtils]: 78: Hoare triple {20763#true} assume true; {20763#true} is VALID [2022-04-28 11:32:43,307 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {20763#true} {20763#true} #83#return; {20763#true} is VALID [2022-04-28 11:32:43,307 INFO L272 TraceCheckUtils]: 80: Hoare triple {20763#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {20763#true} is VALID [2022-04-28 11:32:43,307 INFO L290 TraceCheckUtils]: 81: Hoare triple {20763#true} ~cond := #in~cond; {20763#true} is VALID [2022-04-28 11:32:43,307 INFO L290 TraceCheckUtils]: 82: Hoare triple {20763#true} assume !(0 == ~cond); {20763#true} is VALID [2022-04-28 11:32:43,307 INFO L290 TraceCheckUtils]: 83: Hoare triple {20763#true} assume true; {20763#true} is VALID [2022-04-28 11:32:43,307 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {20763#true} {20763#true} #85#return; {20763#true} is VALID [2022-04-28 11:32:43,307 INFO L272 TraceCheckUtils]: 85: Hoare triple {20763#true} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {20763#true} is VALID [2022-04-28 11:32:43,307 INFO L290 TraceCheckUtils]: 86: Hoare triple {20763#true} ~cond := #in~cond; {20763#true} is VALID [2022-04-28 11:32:43,307 INFO L290 TraceCheckUtils]: 87: Hoare triple {20763#true} assume !(0 == ~cond); {20763#true} is VALID [2022-04-28 11:32:43,307 INFO L290 TraceCheckUtils]: 88: Hoare triple {20763#true} assume true; {20763#true} is VALID [2022-04-28 11:32:43,307 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {20763#true} {20763#true} #87#return; {20763#true} is VALID [2022-04-28 11:32:43,307 INFO L290 TraceCheckUtils]: 90: Hoare triple {20763#true} assume !(~r~0 >= 2 * ~b~0); {20763#true} is VALID [2022-04-28 11:32:43,307 INFO L290 TraceCheckUtils]: 91: Hoare triple {20763#true} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {20763#true} is VALID [2022-04-28 11:32:43,307 INFO L290 TraceCheckUtils]: 92: Hoare triple {20763#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20763#true} is VALID [2022-04-28 11:32:43,307 INFO L290 TraceCheckUtils]: 93: Hoare triple {20763#true} assume !!(#t~post6 < 5);havoc #t~post6; {20763#true} is VALID [2022-04-28 11:32:43,307 INFO L272 TraceCheckUtils]: 94: Hoare triple {20763#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {20763#true} is VALID [2022-04-28 11:32:43,307 INFO L290 TraceCheckUtils]: 95: Hoare triple {20763#true} ~cond := #in~cond; {20763#true} is VALID [2022-04-28 11:32:43,307 INFO L290 TraceCheckUtils]: 96: Hoare triple {20763#true} assume !(0 == ~cond); {20763#true} is VALID [2022-04-28 11:32:43,307 INFO L290 TraceCheckUtils]: 97: Hoare triple {20763#true} assume true; {20763#true} is VALID [2022-04-28 11:32:43,307 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {20763#true} {20763#true} #79#return; {20763#true} is VALID [2022-04-28 11:32:43,308 INFO L272 TraceCheckUtils]: 99: Hoare triple {20763#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {20763#true} is VALID [2022-04-28 11:32:43,308 INFO L290 TraceCheckUtils]: 100: Hoare triple {20763#true} ~cond := #in~cond; {20763#true} is VALID [2022-04-28 11:32:43,308 INFO L290 TraceCheckUtils]: 101: Hoare triple {20763#true} assume !(0 == ~cond); {20763#true} is VALID [2022-04-28 11:32:43,308 INFO L290 TraceCheckUtils]: 102: Hoare triple {20763#true} assume true; {20763#true} is VALID [2022-04-28 11:32:43,308 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {20763#true} {20763#true} #81#return; {20763#true} is VALID [2022-04-28 11:32:43,308 INFO L290 TraceCheckUtils]: 104: Hoare triple {20763#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {20763#true} is VALID [2022-04-28 11:32:43,308 INFO L290 TraceCheckUtils]: 105: Hoare triple {20763#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21083#(<= (+ |main_#t~post7| 1) ~counter~0)} is VALID [2022-04-28 11:32:43,309 INFO L290 TraceCheckUtils]: 106: Hoare triple {21083#(<= (+ |main_#t~post7| 1) ~counter~0)} assume !(#t~post7 < 5);havoc #t~post7; {21087#(<= 6 ~counter~0)} is VALID [2022-04-28 11:32:43,309 INFO L290 TraceCheckUtils]: 107: Hoare triple {21087#(<= 6 ~counter~0)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {21087#(<= 6 ~counter~0)} is VALID [2022-04-28 11:32:43,309 INFO L290 TraceCheckUtils]: 108: Hoare triple {21087#(<= 6 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21094#(<= 6 |main_#t~post6|)} is VALID [2022-04-28 11:32:43,310 INFO L290 TraceCheckUtils]: 109: Hoare triple {21094#(<= 6 |main_#t~post6|)} assume !!(#t~post6 < 5);havoc #t~post6; {20764#false} is VALID [2022-04-28 11:32:43,310 INFO L272 TraceCheckUtils]: 110: Hoare triple {20764#false} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {20764#false} is VALID [2022-04-28 11:32:43,310 INFO L290 TraceCheckUtils]: 111: Hoare triple {20764#false} ~cond := #in~cond; {20764#false} is VALID [2022-04-28 11:32:43,310 INFO L290 TraceCheckUtils]: 112: Hoare triple {20764#false} assume !(0 == ~cond); {20764#false} is VALID [2022-04-28 11:32:43,310 INFO L290 TraceCheckUtils]: 113: Hoare triple {20764#false} assume true; {20764#false} is VALID [2022-04-28 11:32:43,310 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {20764#false} {20764#false} #79#return; {20764#false} is VALID [2022-04-28 11:32:43,310 INFO L272 TraceCheckUtils]: 115: Hoare triple {20764#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {20764#false} is VALID [2022-04-28 11:32:43,310 INFO L290 TraceCheckUtils]: 116: Hoare triple {20764#false} ~cond := #in~cond; {20764#false} is VALID [2022-04-28 11:32:43,310 INFO L290 TraceCheckUtils]: 117: Hoare triple {20764#false} assume !(0 == ~cond); {20764#false} is VALID [2022-04-28 11:32:43,310 INFO L290 TraceCheckUtils]: 118: Hoare triple {20764#false} assume true; {20764#false} is VALID [2022-04-28 11:32:43,310 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {20764#false} {20764#false} #81#return; {20764#false} is VALID [2022-04-28 11:32:43,310 INFO L290 TraceCheckUtils]: 120: Hoare triple {20764#false} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {20764#false} is VALID [2022-04-28 11:32:43,310 INFO L290 TraceCheckUtils]: 121: Hoare triple {20764#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20764#false} is VALID [2022-04-28 11:32:43,310 INFO L290 TraceCheckUtils]: 122: Hoare triple {20764#false} assume !(#t~post7 < 5);havoc #t~post7; {20764#false} is VALID [2022-04-28 11:32:43,310 INFO L290 TraceCheckUtils]: 123: Hoare triple {20764#false} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {20764#false} is VALID [2022-04-28 11:32:43,310 INFO L290 TraceCheckUtils]: 124: Hoare triple {20764#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20764#false} is VALID [2022-04-28 11:32:43,310 INFO L290 TraceCheckUtils]: 125: Hoare triple {20764#false} assume !(#t~post6 < 5);havoc #t~post6; {20764#false} is VALID [2022-04-28 11:32:43,310 INFO L272 TraceCheckUtils]: 126: Hoare triple {20764#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {20764#false} is VALID [2022-04-28 11:32:43,311 INFO L290 TraceCheckUtils]: 127: Hoare triple {20764#false} ~cond := #in~cond; {20764#false} is VALID [2022-04-28 11:32:43,311 INFO L290 TraceCheckUtils]: 128: Hoare triple {20764#false} assume 0 == ~cond; {20764#false} is VALID [2022-04-28 11:32:43,311 INFO L290 TraceCheckUtils]: 129: Hoare triple {20764#false} assume !false; {20764#false} is VALID [2022-04-28 11:32:43,311 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 456 trivial. 0 not checked. [2022-04-28 11:32:43,311 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:32:43,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:32:43,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045965409] [2022-04-28 11:32:43,311 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:32:43,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383211600] [2022-04-28 11:32:43,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383211600] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:32:43,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:32:43,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:32:43,312 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:32:43,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1066704762] [2022-04-28 11:32:43,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1066704762] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:32:43,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:32:43,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:32:43,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065357711] [2022-04-28 11:32:43,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:32:43,312 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 130 [2022-04-28 11:32:43,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:32:43,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-04-28 11:32:43,348 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 11:32:43,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:32:43,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:32:43,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:32:43,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:32:43,349 INFO L87 Difference]: Start difference. First operand 244 states and 298 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-04-28 11:32:43,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:32:43,803 INFO L93 Difference]: Finished difference Result 330 states and 410 transitions. [2022-04-28 11:32:43,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:32:43,803 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 130 [2022-04-28 11:32:43,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:32:43,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-04-28 11:32:43,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2022-04-28 11:32:43,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-04-28 11:32:43,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2022-04-28 11:32:43,805 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 82 transitions. [2022-04-28 11:32:43,857 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 11:32:43,861 INFO L225 Difference]: With dead ends: 330 [2022-04-28 11:32:43,861 INFO L226 Difference]: Without dead ends: 227 [2022-04-28 11:32:43,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 126 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 11:32:43,861 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 6 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:32:43,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 160 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:32:43,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-04-28 11:32:44,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 219. [2022-04-28 11:32:44,134 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:32:44,134 INFO L82 GeneralOperation]: Start isEquivalent. First operand 227 states. Second operand has 219 states, 140 states have (on average 1.1142857142857143) internal successors, (156), 142 states have internal predecessors, (156), 52 states have call successors, (52), 28 states have call predecessors, (52), 26 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-28 11:32:44,134 INFO L74 IsIncluded]: Start isIncluded. First operand 227 states. Second operand has 219 states, 140 states have (on average 1.1142857142857143) internal successors, (156), 142 states have internal predecessors, (156), 52 states have call successors, (52), 28 states have call predecessors, (52), 26 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-28 11:32:44,135 INFO L87 Difference]: Start difference. First operand 227 states. Second operand has 219 states, 140 states have (on average 1.1142857142857143) internal successors, (156), 142 states have internal predecessors, (156), 52 states have call successors, (52), 28 states have call predecessors, (52), 26 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-28 11:32:44,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:32:44,137 INFO L93 Difference]: Finished difference Result 227 states and 264 transitions. [2022-04-28 11:32:44,137 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 264 transitions. [2022-04-28 11:32:44,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:32:44,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:32:44,138 INFO L74 IsIncluded]: Start isIncluded. First operand has 219 states, 140 states have (on average 1.1142857142857143) internal successors, (156), 142 states have internal predecessors, (156), 52 states have call successors, (52), 28 states have call predecessors, (52), 26 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) Second operand 227 states. [2022-04-28 11:32:44,138 INFO L87 Difference]: Start difference. First operand has 219 states, 140 states have (on average 1.1142857142857143) internal successors, (156), 142 states have internal predecessors, (156), 52 states have call successors, (52), 28 states have call predecessors, (52), 26 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) Second operand 227 states. [2022-04-28 11:32:44,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:32:44,141 INFO L93 Difference]: Finished difference Result 227 states and 264 transitions. [2022-04-28 11:32:44,141 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 264 transitions. [2022-04-28 11:32:44,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:32:44,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:32:44,142 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:32:44,142 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:32:44,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 140 states have (on average 1.1142857142857143) internal successors, (156), 142 states have internal predecessors, (156), 52 states have call successors, (52), 28 states have call predecessors, (52), 26 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-28 11:32:44,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 257 transitions. [2022-04-28 11:32:44,145 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 257 transitions. Word has length 130 [2022-04-28 11:32:44,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:32:44,145 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 257 transitions. [2022-04-28 11:32:44,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-04-28 11:32:44,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 219 states and 257 transitions. [2022-04-28 11:32:44,488 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 257 edges. 257 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:32:44,489 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 257 transitions. [2022-04-28 11:32:44,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-04-28 11:32:44,489 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:32:44,489 INFO L195 NwaCegarLoop]: trace histogram [20, 19, 19, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:32:44,507 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 11:32:44,695 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 11:32:44,695 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:32:44,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:32:44,696 INFO L85 PathProgramCache]: Analyzing trace with hash 518951120, now seen corresponding path program 7 times [2022-04-28 11:32:44,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:32:44,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2035917488] [2022-04-28 11:33:26,559 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:33:26,559 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:33:26,559 INFO L85 PathProgramCache]: Analyzing trace with hash 518951120, now seen corresponding path program 8 times [2022-04-28 11:33:26,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:33:26,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14697550] [2022-04-28 11:33:26,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:33:26,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:33:26,572 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:33:26,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [242157224] [2022-04-28 11:33:26,572 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:33:26,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:33:26,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:33:26,573 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 11:33:26,574 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 11:33:26,655 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:33:26,655 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:33:26,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 11:33:26,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:33:26,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:33:27,226 INFO L272 TraceCheckUtils]: 0: Hoare triple {22711#true} call ULTIMATE.init(); {22711#true} is VALID [2022-04-28 11:33:27,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {22711#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {22719#(<= 0 ~counter~0)} is VALID [2022-04-28 11:33:27,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {22719#(<= 0 ~counter~0)} assume true; {22719#(<= 0 ~counter~0)} is VALID [2022-04-28 11:33:27,227 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22719#(<= 0 ~counter~0)} {22711#true} #93#return; {22719#(<= 0 ~counter~0)} is VALID [2022-04-28 11:33:27,227 INFO L272 TraceCheckUtils]: 4: Hoare triple {22719#(<= 0 ~counter~0)} call #t~ret8 := main(); {22719#(<= 0 ~counter~0)} is VALID [2022-04-28 11:33:27,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {22719#(<= 0 ~counter~0)} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {22719#(<= 0 ~counter~0)} is VALID [2022-04-28 11:33:27,228 INFO L272 TraceCheckUtils]: 6: Hoare triple {22719#(<= 0 ~counter~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {22719#(<= 0 ~counter~0)} is VALID [2022-04-28 11:33:27,228 INFO L290 TraceCheckUtils]: 7: Hoare triple {22719#(<= 0 ~counter~0)} ~cond := #in~cond; {22719#(<= 0 ~counter~0)} is VALID [2022-04-28 11:33:27,228 INFO L290 TraceCheckUtils]: 8: Hoare triple {22719#(<= 0 ~counter~0)} assume !(0 == ~cond); {22719#(<= 0 ~counter~0)} is VALID [2022-04-28 11:33:27,229 INFO L290 TraceCheckUtils]: 9: Hoare triple {22719#(<= 0 ~counter~0)} assume true; {22719#(<= 0 ~counter~0)} is VALID [2022-04-28 11:33:27,229 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22719#(<= 0 ~counter~0)} {22719#(<= 0 ~counter~0)} #77#return; {22719#(<= 0 ~counter~0)} is VALID [2022-04-28 11:33:27,229 INFO L290 TraceCheckUtils]: 11: Hoare triple {22719#(<= 0 ~counter~0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {22719#(<= 0 ~counter~0)} is VALID [2022-04-28 11:33:27,230 INFO L290 TraceCheckUtils]: 12: Hoare triple {22719#(<= 0 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22753#(<= 1 ~counter~0)} is VALID [2022-04-28 11:33:27,230 INFO L290 TraceCheckUtils]: 13: Hoare triple {22753#(<= 1 ~counter~0)} assume !!(#t~post6 < 5);havoc #t~post6; {22753#(<= 1 ~counter~0)} is VALID [2022-04-28 11:33:27,231 INFO L272 TraceCheckUtils]: 14: Hoare triple {22753#(<= 1 ~counter~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22753#(<= 1 ~counter~0)} is VALID [2022-04-28 11:33:27,231 INFO L290 TraceCheckUtils]: 15: Hoare triple {22753#(<= 1 ~counter~0)} ~cond := #in~cond; {22753#(<= 1 ~counter~0)} is VALID [2022-04-28 11:33:27,231 INFO L290 TraceCheckUtils]: 16: Hoare triple {22753#(<= 1 ~counter~0)} assume !(0 == ~cond); {22753#(<= 1 ~counter~0)} is VALID [2022-04-28 11:33:27,231 INFO L290 TraceCheckUtils]: 17: Hoare triple {22753#(<= 1 ~counter~0)} assume true; {22753#(<= 1 ~counter~0)} is VALID [2022-04-28 11:33:27,232 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {22753#(<= 1 ~counter~0)} {22753#(<= 1 ~counter~0)} #79#return; {22753#(<= 1 ~counter~0)} is VALID [2022-04-28 11:33:27,232 INFO L272 TraceCheckUtils]: 19: Hoare triple {22753#(<= 1 ~counter~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22753#(<= 1 ~counter~0)} is VALID [2022-04-28 11:33:27,232 INFO L290 TraceCheckUtils]: 20: Hoare triple {22753#(<= 1 ~counter~0)} ~cond := #in~cond; {22753#(<= 1 ~counter~0)} is VALID [2022-04-28 11:33:27,233 INFO L290 TraceCheckUtils]: 21: Hoare triple {22753#(<= 1 ~counter~0)} assume !(0 == ~cond); {22753#(<= 1 ~counter~0)} is VALID [2022-04-28 11:33:27,233 INFO L290 TraceCheckUtils]: 22: Hoare triple {22753#(<= 1 ~counter~0)} assume true; {22753#(<= 1 ~counter~0)} is VALID [2022-04-28 11:33:27,233 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {22753#(<= 1 ~counter~0)} {22753#(<= 1 ~counter~0)} #81#return; {22753#(<= 1 ~counter~0)} is VALID [2022-04-28 11:33:27,234 INFO L290 TraceCheckUtils]: 24: Hoare triple {22753#(<= 1 ~counter~0)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {22753#(<= 1 ~counter~0)} is VALID [2022-04-28 11:33:27,234 INFO L290 TraceCheckUtils]: 25: Hoare triple {22753#(<= 1 ~counter~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22793#(<= 2 ~counter~0)} is VALID [2022-04-28 11:33:27,235 INFO L290 TraceCheckUtils]: 26: Hoare triple {22793#(<= 2 ~counter~0)} assume !!(#t~post7 < 5);havoc #t~post7; {22793#(<= 2 ~counter~0)} is VALID [2022-04-28 11:33:27,235 INFO L272 TraceCheckUtils]: 27: Hoare triple {22793#(<= 2 ~counter~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22793#(<= 2 ~counter~0)} is VALID [2022-04-28 11:33:27,235 INFO L290 TraceCheckUtils]: 28: Hoare triple {22793#(<= 2 ~counter~0)} ~cond := #in~cond; {22793#(<= 2 ~counter~0)} is VALID [2022-04-28 11:33:27,235 INFO L290 TraceCheckUtils]: 29: Hoare triple {22793#(<= 2 ~counter~0)} assume !(0 == ~cond); {22793#(<= 2 ~counter~0)} is VALID [2022-04-28 11:33:27,236 INFO L290 TraceCheckUtils]: 30: Hoare triple {22793#(<= 2 ~counter~0)} assume true; {22793#(<= 2 ~counter~0)} is VALID [2022-04-28 11:33:27,236 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {22793#(<= 2 ~counter~0)} {22793#(<= 2 ~counter~0)} #83#return; {22793#(<= 2 ~counter~0)} is VALID [2022-04-28 11:33:27,237 INFO L272 TraceCheckUtils]: 32: Hoare triple {22793#(<= 2 ~counter~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22793#(<= 2 ~counter~0)} is VALID [2022-04-28 11:33:27,237 INFO L290 TraceCheckUtils]: 33: Hoare triple {22793#(<= 2 ~counter~0)} ~cond := #in~cond; {22793#(<= 2 ~counter~0)} is VALID [2022-04-28 11:33:27,237 INFO L290 TraceCheckUtils]: 34: Hoare triple {22793#(<= 2 ~counter~0)} assume !(0 == ~cond); {22793#(<= 2 ~counter~0)} is VALID [2022-04-28 11:33:27,237 INFO L290 TraceCheckUtils]: 35: Hoare triple {22793#(<= 2 ~counter~0)} assume true; {22793#(<= 2 ~counter~0)} is VALID [2022-04-28 11:33:27,238 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {22793#(<= 2 ~counter~0)} {22793#(<= 2 ~counter~0)} #85#return; {22793#(<= 2 ~counter~0)} is VALID [2022-04-28 11:33:27,238 INFO L272 TraceCheckUtils]: 37: Hoare triple {22793#(<= 2 ~counter~0)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {22793#(<= 2 ~counter~0)} is VALID [2022-04-28 11:33:27,238 INFO L290 TraceCheckUtils]: 38: Hoare triple {22793#(<= 2 ~counter~0)} ~cond := #in~cond; {22793#(<= 2 ~counter~0)} is VALID [2022-04-28 11:33:27,239 INFO L290 TraceCheckUtils]: 39: Hoare triple {22793#(<= 2 ~counter~0)} assume !(0 == ~cond); {22793#(<= 2 ~counter~0)} is VALID [2022-04-28 11:33:27,239 INFO L290 TraceCheckUtils]: 40: Hoare triple {22793#(<= 2 ~counter~0)} assume true; {22793#(<= 2 ~counter~0)} is VALID [2022-04-28 11:33:27,239 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {22793#(<= 2 ~counter~0)} {22793#(<= 2 ~counter~0)} #87#return; {22793#(<= 2 ~counter~0)} is VALID [2022-04-28 11:33:27,239 INFO L290 TraceCheckUtils]: 42: Hoare triple {22793#(<= 2 ~counter~0)} assume !!(~r~0 >= 2 * ~b~0); {22793#(<= 2 ~counter~0)} is VALID [2022-04-28 11:33:27,240 INFO L272 TraceCheckUtils]: 43: Hoare triple {22793#(<= 2 ~counter~0)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {22793#(<= 2 ~counter~0)} is VALID [2022-04-28 11:33:27,240 INFO L290 TraceCheckUtils]: 44: Hoare triple {22793#(<= 2 ~counter~0)} ~cond := #in~cond; {22793#(<= 2 ~counter~0)} is VALID [2022-04-28 11:33:27,240 INFO L290 TraceCheckUtils]: 45: Hoare triple {22793#(<= 2 ~counter~0)} assume !(0 == ~cond); {22793#(<= 2 ~counter~0)} is VALID [2022-04-28 11:33:27,241 INFO L290 TraceCheckUtils]: 46: Hoare triple {22793#(<= 2 ~counter~0)} assume true; {22793#(<= 2 ~counter~0)} is VALID [2022-04-28 11:33:27,241 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {22793#(<= 2 ~counter~0)} {22793#(<= 2 ~counter~0)} #89#return; {22793#(<= 2 ~counter~0)} is VALID [2022-04-28 11:33:27,241 INFO L290 TraceCheckUtils]: 48: Hoare triple {22793#(<= 2 ~counter~0)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {22793#(<= 2 ~counter~0)} is VALID [2022-04-28 11:33:27,242 INFO L290 TraceCheckUtils]: 49: Hoare triple {22793#(<= 2 ~counter~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22866#(<= 3 ~counter~0)} is VALID [2022-04-28 11:33:27,242 INFO L290 TraceCheckUtils]: 50: Hoare triple {22866#(<= 3 ~counter~0)} assume !!(#t~post7 < 5);havoc #t~post7; {22866#(<= 3 ~counter~0)} is VALID [2022-04-28 11:33:27,243 INFO L272 TraceCheckUtils]: 51: Hoare triple {22866#(<= 3 ~counter~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22866#(<= 3 ~counter~0)} is VALID [2022-04-28 11:33:27,243 INFO L290 TraceCheckUtils]: 52: Hoare triple {22866#(<= 3 ~counter~0)} ~cond := #in~cond; {22866#(<= 3 ~counter~0)} is VALID [2022-04-28 11:33:27,243 INFO L290 TraceCheckUtils]: 53: Hoare triple {22866#(<= 3 ~counter~0)} assume !(0 == ~cond); {22866#(<= 3 ~counter~0)} is VALID [2022-04-28 11:33:27,243 INFO L290 TraceCheckUtils]: 54: Hoare triple {22866#(<= 3 ~counter~0)} assume true; {22866#(<= 3 ~counter~0)} is VALID [2022-04-28 11:33:27,244 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {22866#(<= 3 ~counter~0)} {22866#(<= 3 ~counter~0)} #83#return; {22866#(<= 3 ~counter~0)} is VALID [2022-04-28 11:33:27,244 INFO L272 TraceCheckUtils]: 56: Hoare triple {22866#(<= 3 ~counter~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22866#(<= 3 ~counter~0)} is VALID [2022-04-28 11:33:27,245 INFO L290 TraceCheckUtils]: 57: Hoare triple {22866#(<= 3 ~counter~0)} ~cond := #in~cond; {22866#(<= 3 ~counter~0)} is VALID [2022-04-28 11:33:27,245 INFO L290 TraceCheckUtils]: 58: Hoare triple {22866#(<= 3 ~counter~0)} assume !(0 == ~cond); {22866#(<= 3 ~counter~0)} is VALID [2022-04-28 11:33:27,245 INFO L290 TraceCheckUtils]: 59: Hoare triple {22866#(<= 3 ~counter~0)} assume true; {22866#(<= 3 ~counter~0)} is VALID [2022-04-28 11:33:27,245 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {22866#(<= 3 ~counter~0)} {22866#(<= 3 ~counter~0)} #85#return; {22866#(<= 3 ~counter~0)} is VALID [2022-04-28 11:33:27,246 INFO L272 TraceCheckUtils]: 61: Hoare triple {22866#(<= 3 ~counter~0)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {22866#(<= 3 ~counter~0)} is VALID [2022-04-28 11:33:27,246 INFO L290 TraceCheckUtils]: 62: Hoare triple {22866#(<= 3 ~counter~0)} ~cond := #in~cond; {22866#(<= 3 ~counter~0)} is VALID [2022-04-28 11:33:27,246 INFO L290 TraceCheckUtils]: 63: Hoare triple {22866#(<= 3 ~counter~0)} assume !(0 == ~cond); {22866#(<= 3 ~counter~0)} is VALID [2022-04-28 11:33:27,247 INFO L290 TraceCheckUtils]: 64: Hoare triple {22866#(<= 3 ~counter~0)} assume true; {22866#(<= 3 ~counter~0)} is VALID [2022-04-28 11:33:27,247 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {22866#(<= 3 ~counter~0)} {22866#(<= 3 ~counter~0)} #87#return; {22866#(<= 3 ~counter~0)} is VALID [2022-04-28 11:33:27,247 INFO L290 TraceCheckUtils]: 66: Hoare triple {22866#(<= 3 ~counter~0)} assume !!(~r~0 >= 2 * ~b~0); {22866#(<= 3 ~counter~0)} is VALID [2022-04-28 11:33:27,248 INFO L272 TraceCheckUtils]: 67: Hoare triple {22866#(<= 3 ~counter~0)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {22866#(<= 3 ~counter~0)} is VALID [2022-04-28 11:33:27,248 INFO L290 TraceCheckUtils]: 68: Hoare triple {22866#(<= 3 ~counter~0)} ~cond := #in~cond; {22866#(<= 3 ~counter~0)} is VALID [2022-04-28 11:33:27,248 INFO L290 TraceCheckUtils]: 69: Hoare triple {22866#(<= 3 ~counter~0)} assume !(0 == ~cond); {22866#(<= 3 ~counter~0)} is VALID [2022-04-28 11:33:27,248 INFO L290 TraceCheckUtils]: 70: Hoare triple {22866#(<= 3 ~counter~0)} assume true; {22866#(<= 3 ~counter~0)} is VALID [2022-04-28 11:33:27,249 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {22866#(<= 3 ~counter~0)} {22866#(<= 3 ~counter~0)} #89#return; {22866#(<= 3 ~counter~0)} is VALID [2022-04-28 11:33:27,249 INFO L290 TraceCheckUtils]: 72: Hoare triple {22866#(<= 3 ~counter~0)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {22866#(<= 3 ~counter~0)} is VALID [2022-04-28 11:33:27,250 INFO L290 TraceCheckUtils]: 73: Hoare triple {22866#(<= 3 ~counter~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22939#(<= 4 ~counter~0)} is VALID [2022-04-28 11:33:27,250 INFO L290 TraceCheckUtils]: 74: Hoare triple {22939#(<= 4 ~counter~0)} assume !!(#t~post7 < 5);havoc #t~post7; {22939#(<= 4 ~counter~0)} is VALID [2022-04-28 11:33:27,250 INFO L272 TraceCheckUtils]: 75: Hoare triple {22939#(<= 4 ~counter~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22939#(<= 4 ~counter~0)} is VALID [2022-04-28 11:33:27,251 INFO L290 TraceCheckUtils]: 76: Hoare triple {22939#(<= 4 ~counter~0)} ~cond := #in~cond; {22939#(<= 4 ~counter~0)} is VALID [2022-04-28 11:33:27,251 INFO L290 TraceCheckUtils]: 77: Hoare triple {22939#(<= 4 ~counter~0)} assume !(0 == ~cond); {22939#(<= 4 ~counter~0)} is VALID [2022-04-28 11:33:27,251 INFO L290 TraceCheckUtils]: 78: Hoare triple {22939#(<= 4 ~counter~0)} assume true; {22939#(<= 4 ~counter~0)} is VALID [2022-04-28 11:33:27,252 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {22939#(<= 4 ~counter~0)} {22939#(<= 4 ~counter~0)} #83#return; {22939#(<= 4 ~counter~0)} is VALID [2022-04-28 11:33:27,253 INFO L272 TraceCheckUtils]: 80: Hoare triple {22939#(<= 4 ~counter~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22939#(<= 4 ~counter~0)} is VALID [2022-04-28 11:33:27,253 INFO L290 TraceCheckUtils]: 81: Hoare triple {22939#(<= 4 ~counter~0)} ~cond := #in~cond; {22939#(<= 4 ~counter~0)} is VALID [2022-04-28 11:33:27,253 INFO L290 TraceCheckUtils]: 82: Hoare triple {22939#(<= 4 ~counter~0)} assume !(0 == ~cond); {22939#(<= 4 ~counter~0)} is VALID [2022-04-28 11:33:27,254 INFO L290 TraceCheckUtils]: 83: Hoare triple {22939#(<= 4 ~counter~0)} assume true; {22939#(<= 4 ~counter~0)} is VALID [2022-04-28 11:33:27,254 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {22939#(<= 4 ~counter~0)} {22939#(<= 4 ~counter~0)} #85#return; {22939#(<= 4 ~counter~0)} is VALID [2022-04-28 11:33:27,255 INFO L272 TraceCheckUtils]: 85: Hoare triple {22939#(<= 4 ~counter~0)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {22939#(<= 4 ~counter~0)} is VALID [2022-04-28 11:33:27,255 INFO L290 TraceCheckUtils]: 86: Hoare triple {22939#(<= 4 ~counter~0)} ~cond := #in~cond; {22939#(<= 4 ~counter~0)} is VALID [2022-04-28 11:33:27,255 INFO L290 TraceCheckUtils]: 87: Hoare triple {22939#(<= 4 ~counter~0)} assume !(0 == ~cond); {22939#(<= 4 ~counter~0)} is VALID [2022-04-28 11:33:27,255 INFO L290 TraceCheckUtils]: 88: Hoare triple {22939#(<= 4 ~counter~0)} assume true; {22939#(<= 4 ~counter~0)} is VALID [2022-04-28 11:33:27,256 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {22939#(<= 4 ~counter~0)} {22939#(<= 4 ~counter~0)} #87#return; {22939#(<= 4 ~counter~0)} is VALID [2022-04-28 11:33:27,256 INFO L290 TraceCheckUtils]: 90: Hoare triple {22939#(<= 4 ~counter~0)} assume !(~r~0 >= 2 * ~b~0); {22939#(<= 4 ~counter~0)} is VALID [2022-04-28 11:33:27,256 INFO L290 TraceCheckUtils]: 91: Hoare triple {22939#(<= 4 ~counter~0)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {22939#(<= 4 ~counter~0)} is VALID [2022-04-28 11:33:27,257 INFO L290 TraceCheckUtils]: 92: Hoare triple {22939#(<= 4 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22997#(<= 5 ~counter~0)} is VALID [2022-04-28 11:33:27,257 INFO L290 TraceCheckUtils]: 93: Hoare triple {22997#(<= 5 ~counter~0)} assume !!(#t~post6 < 5);havoc #t~post6; {22997#(<= 5 ~counter~0)} is VALID [2022-04-28 11:33:27,258 INFO L272 TraceCheckUtils]: 94: Hoare triple {22997#(<= 5 ~counter~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22997#(<= 5 ~counter~0)} is VALID [2022-04-28 11:33:27,258 INFO L290 TraceCheckUtils]: 95: Hoare triple {22997#(<= 5 ~counter~0)} ~cond := #in~cond; {22997#(<= 5 ~counter~0)} is VALID [2022-04-28 11:33:27,258 INFO L290 TraceCheckUtils]: 96: Hoare triple {22997#(<= 5 ~counter~0)} assume !(0 == ~cond); {22997#(<= 5 ~counter~0)} is VALID [2022-04-28 11:33:27,258 INFO L290 TraceCheckUtils]: 97: Hoare triple {22997#(<= 5 ~counter~0)} assume true; {22997#(<= 5 ~counter~0)} is VALID [2022-04-28 11:33:27,259 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {22997#(<= 5 ~counter~0)} {22997#(<= 5 ~counter~0)} #79#return; {22997#(<= 5 ~counter~0)} is VALID [2022-04-28 11:33:27,259 INFO L272 TraceCheckUtils]: 99: Hoare triple {22997#(<= 5 ~counter~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22997#(<= 5 ~counter~0)} is VALID [2022-04-28 11:33:27,260 INFO L290 TraceCheckUtils]: 100: Hoare triple {22997#(<= 5 ~counter~0)} ~cond := #in~cond; {22997#(<= 5 ~counter~0)} is VALID [2022-04-28 11:33:27,260 INFO L290 TraceCheckUtils]: 101: Hoare triple {22997#(<= 5 ~counter~0)} assume !(0 == ~cond); {22997#(<= 5 ~counter~0)} is VALID [2022-04-28 11:33:27,260 INFO L290 TraceCheckUtils]: 102: Hoare triple {22997#(<= 5 ~counter~0)} assume true; {22997#(<= 5 ~counter~0)} is VALID [2022-04-28 11:33:27,261 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {22997#(<= 5 ~counter~0)} {22997#(<= 5 ~counter~0)} #81#return; {22997#(<= 5 ~counter~0)} is VALID [2022-04-28 11:33:27,261 INFO L290 TraceCheckUtils]: 104: Hoare triple {22997#(<= 5 ~counter~0)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {22997#(<= 5 ~counter~0)} is VALID [2022-04-28 11:33:27,261 INFO L290 TraceCheckUtils]: 105: Hoare triple {22997#(<= 5 ~counter~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23037#(<= 5 |main_#t~post7|)} is VALID [2022-04-28 11:33:27,261 INFO L290 TraceCheckUtils]: 106: Hoare triple {23037#(<= 5 |main_#t~post7|)} assume !!(#t~post7 < 5);havoc #t~post7; {22712#false} is VALID [2022-04-28 11:33:27,261 INFO L272 TraceCheckUtils]: 107: Hoare triple {22712#false} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22712#false} is VALID [2022-04-28 11:33:27,261 INFO L290 TraceCheckUtils]: 108: Hoare triple {22712#false} ~cond := #in~cond; {22712#false} is VALID [2022-04-28 11:33:27,262 INFO L290 TraceCheckUtils]: 109: Hoare triple {22712#false} assume !(0 == ~cond); {22712#false} is VALID [2022-04-28 11:33:27,262 INFO L290 TraceCheckUtils]: 110: Hoare triple {22712#false} assume true; {22712#false} is VALID [2022-04-28 11:33:27,262 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {22712#false} {22712#false} #83#return; {22712#false} is VALID [2022-04-28 11:33:27,262 INFO L272 TraceCheckUtils]: 112: Hoare triple {22712#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22712#false} is VALID [2022-04-28 11:33:27,262 INFO L290 TraceCheckUtils]: 113: Hoare triple {22712#false} ~cond := #in~cond; {22712#false} is VALID [2022-04-28 11:33:27,262 INFO L290 TraceCheckUtils]: 114: Hoare triple {22712#false} assume !(0 == ~cond); {22712#false} is VALID [2022-04-28 11:33:27,262 INFO L290 TraceCheckUtils]: 115: Hoare triple {22712#false} assume true; {22712#false} is VALID [2022-04-28 11:33:27,262 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {22712#false} {22712#false} #85#return; {22712#false} is VALID [2022-04-28 11:33:27,262 INFO L272 TraceCheckUtils]: 117: Hoare triple {22712#false} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {22712#false} is VALID [2022-04-28 11:33:27,262 INFO L290 TraceCheckUtils]: 118: Hoare triple {22712#false} ~cond := #in~cond; {22712#false} is VALID [2022-04-28 11:33:27,262 INFO L290 TraceCheckUtils]: 119: Hoare triple {22712#false} assume !(0 == ~cond); {22712#false} is VALID [2022-04-28 11:33:27,262 INFO L290 TraceCheckUtils]: 120: Hoare triple {22712#false} assume true; {22712#false} is VALID [2022-04-28 11:33:27,262 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {22712#false} {22712#false} #87#return; {22712#false} is VALID [2022-04-28 11:33:27,262 INFO L290 TraceCheckUtils]: 122: Hoare triple {22712#false} assume !!(~r~0 >= 2 * ~b~0); {22712#false} is VALID [2022-04-28 11:33:27,262 INFO L272 TraceCheckUtils]: 123: Hoare triple {22712#false} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {22712#false} is VALID [2022-04-28 11:33:27,262 INFO L290 TraceCheckUtils]: 124: Hoare triple {22712#false} ~cond := #in~cond; {22712#false} is VALID [2022-04-28 11:33:27,262 INFO L290 TraceCheckUtils]: 125: Hoare triple {22712#false} assume !(0 == ~cond); {22712#false} is VALID [2022-04-28 11:33:27,262 INFO L290 TraceCheckUtils]: 126: Hoare triple {22712#false} assume true; {22712#false} is VALID [2022-04-28 11:33:27,262 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {22712#false} {22712#false} #89#return; {22712#false} is VALID [2022-04-28 11:33:27,262 INFO L290 TraceCheckUtils]: 128: Hoare triple {22712#false} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {22712#false} is VALID [2022-04-28 11:33:27,263 INFO L290 TraceCheckUtils]: 129: Hoare triple {22712#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22712#false} is VALID [2022-04-28 11:33:27,263 INFO L290 TraceCheckUtils]: 130: Hoare triple {22712#false} assume !(#t~post7 < 5);havoc #t~post7; {22712#false} is VALID [2022-04-28 11:33:27,263 INFO L290 TraceCheckUtils]: 131: Hoare triple {22712#false} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {22712#false} is VALID [2022-04-28 11:33:27,263 INFO L290 TraceCheckUtils]: 132: Hoare triple {22712#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22712#false} is VALID [2022-04-28 11:33:27,263 INFO L290 TraceCheckUtils]: 133: Hoare triple {22712#false} assume !(#t~post6 < 5);havoc #t~post6; {22712#false} is VALID [2022-04-28 11:33:27,263 INFO L272 TraceCheckUtils]: 134: Hoare triple {22712#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22712#false} is VALID [2022-04-28 11:33:27,263 INFO L290 TraceCheckUtils]: 135: Hoare triple {22712#false} ~cond := #in~cond; {22712#false} is VALID [2022-04-28 11:33:27,263 INFO L290 TraceCheckUtils]: 136: Hoare triple {22712#false} assume 0 == ~cond; {22712#false} is VALID [2022-04-28 11:33:27,263 INFO L290 TraceCheckUtils]: 137: Hoare triple {22712#false} assume !false; {22712#false} is VALID [2022-04-28 11:33:27,263 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 679 proven. 3 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-04-28 11:33:27,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:33:27,725 INFO L290 TraceCheckUtils]: 137: Hoare triple {22712#false} assume !false; {22712#false} is VALID [2022-04-28 11:33:27,725 INFO L290 TraceCheckUtils]: 136: Hoare triple {22712#false} assume 0 == ~cond; {22712#false} is VALID [2022-04-28 11:33:27,725 INFO L290 TraceCheckUtils]: 135: Hoare triple {22712#false} ~cond := #in~cond; {22712#false} is VALID [2022-04-28 11:33:27,725 INFO L272 TraceCheckUtils]: 134: Hoare triple {22712#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22712#false} is VALID [2022-04-28 11:33:27,726 INFO L290 TraceCheckUtils]: 133: Hoare triple {22712#false} assume !(#t~post6 < 5);havoc #t~post6; {22712#false} is VALID [2022-04-28 11:33:27,726 INFO L290 TraceCheckUtils]: 132: Hoare triple {22712#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22712#false} is VALID [2022-04-28 11:33:27,726 INFO L290 TraceCheckUtils]: 131: Hoare triple {22712#false} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {22712#false} is VALID [2022-04-28 11:33:27,726 INFO L290 TraceCheckUtils]: 130: Hoare triple {22712#false} assume !(#t~post7 < 5);havoc #t~post7; {22712#false} is VALID [2022-04-28 11:33:27,726 INFO L290 TraceCheckUtils]: 129: Hoare triple {22712#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22712#false} is VALID [2022-04-28 11:33:27,726 INFO L290 TraceCheckUtils]: 128: Hoare triple {22712#false} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {22712#false} is VALID [2022-04-28 11:33:27,726 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {22711#true} {22712#false} #89#return; {22712#false} is VALID [2022-04-28 11:33:27,726 INFO L290 TraceCheckUtils]: 126: Hoare triple {22711#true} assume true; {22711#true} is VALID [2022-04-28 11:33:27,726 INFO L290 TraceCheckUtils]: 125: Hoare triple {22711#true} assume !(0 == ~cond); {22711#true} is VALID [2022-04-28 11:33:27,726 INFO L290 TraceCheckUtils]: 124: Hoare triple {22711#true} ~cond := #in~cond; {22711#true} is VALID [2022-04-28 11:33:27,726 INFO L272 TraceCheckUtils]: 123: Hoare triple {22712#false} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {22711#true} is VALID [2022-04-28 11:33:27,726 INFO L290 TraceCheckUtils]: 122: Hoare triple {22712#false} assume !!(~r~0 >= 2 * ~b~0); {22712#false} is VALID [2022-04-28 11:33:27,726 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {22711#true} {22712#false} #87#return; {22712#false} is VALID [2022-04-28 11:33:27,726 INFO L290 TraceCheckUtils]: 120: Hoare triple {22711#true} assume true; {22711#true} is VALID [2022-04-28 11:33:27,726 INFO L290 TraceCheckUtils]: 119: Hoare triple {22711#true} assume !(0 == ~cond); {22711#true} is VALID [2022-04-28 11:33:27,726 INFO L290 TraceCheckUtils]: 118: Hoare triple {22711#true} ~cond := #in~cond; {22711#true} is VALID [2022-04-28 11:33:27,726 INFO L272 TraceCheckUtils]: 117: Hoare triple {22712#false} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {22711#true} is VALID [2022-04-28 11:33:27,726 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {22711#true} {22712#false} #85#return; {22712#false} is VALID [2022-04-28 11:33:27,726 INFO L290 TraceCheckUtils]: 115: Hoare triple {22711#true} assume true; {22711#true} is VALID [2022-04-28 11:33:27,726 INFO L290 TraceCheckUtils]: 114: Hoare triple {22711#true} assume !(0 == ~cond); {22711#true} is VALID [2022-04-28 11:33:27,727 INFO L290 TraceCheckUtils]: 113: Hoare triple {22711#true} ~cond := #in~cond; {22711#true} is VALID [2022-04-28 11:33:27,727 INFO L272 TraceCheckUtils]: 112: Hoare triple {22712#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22711#true} is VALID [2022-04-28 11:33:27,727 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {22711#true} {22712#false} #83#return; {22712#false} is VALID [2022-04-28 11:33:27,727 INFO L290 TraceCheckUtils]: 110: Hoare triple {22711#true} assume true; {22711#true} is VALID [2022-04-28 11:33:27,727 INFO L290 TraceCheckUtils]: 109: Hoare triple {22711#true} assume !(0 == ~cond); {22711#true} is VALID [2022-04-28 11:33:27,727 INFO L290 TraceCheckUtils]: 108: Hoare triple {22711#true} ~cond := #in~cond; {22711#true} is VALID [2022-04-28 11:33:27,727 INFO L272 TraceCheckUtils]: 107: Hoare triple {22712#false} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22711#true} is VALID [2022-04-28 11:33:27,727 INFO L290 TraceCheckUtils]: 106: Hoare triple {23037#(<= 5 |main_#t~post7|)} assume !!(#t~post7 < 5);havoc #t~post7; {22712#false} is VALID [2022-04-28 11:33:27,727 INFO L290 TraceCheckUtils]: 105: Hoare triple {22997#(<= 5 ~counter~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23037#(<= 5 |main_#t~post7|)} is VALID [2022-04-28 11:33:27,728 INFO L290 TraceCheckUtils]: 104: Hoare triple {22997#(<= 5 ~counter~0)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {22997#(<= 5 ~counter~0)} is VALID [2022-04-28 11:33:27,728 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {22711#true} {22997#(<= 5 ~counter~0)} #81#return; {22997#(<= 5 ~counter~0)} is VALID [2022-04-28 11:33:27,728 INFO L290 TraceCheckUtils]: 102: Hoare triple {22711#true} assume true; {22711#true} is VALID [2022-04-28 11:33:27,728 INFO L290 TraceCheckUtils]: 101: Hoare triple {22711#true} assume !(0 == ~cond); {22711#true} is VALID [2022-04-28 11:33:27,728 INFO L290 TraceCheckUtils]: 100: Hoare triple {22711#true} ~cond := #in~cond; {22711#true} is VALID [2022-04-28 11:33:27,728 INFO L272 TraceCheckUtils]: 99: Hoare triple {22997#(<= 5 ~counter~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22711#true} is VALID [2022-04-28 11:33:27,729 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {22711#true} {22997#(<= 5 ~counter~0)} #79#return; {22997#(<= 5 ~counter~0)} is VALID [2022-04-28 11:33:27,729 INFO L290 TraceCheckUtils]: 97: Hoare triple {22711#true} assume true; {22711#true} is VALID [2022-04-28 11:33:27,729 INFO L290 TraceCheckUtils]: 96: Hoare triple {22711#true} assume !(0 == ~cond); {22711#true} is VALID [2022-04-28 11:33:27,729 INFO L290 TraceCheckUtils]: 95: Hoare triple {22711#true} ~cond := #in~cond; {22711#true} is VALID [2022-04-28 11:33:27,729 INFO L272 TraceCheckUtils]: 94: Hoare triple {22997#(<= 5 ~counter~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22711#true} is VALID [2022-04-28 11:33:27,729 INFO L290 TraceCheckUtils]: 93: Hoare triple {22997#(<= 5 ~counter~0)} assume !!(#t~post6 < 5);havoc #t~post6; {22997#(<= 5 ~counter~0)} is VALID [2022-04-28 11:33:27,730 INFO L290 TraceCheckUtils]: 92: Hoare triple {22939#(<= 4 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22997#(<= 5 ~counter~0)} is VALID [2022-04-28 11:33:27,730 INFO L290 TraceCheckUtils]: 91: Hoare triple {22939#(<= 4 ~counter~0)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {22939#(<= 4 ~counter~0)} is VALID [2022-04-28 11:33:27,731 INFO L290 TraceCheckUtils]: 90: Hoare triple {22939#(<= 4 ~counter~0)} assume !(~r~0 >= 2 * ~b~0); {22939#(<= 4 ~counter~0)} is VALID [2022-04-28 11:33:27,731 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {22711#true} {22939#(<= 4 ~counter~0)} #87#return; {22939#(<= 4 ~counter~0)} is VALID [2022-04-28 11:33:27,731 INFO L290 TraceCheckUtils]: 88: Hoare triple {22711#true} assume true; {22711#true} is VALID [2022-04-28 11:33:27,731 INFO L290 TraceCheckUtils]: 87: Hoare triple {22711#true} assume !(0 == ~cond); {22711#true} is VALID [2022-04-28 11:33:27,731 INFO L290 TraceCheckUtils]: 86: Hoare triple {22711#true} ~cond := #in~cond; {22711#true} is VALID [2022-04-28 11:33:27,731 INFO L272 TraceCheckUtils]: 85: Hoare triple {22939#(<= 4 ~counter~0)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {22711#true} is VALID [2022-04-28 11:33:27,732 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {22711#true} {22939#(<= 4 ~counter~0)} #85#return; {22939#(<= 4 ~counter~0)} is VALID [2022-04-28 11:33:27,732 INFO L290 TraceCheckUtils]: 83: Hoare triple {22711#true} assume true; {22711#true} is VALID [2022-04-28 11:33:27,732 INFO L290 TraceCheckUtils]: 82: Hoare triple {22711#true} assume !(0 == ~cond); {22711#true} is VALID [2022-04-28 11:33:27,732 INFO L290 TraceCheckUtils]: 81: Hoare triple {22711#true} ~cond := #in~cond; {22711#true} is VALID [2022-04-28 11:33:27,732 INFO L272 TraceCheckUtils]: 80: Hoare triple {22939#(<= 4 ~counter~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22711#true} is VALID [2022-04-28 11:33:27,732 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {22711#true} {22939#(<= 4 ~counter~0)} #83#return; {22939#(<= 4 ~counter~0)} is VALID [2022-04-28 11:33:27,732 INFO L290 TraceCheckUtils]: 78: Hoare triple {22711#true} assume true; {22711#true} is VALID [2022-04-28 11:33:27,732 INFO L290 TraceCheckUtils]: 77: Hoare triple {22711#true} assume !(0 == ~cond); {22711#true} is VALID [2022-04-28 11:33:27,732 INFO L290 TraceCheckUtils]: 76: Hoare triple {22711#true} ~cond := #in~cond; {22711#true} is VALID [2022-04-28 11:33:27,733 INFO L272 TraceCheckUtils]: 75: Hoare triple {22939#(<= 4 ~counter~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22711#true} is VALID [2022-04-28 11:33:27,733 INFO L290 TraceCheckUtils]: 74: Hoare triple {22939#(<= 4 ~counter~0)} assume !!(#t~post7 < 5);havoc #t~post7; {22939#(<= 4 ~counter~0)} is VALID [2022-04-28 11:33:27,733 INFO L290 TraceCheckUtils]: 73: Hoare triple {22866#(<= 3 ~counter~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22939#(<= 4 ~counter~0)} is VALID [2022-04-28 11:33:27,734 INFO L290 TraceCheckUtils]: 72: Hoare triple {22866#(<= 3 ~counter~0)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {22866#(<= 3 ~counter~0)} is VALID [2022-04-28 11:33:27,734 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {22711#true} {22866#(<= 3 ~counter~0)} #89#return; {22866#(<= 3 ~counter~0)} is VALID [2022-04-28 11:33:27,734 INFO L290 TraceCheckUtils]: 70: Hoare triple {22711#true} assume true; {22711#true} is VALID [2022-04-28 11:33:27,734 INFO L290 TraceCheckUtils]: 69: Hoare triple {22711#true} assume !(0 == ~cond); {22711#true} is VALID [2022-04-28 11:33:27,734 INFO L290 TraceCheckUtils]: 68: Hoare triple {22711#true} ~cond := #in~cond; {22711#true} is VALID [2022-04-28 11:33:27,734 INFO L272 TraceCheckUtils]: 67: Hoare triple {22866#(<= 3 ~counter~0)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {22711#true} is VALID [2022-04-28 11:33:27,735 INFO L290 TraceCheckUtils]: 66: Hoare triple {22866#(<= 3 ~counter~0)} assume !!(~r~0 >= 2 * ~b~0); {22866#(<= 3 ~counter~0)} is VALID [2022-04-28 11:33:27,735 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {22711#true} {22866#(<= 3 ~counter~0)} #87#return; {22866#(<= 3 ~counter~0)} is VALID [2022-04-28 11:33:27,735 INFO L290 TraceCheckUtils]: 64: Hoare triple {22711#true} assume true; {22711#true} is VALID [2022-04-28 11:33:27,735 INFO L290 TraceCheckUtils]: 63: Hoare triple {22711#true} assume !(0 == ~cond); {22711#true} is VALID [2022-04-28 11:33:27,735 INFO L290 TraceCheckUtils]: 62: Hoare triple {22711#true} ~cond := #in~cond; {22711#true} is VALID [2022-04-28 11:33:27,735 INFO L272 TraceCheckUtils]: 61: Hoare triple {22866#(<= 3 ~counter~0)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {22711#true} is VALID [2022-04-28 11:33:27,736 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {22711#true} {22866#(<= 3 ~counter~0)} #85#return; {22866#(<= 3 ~counter~0)} is VALID [2022-04-28 11:33:27,736 INFO L290 TraceCheckUtils]: 59: Hoare triple {22711#true} assume true; {22711#true} is VALID [2022-04-28 11:33:27,736 INFO L290 TraceCheckUtils]: 58: Hoare triple {22711#true} assume !(0 == ~cond); {22711#true} is VALID [2022-04-28 11:33:27,736 INFO L290 TraceCheckUtils]: 57: Hoare triple {22711#true} ~cond := #in~cond; {22711#true} is VALID [2022-04-28 11:33:27,736 INFO L272 TraceCheckUtils]: 56: Hoare triple {22866#(<= 3 ~counter~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22711#true} is VALID [2022-04-28 11:33:27,736 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {22711#true} {22866#(<= 3 ~counter~0)} #83#return; {22866#(<= 3 ~counter~0)} is VALID [2022-04-28 11:33:27,736 INFO L290 TraceCheckUtils]: 54: Hoare triple {22711#true} assume true; {22711#true} is VALID [2022-04-28 11:33:27,736 INFO L290 TraceCheckUtils]: 53: Hoare triple {22711#true} assume !(0 == ~cond); {22711#true} is VALID [2022-04-28 11:33:27,736 INFO L290 TraceCheckUtils]: 52: Hoare triple {22711#true} ~cond := #in~cond; {22711#true} is VALID [2022-04-28 11:33:27,736 INFO L272 TraceCheckUtils]: 51: Hoare triple {22866#(<= 3 ~counter~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22711#true} is VALID [2022-04-28 11:33:27,737 INFO L290 TraceCheckUtils]: 50: Hoare triple {22866#(<= 3 ~counter~0)} assume !!(#t~post7 < 5);havoc #t~post7; {22866#(<= 3 ~counter~0)} is VALID [2022-04-28 11:33:27,737 INFO L290 TraceCheckUtils]: 49: Hoare triple {22793#(<= 2 ~counter~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22866#(<= 3 ~counter~0)} is VALID [2022-04-28 11:33:27,738 INFO L290 TraceCheckUtils]: 48: Hoare triple {22793#(<= 2 ~counter~0)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {22793#(<= 2 ~counter~0)} is VALID [2022-04-28 11:33:27,738 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {22711#true} {22793#(<= 2 ~counter~0)} #89#return; {22793#(<= 2 ~counter~0)} is VALID [2022-04-28 11:33:27,738 INFO L290 TraceCheckUtils]: 46: Hoare triple {22711#true} assume true; {22711#true} is VALID [2022-04-28 11:33:27,738 INFO L290 TraceCheckUtils]: 45: Hoare triple {22711#true} assume !(0 == ~cond); {22711#true} is VALID [2022-04-28 11:33:27,738 INFO L290 TraceCheckUtils]: 44: Hoare triple {22711#true} ~cond := #in~cond; {22711#true} is VALID [2022-04-28 11:33:27,738 INFO L272 TraceCheckUtils]: 43: Hoare triple {22793#(<= 2 ~counter~0)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {22711#true} is VALID [2022-04-28 11:33:27,738 INFO L290 TraceCheckUtils]: 42: Hoare triple {22793#(<= 2 ~counter~0)} assume !!(~r~0 >= 2 * ~b~0); {22793#(<= 2 ~counter~0)} is VALID [2022-04-28 11:33:27,739 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {22711#true} {22793#(<= 2 ~counter~0)} #87#return; {22793#(<= 2 ~counter~0)} is VALID [2022-04-28 11:33:27,739 INFO L290 TraceCheckUtils]: 40: Hoare triple {22711#true} assume true; {22711#true} is VALID [2022-04-28 11:33:27,739 INFO L290 TraceCheckUtils]: 39: Hoare triple {22711#true} assume !(0 == ~cond); {22711#true} is VALID [2022-04-28 11:33:27,739 INFO L290 TraceCheckUtils]: 38: Hoare triple {22711#true} ~cond := #in~cond; {22711#true} is VALID [2022-04-28 11:33:27,739 INFO L272 TraceCheckUtils]: 37: Hoare triple {22793#(<= 2 ~counter~0)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {22711#true} is VALID [2022-04-28 11:33:27,739 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {22711#true} {22793#(<= 2 ~counter~0)} #85#return; {22793#(<= 2 ~counter~0)} is VALID [2022-04-28 11:33:27,740 INFO L290 TraceCheckUtils]: 35: Hoare triple {22711#true} assume true; {22711#true} is VALID [2022-04-28 11:33:27,740 INFO L290 TraceCheckUtils]: 34: Hoare triple {22711#true} assume !(0 == ~cond); {22711#true} is VALID [2022-04-28 11:33:27,740 INFO L290 TraceCheckUtils]: 33: Hoare triple {22711#true} ~cond := #in~cond; {22711#true} is VALID [2022-04-28 11:33:27,740 INFO L272 TraceCheckUtils]: 32: Hoare triple {22793#(<= 2 ~counter~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22711#true} is VALID [2022-04-28 11:33:27,740 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {22711#true} {22793#(<= 2 ~counter~0)} #83#return; {22793#(<= 2 ~counter~0)} is VALID [2022-04-28 11:33:27,740 INFO L290 TraceCheckUtils]: 30: Hoare triple {22711#true} assume true; {22711#true} is VALID [2022-04-28 11:33:27,740 INFO L290 TraceCheckUtils]: 29: Hoare triple {22711#true} assume !(0 == ~cond); {22711#true} is VALID [2022-04-28 11:33:27,740 INFO L290 TraceCheckUtils]: 28: Hoare triple {22711#true} ~cond := #in~cond; {22711#true} is VALID [2022-04-28 11:33:27,740 INFO L272 TraceCheckUtils]: 27: Hoare triple {22793#(<= 2 ~counter~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22711#true} is VALID [2022-04-28 11:33:27,741 INFO L290 TraceCheckUtils]: 26: Hoare triple {22793#(<= 2 ~counter~0)} assume !!(#t~post7 < 5);havoc #t~post7; {22793#(<= 2 ~counter~0)} is VALID [2022-04-28 11:33:27,741 INFO L290 TraceCheckUtils]: 25: Hoare triple {22753#(<= 1 ~counter~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22793#(<= 2 ~counter~0)} is VALID [2022-04-28 11:33:27,742 INFO L290 TraceCheckUtils]: 24: Hoare triple {22753#(<= 1 ~counter~0)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {22753#(<= 1 ~counter~0)} is VALID [2022-04-28 11:33:27,742 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {22711#true} {22753#(<= 1 ~counter~0)} #81#return; {22753#(<= 1 ~counter~0)} is VALID [2022-04-28 11:33:27,742 INFO L290 TraceCheckUtils]: 22: Hoare triple {22711#true} assume true; {22711#true} is VALID [2022-04-28 11:33:27,742 INFO L290 TraceCheckUtils]: 21: Hoare triple {22711#true} assume !(0 == ~cond); {22711#true} is VALID [2022-04-28 11:33:27,742 INFO L290 TraceCheckUtils]: 20: Hoare triple {22711#true} ~cond := #in~cond; {22711#true} is VALID [2022-04-28 11:33:27,742 INFO L272 TraceCheckUtils]: 19: Hoare triple {22753#(<= 1 ~counter~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22711#true} is VALID [2022-04-28 11:33:27,743 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {22711#true} {22753#(<= 1 ~counter~0)} #79#return; {22753#(<= 1 ~counter~0)} is VALID [2022-04-28 11:33:27,743 INFO L290 TraceCheckUtils]: 17: Hoare triple {22711#true} assume true; {22711#true} is VALID [2022-04-28 11:33:27,743 INFO L290 TraceCheckUtils]: 16: Hoare triple {22711#true} assume !(0 == ~cond); {22711#true} is VALID [2022-04-28 11:33:27,743 INFO L290 TraceCheckUtils]: 15: Hoare triple {22711#true} ~cond := #in~cond; {22711#true} is VALID [2022-04-28 11:33:27,743 INFO L272 TraceCheckUtils]: 14: Hoare triple {22753#(<= 1 ~counter~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22711#true} is VALID [2022-04-28 11:33:27,743 INFO L290 TraceCheckUtils]: 13: Hoare triple {22753#(<= 1 ~counter~0)} assume !!(#t~post6 < 5);havoc #t~post6; {22753#(<= 1 ~counter~0)} is VALID [2022-04-28 11:33:27,744 INFO L290 TraceCheckUtils]: 12: Hoare triple {22719#(<= 0 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22753#(<= 1 ~counter~0)} is VALID [2022-04-28 11:33:27,744 INFO L290 TraceCheckUtils]: 11: Hoare triple {22719#(<= 0 ~counter~0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {22719#(<= 0 ~counter~0)} is VALID [2022-04-28 11:33:27,744 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22711#true} {22719#(<= 0 ~counter~0)} #77#return; {22719#(<= 0 ~counter~0)} is VALID [2022-04-28 11:33:27,744 INFO L290 TraceCheckUtils]: 9: Hoare triple {22711#true} assume true; {22711#true} is VALID [2022-04-28 11:33:27,744 INFO L290 TraceCheckUtils]: 8: Hoare triple {22711#true} assume !(0 == ~cond); {22711#true} is VALID [2022-04-28 11:33:27,744 INFO L290 TraceCheckUtils]: 7: Hoare triple {22711#true} ~cond := #in~cond; {22711#true} is VALID [2022-04-28 11:33:27,745 INFO L272 TraceCheckUtils]: 6: Hoare triple {22719#(<= 0 ~counter~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {22711#true} is VALID [2022-04-28 11:33:27,745 INFO L290 TraceCheckUtils]: 5: Hoare triple {22719#(<= 0 ~counter~0)} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {22719#(<= 0 ~counter~0)} is VALID [2022-04-28 11:33:27,745 INFO L272 TraceCheckUtils]: 4: Hoare triple {22719#(<= 0 ~counter~0)} call #t~ret8 := main(); {22719#(<= 0 ~counter~0)} is VALID [2022-04-28 11:33:27,745 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22719#(<= 0 ~counter~0)} {22711#true} #93#return; {22719#(<= 0 ~counter~0)} is VALID [2022-04-28 11:33:27,746 INFO L290 TraceCheckUtils]: 2: Hoare triple {22719#(<= 0 ~counter~0)} assume true; {22719#(<= 0 ~counter~0)} is VALID [2022-04-28 11:33:27,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {22711#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {22719#(<= 0 ~counter~0)} is VALID [2022-04-28 11:33:27,746 INFO L272 TraceCheckUtils]: 0: Hoare triple {22711#true} call ULTIMATE.init(); {22711#true} is VALID [2022-04-28 11:33:27,746 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 95 proven. 3 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2022-04-28 11:33:27,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:33:27,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14697550] [2022-04-28 11:33:27,747 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:33:27,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242157224] [2022-04-28 11:33:27,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242157224] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:33:27,747 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:33:27,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2022-04-28 11:33:27,748 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:33:27,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2035917488] [2022-04-28 11:33:27,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2035917488] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:33:27,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:33:27,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 11:33:27,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111181031] [2022-04-28 11:33:27,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:33:27,748 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 8 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 7 states have call predecessors, (21), 8 states have call successors, (21) Word has length 138 [2022-04-28 11:33:27,749 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:33:27,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 8 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 7 states have call predecessors, (21), 8 states have call successors, (21) [2022-04-28 11:33:27,829 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:33:27,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 11:33:27,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:33:27,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 11:33:27,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-04-28 11:33:27,830 INFO L87 Difference]: Start difference. First operand 219 states and 257 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 8 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 7 states have call predecessors, (21), 8 states have call successors, (21) [2022-04-28 11:33:28,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:33:28,624 INFO L93 Difference]: Finished difference Result 270 states and 309 transitions. [2022-04-28 11:33:28,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 11:33:28,624 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 8 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 7 states have call predecessors, (21), 8 states have call successors, (21) Word has length 138 [2022-04-28 11:33:28,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:33:28,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 8 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 7 states have call predecessors, (21), 8 states have call successors, (21) [2022-04-28 11:33:28,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 131 transitions. [2022-04-28 11:33:28,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 8 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 7 states have call predecessors, (21), 8 states have call successors, (21) [2022-04-28 11:33:28,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 131 transitions. [2022-04-28 11:33:28,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 131 transitions. [2022-04-28 11:33:28,729 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:33:28,731 INFO L225 Difference]: With dead ends: 270 [2022-04-28 11:33:28,731 INFO L226 Difference]: Without dead ends: 139 [2022-04-28 11:33:28,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 267 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:33:28,732 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 40 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:33:28,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 239 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:33:28,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-04-28 11:33:28,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2022-04-28 11:33:28,967 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:33:28,967 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand has 139 states, 94 states have (on average 1.0) internal successors, (94), 94 states have internal predecessors, (94), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:33:28,968 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand has 139 states, 94 states have (on average 1.0) internal successors, (94), 94 states have internal predecessors, (94), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:33:28,968 INFO L87 Difference]: Start difference. First operand 139 states. Second operand has 139 states, 94 states have (on average 1.0) internal successors, (94), 94 states have internal predecessors, (94), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:33:28,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:33:28,969 INFO L93 Difference]: Finished difference Result 139 states and 138 transitions. [2022-04-28 11:33:28,969 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 138 transitions. [2022-04-28 11:33:28,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:33:28,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:33:28,970 INFO L74 IsIncluded]: Start isIncluded. First operand has 139 states, 94 states have (on average 1.0) internal successors, (94), 94 states have internal predecessors, (94), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 139 states. [2022-04-28 11:33:28,970 INFO L87 Difference]: Start difference. First operand has 139 states, 94 states have (on average 1.0) internal successors, (94), 94 states have internal predecessors, (94), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 139 states. [2022-04-28 11:33:28,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:33:28,971 INFO L93 Difference]: Finished difference Result 139 states and 138 transitions. [2022-04-28 11:33:28,971 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 138 transitions. [2022-04-28 11:33:28,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:33:28,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:33:28,971 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:33:28,971 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:33:28,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 94 states have (on average 1.0) internal successors, (94), 94 states have internal predecessors, (94), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 11:33:28,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 138 transitions. [2022-04-28 11:33:28,973 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 138 transitions. Word has length 138 [2022-04-28 11:33:28,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:33:28,973 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 138 transitions. [2022-04-28 11:33:28,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 8 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 7 states have call predecessors, (21), 8 states have call successors, (21) [2022-04-28 11:33:28,973 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 139 states and 138 transitions. [2022-04-28 11:33:29,169 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:33:29,169 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 138 transitions. [2022-04-28 11:33:29,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-04-28 11:33:29,170 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:33:29,170 INFO L195 NwaCegarLoop]: trace histogram [20, 19, 19, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:33:29,187 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 11:33:29,370 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 11:33:29,371 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:33:29,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:33:29,371 INFO L85 PathProgramCache]: Analyzing trace with hash -2135555120, now seen corresponding path program 9 times [2022-04-28 11:33:29,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:33:29,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [798075193] [2022-04-28 11:34:09,502 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:34:09,502 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:34:09,502 INFO L85 PathProgramCache]: Analyzing trace with hash -2135555120, now seen corresponding path program 10 times [2022-04-28 11:34:09,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:34:09,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395394812] [2022-04-28 11:34:09,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:34:09,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:34:09,514 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:34:09,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [749909747] [2022-04-28 11:34:09,515 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:34:09,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:34:09,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:34:09,516 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 11:34:09,517 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 11:34:09,594 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:34:09,594 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:34:09,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 46 conjunts are in the unsatisfiable core [2022-04-28 11:34:09,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:34:09,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:35:17,798 INFO L272 TraceCheckUtils]: 0: Hoare triple {24645#true} call ULTIMATE.init(); {24645#true} is VALID [2022-04-28 11:35:17,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {24645#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {24645#true} is VALID [2022-04-28 11:35:17,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {24645#true} assume true; {24645#true} is VALID [2022-04-28 11:35:17,799 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24645#true} {24645#true} #93#return; {24645#true} is VALID [2022-04-28 11:35:17,799 INFO L272 TraceCheckUtils]: 4: Hoare triple {24645#true} call #t~ret8 := main(); {24645#true} is VALID [2022-04-28 11:35:17,799 INFO L290 TraceCheckUtils]: 5: Hoare triple {24645#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {24645#true} is VALID [2022-04-28 11:35:17,799 INFO L272 TraceCheckUtils]: 6: Hoare triple {24645#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {24645#true} is VALID [2022-04-28 11:35:17,799 INFO L290 TraceCheckUtils]: 7: Hoare triple {24645#true} ~cond := #in~cond; {24645#true} is VALID [2022-04-28 11:35:17,799 INFO L290 TraceCheckUtils]: 8: Hoare triple {24645#true} assume !(0 == ~cond); {24645#true} is VALID [2022-04-28 11:35:17,799 INFO L290 TraceCheckUtils]: 9: Hoare triple {24645#true} assume true; {24645#true} is VALID [2022-04-28 11:35:17,799 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {24645#true} {24645#true} #77#return; {24645#true} is VALID [2022-04-28 11:35:17,799 INFO L290 TraceCheckUtils]: 11: Hoare triple {24645#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {24683#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:35:17,800 INFO L290 TraceCheckUtils]: 12: Hoare triple {24683#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24683#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:35:17,800 INFO L290 TraceCheckUtils]: 13: Hoare triple {24683#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 5);havoc #t~post6; {24683#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:35:17,800 INFO L272 TraceCheckUtils]: 14: Hoare triple {24683#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {24645#true} is VALID [2022-04-28 11:35:17,800 INFO L290 TraceCheckUtils]: 15: Hoare triple {24645#true} ~cond := #in~cond; {24645#true} is VALID [2022-04-28 11:35:17,800 INFO L290 TraceCheckUtils]: 16: Hoare triple {24645#true} assume !(0 == ~cond); {24645#true} is VALID [2022-04-28 11:35:17,800 INFO L290 TraceCheckUtils]: 17: Hoare triple {24645#true} assume true; {24645#true} is VALID [2022-04-28 11:35:17,801 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {24645#true} {24683#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #79#return; {24683#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:35:17,801 INFO L272 TraceCheckUtils]: 19: Hoare triple {24683#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {24645#true} is VALID [2022-04-28 11:35:17,801 INFO L290 TraceCheckUtils]: 20: Hoare triple {24645#true} ~cond := #in~cond; {24645#true} is VALID [2022-04-28 11:35:17,801 INFO L290 TraceCheckUtils]: 21: Hoare triple {24645#true} assume !(0 == ~cond); {24645#true} is VALID [2022-04-28 11:35:17,801 INFO L290 TraceCheckUtils]: 22: Hoare triple {24645#true} assume true; {24645#true} is VALID [2022-04-28 11:35:17,801 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {24645#true} {24683#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #81#return; {24683#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 11:35:17,802 INFO L290 TraceCheckUtils]: 24: Hoare triple {24683#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {24723#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:35:17,802 INFO L290 TraceCheckUtils]: 25: Hoare triple {24723#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24723#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:35:17,802 INFO L290 TraceCheckUtils]: 26: Hoare triple {24723#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(#t~post7 < 5);havoc #t~post7; {24723#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:35:17,802 INFO L272 TraceCheckUtils]: 27: Hoare triple {24723#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {24645#true} is VALID [2022-04-28 11:35:17,803 INFO L290 TraceCheckUtils]: 28: Hoare triple {24645#true} ~cond := #in~cond; {24736#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:35:17,803 INFO L290 TraceCheckUtils]: 29: Hoare triple {24736#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {24740#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:35:17,803 INFO L290 TraceCheckUtils]: 30: Hoare triple {24740#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {24740#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:35:17,804 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {24740#(not (= |__VERIFIER_assert_#in~cond| 0))} {24723#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #83#return; {24747#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} is VALID [2022-04-28 11:35:17,804 INFO L272 TraceCheckUtils]: 32: Hoare triple {24747#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {24645#true} is VALID [2022-04-28 11:35:17,804 INFO L290 TraceCheckUtils]: 33: Hoare triple {24645#true} ~cond := #in~cond; {24645#true} is VALID [2022-04-28 11:35:17,804 INFO L290 TraceCheckUtils]: 34: Hoare triple {24645#true} assume !(0 == ~cond); {24645#true} is VALID [2022-04-28 11:35:17,804 INFO L290 TraceCheckUtils]: 35: Hoare triple {24645#true} assume true; {24645#true} is VALID [2022-04-28 11:35:17,805 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {24645#true} {24747#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} #85#return; {24747#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} is VALID [2022-04-28 11:35:17,805 INFO L272 TraceCheckUtils]: 37: Hoare triple {24747#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {24645#true} is VALID [2022-04-28 11:35:17,805 INFO L290 TraceCheckUtils]: 38: Hoare triple {24645#true} ~cond := #in~cond; {24645#true} is VALID [2022-04-28 11:35:17,805 INFO L290 TraceCheckUtils]: 39: Hoare triple {24645#true} assume !(0 == ~cond); {24645#true} is VALID [2022-04-28 11:35:17,805 INFO L290 TraceCheckUtils]: 40: Hoare triple {24645#true} assume true; {24645#true} is VALID [2022-04-28 11:35:17,805 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {24645#true} {24747#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} #87#return; {24747#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} is VALID [2022-04-28 11:35:17,806 INFO L290 TraceCheckUtils]: 42: Hoare triple {24747#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} assume !!(~r~0 >= 2 * ~b~0); {24747#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} is VALID [2022-04-28 11:35:17,806 INFO L272 TraceCheckUtils]: 43: Hoare triple {24747#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {24645#true} is VALID [2022-04-28 11:35:17,806 INFO L290 TraceCheckUtils]: 44: Hoare triple {24645#true} ~cond := #in~cond; {24645#true} is VALID [2022-04-28 11:35:17,806 INFO L290 TraceCheckUtils]: 45: Hoare triple {24645#true} assume !(0 == ~cond); {24645#true} is VALID [2022-04-28 11:35:17,806 INFO L290 TraceCheckUtils]: 46: Hoare triple {24645#true} assume true; {24645#true} is VALID [2022-04-28 11:35:17,806 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {24645#true} {24747#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} #89#return; {24747#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} is VALID [2022-04-28 11:35:17,810 INFO L290 TraceCheckUtils]: 48: Hoare triple {24747#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~b~0 (* main_~a~0 main_~y~0)))} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {24799#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= (* (div (- main_~a~0) (- 2)) main_~y~0) main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:35:17,810 INFO L290 TraceCheckUtils]: 49: Hoare triple {24799#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= (* (div (- main_~a~0) (- 2)) main_~y~0) main_~y~0) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24799#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= (* (div (- main_~a~0) (- 2)) main_~y~0) main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:35:17,811 INFO L290 TraceCheckUtils]: 50: Hoare triple {24799#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= (* (div (- main_~a~0) (- 2)) main_~y~0) main_~y~0) (= main_~q~0 0))} assume !!(#t~post7 < 5);havoc #t~post7; {24799#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= (* (div (- main_~a~0) (- 2)) main_~y~0) main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:35:17,811 INFO L272 TraceCheckUtils]: 51: Hoare triple {24799#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= (* (div (- main_~a~0) (- 2)) main_~y~0) main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {24645#true} is VALID [2022-04-28 11:35:17,811 INFO L290 TraceCheckUtils]: 52: Hoare triple {24645#true} ~cond := #in~cond; {24645#true} is VALID [2022-04-28 11:35:17,811 INFO L290 TraceCheckUtils]: 53: Hoare triple {24645#true} assume !(0 == ~cond); {24645#true} is VALID [2022-04-28 11:35:17,811 INFO L290 TraceCheckUtils]: 54: Hoare triple {24645#true} assume true; {24645#true} is VALID [2022-04-28 11:35:17,811 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {24645#true} {24799#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= (* (div (- main_~a~0) (- 2)) main_~y~0) main_~y~0) (= main_~q~0 0))} #83#return; {24799#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= (* (div (- main_~a~0) (- 2)) main_~y~0) main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:35:17,811 INFO L272 TraceCheckUtils]: 56: Hoare triple {24799#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= (* (div (- main_~a~0) (- 2)) main_~y~0) main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {24645#true} is VALID [2022-04-28 11:35:17,811 INFO L290 TraceCheckUtils]: 57: Hoare triple {24645#true} ~cond := #in~cond; {24645#true} is VALID [2022-04-28 11:35:17,811 INFO L290 TraceCheckUtils]: 58: Hoare triple {24645#true} assume !(0 == ~cond); {24645#true} is VALID [2022-04-28 11:35:17,811 INFO L290 TraceCheckUtils]: 59: Hoare triple {24645#true} assume true; {24645#true} is VALID [2022-04-28 11:35:17,812 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {24645#true} {24799#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= (* (div (- main_~a~0) (- 2)) main_~y~0) main_~y~0) (= main_~q~0 0))} #85#return; {24799#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= (* (div (- main_~a~0) (- 2)) main_~y~0) main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:35:17,812 INFO L272 TraceCheckUtils]: 61: Hoare triple {24799#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= (* (div (- main_~a~0) (- 2)) main_~y~0) main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {24645#true} is VALID [2022-04-28 11:35:17,812 INFO L290 TraceCheckUtils]: 62: Hoare triple {24645#true} ~cond := #in~cond; {24645#true} is VALID [2022-04-28 11:35:17,812 INFO L290 TraceCheckUtils]: 63: Hoare triple {24645#true} assume !(0 == ~cond); {24645#true} is VALID [2022-04-28 11:35:17,812 INFO L290 TraceCheckUtils]: 64: Hoare triple {24645#true} assume true; {24645#true} is VALID [2022-04-28 11:35:17,813 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {24645#true} {24799#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= (* (div (- main_~a~0) (- 2)) main_~y~0) main_~y~0) (= main_~q~0 0))} #87#return; {24799#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= (* (div (- main_~a~0) (- 2)) main_~y~0) main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:35:17,813 INFO L290 TraceCheckUtils]: 66: Hoare triple {24799#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= (* (div (- main_~a~0) (- 2)) main_~y~0) main_~y~0) (= main_~q~0 0))} assume !!(~r~0 >= 2 * ~b~0); {24799#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= (* (div (- main_~a~0) (- 2)) main_~y~0) main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:35:17,813 INFO L272 TraceCheckUtils]: 67: Hoare triple {24799#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= (* (div (- main_~a~0) (- 2)) main_~y~0) main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {24645#true} is VALID [2022-04-28 11:35:17,813 INFO L290 TraceCheckUtils]: 68: Hoare triple {24645#true} ~cond := #in~cond; {24645#true} is VALID [2022-04-28 11:35:17,813 INFO L290 TraceCheckUtils]: 69: Hoare triple {24645#true} assume !(0 == ~cond); {24645#true} is VALID [2022-04-28 11:35:17,813 INFO L290 TraceCheckUtils]: 70: Hoare triple {24645#true} assume true; {24645#true} is VALID [2022-04-28 11:35:17,814 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {24645#true} {24799#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= (* (div (- main_~a~0) (- 2)) main_~y~0) main_~y~0) (= main_~q~0 0))} #89#return; {24799#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= (* (div (- main_~a~0) (- 2)) main_~y~0) main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:35:17,819 INFO L290 TraceCheckUtils]: 72: Hoare triple {24799#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (div (* (- 1) main_~a~0) (- 2)) 1) (= (* (div (- main_~a~0) (- 2)) main_~y~0) main_~y~0) (= main_~q~0 0))} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {24872#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= main_~y~0 (* (div (- (div (- main_~a~0) (- 2))) (- 2)) main_~y~0)) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= main_~b~0 (* main_~y~0 4)) (= main_~q~0 0))} is VALID [2022-04-28 11:35:17,820 INFO L290 TraceCheckUtils]: 73: Hoare triple {24872#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= main_~y~0 (* (div (- (div (- main_~a~0) (- 2))) (- 2)) main_~y~0)) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= main_~b~0 (* main_~y~0 4)) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24872#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= main_~y~0 (* (div (- (div (- main_~a~0) (- 2))) (- 2)) main_~y~0)) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= main_~b~0 (* main_~y~0 4)) (= main_~q~0 0))} is VALID [2022-04-28 11:35:17,820 INFO L290 TraceCheckUtils]: 74: Hoare triple {24872#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= main_~y~0 (* (div (- (div (- main_~a~0) (- 2))) (- 2)) main_~y~0)) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= main_~b~0 (* main_~y~0 4)) (= main_~q~0 0))} assume !!(#t~post7 < 5);havoc #t~post7; {24872#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= main_~y~0 (* (div (- (div (- main_~a~0) (- 2))) (- 2)) main_~y~0)) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= main_~b~0 (* main_~y~0 4)) (= main_~q~0 0))} is VALID [2022-04-28 11:35:17,820 INFO L272 TraceCheckUtils]: 75: Hoare triple {24872#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= main_~y~0 (* (div (- (div (- main_~a~0) (- 2))) (- 2)) main_~y~0)) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= main_~b~0 (* main_~y~0 4)) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {24645#true} is VALID [2022-04-28 11:35:17,820 INFO L290 TraceCheckUtils]: 76: Hoare triple {24645#true} ~cond := #in~cond; {24645#true} is VALID [2022-04-28 11:35:17,820 INFO L290 TraceCheckUtils]: 77: Hoare triple {24645#true} assume !(0 == ~cond); {24645#true} is VALID [2022-04-28 11:35:17,820 INFO L290 TraceCheckUtils]: 78: Hoare triple {24645#true} assume true; {24645#true} is VALID [2022-04-28 11:35:17,821 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {24645#true} {24872#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= main_~y~0 (* (div (- (div (- main_~a~0) (- 2))) (- 2)) main_~y~0)) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= main_~b~0 (* main_~y~0 4)) (= main_~q~0 0))} #83#return; {24872#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= main_~y~0 (* (div (- (div (- main_~a~0) (- 2))) (- 2)) main_~y~0)) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= main_~b~0 (* main_~y~0 4)) (= main_~q~0 0))} is VALID [2022-04-28 11:35:17,821 INFO L272 TraceCheckUtils]: 80: Hoare triple {24872#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= main_~y~0 (* (div (- (div (- main_~a~0) (- 2))) (- 2)) main_~y~0)) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= main_~b~0 (* main_~y~0 4)) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {24645#true} is VALID [2022-04-28 11:35:17,821 INFO L290 TraceCheckUtils]: 81: Hoare triple {24645#true} ~cond := #in~cond; {24645#true} is VALID [2022-04-28 11:35:17,821 INFO L290 TraceCheckUtils]: 82: Hoare triple {24645#true} assume !(0 == ~cond); {24645#true} is VALID [2022-04-28 11:35:17,821 INFO L290 TraceCheckUtils]: 83: Hoare triple {24645#true} assume true; {24645#true} is VALID [2022-04-28 11:35:17,822 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {24645#true} {24872#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= main_~y~0 (* (div (- (div (- main_~a~0) (- 2))) (- 2)) main_~y~0)) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= main_~b~0 (* main_~y~0 4)) (= main_~q~0 0))} #85#return; {24872#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= main_~y~0 (* (div (- (div (- main_~a~0) (- 2))) (- 2)) main_~y~0)) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= main_~b~0 (* main_~y~0 4)) (= main_~q~0 0))} is VALID [2022-04-28 11:35:17,822 INFO L272 TraceCheckUtils]: 85: Hoare triple {24872#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= main_~y~0 (* (div (- (div (- main_~a~0) (- 2))) (- 2)) main_~y~0)) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= main_~b~0 (* main_~y~0 4)) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {24645#true} is VALID [2022-04-28 11:35:17,822 INFO L290 TraceCheckUtils]: 86: Hoare triple {24645#true} ~cond := #in~cond; {24645#true} is VALID [2022-04-28 11:35:17,822 INFO L290 TraceCheckUtils]: 87: Hoare triple {24645#true} assume !(0 == ~cond); {24645#true} is VALID [2022-04-28 11:35:17,822 INFO L290 TraceCheckUtils]: 88: Hoare triple {24645#true} assume true; {24645#true} is VALID [2022-04-28 11:35:17,822 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {24645#true} {24872#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= main_~y~0 (* (div (- (div (- main_~a~0) (- 2))) (- 2)) main_~y~0)) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= main_~b~0 (* main_~y~0 4)) (= main_~q~0 0))} #87#return; {24872#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= main_~y~0 (* (div (- (div (- main_~a~0) (- 2))) (- 2)) main_~y~0)) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= main_~b~0 (* main_~y~0 4)) (= main_~q~0 0))} is VALID [2022-04-28 11:35:17,823 INFO L290 TraceCheckUtils]: 90: Hoare triple {24872#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= main_~y~0 (* (div (- (div (- main_~a~0) (- 2))) (- 2)) main_~y~0)) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= main_~b~0 (* main_~y~0 4)) (= main_~q~0 0))} assume !!(~r~0 >= 2 * ~b~0); {24872#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= main_~y~0 (* (div (- (div (- main_~a~0) (- 2))) (- 2)) main_~y~0)) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= main_~b~0 (* main_~y~0 4)) (= main_~q~0 0))} is VALID [2022-04-28 11:35:17,823 INFO L272 TraceCheckUtils]: 91: Hoare triple {24872#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= main_~y~0 (* (div (- (div (- main_~a~0) (- 2))) (- 2)) main_~y~0)) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= main_~b~0 (* main_~y~0 4)) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {24645#true} is VALID [2022-04-28 11:35:17,823 INFO L290 TraceCheckUtils]: 92: Hoare triple {24645#true} ~cond := #in~cond; {24645#true} is VALID [2022-04-28 11:35:17,823 INFO L290 TraceCheckUtils]: 93: Hoare triple {24645#true} assume !(0 == ~cond); {24645#true} is VALID [2022-04-28 11:35:17,823 INFO L290 TraceCheckUtils]: 94: Hoare triple {24645#true} assume true; {24645#true} is VALID [2022-04-28 11:35:17,823 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {24645#true} {24872#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= main_~y~0 (* (div (- (div (- main_~a~0) (- 2))) (- 2)) main_~y~0)) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= main_~b~0 (* main_~y~0 4)) (= main_~q~0 0))} #89#return; {24872#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= main_~y~0 (* (div (- (div (- main_~a~0) (- 2))) (- 2)) main_~y~0)) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= main_~b~0 (* main_~y~0 4)) (= main_~q~0 0))} is VALID [2022-04-28 11:35:17,835 INFO L290 TraceCheckUtils]: 96: Hoare triple {24872#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= (div (* (- 1) (div (* (- 1) main_~a~0) (- 2))) (- 2)) 1) (= main_~y~0 (* (div (- (div (- main_~a~0) (- 2))) (- 2)) main_~y~0)) (= (mod (div (- main_~a~0) (- 2)) 2) 0) (= main_~b~0 (* main_~y~0 4)) (= main_~q~0 0))} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {24945#(and (= (* main_~y~0 8) main_~b~0) (= (mod main_~a~0 2) 0) (= (mod (div (- (div main_~a~0 2)) (- 2)) 2) 0) (= main_~x~0 main_~r~0) (= (mod (div main_~a~0 2) 2) 0) (= main_~y~0 (* main_~y~0 (div (- (div (- (div main_~a~0 2)) (- 2))) (- 2)))) (= main_~q~0 0) (<= (div (* (- 1) (div (* (- 1) (div main_~a~0 2)) (- 2))) (- 2)) 1))} is VALID [2022-04-28 11:35:17,836 INFO L290 TraceCheckUtils]: 97: Hoare triple {24945#(and (= (* main_~y~0 8) main_~b~0) (= (mod main_~a~0 2) 0) (= (mod (div (- (div main_~a~0 2)) (- 2)) 2) 0) (= main_~x~0 main_~r~0) (= (mod (div main_~a~0 2) 2) 0) (= main_~y~0 (* main_~y~0 (div (- (div (- (div main_~a~0 2)) (- 2))) (- 2)))) (= main_~q~0 0) (<= (div (* (- 1) (div (* (- 1) (div main_~a~0 2)) (- 2))) (- 2)) 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24945#(and (= (* main_~y~0 8) main_~b~0) (= (mod main_~a~0 2) 0) (= (mod (div (- (div main_~a~0 2)) (- 2)) 2) 0) (= main_~x~0 main_~r~0) (= (mod (div main_~a~0 2) 2) 0) (= main_~y~0 (* main_~y~0 (div (- (div (- (div main_~a~0 2)) (- 2))) (- 2)))) (= main_~q~0 0) (<= (div (* (- 1) (div (* (- 1) (div main_~a~0 2)) (- 2))) (- 2)) 1))} is VALID [2022-04-28 11:35:17,836 INFO L290 TraceCheckUtils]: 98: Hoare triple {24945#(and (= (* main_~y~0 8) main_~b~0) (= (mod main_~a~0 2) 0) (= (mod (div (- (div main_~a~0 2)) (- 2)) 2) 0) (= main_~x~0 main_~r~0) (= (mod (div main_~a~0 2) 2) 0) (= main_~y~0 (* main_~y~0 (div (- (div (- (div main_~a~0 2)) (- 2))) (- 2)))) (= main_~q~0 0) (<= (div (* (- 1) (div (* (- 1) (div main_~a~0 2)) (- 2))) (- 2)) 1))} assume !!(#t~post7 < 5);havoc #t~post7; {24945#(and (= (* main_~y~0 8) main_~b~0) (= (mod main_~a~0 2) 0) (= (mod (div (- (div main_~a~0 2)) (- 2)) 2) 0) (= main_~x~0 main_~r~0) (= (mod (div main_~a~0 2) 2) 0) (= main_~y~0 (* main_~y~0 (div (- (div (- (div main_~a~0 2)) (- 2))) (- 2)))) (= main_~q~0 0) (<= (div (* (- 1) (div (* (- 1) (div main_~a~0 2)) (- 2))) (- 2)) 1))} is VALID [2022-04-28 11:35:17,837 INFO L272 TraceCheckUtils]: 99: Hoare triple {24945#(and (= (* main_~y~0 8) main_~b~0) (= (mod main_~a~0 2) 0) (= (mod (div (- (div main_~a~0 2)) (- 2)) 2) 0) (= main_~x~0 main_~r~0) (= (mod (div main_~a~0 2) 2) 0) (= main_~y~0 (* main_~y~0 (div (- (div (- (div main_~a~0 2)) (- 2))) (- 2)))) (= main_~q~0 0) (<= (div (* (- 1) (div (* (- 1) (div main_~a~0 2)) (- 2))) (- 2)) 1))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {24645#true} is VALID [2022-04-28 11:35:17,837 INFO L290 TraceCheckUtils]: 100: Hoare triple {24645#true} ~cond := #in~cond; {24645#true} is VALID [2022-04-28 11:35:17,837 INFO L290 TraceCheckUtils]: 101: Hoare triple {24645#true} assume !(0 == ~cond); {24645#true} is VALID [2022-04-28 11:35:17,837 INFO L290 TraceCheckUtils]: 102: Hoare triple {24645#true} assume true; {24645#true} is VALID [2022-04-28 11:35:17,837 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {24645#true} {24945#(and (= (* main_~y~0 8) main_~b~0) (= (mod main_~a~0 2) 0) (= (mod (div (- (div main_~a~0 2)) (- 2)) 2) 0) (= main_~x~0 main_~r~0) (= (mod (div main_~a~0 2) 2) 0) (= main_~y~0 (* main_~y~0 (div (- (div (- (div main_~a~0 2)) (- 2))) (- 2)))) (= main_~q~0 0) (<= (div (* (- 1) (div (* (- 1) (div main_~a~0 2)) (- 2))) (- 2)) 1))} #83#return; {24945#(and (= (* main_~y~0 8) main_~b~0) (= (mod main_~a~0 2) 0) (= (mod (div (- (div main_~a~0 2)) (- 2)) 2) 0) (= main_~x~0 main_~r~0) (= (mod (div main_~a~0 2) 2) 0) (= main_~y~0 (* main_~y~0 (div (- (div (- (div main_~a~0 2)) (- 2))) (- 2)))) (= main_~q~0 0) (<= (div (* (- 1) (div (* (- 1) (div main_~a~0 2)) (- 2))) (- 2)) 1))} is VALID [2022-04-28 11:35:17,837 INFO L272 TraceCheckUtils]: 104: Hoare triple {24945#(and (= (* main_~y~0 8) main_~b~0) (= (mod main_~a~0 2) 0) (= (mod (div (- (div main_~a~0 2)) (- 2)) 2) 0) (= main_~x~0 main_~r~0) (= (mod (div main_~a~0 2) 2) 0) (= main_~y~0 (* main_~y~0 (div (- (div (- (div main_~a~0 2)) (- 2))) (- 2)))) (= main_~q~0 0) (<= (div (* (- 1) (div (* (- 1) (div main_~a~0 2)) (- 2))) (- 2)) 1))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {24645#true} is VALID [2022-04-28 11:35:17,837 INFO L290 TraceCheckUtils]: 105: Hoare triple {24645#true} ~cond := #in~cond; {24645#true} is VALID [2022-04-28 11:35:17,837 INFO L290 TraceCheckUtils]: 106: Hoare triple {24645#true} assume !(0 == ~cond); {24645#true} is VALID [2022-04-28 11:35:17,837 INFO L290 TraceCheckUtils]: 107: Hoare triple {24645#true} assume true; {24645#true} is VALID [2022-04-28 11:35:17,838 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {24645#true} {24945#(and (= (* main_~y~0 8) main_~b~0) (= (mod main_~a~0 2) 0) (= (mod (div (- (div main_~a~0 2)) (- 2)) 2) 0) (= main_~x~0 main_~r~0) (= (mod (div main_~a~0 2) 2) 0) (= main_~y~0 (* main_~y~0 (div (- (div (- (div main_~a~0 2)) (- 2))) (- 2)))) (= main_~q~0 0) (<= (div (* (- 1) (div (* (- 1) (div main_~a~0 2)) (- 2))) (- 2)) 1))} #85#return; {24945#(and (= (* main_~y~0 8) main_~b~0) (= (mod main_~a~0 2) 0) (= (mod (div (- (div main_~a~0 2)) (- 2)) 2) 0) (= main_~x~0 main_~r~0) (= (mod (div main_~a~0 2) 2) 0) (= main_~y~0 (* main_~y~0 (div (- (div (- (div main_~a~0 2)) (- 2))) (- 2)))) (= main_~q~0 0) (<= (div (* (- 1) (div (* (- 1) (div main_~a~0 2)) (- 2))) (- 2)) 1))} is VALID [2022-04-28 11:35:17,838 INFO L272 TraceCheckUtils]: 109: Hoare triple {24945#(and (= (* main_~y~0 8) main_~b~0) (= (mod main_~a~0 2) 0) (= (mod (div (- (div main_~a~0 2)) (- 2)) 2) 0) (= main_~x~0 main_~r~0) (= (mod (div main_~a~0 2) 2) 0) (= main_~y~0 (* main_~y~0 (div (- (div (- (div main_~a~0 2)) (- 2))) (- 2)))) (= main_~q~0 0) (<= (div (* (- 1) (div (* (- 1) (div main_~a~0 2)) (- 2))) (- 2)) 1))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {24645#true} is VALID [2022-04-28 11:35:17,838 INFO L290 TraceCheckUtils]: 110: Hoare triple {24645#true} ~cond := #in~cond; {24645#true} is VALID [2022-04-28 11:35:17,838 INFO L290 TraceCheckUtils]: 111: Hoare triple {24645#true} assume !(0 == ~cond); {24645#true} is VALID [2022-04-28 11:35:17,838 INFO L290 TraceCheckUtils]: 112: Hoare triple {24645#true} assume true; {24645#true} is VALID [2022-04-28 11:35:17,839 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {24645#true} {24945#(and (= (* main_~y~0 8) main_~b~0) (= (mod main_~a~0 2) 0) (= (mod (div (- (div main_~a~0 2)) (- 2)) 2) 0) (= main_~x~0 main_~r~0) (= (mod (div main_~a~0 2) 2) 0) (= main_~y~0 (* main_~y~0 (div (- (div (- (div main_~a~0 2)) (- 2))) (- 2)))) (= main_~q~0 0) (<= (div (* (- 1) (div (* (- 1) (div main_~a~0 2)) (- 2))) (- 2)) 1))} #87#return; {24945#(and (= (* main_~y~0 8) main_~b~0) (= (mod main_~a~0 2) 0) (= (mod (div (- (div main_~a~0 2)) (- 2)) 2) 0) (= main_~x~0 main_~r~0) (= (mod (div main_~a~0 2) 2) 0) (= main_~y~0 (* main_~y~0 (div (- (div (- (div main_~a~0 2)) (- 2))) (- 2)))) (= main_~q~0 0) (<= (div (* (- 1) (div (* (- 1) (div main_~a~0 2)) (- 2))) (- 2)) 1))} is VALID [2022-04-28 11:35:17,839 INFO L290 TraceCheckUtils]: 114: Hoare triple {24945#(and (= (* main_~y~0 8) main_~b~0) (= (mod main_~a~0 2) 0) (= (mod (div (- (div main_~a~0 2)) (- 2)) 2) 0) (= main_~x~0 main_~r~0) (= (mod (div main_~a~0 2) 2) 0) (= main_~y~0 (* main_~y~0 (div (- (div (- (div main_~a~0 2)) (- 2))) (- 2)))) (= main_~q~0 0) (<= (div (* (- 1) (div (* (- 1) (div main_~a~0 2)) (- 2))) (- 2)) 1))} assume !(~r~0 >= 2 * ~b~0); {25000#(and (= (* main_~y~0 8) main_~b~0) (= (mod main_~a~0 2) 0) (= (mod (div (- (div main_~a~0 2)) (- 2)) 2) 0) (= main_~x~0 main_~r~0) (not (<= (* main_~b~0 2) main_~r~0)) (= (mod (div main_~a~0 2) 2) 0) (= main_~y~0 (* main_~y~0 (div (- (div (- (div main_~a~0 2)) (- 2))) (- 2)))) (= main_~q~0 0) (<= (div (* (- 1) (div (* (- 1) (div main_~a~0 2)) (- 2))) (- 2)) 1))} is VALID [2022-04-28 11:35:17,846 INFO L290 TraceCheckUtils]: 115: Hoare triple {25000#(and (= (* main_~y~0 8) main_~b~0) (= (mod main_~a~0 2) 0) (= (mod (div (- (div main_~a~0 2)) (- 2)) 2) 0) (= main_~x~0 main_~r~0) (not (<= (* main_~b~0 2) main_~r~0)) (= (mod (div main_~a~0 2) 2) 0) (= main_~y~0 (* main_~y~0 (div (- (div (- (div main_~a~0 2)) (- 2))) (- 2)))) (= main_~q~0 0) (<= (div (* (- 1) (div (* (- 1) (div main_~a~0 2)) (- 2))) (- 2)) 1))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {25004#(and (<= (div (* (- 1) (div (* (- 1) (div main_~q~0 2)) (- 2))) (- 2)) 1) (= (mod (div (- (div main_~q~0 2)) (- 2)) 2) 0) (= main_~x~0 (+ (* main_~y~0 8) main_~r~0)) (= (mod (div main_~q~0 2) 2) 0) (= main_~y~0 (* (div (- (div (- (div main_~q~0 2)) (- 2))) (- 2)) main_~y~0)) (= (mod main_~q~0 2) 0) (not (<= (* main_~y~0 8) main_~r~0)))} is VALID [2022-04-28 11:35:17,847 INFO L290 TraceCheckUtils]: 116: Hoare triple {25004#(and (<= (div (* (- 1) (div (* (- 1) (div main_~q~0 2)) (- 2))) (- 2)) 1) (= (mod (div (- (div main_~q~0 2)) (- 2)) 2) 0) (= main_~x~0 (+ (* main_~y~0 8) main_~r~0)) (= (mod (div main_~q~0 2) 2) 0) (= main_~y~0 (* (div (- (div (- (div main_~q~0 2)) (- 2))) (- 2)) main_~y~0)) (= (mod main_~q~0 2) 0) (not (<= (* main_~y~0 8) main_~r~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25004#(and (<= (div (* (- 1) (div (* (- 1) (div main_~q~0 2)) (- 2))) (- 2)) 1) (= (mod (div (- (div main_~q~0 2)) (- 2)) 2) 0) (= main_~x~0 (+ (* main_~y~0 8) main_~r~0)) (= (mod (div main_~q~0 2) 2) 0) (= main_~y~0 (* (div (- (div (- (div main_~q~0 2)) (- 2))) (- 2)) main_~y~0)) (= (mod main_~q~0 2) 0) (not (<= (* main_~y~0 8) main_~r~0)))} is VALID [2022-04-28 11:35:17,847 INFO L290 TraceCheckUtils]: 117: Hoare triple {25004#(and (<= (div (* (- 1) (div (* (- 1) (div main_~q~0 2)) (- 2))) (- 2)) 1) (= (mod (div (- (div main_~q~0 2)) (- 2)) 2) 0) (= main_~x~0 (+ (* main_~y~0 8) main_~r~0)) (= (mod (div main_~q~0 2) 2) 0) (= main_~y~0 (* (div (- (div (- (div main_~q~0 2)) (- 2))) (- 2)) main_~y~0)) (= (mod main_~q~0 2) 0) (not (<= (* main_~y~0 8) main_~r~0)))} assume !!(#t~post6 < 5);havoc #t~post6; {25004#(and (<= (div (* (- 1) (div (* (- 1) (div main_~q~0 2)) (- 2))) (- 2)) 1) (= (mod (div (- (div main_~q~0 2)) (- 2)) 2) 0) (= main_~x~0 (+ (* main_~y~0 8) main_~r~0)) (= (mod (div main_~q~0 2) 2) 0) (= main_~y~0 (* (div (- (div (- (div main_~q~0 2)) (- 2))) (- 2)) main_~y~0)) (= (mod main_~q~0 2) 0) (not (<= (* main_~y~0 8) main_~r~0)))} is VALID [2022-04-28 11:35:17,847 INFO L272 TraceCheckUtils]: 118: Hoare triple {25004#(and (<= (div (* (- 1) (div (* (- 1) (div main_~q~0 2)) (- 2))) (- 2)) 1) (= (mod (div (- (div main_~q~0 2)) (- 2)) 2) 0) (= main_~x~0 (+ (* main_~y~0 8) main_~r~0)) (= (mod (div main_~q~0 2) 2) 0) (= main_~y~0 (* (div (- (div (- (div main_~q~0 2)) (- 2))) (- 2)) main_~y~0)) (= (mod main_~q~0 2) 0) (not (<= (* main_~y~0 8) main_~r~0)))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {24645#true} is VALID [2022-04-28 11:35:17,847 INFO L290 TraceCheckUtils]: 119: Hoare triple {24645#true} ~cond := #in~cond; {24645#true} is VALID [2022-04-28 11:35:17,848 INFO L290 TraceCheckUtils]: 120: Hoare triple {24645#true} assume !(0 == ~cond); {24645#true} is VALID [2022-04-28 11:35:17,848 INFO L290 TraceCheckUtils]: 121: Hoare triple {24645#true} assume true; {24645#true} is VALID [2022-04-28 11:35:17,848 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {24645#true} {25004#(and (<= (div (* (- 1) (div (* (- 1) (div main_~q~0 2)) (- 2))) (- 2)) 1) (= (mod (div (- (div main_~q~0 2)) (- 2)) 2) 0) (= main_~x~0 (+ (* main_~y~0 8) main_~r~0)) (= (mod (div main_~q~0 2) 2) 0) (= main_~y~0 (* (div (- (div (- (div main_~q~0 2)) (- 2))) (- 2)) main_~y~0)) (= (mod main_~q~0 2) 0) (not (<= (* main_~y~0 8) main_~r~0)))} #79#return; {25004#(and (<= (div (* (- 1) (div (* (- 1) (div main_~q~0 2)) (- 2))) (- 2)) 1) (= (mod (div (- (div main_~q~0 2)) (- 2)) 2) 0) (= main_~x~0 (+ (* main_~y~0 8) main_~r~0)) (= (mod (div main_~q~0 2) 2) 0) (= main_~y~0 (* (div (- (div (- (div main_~q~0 2)) (- 2))) (- 2)) main_~y~0)) (= (mod main_~q~0 2) 0) (not (<= (* main_~y~0 8) main_~r~0)))} is VALID [2022-04-28 11:35:17,848 INFO L272 TraceCheckUtils]: 123: Hoare triple {25004#(and (<= (div (* (- 1) (div (* (- 1) (div main_~q~0 2)) (- 2))) (- 2)) 1) (= (mod (div (- (div main_~q~0 2)) (- 2)) 2) 0) (= main_~x~0 (+ (* main_~y~0 8) main_~r~0)) (= (mod (div main_~q~0 2) 2) 0) (= main_~y~0 (* (div (- (div (- (div main_~q~0 2)) (- 2))) (- 2)) main_~y~0)) (= (mod main_~q~0 2) 0) (not (<= (* main_~y~0 8) main_~r~0)))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {24645#true} is VALID [2022-04-28 11:35:17,848 INFO L290 TraceCheckUtils]: 124: Hoare triple {24645#true} ~cond := #in~cond; {24736#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:35:17,849 INFO L290 TraceCheckUtils]: 125: Hoare triple {24736#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {24740#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:35:17,849 INFO L290 TraceCheckUtils]: 126: Hoare triple {24740#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {24740#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:35:17,849 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {24740#(not (= |__VERIFIER_assert_#in~cond| 0))} {25004#(and (<= (div (* (- 1) (div (* (- 1) (div main_~q~0 2)) (- 2))) (- 2)) 1) (= (mod (div (- (div main_~q~0 2)) (- 2)) 2) 0) (= main_~x~0 (+ (* main_~y~0 8) main_~r~0)) (= (mod (div main_~q~0 2) 2) 0) (= main_~y~0 (* (div (- (div (- (div main_~q~0 2)) (- 2))) (- 2)) main_~y~0)) (= (mod main_~q~0 2) 0) (not (<= (* main_~y~0 8) main_~r~0)))} #81#return; {25004#(and (<= (div (* (- 1) (div (* (- 1) (div main_~q~0 2)) (- 2))) (- 2)) 1) (= (mod (div (- (div main_~q~0 2)) (- 2)) 2) 0) (= main_~x~0 (+ (* main_~y~0 8) main_~r~0)) (= (mod (div main_~q~0 2) 2) 0) (= main_~y~0 (* (div (- (div (- (div main_~q~0 2)) (- 2))) (- 2)) main_~y~0)) (= (mod main_~q~0 2) 0) (not (<= (* main_~y~0 8) main_~r~0)))} is VALID [2022-04-28 11:35:17,850 INFO L290 TraceCheckUtils]: 128: Hoare triple {25004#(and (<= (div (* (- 1) (div (* (- 1) (div main_~q~0 2)) (- 2))) (- 2)) 1) (= (mod (div (- (div main_~q~0 2)) (- 2)) 2) 0) (= main_~x~0 (+ (* main_~y~0 8) main_~r~0)) (= (mod (div main_~q~0 2) 2) 0) (= main_~y~0 (* (div (- (div (- (div main_~q~0 2)) (- 2))) (- 2)) main_~y~0)) (= (mod main_~q~0 2) 0) (not (<= (* main_~y~0 8) main_~r~0)))} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {25044#(and (= main_~a~0 1) (= (mod (div (- (div main_~q~0 2)) (- 2)) 2) 0) (= main_~x~0 (+ (* main_~y~0 8) main_~r~0)) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~y~0 (* (div (* (- 1) (div (* (- 1) (div main_~q~0 2)) (- 2))) (- 2)) main_~y~0)) (= (mod (div main_~q~0 2) 2) 0) (= (mod main_~q~0 2) 0) (< main_~r~0 (* main_~y~0 8)))} is VALID [2022-04-28 11:35:17,851 INFO L290 TraceCheckUtils]: 129: Hoare triple {25044#(and (= main_~a~0 1) (= (mod (div (- (div main_~q~0 2)) (- 2)) 2) 0) (= main_~x~0 (+ (* main_~y~0 8) main_~r~0)) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~y~0 (* (div (* (- 1) (div (* (- 1) (div main_~q~0 2)) (- 2))) (- 2)) main_~y~0)) (= (mod (div main_~q~0 2) 2) 0) (= (mod main_~q~0 2) 0) (< main_~r~0 (* main_~y~0 8)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {25044#(and (= main_~a~0 1) (= (mod (div (- (div main_~q~0 2)) (- 2)) 2) 0) (= main_~x~0 (+ (* main_~y~0 8) main_~r~0)) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~y~0 (* (div (* (- 1) (div (* (- 1) (div main_~q~0 2)) (- 2))) (- 2)) main_~y~0)) (= (mod (div main_~q~0 2) 2) 0) (= (mod main_~q~0 2) 0) (< main_~r~0 (* main_~y~0 8)))} is VALID [2022-04-28 11:35:17,851 INFO L290 TraceCheckUtils]: 130: Hoare triple {25044#(and (= main_~a~0 1) (= (mod (div (- (div main_~q~0 2)) (- 2)) 2) 0) (= main_~x~0 (+ (* main_~y~0 8) main_~r~0)) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~y~0 (* (div (* (- 1) (div (* (- 1) (div main_~q~0 2)) (- 2))) (- 2)) main_~y~0)) (= (mod (div main_~q~0 2) 2) 0) (= (mod main_~q~0 2) 0) (< main_~r~0 (* main_~y~0 8)))} assume !(#t~post7 < 5);havoc #t~post7; {25044#(and (= main_~a~0 1) (= (mod (div (- (div main_~q~0 2)) (- 2)) 2) 0) (= main_~x~0 (+ (* main_~y~0 8) main_~r~0)) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~y~0 (* (div (* (- 1) (div (* (- 1) (div main_~q~0 2)) (- 2))) (- 2)) main_~y~0)) (= (mod (div main_~q~0 2) 2) 0) (= (mod main_~q~0 2) 0) (< main_~r~0 (* main_~y~0 8)))} is VALID [2022-04-28 11:35:17,857 INFO L290 TraceCheckUtils]: 131: Hoare triple {25044#(and (= main_~a~0 1) (= (mod (div (- (div main_~q~0 2)) (- 2)) 2) 0) (= main_~x~0 (+ (* main_~y~0 8) main_~r~0)) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~y~0 (* (div (* (- 1) (div (* (- 1) (div main_~q~0 2)) (- 2))) (- 2)) main_~y~0)) (= (mod (div main_~q~0 2) 2) 0) (= (mod main_~q~0 2) 0) (< main_~r~0 (* main_~y~0 8)))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {25054#(and (= main_~x~0 (+ (* main_~y~0 9) main_~r~0)) (< main_~r~0 (* 7 main_~y~0)) (<= 0 main_~r~0) (= main_~y~0 (* (div (* (- 1) (div (* (- 1) (div (+ (- 1) main_~q~0) 2)) (- 2))) (- 2)) main_~y~0)) (= (mod (div (- (div (+ (- 1) main_~q~0) 2)) (- 2)) 2) 0) (= (mod (div (+ (- 1) main_~q~0) 2) 2) 0) (= (mod (+ main_~q~0 1) 2) 0))} is VALID [2022-04-28 11:35:17,858 INFO L290 TraceCheckUtils]: 132: Hoare triple {25054#(and (= main_~x~0 (+ (* main_~y~0 9) main_~r~0)) (< main_~r~0 (* 7 main_~y~0)) (<= 0 main_~r~0) (= main_~y~0 (* (div (* (- 1) (div (* (- 1) (div (+ (- 1) main_~q~0) 2)) (- 2))) (- 2)) main_~y~0)) (= (mod (div (- (div (+ (- 1) main_~q~0) 2)) (- 2)) 2) 0) (= (mod (div (+ (- 1) main_~q~0) 2) 2) 0) (= (mod (+ main_~q~0 1) 2) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25054#(and (= main_~x~0 (+ (* main_~y~0 9) main_~r~0)) (< main_~r~0 (* 7 main_~y~0)) (<= 0 main_~r~0) (= main_~y~0 (* (div (* (- 1) (div (* (- 1) (div (+ (- 1) main_~q~0) 2)) (- 2))) (- 2)) main_~y~0)) (= (mod (div (- (div (+ (- 1) main_~q~0) 2)) (- 2)) 2) 0) (= (mod (div (+ (- 1) main_~q~0) 2) 2) 0) (= (mod (+ main_~q~0 1) 2) 0))} is VALID [2022-04-28 11:35:17,859 INFO L290 TraceCheckUtils]: 133: Hoare triple {25054#(and (= main_~x~0 (+ (* main_~y~0 9) main_~r~0)) (< main_~r~0 (* 7 main_~y~0)) (<= 0 main_~r~0) (= main_~y~0 (* (div (* (- 1) (div (* (- 1) (div (+ (- 1) main_~q~0) 2)) (- 2))) (- 2)) main_~y~0)) (= (mod (div (- (div (+ (- 1) main_~q~0) 2)) (- 2)) 2) 0) (= (mod (div (+ (- 1) main_~q~0) 2) 2) 0) (= (mod (+ main_~q~0 1) 2) 0))} assume !(#t~post6 < 5);havoc #t~post6; {25054#(and (= main_~x~0 (+ (* main_~y~0 9) main_~r~0)) (< main_~r~0 (* 7 main_~y~0)) (<= 0 main_~r~0) (= main_~y~0 (* (div (* (- 1) (div (* (- 1) (div (+ (- 1) main_~q~0) 2)) (- 2))) (- 2)) main_~y~0)) (= (mod (div (- (div (+ (- 1) main_~q~0) 2)) (- 2)) 2) 0) (= (mod (div (+ (- 1) main_~q~0) 2) 2) 0) (= (mod (+ main_~q~0 1) 2) 0))} is VALID [2022-04-28 11:35:17,863 INFO L272 TraceCheckUtils]: 134: Hoare triple {25054#(and (= main_~x~0 (+ (* main_~y~0 9) main_~r~0)) (< main_~r~0 (* 7 main_~y~0)) (<= 0 main_~r~0) (= main_~y~0 (* (div (* (- 1) (div (* (- 1) (div (+ (- 1) main_~q~0) 2)) (- 2))) (- 2)) main_~y~0)) (= (mod (div (- (div (+ (- 1) main_~q~0) 2)) (- 2)) 2) 0) (= (mod (div (+ (- 1) main_~q~0) 2) 2) 0) (= (mod (+ main_~q~0 1) 2) 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25064#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:35:17,863 INFO L290 TraceCheckUtils]: 135: Hoare triple {25064#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {25068#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:35:17,864 INFO L290 TraceCheckUtils]: 136: Hoare triple {25068#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {24646#false} is VALID [2022-04-28 11:35:17,864 INFO L290 TraceCheckUtils]: 137: Hoare triple {24646#false} assume !false; {24646#false} is VALID [2022-04-28 11:35:17,865 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 93 proven. 107 refuted. 0 times theorem prover too weak. 582 trivial. 0 not checked. [2022-04-28 11:35:17,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:35:28,884 INFO L290 TraceCheckUtils]: 137: Hoare triple {24646#false} assume !false; {24646#false} is VALID [2022-04-28 11:35:28,884 INFO L290 TraceCheckUtils]: 136: Hoare triple {25068#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {24646#false} is VALID [2022-04-28 11:35:28,885 INFO L290 TraceCheckUtils]: 135: Hoare triple {25064#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {25068#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:35:28,885 INFO L272 TraceCheckUtils]: 134: Hoare triple {25084#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25064#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:35:28,885 INFO L290 TraceCheckUtils]: 133: Hoare triple {25084#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !(#t~post6 < 5);havoc #t~post6; {25084#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:35:28,886 INFO L290 TraceCheckUtils]: 132: Hoare triple {25084#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25084#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:35:28,894 INFO L290 TraceCheckUtils]: 131: Hoare triple {25094#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {25084#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 11:35:28,895 INFO L290 TraceCheckUtils]: 130: Hoare triple {25094#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} assume !(#t~post7 < 5);havoc #t~post7; {25094#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:35:28,895 INFO L290 TraceCheckUtils]: 129: Hoare triple {25094#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {25094#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:35:28,896 INFO L290 TraceCheckUtils]: 128: Hoare triple {25104#(or (not (<= main_~y~0 main_~r~0)) (= main_~x~0 (+ main_~r~0 (* main_~y~0 (+ main_~q~0 1)) (* (- 1) main_~y~0))))} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {25094#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 11:35:28,896 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {24740#(not (= |__VERIFIER_assert_#in~cond| 0))} {24645#true} #81#return; {25104#(or (not (<= main_~y~0 main_~r~0)) (= main_~x~0 (+ main_~r~0 (* main_~y~0 (+ main_~q~0 1)) (* (- 1) main_~y~0))))} is VALID [2022-04-28 11:35:28,897 INFO L290 TraceCheckUtils]: 126: Hoare triple {24740#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {24740#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:35:28,897 INFO L290 TraceCheckUtils]: 125: Hoare triple {25117#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {24740#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:35:28,897 INFO L290 TraceCheckUtils]: 124: Hoare triple {24645#true} ~cond := #in~cond; {25117#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:35:28,897 INFO L272 TraceCheckUtils]: 123: Hoare triple {24645#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {24645#true} is VALID [2022-04-28 11:35:28,897 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {24645#true} {24645#true} #79#return; {24645#true} is VALID [2022-04-28 11:35:28,897 INFO L290 TraceCheckUtils]: 121: Hoare triple {24645#true} assume true; {24645#true} is VALID [2022-04-28 11:35:28,898 INFO L290 TraceCheckUtils]: 120: Hoare triple {24645#true} assume !(0 == ~cond); {24645#true} is VALID [2022-04-28 11:35:28,898 INFO L290 TraceCheckUtils]: 119: Hoare triple {24645#true} ~cond := #in~cond; {24645#true} is VALID [2022-04-28 11:35:28,898 INFO L272 TraceCheckUtils]: 118: Hoare triple {24645#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {24645#true} is VALID [2022-04-28 11:35:28,898 INFO L290 TraceCheckUtils]: 117: Hoare triple {24645#true} assume !!(#t~post6 < 5);havoc #t~post6; {24645#true} is VALID [2022-04-28 11:35:28,898 INFO L290 TraceCheckUtils]: 116: Hoare triple {24645#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24645#true} is VALID [2022-04-28 11:35:28,898 INFO L290 TraceCheckUtils]: 115: Hoare triple {24645#true} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {24645#true} is VALID [2022-04-28 11:35:28,898 INFO L290 TraceCheckUtils]: 114: Hoare triple {24645#true} assume !(~r~0 >= 2 * ~b~0); {24645#true} is VALID [2022-04-28 11:35:28,898 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {24645#true} {24645#true} #87#return; {24645#true} is VALID [2022-04-28 11:35:28,898 INFO L290 TraceCheckUtils]: 112: Hoare triple {24645#true} assume true; {24645#true} is VALID [2022-04-28 11:35:28,898 INFO L290 TraceCheckUtils]: 111: Hoare triple {24645#true} assume !(0 == ~cond); {24645#true} is VALID [2022-04-28 11:35:28,898 INFO L290 TraceCheckUtils]: 110: Hoare triple {24645#true} ~cond := #in~cond; {24645#true} is VALID [2022-04-28 11:35:28,898 INFO L272 TraceCheckUtils]: 109: Hoare triple {24645#true} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {24645#true} is VALID [2022-04-28 11:35:28,898 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {24645#true} {24645#true} #85#return; {24645#true} is VALID [2022-04-28 11:35:28,899 INFO L290 TraceCheckUtils]: 107: Hoare triple {24645#true} assume true; {24645#true} is VALID [2022-04-28 11:35:28,899 INFO L290 TraceCheckUtils]: 106: Hoare triple {24645#true} assume !(0 == ~cond); {24645#true} is VALID [2022-04-28 11:35:28,899 INFO L290 TraceCheckUtils]: 105: Hoare triple {24645#true} ~cond := #in~cond; {24645#true} is VALID [2022-04-28 11:35:28,899 INFO L272 TraceCheckUtils]: 104: Hoare triple {24645#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {24645#true} is VALID [2022-04-28 11:35:28,899 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {24645#true} {24645#true} #83#return; {24645#true} is VALID [2022-04-28 11:35:28,899 INFO L290 TraceCheckUtils]: 102: Hoare triple {24645#true} assume true; {24645#true} is VALID [2022-04-28 11:35:28,899 INFO L290 TraceCheckUtils]: 101: Hoare triple {24645#true} assume !(0 == ~cond); {24645#true} is VALID [2022-04-28 11:35:28,899 INFO L290 TraceCheckUtils]: 100: Hoare triple {24645#true} ~cond := #in~cond; {24645#true} is VALID [2022-04-28 11:35:28,899 INFO L272 TraceCheckUtils]: 99: Hoare triple {24645#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {24645#true} is VALID [2022-04-28 11:35:28,899 INFO L290 TraceCheckUtils]: 98: Hoare triple {24645#true} assume !!(#t~post7 < 5);havoc #t~post7; {24645#true} is VALID [2022-04-28 11:35:28,899 INFO L290 TraceCheckUtils]: 97: Hoare triple {24645#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24645#true} is VALID [2022-04-28 11:35:28,899 INFO L290 TraceCheckUtils]: 96: Hoare triple {24645#true} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {24645#true} is VALID [2022-04-28 11:35:28,899 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {24645#true} {24645#true} #89#return; {24645#true} is VALID [2022-04-28 11:35:28,899 INFO L290 TraceCheckUtils]: 94: Hoare triple {24645#true} assume true; {24645#true} is VALID [2022-04-28 11:35:28,899 INFO L290 TraceCheckUtils]: 93: Hoare triple {24645#true} assume !(0 == ~cond); {24645#true} is VALID [2022-04-28 11:35:28,900 INFO L290 TraceCheckUtils]: 92: Hoare triple {24645#true} ~cond := #in~cond; {24645#true} is VALID [2022-04-28 11:35:28,900 INFO L272 TraceCheckUtils]: 91: Hoare triple {24645#true} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {24645#true} is VALID [2022-04-28 11:35:28,900 INFO L290 TraceCheckUtils]: 90: Hoare triple {24645#true} assume !!(~r~0 >= 2 * ~b~0); {24645#true} is VALID [2022-04-28 11:35:28,900 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {24645#true} {24645#true} #87#return; {24645#true} is VALID [2022-04-28 11:35:28,900 INFO L290 TraceCheckUtils]: 88: Hoare triple {24645#true} assume true; {24645#true} is VALID [2022-04-28 11:35:28,900 INFO L290 TraceCheckUtils]: 87: Hoare triple {24645#true} assume !(0 == ~cond); {24645#true} is VALID [2022-04-28 11:35:28,900 INFO L290 TraceCheckUtils]: 86: Hoare triple {24645#true} ~cond := #in~cond; {24645#true} is VALID [2022-04-28 11:35:28,900 INFO L272 TraceCheckUtils]: 85: Hoare triple {24645#true} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {24645#true} is VALID [2022-04-28 11:35:28,900 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {24645#true} {24645#true} #85#return; {24645#true} is VALID [2022-04-28 11:35:28,900 INFO L290 TraceCheckUtils]: 83: Hoare triple {24645#true} assume true; {24645#true} is VALID [2022-04-28 11:35:28,900 INFO L290 TraceCheckUtils]: 82: Hoare triple {24645#true} assume !(0 == ~cond); {24645#true} is VALID [2022-04-28 11:35:28,900 INFO L290 TraceCheckUtils]: 81: Hoare triple {24645#true} ~cond := #in~cond; {24645#true} is VALID [2022-04-28 11:35:28,900 INFO L272 TraceCheckUtils]: 80: Hoare triple {24645#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {24645#true} is VALID [2022-04-28 11:35:28,900 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {24645#true} {24645#true} #83#return; {24645#true} is VALID [2022-04-28 11:35:28,901 INFO L290 TraceCheckUtils]: 78: Hoare triple {24645#true} assume true; {24645#true} is VALID [2022-04-28 11:35:28,901 INFO L290 TraceCheckUtils]: 77: Hoare triple {24645#true} assume !(0 == ~cond); {24645#true} is VALID [2022-04-28 11:35:28,901 INFO L290 TraceCheckUtils]: 76: Hoare triple {24645#true} ~cond := #in~cond; {24645#true} is VALID [2022-04-28 11:35:28,901 INFO L272 TraceCheckUtils]: 75: Hoare triple {24645#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {24645#true} is VALID [2022-04-28 11:35:28,901 INFO L290 TraceCheckUtils]: 74: Hoare triple {24645#true} assume !!(#t~post7 < 5);havoc #t~post7; {24645#true} is VALID [2022-04-28 11:35:28,901 INFO L290 TraceCheckUtils]: 73: Hoare triple {24645#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24645#true} is VALID [2022-04-28 11:35:28,901 INFO L290 TraceCheckUtils]: 72: Hoare triple {24645#true} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {24645#true} is VALID [2022-04-28 11:35:28,901 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {24645#true} {24645#true} #89#return; {24645#true} is VALID [2022-04-28 11:35:28,901 INFO L290 TraceCheckUtils]: 70: Hoare triple {24645#true} assume true; {24645#true} is VALID [2022-04-28 11:35:28,901 INFO L290 TraceCheckUtils]: 69: Hoare triple {24645#true} assume !(0 == ~cond); {24645#true} is VALID [2022-04-28 11:35:28,901 INFO L290 TraceCheckUtils]: 68: Hoare triple {24645#true} ~cond := #in~cond; {24645#true} is VALID [2022-04-28 11:35:28,901 INFO L272 TraceCheckUtils]: 67: Hoare triple {24645#true} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {24645#true} is VALID [2022-04-28 11:35:28,902 INFO L290 TraceCheckUtils]: 66: Hoare triple {24645#true} assume !!(~r~0 >= 2 * ~b~0); {24645#true} is VALID [2022-04-28 11:35:28,902 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {24645#true} {24645#true} #87#return; {24645#true} is VALID [2022-04-28 11:35:28,902 INFO L290 TraceCheckUtils]: 64: Hoare triple {24645#true} assume true; {24645#true} is VALID [2022-04-28 11:35:28,902 INFO L290 TraceCheckUtils]: 63: Hoare triple {24645#true} assume !(0 == ~cond); {24645#true} is VALID [2022-04-28 11:35:28,902 INFO L290 TraceCheckUtils]: 62: Hoare triple {24645#true} ~cond := #in~cond; {24645#true} is VALID [2022-04-28 11:35:28,902 INFO L272 TraceCheckUtils]: 61: Hoare triple {24645#true} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {24645#true} is VALID [2022-04-28 11:35:28,902 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {24645#true} {24645#true} #85#return; {24645#true} is VALID [2022-04-28 11:35:28,902 INFO L290 TraceCheckUtils]: 59: Hoare triple {24645#true} assume true; {24645#true} is VALID [2022-04-28 11:35:28,902 INFO L290 TraceCheckUtils]: 58: Hoare triple {24645#true} assume !(0 == ~cond); {24645#true} is VALID [2022-04-28 11:35:28,902 INFO L290 TraceCheckUtils]: 57: Hoare triple {24645#true} ~cond := #in~cond; {24645#true} is VALID [2022-04-28 11:35:28,902 INFO L272 TraceCheckUtils]: 56: Hoare triple {24645#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {24645#true} is VALID [2022-04-28 11:35:28,902 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {24645#true} {24645#true} #83#return; {24645#true} is VALID [2022-04-28 11:35:28,902 INFO L290 TraceCheckUtils]: 54: Hoare triple {24645#true} assume true; {24645#true} is VALID [2022-04-28 11:35:28,902 INFO L290 TraceCheckUtils]: 53: Hoare triple {24645#true} assume !(0 == ~cond); {24645#true} is VALID [2022-04-28 11:35:28,902 INFO L290 TraceCheckUtils]: 52: Hoare triple {24645#true} ~cond := #in~cond; {24645#true} is VALID [2022-04-28 11:35:28,902 INFO L272 TraceCheckUtils]: 51: Hoare triple {24645#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {24645#true} is VALID [2022-04-28 11:35:28,902 INFO L290 TraceCheckUtils]: 50: Hoare triple {24645#true} assume !!(#t~post7 < 5);havoc #t~post7; {24645#true} is VALID [2022-04-28 11:35:28,902 INFO L290 TraceCheckUtils]: 49: Hoare triple {24645#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24645#true} is VALID [2022-04-28 11:35:28,903 INFO L290 TraceCheckUtils]: 48: Hoare triple {24645#true} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {24645#true} is VALID [2022-04-28 11:35:28,903 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {24645#true} {24645#true} #89#return; {24645#true} is VALID [2022-04-28 11:35:28,903 INFO L290 TraceCheckUtils]: 46: Hoare triple {24645#true} assume true; {24645#true} is VALID [2022-04-28 11:35:28,903 INFO L290 TraceCheckUtils]: 45: Hoare triple {24645#true} assume !(0 == ~cond); {24645#true} is VALID [2022-04-28 11:35:28,903 INFO L290 TraceCheckUtils]: 44: Hoare triple {24645#true} ~cond := #in~cond; {24645#true} is VALID [2022-04-28 11:35:28,903 INFO L272 TraceCheckUtils]: 43: Hoare triple {24645#true} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {24645#true} is VALID [2022-04-28 11:35:28,903 INFO L290 TraceCheckUtils]: 42: Hoare triple {24645#true} assume !!(~r~0 >= 2 * ~b~0); {24645#true} is VALID [2022-04-28 11:35:28,903 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {24645#true} {24645#true} #87#return; {24645#true} is VALID [2022-04-28 11:35:28,903 INFO L290 TraceCheckUtils]: 40: Hoare triple {24645#true} assume true; {24645#true} is VALID [2022-04-28 11:35:28,903 INFO L290 TraceCheckUtils]: 39: Hoare triple {24645#true} assume !(0 == ~cond); {24645#true} is VALID [2022-04-28 11:35:28,903 INFO L290 TraceCheckUtils]: 38: Hoare triple {24645#true} ~cond := #in~cond; {24645#true} is VALID [2022-04-28 11:35:28,903 INFO L272 TraceCheckUtils]: 37: Hoare triple {24645#true} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {24645#true} is VALID [2022-04-28 11:35:28,903 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {24645#true} {24645#true} #85#return; {24645#true} is VALID [2022-04-28 11:35:28,903 INFO L290 TraceCheckUtils]: 35: Hoare triple {24645#true} assume true; {24645#true} is VALID [2022-04-28 11:35:28,903 INFO L290 TraceCheckUtils]: 34: Hoare triple {24645#true} assume !(0 == ~cond); {24645#true} is VALID [2022-04-28 11:35:28,903 INFO L290 TraceCheckUtils]: 33: Hoare triple {24645#true} ~cond := #in~cond; {24645#true} is VALID [2022-04-28 11:35:28,903 INFO L272 TraceCheckUtils]: 32: Hoare triple {24645#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {24645#true} is VALID [2022-04-28 11:35:28,903 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {24645#true} {24645#true} #83#return; {24645#true} is VALID [2022-04-28 11:35:28,903 INFO L290 TraceCheckUtils]: 30: Hoare triple {24645#true} assume true; {24645#true} is VALID [2022-04-28 11:35:28,903 INFO L290 TraceCheckUtils]: 29: Hoare triple {24645#true} assume !(0 == ~cond); {24645#true} is VALID [2022-04-28 11:35:28,903 INFO L290 TraceCheckUtils]: 28: Hoare triple {24645#true} ~cond := #in~cond; {24645#true} is VALID [2022-04-28 11:35:28,904 INFO L272 TraceCheckUtils]: 27: Hoare triple {24645#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {24645#true} is VALID [2022-04-28 11:35:28,904 INFO L290 TraceCheckUtils]: 26: Hoare triple {24645#true} assume !!(#t~post7 < 5);havoc #t~post7; {24645#true} is VALID [2022-04-28 11:35:28,904 INFO L290 TraceCheckUtils]: 25: Hoare triple {24645#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24645#true} is VALID [2022-04-28 11:35:28,904 INFO L290 TraceCheckUtils]: 24: Hoare triple {24645#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {24645#true} is VALID [2022-04-28 11:35:28,904 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {24645#true} {24645#true} #81#return; {24645#true} is VALID [2022-04-28 11:35:28,904 INFO L290 TraceCheckUtils]: 22: Hoare triple {24645#true} assume true; {24645#true} is VALID [2022-04-28 11:35:28,904 INFO L290 TraceCheckUtils]: 21: Hoare triple {24645#true} assume !(0 == ~cond); {24645#true} is VALID [2022-04-28 11:35:28,904 INFO L290 TraceCheckUtils]: 20: Hoare triple {24645#true} ~cond := #in~cond; {24645#true} is VALID [2022-04-28 11:35:28,904 INFO L272 TraceCheckUtils]: 19: Hoare triple {24645#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {24645#true} is VALID [2022-04-28 11:35:28,904 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {24645#true} {24645#true} #79#return; {24645#true} is VALID [2022-04-28 11:35:28,904 INFO L290 TraceCheckUtils]: 17: Hoare triple {24645#true} assume true; {24645#true} is VALID [2022-04-28 11:35:28,904 INFO L290 TraceCheckUtils]: 16: Hoare triple {24645#true} assume !(0 == ~cond); {24645#true} is VALID [2022-04-28 11:35:28,904 INFO L290 TraceCheckUtils]: 15: Hoare triple {24645#true} ~cond := #in~cond; {24645#true} is VALID [2022-04-28 11:35:28,904 INFO L272 TraceCheckUtils]: 14: Hoare triple {24645#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {24645#true} is VALID [2022-04-28 11:35:28,904 INFO L290 TraceCheckUtils]: 13: Hoare triple {24645#true} assume !!(#t~post6 < 5);havoc #t~post6; {24645#true} is VALID [2022-04-28 11:35:28,904 INFO L290 TraceCheckUtils]: 12: Hoare triple {24645#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24645#true} is VALID [2022-04-28 11:35:28,904 INFO L290 TraceCheckUtils]: 11: Hoare triple {24645#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {24645#true} is VALID [2022-04-28 11:35:28,904 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {24645#true} {24645#true} #77#return; {24645#true} is VALID [2022-04-28 11:35:28,904 INFO L290 TraceCheckUtils]: 9: Hoare triple {24645#true} assume true; {24645#true} is VALID [2022-04-28 11:35:28,905 INFO L290 TraceCheckUtils]: 8: Hoare triple {24645#true} assume !(0 == ~cond); {24645#true} is VALID [2022-04-28 11:35:28,905 INFO L290 TraceCheckUtils]: 7: Hoare triple {24645#true} ~cond := #in~cond; {24645#true} is VALID [2022-04-28 11:35:28,905 INFO L272 TraceCheckUtils]: 6: Hoare triple {24645#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {24645#true} is VALID [2022-04-28 11:35:28,905 INFO L290 TraceCheckUtils]: 5: Hoare triple {24645#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~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; {24645#true} is VALID [2022-04-28 11:35:28,905 INFO L272 TraceCheckUtils]: 4: Hoare triple {24645#true} call #t~ret8 := main(); {24645#true} is VALID [2022-04-28 11:35:28,905 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24645#true} {24645#true} #93#return; {24645#true} is VALID [2022-04-28 11:35:28,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {24645#true} assume true; {24645#true} is VALID [2022-04-28 11:35:28,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {24645#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {24645#true} is VALID [2022-04-28 11:35:28,905 INFO L272 TraceCheckUtils]: 0: Hoare triple {24645#true} call ULTIMATE.init(); {24645#true} is VALID [2022-04-28 11:35:28,905 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 105 proven. 1 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2022-04-28 11:35:28,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:35:28,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395394812] [2022-04-28 11:35:28,906 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:35:28,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749909747] [2022-04-28 11:35:28,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749909747] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:35:28,906 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:35:28,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9] total 20 [2022-04-28 11:35:28,906 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:35:28,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [798075193] [2022-04-28 11:35:28,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [798075193] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:35:28,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:35:28,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 11:35:28,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178768876] [2022-04-28 11:35:28,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:35:28,907 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 15 states have internal predecessors, (43), 9 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 7 states have call predecessors, (21), 8 states have call successors, (21) Word has length 138 [2022-04-28 11:35:28,907 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:35:28,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.6875) internal successors, (43), 15 states have internal predecessors, (43), 9 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 7 states have call predecessors, (21), 8 states have call successors, (21) [2022-04-28 11:35:29,089 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:35:29,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 11:35:29,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:35:29,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 11:35:29,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2022-04-28 11:35:29,090 INFO L87 Difference]: Start difference. First operand 139 states and 138 transitions. Second operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 15 states have internal predecessors, (43), 9 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 7 states have call predecessors, (21), 8 states have call successors, (21) [2022-04-28 11:35:36,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:35:36,462 INFO L93 Difference]: Finished difference Result 139 states and 138 transitions. [2022-04-28 11:35:36,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 11:35:36,463 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 15 states have internal predecessors, (43), 9 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 7 states have call predecessors, (21), 8 states have call successors, (21) Word has length 138 [2022-04-28 11:35:36,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:35:36,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 15 states have internal predecessors, (43), 9 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 7 states have call predecessors, (21), 8 states have call successors, (21) [2022-04-28 11:35:36,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 86 transitions. [2022-04-28 11:35:36,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 15 states have internal predecessors, (43), 9 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 7 states have call predecessors, (21), 8 states have call successors, (21) [2022-04-28 11:35:36,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 86 transitions. [2022-04-28 11:35:36,465 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 86 transitions. [2022-04-28 11:35:36,669 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:35:36,670 INFO L225 Difference]: With dead ends: 139 [2022-04-28 11:35:36,670 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 11:35:36,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 255 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2022-04-28 11:35:36,670 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 22 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-28 11:35:36,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 394 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-28 11:35:36,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 11:35:36,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 11:35:36,671 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:35:36,671 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 11:35:36,671 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 11:35:36,671 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 11:35:36,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:35:36,672 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 11:35:36,672 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 11:35:36,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:35:36,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:35:36,672 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 11:35:36,672 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 11:35:36,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:35:36,672 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 11:35:36,672 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 11:35:36,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:35:36,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:35:36,672 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:35:36,672 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:35:36,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 11:35:36,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 11:35:36,672 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 138 [2022-04-28 11:35:36,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:35:36,672 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 11:35:36,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 15 states have internal predecessors, (43), 9 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 7 states have call predecessors, (21), 8 states have call successors, (21) [2022-04-28 11:35:36,673 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 11:35:36,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:35:36,673 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 11:35:36,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:35:36,675 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 11:35:36,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-28 11:35:36,887 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 11:35:36,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 11:35:58,866 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 8) no Hoare annotation was computed. [2022-04-28 11:35:58,866 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 8) no Hoare annotation was computed. [2022-04-28 11:35:58,866 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 8) no Hoare annotation was computed. [2022-04-28 11:35:58,867 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 11 13) the Hoare annotation is: true [2022-04-28 11:35:58,867 INFO L895 garLoopResultBuilder]: At program point L12(line 12) the Hoare annotation is: (or (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) (not (<= 0 ~counter~0)) (not (<= ~counter~0 0))) [2022-04-28 11:35:58,867 INFO L895 garLoopResultBuilder]: At program point L12-2(lines 11 13) the Hoare annotation is: (or (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) (not (<= 0 ~counter~0)) (not (<= ~counter~0 0))) [2022-04-28 11:35:58,867 INFO L895 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 11 13) the Hoare annotation is: (or (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) (not (<= 0 ~counter~0)) (not (<= ~counter~0 0))) [2022-04-28 11:35:58,867 INFO L895 garLoopResultBuilder]: At program point L37-4(lines 37 61) the Hoare annotation is: (let ((.cse5 (<= 0 main_~r~0)) (.cse2 (= (mod (+ main_~q~0 1) 2) 0)) (.cse4 (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)) (.cse6 (<= 1 main_~y~0)) (.cse3 (= main_~b~0 (* main_~a~0 main_~y~0)))) (or (let ((.cse1 (* (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0))) (let ((.cse0 (* 2 .cse1))) (and (= main_~x~0 (+ main_~y~0 main_~r~0 .cse0)) (= (* main_~y~0 2) .cse1) (< main_~x~0 (* 4 .cse1)) (<= (+ main_~y~0 .cse0) main_~x~0) .cse2 .cse3))) (and .cse4 .cse5 (< main_~x~0 (* main_~y~0 4)) (= (+ main_~r~0 (* main_~y~0 3)) main_~x~0) .cse3) (and (= main_~x~0 (+ main_~y~0 main_~r~0)) (= main_~q~0 1) .cse6 .cse3) (not (<= |old(~counter~0)| 0)) (and (= main_~x~0 main_~r~0) (= main_~q~0 0)) (let ((.cse7 (div (+ (- 1) main_~q~0) 2))) (and (= main_~x~0 (+ (* main_~y~0 9) main_~r~0)) (< main_~r~0 (* 7 main_~y~0)) .cse5 (<= 6 ~counter~0) (= main_~y~0 (* (div (* (- 1) (div (* (- 1) .cse7) (- 2))) (- 2)) main_~y~0)) (= (mod (div (- .cse7) (- 2)) 2) 0) (= (mod .cse7 2) 0) .cse2 .cse3)) (and .cse4 (= (mod main_~q~0 2) 0) .cse6 .cse3) (not (<= 0 |old(~counter~0)|)))) [2022-04-28 11:35:58,867 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 23 65) the Hoare annotation is: true [2022-04-28 11:35:58,867 INFO L895 garLoopResultBuilder]: At program point L54(line 54) the Hoare annotation is: (let ((.cse6 (* main_~a~0 main_~y~0))) (let ((.cse0 (= main_~x~0 main_~r~0)) (.cse1 (<= (* 2 .cse6) main_~r~0)) (.cse2 (<= 1 main_~r~0)) (.cse3 (= main_~q~0 0)) (.cse4 (<= 1 main_~y~0)) (.cse5 (= main_~b~0 .cse6))) (or (and .cse0 .cse1 (= main_~b~0 (* main_~y~0 4)) .cse2 .cse3 (<= 4 ~counter~0) .cse4 .cse5) (not (<= |old(~counter~0)| 0)) (and (<= 2 ~counter~0) .cse0 .cse1 (= main_~b~0 main_~y~0) .cse3 .cse4 .cse5 (<= ~counter~0 2)) (and .cse0 (<= ~counter~0 3) .cse1 .cse3 (= main_~a~0 2) .cse4 .cse5 (<= 3 ~counter~0)) (not (<= 0 |old(~counter~0)|)) (and (= (mod main_~a~0 2) 0) .cse0 .cse1 .cse2 .cse3 (<= 5 ~counter~0) .cse4 .cse5)))) [2022-04-28 11:35:58,867 INFO L895 garLoopResultBuilder]: At program point L54-1(line 54) the Hoare annotation is: (let ((.cse7 (* main_~a~0 main_~y~0))) (let ((.cse6 (= (mod main_~a~0 2) 0)) (.cse0 (= main_~x~0 main_~r~0)) (.cse1 (<= (* 2 .cse7) main_~r~0)) (.cse2 (<= 1 main_~r~0)) (.cse3 (= main_~q~0 0)) (.cse4 (<= 1 main_~y~0)) (.cse5 (= main_~b~0 .cse7))) (or (and (<= 2 ~counter~0) .cse0 .cse1 .cse2 (= main_~b~0 main_~y~0) .cse3 .cse4 .cse5 (<= ~counter~0 2)) (not (<= |old(~counter~0)| 0)) (and .cse0 (<= ~counter~0 3) .cse1 .cse2 .cse3 (= main_~a~0 2) .cse4 .cse5 (<= 3 ~counter~0)) (and .cse6 .cse0 .cse1 (= main_~b~0 (* main_~y~0 4)) .cse2 .cse3 (<= 4 ~counter~0) .cse4 .cse5) (not (<= 0 |old(~counter~0)|)) (and .cse6 .cse0 .cse1 .cse2 .cse3 (<= 5 ~counter~0) .cse4 .cse5)))) [2022-04-28 11:35:58,867 INFO L895 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: (let ((.cse0 (= main_~b~0 main_~y~0)) (.cse3 (= main_~x~0 main_~r~0)) (.cse4 (<= 1 main_~r~0)) (.cse5 (= main_~q~0 0)) (.cse6 (<= 1 main_~y~0)) (.cse1 (= main_~b~0 (* main_~a~0 main_~y~0)))) (or (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= main_~y~0 main_~r~0) .cse0 (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))) (< main_~x~0 (* main_~y~0 4)) .cse1) (not (<= |old(~counter~0)| 0)) (let ((.cse2 (div main_~a~0 2))) (and (= (mod main_~a~0 2) 0) (= (mod (div (- .cse2) (- 2)) 2) 0) .cse3 (= (mod .cse2 2) 0) .cse4 (= main_~y~0 (* main_~y~0 (div (* (- 1) (div (* (- 1) .cse2) (- 2))) (- 2)))) .cse5 (<= 5 ~counter~0) .cse6 .cse1)) (and (<= 2 ~counter~0) .cse3 .cse4 .cse0 .cse5 .cse6 .cse1 (<= ~counter~0 2)) (and .cse3 (<= ~counter~0 4) .cse4 .cse5 (<= 4 ~counter~0) .cse6 .cse1 (= main_~a~0 4)) (and .cse3 (<= ~counter~0 3) .cse4 .cse5 (= main_~a~0 2) .cse6 .cse1 (<= 3 ~counter~0)) (not (<= 0 |old(~counter~0)|)))) [2022-04-28 11:35:58,867 INFO L895 garLoopResultBuilder]: At program point L46-1(lines 46 58) the Hoare annotation is: (let ((.cse13 (* main_~y~0 4)) (.cse8 (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)) (.cse15 (div (* (- 1) main_~q~0) (- 2))) (.cse4 (<= 1 main_~r~0)) (.cse6 (<= 1 main_~y~0)) (.cse7 (= main_~b~0 (* main_~a~0 main_~y~0)))) (let ((.cse0 (= (mod main_~a~0 2) 0)) (.cse1 (= main_~x~0 main_~r~0)) (.cse5 (= main_~q~0 0)) (.cse10 (<= main_~y~0 main_~r~0)) (.cse2 (<= (+ |main_#t~post7| 1) ~counter~0)) (.cse3 (<= 5 |main_#t~post7|)) (.cse11 (= main_~b~0 main_~y~0)) (.cse14 (or (and (= main_~x~0 (+ main_~r~0 .cse13)) .cse4 (= main_~q~0 4) .cse6 .cse7) (and .cse8 (<= 1 .cse15) .cse4 .cse6 (<= (div (+ main_~r~0 (* (- 1) main_~x~0)) (- 2)) main_~y~0) .cse7)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (let ((.cse9 (* main_~y~0 8))) (and .cse8 (= main_~x~0 (+ .cse9 main_~r~0)) .cse10 .cse2 .cse3 .cse11 .cse7 (< main_~r~0 .cse9))) (and (<= 2 ~counter~0) .cse1 .cse2 .cse4 .cse11 .cse5 .cse6 .cse7 (<= ~counter~0 2)) (let ((.cse12 (div main_~a~0 2))) (and .cse0 (= (mod (div (- .cse12) (- 2)) 2) 0) .cse1 .cse2 (= (mod .cse12 2) 0) .cse4 (= main_~y~0 (* main_~y~0 (div (* (- 1) (div (* (- 1) .cse12) (- 2))) (- 2)))) .cse5 (<= 5 ~counter~0) .cse6 .cse7)) (not (<= |old(~counter~0)| 0)) (and (not (<= .cse13 main_~x~0)) .cse10 .cse11 (= (mod main_~q~0 2) 0) (<= |main_#t~post7| 4) .cse14) (and .cse1 (<= ~counter~0 3) .cse4 .cse5 (= main_~a~0 2) .cse6 .cse7 (<= |main_#t~post7| 2) (<= 3 ~counter~0)) (and .cse1 (<= ~counter~0 4) .cse2 .cse4 .cse5 (<= 4 ~counter~0) .cse6 .cse7 (= main_~a~0 4)) (and .cse10 .cse2 .cse3 (= (* main_~y~0 .cse15) (* main_~y~0 2)) .cse11 .cse14 (< (* main_~r~0 2) main_~x~0)) (not (<= 0 |old(~counter~0)|))))) [2022-04-28 11:35:58,868 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 23 65) the Hoare annotation is: true [2022-04-28 11:35:58,868 INFO L895 garLoopResultBuilder]: At program point L46-3(lines 46 58) the Hoare annotation is: (let ((.cse11 (* main_~y~0 4)) (.cse7 (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)) (.cse13 (div (* (- 1) main_~q~0) (- 2))) (.cse2 (<= 1 main_~r~0)) (.cse5 (<= 1 main_~y~0)) (.cse6 (= main_~b~0 (* main_~a~0 main_~y~0)))) (let ((.cse9 (<= main_~y~0 main_~r~0)) (.cse12 (or (and (= main_~x~0 (+ main_~r~0 .cse11)) .cse2 (= main_~q~0 4) .cse5 .cse6) (and .cse7 (<= 1 .cse13) .cse2 .cse5 (<= (div (+ main_~r~0 (* (- 1) main_~x~0)) (- 2)) main_~y~0) .cse6))) (.cse4 (<= 5 ~counter~0)) (.cse10 (= main_~b~0 main_~y~0)) (.cse0 (= (mod main_~a~0 2) 0)) (.cse1 (= main_~x~0 main_~r~0)) (.cse3 (= main_~q~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and (<= 2 ~counter~0) .cse1 .cse2 .cse3 (= main_~a~0 2) .cse5 .cse6 (<= ~counter~0 2)) (and .cse1 (<= ~counter~0 3) .cse2 .cse3 .cse5 .cse6 (= main_~a~0 4) (<= 3 ~counter~0)) (let ((.cse8 (* main_~y~0 8))) (and .cse7 (= main_~x~0 (+ .cse8 main_~r~0)) .cse9 .cse10 .cse4 .cse6 (< main_~r~0 .cse8))) (not (<= |old(~counter~0)| 0)) (and (not (<= .cse11 main_~x~0)) (<= ~counter~0 4) .cse9 .cse10 (= (mod main_~q~0 2) 0) .cse12) (and .cse9 (= (* main_~y~0 .cse13) (* main_~y~0 2)) .cse10 .cse12 .cse4 (< (* main_~r~0 2) main_~x~0)) (and .cse1 (<= ~counter~0 1) (<= 1 ~counter~0) .cse2 .cse10 .cse3 .cse5 .cse6) (let ((.cse14 (div main_~a~0 2))) (and .cse0 (= (mod (div (- .cse14) (- 2)) 2) 0) .cse1 (= (mod .cse14 2) 0) .cse2 (= main_~y~0 (* main_~y~0 (div (* (- 1) (div (* (- 1) .cse14) (- 2))) (- 2)))) .cse3 (<= 4 ~counter~0) .cse5 .cse6)) (not (<= 0 |old(~counter~0)|))))) [2022-04-28 11:35:58,868 INFO L895 garLoopResultBuilder]: At program point L46-4(lines 46 58) the Hoare annotation is: (let ((.cse19 (* main_~y~0 (div (* (- 1) main_~q~0) (- 2)))) (.cse14 (* main_~y~0 2)) (.cse16 (* main_~b~0 2)) (.cse1 (= main_~x~0 main_~r~0)) (.cse3 (<= 1 main_~r~0)) (.cse5 (<= 1 main_~y~0)) (.cse6 (= main_~b~0 (* main_~a~0 main_~y~0)))) (let ((.cse13 (or (and .cse1 .cse3 .cse5 .cse6 (= main_~a~0 4)) (and .cse1 (<= ~counter~0 3) .cse3 (= main_~a~0 2) .cse5 .cse6))) (.cse0 (= (mod main_~a~0 2) 0)) (.cse8 (not (<= .cse16 main_~r~0))) (.cse15 (div main_~a~0 2)) (.cse4 (= main_~q~0 0)) (.cse7 (<= main_~y~0 main_~r~0)) (.cse2 (<= 6 ~counter~0)) (.cse9 (= .cse19 .cse14)) (.cse10 (= main_~b~0 main_~y~0)) (.cse11 (= (mod main_~q~0 2) 0)) (.cse12 (= main_~x~0 (+ (* 2 .cse19) main_~r~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse6) (and .cse13 (<= ~counter~0 4) .cse8 .cse4 (<= 4 ~counter~0)) (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) .cse7 .cse8 .cse10 (= main_~x~0 (+ main_~r~0 .cse14)) .cse6) (and .cse13 .cse8 (<= .cse15 1) .cse4) (and .cse0 (= (mod (div (- .cse15) (- 2)) 2) 0) .cse1 .cse8 (= (mod .cse15 2) 0) .cse3 .cse4 (<= 5 ~counter~0) (<= (div (* (- 1) (div (* (- 1) .cse15) (- 2))) (- 2)) 1) .cse5 .cse6) (not (<= |old(~counter~0)| 0)) (and .cse1 (< main_~r~0 .cse16) .cse3 .cse10 .cse4 .cse6 (<= ~counter~0 2)) (let ((.cse17 (div main_~q~0 2)) (.cse18 (* main_~y~0 8))) (and (= (mod (div (- .cse17) (- 2)) 2) 0) (= main_~x~0 (+ .cse18 main_~r~0)) .cse7 .cse2 .cse3 .cse10 (= main_~y~0 (* (div (* (- 1) (div (* (- 1) .cse17) (- 2))) (- 2)) main_~y~0)) (= (mod .cse17 2) 0) .cse11 .cse5 .cse6 (< main_~r~0 .cse18))) (and .cse7 .cse2 .cse9 .cse10 .cse11 .cse12 .cse6 (< (* main_~r~0 2) main_~x~0)) (not (<= 0 |old(~counter~0)|))))) [2022-04-28 11:35:58,868 INFO L895 garLoopResultBuilder]: At program point L38(line 38) the Hoare annotation is: (let ((.cse2 (* main_~y~0 4)) (.cse8 (<= 1 main_~y~0)) (.cse3 (= main_~b~0 (* main_~a~0 main_~y~0)))) (let ((.cse5 (* main_~y~0 2)) (.cse4 (* (- 1) main_~q~0)) (.cse9 (< main_~r~0 main_~y~0)) (.cse1 (= main_~b~0 main_~y~0)) (.cse0 (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)) (.cse6 (<= 5 ~counter~0)) (.cse7 (or (and (= main_~x~0 (+ main_~r~0 .cse2)) (= main_~q~0 4) .cse8 .cse3) (and (<= 1 (div (* (- 1) main_~a~0) (- 2))) (= main_~x~0 (+ main_~b~0 main_~r~0)) (= main_~a~0 main_~q~0) (<= (div (* (- 1) main_~b~0) (- 2)) main_~y~0) .cse8 .cse3)))) (or (and .cse0 (<= 0 main_~r~0) .cse1 (< main_~x~0 .cse2) (= (+ main_~r~0 (* main_~y~0 3)) main_~x~0) .cse3) (and (not (<= main_~x~0 (* main_~r~0 2))) (= (* main_~y~0 (div .cse4 (- 2))) .cse5) .cse6 .cse7) (not (<= |old(~counter~0)| 0)) (and (= main_~x~0 main_~r~0) (= main_~b~0 0) (<= ~counter~0 1) (<= 1 ~counter~0) (= main_~q~0 0) .cse8 .cse3) (let ((.cse11 (* (div (+ .cse4 1) (- 2)) main_~y~0))) (let ((.cse10 (* 2 .cse11))) (and .cse9 (= main_~x~0 (+ main_~y~0 main_~r~0 .cse10)) (= .cse5 .cse11) .cse1 (<= (+ main_~y~0 .cse10) main_~x~0) (= (mod (+ main_~q~0 1) 2) 0) .cse3))) (and .cse9 .cse1 (= main_~x~0 (+ main_~y~0 main_~r~0)) (= main_~q~0 1) .cse8 .cse3) (let ((.cse12 (* main_~y~0 8))) (and .cse0 (= main_~x~0 (+ .cse12 main_~r~0)) .cse6 .cse8 .cse3 (not (<= .cse12 main_~r~0)))) (and (not (<= .cse2 main_~x~0)) (<= ~counter~0 4) (<= (div main_~q~0 2) 1) (= (mod main_~q~0 2) 0) .cse7) (not (<= 0 |old(~counter~0)|))))) [2022-04-28 11:35:58,868 INFO L895 garLoopResultBuilder]: At program point L38-1(line 38) the Hoare annotation is: (let ((.cse9 (* (- 1) main_~q~0))) (let ((.cse4 (* main_~y~0 4)) (.cse10 (div .cse9 (- 2))) (.cse2 (<= 1 main_~y~0)) (.cse3 (= main_~b~0 (* main_~a~0 main_~y~0)))) (let ((.cse0 (< main_~r~0 main_~y~0)) (.cse5 (* main_~y~0 2)) (.cse6 (or (and (= main_~x~0 (+ main_~r~0 .cse4)) (= main_~q~0 4) .cse2 .cse3) (and (<= 1 .cse10) (= main_~x~0 (+ main_~b~0 main_~r~0)) (= main_~a~0 main_~q~0) (= (mod main_~q~0 2) 0) .cse2 (<= (div (+ main_~r~0 (* (- 1) main_~x~0)) (- 2)) main_~y~0) .cse3))) (.cse11 (<= 5 ~counter~0)) (.cse12 (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)) (.cse1 (<= main_~b~0 main_~y~0))) (or (and .cse0 .cse1 (= main_~x~0 (+ main_~y~0 main_~r~0)) (= main_~q~0 1) .cse2 .cse3) (and (not (<= .cse4 main_~x~0)) (<= ~counter~0 4) (= main_~x~0 (+ main_~r~0 .cse5)) .cse6) (not (<= |old(~counter~0)| 0)) (let ((.cse8 (* (div (+ .cse9 1) (- 2)) main_~y~0))) (let ((.cse7 (* 2 .cse8))) (and .cse0 (= main_~x~0 (+ main_~y~0 main_~r~0 .cse7)) (= .cse5 .cse8) .cse1 (<= (+ main_~y~0 .cse7) main_~x~0) (= (mod (+ main_~q~0 1) 2) 0) .cse3))) (and (not (<= main_~x~0 (* main_~r~0 2))) (= (* main_~y~0 .cse10) .cse5) .cse6 .cse11) (let ((.cse13 (* main_~y~0 8))) (and .cse12 (= main_~x~0 (+ .cse13 main_~r~0)) .cse11 .cse2 .cse3 (not (<= .cse13 main_~r~0)))) (and .cse12 (<= 0 main_~r~0) .cse1 (< main_~x~0 .cse4) (= (+ main_~r~0 (* main_~y~0 3)) main_~x~0) .cse3) (and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= ~counter~0 1) (<= 1 ~counter~0) (= main_~q~0 0) .cse2 .cse3) (not (<= 0 |old(~counter~0)|)))))) [2022-04-28 11:35:58,868 INFO L902 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: true [2022-04-28 11:35:58,868 INFO L895 garLoopResultBuilder]: At program point L30(line 30) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 0 ~counter~0) (<= ~counter~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-28 11:35:58,868 INFO L895 garLoopResultBuilder]: At program point mainENTRY(lines 23 65) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 0 ~counter~0) (<= ~counter~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-28 11:35:58,868 INFO L895 garLoopResultBuilder]: At program point L30-1(line 30) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 0 ~counter~0) (<= ~counter~0 0) (<= 1 main_~y~0)) (not (<= 0 |old(~counter~0)|))) [2022-04-28 11:35:58,869 INFO L895 garLoopResultBuilder]: At program point L49(lines 46 58) the Hoare annotation is: (let ((.cse0 (= main_~b~0 main_~y~0)) (.cse3 (= main_~x~0 main_~r~0)) (.cse4 (<= 1 main_~r~0)) (.cse5 (= main_~q~0 0)) (.cse6 (<= 1 main_~y~0)) (.cse1 (= main_~b~0 (* main_~a~0 main_~y~0)))) (or (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= main_~y~0 main_~r~0) .cse0 (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))) (< main_~x~0 (* main_~y~0 4)) .cse1) (not (<= |old(~counter~0)| 0)) (let ((.cse2 (div main_~a~0 2))) (and (= (mod main_~a~0 2) 0) (= (mod (div (- .cse2) (- 2)) 2) 0) .cse3 (= (mod .cse2 2) 0) .cse4 (= main_~y~0 (* main_~y~0 (div (* (- 1) (div (* (- 1) .cse2) (- 2))) (- 2)))) .cse5 (<= 5 ~counter~0) .cse6 .cse1)) (and (<= 2 ~counter~0) .cse3 .cse4 .cse0 .cse5 .cse6 .cse1 (<= ~counter~0 2)) (and .cse3 (<= ~counter~0 4) .cse4 .cse5 (<= 4 ~counter~0) .cse6 .cse1 (= main_~a~0 4)) (and .cse3 (<= ~counter~0 3) .cse4 .cse5 (= main_~a~0 2) .cse6 .cse1 (<= 3 ~counter~0)) (not (<= 0 |old(~counter~0)|)))) [2022-04-28 11:35:58,869 INFO L895 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (let ((.cse6 (= main_~b~0 main_~y~0)) (.cse1 (= main_~x~0 main_~r~0)) (.cse2 (<= 1 main_~r~0)) (.cse3 (= main_~q~0 0)) (.cse4 (<= 1 main_~y~0)) (.cse5 (= main_~b~0 (* main_~a~0 main_~y~0)))) (or (not (<= |old(~counter~0)| 0)) (let ((.cse0 (div main_~a~0 2))) (and (= (mod main_~a~0 2) 0) (= (mod (div (- .cse0) (- 2)) 2) 0) .cse1 (= (mod .cse0 2) 0) .cse2 (= main_~y~0 (* main_~y~0 (div (* (- 1) (div (* (- 1) .cse0) (- 2))) (- 2)))) .cse3 (<= 5 ~counter~0) .cse4 .cse5)) (and (not (<= (* main_~y~0 4) main_~x~0)) (<= 1 (div (* (- 1) main_~q~0) (- 2))) (<= main_~y~0 main_~r~0) .cse6 (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))) (<= (div main_~q~0 2) 1) (= (mod main_~q~0 2) 0) .cse5) (and (<= 2 ~counter~0) .cse1 .cse2 .cse6 .cse3 .cse4 .cse5 (<= ~counter~0 2)) (and .cse1 (<= ~counter~0 4) .cse2 .cse3 (<= 4 ~counter~0) .cse4 .cse5 (= main_~a~0 4)) (and .cse1 (<= ~counter~0 3) .cse2 .cse3 (= main_~a~0 2) .cse4 .cse5 (<= 3 ~counter~0)) (not (<= 0 |old(~counter~0)|)))) [2022-04-28 11:35:58,869 INFO L895 garLoopResultBuilder]: At program point L47-1(line 47) the Hoare annotation is: (let ((.cse6 (= main_~b~0 main_~y~0)) (.cse1 (= main_~x~0 main_~r~0)) (.cse2 (<= 1 main_~r~0)) (.cse3 (= main_~q~0 0)) (.cse4 (<= 1 main_~y~0)) (.cse5 (= main_~b~0 (* main_~a~0 main_~y~0)))) (or (not (<= |old(~counter~0)| 0)) (let ((.cse0 (div main_~a~0 2))) (and (= (mod main_~a~0 2) 0) (= (mod (div (- .cse0) (- 2)) 2) 0) .cse1 (= (mod .cse0 2) 0) .cse2 (= main_~y~0 (* main_~y~0 (div (* (- 1) (div (* (- 1) .cse0) (- 2))) (- 2)))) .cse3 (<= 5 ~counter~0) .cse4 .cse5)) (and (not (<= (* main_~y~0 4) main_~x~0)) (<= 1 (div (* (- 1) main_~q~0) (- 2))) (<= main_~y~0 main_~r~0) .cse6 (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))) (<= (div main_~q~0 2) 1) (= (mod main_~q~0 2) 0) .cse5) (and (<= 2 ~counter~0) .cse1 .cse2 .cse6 .cse3 .cse4 .cse5 (<= ~counter~0 2)) (and .cse1 (<= ~counter~0 4) .cse2 .cse3 (<= 4 ~counter~0) .cse4 .cse5 (= main_~a~0 4)) (and .cse1 (<= ~counter~0 3) .cse2 .cse3 (= main_~a~0 2) .cse4 .cse5 (<= 3 ~counter~0)) (not (<= 0 |old(~counter~0)|)))) [2022-04-28 11:35:58,869 INFO L895 garLoopResultBuilder]: At program point L39(lines 37 61) the Hoare annotation is: (let ((.cse9 (* (- 1) main_~q~0))) (let ((.cse4 (* main_~y~0 4)) (.cse10 (div .cse9 (- 2))) (.cse2 (<= 1 main_~y~0)) (.cse3 (= main_~b~0 (* main_~a~0 main_~y~0)))) (let ((.cse0 (< main_~r~0 main_~y~0)) (.cse5 (* main_~y~0 2)) (.cse6 (or (and (= main_~x~0 (+ main_~r~0 .cse4)) (= main_~q~0 4) .cse2 .cse3) (and (<= 1 .cse10) (= main_~x~0 (+ main_~b~0 main_~r~0)) (= main_~a~0 main_~q~0) (= (mod main_~q~0 2) 0) .cse2 (<= (div (+ main_~r~0 (* (- 1) main_~x~0)) (- 2)) main_~y~0) .cse3))) (.cse11 (<= 5 ~counter~0)) (.cse12 (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)) (.cse1 (<= main_~b~0 main_~y~0))) (or (and .cse0 .cse1 (= main_~x~0 (+ main_~y~0 main_~r~0)) (= main_~q~0 1) .cse2 .cse3) (and (not (<= .cse4 main_~x~0)) (<= ~counter~0 4) (= main_~x~0 (+ main_~r~0 .cse5)) .cse6) (not (<= |old(~counter~0)| 0)) (let ((.cse8 (* (div (+ .cse9 1) (- 2)) main_~y~0))) (let ((.cse7 (* 2 .cse8))) (and .cse0 (= main_~x~0 (+ main_~y~0 main_~r~0 .cse7)) (= .cse5 .cse8) .cse1 (<= (+ main_~y~0 .cse7) main_~x~0) (= (mod (+ main_~q~0 1) 2) 0) .cse3))) (and (not (<= main_~x~0 (* main_~r~0 2))) (= (* main_~y~0 .cse10) .cse5) .cse6 .cse11) (let ((.cse13 (* main_~y~0 8))) (and .cse12 (= main_~x~0 (+ .cse13 main_~r~0)) .cse11 .cse2 .cse3 (not (<= .cse13 main_~r~0)))) (and .cse12 (<= 0 main_~r~0) .cse1 (< main_~x~0 .cse4) (= (+ main_~r~0 (* main_~y~0 3)) main_~x~0) .cse3) (and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (<= ~counter~0 1) (<= 1 ~counter~0) (= main_~q~0 0) .cse2 .cse3) (not (<= 0 |old(~counter~0)|)))))) [2022-04-28 11:35:58,869 INFO L895 garLoopResultBuilder]: At program point L37-1(lines 37 61) the Hoare annotation is: (let ((.cse11 (* (- 1) main_~q~0))) (let ((.cse20 (* (div (+ .cse11 1) (- 2)) main_~y~0))) (let ((.cse12 (* main_~y~0 2)) (.cse21 (* 2 .cse20)) (.cse1 (* main_~y~0 4)) (.cse14 (<= 1 main_~y~0)) (.cse8 (= main_~b~0 (* main_~a~0 main_~y~0)))) (let ((.cse4 (<= 0 main_~r~0)) (.cse0 (or (and (= main_~x~0 (+ main_~r~0 .cse1)) (= main_~q~0 4) .cse14 .cse8) (and (<= 1 (div (* (- 1) main_~a~0) (- 2))) (= main_~x~0 (+ main_~b~0 main_~r~0)) (= main_~a~0 main_~q~0) (<= (div (* (- 1) main_~b~0) (- 2)) main_~y~0) (<= |main_#t~post6| 3) .cse14 .cse8))) (.cse2 (= (mod main_~q~0 2) 0)) (.cse15 (< main_~r~0 main_~y~0)) (.cse9 (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)) (.cse13 (<= 5 ~counter~0)) (.cse16 (= main_~x~0 (+ main_~y~0 main_~r~0 .cse21))) (.cse17 (= .cse12 .cse20)) (.cse3 (<= 6 |main_#t~post6|)) (.cse5 (<= 6 ~counter~0)) (.cse10 (= main_~b~0 main_~y~0)) (.cse18 (<= (+ main_~y~0 .cse21) main_~x~0)) (.cse7 (= (mod (+ main_~q~0 1) 2) 0))) (or (and .cse0 (not (<= .cse1 main_~x~0)) (<= ~counter~0 4) (<= (div main_~q~0 2) 1) .cse2) (let ((.cse6 (div (+ (- 1) main_~q~0) 2))) (and (= main_~x~0 (+ (* main_~y~0 9) main_~r~0)) (< main_~r~0 (* 7 main_~y~0)) .cse3 .cse4 .cse5 (= main_~y~0 (* (div (* (- 1) (div (* (- 1) .cse6) (- 2))) (- 2)) main_~y~0)) (= (mod (div (- .cse6) (- 2)) 2) 0) (= (mod .cse6 2) 0) .cse7 .cse8)) (and .cse9 .cse4 .cse10 (< main_~x~0 .cse1) (= (+ main_~r~0 (* main_~y~0 3)) main_~x~0) .cse8) (and (not (<= main_~x~0 (* main_~r~0 2))) .cse0 (= (* main_~y~0 (div .cse11 (- 2))) .cse12) .cse13) (and .cse9 .cse3 .cse5 .cse2 .cse14 .cse8) (not (<= |old(~counter~0)| 0)) (and .cse15 .cse10 (= main_~x~0 (+ main_~y~0 main_~r~0)) (<= |main_#t~post6| 2) (= main_~q~0 1) .cse14 .cse8) (and .cse15 .cse16 .cse17 .cse10 .cse18 .cse7 .cse8) (and (= main_~x~0 main_~r~0) (= main_~b~0 0) (<= ~counter~0 1) (<= 1 ~counter~0) (<= |main_#t~post6| 0) (= main_~q~0 0) .cse14 .cse8) (let ((.cse19 (* main_~y~0 8))) (and .cse9 (= main_~x~0 (+ .cse19 main_~r~0)) .cse13 .cse14 .cse8 (not (<= .cse19 main_~r~0)))) (and .cse16 .cse17 .cse3 .cse5 (< main_~x~0 (* 4 .cse20)) .cse10 .cse18 .cse7 .cse8) (not (<= 0 |old(~counter~0)|))))))) [2022-04-28 11:35:58,869 INFO L895 garLoopResultBuilder]: At program point L37-3(lines 37 61) the Hoare annotation is: (let ((.cse3 (* (div (+ (* (- 1) main_~q~0) 1) (- 2)) main_~y~0))) (let ((.cse10 (* main_~y~0 4)) (.cse12 (<= 1 main_~y~0)) (.cse7 (= main_~b~0 (* main_~a~0 main_~y~0))) (.cse17 (* 2 .cse3))) (let ((.cse11 (< main_~r~0 main_~y~0)) (.cse0 (= main_~x~0 (+ main_~y~0 main_~r~0 .cse17))) (.cse1 (= (* main_~y~0 2) .cse3)) (.cse4 (= main_~b~0 main_~y~0)) (.cse5 (<= (+ main_~y~0 .cse17) main_~x~0)) (.cse13 (= (mod main_~q~0 2) 0)) (.cse14 (or (and (= main_~x~0 (+ main_~r~0 .cse10)) (= main_~q~0 4) .cse12 .cse7) (and (<= ~counter~0 3) (<= 1 (div (* (- 1) main_~a~0) (- 2))) (= main_~x~0 (+ main_~b~0 main_~r~0)) (= main_~a~0 main_~q~0) (<= (div (* (- 1) main_~b~0) (- 2)) main_~y~0) .cse12 .cse7))) (.cse9 (<= 0 main_~r~0)) (.cse2 (<= 6 ~counter~0)) (.cse6 (= (mod (+ main_~q~0 1) 2) 0)) (.cse8 (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0))) (or (and .cse0 .cse1 .cse2 (< main_~x~0 (* 4 .cse3)) .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse9 .cse4 (< main_~x~0 .cse10) (= (+ main_~r~0 (* main_~y~0 3)) main_~x~0) .cse7) (and .cse11 .cse4 (= main_~x~0 (+ main_~y~0 main_~r~0)) (= main_~q~0 1) .cse12 .cse7 (<= ~counter~0 2)) (and .cse8 .cse2 .cse13 .cse12 .cse7) (not (<= |old(~counter~0)| 0)) (and .cse11 .cse0 .cse1 .cse4 .cse5 .cse6 .cse7) (and (not (<= main_~x~0 (* main_~r~0 2))) (<= ~counter~0 4) (<= 4 ~counter~0) .cse14) (and (not (<= .cse10 main_~x~0)) (<= (div main_~q~0 2) 1) .cse13 .cse14) (and (= main_~x~0 main_~r~0) (= main_~b~0 0) (<= 0 ~counter~0) (<= ~counter~0 0) (= main_~q~0 0) .cse12 .cse7) (let ((.cse15 (div (+ (- 1) main_~q~0) 2))) (and (= main_~x~0 (+ (* main_~y~0 9) main_~r~0)) (< main_~r~0 (* 7 main_~y~0)) .cse9 .cse2 (= main_~y~0 (* (div (* (- 1) (div (* (- 1) .cse15) (- 2))) (- 2)) main_~y~0)) (= (mod (div (- .cse15) (- 2)) 2) 0) (= (mod .cse15 2) 0) .cse6 .cse7)) (let ((.cse16 (* main_~y~0 8))) (and .cse8 (= main_~x~0 (+ .cse16 main_~r~0)) (<= 5 ~counter~0) .cse12 .cse7 (not (<= .cse16 main_~r~0)))) (not (<= 0 |old(~counter~0)|)))))) [2022-04-28 11:35:58,869 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (and (<= 0 ~counter~0) (<= ~counter~0 0)) [2022-04-28 11:35:58,869 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 11:35:58,869 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (and (<= 0 ~counter~0) (<= ~counter~0 0)) [2022-04-28 11:35:58,869 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 11:35:58,870 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (and (<= 0 ~counter~0) (<= ~counter~0 0)) [2022-04-28 11:35:58,870 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 11:35:58,870 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 11:35:58,870 INFO L895 garLoopResultBuilder]: At program point L16(lines 16 17) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 11:35:58,870 INFO L895 garLoopResultBuilder]: At program point L15(lines 15 18) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-28 11:35:58,870 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-04-28 11:35:58,870 INFO L895 garLoopResultBuilder]: At program point L15-2(lines 14 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-28 11:35:58,870 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 14 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-28 11:35:58,870 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 11:35:58,872 INFO L356 BasicCegarLoop]: Path program histogram: [10, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-28 11:35:58,873 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 11:35:58,875 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 11:35:58,878 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 11:35:59,429 INFO L163 areAnnotationChecker]: CFG has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 11:35:59,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 11:35:59 BoogieIcfgContainer [2022-04-28 11:35:59,449 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 11:35:59,450 INFO L158 Benchmark]: Toolchain (without parser) took 721712.87ms. Allocated memory was 182.5MB in the beginning and 219.2MB in the end (delta: 36.7MB). Free memory was 133.9MB in the beginning and 173.4MB in the end (delta: -39.5MB). Peak memory consumption was 110.2MB. Max. memory is 8.0GB. [2022-04-28 11:35:59,451 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 182.5MB. Free memory is still 150.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 11:35:59,451 INFO L158 Benchmark]: CACSL2BoogieTranslator took 168.56ms. Allocated memory is still 182.5MB. Free memory was 133.6MB in the beginning and 158.5MB in the end (delta: -25.0MB). Peak memory consumption was 11.0MB. Max. memory is 8.0GB. [2022-04-28 11:35:59,451 INFO L158 Benchmark]: Boogie Preprocessor took 39.18ms. Allocated memory is still 182.5MB. Free memory was 158.5MB in the beginning and 157.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 11:35:59,451 INFO L158 Benchmark]: RCFGBuilder took 279.01ms. Allocated memory is still 182.5MB. Free memory was 157.0MB in the beginning and 144.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-28 11:35:59,451 INFO L158 Benchmark]: TraceAbstraction took 721222.33ms. Allocated memory was 182.5MB in the beginning and 219.2MB in the end (delta: 36.7MB). Free memory was 143.9MB in the beginning and 173.4MB in the end (delta: -29.6MB). Peak memory consumption was 120.3MB. Max. memory is 8.0GB. [2022-04-28 11:35:59,452 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.11ms. Allocated memory is still 182.5MB. Free memory is still 150.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 168.56ms. Allocated memory is still 182.5MB. Free memory was 133.6MB in the beginning and 158.5MB in the end (delta: -25.0MB). Peak memory consumption was 11.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.18ms. Allocated memory is still 182.5MB. Free memory was 158.5MB in the beginning and 157.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 279.01ms. Allocated memory is still 182.5MB. Free memory was 157.0MB in the beginning and 144.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 721222.33ms. Allocated memory was 182.5MB in the beginning and 219.2MB in the end (delta: 36.7MB). Free memory was 143.9MB in the beginning and 173.4MB in the end (delta: -29.6MB). Peak memory consumption was 120.3MB. 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 - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 41 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 720.6s, OverallIterations: 22, TraceHistogramMax: 20, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 35.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 22.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 602 SdHoareTripleChecker+Valid, 11.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 499 mSDsluCounter, 4289 SdHoareTripleChecker+Invalid, 11.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3208 mSDsCounter, 354 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4535 IncrementalHoareTripleChecker+Invalid, 4889 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 354 mSolverCounterUnsat, 1081 mSDtfsCounter, 4535 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2664 GetRequests, 2438 SyntacticMatches, 19 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 678 ImplicationChecksByTransitivity, 5.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=244occurred in iteration=19, InterpolantAutomatonStates: 184, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 81 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 38 LocationsWithAnnotation, 1196 PreInvPairs, 1460 NumberOfFragments, 4627 HoareAnnotationTreeSize, 1196 FomulaSimplifications, 1265 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 38 FomulaSimplificationsInter, 36514 FormulaSimplificationTreeSizeReductionInter, 20.7s HoareSimplificationTimeInter, 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: ((((((((((((((a % 2 == 0 && x == r) && 1 <= r) && q == 0) && 5 <= counter) && 1 <= y) && b == a * y) || (((((((2 <= counter && x == r) && 1 <= r) && q == 0) && a == 2) && 1 <= y) && b == a * y) && counter <= 2)) || (((((((x == r && counter <= 3) && 1 <= r) && q == 0) && 1 <= y) && b == a * y) && a == 4) && 3 <= counter)) || ((((((q * y + r == x && x == y * 8 + r) && y <= r) && b == y) && 5 <= counter) && b == a * y) && r < y * 8)) || !(\old(counter) <= 0)) || (((((!(y * 4 <= x) && counter <= 4) && y <= r) && b == y) && q % 2 == 0) && (((((x == r + y * 4 && 1 <= r) && q == 4) && 1 <= y) && b == a * y) || (((((q * y + r == x && 1 <= -1 * q / -2) && 1 <= r) && 1 <= y) && (r + -1 * x) / -2 <= y) && b == a * y)))) || (((((y <= r && y * (-1 * q / -2) == y * 2) && b == y) && (((((x == r + y * 4 && 1 <= r) && q == 4) && 1 <= y) && b == a * y) || (((((q * y + r == x && 1 <= -1 * q / -2) && 1 <= r) && 1 <= y) && (r + -1 * x) / -2 <= y) && b == a * y))) && 5 <= counter) && r * 2 < x)) || (((((((x == r && counter <= 1) && 1 <= counter) && 1 <= r) && b == y) && q == 0) && 1 <= y) && b == a * y)) || (((((((((a % 2 == 0 && -(a / 2) / -2 % 2 == 0) && x == r) && a / 2 % 2 == 0) && 1 <= r) && y == y * (-1 * (-1 * (a / 2) / -2) / -2)) && q == 0) && 4 <= counter) && 1 <= y) && b == a * y)) || !(0 <= \old(counter)) - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: (((((((((((((((((x == y + r + 2 * ((-1 * q + 1) / -2 * y) && y * 2 == (-1 * q + 1) / -2 * y) && 6 <= counter) && x < 4 * ((-1 * q + 1) / -2 * y)) && b == y) && y + 2 * ((-1 * q + 1) / -2 * y) <= x) && (q + 1) % 2 == 0) && b == a * y) || (((((q * y + r == x && 0 <= r) && b == y) && x < y * 4) && r + y * 3 == x) && b == a * y)) || ((((((r < y && b == y) && x == y + r) && q == 1) && 1 <= y) && b == a * y) && counter <= 2)) || ((((q * y + r == x && 6 <= counter) && q % 2 == 0) && 1 <= y) && b == a * y)) || !(\old(counter) <= 0)) || ((((((r < y && x == y + r + 2 * ((-1 * q + 1) / -2 * y)) && y * 2 == (-1 * q + 1) / -2 * y) && b == y) && y + 2 * ((-1 * q + 1) / -2 * y) <= x) && (q + 1) % 2 == 0) && b == a * y)) || (((!(x <= r * 2) && counter <= 4) && 4 <= counter) && ((((x == r + y * 4 && q == 4) && 1 <= y) && b == a * y) || ((((((counter <= 3 && 1 <= -1 * a / -2) && x == b + r) && a == q) && -1 * b / -2 <= y) && 1 <= y) && b == a * y)))) || (((!(y * 4 <= x) && q / 2 <= 1) && q % 2 == 0) && ((((x == r + y * 4 && q == 4) && 1 <= y) && b == a * y) || ((((((counter <= 3 && 1 <= -1 * a / -2) && x == b + r) && a == q) && -1 * b / -2 <= y) && 1 <= y) && b == a * y)))) || ((((((x == r && b == 0) && 0 <= counter) && counter <= 0) && q == 0) && 1 <= y) && b == a * y)) || ((((((((x == y * 9 + r && r < 7 * y) && 0 <= r) && 6 <= counter) && y == -1 * (-1 * ((-1 + q) / 2) / -2) / -2 * y) && -((-1 + q) / 2) / -2 % 2 == 0) && (-1 + q) / 2 % 2 == 0) && (q + 1) % 2 == 0) && b == a * y)) || (((((q * y + r == x && x == y * 8 + r) && 5 <= counter) && 1 <= y) && b == a * y) && !(y * 8 <= r))) || !(0 <= \old(counter)) - ProcedureContractResult [Line: 11]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: ((!(\old(cond) == 0) && cond == \old(cond)) || !(0 <= counter)) || !(counter <= 0) - ProcedureContractResult [Line: 23]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == cond || !(1 <= \old(cond)) RESULT: Ultimate proved your program to be correct! [2022-04-28 11:35:59,675 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-04-28 11:35:59,719 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 137 Received shutdown request...