/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_unwindbound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 11:19:24,830 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 11:19:24,832 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 11:19:24,867 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 11:19:24,868 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 11:19:24,869 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 11:19:24,871 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 11:19:24,873 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 11:19:24,875 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 11:19:24,879 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 11:19:24,879 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 11:19:24,880 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 11:19:24,881 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 11:19:24,882 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 11:19:24,883 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 11:19:24,885 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 11:19:24,886 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 11:19:24,886 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 11:19:24,888 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 11:19:24,892 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 11:19:24,894 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 11:19:24,895 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 11:19:24,895 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 11:19:24,896 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 11:19:24,897 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 11:19:24,902 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 11:19:24,902 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 11:19:24,902 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 11:19:24,903 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 11:19:24,903 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 11:19:24,904 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 11:19:24,904 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 11:19:24,905 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 11:19:24,906 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 11:19:24,906 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 11:19:24,906 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 11:19:24,906 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 11:19:24,907 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 11:19:24,907 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 11:19:24,907 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 11:19:24,908 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 11:19:24,909 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 11:19:24,909 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 11:19:24,918 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 11:19:24,918 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 11:19:24,919 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 11:19:24,919 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 11:19:24,919 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 11:19:24,919 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 11:19:24,919 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 11:19:24,919 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 11:19:24,919 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 11:19:24,920 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 11:19:24,920 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 11:19:24,920 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 11:19:24,920 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 11:19:24,920 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 11:19:24,921 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 11:19:24,921 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 11:19:24,921 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 11:19:24,921 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 11:19:24,921 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 11:19:24,921 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 11:19:24,921 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 11:19:24,921 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 11:19:24,921 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-08 11:19:25,129 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 11:19:25,152 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 11:19:25,153 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 11:19:25,154 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 11:19:25,159 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 11:19:25,160 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_unwindbound10.c [2022-04-08 11:19:25,208 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06ef45fc6/df4bf488c5b841ef9c8aae0855347d50/FLAGa87d55682 [2022-04-08 11:19:25,568 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 11:19:25,569 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_unwindbound10.c [2022-04-08 11:19:25,574 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06ef45fc6/df4bf488c5b841ef9c8aae0855347d50/FLAGa87d55682 [2022-04-08 11:19:25,587 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06ef45fc6/df4bf488c5b841ef9c8aae0855347d50 [2022-04-08 11:19:25,589 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 11:19:25,590 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 11:19:25,592 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 11:19:25,592 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 11:19:25,595 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 11:19:25,596 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 11:19:25" (1/1) ... [2022-04-08 11:19:25,597 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@852f82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:19:25, skipping insertion in model container [2022-04-08 11:19:25,597 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 11:19:25" (1/1) ... [2022-04-08 11:19:25,602 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 11:19:25,613 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 11:19:25,760 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_unwindbound10.c[576,589] [2022-04-08 11:19:25,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 11:19:25,792 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 11:19:25,803 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_unwindbound10.c[576,589] [2022-04-08 11:19:25,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 11:19:25,829 INFO L208 MainTranslator]: Completed translation [2022-04-08 11:19:25,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:19:25 WrapperNode [2022-04-08 11:19:25,830 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 11:19:25,831 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 11:19:25,831 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 11:19:25,831 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 11:19:25,839 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:19:25" (1/1) ... [2022-04-08 11:19:25,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:19:25" (1/1) ... [2022-04-08 11:19:25,844 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:19:25" (1/1) ... [2022-04-08 11:19:25,844 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:19:25" (1/1) ... [2022-04-08 11:19:25,856 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:19:25" (1/1) ... [2022-04-08 11:19:25,861 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:19:25" (1/1) ... [2022-04-08 11:19:25,866 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:19:25" (1/1) ... [2022-04-08 11:19:25,868 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 11:19:25,869 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 11:19:25,869 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 11:19:25,870 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 11:19:25,870 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:19:25" (1/1) ... [2022-04-08 11:19:25,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 11:19:25,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:19:25,892 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-08 11:19:25,897 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-08 11:19:25,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 11:19:25,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 11:19:25,919 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 11:19:25,919 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 11:19:25,920 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 11:19:25,920 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 11:19:25,920 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 11:19:25,920 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 11:19:25,920 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 11:19:25,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 11:19:25,920 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 11:19:25,920 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 11:19:25,920 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 11:19:25,920 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 11:19:25,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 11:19:25,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 11:19:25,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 11:19:25,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 11:19:25,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 11:19:25,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 11:19:25,967 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 11:19:25,968 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 11:19:26,138 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 11:19:26,143 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 11:19:26,143 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-08 11:19:26,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 11:19:26 BoogieIcfgContainer [2022-04-08 11:19:26,144 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 11:19:26,145 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 11:19:26,145 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 11:19:26,148 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 11:19:26,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 11:19:25" (1/3) ... [2022-04-08 11:19:26,148 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cc0b800 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 11:19:26, skipping insertion in model container [2022-04-08 11:19:26,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:19:25" (2/3) ... [2022-04-08 11:19:26,149 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cc0b800 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 11:19:26, skipping insertion in model container [2022-04-08 11:19:26,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 11:19:26" (3/3) ... [2022-04-08 11:19:26,149 INFO L111 eAbstractionObserver]: Analyzing ICFG cohendiv-ll_unwindbound10.c [2022-04-08 11:19:26,153 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 11:19:26,153 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 11:19:26,181 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 11:19:26,185 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 11:19:26,186 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 11:19:26,197 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-08 11:19:26,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 11:19:26,203 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:19:26,203 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:19:26,204 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:19:26,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:19:26,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1588022502, now seen corresponding path program 1 times [2022-04-08 11:19:26,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:19:26,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1523490297] [2022-04-08 11:19:26,226 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:19:26,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1588022502, now seen corresponding path program 2 times [2022-04-08 11:19:26,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:19:26,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964098598] [2022-04-08 11:19:26,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:19:26,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:19:26,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:19:26,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 11:19:26,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:19:26,411 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-08 11:19:26,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume true; {41#true} is VALID [2022-04-08 11:19:26,412 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41#true} {41#true} #93#return; {41#true} is VALID [2022-04-08 11:19:26,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 11:19:26,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:19:26,426 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-08 11:19:26,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-08 11:19:26,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-08 11:19:26,427 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {41#true} #77#return; {42#false} is VALID [2022-04-08 11:19:26,428 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-08 11:19:26,429 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-08 11:19:26,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#true} assume true; {41#true} is VALID [2022-04-08 11:19:26,429 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#true} {41#true} #93#return; {41#true} is VALID [2022-04-08 11:19:26,429 INFO L272 TraceCheckUtils]: 4: Hoare triple {41#true} call #t~ret8 := main(); {41#true} is VALID [2022-04-08 11:19:26,430 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-08 11:19:26,430 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-08 11:19:26,430 INFO L290 TraceCheckUtils]: 7: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-08 11:19:26,431 INFO L290 TraceCheckUtils]: 8: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-08 11:19:26,431 INFO L290 TraceCheckUtils]: 9: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-08 11:19:26,431 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {42#false} {41#true} #77#return; {42#false} is VALID [2022-04-08 11:19:26,433 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-08 11:19:26,433 INFO L290 TraceCheckUtils]: 12: Hoare triple {42#false} assume !true; {42#false} is VALID [2022-04-08 11:19:26,433 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-08 11:19:26,433 INFO L290 TraceCheckUtils]: 14: Hoare triple {42#false} ~cond := #in~cond; {42#false} is VALID [2022-04-08 11:19:26,433 INFO L290 TraceCheckUtils]: 15: Hoare triple {42#false} assume 0 == ~cond; {42#false} is VALID [2022-04-08 11:19:26,434 INFO L290 TraceCheckUtils]: 16: Hoare triple {42#false} assume !false; {42#false} is VALID [2022-04-08 11:19:26,434 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-08 11:19:26,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:19:26,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964098598] [2022-04-08 11:19:26,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964098598] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:19:26,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:19:26,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 11:19:26,438 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:19:26,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1523490297] [2022-04-08 11:19:26,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1523490297] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:19:26,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:19:26,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 11:19:26,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508110177] [2022-04-08 11:19:26,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:19:26,443 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-08 11:19:26,444 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:19:26,446 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-08 11:19:26,473 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-08 11:19:26,474 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 11:19:26,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:19:26,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 11:19:26,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 11:19:26,495 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-08 11:19:26,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:19:26,712 INFO L93 Difference]: Finished difference Result 68 states and 101 transitions. [2022-04-08 11:19:26,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 11:19:26,713 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-08 11:19:26,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:19:26,714 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-08 11:19:26,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-08 11:19:26,728 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-08 11:19:26,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-08 11:19:26,733 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 101 transitions. [2022-04-08 11:19:26,841 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-08 11:19:26,850 INFO L225 Difference]: With dead ends: 68 [2022-04-08 11:19:26,850 INFO L226 Difference]: Without dead ends: 34 [2022-04-08 11:19:26,853 INFO L912 BasicCegarLoop]: 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-08 11:19:26,856 INFO L913 BasicCegarLoop]: 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-08 11:19:26,858 INFO L914 BasicCegarLoop]: 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-08 11:19:26,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-08 11:19:26,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-04-08 11:19:26,886 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:19:26,887 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-08 11:19:26,888 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-08 11:19:26,889 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-08 11:19:26,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:19:26,894 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-08 11:19:26,894 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-08 11:19:26,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:19:26,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:19:26,895 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-08 11:19:26,896 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-08 11:19:26,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:19:26,912 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-08 11:19:26,912 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-08 11:19:26,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:19:26,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:19:26,916 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:19:26,916 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:19:26,921 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-08 11:19:26,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2022-04-08 11:19:26,927 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 17 [2022-04-08 11:19:26,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:19:26,927 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2022-04-08 11:19:26,927 INFO L479 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-08 11:19:26,927 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 42 transitions. [2022-04-08 11:19:26,963 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-08 11:19:26,964 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2022-04-08 11:19:26,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 11:19:26,964 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:19:26,965 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:19:26,965 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 11:19:26,965 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:19:26,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:19:26,967 INFO L85 PathProgramCache]: Analyzing trace with hash 766070672, now seen corresponding path program 1 times [2022-04-08 11:19:26,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:19:26,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1035178355] [2022-04-08 11:19:26,975 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:19:26,975 INFO L85 PathProgramCache]: Analyzing trace with hash 766070672, now seen corresponding path program 2 times [2022-04-08 11:19:26,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:19:26,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908944801] [2022-04-08 11:19:26,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:19:26,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:19:26,995 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:19:26,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1220342148] [2022-04-08 11:19:26,995 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:19:26,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:19:26,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:19:26,999 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-08 11:19:27,000 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-08 11:19:27,047 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 11:19:27,048 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:19:27,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 11:19:27,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:19:27,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:19:27,255 INFO L272 TraceCheckUtils]: 0: Hoare triple {323#true} call ULTIMATE.init(); {323#true} is VALID [2022-04-08 11:19:27,256 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-08 11:19:27,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {331#(<= ~counter~0 0)} assume true; {331#(<= ~counter~0 0)} is VALID [2022-04-08 11:19:27,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {331#(<= ~counter~0 0)} {323#true} #93#return; {331#(<= ~counter~0 0)} is VALID [2022-04-08 11:19:27,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {331#(<= ~counter~0 0)} call #t~ret8 := main(); {331#(<= ~counter~0 0)} is VALID [2022-04-08 11:19:27,258 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-08 11:19:27,260 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-08 11:19:27,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {331#(<= ~counter~0 0)} ~cond := #in~cond; {331#(<= ~counter~0 0)} is VALID [2022-04-08 11:19:27,261 INFO L290 TraceCheckUtils]: 8: Hoare triple {331#(<= ~counter~0 0)} assume !(0 == ~cond); {331#(<= ~counter~0 0)} is VALID [2022-04-08 11:19:27,262 INFO L290 TraceCheckUtils]: 9: Hoare triple {331#(<= ~counter~0 0)} assume true; {331#(<= ~counter~0 0)} is VALID [2022-04-08 11:19:27,268 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {331#(<= ~counter~0 0)} {331#(<= ~counter~0 0)} #77#return; {331#(<= ~counter~0 0)} is VALID [2022-04-08 11:19:27,269 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-08 11:19:27,270 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-08 11:19:27,270 INFO L290 TraceCheckUtils]: 13: Hoare triple {365#(<= |main_#t~post6| 0)} assume !(#t~post6 < 10);havoc #t~post6; {324#false} is VALID [2022-04-08 11:19:27,270 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-08 11:19:27,271 INFO L290 TraceCheckUtils]: 15: Hoare triple {324#false} ~cond := #in~cond; {324#false} is VALID [2022-04-08 11:19:27,271 INFO L290 TraceCheckUtils]: 16: Hoare triple {324#false} assume 0 == ~cond; {324#false} is VALID [2022-04-08 11:19:27,271 INFO L290 TraceCheckUtils]: 17: Hoare triple {324#false} assume !false; {324#false} is VALID [2022-04-08 11:19:27,271 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-08 11:19:27,271 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:19:27,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:19:27,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908944801] [2022-04-08 11:19:27,272 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:19:27,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220342148] [2022-04-08 11:19:27,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220342148] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:19:27,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:19:27,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 11:19:27,273 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:19:27,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1035178355] [2022-04-08 11:19:27,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1035178355] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:19:27,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:19:27,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 11:19:27,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466328051] [2022-04-08 11:19:27,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:19:27,275 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-08 11:19:27,275 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:19:27,275 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-08 11:19:27,288 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-08 11:19:27,288 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 11:19:27,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:19:27,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 11:19:27,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 11:19:27,289 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-08 11:19:27,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:19:27,358 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-08 11:19:27,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 11:19:27,359 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-08 11:19:27,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:19:27,359 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-08 11:19:27,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-04-08 11:19:27,361 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-08 11:19:27,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-04-08 11:19:27,362 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 51 transitions. [2022-04-08 11:19:27,398 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-08 11:19:27,399 INFO L225 Difference]: With dead ends: 42 [2022-04-08 11:19:27,399 INFO L226 Difference]: Without dead ends: 35 [2022-04-08 11:19:27,400 INFO L912 BasicCegarLoop]: 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-08 11:19:27,401 INFO L913 BasicCegarLoop]: 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-08 11:19:27,401 INFO L914 BasicCegarLoop]: 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-08 11:19:27,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-08 11:19:27,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-08 11:19:27,413 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:19:27,413 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-08 11:19:27,413 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-08 11:19:27,414 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-08 11:19:27,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:19:27,415 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-08 11:19:27,415 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-08 11:19:27,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:19:27,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:19:27,416 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-08 11:19:27,416 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-08 11:19:27,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:19:27,418 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-08 11:19:27,418 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-08 11:19:27,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:19:27,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:19:27,419 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:19:27,419 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:19:27,419 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-08 11:19:27,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2022-04-08 11:19:27,421 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 18 [2022-04-08 11:19:27,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:19:27,421 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2022-04-08 11:19:27,421 INFO L479 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-08 11:19:27,421 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 44 transitions. [2022-04-08 11:19:27,463 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-08 11:19:27,463 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-08 11:19:27,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 11:19:27,464 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:19:27,464 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:19:27,481 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-08 11:19:27,670 WARN L460 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-08 11:19:27,670 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:19:27,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:19:27,671 INFO L85 PathProgramCache]: Analyzing trace with hash 767560222, now seen corresponding path program 1 times [2022-04-08 11:19:27,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:19:27,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1516944523] [2022-04-08 11:19:27,671 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:19:27,671 INFO L85 PathProgramCache]: Analyzing trace with hash 767560222, now seen corresponding path program 2 times [2022-04-08 11:19:27,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:19:27,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232861160] [2022-04-08 11:19:27,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:19:27,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:19:27,687 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:19:27,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [752653132] [2022-04-08 11:19:27,687 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:19:27,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:19:27,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:19:27,688 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-08 11:19:27,689 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-08 11:19:27,719 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 11:19:27,719 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:19:27,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 11:19:27,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:19:27,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:19:27,803 INFO L272 TraceCheckUtils]: 0: Hoare triple {604#true} call ULTIMATE.init(); {604#true} is VALID [2022-04-08 11:19:27,803 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-08 11:19:27,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {604#true} assume true; {604#true} is VALID [2022-04-08 11:19:27,803 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {604#true} {604#true} #93#return; {604#true} is VALID [2022-04-08 11:19:27,803 INFO L272 TraceCheckUtils]: 4: Hoare triple {604#true} call #t~ret8 := main(); {604#true} is VALID [2022-04-08 11:19:27,804 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-08 11:19:27,804 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-08 11:19:27,804 INFO L290 TraceCheckUtils]: 7: Hoare triple {604#true} ~cond := #in~cond; {604#true} is VALID [2022-04-08 11:19:27,804 INFO L290 TraceCheckUtils]: 8: Hoare triple {604#true} assume !(0 == ~cond); {604#true} is VALID [2022-04-08 11:19:27,804 INFO L290 TraceCheckUtils]: 9: Hoare triple {604#true} assume true; {604#true} is VALID [2022-04-08 11:19:27,804 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {604#true} {604#true} #77#return; {604#true} is VALID [2022-04-08 11:19:27,805 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-08 11:19:27,805 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-08 11:19:27,806 INFO L290 TraceCheckUtils]: 13: Hoare triple {642#(and (= main_~a~0 0) (= main_~b~0 0))} assume !!(#t~post6 < 10);havoc #t~post6; {642#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-08 11:19:27,807 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-08 11:19:27,807 INFO L290 TraceCheckUtils]: 15: Hoare triple {652#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {656#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:19:27,807 INFO L290 TraceCheckUtils]: 16: Hoare triple {656#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {605#false} is VALID [2022-04-08 11:19:27,808 INFO L290 TraceCheckUtils]: 17: Hoare triple {605#false} assume !false; {605#false} is VALID [2022-04-08 11:19:27,808 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-08 11:19:27,808 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:19:27,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:19:27,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232861160] [2022-04-08 11:19:27,808 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:19:27,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752653132] [2022-04-08 11:19:27,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752653132] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:19:27,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:19:27,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:19:27,809 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:19:27,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1516944523] [2022-04-08 11:19:27,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1516944523] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:19:27,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:19:27,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:19:27,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882459793] [2022-04-08 11:19:27,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:19:27,810 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-08 11:19:27,810 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:19:27,810 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-08 11:19:27,821 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-08 11:19:27,821 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 11:19:27,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:19:27,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 11:19:27,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 11:19:27,822 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-08 11:19:27,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:19:27,981 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-08 11:19:27,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 11:19:27,982 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-08 11:19:27,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:19:27,983 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-08 11:19:27,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-04-08 11:19:27,986 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-08 11:19:27,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-04-08 11:19:27,991 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 56 transitions. [2022-04-08 11:19:28,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:19:28,035 INFO L225 Difference]: With dead ends: 45 [2022-04-08 11:19:28,035 INFO L226 Difference]: Without dead ends: 43 [2022-04-08 11:19:28,036 INFO L912 BasicCegarLoop]: 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-08 11:19:28,043 INFO L913 BasicCegarLoop]: 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-08 11:19:28,044 INFO L914 BasicCegarLoop]: 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-08 11:19:28,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-08 11:19:28,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2022-04-08 11:19:28,063 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:19:28,064 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-08 11:19:28,065 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-08 11:19:28,065 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-08 11:19:28,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:19:28,071 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-04-08 11:19:28,072 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-04-08 11:19:28,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:19:28,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:19:28,075 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-08 11:19:28,076 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-08 11:19:28,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:19:28,077 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-04-08 11:19:28,077 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-04-08 11:19:28,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:19:28,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:19:28,078 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:19:28,078 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:19:28,078 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-08 11:19:28,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2022-04-08 11:19:28,079 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 18 [2022-04-08 11:19:28,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:19:28,080 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2022-04-08 11:19:28,080 INFO L479 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-08 11:19:28,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 49 transitions. [2022-04-08 11:19:28,115 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-08 11:19:28,115 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-04-08 11:19:28,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 11:19:28,116 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:19:28,116 INFO L499 BasicCegarLoop]: 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-08 11:19:28,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-08 11:19:28,327 WARN L460 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-08 11:19:28,328 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:19:28,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:19:28,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1016228092, now seen corresponding path program 1 times [2022-04-08 11:19:28,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:19:28,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [68863884] [2022-04-08 11:19:28,329 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:19:28,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1016228092, now seen corresponding path program 2 times [2022-04-08 11:19:28,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:19:28,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765375485] [2022-04-08 11:19:28,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:19:28,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:19:28,341 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:19:28,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [453155603] [2022-04-08 11:19:28,343 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:19:28,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:19:28,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:19:28,345 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-08 11:19:28,346 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-08 11:19:28,389 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:19:28,390 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:19:28,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 11:19:28,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:19:28,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:19:28,500 INFO L272 TraceCheckUtils]: 0: Hoare triple {920#true} call ULTIMATE.init(); {920#true} is VALID [2022-04-08 11:19:28,501 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-08 11:19:28,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {920#true} assume true; {920#true} is VALID [2022-04-08 11:19:28,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {920#true} {920#true} #93#return; {920#true} is VALID [2022-04-08 11:19:28,501 INFO L272 TraceCheckUtils]: 4: Hoare triple {920#true} call #t~ret8 := main(); {920#true} is VALID [2022-04-08 11:19:28,501 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-08 11:19:28,501 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-08 11:19:28,502 INFO L290 TraceCheckUtils]: 7: Hoare triple {920#true} ~cond := #in~cond; {920#true} is VALID [2022-04-08 11:19:28,502 INFO L290 TraceCheckUtils]: 8: Hoare triple {920#true} assume !(0 == ~cond); {920#true} is VALID [2022-04-08 11:19:28,502 INFO L290 TraceCheckUtils]: 9: Hoare triple {920#true} assume true; {920#true} is VALID [2022-04-08 11:19:28,502 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {920#true} {920#true} #77#return; {920#true} is VALID [2022-04-08 11:19:28,503 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-08 11:19:28,503 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-08 11:19:28,504 INFO L290 TraceCheckUtils]: 13: Hoare triple {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 10);havoc #t~post6; {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:19:28,504 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-08 11:19:28,504 INFO L290 TraceCheckUtils]: 15: Hoare triple {920#true} ~cond := #in~cond; {920#true} is VALID [2022-04-08 11:19:28,504 INFO L290 TraceCheckUtils]: 16: Hoare triple {920#true} assume !(0 == ~cond); {920#true} is VALID [2022-04-08 11:19:28,504 INFO L290 TraceCheckUtils]: 17: Hoare triple {920#true} assume true; {920#true} is VALID [2022-04-08 11:19:28,505 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-08 11:19:28,506 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-08 11:19:28,506 INFO L290 TraceCheckUtils]: 20: Hoare triple {983#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {987#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:19:28,507 INFO L290 TraceCheckUtils]: 21: Hoare triple {987#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {921#false} is VALID [2022-04-08 11:19:28,507 INFO L290 TraceCheckUtils]: 22: Hoare triple {921#false} assume !false; {921#false} is VALID [2022-04-08 11:19:28,507 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-08 11:19:28,508 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:19:28,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:19:28,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765375485] [2022-04-08 11:19:28,508 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:19:28,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453155603] [2022-04-08 11:19:28,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453155603] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:19:28,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:19:28,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:19:28,509 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:19:28,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [68863884] [2022-04-08 11:19:28,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [68863884] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:19:28,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:19:28,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:19:28,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195573729] [2022-04-08 11:19:28,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:19:28,510 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-08 11:19:28,510 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:19:28,510 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-08 11:19:28,523 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-08 11:19:28,524 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 11:19:28,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:19:28,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 11:19:28,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 11:19:28,525 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-08 11:19:28,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:19:28,719 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2022-04-08 11:19:28,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 11:19:28,720 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-08 11:19:28,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:19:28,720 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-08 11:19:28,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-08 11:19:28,721 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-08 11:19:28,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-08 11:19:28,723 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 71 transitions. [2022-04-08 11:19:28,795 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-08 11:19:28,798 INFO L225 Difference]: With dead ends: 58 [2022-04-08 11:19:28,798 INFO L226 Difference]: Without dead ends: 55 [2022-04-08 11:19:28,799 INFO L912 BasicCegarLoop]: 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-08 11:19:28,800 INFO L913 BasicCegarLoop]: 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-08 11:19:28,800 INFO L914 BasicCegarLoop]: 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-08 11:19:28,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-08 11:19:28,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2022-04-08 11:19:28,850 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:19:28,850 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-08 11:19:28,851 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-08 11:19:28,853 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-08 11:19:28,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:19:28,861 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-08 11:19:28,861 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-08 11:19:28,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:19:28,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:19:28,863 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-08 11:19:28,865 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-08 11:19:28,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:19:28,870 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-08 11:19:28,870 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-08 11:19:28,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:19:28,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:19:28,871 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:19:28,871 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:19:28,871 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-08 11:19:28,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2022-04-08 11:19:28,876 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 23 [2022-04-08 11:19:28,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:19:28,876 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2022-04-08 11:19:28,876 INFO L479 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-08 11:19:28,877 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 69 transitions. [2022-04-08 11:19:28,928 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-08 11:19:28,928 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2022-04-08 11:19:28,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 11:19:28,929 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:19:28,929 INFO L499 BasicCegarLoop]: 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-08 11:19:28,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 11:19:29,148 WARN L460 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-08 11:19:29,148 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:19:29,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:19:29,148 INFO L85 PathProgramCache]: Analyzing trace with hash 2019703110, now seen corresponding path program 1 times [2022-04-08 11:19:29,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:19:29,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1777252171] [2022-04-08 11:19:29,149 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:19:29,149 INFO L85 PathProgramCache]: Analyzing trace with hash 2019703110, now seen corresponding path program 2 times [2022-04-08 11:19:29,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:19:29,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820660668] [2022-04-08 11:19:29,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:19:29,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:19:29,173 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:19:29,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1921783220] [2022-04-08 11:19:29,173 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:19:29,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:19:29,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:19:29,178 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-08 11:19:29,179 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-08 11:19:29,216 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:19:29,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:19:29,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 11:19:29,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:19:29,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:19:29,323 INFO L272 TraceCheckUtils]: 0: Hoare triple {1329#true} call ULTIMATE.init(); {1329#true} is VALID [2022-04-08 11:19:29,324 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-08 11:19:29,324 INFO L290 TraceCheckUtils]: 2: Hoare triple {1329#true} assume true; {1329#true} is VALID [2022-04-08 11:19:29,324 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1329#true} {1329#true} #93#return; {1329#true} is VALID [2022-04-08 11:19:29,324 INFO L272 TraceCheckUtils]: 4: Hoare triple {1329#true} call #t~ret8 := main(); {1329#true} is VALID [2022-04-08 11:19:29,324 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-08 11:19:29,324 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-08 11:19:29,324 INFO L290 TraceCheckUtils]: 7: Hoare triple {1329#true} ~cond := #in~cond; {1329#true} is VALID [2022-04-08 11:19:29,325 INFO L290 TraceCheckUtils]: 8: Hoare triple {1329#true} assume !(0 == ~cond); {1329#true} is VALID [2022-04-08 11:19:29,325 INFO L290 TraceCheckUtils]: 9: Hoare triple {1329#true} assume true; {1329#true} is VALID [2022-04-08 11:19:29,325 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1329#true} {1329#true} #77#return; {1329#true} is VALID [2022-04-08 11:19:29,325 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-08 11:19:29,325 INFO L290 TraceCheckUtils]: 12: Hoare triple {1329#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1329#true} is VALID [2022-04-08 11:19:29,325 INFO L290 TraceCheckUtils]: 13: Hoare triple {1329#true} assume !!(#t~post6 < 10);havoc #t~post6; {1329#true} is VALID [2022-04-08 11:19:29,325 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-08 11:19:29,326 INFO L290 TraceCheckUtils]: 15: Hoare triple {1329#true} ~cond := #in~cond; {1329#true} is VALID [2022-04-08 11:19:29,326 INFO L290 TraceCheckUtils]: 16: Hoare triple {1329#true} assume !(0 == ~cond); {1329#true} is VALID [2022-04-08 11:19:29,326 INFO L290 TraceCheckUtils]: 17: Hoare triple {1329#true} assume true; {1329#true} is VALID [2022-04-08 11:19:29,326 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1329#true} {1329#true} #79#return; {1329#true} is VALID [2022-04-08 11:19:29,326 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-08 11:19:29,326 INFO L290 TraceCheckUtils]: 20: Hoare triple {1329#true} ~cond := #in~cond; {1329#true} is VALID [2022-04-08 11:19:29,326 INFO L290 TraceCheckUtils]: 21: Hoare triple {1329#true} assume !(0 == ~cond); {1329#true} is VALID [2022-04-08 11:19:29,327 INFO L290 TraceCheckUtils]: 22: Hoare triple {1329#true} assume true; {1329#true} is VALID [2022-04-08 11:19:29,327 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1329#true} {1329#true} #81#return; {1329#true} is VALID [2022-04-08 11:19:29,329 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-08 11:19:29,329 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-08 11:19:29,330 INFO L290 TraceCheckUtils]: 26: Hoare triple {1406#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} assume !!(#t~post7 < 10);havoc #t~post7; {1406#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} is VALID [2022-04-08 11:19:29,330 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-08 11:19:29,331 INFO L290 TraceCheckUtils]: 28: Hoare triple {1416#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1420#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:19:29,331 INFO L290 TraceCheckUtils]: 29: Hoare triple {1420#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1330#false} is VALID [2022-04-08 11:19:29,331 INFO L290 TraceCheckUtils]: 30: Hoare triple {1330#false} assume !false; {1330#false} is VALID [2022-04-08 11:19:29,331 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-08 11:19:29,332 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:19:29,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:19:29,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820660668] [2022-04-08 11:19:29,332 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:19:29,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921783220] [2022-04-08 11:19:29,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921783220] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:19:29,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:19:29,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:19:29,333 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:19:29,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1777252171] [2022-04-08 11:19:29,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1777252171] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:19:29,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:19:29,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:19:29,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445994333] [2022-04-08 11:19:29,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:19:29,333 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-08 11:19:29,334 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:19:29,334 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-08 11:19:29,352 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-08 11:19:29,352 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 11:19:29,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:19:29,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 11:19:29,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 11:19:29,353 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-08 11:19:29,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:19:29,546 INFO L93 Difference]: Finished difference Result 83 states and 113 transitions. [2022-04-08 11:19:29,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 11:19:29,547 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-08 11:19:29,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:19:29,547 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-08 11:19:29,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-04-08 11:19:29,549 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-08 11:19:29,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-04-08 11:19:29,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 72 transitions. [2022-04-08 11:19:29,594 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-08 11:19:29,596 INFO L225 Difference]: With dead ends: 83 [2022-04-08 11:19:29,596 INFO L226 Difference]: Without dead ends: 81 [2022-04-08 11:19:29,596 INFO L912 BasicCegarLoop]: 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-08 11:19:29,597 INFO L913 BasicCegarLoop]: 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-08 11:19:29,597 INFO L914 BasicCegarLoop]: 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-08 11:19:29,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-08 11:19:29,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2022-04-08 11:19:29,619 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:19:29,620 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-08 11:19:29,620 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-08 11:19:29,620 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-08 11:19:29,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:19:29,623 INFO L93 Difference]: Finished difference Result 81 states and 111 transitions. [2022-04-08 11:19:29,623 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 111 transitions. [2022-04-08 11:19:29,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:19:29,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:19:29,624 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-08 11:19:29,624 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-08 11:19:29,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:19:29,627 INFO L93 Difference]: Finished difference Result 81 states and 111 transitions. [2022-04-08 11:19:29,627 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 111 transitions. [2022-04-08 11:19:29,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:19:29,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:19:29,628 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:19:29,628 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:19:29,628 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-08 11:19:29,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 100 transitions. [2022-04-08 11:19:29,631 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 100 transitions. Word has length 31 [2022-04-08 11:19:29,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:19:29,631 INFO L478 AbstractCegarLoop]: Abstraction has 74 states and 100 transitions. [2022-04-08 11:19:29,631 INFO L479 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-08 11:19:29,631 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 100 transitions. [2022-04-08 11:19:29,710 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-08 11:19:29,710 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 100 transitions. [2022-04-08 11:19:29,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 11:19:29,711 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:19:29,711 INFO L499 BasicCegarLoop]: 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-08 11:19:29,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-08 11:19:29,911 WARN L460 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-08 11:19:29,912 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:19:29,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:19:29,912 INFO L85 PathProgramCache]: Analyzing trace with hash 202176206, now seen corresponding path program 1 times [2022-04-08 11:19:29,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:19:29,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2012787948] [2022-04-08 11:19:35,761 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:19:35,761 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:19:35,761 INFO L85 PathProgramCache]: Analyzing trace with hash 202176206, now seen corresponding path program 2 times [2022-04-08 11:19:35,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:19:35,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193537733] [2022-04-08 11:19:35,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:19:35,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:19:35,772 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:19:35,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2119697399] [2022-04-08 11:19:35,773 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:19:35,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:19:35,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:19:35,774 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-08 11:19:35,775 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-08 11:19:35,807 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:19:35,808 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:19:35,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 11:19:35,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:19:35,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:19:35,958 INFO L272 TraceCheckUtils]: 0: Hoare triple {1904#true} call ULTIMATE.init(); {1904#true} is VALID [2022-04-08 11:19:35,959 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-08 11:19:35,959 INFO L290 TraceCheckUtils]: 2: Hoare triple {1912#(<= ~counter~0 0)} assume true; {1912#(<= ~counter~0 0)} is VALID [2022-04-08 11:19:35,960 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1912#(<= ~counter~0 0)} {1904#true} #93#return; {1912#(<= ~counter~0 0)} is VALID [2022-04-08 11:19:35,960 INFO L272 TraceCheckUtils]: 4: Hoare triple {1912#(<= ~counter~0 0)} call #t~ret8 := main(); {1912#(<= ~counter~0 0)} is VALID [2022-04-08 11:19:35,961 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-08 11:19:35,961 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-08 11:19:35,962 INFO L290 TraceCheckUtils]: 7: Hoare triple {1912#(<= ~counter~0 0)} ~cond := #in~cond; {1912#(<= ~counter~0 0)} is VALID [2022-04-08 11:19:35,962 INFO L290 TraceCheckUtils]: 8: Hoare triple {1912#(<= ~counter~0 0)} assume !(0 == ~cond); {1912#(<= ~counter~0 0)} is VALID [2022-04-08 11:19:35,962 INFO L290 TraceCheckUtils]: 9: Hoare triple {1912#(<= ~counter~0 0)} assume true; {1912#(<= ~counter~0 0)} is VALID [2022-04-08 11:19:35,963 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1912#(<= ~counter~0 0)} {1912#(<= ~counter~0 0)} #77#return; {1912#(<= ~counter~0 0)} is VALID [2022-04-08 11:19:35,963 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-08 11:19:35,964 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-08 11:19:35,964 INFO L290 TraceCheckUtils]: 13: Hoare triple {1946#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {1946#(<= ~counter~0 1)} is VALID [2022-04-08 11:19:35,965 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-08 11:19:35,965 INFO L290 TraceCheckUtils]: 15: Hoare triple {1946#(<= ~counter~0 1)} ~cond := #in~cond; {1946#(<= ~counter~0 1)} is VALID [2022-04-08 11:19:35,965 INFO L290 TraceCheckUtils]: 16: Hoare triple {1946#(<= ~counter~0 1)} assume !(0 == ~cond); {1946#(<= ~counter~0 1)} is VALID [2022-04-08 11:19:35,966 INFO L290 TraceCheckUtils]: 17: Hoare triple {1946#(<= ~counter~0 1)} assume true; {1946#(<= ~counter~0 1)} is VALID [2022-04-08 11:19:35,966 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1946#(<= ~counter~0 1)} {1946#(<= ~counter~0 1)} #79#return; {1946#(<= ~counter~0 1)} is VALID [2022-04-08 11:19:35,967 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-08 11:19:35,967 INFO L290 TraceCheckUtils]: 20: Hoare triple {1946#(<= ~counter~0 1)} ~cond := #in~cond; {1946#(<= ~counter~0 1)} is VALID [2022-04-08 11:19:35,968 INFO L290 TraceCheckUtils]: 21: Hoare triple {1946#(<= ~counter~0 1)} assume !(0 == ~cond); {1946#(<= ~counter~0 1)} is VALID [2022-04-08 11:19:35,968 INFO L290 TraceCheckUtils]: 22: Hoare triple {1946#(<= ~counter~0 1)} assume true; {1946#(<= ~counter~0 1)} is VALID [2022-04-08 11:19:35,969 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1946#(<= ~counter~0 1)} {1946#(<= ~counter~0 1)} #81#return; {1946#(<= ~counter~0 1)} is VALID [2022-04-08 11:19:35,969 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-08 11:19:35,969 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-08 11:19:35,970 INFO L290 TraceCheckUtils]: 26: Hoare triple {1986#(<= |main_#t~post7| 1)} assume !(#t~post7 < 10);havoc #t~post7; {1905#false} is VALID [2022-04-08 11:19:35,970 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-08 11:19:35,971 INFO L290 TraceCheckUtils]: 28: Hoare triple {1905#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1905#false} is VALID [2022-04-08 11:19:35,971 INFO L290 TraceCheckUtils]: 29: Hoare triple {1905#false} assume !(#t~post6 < 10);havoc #t~post6; {1905#false} is VALID [2022-04-08 11:19:35,971 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-08 11:19:35,971 INFO L290 TraceCheckUtils]: 31: Hoare triple {1905#false} ~cond := #in~cond; {1905#false} is VALID [2022-04-08 11:19:35,971 INFO L290 TraceCheckUtils]: 32: Hoare triple {1905#false} assume 0 == ~cond; {1905#false} is VALID [2022-04-08 11:19:35,971 INFO L290 TraceCheckUtils]: 33: Hoare triple {1905#false} assume !false; {1905#false} is VALID [2022-04-08 11:19:35,971 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-08 11:19:35,971 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:19:35,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:19:35,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193537733] [2022-04-08 11:19:35,972 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:19:35,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119697399] [2022-04-08 11:19:35,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119697399] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:19:35,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:19:35,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:19:35,972 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:19:35,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2012787948] [2022-04-08 11:19:35,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2012787948] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:19:35,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:19:35,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:19:35,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483515690] [2022-04-08 11:19:35,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:19:35,973 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-08 11:19:35,973 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:19:35,974 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-08 11:19:35,992 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-08 11:19:35,992 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 11:19:35,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:19:35,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 11:19:35,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 11:19:35,993 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-08 11:19:36,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:19:36,100 INFO L93 Difference]: Finished difference Result 113 states and 153 transitions. [2022-04-08 11:19:36,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 11:19:36,100 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-08 11:19:36,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:19:36,101 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-08 11:19:36,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2022-04-08 11:19:36,102 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-08 11:19:36,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2022-04-08 11:19:36,103 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 85 transitions. [2022-04-08 11:19:36,159 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-08 11:19:36,161 INFO L225 Difference]: With dead ends: 113 [2022-04-08 11:19:36,161 INFO L226 Difference]: Without dead ends: 78 [2022-04-08 11:19:36,161 INFO L912 BasicCegarLoop]: 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-08 11:19:36,171 INFO L913 BasicCegarLoop]: 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-08 11:19:36,171 INFO L914 BasicCegarLoop]: 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-08 11:19:36,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-08 11:19:36,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-04-08 11:19:36,198 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:19:36,198 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-08 11:19:36,199 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-08 11:19:36,199 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-08 11:19:36,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:19:36,202 INFO L93 Difference]: Finished difference Result 78 states and 102 transitions. [2022-04-08 11:19:36,202 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 102 transitions. [2022-04-08 11:19:36,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:19:36,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:19:36,203 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-08 11:19:36,203 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-08 11:19:36,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:19:36,206 INFO L93 Difference]: Finished difference Result 78 states and 102 transitions. [2022-04-08 11:19:36,206 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 102 transitions. [2022-04-08 11:19:36,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:19:36,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:19:36,206 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:19:36,206 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:19:36,207 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-08 11:19:36,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 102 transitions. [2022-04-08 11:19:36,209 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 102 transitions. Word has length 34 [2022-04-08 11:19:36,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:19:36,209 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 102 transitions. [2022-04-08 11:19:36,210 INFO L479 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-08 11:19:36,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 102 transitions. [2022-04-08 11:19:36,286 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-08 11:19:36,286 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 102 transitions. [2022-04-08 11:19:36,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-08 11:19:36,287 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:19:36,287 INFO L499 BasicCegarLoop]: 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-08 11:19:36,305 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-08 11:19:36,495 WARN L460 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-08 11:19:36,496 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:19:36,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:19:36,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1813008070, now seen corresponding path program 1 times [2022-04-08 11:19:36,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:19:36,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1980965768] [2022-04-08 11:19:36,497 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:19:36,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1813008070, now seen corresponding path program 2 times [2022-04-08 11:19:36,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:19:36,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19797235] [2022-04-08 11:19:36,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:19:36,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:19:36,507 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:19:36,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1038570874] [2022-04-08 11:19:36,508 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:19:36,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:19:36,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:19:36,509 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-08 11:19:36,510 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-08 11:19:36,548 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:19:36,548 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:19:36,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 11:19:36,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:19:36,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:19:36,699 INFO L272 TraceCheckUtils]: 0: Hoare triple {2548#true} call ULTIMATE.init(); {2548#true} is VALID [2022-04-08 11:19:36,699 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-08 11:19:36,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-08 11:19:36,699 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2548#true} {2548#true} #93#return; {2548#true} is VALID [2022-04-08 11:19:36,699 INFO L272 TraceCheckUtils]: 4: Hoare triple {2548#true} call #t~ret8 := main(); {2548#true} is VALID [2022-04-08 11:19:36,699 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-08 11:19:36,700 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-08 11:19:36,700 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-08 11:19:36,700 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-08 11:19:36,701 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-08 11:19:36,701 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-08 11:19:36,701 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-08 11:19:36,702 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-08 11:19:36,702 INFO L290 TraceCheckUtils]: 13: Hoare triple {2585#(<= 1 main_~y~0)} assume !!(#t~post6 < 10);havoc #t~post6; {2585#(<= 1 main_~y~0)} is VALID [2022-04-08 11:19:36,702 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-08 11:19:36,702 INFO L290 TraceCheckUtils]: 15: Hoare triple {2548#true} ~cond := #in~cond; {2548#true} is VALID [2022-04-08 11:19:36,702 INFO L290 TraceCheckUtils]: 16: Hoare triple {2548#true} assume !(0 == ~cond); {2548#true} is VALID [2022-04-08 11:19:36,702 INFO L290 TraceCheckUtils]: 17: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-08 11:19:36,703 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2548#true} {2585#(<= 1 main_~y~0)} #79#return; {2585#(<= 1 main_~y~0)} is VALID [2022-04-08 11:19:36,703 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-08 11:19:36,703 INFO L290 TraceCheckUtils]: 20: Hoare triple {2548#true} ~cond := #in~cond; {2548#true} is VALID [2022-04-08 11:19:36,703 INFO L290 TraceCheckUtils]: 21: Hoare triple {2548#true} assume !(0 == ~cond); {2548#true} is VALID [2022-04-08 11:19:36,703 INFO L290 TraceCheckUtils]: 22: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-08 11:19:36,704 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2548#true} {2585#(<= 1 main_~y~0)} #81#return; {2585#(<= 1 main_~y~0)} is VALID [2022-04-08 11:19:36,705 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-08 11:19:36,706 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-08 11:19:36,706 INFO L290 TraceCheckUtils]: 26: Hoare triple {2628#(<= 1 main_~r~0)} assume !!(#t~post7 < 10);havoc #t~post7; {2628#(<= 1 main_~r~0)} is VALID [2022-04-08 11:19:36,706 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-08 11:19:36,706 INFO L290 TraceCheckUtils]: 28: Hoare triple {2548#true} ~cond := #in~cond; {2548#true} is VALID [2022-04-08 11:19:36,706 INFO L290 TraceCheckUtils]: 29: Hoare triple {2548#true} assume !(0 == ~cond); {2548#true} is VALID [2022-04-08 11:19:36,706 INFO L290 TraceCheckUtils]: 30: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-08 11:19:36,707 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2548#true} {2628#(<= 1 main_~r~0)} #83#return; {2628#(<= 1 main_~r~0)} is VALID [2022-04-08 11:19:36,707 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-08 11:19:36,707 INFO L290 TraceCheckUtils]: 33: Hoare triple {2548#true} ~cond := #in~cond; {2548#true} is VALID [2022-04-08 11:19:36,707 INFO L290 TraceCheckUtils]: 34: Hoare triple {2548#true} assume !(0 == ~cond); {2548#true} is VALID [2022-04-08 11:19:36,707 INFO L290 TraceCheckUtils]: 35: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-08 11:19:36,710 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2548#true} {2628#(<= 1 main_~r~0)} #85#return; {2628#(<= 1 main_~r~0)} is VALID [2022-04-08 11:19:36,711 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-08 11:19:36,711 INFO L290 TraceCheckUtils]: 38: Hoare triple {2668#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2672#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:19:36,711 INFO L290 TraceCheckUtils]: 39: Hoare triple {2672#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2549#false} is VALID [2022-04-08 11:19:36,712 INFO L290 TraceCheckUtils]: 40: Hoare triple {2549#false} assume !false; {2549#false} is VALID [2022-04-08 11:19:36,713 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-08 11:19:36,713 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:19:36,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:19:36,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19797235] [2022-04-08 11:19:36,714 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:19:36,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038570874] [2022-04-08 11:19:36,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038570874] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:19:36,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:19:36,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 11:19:36,714 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:19:36,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1980965768] [2022-04-08 11:19:36,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1980965768] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:19:36,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:19:36,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 11:19:36,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951645524] [2022-04-08 11:19:36,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:19:36,715 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-08 11:19:36,715 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:19:36,715 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-08 11:19:36,734 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-08 11:19:36,734 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 11:19:36,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:19:36,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 11:19:36,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-08 11:19:36,736 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-08 11:19:37,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:19:37,033 INFO L93 Difference]: Finished difference Result 84 states and 107 transitions. [2022-04-08 11:19:37,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 11:19:37,033 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-08 11:19:37,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:19:37,033 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-08 11:19:37,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-08 11:19:37,034 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-08 11:19:37,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-08 11:19:37,035 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-08 11:19:37,067 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-08 11:19:37,068 INFO L225 Difference]: With dead ends: 84 [2022-04-08 11:19:37,068 INFO L226 Difference]: Without dead ends: 82 [2022-04-08 11:19:37,069 INFO L912 BasicCegarLoop]: 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-08 11:19:37,069 INFO L913 BasicCegarLoop]: 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-08 11:19:37,069 INFO L914 BasicCegarLoop]: 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-08 11:19:37,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-08 11:19:37,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-04-08 11:19:37,149 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:19:37,149 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-08 11:19:37,149 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-08 11:19:37,149 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-08 11:19:37,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:19:37,152 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2022-04-08 11:19:37,152 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2022-04-08 11:19:37,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:19:37,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:19:37,153 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-08 11:19:37,153 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-08 11:19:37,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:19:37,155 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2022-04-08 11:19:37,155 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2022-04-08 11:19:37,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:19:37,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:19:37,156 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:19:37,156 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:19:37,156 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-08 11:19:37,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 105 transitions. [2022-04-08 11:19:37,158 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 105 transitions. Word has length 41 [2022-04-08 11:19:37,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:19:37,159 INFO L478 AbstractCegarLoop]: Abstraction has 82 states and 105 transitions. [2022-04-08 11:19:37,159 INFO L479 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-08 11:19:37,159 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 105 transitions. [2022-04-08 11:19:37,255 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-08 11:19:37,256 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2022-04-08 11:19:37,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-08 11:19:37,256 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:19:37,257 INFO L499 BasicCegarLoop]: 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-08 11:19:37,275 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-08 11:19:37,471 WARN L460 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-08 11:19:37,472 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:19:37,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:19:37,472 INFO L85 PathProgramCache]: Analyzing trace with hash -683043127, now seen corresponding path program 1 times [2022-04-08 11:19:37,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:19:37,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [248272099] [2022-04-08 11:19:37,473 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:19:37,473 INFO L85 PathProgramCache]: Analyzing trace with hash -683043127, now seen corresponding path program 2 times [2022-04-08 11:19:37,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:19:37,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101252632] [2022-04-08 11:19:37,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:19:37,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:19:37,487 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:19:37,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [353871740] [2022-04-08 11:19:37,488 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:19:37,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:19:37,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:19:37,489 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-08 11:19:37,490 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-08 11:19:37,526 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:19:37,526 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:19:37,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 11:19:37,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:19:37,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:19:37,714 INFO L272 TraceCheckUtils]: 0: Hoare triple {3180#true} call ULTIMATE.init(); {3180#true} is VALID [2022-04-08 11:19:37,714 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-08 11:19:37,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-08 11:19:37,714 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3180#true} {3180#true} #93#return; {3180#true} is VALID [2022-04-08 11:19:37,714 INFO L272 TraceCheckUtils]: 4: Hoare triple {3180#true} call #t~ret8 := main(); {3180#true} is VALID [2022-04-08 11:19:37,714 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-08 11:19:37,715 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-08 11:19:37,715 INFO L290 TraceCheckUtils]: 7: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-08 11:19:37,715 INFO L290 TraceCheckUtils]: 8: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-08 11:19:37,715 INFO L290 TraceCheckUtils]: 9: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-08 11:19:37,715 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3180#true} {3180#true} #77#return; {3180#true} is VALID [2022-04-08 11:19:37,715 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-08 11:19:37,715 INFO L290 TraceCheckUtils]: 12: Hoare triple {3180#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3180#true} is VALID [2022-04-08 11:19:37,715 INFO L290 TraceCheckUtils]: 13: Hoare triple {3180#true} assume !!(#t~post6 < 10);havoc #t~post6; {3180#true} is VALID [2022-04-08 11:19:37,716 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-08 11:19:37,716 INFO L290 TraceCheckUtils]: 15: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-08 11:19:37,716 INFO L290 TraceCheckUtils]: 16: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-08 11:19:37,716 INFO L290 TraceCheckUtils]: 17: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-08 11:19:37,716 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3180#true} {3180#true} #79#return; {3180#true} is VALID [2022-04-08 11:19:37,716 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-08 11:19:37,716 INFO L290 TraceCheckUtils]: 20: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-08 11:19:37,716 INFO L290 TraceCheckUtils]: 21: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-08 11:19:37,716 INFO L290 TraceCheckUtils]: 22: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-08 11:19:37,717 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3180#true} {3180#true} #81#return; {3180#true} is VALID [2022-04-08 11:19:37,717 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-08 11:19:37,717 INFO L290 TraceCheckUtils]: 25: Hoare triple {3180#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3180#true} is VALID [2022-04-08 11:19:37,717 INFO L290 TraceCheckUtils]: 26: Hoare triple {3180#true} assume !!(#t~post7 < 10);havoc #t~post7; {3180#true} is VALID [2022-04-08 11:19:37,717 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-08 11:19:37,718 INFO L290 TraceCheckUtils]: 28: Hoare triple {3180#true} ~cond := #in~cond; {3269#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:19:37,719 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-08 11:19:37,719 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-08 11:19:37,720 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-08 11:19:37,720 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-08 11:19:37,720 INFO L290 TraceCheckUtils]: 33: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-08 11:19:37,720 INFO L290 TraceCheckUtils]: 34: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-08 11:19:37,720 INFO L290 TraceCheckUtils]: 35: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-08 11:19:37,721 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-08 11:19:37,721 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-08 11:19:37,721 INFO L290 TraceCheckUtils]: 38: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-08 11:19:37,721 INFO L290 TraceCheckUtils]: 39: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-08 11:19:37,721 INFO L290 TraceCheckUtils]: 40: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-08 11:19:37,722 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-08 11:19:37,722 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-08 11:19:37,723 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-08 11:19:37,723 INFO L290 TraceCheckUtils]: 44: Hoare triple {3318#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3322#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:19:37,724 INFO L290 TraceCheckUtils]: 45: Hoare triple {3322#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3181#false} is VALID [2022-04-08 11:19:37,724 INFO L290 TraceCheckUtils]: 46: Hoare triple {3181#false} assume !false; {3181#false} is VALID [2022-04-08 11:19:37,724 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-08 11:19:37,724 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:19:44,706 INFO L290 TraceCheckUtils]: 46: Hoare triple {3181#false} assume !false; {3181#false} is VALID [2022-04-08 11:19:44,707 INFO L290 TraceCheckUtils]: 45: Hoare triple {3322#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3181#false} is VALID [2022-04-08 11:19:44,707 INFO L290 TraceCheckUtils]: 44: Hoare triple {3318#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3322#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:19:44,708 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-08 11:19:44,709 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-08 11:19:44,709 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-08 11:19:44,714 INFO L290 TraceCheckUtils]: 40: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-08 11:19:44,714 INFO L290 TraceCheckUtils]: 39: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-08 11:19:44,715 INFO L290 TraceCheckUtils]: 38: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-08 11:19:44,715 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-08 11:19:44,718 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-08 11:19:44,719 INFO L290 TraceCheckUtils]: 35: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-08 11:19:44,719 INFO L290 TraceCheckUtils]: 34: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-08 11:19:44,719 INFO L290 TraceCheckUtils]: 33: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-08 11:19:44,720 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-08 11:19:44,721 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-08 11:19:44,722 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-08 11:19:44,723 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-08 11:19:44,724 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-08 11:19:44,724 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-08 11:19:44,724 INFO L290 TraceCheckUtils]: 26: Hoare triple {3180#true} assume !!(#t~post7 < 10);havoc #t~post7; {3180#true} is VALID [2022-04-08 11:19:44,724 INFO L290 TraceCheckUtils]: 25: Hoare triple {3180#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3180#true} is VALID [2022-04-08 11:19:44,724 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-08 11:19:44,724 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3180#true} {3180#true} #81#return; {3180#true} is VALID [2022-04-08 11:19:44,725 INFO L290 TraceCheckUtils]: 22: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-08 11:19:44,725 INFO L290 TraceCheckUtils]: 21: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-08 11:19:44,725 INFO L290 TraceCheckUtils]: 20: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-08 11:19:44,725 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-08 11:19:44,725 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3180#true} {3180#true} #79#return; {3180#true} is VALID [2022-04-08 11:19:44,725 INFO L290 TraceCheckUtils]: 17: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-08 11:19:44,725 INFO L290 TraceCheckUtils]: 16: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-08 11:19:44,725 INFO L290 TraceCheckUtils]: 15: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-08 11:19:44,725 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-08 11:19:44,726 INFO L290 TraceCheckUtils]: 13: Hoare triple {3180#true} assume !!(#t~post6 < 10);havoc #t~post6; {3180#true} is VALID [2022-04-08 11:19:44,726 INFO L290 TraceCheckUtils]: 12: Hoare triple {3180#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3180#true} is VALID [2022-04-08 11:19:44,726 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-08 11:19:44,726 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3180#true} {3180#true} #77#return; {3180#true} is VALID [2022-04-08 11:19:44,726 INFO L290 TraceCheckUtils]: 9: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-08 11:19:44,726 INFO L290 TraceCheckUtils]: 8: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-08 11:19:44,726 INFO L290 TraceCheckUtils]: 7: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-08 11:19:44,726 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-08 11:19:44,726 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-08 11:19:44,727 INFO L272 TraceCheckUtils]: 4: Hoare triple {3180#true} call #t~ret8 := main(); {3180#true} is VALID [2022-04-08 11:19:44,727 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3180#true} {3180#true} #93#return; {3180#true} is VALID [2022-04-08 11:19:44,727 INFO L290 TraceCheckUtils]: 2: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-08 11:19:44,727 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-08 11:19:44,727 INFO L272 TraceCheckUtils]: 0: Hoare triple {3180#true} call ULTIMATE.init(); {3180#true} is VALID [2022-04-08 11:19:44,727 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-08 11:19:44,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:19:44,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101252632] [2022-04-08 11:19:44,728 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:19:44,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353871740] [2022-04-08 11:19:44,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353871740] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:19:44,728 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:19:44,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-08 11:19:44,728 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:19:44,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [248272099] [2022-04-08 11:19:44,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [248272099] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:19:44,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:19:44,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 11:19:44,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643579340] [2022-04-08 11:19:44,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:19:44,729 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-08 11:19:44,729 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:19:44,729 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-08 11:19:44,753 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-08 11:19:44,753 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 11:19:44,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:19:44,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 11:19:44,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-08 11:19:44,754 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-08 11:19:45,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:19:45,081 INFO L93 Difference]: Finished difference Result 88 states and 110 transitions. [2022-04-08 11:19:45,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 11:19:45,081 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-08 11:19:45,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:19:45,081 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-08 11:19:45,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-08 11:19:45,083 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-08 11:19:45,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-08 11:19:45,083 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-08 11:19:45,121 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-08 11:19:45,122 INFO L225 Difference]: With dead ends: 88 [2022-04-08 11:19:45,122 INFO L226 Difference]: Without dead ends: 86 [2022-04-08 11:19:45,122 INFO L912 BasicCegarLoop]: 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-08 11:19:45,123 INFO L913 BasicCegarLoop]: 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-08 11:19:45,123 INFO L914 BasicCegarLoop]: 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-08 11:19:45,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-08 11:19:45,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-04-08 11:19:45,206 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:19:45,206 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-08 11:19:45,206 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-08 11:19:45,206 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-08 11:19:45,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:19:45,209 INFO L93 Difference]: Finished difference Result 86 states and 108 transitions. [2022-04-08 11:19:45,209 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2022-04-08 11:19:45,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:19:45,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:19:45,210 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-08 11:19:45,210 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-08 11:19:45,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:19:45,212 INFO L93 Difference]: Finished difference Result 86 states and 108 transitions. [2022-04-08 11:19:45,212 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2022-04-08 11:19:45,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:19:45,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:19:45,213 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:19:45,213 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:19:45,213 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-08 11:19:45,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 108 transitions. [2022-04-08 11:19:45,215 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 108 transitions. Word has length 47 [2022-04-08 11:19:45,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:19:45,216 INFO L478 AbstractCegarLoop]: Abstraction has 86 states and 108 transitions. [2022-04-08 11:19:45,216 INFO L479 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-08 11:19:45,217 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 108 transitions. [2022-04-08 11:19:45,317 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-08 11:19:45,317 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2022-04-08 11:19:45,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-08 11:19:45,317 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:19:45,318 INFO L499 BasicCegarLoop]: 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-08 11:19:45,333 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-08 11:19:45,531 WARN L460 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-08 11:19:45,532 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:19:45,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:19:45,532 INFO L85 PathProgramCache]: Analyzing trace with hash -589126939, now seen corresponding path program 1 times [2022-04-08 11:19:45,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:19:45,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [76183643] [2022-04-08 11:19:58,606 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:19:58,606 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:19:58,606 INFO L85 PathProgramCache]: Analyzing trace with hash -589126939, now seen corresponding path program 2 times [2022-04-08 11:19:58,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:19:58,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111586047] [2022-04-08 11:19:58,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:19:58,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:19:58,616 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:19:58,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1817308721] [2022-04-08 11:19:58,616 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:19:58,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:19:58,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:19:58,619 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-08 11:19:58,620 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-08 11:19:58,679 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:19:58,680 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:19:58,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 11:19:58,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:19:58,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:19:58,897 INFO L272 TraceCheckUtils]: 0: Hoare triple {3997#true} call ULTIMATE.init(); {3997#true} is VALID [2022-04-08 11:19:58,898 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-08 11:19:58,899 INFO L290 TraceCheckUtils]: 2: Hoare triple {4005#(<= ~counter~0 0)} assume true; {4005#(<= ~counter~0 0)} is VALID [2022-04-08 11:19:58,899 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4005#(<= ~counter~0 0)} {3997#true} #93#return; {4005#(<= ~counter~0 0)} is VALID [2022-04-08 11:19:58,899 INFO L272 TraceCheckUtils]: 4: Hoare triple {4005#(<= ~counter~0 0)} call #t~ret8 := main(); {4005#(<= ~counter~0 0)} is VALID [2022-04-08 11:19:58,900 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-08 11:19:58,900 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-08 11:19:58,900 INFO L290 TraceCheckUtils]: 7: Hoare triple {4005#(<= ~counter~0 0)} ~cond := #in~cond; {4005#(<= ~counter~0 0)} is VALID [2022-04-08 11:19:58,901 INFO L290 TraceCheckUtils]: 8: Hoare triple {4005#(<= ~counter~0 0)} assume !(0 == ~cond); {4005#(<= ~counter~0 0)} is VALID [2022-04-08 11:19:58,901 INFO L290 TraceCheckUtils]: 9: Hoare triple {4005#(<= ~counter~0 0)} assume true; {4005#(<= ~counter~0 0)} is VALID [2022-04-08 11:19:58,902 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4005#(<= ~counter~0 0)} {4005#(<= ~counter~0 0)} #77#return; {4005#(<= ~counter~0 0)} is VALID [2022-04-08 11:19:58,902 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-08 11:19:58,902 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-08 11:19:58,903 INFO L290 TraceCheckUtils]: 13: Hoare triple {4039#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {4039#(<= ~counter~0 1)} is VALID [2022-04-08 11:19:58,903 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-08 11:19:58,904 INFO L290 TraceCheckUtils]: 15: Hoare triple {4039#(<= ~counter~0 1)} ~cond := #in~cond; {4039#(<= ~counter~0 1)} is VALID [2022-04-08 11:19:58,904 INFO L290 TraceCheckUtils]: 16: Hoare triple {4039#(<= ~counter~0 1)} assume !(0 == ~cond); {4039#(<= ~counter~0 1)} is VALID [2022-04-08 11:19:58,905 INFO L290 TraceCheckUtils]: 17: Hoare triple {4039#(<= ~counter~0 1)} assume true; {4039#(<= ~counter~0 1)} is VALID [2022-04-08 11:19:58,905 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4039#(<= ~counter~0 1)} {4039#(<= ~counter~0 1)} #79#return; {4039#(<= ~counter~0 1)} is VALID [2022-04-08 11:19:58,906 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-08 11:19:58,906 INFO L290 TraceCheckUtils]: 20: Hoare triple {4039#(<= ~counter~0 1)} ~cond := #in~cond; {4039#(<= ~counter~0 1)} is VALID [2022-04-08 11:19:58,906 INFO L290 TraceCheckUtils]: 21: Hoare triple {4039#(<= ~counter~0 1)} assume !(0 == ~cond); {4039#(<= ~counter~0 1)} is VALID [2022-04-08 11:19:58,907 INFO L290 TraceCheckUtils]: 22: Hoare triple {4039#(<= ~counter~0 1)} assume true; {4039#(<= ~counter~0 1)} is VALID [2022-04-08 11:19:58,907 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4039#(<= ~counter~0 1)} {4039#(<= ~counter~0 1)} #81#return; {4039#(<= ~counter~0 1)} is VALID [2022-04-08 11:19:58,907 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-08 11:19:58,908 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-08 11:19:58,909 INFO L290 TraceCheckUtils]: 26: Hoare triple {4079#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {4079#(<= ~counter~0 2)} is VALID [2022-04-08 11:19:58,909 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-08 11:19:58,909 INFO L290 TraceCheckUtils]: 28: Hoare triple {4079#(<= ~counter~0 2)} ~cond := #in~cond; {4079#(<= ~counter~0 2)} is VALID [2022-04-08 11:19:58,910 INFO L290 TraceCheckUtils]: 29: Hoare triple {4079#(<= ~counter~0 2)} assume !(0 == ~cond); {4079#(<= ~counter~0 2)} is VALID [2022-04-08 11:19:58,910 INFO L290 TraceCheckUtils]: 30: Hoare triple {4079#(<= ~counter~0 2)} assume true; {4079#(<= ~counter~0 2)} is VALID [2022-04-08 11:19:58,910 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4079#(<= ~counter~0 2)} {4079#(<= ~counter~0 2)} #83#return; {4079#(<= ~counter~0 2)} is VALID [2022-04-08 11:19:58,911 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-08 11:19:58,911 INFO L290 TraceCheckUtils]: 33: Hoare triple {4079#(<= ~counter~0 2)} ~cond := #in~cond; {4079#(<= ~counter~0 2)} is VALID [2022-04-08 11:19:58,911 INFO L290 TraceCheckUtils]: 34: Hoare triple {4079#(<= ~counter~0 2)} assume !(0 == ~cond); {4079#(<= ~counter~0 2)} is VALID [2022-04-08 11:19:58,912 INFO L290 TraceCheckUtils]: 35: Hoare triple {4079#(<= ~counter~0 2)} assume true; {4079#(<= ~counter~0 2)} is VALID [2022-04-08 11:19:58,912 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4079#(<= ~counter~0 2)} {4079#(<= ~counter~0 2)} #85#return; {4079#(<= ~counter~0 2)} is VALID [2022-04-08 11:19:58,913 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-08 11:19:58,913 INFO L290 TraceCheckUtils]: 38: Hoare triple {4079#(<= ~counter~0 2)} ~cond := #in~cond; {4079#(<= ~counter~0 2)} is VALID [2022-04-08 11:19:58,913 INFO L290 TraceCheckUtils]: 39: Hoare triple {4079#(<= ~counter~0 2)} assume !(0 == ~cond); {4079#(<= ~counter~0 2)} is VALID [2022-04-08 11:19:58,914 INFO L290 TraceCheckUtils]: 40: Hoare triple {4079#(<= ~counter~0 2)} assume true; {4079#(<= ~counter~0 2)} is VALID [2022-04-08 11:19:58,914 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4079#(<= ~counter~0 2)} {4079#(<= ~counter~0 2)} #87#return; {4079#(<= ~counter~0 2)} is VALID [2022-04-08 11:19:58,914 INFO L290 TraceCheckUtils]: 42: Hoare triple {4079#(<= ~counter~0 2)} assume !(~r~0 >= 2 * ~b~0); {4079#(<= ~counter~0 2)} is VALID [2022-04-08 11:19:58,915 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-08 11:19:58,915 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-08 11:19:58,915 INFO L290 TraceCheckUtils]: 45: Hoare triple {4137#(<= |main_#t~post6| 2)} assume !(#t~post6 < 10);havoc #t~post6; {3998#false} is VALID [2022-04-08 11:19:58,916 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-08 11:19:58,916 INFO L290 TraceCheckUtils]: 47: Hoare triple {3998#false} ~cond := #in~cond; {3998#false} is VALID [2022-04-08 11:19:58,916 INFO L290 TraceCheckUtils]: 48: Hoare triple {3998#false} assume 0 == ~cond; {3998#false} is VALID [2022-04-08 11:19:58,916 INFO L290 TraceCheckUtils]: 49: Hoare triple {3998#false} assume !false; {3998#false} is VALID [2022-04-08 11:19:58,916 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-08 11:19:58,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:19:59,140 INFO L290 TraceCheckUtils]: 49: Hoare triple {3998#false} assume !false; {3998#false} is VALID [2022-04-08 11:19:59,140 INFO L290 TraceCheckUtils]: 48: Hoare triple {3998#false} assume 0 == ~cond; {3998#false} is VALID [2022-04-08 11:19:59,140 INFO L290 TraceCheckUtils]: 47: Hoare triple {3998#false} ~cond := #in~cond; {3998#false} is VALID [2022-04-08 11:19:59,140 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-08 11:19:59,141 INFO L290 TraceCheckUtils]: 45: Hoare triple {4165#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {3998#false} is VALID [2022-04-08 11:19:59,141 INFO L290 TraceCheckUtils]: 44: Hoare triple {4169#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4165#(< |main_#t~post6| 10)} is VALID [2022-04-08 11:19:59,141 INFO L290 TraceCheckUtils]: 43: Hoare triple {4169#(< ~counter~0 10)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {4169#(< ~counter~0 10)} is VALID [2022-04-08 11:19:59,142 INFO L290 TraceCheckUtils]: 42: Hoare triple {4169#(< ~counter~0 10)} assume !(~r~0 >= 2 * ~b~0); {4169#(< ~counter~0 10)} is VALID [2022-04-08 11:19:59,142 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3997#true} {4169#(< ~counter~0 10)} #87#return; {4169#(< ~counter~0 10)} is VALID [2022-04-08 11:19:59,142 INFO L290 TraceCheckUtils]: 40: Hoare triple {3997#true} assume true; {3997#true} is VALID [2022-04-08 11:19:59,142 INFO L290 TraceCheckUtils]: 39: Hoare triple {3997#true} assume !(0 == ~cond); {3997#true} is VALID [2022-04-08 11:19:59,142 INFO L290 TraceCheckUtils]: 38: Hoare triple {3997#true} ~cond := #in~cond; {3997#true} is VALID [2022-04-08 11:19:59,143 INFO L272 TraceCheckUtils]: 37: Hoare triple {4169#(< ~counter~0 10)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {3997#true} is VALID [2022-04-08 11:19:59,143 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3997#true} {4169#(< ~counter~0 10)} #85#return; {4169#(< ~counter~0 10)} is VALID [2022-04-08 11:19:59,143 INFO L290 TraceCheckUtils]: 35: Hoare triple {3997#true} assume true; {3997#true} is VALID [2022-04-08 11:19:59,143 INFO L290 TraceCheckUtils]: 34: Hoare triple {3997#true} assume !(0 == ~cond); {3997#true} is VALID [2022-04-08 11:19:59,143 INFO L290 TraceCheckUtils]: 33: Hoare triple {3997#true} ~cond := #in~cond; {3997#true} is VALID [2022-04-08 11:19:59,144 INFO L272 TraceCheckUtils]: 32: Hoare triple {4169#(< ~counter~0 10)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3997#true} is VALID [2022-04-08 11:19:59,144 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3997#true} {4169#(< ~counter~0 10)} #83#return; {4169#(< ~counter~0 10)} is VALID [2022-04-08 11:19:59,144 INFO L290 TraceCheckUtils]: 30: Hoare triple {3997#true} assume true; {3997#true} is VALID [2022-04-08 11:19:59,144 INFO L290 TraceCheckUtils]: 29: Hoare triple {3997#true} assume !(0 == ~cond); {3997#true} is VALID [2022-04-08 11:19:59,144 INFO L290 TraceCheckUtils]: 28: Hoare triple {3997#true} ~cond := #in~cond; {3997#true} is VALID [2022-04-08 11:19:59,144 INFO L272 TraceCheckUtils]: 27: Hoare triple {4169#(< ~counter~0 10)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3997#true} is VALID [2022-04-08 11:19:59,145 INFO L290 TraceCheckUtils]: 26: Hoare triple {4169#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {4169#(< ~counter~0 10)} is VALID [2022-04-08 11:19:59,145 INFO L290 TraceCheckUtils]: 25: Hoare triple {4227#(< ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4169#(< ~counter~0 10)} is VALID [2022-04-08 11:19:59,146 INFO L290 TraceCheckUtils]: 24: Hoare triple {4227#(< ~counter~0 9)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {4227#(< ~counter~0 9)} is VALID [2022-04-08 11:19:59,146 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3997#true} {4227#(< ~counter~0 9)} #81#return; {4227#(< ~counter~0 9)} is VALID [2022-04-08 11:19:59,146 INFO L290 TraceCheckUtils]: 22: Hoare triple {3997#true} assume true; {3997#true} is VALID [2022-04-08 11:19:59,146 INFO L290 TraceCheckUtils]: 21: Hoare triple {3997#true} assume !(0 == ~cond); {3997#true} is VALID [2022-04-08 11:19:59,146 INFO L290 TraceCheckUtils]: 20: Hoare triple {3997#true} ~cond := #in~cond; {3997#true} is VALID [2022-04-08 11:19:59,147 INFO L272 TraceCheckUtils]: 19: Hoare triple {4227#(< ~counter~0 9)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3997#true} is VALID [2022-04-08 11:19:59,147 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3997#true} {4227#(< ~counter~0 9)} #79#return; {4227#(< ~counter~0 9)} is VALID [2022-04-08 11:19:59,147 INFO L290 TraceCheckUtils]: 17: Hoare triple {3997#true} assume true; {3997#true} is VALID [2022-04-08 11:19:59,147 INFO L290 TraceCheckUtils]: 16: Hoare triple {3997#true} assume !(0 == ~cond); {3997#true} is VALID [2022-04-08 11:19:59,147 INFO L290 TraceCheckUtils]: 15: Hoare triple {3997#true} ~cond := #in~cond; {3997#true} is VALID [2022-04-08 11:19:59,147 INFO L272 TraceCheckUtils]: 14: Hoare triple {4227#(< ~counter~0 9)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3997#true} is VALID [2022-04-08 11:19:59,148 INFO L290 TraceCheckUtils]: 13: Hoare triple {4227#(< ~counter~0 9)} assume !!(#t~post6 < 10);havoc #t~post6; {4227#(< ~counter~0 9)} is VALID [2022-04-08 11:19:59,149 INFO L290 TraceCheckUtils]: 12: Hoare triple {4267#(< ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4227#(< ~counter~0 9)} is VALID [2022-04-08 11:19:59,149 INFO L290 TraceCheckUtils]: 11: Hoare triple {4267#(< ~counter~0 8)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {4267#(< ~counter~0 8)} is VALID [2022-04-08 11:19:59,150 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3997#true} {4267#(< ~counter~0 8)} #77#return; {4267#(< ~counter~0 8)} is VALID [2022-04-08 11:19:59,150 INFO L290 TraceCheckUtils]: 9: Hoare triple {3997#true} assume true; {3997#true} is VALID [2022-04-08 11:19:59,150 INFO L290 TraceCheckUtils]: 8: Hoare triple {3997#true} assume !(0 == ~cond); {3997#true} is VALID [2022-04-08 11:19:59,150 INFO L290 TraceCheckUtils]: 7: Hoare triple {3997#true} ~cond := #in~cond; {3997#true} is VALID [2022-04-08 11:19:59,151 INFO L272 TraceCheckUtils]: 6: Hoare triple {4267#(< ~counter~0 8)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3997#true} is VALID [2022-04-08 11:19:59,153 INFO L290 TraceCheckUtils]: 5: Hoare triple {4267#(< ~counter~0 8)} 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; {4267#(< ~counter~0 8)} is VALID [2022-04-08 11:19:59,154 INFO L272 TraceCheckUtils]: 4: Hoare triple {4267#(< ~counter~0 8)} call #t~ret8 := main(); {4267#(< ~counter~0 8)} is VALID [2022-04-08 11:19:59,154 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4267#(< ~counter~0 8)} {3997#true} #93#return; {4267#(< ~counter~0 8)} is VALID [2022-04-08 11:19:59,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {4267#(< ~counter~0 8)} assume true; {4267#(< ~counter~0 8)} is VALID [2022-04-08 11:19:59,155 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; {4267#(< ~counter~0 8)} is VALID [2022-04-08 11:19:59,155 INFO L272 TraceCheckUtils]: 0: Hoare triple {3997#true} call ULTIMATE.init(); {3997#true} is VALID [2022-04-08 11:19:59,155 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-08 11:19:59,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:19:59,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111586047] [2022-04-08 11:19:59,156 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:19:59,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817308721] [2022-04-08 11:19:59,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817308721] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:19:59,156 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:19:59,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-08 11:19:59,156 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:19:59,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [76183643] [2022-04-08 11:19:59,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [76183643] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:19:59,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:19:59,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 11:19:59,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138216789] [2022-04-08 11:19:59,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:19:59,157 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-08 11:19:59,157 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:19:59,157 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-08 11:19:59,183 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-08 11:19:59,183 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 11:19:59,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:19:59,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 11:19:59,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-08 11:19:59,184 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-08 11:19:59,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:19:59,419 INFO L93 Difference]: Finished difference Result 115 states and 134 transitions. [2022-04-08 11:19:59,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 11:19:59,420 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-08 11:19:59,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:19:59,420 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-08 11:19:59,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2022-04-08 11:19:59,422 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-08 11:19:59,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2022-04-08 11:19:59,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 79 transitions. [2022-04-08 11:19:59,469 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-08 11:19:59,472 INFO L225 Difference]: With dead ends: 115 [2022-04-08 11:19:59,472 INFO L226 Difference]: Without dead ends: 108 [2022-04-08 11:19:59,472 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-04-08 11:19:59,474 INFO L913 BasicCegarLoop]: 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-08 11:19:59,474 INFO L914 BasicCegarLoop]: 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-08 11:19:59,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-04-08 11:19:59,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2022-04-08 11:19:59,555 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:19:59,557 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-08 11:19:59,558 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-08 11:19:59,559 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-08 11:19:59,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:19:59,568 INFO L93 Difference]: Finished difference Result 108 states and 127 transitions. [2022-04-08 11:19:59,568 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 127 transitions. [2022-04-08 11:19:59,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:19:59,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:19:59,570 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-08 11:19:59,570 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-08 11:19:59,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:19:59,573 INFO L93 Difference]: Finished difference Result 108 states and 127 transitions. [2022-04-08 11:19:59,573 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 127 transitions. [2022-04-08 11:19:59,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:19:59,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:19:59,574 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:19:59,574 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:19:59,574 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-08 11:19:59,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 125 transitions. [2022-04-08 11:19:59,576 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 125 transitions. Word has length 50 [2022-04-08 11:19:59,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:19:59,576 INFO L478 AbstractCegarLoop]: Abstraction has 106 states and 125 transitions. [2022-04-08 11:19:59,577 INFO L479 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-08 11:19:59,577 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 106 states and 125 transitions. [2022-04-08 11:19:59,689 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-08 11:19:59,689 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 125 transitions. [2022-04-08 11:19:59,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-08 11:19:59,690 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:19:59,690 INFO L499 BasicCegarLoop]: 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-08 11:19:59,708 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-08 11:19:59,890 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-08 11:19:59,891 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:19:59,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:19:59,891 INFO L85 PathProgramCache]: Analyzing trace with hash -484699953, now seen corresponding path program 1 times [2022-04-08 11:19:59,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:19:59,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1693167169] [2022-04-08 11:20:12,255 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:20:12,255 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:20:12,256 INFO L85 PathProgramCache]: Analyzing trace with hash -484699953, now seen corresponding path program 2 times [2022-04-08 11:20:12,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:20:12,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742259385] [2022-04-08 11:20:12,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:20:12,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:20:12,265 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:20:12,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [349213532] [2022-04-08 11:20:12,266 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:20:12,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:20:12,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:20:12,272 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-08 11:20:12,273 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-08 11:20:12,317 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:20:12,317 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:20:12,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 11:20:12,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:20:12,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:20:12,562 INFO L272 TraceCheckUtils]: 0: Hoare triple {4966#true} call ULTIMATE.init(); {4966#true} is VALID [2022-04-08 11:20:12,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {4966#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; {4966#true} is VALID [2022-04-08 11:20:12,562 INFO L290 TraceCheckUtils]: 2: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-08 11:20:12,563 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4966#true} {4966#true} #93#return; {4966#true} is VALID [2022-04-08 11:20:12,563 INFO L272 TraceCheckUtils]: 4: Hoare triple {4966#true} call #t~ret8 := main(); {4966#true} is VALID [2022-04-08 11:20:12,563 INFO L290 TraceCheckUtils]: 5: Hoare triple {4966#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; {4966#true} is VALID [2022-04-08 11:20:12,563 INFO L272 TraceCheckUtils]: 6: Hoare triple {4966#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4966#true} is VALID [2022-04-08 11:20:12,563 INFO L290 TraceCheckUtils]: 7: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-08 11:20:12,563 INFO L290 TraceCheckUtils]: 8: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-08 11:20:12,563 INFO L290 TraceCheckUtils]: 9: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-08 11:20:12,563 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4966#true} {4966#true} #77#return; {4966#true} is VALID [2022-04-08 11:20:12,564 INFO L290 TraceCheckUtils]: 11: Hoare triple {4966#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:20:12,564 INFO L290 TraceCheckUtils]: 12: Hoare triple {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:20:12,565 INFO L290 TraceCheckUtils]: 13: Hoare triple {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 10);havoc #t~post6; {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:20:12,565 INFO L272 TraceCheckUtils]: 14: Hoare triple {5004#(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)); {4966#true} is VALID [2022-04-08 11:20:12,565 INFO L290 TraceCheckUtils]: 15: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-08 11:20:12,565 INFO L290 TraceCheckUtils]: 16: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-08 11:20:12,565 INFO L290 TraceCheckUtils]: 17: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-08 11:20:12,566 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4966#true} {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #79#return; {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:20:12,566 INFO L272 TraceCheckUtils]: 19: Hoare triple {5004#(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)); {4966#true} is VALID [2022-04-08 11:20:12,566 INFO L290 TraceCheckUtils]: 20: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-08 11:20:12,566 INFO L290 TraceCheckUtils]: 21: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-08 11:20:12,566 INFO L290 TraceCheckUtils]: 22: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-08 11:20:12,567 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4966#true} {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #81#return; {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:20:12,567 INFO L290 TraceCheckUtils]: 24: Hoare triple {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {5044#(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-08 11:20:12,568 INFO L290 TraceCheckUtils]: 25: Hoare triple {5044#(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; {5044#(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-08 11:20:12,568 INFO L290 TraceCheckUtils]: 26: Hoare triple {5044#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(#t~post7 < 10);havoc #t~post7; {5044#(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-08 11:20:12,568 INFO L272 TraceCheckUtils]: 27: Hoare triple {5044#(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)); {4966#true} is VALID [2022-04-08 11:20:12,568 INFO L290 TraceCheckUtils]: 28: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-08 11:20:12,568 INFO L290 TraceCheckUtils]: 29: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-08 11:20:12,568 INFO L290 TraceCheckUtils]: 30: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-08 11:20:12,569 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4966#true} {5044#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #83#return; {5044#(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-08 11:20:12,569 INFO L272 TraceCheckUtils]: 32: Hoare triple {5044#(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)); {4966#true} is VALID [2022-04-08 11:20:12,569 INFO L290 TraceCheckUtils]: 33: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-08 11:20:12,569 INFO L290 TraceCheckUtils]: 34: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-08 11:20:12,570 INFO L290 TraceCheckUtils]: 35: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-08 11:20:12,570 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4966#true} {5044#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #85#return; {5044#(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-08 11:20:12,570 INFO L272 TraceCheckUtils]: 37: Hoare triple {5044#(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)); {4966#true} is VALID [2022-04-08 11:20:12,570 INFO L290 TraceCheckUtils]: 38: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-08 11:20:12,570 INFO L290 TraceCheckUtils]: 39: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-08 11:20:12,571 INFO L290 TraceCheckUtils]: 40: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-08 11:20:12,571 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4966#true} {5044#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #87#return; {5044#(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-08 11:20:12,572 INFO L290 TraceCheckUtils]: 42: Hoare triple {5044#(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); {5044#(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-08 11:20:12,572 INFO L290 TraceCheckUtils]: 43: Hoare triple {5044#(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; {5102#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~r~0) (= main_~q~0 1))} is VALID [2022-04-08 11:20:12,572 INFO L290 TraceCheckUtils]: 44: Hoare triple {5102#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~r~0) (= main_~q~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5102#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~r~0) (= main_~q~0 1))} is VALID [2022-04-08 11:20:12,573 INFO L290 TraceCheckUtils]: 45: Hoare triple {5102#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~r~0) (= main_~q~0 1))} assume !!(#t~post6 < 10);havoc #t~post6; {5102#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~r~0) (= main_~q~0 1))} is VALID [2022-04-08 11:20:12,573 INFO L272 TraceCheckUtils]: 46: Hoare triple {5102#(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)); {4966#true} is VALID [2022-04-08 11:20:12,573 INFO L290 TraceCheckUtils]: 47: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-08 11:20:12,573 INFO L290 TraceCheckUtils]: 48: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-08 11:20:12,573 INFO L290 TraceCheckUtils]: 49: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-08 11:20:12,574 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4966#true} {5102#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~r~0) (= main_~q~0 1))} #79#return; {5102#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~r~0) (= main_~q~0 1))} is VALID [2022-04-08 11:20:12,575 INFO L272 TraceCheckUtils]: 51: Hoare triple {5102#(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)); {5127#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:20:12,575 INFO L290 TraceCheckUtils]: 52: Hoare triple {5127#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5131#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:20:12,575 INFO L290 TraceCheckUtils]: 53: Hoare triple {5131#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4967#false} is VALID [2022-04-08 11:20:12,575 INFO L290 TraceCheckUtils]: 54: Hoare triple {4967#false} assume !false; {4967#false} is VALID [2022-04-08 11:20:12,576 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-08 11:20:12,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:20:30,851 INFO L290 TraceCheckUtils]: 54: Hoare triple {4967#false} assume !false; {4967#false} is VALID [2022-04-08 11:20:30,852 INFO L290 TraceCheckUtils]: 53: Hoare triple {5131#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4967#false} is VALID [2022-04-08 11:20:30,852 INFO L290 TraceCheckUtils]: 52: Hoare triple {5127#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5131#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:20:30,852 INFO L272 TraceCheckUtils]: 51: Hoare triple {5147#(= (+ (* 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)); {5127#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:20:30,853 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4966#true} {5147#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #79#return; {5147#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:20:30,853 INFO L290 TraceCheckUtils]: 49: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-08 11:20:30,853 INFO L290 TraceCheckUtils]: 48: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-08 11:20:30,853 INFO L290 TraceCheckUtils]: 47: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-08 11:20:30,853 INFO L272 TraceCheckUtils]: 46: Hoare triple {5147#(= (+ (* 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)); {4966#true} is VALID [2022-04-08 11:20:30,854 INFO L290 TraceCheckUtils]: 45: Hoare triple {5147#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(#t~post6 < 10);havoc #t~post6; {5147#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:20:30,854 INFO L290 TraceCheckUtils]: 44: Hoare triple {5147#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5147#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:20:30,863 INFO L290 TraceCheckUtils]: 43: Hoare triple {5172#(= 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; {5147#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:20:30,864 INFO L290 TraceCheckUtils]: 42: Hoare triple {5172#(= 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); {5172#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-08 11:20:30,864 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4966#true} {5172#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} #87#return; {5172#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-08 11:20:30,864 INFO L290 TraceCheckUtils]: 40: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-08 11:20:30,865 INFO L290 TraceCheckUtils]: 39: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-08 11:20:30,865 INFO L290 TraceCheckUtils]: 38: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-08 11:20:30,865 INFO L272 TraceCheckUtils]: 37: Hoare triple {5172#(= 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)); {4966#true} is VALID [2022-04-08 11:20:30,865 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4966#true} {5172#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} #85#return; {5172#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-08 11:20:30,865 INFO L290 TraceCheckUtils]: 35: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-08 11:20:30,866 INFO L290 TraceCheckUtils]: 34: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-08 11:20:30,866 INFO L290 TraceCheckUtils]: 33: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-08 11:20:30,866 INFO L272 TraceCheckUtils]: 32: Hoare triple {5172#(= 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)); {4966#true} is VALID [2022-04-08 11:20:30,866 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4966#true} {5172#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} #83#return; {5172#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-08 11:20:30,866 INFO L290 TraceCheckUtils]: 30: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-08 11:20:30,866 INFO L290 TraceCheckUtils]: 29: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-08 11:20:30,867 INFO L290 TraceCheckUtils]: 28: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-08 11:20:30,867 INFO L272 TraceCheckUtils]: 27: Hoare triple {5172#(= 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)); {4966#true} is VALID [2022-04-08 11:20:30,867 INFO L290 TraceCheckUtils]: 26: Hoare triple {5172#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} assume !!(#t~post7 < 10);havoc #t~post7; {5172#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-08 11:20:30,869 INFO L290 TraceCheckUtils]: 25: Hoare triple {5172#(= 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; {5172#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-08 11:20:30,869 INFO L290 TraceCheckUtils]: 24: Hoare triple {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {5172#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-08 11:20:30,870 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4966#true} {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #81#return; {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:20:30,870 INFO L290 TraceCheckUtils]: 22: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-08 11:20:30,870 INFO L290 TraceCheckUtils]: 21: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-08 11:20:30,870 INFO L290 TraceCheckUtils]: 20: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-08 11:20:30,870 INFO L272 TraceCheckUtils]: 19: Hoare triple {5004#(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)); {4966#true} is VALID [2022-04-08 11:20:30,871 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4966#true} {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #79#return; {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:20:30,871 INFO L290 TraceCheckUtils]: 17: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-08 11:20:30,871 INFO L290 TraceCheckUtils]: 16: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-08 11:20:30,871 INFO L290 TraceCheckUtils]: 15: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-08 11:20:30,871 INFO L272 TraceCheckUtils]: 14: Hoare triple {5004#(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)); {4966#true} is VALID [2022-04-08 11:20:30,872 INFO L290 TraceCheckUtils]: 13: Hoare triple {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 10);havoc #t~post6; {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:20:30,872 INFO L290 TraceCheckUtils]: 12: Hoare triple {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:20:30,873 INFO L290 TraceCheckUtils]: 11: Hoare triple {4966#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {5004#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:20:30,873 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4966#true} {4966#true} #77#return; {4966#true} is VALID [2022-04-08 11:20:30,873 INFO L290 TraceCheckUtils]: 9: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-08 11:20:30,873 INFO L290 TraceCheckUtils]: 8: Hoare triple {4966#true} assume !(0 == ~cond); {4966#true} is VALID [2022-04-08 11:20:30,873 INFO L290 TraceCheckUtils]: 7: Hoare triple {4966#true} ~cond := #in~cond; {4966#true} is VALID [2022-04-08 11:20:30,873 INFO L272 TraceCheckUtils]: 6: Hoare triple {4966#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4966#true} is VALID [2022-04-08 11:20:30,873 INFO L290 TraceCheckUtils]: 5: Hoare triple {4966#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; {4966#true} is VALID [2022-04-08 11:20:30,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {4966#true} call #t~ret8 := main(); {4966#true} is VALID [2022-04-08 11:20:30,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4966#true} {4966#true} #93#return; {4966#true} is VALID [2022-04-08 11:20:30,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {4966#true} assume true; {4966#true} is VALID [2022-04-08 11:20:30,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {4966#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; {4966#true} is VALID [2022-04-08 11:20:30,874 INFO L272 TraceCheckUtils]: 0: Hoare triple {4966#true} call ULTIMATE.init(); {4966#true} is VALID [2022-04-08 11:20:30,874 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-08 11:20:30,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:20:30,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742259385] [2022-04-08 11:20:30,874 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:20:30,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349213532] [2022-04-08 11:20:30,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349213532] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:20:30,875 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:20:30,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-04-08 11:20:30,875 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:20:30,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1693167169] [2022-04-08 11:20:30,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1693167169] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:20:30,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:20:30,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 11:20:30,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458354891] [2022-04-08 11:20:30,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:20:30,876 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-08 11:20:30,876 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:20:30,876 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-08 11:20:30,905 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-08 11:20:30,906 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 11:20:30,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:20:30,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 11:20:30,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-08 11:20:30,906 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-08 11:20:31,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:20:31,503 INFO L93 Difference]: Finished difference Result 134 states and 166 transitions. [2022-04-08 11:20:31,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 11:20:31,504 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-08 11:20:31,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:20:31,504 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-08 11:20:31,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 107 transitions. [2022-04-08 11:20:31,539 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-08 11:20:31,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 107 transitions. [2022-04-08 11:20:31,540 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 107 transitions. [2022-04-08 11:20:31,616 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-08 11:20:31,618 INFO L225 Difference]: With dead ends: 134 [2022-04-08 11:20:31,618 INFO L226 Difference]: Without dead ends: 131 [2022-04-08 11:20:31,618 INFO L912 BasicCegarLoop]: 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-08 11:20:31,619 INFO L913 BasicCegarLoop]: 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-08 11:20:31,619 INFO L914 BasicCegarLoop]: 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-08 11:20:31,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-04-08 11:20:31,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2022-04-08 11:20:31,720 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:20:31,721 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-08 11:20:31,721 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-08 11:20:31,721 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-08 11:20:31,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:20:31,724 INFO L93 Difference]: Finished difference Result 131 states and 162 transitions. [2022-04-08 11:20:31,724 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 162 transitions. [2022-04-08 11:20:31,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:20:31,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:20:31,724 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-08 11:20:31,725 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-08 11:20:31,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:20:31,727 INFO L93 Difference]: Finished difference Result 131 states and 162 transitions. [2022-04-08 11:20:31,727 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 162 transitions. [2022-04-08 11:20:31,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:20:31,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:20:31,727 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:20:31,728 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:20:31,728 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-08 11:20:31,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 158 transitions. [2022-04-08 11:20:31,730 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 158 transitions. Word has length 55 [2022-04-08 11:20:31,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:20:31,730 INFO L478 AbstractCegarLoop]: Abstraction has 127 states and 158 transitions. [2022-04-08 11:20:31,731 INFO L479 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-08 11:20:31,731 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 127 states and 158 transitions. [2022-04-08 11:20:31,875 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-08 11:20:31,876 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 158 transitions. [2022-04-08 11:20:31,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-08 11:20:31,876 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:20:31,876 INFO L499 BasicCegarLoop]: 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-08 11:20:31,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-08 11:20:32,095 WARN L460 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-08 11:20:32,095 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:20:32,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:20:32,096 INFO L85 PathProgramCache]: Analyzing trace with hash 765609565, now seen corresponding path program 1 times [2022-04-08 11:20:32,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:20:32,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1073967399] [2022-04-08 11:20:47,267 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:20:47,267 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:20:47,267 INFO L85 PathProgramCache]: Analyzing trace with hash 765609565, now seen corresponding path program 2 times [2022-04-08 11:20:47,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:20:47,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413008494] [2022-04-08 11:20:47,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:20:47,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:20:47,291 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:20:47,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1706554626] [2022-04-08 11:20:47,292 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:20:47,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:20:47,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:20:47,300 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-08 11:20:47,304 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-08 11:20:47,344 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:20:47,344 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:20:47,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 11:20:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:20:47,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:20:47,596 INFO L272 TraceCheckUtils]: 0: Hoare triple {6090#true} call ULTIMATE.init(); {6090#true} is VALID [2022-04-08 11:20:47,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {6090#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; {6098#(<= ~counter~0 0)} is VALID [2022-04-08 11:20:47,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {6098#(<= ~counter~0 0)} assume true; {6098#(<= ~counter~0 0)} is VALID [2022-04-08 11:20:47,598 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6098#(<= ~counter~0 0)} {6090#true} #93#return; {6098#(<= ~counter~0 0)} is VALID [2022-04-08 11:20:47,598 INFO L272 TraceCheckUtils]: 4: Hoare triple {6098#(<= ~counter~0 0)} call #t~ret8 := main(); {6098#(<= ~counter~0 0)} is VALID [2022-04-08 11:20:47,598 INFO L290 TraceCheckUtils]: 5: Hoare triple {6098#(<= ~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; {6098#(<= ~counter~0 0)} is VALID [2022-04-08 11:20:47,599 INFO L272 TraceCheckUtils]: 6: Hoare triple {6098#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6098#(<= ~counter~0 0)} is VALID [2022-04-08 11:20:47,599 INFO L290 TraceCheckUtils]: 7: Hoare triple {6098#(<= ~counter~0 0)} ~cond := #in~cond; {6098#(<= ~counter~0 0)} is VALID [2022-04-08 11:20:47,599 INFO L290 TraceCheckUtils]: 8: Hoare triple {6098#(<= ~counter~0 0)} assume !(0 == ~cond); {6098#(<= ~counter~0 0)} is VALID [2022-04-08 11:20:47,600 INFO L290 TraceCheckUtils]: 9: Hoare triple {6098#(<= ~counter~0 0)} assume true; {6098#(<= ~counter~0 0)} is VALID [2022-04-08 11:20:47,600 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6098#(<= ~counter~0 0)} {6098#(<= ~counter~0 0)} #77#return; {6098#(<= ~counter~0 0)} is VALID [2022-04-08 11:20:47,600 INFO L290 TraceCheckUtils]: 11: Hoare triple {6098#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {6098#(<= ~counter~0 0)} is VALID [2022-04-08 11:20:47,601 INFO L290 TraceCheckUtils]: 12: Hoare triple {6098#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6132#(<= ~counter~0 1)} is VALID [2022-04-08 11:20:47,601 INFO L290 TraceCheckUtils]: 13: Hoare triple {6132#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {6132#(<= ~counter~0 1)} is VALID [2022-04-08 11:20:47,602 INFO L272 TraceCheckUtils]: 14: Hoare triple {6132#(<= ~counter~0 1)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {6132#(<= ~counter~0 1)} is VALID [2022-04-08 11:20:47,602 INFO L290 TraceCheckUtils]: 15: Hoare triple {6132#(<= ~counter~0 1)} ~cond := #in~cond; {6132#(<= ~counter~0 1)} is VALID [2022-04-08 11:20:47,602 INFO L290 TraceCheckUtils]: 16: Hoare triple {6132#(<= ~counter~0 1)} assume !(0 == ~cond); {6132#(<= ~counter~0 1)} is VALID [2022-04-08 11:20:47,603 INFO L290 TraceCheckUtils]: 17: Hoare triple {6132#(<= ~counter~0 1)} assume true; {6132#(<= ~counter~0 1)} is VALID [2022-04-08 11:20:47,603 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6132#(<= ~counter~0 1)} {6132#(<= ~counter~0 1)} #79#return; {6132#(<= ~counter~0 1)} is VALID [2022-04-08 11:20:47,604 INFO L272 TraceCheckUtils]: 19: Hoare triple {6132#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {6132#(<= ~counter~0 1)} is VALID [2022-04-08 11:20:47,604 INFO L290 TraceCheckUtils]: 20: Hoare triple {6132#(<= ~counter~0 1)} ~cond := #in~cond; {6132#(<= ~counter~0 1)} is VALID [2022-04-08 11:20:47,604 INFO L290 TraceCheckUtils]: 21: Hoare triple {6132#(<= ~counter~0 1)} assume !(0 == ~cond); {6132#(<= ~counter~0 1)} is VALID [2022-04-08 11:20:47,604 INFO L290 TraceCheckUtils]: 22: Hoare triple {6132#(<= ~counter~0 1)} assume true; {6132#(<= ~counter~0 1)} is VALID [2022-04-08 11:20:47,605 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6132#(<= ~counter~0 1)} {6132#(<= ~counter~0 1)} #81#return; {6132#(<= ~counter~0 1)} is VALID [2022-04-08 11:20:47,605 INFO L290 TraceCheckUtils]: 24: Hoare triple {6132#(<= ~counter~0 1)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {6132#(<= ~counter~0 1)} is VALID [2022-04-08 11:20:47,606 INFO L290 TraceCheckUtils]: 25: Hoare triple {6132#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6172#(<= ~counter~0 2)} is VALID [2022-04-08 11:20:47,606 INFO L290 TraceCheckUtils]: 26: Hoare triple {6172#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {6172#(<= ~counter~0 2)} is VALID [2022-04-08 11:20:47,607 INFO L272 TraceCheckUtils]: 27: Hoare triple {6172#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {6172#(<= ~counter~0 2)} is VALID [2022-04-08 11:20:47,607 INFO L290 TraceCheckUtils]: 28: Hoare triple {6172#(<= ~counter~0 2)} ~cond := #in~cond; {6172#(<= ~counter~0 2)} is VALID [2022-04-08 11:20:47,607 INFO L290 TraceCheckUtils]: 29: Hoare triple {6172#(<= ~counter~0 2)} assume !(0 == ~cond); {6172#(<= ~counter~0 2)} is VALID [2022-04-08 11:20:47,607 INFO L290 TraceCheckUtils]: 30: Hoare triple {6172#(<= ~counter~0 2)} assume true; {6172#(<= ~counter~0 2)} is VALID [2022-04-08 11:20:47,608 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6172#(<= ~counter~0 2)} {6172#(<= ~counter~0 2)} #83#return; {6172#(<= ~counter~0 2)} is VALID [2022-04-08 11:20:47,608 INFO L272 TraceCheckUtils]: 32: Hoare triple {6172#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {6172#(<= ~counter~0 2)} is VALID [2022-04-08 11:20:47,609 INFO L290 TraceCheckUtils]: 33: Hoare triple {6172#(<= ~counter~0 2)} ~cond := #in~cond; {6172#(<= ~counter~0 2)} is VALID [2022-04-08 11:20:47,609 INFO L290 TraceCheckUtils]: 34: Hoare triple {6172#(<= ~counter~0 2)} assume !(0 == ~cond); {6172#(<= ~counter~0 2)} is VALID [2022-04-08 11:20:47,609 INFO L290 TraceCheckUtils]: 35: Hoare triple {6172#(<= ~counter~0 2)} assume true; {6172#(<= ~counter~0 2)} is VALID [2022-04-08 11:20:47,610 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6172#(<= ~counter~0 2)} {6172#(<= ~counter~0 2)} #85#return; {6172#(<= ~counter~0 2)} is VALID [2022-04-08 11:20:47,610 INFO L272 TraceCheckUtils]: 37: Hoare triple {6172#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {6172#(<= ~counter~0 2)} is VALID [2022-04-08 11:20:47,610 INFO L290 TraceCheckUtils]: 38: Hoare triple {6172#(<= ~counter~0 2)} ~cond := #in~cond; {6172#(<= ~counter~0 2)} is VALID [2022-04-08 11:20:47,610 INFO L290 TraceCheckUtils]: 39: Hoare triple {6172#(<= ~counter~0 2)} assume !(0 == ~cond); {6172#(<= ~counter~0 2)} is VALID [2022-04-08 11:20:47,611 INFO L290 TraceCheckUtils]: 40: Hoare triple {6172#(<= ~counter~0 2)} assume true; {6172#(<= ~counter~0 2)} is VALID [2022-04-08 11:20:47,611 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6172#(<= ~counter~0 2)} {6172#(<= ~counter~0 2)} #87#return; {6172#(<= ~counter~0 2)} is VALID [2022-04-08 11:20:47,611 INFO L290 TraceCheckUtils]: 42: Hoare triple {6172#(<= ~counter~0 2)} assume !!(~r~0 >= 2 * ~b~0); {6172#(<= ~counter~0 2)} is VALID [2022-04-08 11:20:47,612 INFO L272 TraceCheckUtils]: 43: Hoare triple {6172#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {6172#(<= ~counter~0 2)} is VALID [2022-04-08 11:20:47,612 INFO L290 TraceCheckUtils]: 44: Hoare triple {6172#(<= ~counter~0 2)} ~cond := #in~cond; {6172#(<= ~counter~0 2)} is VALID [2022-04-08 11:20:47,612 INFO L290 TraceCheckUtils]: 45: Hoare triple {6172#(<= ~counter~0 2)} assume !(0 == ~cond); {6172#(<= ~counter~0 2)} is VALID [2022-04-08 11:20:47,613 INFO L290 TraceCheckUtils]: 46: Hoare triple {6172#(<= ~counter~0 2)} assume true; {6172#(<= ~counter~0 2)} is VALID [2022-04-08 11:20:47,613 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6172#(<= ~counter~0 2)} {6172#(<= ~counter~0 2)} #89#return; {6172#(<= ~counter~0 2)} is VALID [2022-04-08 11:20:47,613 INFO L290 TraceCheckUtils]: 48: Hoare triple {6172#(<= ~counter~0 2)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {6172#(<= ~counter~0 2)} is VALID [2022-04-08 11:20:47,614 INFO L290 TraceCheckUtils]: 49: Hoare triple {6172#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6245#(<= |main_#t~post7| 2)} is VALID [2022-04-08 11:20:47,614 INFO L290 TraceCheckUtils]: 50: Hoare triple {6245#(<= |main_#t~post7| 2)} assume !(#t~post7 < 10);havoc #t~post7; {6091#false} is VALID [2022-04-08 11:20:47,614 INFO L290 TraceCheckUtils]: 51: Hoare triple {6091#false} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {6091#false} is VALID [2022-04-08 11:20:47,614 INFO L290 TraceCheckUtils]: 52: Hoare triple {6091#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6091#false} is VALID [2022-04-08 11:20:47,614 INFO L290 TraceCheckUtils]: 53: Hoare triple {6091#false} assume !(#t~post6 < 10);havoc #t~post6; {6091#false} is VALID [2022-04-08 11:20:47,614 INFO L272 TraceCheckUtils]: 54: Hoare triple {6091#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {6091#false} is VALID [2022-04-08 11:20:47,615 INFO L290 TraceCheckUtils]: 55: Hoare triple {6091#false} ~cond := #in~cond; {6091#false} is VALID [2022-04-08 11:20:47,615 INFO L290 TraceCheckUtils]: 56: Hoare triple {6091#false} assume 0 == ~cond; {6091#false} is VALID [2022-04-08 11:20:47,615 INFO L290 TraceCheckUtils]: 57: Hoare triple {6091#false} assume !false; {6091#false} is VALID [2022-04-08 11:20:47,615 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-08 11:20:47,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:20:47,859 INFO L290 TraceCheckUtils]: 57: Hoare triple {6091#false} assume !false; {6091#false} is VALID [2022-04-08 11:20:47,859 INFO L290 TraceCheckUtils]: 56: Hoare triple {6091#false} assume 0 == ~cond; {6091#false} is VALID [2022-04-08 11:20:47,859 INFO L290 TraceCheckUtils]: 55: Hoare triple {6091#false} ~cond := #in~cond; {6091#false} is VALID [2022-04-08 11:20:47,859 INFO L272 TraceCheckUtils]: 54: Hoare triple {6091#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {6091#false} is VALID [2022-04-08 11:20:47,859 INFO L290 TraceCheckUtils]: 53: Hoare triple {6091#false} assume !(#t~post6 < 10);havoc #t~post6; {6091#false} is VALID [2022-04-08 11:20:47,859 INFO L290 TraceCheckUtils]: 52: Hoare triple {6091#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6091#false} is VALID [2022-04-08 11:20:47,859 INFO L290 TraceCheckUtils]: 51: Hoare triple {6091#false} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {6091#false} is VALID [2022-04-08 11:20:47,860 INFO L290 TraceCheckUtils]: 50: Hoare triple {6291#(< |main_#t~post7| 10)} assume !(#t~post7 < 10);havoc #t~post7; {6091#false} is VALID [2022-04-08 11:20:47,860 INFO L290 TraceCheckUtils]: 49: Hoare triple {6295#(< ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6291#(< |main_#t~post7| 10)} is VALID [2022-04-08 11:20:47,860 INFO L290 TraceCheckUtils]: 48: Hoare triple {6295#(< ~counter~0 10)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {6295#(< ~counter~0 10)} is VALID [2022-04-08 11:20:47,861 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6090#true} {6295#(< ~counter~0 10)} #89#return; {6295#(< ~counter~0 10)} is VALID [2022-04-08 11:20:47,861 INFO L290 TraceCheckUtils]: 46: Hoare triple {6090#true} assume true; {6090#true} is VALID [2022-04-08 11:20:47,861 INFO L290 TraceCheckUtils]: 45: Hoare triple {6090#true} assume !(0 == ~cond); {6090#true} is VALID [2022-04-08 11:20:47,861 INFO L290 TraceCheckUtils]: 44: Hoare triple {6090#true} ~cond := #in~cond; {6090#true} is VALID [2022-04-08 11:20:47,861 INFO L272 TraceCheckUtils]: 43: Hoare triple {6295#(< ~counter~0 10)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {6090#true} is VALID [2022-04-08 11:20:47,862 INFO L290 TraceCheckUtils]: 42: Hoare triple {6295#(< ~counter~0 10)} assume !!(~r~0 >= 2 * ~b~0); {6295#(< ~counter~0 10)} is VALID [2022-04-08 11:20:47,863 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6090#true} {6295#(< ~counter~0 10)} #87#return; {6295#(< ~counter~0 10)} is VALID [2022-04-08 11:20:47,863 INFO L290 TraceCheckUtils]: 40: Hoare triple {6090#true} assume true; {6090#true} is VALID [2022-04-08 11:20:47,863 INFO L290 TraceCheckUtils]: 39: Hoare triple {6090#true} assume !(0 == ~cond); {6090#true} is VALID [2022-04-08 11:20:47,863 INFO L290 TraceCheckUtils]: 38: Hoare triple {6090#true} ~cond := #in~cond; {6090#true} is VALID [2022-04-08 11:20:47,863 INFO L272 TraceCheckUtils]: 37: Hoare triple {6295#(< ~counter~0 10)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {6090#true} is VALID [2022-04-08 11:20:47,864 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6090#true} {6295#(< ~counter~0 10)} #85#return; {6295#(< ~counter~0 10)} is VALID [2022-04-08 11:20:47,864 INFO L290 TraceCheckUtils]: 35: Hoare triple {6090#true} assume true; {6090#true} is VALID [2022-04-08 11:20:47,864 INFO L290 TraceCheckUtils]: 34: Hoare triple {6090#true} assume !(0 == ~cond); {6090#true} is VALID [2022-04-08 11:20:47,864 INFO L290 TraceCheckUtils]: 33: Hoare triple {6090#true} ~cond := #in~cond; {6090#true} is VALID [2022-04-08 11:20:47,864 INFO L272 TraceCheckUtils]: 32: Hoare triple {6295#(< ~counter~0 10)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {6090#true} is VALID [2022-04-08 11:20:47,865 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6090#true} {6295#(< ~counter~0 10)} #83#return; {6295#(< ~counter~0 10)} is VALID [2022-04-08 11:20:47,865 INFO L290 TraceCheckUtils]: 30: Hoare triple {6090#true} assume true; {6090#true} is VALID [2022-04-08 11:20:47,865 INFO L290 TraceCheckUtils]: 29: Hoare triple {6090#true} assume !(0 == ~cond); {6090#true} is VALID [2022-04-08 11:20:47,865 INFO L290 TraceCheckUtils]: 28: Hoare triple {6090#true} ~cond := #in~cond; {6090#true} is VALID [2022-04-08 11:20:47,865 INFO L272 TraceCheckUtils]: 27: Hoare triple {6295#(< ~counter~0 10)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {6090#true} is VALID [2022-04-08 11:20:47,865 INFO L290 TraceCheckUtils]: 26: Hoare triple {6295#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {6295#(< ~counter~0 10)} is VALID [2022-04-08 11:20:47,866 INFO L290 TraceCheckUtils]: 25: Hoare triple {6368#(< ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6295#(< ~counter~0 10)} is VALID [2022-04-08 11:20:47,866 INFO L290 TraceCheckUtils]: 24: Hoare triple {6368#(< ~counter~0 9)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {6368#(< ~counter~0 9)} is VALID [2022-04-08 11:20:47,867 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6090#true} {6368#(< ~counter~0 9)} #81#return; {6368#(< ~counter~0 9)} is VALID [2022-04-08 11:20:47,867 INFO L290 TraceCheckUtils]: 22: Hoare triple {6090#true} assume true; {6090#true} is VALID [2022-04-08 11:20:47,867 INFO L290 TraceCheckUtils]: 21: Hoare triple {6090#true} assume !(0 == ~cond); {6090#true} is VALID [2022-04-08 11:20:47,867 INFO L290 TraceCheckUtils]: 20: Hoare triple {6090#true} ~cond := #in~cond; {6090#true} is VALID [2022-04-08 11:20:47,867 INFO L272 TraceCheckUtils]: 19: Hoare triple {6368#(< ~counter~0 9)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {6090#true} is VALID [2022-04-08 11:20:47,868 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6090#true} {6368#(< ~counter~0 9)} #79#return; {6368#(< ~counter~0 9)} is VALID [2022-04-08 11:20:47,868 INFO L290 TraceCheckUtils]: 17: Hoare triple {6090#true} assume true; {6090#true} is VALID [2022-04-08 11:20:47,868 INFO L290 TraceCheckUtils]: 16: Hoare triple {6090#true} assume !(0 == ~cond); {6090#true} is VALID [2022-04-08 11:20:47,868 INFO L290 TraceCheckUtils]: 15: Hoare triple {6090#true} ~cond := #in~cond; {6090#true} is VALID [2022-04-08 11:20:47,868 INFO L272 TraceCheckUtils]: 14: Hoare triple {6368#(< ~counter~0 9)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {6090#true} is VALID [2022-04-08 11:20:47,869 INFO L290 TraceCheckUtils]: 13: Hoare triple {6368#(< ~counter~0 9)} assume !!(#t~post6 < 10);havoc #t~post6; {6368#(< ~counter~0 9)} is VALID [2022-04-08 11:20:47,880 INFO L290 TraceCheckUtils]: 12: Hoare triple {6408#(< ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6368#(< ~counter~0 9)} is VALID [2022-04-08 11:20:47,880 INFO L290 TraceCheckUtils]: 11: Hoare triple {6408#(< ~counter~0 8)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {6408#(< ~counter~0 8)} is VALID [2022-04-08 11:20:47,880 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6090#true} {6408#(< ~counter~0 8)} #77#return; {6408#(< ~counter~0 8)} is VALID [2022-04-08 11:20:47,881 INFO L290 TraceCheckUtils]: 9: Hoare triple {6090#true} assume true; {6090#true} is VALID [2022-04-08 11:20:47,881 INFO L290 TraceCheckUtils]: 8: Hoare triple {6090#true} assume !(0 == ~cond); {6090#true} is VALID [2022-04-08 11:20:47,881 INFO L290 TraceCheckUtils]: 7: Hoare triple {6090#true} ~cond := #in~cond; {6090#true} is VALID [2022-04-08 11:20:47,881 INFO L272 TraceCheckUtils]: 6: Hoare triple {6408#(< ~counter~0 8)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6090#true} is VALID [2022-04-08 11:20:47,881 INFO L290 TraceCheckUtils]: 5: Hoare triple {6408#(< ~counter~0 8)} 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; {6408#(< ~counter~0 8)} is VALID [2022-04-08 11:20:47,882 INFO L272 TraceCheckUtils]: 4: Hoare triple {6408#(< ~counter~0 8)} call #t~ret8 := main(); {6408#(< ~counter~0 8)} is VALID [2022-04-08 11:20:47,882 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6408#(< ~counter~0 8)} {6090#true} #93#return; {6408#(< ~counter~0 8)} is VALID [2022-04-08 11:20:47,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {6408#(< ~counter~0 8)} assume true; {6408#(< ~counter~0 8)} is VALID [2022-04-08 11:20:47,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {6090#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; {6408#(< ~counter~0 8)} is VALID [2022-04-08 11:20:47,883 INFO L272 TraceCheckUtils]: 0: Hoare triple {6090#true} call ULTIMATE.init(); {6090#true} is VALID [2022-04-08 11:20:47,883 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-08 11:20:47,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:20:47,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413008494] [2022-04-08 11:20:47,883 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:20:47,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706554626] [2022-04-08 11:20:47,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706554626] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:20:47,884 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:20:47,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-08 11:20:47,884 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:20:47,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1073967399] [2022-04-08 11:20:47,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1073967399] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:20:47,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:20:47,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 11:20:47,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747595527] [2022-04-08 11:20:47,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:20:47,885 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-08 11:20:47,885 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:20:47,885 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-08 11:20:47,915 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-08 11:20:47,915 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 11:20:47,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:20:47,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 11:20:47,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-08 11:20:47,916 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-08 11:20:48,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:20:48,179 INFO L93 Difference]: Finished difference Result 173 states and 218 transitions. [2022-04-08 11:20:48,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 11:20:48,179 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-08 11:20:48,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:20:48,179 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-08 11:20:48,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 103 transitions. [2022-04-08 11:20:48,180 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-08 11:20:48,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 103 transitions. [2022-04-08 11:20:48,181 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 103 transitions. [2022-04-08 11:20:48,244 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-08 11:20:48,246 INFO L225 Difference]: With dead ends: 173 [2022-04-08 11:20:48,247 INFO L226 Difference]: Without dead ends: 130 [2022-04-08 11:20:48,248 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-04-08 11:20:48,248 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 11:20:48,248 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 163 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 11:20:48,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-04-08 11:20:48,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-04-08 11:20:48,349 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:20:48,350 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-08 11:20:48,350 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-08 11:20:48,350 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-08 11:20:48,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:20:48,354 INFO L93 Difference]: Finished difference Result 130 states and 161 transitions. [2022-04-08 11:20:48,354 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 161 transitions. [2022-04-08 11:20:48,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:20:48,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:20:48,355 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-08 11:20:48,355 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-08 11:20:48,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:20:48,358 INFO L93 Difference]: Finished difference Result 130 states and 161 transitions. [2022-04-08 11:20:48,358 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 161 transitions. [2022-04-08 11:20:48,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:20:48,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:20:48,359 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:20:48,359 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:20:48,359 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-08 11:20:48,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 161 transitions. [2022-04-08 11:20:48,362 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 161 transitions. Word has length 58 [2022-04-08 11:20:48,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:20:48,363 INFO L478 AbstractCegarLoop]: Abstraction has 130 states and 161 transitions. [2022-04-08 11:20:48,363 INFO L479 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-08 11:20:48,363 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 130 states and 161 transitions. [2022-04-08 11:20:48,512 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-08 11:20:48,512 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 161 transitions. [2022-04-08 11:20:48,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-08 11:20:48,513 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:20:48,513 INFO L499 BasicCegarLoop]: 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-08 11:20:48,531 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-08 11:20:48,713 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-08 11:20:48,714 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:20:48,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:20:48,714 INFO L85 PathProgramCache]: Analyzing trace with hash 78053411, now seen corresponding path program 1 times [2022-04-08 11:20:48,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:20:48,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1683307318] [2022-04-08 11:21:07,458 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:21:07,459 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:21:07,459 INFO L85 PathProgramCache]: Analyzing trace with hash 78053411, now seen corresponding path program 2 times [2022-04-08 11:21:07,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:21:07,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949259694] [2022-04-08 11:21:07,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:21:07,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:21:07,474 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:21:07,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1972091745] [2022-04-08 11:21:07,475 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:21:07,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:21:07,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:21:07,476 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-08 11:21:07,477 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-08 11:21:07,543 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:21:07,544 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:21:07,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-08 11:21:07,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:21:07,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:21:07,727 INFO L272 TraceCheckUtils]: 0: Hoare triple {7315#true} call ULTIMATE.init(); {7315#true} is VALID [2022-04-08 11:21:07,727 INFO L290 TraceCheckUtils]: 1: Hoare triple {7315#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; {7315#true} is VALID [2022-04-08 11:21:07,727 INFO L290 TraceCheckUtils]: 2: Hoare triple {7315#true} assume true; {7315#true} is VALID [2022-04-08 11:21:07,727 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7315#true} {7315#true} #93#return; {7315#true} is VALID [2022-04-08 11:21:07,727 INFO L272 TraceCheckUtils]: 4: Hoare triple {7315#true} call #t~ret8 := main(); {7315#true} is VALID [2022-04-08 11:21:07,728 INFO L290 TraceCheckUtils]: 5: Hoare triple {7315#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; {7315#true} is VALID [2022-04-08 11:21:07,728 INFO L272 TraceCheckUtils]: 6: Hoare triple {7315#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7315#true} is VALID [2022-04-08 11:21:07,728 INFO L290 TraceCheckUtils]: 7: Hoare triple {7315#true} ~cond := #in~cond; {7315#true} is VALID [2022-04-08 11:21:07,728 INFO L290 TraceCheckUtils]: 8: Hoare triple {7315#true} assume !(0 == ~cond); {7315#true} is VALID [2022-04-08 11:21:07,728 INFO L290 TraceCheckUtils]: 9: Hoare triple {7315#true} assume true; {7315#true} is VALID [2022-04-08 11:21:07,728 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7315#true} {7315#true} #77#return; {7315#true} is VALID [2022-04-08 11:21:07,728 INFO L290 TraceCheckUtils]: 11: Hoare triple {7315#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {7315#true} is VALID [2022-04-08 11:21:07,728 INFO L290 TraceCheckUtils]: 12: Hoare triple {7315#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7315#true} is VALID [2022-04-08 11:21:07,728 INFO L290 TraceCheckUtils]: 13: Hoare triple {7315#true} assume !!(#t~post6 < 10);havoc #t~post6; {7315#true} is VALID [2022-04-08 11:21:07,728 INFO L272 TraceCheckUtils]: 14: Hoare triple {7315#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {7315#true} is VALID [2022-04-08 11:21:07,729 INFO L290 TraceCheckUtils]: 15: Hoare triple {7315#true} ~cond := #in~cond; {7315#true} is VALID [2022-04-08 11:21:07,729 INFO L290 TraceCheckUtils]: 16: Hoare triple {7315#true} assume !(0 == ~cond); {7315#true} is VALID [2022-04-08 11:21:07,729 INFO L290 TraceCheckUtils]: 17: Hoare triple {7315#true} assume true; {7315#true} is VALID [2022-04-08 11:21:07,729 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7315#true} {7315#true} #79#return; {7315#true} is VALID [2022-04-08 11:21:07,729 INFO L272 TraceCheckUtils]: 19: Hoare triple {7315#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {7315#true} is VALID [2022-04-08 11:21:07,729 INFO L290 TraceCheckUtils]: 20: Hoare triple {7315#true} ~cond := #in~cond; {7315#true} is VALID [2022-04-08 11:21:07,729 INFO L290 TraceCheckUtils]: 21: Hoare triple {7315#true} assume !(0 == ~cond); {7315#true} is VALID [2022-04-08 11:21:07,729 INFO L290 TraceCheckUtils]: 22: Hoare triple {7315#true} assume true; {7315#true} is VALID [2022-04-08 11:21:07,729 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7315#true} {7315#true} #81#return; {7315#true} is VALID [2022-04-08 11:21:07,730 INFO L290 TraceCheckUtils]: 24: Hoare triple {7315#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {7392#(<= main_~b~0 main_~y~0)} is VALID [2022-04-08 11:21:07,730 INFO L290 TraceCheckUtils]: 25: Hoare triple {7392#(<= main_~b~0 main_~y~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7392#(<= main_~b~0 main_~y~0)} is VALID [2022-04-08 11:21:07,730 INFO L290 TraceCheckUtils]: 26: Hoare triple {7392#(<= main_~b~0 main_~y~0)} assume !!(#t~post7 < 10);havoc #t~post7; {7392#(<= main_~b~0 main_~y~0)} is VALID [2022-04-08 11:21:07,731 INFO L272 TraceCheckUtils]: 27: Hoare triple {7392#(<= main_~b~0 main_~y~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {7315#true} is VALID [2022-04-08 11:21:07,731 INFO L290 TraceCheckUtils]: 28: Hoare triple {7315#true} ~cond := #in~cond; {7315#true} is VALID [2022-04-08 11:21:07,731 INFO L290 TraceCheckUtils]: 29: Hoare triple {7315#true} assume !(0 == ~cond); {7315#true} is VALID [2022-04-08 11:21:07,731 INFO L290 TraceCheckUtils]: 30: Hoare triple {7315#true} assume true; {7315#true} is VALID [2022-04-08 11:21:07,731 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {7315#true} {7392#(<= main_~b~0 main_~y~0)} #83#return; {7392#(<= main_~b~0 main_~y~0)} is VALID [2022-04-08 11:21:07,731 INFO L272 TraceCheckUtils]: 32: Hoare triple {7392#(<= main_~b~0 main_~y~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {7315#true} is VALID [2022-04-08 11:21:07,732 INFO L290 TraceCheckUtils]: 33: Hoare triple {7315#true} ~cond := #in~cond; {7315#true} is VALID [2022-04-08 11:21:07,732 INFO L290 TraceCheckUtils]: 34: Hoare triple {7315#true} assume !(0 == ~cond); {7315#true} is VALID [2022-04-08 11:21:07,732 INFO L290 TraceCheckUtils]: 35: Hoare triple {7315#true} assume true; {7315#true} is VALID [2022-04-08 11:21:07,732 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7315#true} {7392#(<= main_~b~0 main_~y~0)} #85#return; {7392#(<= main_~b~0 main_~y~0)} is VALID [2022-04-08 11:21:07,732 INFO L272 TraceCheckUtils]: 37: Hoare triple {7392#(<= main_~b~0 main_~y~0)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {7315#true} is VALID [2022-04-08 11:21:07,733 INFO L290 TraceCheckUtils]: 38: Hoare triple {7315#true} ~cond := #in~cond; {7315#true} is VALID [2022-04-08 11:21:07,733 INFO L290 TraceCheckUtils]: 39: Hoare triple {7315#true} assume !(0 == ~cond); {7315#true} is VALID [2022-04-08 11:21:07,733 INFO L290 TraceCheckUtils]: 40: Hoare triple {7315#true} assume true; {7315#true} is VALID [2022-04-08 11:21:07,733 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7315#true} {7392#(<= main_~b~0 main_~y~0)} #87#return; {7392#(<= main_~b~0 main_~y~0)} is VALID [2022-04-08 11:21:07,734 INFO L290 TraceCheckUtils]: 42: Hoare triple {7392#(<= main_~b~0 main_~y~0)} assume !(~r~0 >= 2 * ~b~0); {7447#(and (not (<= (* main_~b~0 2) main_~r~0)) (<= main_~b~0 main_~y~0))} is VALID [2022-04-08 11:21:07,734 INFO L290 TraceCheckUtils]: 43: Hoare triple {7447#(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; {7451#(< main_~r~0 main_~y~0)} is VALID [2022-04-08 11:21:07,735 INFO L290 TraceCheckUtils]: 44: Hoare triple {7451#(< main_~r~0 main_~y~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7451#(< main_~r~0 main_~y~0)} is VALID [2022-04-08 11:21:07,735 INFO L290 TraceCheckUtils]: 45: Hoare triple {7451#(< main_~r~0 main_~y~0)} assume !!(#t~post6 < 10);havoc #t~post6; {7451#(< main_~r~0 main_~y~0)} is VALID [2022-04-08 11:21:07,735 INFO L272 TraceCheckUtils]: 46: Hoare triple {7451#(< main_~r~0 main_~y~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {7315#true} is VALID [2022-04-08 11:21:07,735 INFO L290 TraceCheckUtils]: 47: Hoare triple {7315#true} ~cond := #in~cond; {7315#true} is VALID [2022-04-08 11:21:07,735 INFO L290 TraceCheckUtils]: 48: Hoare triple {7315#true} assume !(0 == ~cond); {7315#true} is VALID [2022-04-08 11:21:07,735 INFO L290 TraceCheckUtils]: 49: Hoare triple {7315#true} assume true; {7315#true} is VALID [2022-04-08 11:21:07,736 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7315#true} {7451#(< main_~r~0 main_~y~0)} #79#return; {7451#(< main_~r~0 main_~y~0)} is VALID [2022-04-08 11:21:07,736 INFO L272 TraceCheckUtils]: 51: Hoare triple {7451#(< main_~r~0 main_~y~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {7315#true} is VALID [2022-04-08 11:21:07,736 INFO L290 TraceCheckUtils]: 52: Hoare triple {7315#true} ~cond := #in~cond; {7315#true} is VALID [2022-04-08 11:21:07,736 INFO L290 TraceCheckUtils]: 53: Hoare triple {7315#true} assume !(0 == ~cond); {7315#true} is VALID [2022-04-08 11:21:07,736 INFO L290 TraceCheckUtils]: 54: Hoare triple {7315#true} assume true; {7315#true} is VALID [2022-04-08 11:21:07,737 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {7315#true} {7451#(< main_~r~0 main_~y~0)} #81#return; {7451#(< main_~r~0 main_~y~0)} is VALID [2022-04-08 11:21:07,737 INFO L290 TraceCheckUtils]: 56: Hoare triple {7451#(< main_~r~0 main_~y~0)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {7316#false} is VALID [2022-04-08 11:21:07,737 INFO L290 TraceCheckUtils]: 57: Hoare triple {7316#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7316#false} is VALID [2022-04-08 11:21:07,737 INFO L290 TraceCheckUtils]: 58: Hoare triple {7316#false} assume !(#t~post7 < 10);havoc #t~post7; {7316#false} is VALID [2022-04-08 11:21:07,737 INFO L290 TraceCheckUtils]: 59: Hoare triple {7316#false} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {7316#false} is VALID [2022-04-08 11:21:07,738 INFO L290 TraceCheckUtils]: 60: Hoare triple {7316#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7316#false} is VALID [2022-04-08 11:21:07,738 INFO L290 TraceCheckUtils]: 61: Hoare triple {7316#false} assume !(#t~post6 < 10);havoc #t~post6; {7316#false} is VALID [2022-04-08 11:21:07,738 INFO L272 TraceCheckUtils]: 62: Hoare triple {7316#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {7316#false} is VALID [2022-04-08 11:21:07,738 INFO L290 TraceCheckUtils]: 63: Hoare triple {7316#false} ~cond := #in~cond; {7316#false} is VALID [2022-04-08 11:21:07,738 INFO L290 TraceCheckUtils]: 64: Hoare triple {7316#false} assume 0 == ~cond; {7316#false} is VALID [2022-04-08 11:21:07,738 INFO L290 TraceCheckUtils]: 65: Hoare triple {7316#false} assume !false; {7316#false} is VALID [2022-04-08 11:21:07,738 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-08 11:21:07,738 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:21:07,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:21:07,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949259694] [2022-04-08 11:21:07,739 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:21:07,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972091745] [2022-04-08 11:21:07,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972091745] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:21:07,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:21:07,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:21:07,739 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:21:07,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1683307318] [2022-04-08 11:21:07,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1683307318] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:21:07,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:21:07,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:21:07,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206655273] [2022-04-08 11:21:07,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:21:07,740 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-08 11:21:07,740 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:21:07,740 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-08 11:21:07,771 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-08 11:21:07,772 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 11:21:07,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:21:07,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 11:21:07,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 11:21:07,772 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-08 11:21:08,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:21:08,096 INFO L93 Difference]: Finished difference Result 190 states and 240 transitions. [2022-04-08 11:21:08,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 11:21:08,097 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-08 11:21:08,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:21:08,097 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-08 11:21:08,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2022-04-08 11:21:08,098 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-08 11:21:08,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2022-04-08 11:21:08,099 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 109 transitions. [2022-04-08 11:21:08,171 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-08 11:21:08,173 INFO L225 Difference]: With dead ends: 190 [2022-04-08 11:21:08,173 INFO L226 Difference]: Without dead ends: 119 [2022-04-08 11:21:08,174 INFO L912 BasicCegarLoop]: 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-08 11:21:08,174 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 11 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-08 11:21:08,175 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 120 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 11:21:08,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-04-08 11:21:08,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 112. [2022-04-08 11:21:08,303 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:21:08,303 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-08 11:21:08,303 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-08 11:21:08,304 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-08 11:21:08,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:21:08,306 INFO L93 Difference]: Finished difference Result 119 states and 143 transitions. [2022-04-08 11:21:08,306 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 143 transitions. [2022-04-08 11:21:08,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:21:08,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:21:08,306 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-08 11:21:08,310 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-08 11:21:08,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:21:08,313 INFO L93 Difference]: Finished difference Result 119 states and 143 transitions. [2022-04-08 11:21:08,313 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 143 transitions. [2022-04-08 11:21:08,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:21:08,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:21:08,313 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:21:08,313 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:21:08,314 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-08 11:21:08,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 133 transitions. [2022-04-08 11:21:08,315 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 133 transitions. Word has length 66 [2022-04-08 11:21:08,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:21:08,316 INFO L478 AbstractCegarLoop]: Abstraction has 112 states and 133 transitions. [2022-04-08 11:21:08,316 INFO L479 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-08 11:21:08,316 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 112 states and 133 transitions. [2022-04-08 11:21:08,447 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-08 11:21:08,447 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 133 transitions. [2022-04-08 11:21:08,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-08 11:21:08,448 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:21:08,448 INFO L499 BasicCegarLoop]: 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-08 11:21:08,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-08 11:21:08,648 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-08 11:21:08,648 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:21:08,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:21:08,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1361251212, now seen corresponding path program 1 times [2022-04-08 11:21:08,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:21:08,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [42190079] [2022-04-08 11:21:20,885 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:21:20,886 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:21:20,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1361251212, now seen corresponding path program 2 times [2022-04-08 11:21:20,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:21:20,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028186493] [2022-04-08 11:21:20,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:21:20,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:21:20,897 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:21:20,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [785098712] [2022-04-08 11:21:20,897 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:21:20,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:21:20,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:21:20,898 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-08 11:21:20,899 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-08 11:21:20,954 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:21:20,954 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:21:20,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 11:21:20,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:21:20,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:21:21,220 INFO L272 TraceCheckUtils]: 0: Hoare triple {8362#true} call ULTIMATE.init(); {8362#true} is VALID [2022-04-08 11:21:21,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {8362#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; {8370#(<= ~counter~0 0)} is VALID [2022-04-08 11:21:21,221 INFO L290 TraceCheckUtils]: 2: Hoare triple {8370#(<= ~counter~0 0)} assume true; {8370#(<= ~counter~0 0)} is VALID [2022-04-08 11:21:21,221 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8370#(<= ~counter~0 0)} {8362#true} #93#return; {8370#(<= ~counter~0 0)} is VALID [2022-04-08 11:21:21,222 INFO L272 TraceCheckUtils]: 4: Hoare triple {8370#(<= ~counter~0 0)} call #t~ret8 := main(); {8370#(<= ~counter~0 0)} is VALID [2022-04-08 11:21:21,222 INFO L290 TraceCheckUtils]: 5: Hoare triple {8370#(<= ~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; {8370#(<= ~counter~0 0)} is VALID [2022-04-08 11:21:21,222 INFO L272 TraceCheckUtils]: 6: Hoare triple {8370#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8370#(<= ~counter~0 0)} is VALID [2022-04-08 11:21:21,223 INFO L290 TraceCheckUtils]: 7: Hoare triple {8370#(<= ~counter~0 0)} ~cond := #in~cond; {8370#(<= ~counter~0 0)} is VALID [2022-04-08 11:21:21,223 INFO L290 TraceCheckUtils]: 8: Hoare triple {8370#(<= ~counter~0 0)} assume !(0 == ~cond); {8370#(<= ~counter~0 0)} is VALID [2022-04-08 11:21:21,223 INFO L290 TraceCheckUtils]: 9: Hoare triple {8370#(<= ~counter~0 0)} assume true; {8370#(<= ~counter~0 0)} is VALID [2022-04-08 11:21:21,224 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8370#(<= ~counter~0 0)} {8370#(<= ~counter~0 0)} #77#return; {8370#(<= ~counter~0 0)} is VALID [2022-04-08 11:21:21,224 INFO L290 TraceCheckUtils]: 11: Hoare triple {8370#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {8370#(<= ~counter~0 0)} is VALID [2022-04-08 11:21:21,224 INFO L290 TraceCheckUtils]: 12: Hoare triple {8370#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8404#(<= ~counter~0 1)} is VALID [2022-04-08 11:21:21,225 INFO L290 TraceCheckUtils]: 13: Hoare triple {8404#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {8404#(<= ~counter~0 1)} is VALID [2022-04-08 11:21:21,225 INFO L272 TraceCheckUtils]: 14: Hoare triple {8404#(<= ~counter~0 1)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {8404#(<= ~counter~0 1)} is VALID [2022-04-08 11:21:21,226 INFO L290 TraceCheckUtils]: 15: Hoare triple {8404#(<= ~counter~0 1)} ~cond := #in~cond; {8404#(<= ~counter~0 1)} is VALID [2022-04-08 11:21:21,226 INFO L290 TraceCheckUtils]: 16: Hoare triple {8404#(<= ~counter~0 1)} assume !(0 == ~cond); {8404#(<= ~counter~0 1)} is VALID [2022-04-08 11:21:21,227 INFO L290 TraceCheckUtils]: 17: Hoare triple {8404#(<= ~counter~0 1)} assume true; {8404#(<= ~counter~0 1)} is VALID [2022-04-08 11:21:21,227 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8404#(<= ~counter~0 1)} {8404#(<= ~counter~0 1)} #79#return; {8404#(<= ~counter~0 1)} is VALID [2022-04-08 11:21:21,228 INFO L272 TraceCheckUtils]: 19: Hoare triple {8404#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {8404#(<= ~counter~0 1)} is VALID [2022-04-08 11:21:21,228 INFO L290 TraceCheckUtils]: 20: Hoare triple {8404#(<= ~counter~0 1)} ~cond := #in~cond; {8404#(<= ~counter~0 1)} is VALID [2022-04-08 11:21:21,228 INFO L290 TraceCheckUtils]: 21: Hoare triple {8404#(<= ~counter~0 1)} assume !(0 == ~cond); {8404#(<= ~counter~0 1)} is VALID [2022-04-08 11:21:21,228 INFO L290 TraceCheckUtils]: 22: Hoare triple {8404#(<= ~counter~0 1)} assume true; {8404#(<= ~counter~0 1)} is VALID [2022-04-08 11:21:21,229 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8404#(<= ~counter~0 1)} {8404#(<= ~counter~0 1)} #81#return; {8404#(<= ~counter~0 1)} is VALID [2022-04-08 11:21:21,229 INFO L290 TraceCheckUtils]: 24: Hoare triple {8404#(<= ~counter~0 1)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {8404#(<= ~counter~0 1)} is VALID [2022-04-08 11:21:21,230 INFO L290 TraceCheckUtils]: 25: Hoare triple {8404#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8444#(<= ~counter~0 2)} is VALID [2022-04-08 11:21:21,230 INFO L290 TraceCheckUtils]: 26: Hoare triple {8444#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {8444#(<= ~counter~0 2)} is VALID [2022-04-08 11:21:21,231 INFO L272 TraceCheckUtils]: 27: Hoare triple {8444#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {8444#(<= ~counter~0 2)} is VALID [2022-04-08 11:21:21,231 INFO L290 TraceCheckUtils]: 28: Hoare triple {8444#(<= ~counter~0 2)} ~cond := #in~cond; {8444#(<= ~counter~0 2)} is VALID [2022-04-08 11:21:21,231 INFO L290 TraceCheckUtils]: 29: Hoare triple {8444#(<= ~counter~0 2)} assume !(0 == ~cond); {8444#(<= ~counter~0 2)} is VALID [2022-04-08 11:21:21,232 INFO L290 TraceCheckUtils]: 30: Hoare triple {8444#(<= ~counter~0 2)} assume true; {8444#(<= ~counter~0 2)} is VALID [2022-04-08 11:21:21,232 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {8444#(<= ~counter~0 2)} {8444#(<= ~counter~0 2)} #83#return; {8444#(<= ~counter~0 2)} is VALID [2022-04-08 11:21:21,232 INFO L272 TraceCheckUtils]: 32: Hoare triple {8444#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {8444#(<= ~counter~0 2)} is VALID [2022-04-08 11:21:21,233 INFO L290 TraceCheckUtils]: 33: Hoare triple {8444#(<= ~counter~0 2)} ~cond := #in~cond; {8444#(<= ~counter~0 2)} is VALID [2022-04-08 11:21:21,233 INFO L290 TraceCheckUtils]: 34: Hoare triple {8444#(<= ~counter~0 2)} assume !(0 == ~cond); {8444#(<= ~counter~0 2)} is VALID [2022-04-08 11:21:21,233 INFO L290 TraceCheckUtils]: 35: Hoare triple {8444#(<= ~counter~0 2)} assume true; {8444#(<= ~counter~0 2)} is VALID [2022-04-08 11:21:21,234 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8444#(<= ~counter~0 2)} {8444#(<= ~counter~0 2)} #85#return; {8444#(<= ~counter~0 2)} is VALID [2022-04-08 11:21:21,234 INFO L272 TraceCheckUtils]: 37: Hoare triple {8444#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {8444#(<= ~counter~0 2)} is VALID [2022-04-08 11:21:21,234 INFO L290 TraceCheckUtils]: 38: Hoare triple {8444#(<= ~counter~0 2)} ~cond := #in~cond; {8444#(<= ~counter~0 2)} is VALID [2022-04-08 11:21:21,235 INFO L290 TraceCheckUtils]: 39: Hoare triple {8444#(<= ~counter~0 2)} assume !(0 == ~cond); {8444#(<= ~counter~0 2)} is VALID [2022-04-08 11:21:21,235 INFO L290 TraceCheckUtils]: 40: Hoare triple {8444#(<= ~counter~0 2)} assume true; {8444#(<= ~counter~0 2)} is VALID [2022-04-08 11:21:21,235 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {8444#(<= ~counter~0 2)} {8444#(<= ~counter~0 2)} #87#return; {8444#(<= ~counter~0 2)} is VALID [2022-04-08 11:21:21,236 INFO L290 TraceCheckUtils]: 42: Hoare triple {8444#(<= ~counter~0 2)} assume !!(~r~0 >= 2 * ~b~0); {8444#(<= ~counter~0 2)} is VALID [2022-04-08 11:21:21,236 INFO L272 TraceCheckUtils]: 43: Hoare triple {8444#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {8444#(<= ~counter~0 2)} is VALID [2022-04-08 11:21:21,236 INFO L290 TraceCheckUtils]: 44: Hoare triple {8444#(<= ~counter~0 2)} ~cond := #in~cond; {8444#(<= ~counter~0 2)} is VALID [2022-04-08 11:21:21,237 INFO L290 TraceCheckUtils]: 45: Hoare triple {8444#(<= ~counter~0 2)} assume !(0 == ~cond); {8444#(<= ~counter~0 2)} is VALID [2022-04-08 11:21:21,237 INFO L290 TraceCheckUtils]: 46: Hoare triple {8444#(<= ~counter~0 2)} assume true; {8444#(<= ~counter~0 2)} is VALID [2022-04-08 11:21:21,238 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8444#(<= ~counter~0 2)} {8444#(<= ~counter~0 2)} #89#return; {8444#(<= ~counter~0 2)} is VALID [2022-04-08 11:21:21,238 INFO L290 TraceCheckUtils]: 48: Hoare triple {8444#(<= ~counter~0 2)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {8444#(<= ~counter~0 2)} is VALID [2022-04-08 11:21:21,238 INFO L290 TraceCheckUtils]: 49: Hoare triple {8444#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8517#(<= ~counter~0 3)} is VALID [2022-04-08 11:21:21,239 INFO L290 TraceCheckUtils]: 50: Hoare triple {8517#(<= ~counter~0 3)} assume !!(#t~post7 < 10);havoc #t~post7; {8517#(<= ~counter~0 3)} is VALID [2022-04-08 11:21:21,239 INFO L272 TraceCheckUtils]: 51: Hoare triple {8517#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {8517#(<= ~counter~0 3)} is VALID [2022-04-08 11:21:21,239 INFO L290 TraceCheckUtils]: 52: Hoare triple {8517#(<= ~counter~0 3)} ~cond := #in~cond; {8517#(<= ~counter~0 3)} is VALID [2022-04-08 11:21:21,240 INFO L290 TraceCheckUtils]: 53: Hoare triple {8517#(<= ~counter~0 3)} assume !(0 == ~cond); {8517#(<= ~counter~0 3)} is VALID [2022-04-08 11:21:21,240 INFO L290 TraceCheckUtils]: 54: Hoare triple {8517#(<= ~counter~0 3)} assume true; {8517#(<= ~counter~0 3)} is VALID [2022-04-08 11:21:21,241 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8517#(<= ~counter~0 3)} {8517#(<= ~counter~0 3)} #83#return; {8517#(<= ~counter~0 3)} is VALID [2022-04-08 11:21:21,241 INFO L272 TraceCheckUtils]: 56: Hoare triple {8517#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {8517#(<= ~counter~0 3)} is VALID [2022-04-08 11:21:21,241 INFO L290 TraceCheckUtils]: 57: Hoare triple {8517#(<= ~counter~0 3)} ~cond := #in~cond; {8517#(<= ~counter~0 3)} is VALID [2022-04-08 11:21:21,242 INFO L290 TraceCheckUtils]: 58: Hoare triple {8517#(<= ~counter~0 3)} assume !(0 == ~cond); {8517#(<= ~counter~0 3)} is VALID [2022-04-08 11:21:21,242 INFO L290 TraceCheckUtils]: 59: Hoare triple {8517#(<= ~counter~0 3)} assume true; {8517#(<= ~counter~0 3)} is VALID [2022-04-08 11:21:21,242 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {8517#(<= ~counter~0 3)} {8517#(<= ~counter~0 3)} #85#return; {8517#(<= ~counter~0 3)} is VALID [2022-04-08 11:21:21,243 INFO L272 TraceCheckUtils]: 61: Hoare triple {8517#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {8517#(<= ~counter~0 3)} is VALID [2022-04-08 11:21:21,243 INFO L290 TraceCheckUtils]: 62: Hoare triple {8517#(<= ~counter~0 3)} ~cond := #in~cond; {8517#(<= ~counter~0 3)} is VALID [2022-04-08 11:21:21,243 INFO L290 TraceCheckUtils]: 63: Hoare triple {8517#(<= ~counter~0 3)} assume !(0 == ~cond); {8517#(<= ~counter~0 3)} is VALID [2022-04-08 11:21:21,244 INFO L290 TraceCheckUtils]: 64: Hoare triple {8517#(<= ~counter~0 3)} assume true; {8517#(<= ~counter~0 3)} is VALID [2022-04-08 11:21:21,244 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {8517#(<= ~counter~0 3)} {8517#(<= ~counter~0 3)} #87#return; {8517#(<= ~counter~0 3)} is VALID [2022-04-08 11:21:21,244 INFO L290 TraceCheckUtils]: 66: Hoare triple {8517#(<= ~counter~0 3)} assume !(~r~0 >= 2 * ~b~0); {8517#(<= ~counter~0 3)} is VALID [2022-04-08 11:21:21,245 INFO L290 TraceCheckUtils]: 67: Hoare triple {8517#(<= ~counter~0 3)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {8517#(<= ~counter~0 3)} is VALID [2022-04-08 11:21:21,245 INFO L290 TraceCheckUtils]: 68: Hoare triple {8517#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8575#(<= |main_#t~post6| 3)} is VALID [2022-04-08 11:21:21,246 INFO L290 TraceCheckUtils]: 69: Hoare triple {8575#(<= |main_#t~post6| 3)} assume !(#t~post6 < 10);havoc #t~post6; {8363#false} is VALID [2022-04-08 11:21:21,246 INFO L272 TraceCheckUtils]: 70: Hoare triple {8363#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {8363#false} is VALID [2022-04-08 11:21:21,246 INFO L290 TraceCheckUtils]: 71: Hoare triple {8363#false} ~cond := #in~cond; {8363#false} is VALID [2022-04-08 11:21:21,246 INFO L290 TraceCheckUtils]: 72: Hoare triple {8363#false} assume 0 == ~cond; {8363#false} is VALID [2022-04-08 11:21:21,246 INFO L290 TraceCheckUtils]: 73: Hoare triple {8363#false} assume !false; {8363#false} is VALID [2022-04-08 11:21:21,247 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-08 11:21:21,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:21:21,531 INFO L290 TraceCheckUtils]: 73: Hoare triple {8363#false} assume !false; {8363#false} is VALID [2022-04-08 11:21:21,531 INFO L290 TraceCheckUtils]: 72: Hoare triple {8363#false} assume 0 == ~cond; {8363#false} is VALID [2022-04-08 11:21:21,531 INFO L290 TraceCheckUtils]: 71: Hoare triple {8363#false} ~cond := #in~cond; {8363#false} is VALID [2022-04-08 11:21:21,531 INFO L272 TraceCheckUtils]: 70: Hoare triple {8363#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {8363#false} is VALID [2022-04-08 11:21:21,531 INFO L290 TraceCheckUtils]: 69: Hoare triple {8603#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {8363#false} is VALID [2022-04-08 11:21:21,532 INFO L290 TraceCheckUtils]: 68: Hoare triple {8607#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8603#(< |main_#t~post6| 10)} is VALID [2022-04-08 11:21:21,532 INFO L290 TraceCheckUtils]: 67: Hoare triple {8607#(< ~counter~0 10)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {8607#(< ~counter~0 10)} is VALID [2022-04-08 11:21:21,532 INFO L290 TraceCheckUtils]: 66: Hoare triple {8607#(< ~counter~0 10)} assume !(~r~0 >= 2 * ~b~0); {8607#(< ~counter~0 10)} is VALID [2022-04-08 11:21:21,533 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {8362#true} {8607#(< ~counter~0 10)} #87#return; {8607#(< ~counter~0 10)} is VALID [2022-04-08 11:21:21,533 INFO L290 TraceCheckUtils]: 64: Hoare triple {8362#true} assume true; {8362#true} is VALID [2022-04-08 11:21:21,533 INFO L290 TraceCheckUtils]: 63: Hoare triple {8362#true} assume !(0 == ~cond); {8362#true} is VALID [2022-04-08 11:21:21,533 INFO L290 TraceCheckUtils]: 62: Hoare triple {8362#true} ~cond := #in~cond; {8362#true} is VALID [2022-04-08 11:21:21,533 INFO L272 TraceCheckUtils]: 61: Hoare triple {8607#(< ~counter~0 10)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {8362#true} is VALID [2022-04-08 11:21:21,556 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {8362#true} {8607#(< ~counter~0 10)} #85#return; {8607#(< ~counter~0 10)} is VALID [2022-04-08 11:21:21,556 INFO L290 TraceCheckUtils]: 59: Hoare triple {8362#true} assume true; {8362#true} is VALID [2022-04-08 11:21:21,556 INFO L290 TraceCheckUtils]: 58: Hoare triple {8362#true} assume !(0 == ~cond); {8362#true} is VALID [2022-04-08 11:21:21,556 INFO L290 TraceCheckUtils]: 57: Hoare triple {8362#true} ~cond := #in~cond; {8362#true} is VALID [2022-04-08 11:21:21,556 INFO L272 TraceCheckUtils]: 56: Hoare triple {8607#(< ~counter~0 10)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {8362#true} is VALID [2022-04-08 11:21:21,557 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8362#true} {8607#(< ~counter~0 10)} #83#return; {8607#(< ~counter~0 10)} is VALID [2022-04-08 11:21:21,557 INFO L290 TraceCheckUtils]: 54: Hoare triple {8362#true} assume true; {8362#true} is VALID [2022-04-08 11:21:21,557 INFO L290 TraceCheckUtils]: 53: Hoare triple {8362#true} assume !(0 == ~cond); {8362#true} is VALID [2022-04-08 11:21:21,557 INFO L290 TraceCheckUtils]: 52: Hoare triple {8362#true} ~cond := #in~cond; {8362#true} is VALID [2022-04-08 11:21:21,558 INFO L272 TraceCheckUtils]: 51: Hoare triple {8607#(< ~counter~0 10)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {8362#true} is VALID [2022-04-08 11:21:21,558 INFO L290 TraceCheckUtils]: 50: Hoare triple {8607#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {8607#(< ~counter~0 10)} is VALID [2022-04-08 11:21:21,559 INFO L290 TraceCheckUtils]: 49: Hoare triple {8665#(< ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8607#(< ~counter~0 10)} is VALID [2022-04-08 11:21:21,559 INFO L290 TraceCheckUtils]: 48: Hoare triple {8665#(< ~counter~0 9)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {8665#(< ~counter~0 9)} is VALID [2022-04-08 11:21:21,560 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8362#true} {8665#(< ~counter~0 9)} #89#return; {8665#(< ~counter~0 9)} is VALID [2022-04-08 11:21:21,560 INFO L290 TraceCheckUtils]: 46: Hoare triple {8362#true} assume true; {8362#true} is VALID [2022-04-08 11:21:21,560 INFO L290 TraceCheckUtils]: 45: Hoare triple {8362#true} assume !(0 == ~cond); {8362#true} is VALID [2022-04-08 11:21:21,560 INFO L290 TraceCheckUtils]: 44: Hoare triple {8362#true} ~cond := #in~cond; {8362#true} is VALID [2022-04-08 11:21:21,560 INFO L272 TraceCheckUtils]: 43: Hoare triple {8665#(< ~counter~0 9)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {8362#true} is VALID [2022-04-08 11:21:21,561 INFO L290 TraceCheckUtils]: 42: Hoare triple {8665#(< ~counter~0 9)} assume !!(~r~0 >= 2 * ~b~0); {8665#(< ~counter~0 9)} is VALID [2022-04-08 11:21:21,561 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {8362#true} {8665#(< ~counter~0 9)} #87#return; {8665#(< ~counter~0 9)} is VALID [2022-04-08 11:21:21,561 INFO L290 TraceCheckUtils]: 40: Hoare triple {8362#true} assume true; {8362#true} is VALID [2022-04-08 11:21:21,561 INFO L290 TraceCheckUtils]: 39: Hoare triple {8362#true} assume !(0 == ~cond); {8362#true} is VALID [2022-04-08 11:21:21,562 INFO L290 TraceCheckUtils]: 38: Hoare triple {8362#true} ~cond := #in~cond; {8362#true} is VALID [2022-04-08 11:21:21,562 INFO L272 TraceCheckUtils]: 37: Hoare triple {8665#(< ~counter~0 9)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {8362#true} is VALID [2022-04-08 11:21:21,562 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8362#true} {8665#(< ~counter~0 9)} #85#return; {8665#(< ~counter~0 9)} is VALID [2022-04-08 11:21:21,562 INFO L290 TraceCheckUtils]: 35: Hoare triple {8362#true} assume true; {8362#true} is VALID [2022-04-08 11:21:21,563 INFO L290 TraceCheckUtils]: 34: Hoare triple {8362#true} assume !(0 == ~cond); {8362#true} is VALID [2022-04-08 11:21:21,563 INFO L290 TraceCheckUtils]: 33: Hoare triple {8362#true} ~cond := #in~cond; {8362#true} is VALID [2022-04-08 11:21:21,563 INFO L272 TraceCheckUtils]: 32: Hoare triple {8665#(< ~counter~0 9)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {8362#true} is VALID [2022-04-08 11:21:21,563 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {8362#true} {8665#(< ~counter~0 9)} #83#return; {8665#(< ~counter~0 9)} is VALID [2022-04-08 11:21:21,563 INFO L290 TraceCheckUtils]: 30: Hoare triple {8362#true} assume true; {8362#true} is VALID [2022-04-08 11:21:21,563 INFO L290 TraceCheckUtils]: 29: Hoare triple {8362#true} assume !(0 == ~cond); {8362#true} is VALID [2022-04-08 11:21:21,564 INFO L290 TraceCheckUtils]: 28: Hoare triple {8362#true} ~cond := #in~cond; {8362#true} is VALID [2022-04-08 11:21:21,564 INFO L272 TraceCheckUtils]: 27: Hoare triple {8665#(< ~counter~0 9)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {8362#true} is VALID [2022-04-08 11:21:21,564 INFO L290 TraceCheckUtils]: 26: Hoare triple {8665#(< ~counter~0 9)} assume !!(#t~post7 < 10);havoc #t~post7; {8665#(< ~counter~0 9)} is VALID [2022-04-08 11:21:21,565 INFO L290 TraceCheckUtils]: 25: Hoare triple {8738#(< ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8665#(< ~counter~0 9)} is VALID [2022-04-08 11:21:21,565 INFO L290 TraceCheckUtils]: 24: Hoare triple {8738#(< ~counter~0 8)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {8738#(< ~counter~0 8)} is VALID [2022-04-08 11:21:21,565 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8362#true} {8738#(< ~counter~0 8)} #81#return; {8738#(< ~counter~0 8)} is VALID [2022-04-08 11:21:21,565 INFO L290 TraceCheckUtils]: 22: Hoare triple {8362#true} assume true; {8362#true} is VALID [2022-04-08 11:21:21,566 INFO L290 TraceCheckUtils]: 21: Hoare triple {8362#true} assume !(0 == ~cond); {8362#true} is VALID [2022-04-08 11:21:21,566 INFO L290 TraceCheckUtils]: 20: Hoare triple {8362#true} ~cond := #in~cond; {8362#true} is VALID [2022-04-08 11:21:21,566 INFO L272 TraceCheckUtils]: 19: Hoare triple {8738#(< ~counter~0 8)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {8362#true} is VALID [2022-04-08 11:21:21,566 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8362#true} {8738#(< ~counter~0 8)} #79#return; {8738#(< ~counter~0 8)} is VALID [2022-04-08 11:21:21,566 INFO L290 TraceCheckUtils]: 17: Hoare triple {8362#true} assume true; {8362#true} is VALID [2022-04-08 11:21:21,566 INFO L290 TraceCheckUtils]: 16: Hoare triple {8362#true} assume !(0 == ~cond); {8362#true} is VALID [2022-04-08 11:21:21,566 INFO L290 TraceCheckUtils]: 15: Hoare triple {8362#true} ~cond := #in~cond; {8362#true} is VALID [2022-04-08 11:21:21,567 INFO L272 TraceCheckUtils]: 14: Hoare triple {8738#(< ~counter~0 8)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {8362#true} is VALID [2022-04-08 11:21:21,567 INFO L290 TraceCheckUtils]: 13: Hoare triple {8738#(< ~counter~0 8)} assume !!(#t~post6 < 10);havoc #t~post6; {8738#(< ~counter~0 8)} is VALID [2022-04-08 11:21:21,567 INFO L290 TraceCheckUtils]: 12: Hoare triple {8778#(< ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8738#(< ~counter~0 8)} is VALID [2022-04-08 11:21:21,568 INFO L290 TraceCheckUtils]: 11: Hoare triple {8778#(< ~counter~0 7)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {8778#(< ~counter~0 7)} is VALID [2022-04-08 11:21:21,568 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8362#true} {8778#(< ~counter~0 7)} #77#return; {8778#(< ~counter~0 7)} is VALID [2022-04-08 11:21:21,568 INFO L290 TraceCheckUtils]: 9: Hoare triple {8362#true} assume true; {8362#true} is VALID [2022-04-08 11:21:21,568 INFO L290 TraceCheckUtils]: 8: Hoare triple {8362#true} assume !(0 == ~cond); {8362#true} is VALID [2022-04-08 11:21:21,568 INFO L290 TraceCheckUtils]: 7: Hoare triple {8362#true} ~cond := #in~cond; {8362#true} is VALID [2022-04-08 11:21:21,568 INFO L272 TraceCheckUtils]: 6: Hoare triple {8778#(< ~counter~0 7)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8362#true} is VALID [2022-04-08 11:21:21,569 INFO L290 TraceCheckUtils]: 5: Hoare triple {8778#(< ~counter~0 7)} 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; {8778#(< ~counter~0 7)} is VALID [2022-04-08 11:21:21,569 INFO L272 TraceCheckUtils]: 4: Hoare triple {8778#(< ~counter~0 7)} call #t~ret8 := main(); {8778#(< ~counter~0 7)} is VALID [2022-04-08 11:21:21,570 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8778#(< ~counter~0 7)} {8362#true} #93#return; {8778#(< ~counter~0 7)} is VALID [2022-04-08 11:21:21,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {8778#(< ~counter~0 7)} assume true; {8778#(< ~counter~0 7)} is VALID [2022-04-08 11:21:21,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {8362#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; {8778#(< ~counter~0 7)} is VALID [2022-04-08 11:21:21,571 INFO L272 TraceCheckUtils]: 0: Hoare triple {8362#true} call ULTIMATE.init(); {8362#true} is VALID [2022-04-08 11:21:21,571 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-08 11:21:21,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:21:21,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028186493] [2022-04-08 11:21:21,572 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:21:21,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785098712] [2022-04-08 11:21:21,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785098712] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:21:21,572 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:21:21,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-08 11:21:21,572 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:21:21,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [42190079] [2022-04-08 11:21:21,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [42190079] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:21:21,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:21:21,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 11:21:21,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991765873] [2022-04-08 11:21:21,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:21:21,573 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-08 11:21:21,573 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:21:21,573 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-08 11:21:21,613 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-08 11:21:21,614 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 11:21:21,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:21:21,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 11:21:21,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-08 11:21:21,614 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-08 11:21:21,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:21:21,936 INFO L93 Difference]: Finished difference Result 141 states and 164 transitions. [2022-04-08 11:21:21,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 11:21:21,936 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-08 11:21:21,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:21:21,936 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-08 11:21:21,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2022-04-08 11:21:21,937 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-08 11:21:21,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2022-04-08 11:21:21,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 94 transitions. [2022-04-08 11:21:22,000 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-08 11:21:22,001 INFO L225 Difference]: With dead ends: 141 [2022-04-08 11:21:22,002 INFO L226 Difference]: Without dead ends: 134 [2022-04-08 11:21:22,002 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2022-04-08 11:21:22,002 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 14 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 11:21:22,003 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 161 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 11:21:22,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-04-08 11:21:22,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2022-04-08 11:21:22,154 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:21:22,154 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-08 11:21:22,154 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-08 11:21:22,155 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-08 11:21:22,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:21:22,157 INFO L93 Difference]: Finished difference Result 134 states and 157 transitions. [2022-04-08 11:21:22,157 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 157 transitions. [2022-04-08 11:21:22,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:21:22,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:21:22,158 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-08 11:21:22,158 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-08 11:21:22,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:21:22,160 INFO L93 Difference]: Finished difference Result 134 states and 157 transitions. [2022-04-08 11:21:22,160 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 157 transitions. [2022-04-08 11:21:22,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:21:22,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:21:22,160 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:21:22,161 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:21:22,161 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-08 11:21:22,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 155 transitions. [2022-04-08 11:21:22,163 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 155 transitions. Word has length 74 [2022-04-08 11:21:22,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:21:22,163 INFO L478 AbstractCegarLoop]: Abstraction has 132 states and 155 transitions. [2022-04-08 11:21:22,163 INFO L479 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-08 11:21:22,163 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 132 states and 155 transitions. [2022-04-08 11:21:22,309 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-08 11:21:22,310 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 155 transitions. [2022-04-08 11:21:22,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-08 11:21:22,310 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:21:22,310 INFO L499 BasicCegarLoop]: 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-08 11:21:22,330 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-08 11:21:22,511 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-08 11:21:22,511 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:21:22,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:21:22,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1777426592, now seen corresponding path program 1 times [2022-04-08 11:21:22,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:21:22,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1213028501] [2022-04-08 11:21:22,754 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:21:41,046 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:21:41,046 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:21:41,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1777426592, now seen corresponding path program 2 times [2022-04-08 11:21:41,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:21:41,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615046625] [2022-04-08 11:21:41,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:21:41,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:21:41,064 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:21:41,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1459226397] [2022-04-08 11:21:41,064 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:21:41,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:21:41,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:21:41,065 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-08 11:21:41,066 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-08 11:21:41,132 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:21:41,132 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:21:41,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-08 11:21:41,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:21:41,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:21:42,820 INFO L272 TraceCheckUtils]: 0: Hoare triple {9633#true} call ULTIMATE.init(); {9633#true} is VALID [2022-04-08 11:21:42,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {9633#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; {9633#true} is VALID [2022-04-08 11:21:42,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:21:42,821 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9633#true} {9633#true} #93#return; {9633#true} is VALID [2022-04-08 11:21:42,821 INFO L272 TraceCheckUtils]: 4: Hoare triple {9633#true} call #t~ret8 := main(); {9633#true} is VALID [2022-04-08 11:21:42,821 INFO L290 TraceCheckUtils]: 5: Hoare triple {9633#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; {9633#true} is VALID [2022-04-08 11:21:42,821 INFO L272 TraceCheckUtils]: 6: Hoare triple {9633#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {9633#true} is VALID [2022-04-08 11:21:42,821 INFO L290 TraceCheckUtils]: 7: Hoare triple {9633#true} ~cond := #in~cond; {9659#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 11:21:42,821 INFO L290 TraceCheckUtils]: 8: Hoare triple {9659#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {9663#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 11:21:42,822 INFO L290 TraceCheckUtils]: 9: Hoare triple {9663#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {9663#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 11:21:42,836 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9663#(not (= |assume_abort_if_not_#in~cond| 0))} {9633#true} #77#return; {9670#(<= 1 main_~y~0)} is VALID [2022-04-08 11:21:42,836 INFO L290 TraceCheckUtils]: 11: Hoare triple {9670#(<= 1 main_~y~0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {9674#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-08 11:21:42,837 INFO L290 TraceCheckUtils]: 12: Hoare triple {9674#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9674#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-08 11:21:42,837 INFO L290 TraceCheckUtils]: 13: Hoare triple {9674#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} assume !!(#t~post6 < 10);havoc #t~post6; {9674#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-08 11:21:42,837 INFO L272 TraceCheckUtils]: 14: Hoare triple {9674#(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)); {9633#true} is VALID [2022-04-08 11:21:42,837 INFO L290 TraceCheckUtils]: 15: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-08 11:21:42,837 INFO L290 TraceCheckUtils]: 16: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-08 11:21:42,837 INFO L290 TraceCheckUtils]: 17: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:21:42,838 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {9633#true} {9674#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} #79#return; {9674#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-08 11:21:42,838 INFO L272 TraceCheckUtils]: 19: Hoare triple {9674#(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)); {9633#true} is VALID [2022-04-08 11:21:42,838 INFO L290 TraceCheckUtils]: 20: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-08 11:21:42,838 INFO L290 TraceCheckUtils]: 21: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-08 11:21:42,838 INFO L290 TraceCheckUtils]: 22: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:21:42,839 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9633#true} {9674#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} #81#return; {9674#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-08 11:21:42,839 INFO L290 TraceCheckUtils]: 24: Hoare triple {9674#(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; {9714#(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-08 11:21:42,840 INFO L290 TraceCheckUtils]: 25: Hoare triple {9714#(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; {9714#(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-08 11:21:42,840 INFO L290 TraceCheckUtils]: 26: Hoare triple {9714#(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 < 10);havoc #t~post7; {9714#(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-08 11:21:42,840 INFO L272 TraceCheckUtils]: 27: Hoare triple {9714#(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)); {9633#true} is VALID [2022-04-08 11:21:42,840 INFO L290 TraceCheckUtils]: 28: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-08 11:21:42,840 INFO L290 TraceCheckUtils]: 29: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-08 11:21:42,841 INFO L290 TraceCheckUtils]: 30: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:21:42,841 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {9633#true} {9714#(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; {9714#(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-08 11:21:42,841 INFO L272 TraceCheckUtils]: 32: Hoare triple {9714#(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)); {9633#true} is VALID [2022-04-08 11:21:42,841 INFO L290 TraceCheckUtils]: 33: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-08 11:21:42,841 INFO L290 TraceCheckUtils]: 34: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-08 11:21:42,841 INFO L290 TraceCheckUtils]: 35: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:21:42,842 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {9633#true} {9714#(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; {9714#(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-08 11:21:42,842 INFO L272 TraceCheckUtils]: 37: Hoare triple {9714#(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)); {9633#true} is VALID [2022-04-08 11:21:42,842 INFO L290 TraceCheckUtils]: 38: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-08 11:21:42,842 INFO L290 TraceCheckUtils]: 39: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-08 11:21:42,842 INFO L290 TraceCheckUtils]: 40: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:21:42,843 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {9633#true} {9714#(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; {9714#(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-08 11:21:42,843 INFO L290 TraceCheckUtils]: 42: Hoare triple {9714#(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); {9714#(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-08 11:21:42,843 INFO L272 TraceCheckUtils]: 43: Hoare triple {9714#(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)); {9633#true} is VALID [2022-04-08 11:21:42,844 INFO L290 TraceCheckUtils]: 44: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-08 11:21:42,844 INFO L290 TraceCheckUtils]: 45: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-08 11:21:42,844 INFO L290 TraceCheckUtils]: 46: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:21:42,844 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {9633#true} {9714#(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; {9714#(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-08 11:21:42,845 INFO L290 TraceCheckUtils]: 48: Hoare triple {9714#(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; {9787#(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-08 11:21:42,846 INFO L290 TraceCheckUtils]: 49: Hoare triple {9787#(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; {9787#(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-08 11:21:42,846 INFO L290 TraceCheckUtils]: 50: Hoare triple {9787#(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 < 10);havoc #t~post7; {9787#(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-08 11:21:42,846 INFO L272 TraceCheckUtils]: 51: Hoare triple {9787#(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)); {9633#true} is VALID [2022-04-08 11:21:42,846 INFO L290 TraceCheckUtils]: 52: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-08 11:21:42,846 INFO L290 TraceCheckUtils]: 53: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-08 11:21:42,847 INFO L290 TraceCheckUtils]: 54: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:21:42,847 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {9633#true} {9787#(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; {9787#(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-08 11:21:42,847 INFO L272 TraceCheckUtils]: 56: Hoare triple {9787#(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)); {9633#true} is VALID [2022-04-08 11:21:42,847 INFO L290 TraceCheckUtils]: 57: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-08 11:21:42,847 INFO L290 TraceCheckUtils]: 58: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-08 11:21:42,847 INFO L290 TraceCheckUtils]: 59: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:21:42,848 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {9633#true} {9787#(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; {9787#(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-08 11:21:42,848 INFO L272 TraceCheckUtils]: 61: Hoare triple {9787#(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)); {9633#true} is VALID [2022-04-08 11:21:42,848 INFO L290 TraceCheckUtils]: 62: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-08 11:21:42,848 INFO L290 TraceCheckUtils]: 63: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-08 11:21:42,848 INFO L290 TraceCheckUtils]: 64: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:21:42,849 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {9633#true} {9787#(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; {9787#(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-08 11:21:42,849 INFO L290 TraceCheckUtils]: 66: Hoare triple {9787#(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); {9787#(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-08 11:21:42,850 INFO L290 TraceCheckUtils]: 67: Hoare triple {9787#(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; {9845#(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-08 11:21:42,850 INFO L290 TraceCheckUtils]: 68: Hoare triple {9845#(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; {9845#(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-08 11:21:42,851 INFO L290 TraceCheckUtils]: 69: Hoare triple {9845#(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 < 10);havoc #t~post6; {9845#(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-08 11:21:42,851 INFO L272 TraceCheckUtils]: 70: Hoare triple {9845#(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)); {9633#true} is VALID [2022-04-08 11:21:42,851 INFO L290 TraceCheckUtils]: 71: Hoare triple {9633#true} ~cond := #in~cond; {9858#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:21:42,851 INFO L290 TraceCheckUtils]: 72: Hoare triple {9858#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {9862#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:21:42,852 INFO L290 TraceCheckUtils]: 73: Hoare triple {9862#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9862#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:21:42,854 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {9862#(not (= |__VERIFIER_assert_#in~cond| 0))} {9845#(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; {9869#(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-08 11:21:42,855 INFO L272 TraceCheckUtils]: 75: Hoare triple {9869#(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)); {9873#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:21:42,855 INFO L290 TraceCheckUtils]: 76: Hoare triple {9873#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9877#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:21:42,856 INFO L290 TraceCheckUtils]: 77: Hoare triple {9877#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9634#false} is VALID [2022-04-08 11:21:42,856 INFO L290 TraceCheckUtils]: 78: Hoare triple {9634#false} assume !false; {9634#false} is VALID [2022-04-08 11:21:42,856 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-08 11:21:42,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:21:48,529 INFO L290 TraceCheckUtils]: 78: Hoare triple {9634#false} assume !false; {9634#false} is VALID [2022-04-08 11:21:48,529 INFO L290 TraceCheckUtils]: 77: Hoare triple {9877#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9634#false} is VALID [2022-04-08 11:21:48,530 INFO L290 TraceCheckUtils]: 76: Hoare triple {9873#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9877#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:21:48,530 INFO L272 TraceCheckUtils]: 75: Hoare triple {9893#(= (+ (* 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)); {9873#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:21:48,531 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {9862#(not (= |__VERIFIER_assert_#in~cond| 0))} {9897#(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; {9893#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:21:48,531 INFO L290 TraceCheckUtils]: 73: Hoare triple {9862#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9862#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:21:48,532 INFO L290 TraceCheckUtils]: 72: Hoare triple {9907#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {9862#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:21:48,532 INFO L290 TraceCheckUtils]: 71: Hoare triple {9633#true} ~cond := #in~cond; {9907#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 11:21:48,532 INFO L272 TraceCheckUtils]: 70: Hoare triple {9897#(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)); {9633#true} is VALID [2022-04-08 11:21:48,532 INFO L290 TraceCheckUtils]: 69: Hoare triple {9897#(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 < 10);havoc #t~post6; {9897#(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-08 11:21:48,533 INFO L290 TraceCheckUtils]: 68: Hoare triple {9897#(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; {9897#(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-08 11:21:48,540 INFO L290 TraceCheckUtils]: 67: Hoare triple {9897#(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; {9897#(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-08 11:21:48,541 INFO L290 TraceCheckUtils]: 66: Hoare triple {9897#(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); {9897#(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-08 11:21:48,542 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {9633#true} {9897#(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; {9897#(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-08 11:21:48,542 INFO L290 TraceCheckUtils]: 64: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:21:48,542 INFO L290 TraceCheckUtils]: 63: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-08 11:21:48,542 INFO L290 TraceCheckUtils]: 62: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-08 11:21:48,542 INFO L272 TraceCheckUtils]: 61: Hoare triple {9897#(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)); {9633#true} is VALID [2022-04-08 11:21:48,543 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {9633#true} {9897#(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; {9897#(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-08 11:21:48,543 INFO L290 TraceCheckUtils]: 59: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:21:48,543 INFO L290 TraceCheckUtils]: 58: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-08 11:21:48,543 INFO L290 TraceCheckUtils]: 57: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-08 11:21:48,543 INFO L272 TraceCheckUtils]: 56: Hoare triple {9897#(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)); {9633#true} is VALID [2022-04-08 11:21:48,544 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {9633#true} {9897#(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; {9897#(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-08 11:21:48,544 INFO L290 TraceCheckUtils]: 54: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:21:48,544 INFO L290 TraceCheckUtils]: 53: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-08 11:21:48,544 INFO L290 TraceCheckUtils]: 52: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-08 11:21:48,544 INFO L272 TraceCheckUtils]: 51: Hoare triple {9897#(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)); {9633#true} is VALID [2022-04-08 11:21:48,545 INFO L290 TraceCheckUtils]: 50: Hoare triple {9897#(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 < 10);havoc #t~post7; {9897#(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-08 11:21:48,545 INFO L290 TraceCheckUtils]: 49: Hoare triple {9897#(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; {9897#(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-08 11:21:48,546 INFO L290 TraceCheckUtils]: 48: Hoare triple {9977#(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; {9897#(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-08 11:21:48,547 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {9633#true} {9977#(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; {9977#(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-08 11:21:48,547 INFO L290 TraceCheckUtils]: 46: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:21:48,547 INFO L290 TraceCheckUtils]: 45: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-08 11:21:48,547 INFO L290 TraceCheckUtils]: 44: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-08 11:21:48,547 INFO L272 TraceCheckUtils]: 43: Hoare triple {9977#(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)); {9633#true} is VALID [2022-04-08 11:21:48,548 INFO L290 TraceCheckUtils]: 42: Hoare triple {9977#(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); {9977#(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-08 11:21:48,548 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {9633#true} {9977#(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; {9977#(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-08 11:21:48,549 INFO L290 TraceCheckUtils]: 40: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:21:48,549 INFO L290 TraceCheckUtils]: 39: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-08 11:21:48,549 INFO L290 TraceCheckUtils]: 38: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-08 11:21:48,549 INFO L272 TraceCheckUtils]: 37: Hoare triple {9977#(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)); {9633#true} is VALID [2022-04-08 11:21:48,549 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {9633#true} {9977#(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; {9977#(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-08 11:21:48,550 INFO L290 TraceCheckUtils]: 35: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:21:48,550 INFO L290 TraceCheckUtils]: 34: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-08 11:21:48,550 INFO L290 TraceCheckUtils]: 33: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-08 11:21:48,550 INFO L272 TraceCheckUtils]: 32: Hoare triple {9977#(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)); {9633#true} is VALID [2022-04-08 11:21:48,550 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {9633#true} {9977#(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; {9977#(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-08 11:21:48,551 INFO L290 TraceCheckUtils]: 30: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:21:48,551 INFO L290 TraceCheckUtils]: 29: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-08 11:21:48,551 INFO L290 TraceCheckUtils]: 28: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-08 11:21:48,551 INFO L272 TraceCheckUtils]: 27: Hoare triple {9977#(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)); {9633#true} is VALID [2022-04-08 11:21:48,551 INFO L290 TraceCheckUtils]: 26: Hoare triple {9977#(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 < 10);havoc #t~post7; {9977#(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-08 11:21:48,552 INFO L290 TraceCheckUtils]: 25: Hoare triple {9977#(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; {9977#(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-08 11:21:48,552 INFO L290 TraceCheckUtils]: 24: Hoare triple {9893#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {9977#(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-08 11:21:48,553 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9633#true} {9893#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #81#return; {9893#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:21:48,553 INFO L290 TraceCheckUtils]: 22: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:21:48,553 INFO L290 TraceCheckUtils]: 21: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-08 11:21:48,553 INFO L290 TraceCheckUtils]: 20: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-08 11:21:48,553 INFO L272 TraceCheckUtils]: 19: Hoare triple {9893#(= (+ (* 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)); {9633#true} is VALID [2022-04-08 11:21:48,554 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {9633#true} {9893#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #79#return; {9893#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:21:48,554 INFO L290 TraceCheckUtils]: 17: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:21:48,554 INFO L290 TraceCheckUtils]: 16: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-08 11:21:48,554 INFO L290 TraceCheckUtils]: 15: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-08 11:21:48,554 INFO L272 TraceCheckUtils]: 14: Hoare triple {9893#(= (+ (* 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)); {9633#true} is VALID [2022-04-08 11:21:48,554 INFO L290 TraceCheckUtils]: 13: Hoare triple {9893#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(#t~post6 < 10);havoc #t~post6; {9893#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:21:48,554 INFO L290 TraceCheckUtils]: 12: Hoare triple {9893#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9893#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:21:48,555 INFO L290 TraceCheckUtils]: 11: Hoare triple {9633#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {9893#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:21:48,555 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9633#true} {9633#true} #77#return; {9633#true} is VALID [2022-04-08 11:21:48,555 INFO L290 TraceCheckUtils]: 9: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:21:48,555 INFO L290 TraceCheckUtils]: 8: Hoare triple {9633#true} assume !(0 == ~cond); {9633#true} is VALID [2022-04-08 11:21:48,555 INFO L290 TraceCheckUtils]: 7: Hoare triple {9633#true} ~cond := #in~cond; {9633#true} is VALID [2022-04-08 11:21:48,555 INFO L272 TraceCheckUtils]: 6: Hoare triple {9633#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {9633#true} is VALID [2022-04-08 11:21:48,555 INFO L290 TraceCheckUtils]: 5: Hoare triple {9633#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; {9633#true} is VALID [2022-04-08 11:21:48,556 INFO L272 TraceCheckUtils]: 4: Hoare triple {9633#true} call #t~ret8 := main(); {9633#true} is VALID [2022-04-08 11:21:48,556 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9633#true} {9633#true} #93#return; {9633#true} is VALID [2022-04-08 11:21:48,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {9633#true} assume true; {9633#true} is VALID [2022-04-08 11:21:48,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {9633#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; {9633#true} is VALID [2022-04-08 11:21:48,556 INFO L272 TraceCheckUtils]: 0: Hoare triple {9633#true} call ULTIMATE.init(); {9633#true} is VALID [2022-04-08 11:21:48,556 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-08 11:21:48,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:21:48,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615046625] [2022-04-08 11:21:48,557 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:21:48,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459226397] [2022-04-08 11:21:48,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459226397] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:21:48,557 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:21:48,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 18 [2022-04-08 11:21:48,557 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:21:48,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1213028501] [2022-04-08 11:21:48,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1213028501] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:21:48,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:21:48,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 11:21:48,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840902265] [2022-04-08 11:21:48,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:21:48,558 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-08 11:21:48,558 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:21:48,558 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-08 11:21:48,607 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-08 11:21:48,607 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 11:21:48,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:21:48,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 11:21:48,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2022-04-08 11:21:48,608 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-08 11:21:53,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:21:53,034 INFO L93 Difference]: Finished difference Result 161 states and 197 transitions. [2022-04-08 11:21:53,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 11:21:53,034 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-08 11:21:53,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:21:53,035 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-08 11:21:53,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 119 transitions. [2022-04-08 11:21:53,037 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-08 11:21:53,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 119 transitions. [2022-04-08 11:21:53,039 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 119 transitions. [2022-04-08 11:21:53,161 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-08 11:21:53,163 INFO L225 Difference]: With dead ends: 161 [2022-04-08 11:21:53,164 INFO L226 Difference]: Without dead ends: 158 [2022-04-08 11:21:53,164 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 138 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2022-04-08 11:21:53,164 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 51 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-08 11:21:53,164 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 259 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-08 11:21:53,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-04-08 11:21:53,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 153. [2022-04-08 11:21:53,335 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:21:53,335 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-08 11:21:53,335 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-08 11:21:53,336 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-08 11:21:53,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:21:53,338 INFO L93 Difference]: Finished difference Result 158 states and 193 transitions. [2022-04-08 11:21:53,338 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 193 transitions. [2022-04-08 11:21:53,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:21:53,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:21:53,339 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-08 11:21:53,340 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-08 11:21:53,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:21:53,342 INFO L93 Difference]: Finished difference Result 158 states and 193 transitions. [2022-04-08 11:21:53,342 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 193 transitions. [2022-04-08 11:21:53,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:21:53,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:21:53,343 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:21:53,343 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:21:53,343 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-08 11:21:53,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 188 transitions. [2022-04-08 11:21:53,347 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 188 transitions. Word has length 79 [2022-04-08 11:21:53,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:21:53,348 INFO L478 AbstractCegarLoop]: Abstraction has 153 states and 188 transitions. [2022-04-08 11:21:53,349 INFO L479 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-08 11:21:53,349 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 153 states and 188 transitions. [2022-04-08 11:21:53,578 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-08 11:21:53,578 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 188 transitions. [2022-04-08 11:21:53,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-08 11:21:53,579 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:21:53,579 INFO L499 BasicCegarLoop]: 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-08 11:21:53,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-08 11:21:53,779 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-08 11:21:53,780 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:21:53,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:21:53,780 INFO L85 PathProgramCache]: Analyzing trace with hash -554329876, now seen corresponding path program 3 times [2022-04-08 11:21:53,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:21:53,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1475266631] [2022-04-08 11:22:11,122 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:22:11,122 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:22:11,122 INFO L85 PathProgramCache]: Analyzing trace with hash -554329876, now seen corresponding path program 4 times [2022-04-08 11:22:11,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:22:11,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442142879] [2022-04-08 11:22:11,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:22:11,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:22:11,133 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:22:11,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1300472275] [2022-04-08 11:22:11,133 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 11:22:11,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:22:11,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:22:11,139 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-08 11:22:11,140 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-08 11:22:11,188 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 11:22:11,189 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:22:11,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-08 11:22:11,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:22:11,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:22:11,778 INFO L272 TraceCheckUtils]: 0: Hoare triple {11076#true} call ULTIMATE.init(); {11076#true} is VALID [2022-04-08 11:22:11,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {11076#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; {11076#true} is VALID [2022-04-08 11:22:11,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:22:11,778 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11076#true} {11076#true} #93#return; {11076#true} is VALID [2022-04-08 11:22:11,778 INFO L272 TraceCheckUtils]: 4: Hoare triple {11076#true} call #t~ret8 := main(); {11076#true} is VALID [2022-04-08 11:22:11,778 INFO L290 TraceCheckUtils]: 5: Hoare triple {11076#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; {11076#true} is VALID [2022-04-08 11:22:11,779 INFO L272 TraceCheckUtils]: 6: Hoare triple {11076#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11076#true} is VALID [2022-04-08 11:22:11,779 INFO L290 TraceCheckUtils]: 7: Hoare triple {11076#true} ~cond := #in~cond; {11102#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 11:22:11,779 INFO L290 TraceCheckUtils]: 8: Hoare triple {11102#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {11106#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 11:22:11,779 INFO L290 TraceCheckUtils]: 9: Hoare triple {11106#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {11106#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 11:22:11,780 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11106#(not (= |assume_abort_if_not_#in~cond| 0))} {11076#true} #77#return; {11113#(<= 1 main_~y~0)} is VALID [2022-04-08 11:22:11,780 INFO L290 TraceCheckUtils]: 11: Hoare triple {11113#(<= 1 main_~y~0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {11117#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-08 11:22:11,781 INFO L290 TraceCheckUtils]: 12: Hoare triple {11117#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11117#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-08 11:22:11,781 INFO L290 TraceCheckUtils]: 13: Hoare triple {11117#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} assume !!(#t~post6 < 10);havoc #t~post6; {11117#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-08 11:22:11,781 INFO L272 TraceCheckUtils]: 14: Hoare triple {11117#(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)); {11076#true} is VALID [2022-04-08 11:22:11,781 INFO L290 TraceCheckUtils]: 15: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:22:11,781 INFO L290 TraceCheckUtils]: 16: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:22:11,781 INFO L290 TraceCheckUtils]: 17: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:22:11,782 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {11076#true} {11117#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} #79#return; {11117#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-08 11:22:11,782 INFO L272 TraceCheckUtils]: 19: Hoare triple {11117#(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)); {11076#true} is VALID [2022-04-08 11:22:11,782 INFO L290 TraceCheckUtils]: 20: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:22:11,782 INFO L290 TraceCheckUtils]: 21: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:22:11,782 INFO L290 TraceCheckUtils]: 22: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:22:11,783 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11076#true} {11117#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} #81#return; {11117#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-08 11:22:11,783 INFO L290 TraceCheckUtils]: 24: Hoare triple {11117#(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; {11157#(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-08 11:22:11,784 INFO L290 TraceCheckUtils]: 25: Hoare triple {11157#(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; {11157#(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-08 11:22:11,784 INFO L290 TraceCheckUtils]: 26: Hoare triple {11157#(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 < 10);havoc #t~post7; {11157#(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-08 11:22:11,784 INFO L272 TraceCheckUtils]: 27: Hoare triple {11157#(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)); {11076#true} is VALID [2022-04-08 11:22:11,784 INFO L290 TraceCheckUtils]: 28: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:22:11,784 INFO L290 TraceCheckUtils]: 29: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:22:11,784 INFO L290 TraceCheckUtils]: 30: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:22:11,785 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {11076#true} {11157#(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; {11157#(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-08 11:22:11,785 INFO L272 TraceCheckUtils]: 32: Hoare triple {11157#(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)); {11076#true} is VALID [2022-04-08 11:22:11,785 INFO L290 TraceCheckUtils]: 33: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:22:11,785 INFO L290 TraceCheckUtils]: 34: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:22:11,785 INFO L290 TraceCheckUtils]: 35: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:22:11,786 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {11076#true} {11157#(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; {11157#(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-08 11:22:11,786 INFO L272 TraceCheckUtils]: 37: Hoare triple {11157#(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)); {11076#true} is VALID [2022-04-08 11:22:11,786 INFO L290 TraceCheckUtils]: 38: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:22:11,786 INFO L290 TraceCheckUtils]: 39: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:22:11,786 INFO L290 TraceCheckUtils]: 40: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:22:11,787 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {11076#true} {11157#(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; {11157#(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-08 11:22:11,787 INFO L290 TraceCheckUtils]: 42: Hoare triple {11157#(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); {11157#(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-08 11:22:11,787 INFO L272 TraceCheckUtils]: 43: Hoare triple {11157#(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)); {11076#true} is VALID [2022-04-08 11:22:11,787 INFO L290 TraceCheckUtils]: 44: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:22:11,787 INFO L290 TraceCheckUtils]: 45: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:22:11,788 INFO L290 TraceCheckUtils]: 46: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:22:11,788 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {11076#true} {11157#(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; {11157#(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-08 11:22:11,788 INFO L290 TraceCheckUtils]: 48: Hoare triple {11157#(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; {11230#(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-08 11:22:11,789 INFO L290 TraceCheckUtils]: 49: Hoare triple {11230#(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; {11230#(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-08 11:22:11,789 INFO L290 TraceCheckUtils]: 50: Hoare triple {11230#(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 < 10);havoc #t~post7; {11230#(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-08 11:22:11,789 INFO L272 TraceCheckUtils]: 51: Hoare triple {11230#(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)); {11076#true} is VALID [2022-04-08 11:22:11,790 INFO L290 TraceCheckUtils]: 52: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:22:11,790 INFO L290 TraceCheckUtils]: 53: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:22:11,790 INFO L290 TraceCheckUtils]: 54: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:22:11,790 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {11076#true} {11230#(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; {11230#(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-08 11:22:11,790 INFO L272 TraceCheckUtils]: 56: Hoare triple {11230#(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)); {11076#true} is VALID [2022-04-08 11:22:11,790 INFO L290 TraceCheckUtils]: 57: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:22:11,791 INFO L290 TraceCheckUtils]: 58: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:22:11,791 INFO L290 TraceCheckUtils]: 59: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:22:11,791 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {11076#true} {11230#(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; {11230#(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-08 11:22:11,791 INFO L272 TraceCheckUtils]: 61: Hoare triple {11230#(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)); {11076#true} is VALID [2022-04-08 11:22:11,791 INFO L290 TraceCheckUtils]: 62: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:22:11,791 INFO L290 TraceCheckUtils]: 63: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:22:11,792 INFO L290 TraceCheckUtils]: 64: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:22:11,792 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {11076#true} {11230#(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; {11230#(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-08 11:22:11,792 INFO L290 TraceCheckUtils]: 66: Hoare triple {11230#(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); {11230#(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-08 11:22:11,793 INFO L272 TraceCheckUtils]: 67: Hoare triple {11230#(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)); {11076#true} is VALID [2022-04-08 11:22:11,793 INFO L290 TraceCheckUtils]: 68: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:22:11,793 INFO L290 TraceCheckUtils]: 69: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:22:11,793 INFO L290 TraceCheckUtils]: 70: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:22:11,793 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {11076#true} {11230#(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; {11230#(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-08 11:22:11,794 INFO L290 TraceCheckUtils]: 72: Hoare triple {11230#(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; {11303#(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-08 11:22:11,795 INFO L290 TraceCheckUtils]: 73: Hoare triple {11303#(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; {11303#(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-08 11:22:11,795 INFO L290 TraceCheckUtils]: 74: Hoare triple {11303#(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 < 10);havoc #t~post7; {11303#(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-08 11:22:11,796 INFO L290 TraceCheckUtils]: 75: Hoare triple {11303#(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; {11313#(and (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= main_~q~0 4) (<= 1 main_~y~0))} is VALID [2022-04-08 11:22:11,796 INFO L290 TraceCheckUtils]: 76: Hoare triple {11313#(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; {11313#(and (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= main_~q~0 4) (<= 1 main_~y~0))} is VALID [2022-04-08 11:22:11,796 INFO L290 TraceCheckUtils]: 77: Hoare triple {11313#(and (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= main_~q~0 4) (<= 1 main_~y~0))} assume !(#t~post6 < 10);havoc #t~post6; {11313#(and (= main_~x~0 (+ main_~r~0 (* main_~y~0 4))) (= main_~q~0 4) (<= 1 main_~y~0))} is VALID [2022-04-08 11:22:11,800 INFO L272 TraceCheckUtils]: 78: Hoare triple {11313#(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)); {11323#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:22:11,800 INFO L290 TraceCheckUtils]: 79: Hoare triple {11323#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11327#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:22:11,801 INFO L290 TraceCheckUtils]: 80: Hoare triple {11327#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11077#false} is VALID [2022-04-08 11:22:11,801 INFO L290 TraceCheckUtils]: 81: Hoare triple {11077#false} assume !false; {11077#false} is VALID [2022-04-08 11:22:11,801 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-08 11:22:11,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:22:12,168 INFO L290 TraceCheckUtils]: 81: Hoare triple {11077#false} assume !false; {11077#false} is VALID [2022-04-08 11:22:12,168 INFO L290 TraceCheckUtils]: 80: Hoare triple {11327#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11077#false} is VALID [2022-04-08 11:22:12,169 INFO L290 TraceCheckUtils]: 79: Hoare triple {11323#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11327#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:22:12,169 INFO L272 TraceCheckUtils]: 78: Hoare triple {11343#(= (+ (* 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)); {11323#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:22:12,170 INFO L290 TraceCheckUtils]: 77: Hoare triple {11343#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !(#t~post6 < 10);havoc #t~post6; {11343#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:22:12,170 INFO L290 TraceCheckUtils]: 76: Hoare triple {11343#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11343#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:22:12,177 INFO L290 TraceCheckUtils]: 75: Hoare triple {11353#(= 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; {11343#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:22:12,178 INFO L290 TraceCheckUtils]: 74: Hoare triple {11353#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} assume !(#t~post7 < 10);havoc #t~post7; {11353#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-08 11:22:12,178 INFO L290 TraceCheckUtils]: 73: Hoare triple {11353#(= 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; {11353#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-08 11:22:12,181 INFO L290 TraceCheckUtils]: 72: Hoare triple {11363#(= (+ (* (- 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; {11353#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-08 11:22:12,181 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {11076#true} {11363#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} #89#return; {11363#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:22:12,181 INFO L290 TraceCheckUtils]: 70: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:22:12,181 INFO L290 TraceCheckUtils]: 69: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:22:12,182 INFO L290 TraceCheckUtils]: 68: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:22:12,182 INFO L272 TraceCheckUtils]: 67: Hoare triple {11363#(= (+ (* (- 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)); {11076#true} is VALID [2022-04-08 11:22:12,182 INFO L290 TraceCheckUtils]: 66: Hoare triple {11363#(= (+ (* (- 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); {11363#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:22:12,183 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {11076#true} {11363#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} #87#return; {11363#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:22:12,183 INFO L290 TraceCheckUtils]: 64: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:22:12,183 INFO L290 TraceCheckUtils]: 63: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:22:12,183 INFO L290 TraceCheckUtils]: 62: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:22:12,183 INFO L272 TraceCheckUtils]: 61: Hoare triple {11363#(= (+ (* (- 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)); {11076#true} is VALID [2022-04-08 11:22:12,183 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {11076#true} {11363#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} #85#return; {11363#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:22:12,184 INFO L290 TraceCheckUtils]: 59: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:22:12,184 INFO L290 TraceCheckUtils]: 58: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:22:12,184 INFO L290 TraceCheckUtils]: 57: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:22:12,184 INFO L272 TraceCheckUtils]: 56: Hoare triple {11363#(= (+ (* (- 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)); {11076#true} is VALID [2022-04-08 11:22:12,184 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {11076#true} {11363#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} #83#return; {11363#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:22:12,184 INFO L290 TraceCheckUtils]: 54: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:22:12,185 INFO L290 TraceCheckUtils]: 53: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:22:12,185 INFO L290 TraceCheckUtils]: 52: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:22:12,185 INFO L272 TraceCheckUtils]: 51: Hoare triple {11363#(= (+ (* (- 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)); {11076#true} is VALID [2022-04-08 11:22:12,190 INFO L290 TraceCheckUtils]: 50: Hoare triple {11363#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} assume !!(#t~post7 < 10);havoc #t~post7; {11363#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:22:12,190 INFO L290 TraceCheckUtils]: 49: Hoare triple {11363#(= (+ (* (- 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; {11363#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:22:12,193 INFO L290 TraceCheckUtils]: 48: Hoare triple {11436#(= (+ (* 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; {11363#(= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:22:12,194 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {11076#true} {11436#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} #89#return; {11436#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} is VALID [2022-04-08 11:22:12,194 INFO L290 TraceCheckUtils]: 46: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:22:12,194 INFO L290 TraceCheckUtils]: 45: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:22:12,194 INFO L290 TraceCheckUtils]: 44: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:22:12,194 INFO L272 TraceCheckUtils]: 43: Hoare triple {11436#(= (+ (* 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)); {11076#true} is VALID [2022-04-08 11:22:12,194 INFO L290 TraceCheckUtils]: 42: Hoare triple {11436#(= (+ (* 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); {11436#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} is VALID [2022-04-08 11:22:12,201 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {11076#true} {11436#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} #87#return; {11436#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} is VALID [2022-04-08 11:22:12,202 INFO L290 TraceCheckUtils]: 40: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:22:12,202 INFO L290 TraceCheckUtils]: 39: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:22:12,202 INFO L290 TraceCheckUtils]: 38: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:22:12,202 INFO L272 TraceCheckUtils]: 37: Hoare triple {11436#(= (+ (* 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)); {11076#true} is VALID [2022-04-08 11:22:12,202 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {11076#true} {11436#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} #85#return; {11436#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} is VALID [2022-04-08 11:22:12,202 INFO L290 TraceCheckUtils]: 35: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:22:12,203 INFO L290 TraceCheckUtils]: 34: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:22:12,203 INFO L290 TraceCheckUtils]: 33: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:22:12,203 INFO L272 TraceCheckUtils]: 32: Hoare triple {11436#(= (+ (* 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)); {11076#true} is VALID [2022-04-08 11:22:12,203 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {11076#true} {11436#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} #83#return; {11436#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} is VALID [2022-04-08 11:22:12,203 INFO L290 TraceCheckUtils]: 30: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:22:12,203 INFO L290 TraceCheckUtils]: 29: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:22:12,204 INFO L290 TraceCheckUtils]: 28: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:22:12,204 INFO L272 TraceCheckUtils]: 27: Hoare triple {11436#(= (+ (* 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)); {11076#true} is VALID [2022-04-08 11:22:12,204 INFO L290 TraceCheckUtils]: 26: Hoare triple {11436#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} assume !!(#t~post7 < 10);havoc #t~post7; {11436#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} is VALID [2022-04-08 11:22:12,204 INFO L290 TraceCheckUtils]: 25: Hoare triple {11436#(= (+ (* 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; {11436#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} is VALID [2022-04-08 11:22:12,205 INFO L290 TraceCheckUtils]: 24: Hoare triple {11343#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {11436#(= (+ (* main_~b~0 (- 4)) main_~r~0 (* main_~y~0 (+ (* main_~a~0 4) main_~q~0))) main_~x~0)} is VALID [2022-04-08 11:22:12,205 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11076#true} {11343#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #81#return; {11343#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:22:12,205 INFO L290 TraceCheckUtils]: 22: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:22:12,206 INFO L290 TraceCheckUtils]: 21: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:22:12,206 INFO L290 TraceCheckUtils]: 20: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:22:12,206 INFO L272 TraceCheckUtils]: 19: Hoare triple {11343#(= (+ (* 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)); {11076#true} is VALID [2022-04-08 11:22:12,206 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {11076#true} {11343#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #79#return; {11343#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:22:12,206 INFO L290 TraceCheckUtils]: 17: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:22:12,206 INFO L290 TraceCheckUtils]: 16: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:22:12,207 INFO L290 TraceCheckUtils]: 15: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:22:12,207 INFO L272 TraceCheckUtils]: 14: Hoare triple {11343#(= (+ (* 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)); {11076#true} is VALID [2022-04-08 11:22:12,207 INFO L290 TraceCheckUtils]: 13: Hoare triple {11343#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(#t~post6 < 10);havoc #t~post6; {11343#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:22:12,207 INFO L290 TraceCheckUtils]: 12: Hoare triple {11343#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11343#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:22:12,208 INFO L290 TraceCheckUtils]: 11: Hoare triple {11076#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {11343#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:22:12,208 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11076#true} {11076#true} #77#return; {11076#true} is VALID [2022-04-08 11:22:12,208 INFO L290 TraceCheckUtils]: 9: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:22:12,208 INFO L290 TraceCheckUtils]: 8: Hoare triple {11076#true} assume !(0 == ~cond); {11076#true} is VALID [2022-04-08 11:22:12,208 INFO L290 TraceCheckUtils]: 7: Hoare triple {11076#true} ~cond := #in~cond; {11076#true} is VALID [2022-04-08 11:22:12,208 INFO L272 TraceCheckUtils]: 6: Hoare triple {11076#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11076#true} is VALID [2022-04-08 11:22:12,208 INFO L290 TraceCheckUtils]: 5: Hoare triple {11076#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; {11076#true} is VALID [2022-04-08 11:22:12,208 INFO L272 TraceCheckUtils]: 4: Hoare triple {11076#true} call #t~ret8 := main(); {11076#true} is VALID [2022-04-08 11:22:12,208 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11076#true} {11076#true} #93#return; {11076#true} is VALID [2022-04-08 11:22:12,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {11076#true} assume true; {11076#true} is VALID [2022-04-08 11:22:12,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {11076#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; {11076#true} is VALID [2022-04-08 11:22:12,209 INFO L272 TraceCheckUtils]: 0: Hoare triple {11076#true} call ULTIMATE.init(); {11076#true} is VALID [2022-04-08 11:22:12,209 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-08 11:22:12,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:22:12,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442142879] [2022-04-08 11:22:12,209 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:22:12,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300472275] [2022-04-08 11:22:12,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300472275] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:22:12,210 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:22:12,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 16 [2022-04-08 11:22:12,210 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:22:12,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1475266631] [2022-04-08 11:22:12,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1475266631] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:22:12,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:22:12,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 11:22:12,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912886233] [2022-04-08 11:22:12,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:22:12,211 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-08 11:22:12,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:22:12,211 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-08 11:22:12,253 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-08 11:22:12,253 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 11:22:12,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:22:12,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 11:22:12,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-04-08 11:22:12,254 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-08 11:22:13,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:22:13,475 INFO L93 Difference]: Finished difference Result 201 states and 254 transitions. [2022-04-08 11:22:13,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 11:22:13,475 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-08 11:22:13,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:22:13,475 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-08 11:22:13,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 135 transitions. [2022-04-08 11:22:13,477 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-08 11:22:13,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 135 transitions. [2022-04-08 11:22:13,478 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 135 transitions. [2022-04-08 11:22:13,594 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-08 11:22:13,598 INFO L225 Difference]: With dead ends: 201 [2022-04-08 11:22:13,598 INFO L226 Difference]: Without dead ends: 198 [2022-04-08 11:22:13,598 INFO L912 BasicCegarLoop]: 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-08 11:22:13,599 INFO L913 BasicCegarLoop]: 73 mSDtfsCounter, 68 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 11:22:13,599 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 339 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 11:22:13,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-04-08 11:22:13,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 168. [2022-04-08 11:22:13,813 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:22:13,819 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-08 11:22:13,820 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-08 11:22:13,820 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-08 11:22:13,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:22:13,823 INFO L93 Difference]: Finished difference Result 198 states and 249 transitions. [2022-04-08 11:22:13,824 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 249 transitions. [2022-04-08 11:22:13,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:22:13,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:22:13,826 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-08 11:22:13,826 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-08 11:22:13,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:22:13,830 INFO L93 Difference]: Finished difference Result 198 states and 249 transitions. [2022-04-08 11:22:13,830 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 249 transitions. [2022-04-08 11:22:13,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:22:13,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:22:13,831 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:22:13,831 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:22:13,832 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-08 11:22:13,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 206 transitions. [2022-04-08 11:22:13,834 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 206 transitions. Word has length 82 [2022-04-08 11:22:13,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:22:13,835 INFO L478 AbstractCegarLoop]: Abstraction has 168 states and 206 transitions. [2022-04-08 11:22:13,835 INFO L479 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-08 11:22:13,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 168 states and 206 transitions. [2022-04-08 11:22:14,083 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-08 11:22:14,083 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 206 transitions. [2022-04-08 11:22:14,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-04-08 11:22:14,084 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:22:14,084 INFO L499 BasicCegarLoop]: 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-08 11:22:14,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-04-08 11:22:14,284 WARN L460 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-08 11:22:14,284 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:22:14,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:22:14,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1891783602, now seen corresponding path program 1 times [2022-04-08 11:22:14,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:22:14,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [578145264] [2022-04-08 11:22:42,940 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:22:42,940 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:22:42,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1891783602, now seen corresponding path program 2 times [2022-04-08 11:22:42,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:22:42,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527407080] [2022-04-08 11:22:42,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:22:42,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:22:42,951 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:22:42,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [236720438] [2022-04-08 11:22:42,951 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:22:42,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:22:42,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:22:42,952 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-08 11:22:42,953 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-08 11:22:43,003 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:22:43,003 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:22:43,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 11:22:43,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:22:43,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:22:43,347 INFO L272 TraceCheckUtils]: 0: Hoare triple {12721#true} call ULTIMATE.init(); {12721#true} is VALID [2022-04-08 11:22:43,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {12721#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; {12729#(<= ~counter~0 0)} is VALID [2022-04-08 11:22:43,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {12729#(<= ~counter~0 0)} assume true; {12729#(<= ~counter~0 0)} is VALID [2022-04-08 11:22:43,348 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12729#(<= ~counter~0 0)} {12721#true} #93#return; {12729#(<= ~counter~0 0)} is VALID [2022-04-08 11:22:43,348 INFO L272 TraceCheckUtils]: 4: Hoare triple {12729#(<= ~counter~0 0)} call #t~ret8 := main(); {12729#(<= ~counter~0 0)} is VALID [2022-04-08 11:22:43,349 INFO L290 TraceCheckUtils]: 5: Hoare triple {12729#(<= ~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; {12729#(<= ~counter~0 0)} is VALID [2022-04-08 11:22:43,349 INFO L272 TraceCheckUtils]: 6: Hoare triple {12729#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {12729#(<= ~counter~0 0)} is VALID [2022-04-08 11:22:43,349 INFO L290 TraceCheckUtils]: 7: Hoare triple {12729#(<= ~counter~0 0)} ~cond := #in~cond; {12729#(<= ~counter~0 0)} is VALID [2022-04-08 11:22:43,350 INFO L290 TraceCheckUtils]: 8: Hoare triple {12729#(<= ~counter~0 0)} assume !(0 == ~cond); {12729#(<= ~counter~0 0)} is VALID [2022-04-08 11:22:43,350 INFO L290 TraceCheckUtils]: 9: Hoare triple {12729#(<= ~counter~0 0)} assume true; {12729#(<= ~counter~0 0)} is VALID [2022-04-08 11:22:43,350 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12729#(<= ~counter~0 0)} {12729#(<= ~counter~0 0)} #77#return; {12729#(<= ~counter~0 0)} is VALID [2022-04-08 11:22:43,351 INFO L290 TraceCheckUtils]: 11: Hoare triple {12729#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {12729#(<= ~counter~0 0)} is VALID [2022-04-08 11:22:43,351 INFO L290 TraceCheckUtils]: 12: Hoare triple {12729#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12763#(<= ~counter~0 1)} is VALID [2022-04-08 11:22:43,352 INFO L290 TraceCheckUtils]: 13: Hoare triple {12763#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {12763#(<= ~counter~0 1)} is VALID [2022-04-08 11:22:43,352 INFO L272 TraceCheckUtils]: 14: Hoare triple {12763#(<= ~counter~0 1)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {12763#(<= ~counter~0 1)} is VALID [2022-04-08 11:22:43,352 INFO L290 TraceCheckUtils]: 15: Hoare triple {12763#(<= ~counter~0 1)} ~cond := #in~cond; {12763#(<= ~counter~0 1)} is VALID [2022-04-08 11:22:43,353 INFO L290 TraceCheckUtils]: 16: Hoare triple {12763#(<= ~counter~0 1)} assume !(0 == ~cond); {12763#(<= ~counter~0 1)} is VALID [2022-04-08 11:22:43,353 INFO L290 TraceCheckUtils]: 17: Hoare triple {12763#(<= ~counter~0 1)} assume true; {12763#(<= ~counter~0 1)} is VALID [2022-04-08 11:22:43,353 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12763#(<= ~counter~0 1)} {12763#(<= ~counter~0 1)} #79#return; {12763#(<= ~counter~0 1)} is VALID [2022-04-08 11:22:43,354 INFO L272 TraceCheckUtils]: 19: Hoare triple {12763#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {12763#(<= ~counter~0 1)} is VALID [2022-04-08 11:22:43,354 INFO L290 TraceCheckUtils]: 20: Hoare triple {12763#(<= ~counter~0 1)} ~cond := #in~cond; {12763#(<= ~counter~0 1)} is VALID [2022-04-08 11:22:43,354 INFO L290 TraceCheckUtils]: 21: Hoare triple {12763#(<= ~counter~0 1)} assume !(0 == ~cond); {12763#(<= ~counter~0 1)} is VALID [2022-04-08 11:22:43,355 INFO L290 TraceCheckUtils]: 22: Hoare triple {12763#(<= ~counter~0 1)} assume true; {12763#(<= ~counter~0 1)} is VALID [2022-04-08 11:22:43,355 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {12763#(<= ~counter~0 1)} {12763#(<= ~counter~0 1)} #81#return; {12763#(<= ~counter~0 1)} is VALID [2022-04-08 11:22:43,355 INFO L290 TraceCheckUtils]: 24: Hoare triple {12763#(<= ~counter~0 1)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {12763#(<= ~counter~0 1)} is VALID [2022-04-08 11:22:43,356 INFO L290 TraceCheckUtils]: 25: Hoare triple {12763#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {12803#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:43,356 INFO L290 TraceCheckUtils]: 26: Hoare triple {12803#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {12803#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:43,357 INFO L272 TraceCheckUtils]: 27: Hoare triple {12803#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {12803#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:43,357 INFO L290 TraceCheckUtils]: 28: Hoare triple {12803#(<= ~counter~0 2)} ~cond := #in~cond; {12803#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:43,357 INFO L290 TraceCheckUtils]: 29: Hoare triple {12803#(<= ~counter~0 2)} assume !(0 == ~cond); {12803#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:43,357 INFO L290 TraceCheckUtils]: 30: Hoare triple {12803#(<= ~counter~0 2)} assume true; {12803#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:43,358 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {12803#(<= ~counter~0 2)} {12803#(<= ~counter~0 2)} #83#return; {12803#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:43,358 INFO L272 TraceCheckUtils]: 32: Hoare triple {12803#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {12803#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:43,359 INFO L290 TraceCheckUtils]: 33: Hoare triple {12803#(<= ~counter~0 2)} ~cond := #in~cond; {12803#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:43,359 INFO L290 TraceCheckUtils]: 34: Hoare triple {12803#(<= ~counter~0 2)} assume !(0 == ~cond); {12803#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:43,359 INFO L290 TraceCheckUtils]: 35: Hoare triple {12803#(<= ~counter~0 2)} assume true; {12803#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:43,360 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {12803#(<= ~counter~0 2)} {12803#(<= ~counter~0 2)} #85#return; {12803#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:43,360 INFO L272 TraceCheckUtils]: 37: Hoare triple {12803#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {12803#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:43,360 INFO L290 TraceCheckUtils]: 38: Hoare triple {12803#(<= ~counter~0 2)} ~cond := #in~cond; {12803#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:43,361 INFO L290 TraceCheckUtils]: 39: Hoare triple {12803#(<= ~counter~0 2)} assume !(0 == ~cond); {12803#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:43,361 INFO L290 TraceCheckUtils]: 40: Hoare triple {12803#(<= ~counter~0 2)} assume true; {12803#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:43,361 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {12803#(<= ~counter~0 2)} {12803#(<= ~counter~0 2)} #87#return; {12803#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:43,361 INFO L290 TraceCheckUtils]: 42: Hoare triple {12803#(<= ~counter~0 2)} assume !!(~r~0 >= 2 * ~b~0); {12803#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:43,362 INFO L272 TraceCheckUtils]: 43: Hoare triple {12803#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {12803#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:43,362 INFO L290 TraceCheckUtils]: 44: Hoare triple {12803#(<= ~counter~0 2)} ~cond := #in~cond; {12803#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:43,362 INFO L290 TraceCheckUtils]: 45: Hoare triple {12803#(<= ~counter~0 2)} assume !(0 == ~cond); {12803#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:43,363 INFO L290 TraceCheckUtils]: 46: Hoare triple {12803#(<= ~counter~0 2)} assume true; {12803#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:43,363 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {12803#(<= ~counter~0 2)} {12803#(<= ~counter~0 2)} #89#return; {12803#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:43,363 INFO L290 TraceCheckUtils]: 48: Hoare triple {12803#(<= ~counter~0 2)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {12803#(<= ~counter~0 2)} is VALID [2022-04-08 11:22:43,364 INFO L290 TraceCheckUtils]: 49: Hoare triple {12803#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {12876#(<= ~counter~0 3)} is VALID [2022-04-08 11:22:43,364 INFO L290 TraceCheckUtils]: 50: Hoare triple {12876#(<= ~counter~0 3)} assume !!(#t~post7 < 10);havoc #t~post7; {12876#(<= ~counter~0 3)} is VALID [2022-04-08 11:22:43,365 INFO L272 TraceCheckUtils]: 51: Hoare triple {12876#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {12876#(<= ~counter~0 3)} is VALID [2022-04-08 11:22:43,365 INFO L290 TraceCheckUtils]: 52: Hoare triple {12876#(<= ~counter~0 3)} ~cond := #in~cond; {12876#(<= ~counter~0 3)} is VALID [2022-04-08 11:22:43,365 INFO L290 TraceCheckUtils]: 53: Hoare triple {12876#(<= ~counter~0 3)} assume !(0 == ~cond); {12876#(<= ~counter~0 3)} is VALID [2022-04-08 11:22:43,366 INFO L290 TraceCheckUtils]: 54: Hoare triple {12876#(<= ~counter~0 3)} assume true; {12876#(<= ~counter~0 3)} is VALID [2022-04-08 11:22:43,366 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {12876#(<= ~counter~0 3)} {12876#(<= ~counter~0 3)} #83#return; {12876#(<= ~counter~0 3)} is VALID [2022-04-08 11:22:43,367 INFO L272 TraceCheckUtils]: 56: Hoare triple {12876#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {12876#(<= ~counter~0 3)} is VALID [2022-04-08 11:22:43,367 INFO L290 TraceCheckUtils]: 57: Hoare triple {12876#(<= ~counter~0 3)} ~cond := #in~cond; {12876#(<= ~counter~0 3)} is VALID [2022-04-08 11:22:43,367 INFO L290 TraceCheckUtils]: 58: Hoare triple {12876#(<= ~counter~0 3)} assume !(0 == ~cond); {12876#(<= ~counter~0 3)} is VALID [2022-04-08 11:22:43,367 INFO L290 TraceCheckUtils]: 59: Hoare triple {12876#(<= ~counter~0 3)} assume true; {12876#(<= ~counter~0 3)} is VALID [2022-04-08 11:22:43,368 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {12876#(<= ~counter~0 3)} {12876#(<= ~counter~0 3)} #85#return; {12876#(<= ~counter~0 3)} is VALID [2022-04-08 11:22:43,368 INFO L272 TraceCheckUtils]: 61: Hoare triple {12876#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {12876#(<= ~counter~0 3)} is VALID [2022-04-08 11:22:43,368 INFO L290 TraceCheckUtils]: 62: Hoare triple {12876#(<= ~counter~0 3)} ~cond := #in~cond; {12876#(<= ~counter~0 3)} is VALID [2022-04-08 11:22:43,369 INFO L290 TraceCheckUtils]: 63: Hoare triple {12876#(<= ~counter~0 3)} assume !(0 == ~cond); {12876#(<= ~counter~0 3)} is VALID [2022-04-08 11:22:43,369 INFO L290 TraceCheckUtils]: 64: Hoare triple {12876#(<= ~counter~0 3)} assume true; {12876#(<= ~counter~0 3)} is VALID [2022-04-08 11:22:43,369 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {12876#(<= ~counter~0 3)} {12876#(<= ~counter~0 3)} #87#return; {12876#(<= ~counter~0 3)} is VALID [2022-04-08 11:22:43,370 INFO L290 TraceCheckUtils]: 66: Hoare triple {12876#(<= ~counter~0 3)} assume !(~r~0 >= 2 * ~b~0); {12876#(<= ~counter~0 3)} is VALID [2022-04-08 11:22:43,370 INFO L290 TraceCheckUtils]: 67: Hoare triple {12876#(<= ~counter~0 3)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {12876#(<= ~counter~0 3)} is VALID [2022-04-08 11:22:43,371 INFO L290 TraceCheckUtils]: 68: Hoare triple {12876#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12934#(<= ~counter~0 4)} is VALID [2022-04-08 11:22:43,371 INFO L290 TraceCheckUtils]: 69: Hoare triple {12934#(<= ~counter~0 4)} assume !!(#t~post6 < 10);havoc #t~post6; {12934#(<= ~counter~0 4)} is VALID [2022-04-08 11:22:43,371 INFO L272 TraceCheckUtils]: 70: Hoare triple {12934#(<= ~counter~0 4)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {12934#(<= ~counter~0 4)} is VALID [2022-04-08 11:22:43,372 INFO L290 TraceCheckUtils]: 71: Hoare triple {12934#(<= ~counter~0 4)} ~cond := #in~cond; {12934#(<= ~counter~0 4)} is VALID [2022-04-08 11:22:43,372 INFO L290 TraceCheckUtils]: 72: Hoare triple {12934#(<= ~counter~0 4)} assume !(0 == ~cond); {12934#(<= ~counter~0 4)} is VALID [2022-04-08 11:22:43,372 INFO L290 TraceCheckUtils]: 73: Hoare triple {12934#(<= ~counter~0 4)} assume true; {12934#(<= ~counter~0 4)} is VALID [2022-04-08 11:22:43,373 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {12934#(<= ~counter~0 4)} {12934#(<= ~counter~0 4)} #79#return; {12934#(<= ~counter~0 4)} is VALID [2022-04-08 11:22:43,373 INFO L272 TraceCheckUtils]: 75: Hoare triple {12934#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {12934#(<= ~counter~0 4)} is VALID [2022-04-08 11:22:43,373 INFO L290 TraceCheckUtils]: 76: Hoare triple {12934#(<= ~counter~0 4)} ~cond := #in~cond; {12934#(<= ~counter~0 4)} is VALID [2022-04-08 11:22:43,374 INFO L290 TraceCheckUtils]: 77: Hoare triple {12934#(<= ~counter~0 4)} assume !(0 == ~cond); {12934#(<= ~counter~0 4)} is VALID [2022-04-08 11:22:43,374 INFO L290 TraceCheckUtils]: 78: Hoare triple {12934#(<= ~counter~0 4)} assume true; {12934#(<= ~counter~0 4)} is VALID [2022-04-08 11:22:43,374 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {12934#(<= ~counter~0 4)} {12934#(<= ~counter~0 4)} #81#return; {12934#(<= ~counter~0 4)} is VALID [2022-04-08 11:22:43,375 INFO L290 TraceCheckUtils]: 80: Hoare triple {12934#(<= ~counter~0 4)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {12934#(<= ~counter~0 4)} is VALID [2022-04-08 11:22:43,375 INFO L290 TraceCheckUtils]: 81: Hoare triple {12934#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {12974#(<= |main_#t~post7| 4)} is VALID [2022-04-08 11:22:43,375 INFO L290 TraceCheckUtils]: 82: Hoare triple {12974#(<= |main_#t~post7| 4)} assume !(#t~post7 < 10);havoc #t~post7; {12722#false} is VALID [2022-04-08 11:22:43,376 INFO L290 TraceCheckUtils]: 83: Hoare triple {12722#false} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {12722#false} is VALID [2022-04-08 11:22:43,376 INFO L290 TraceCheckUtils]: 84: Hoare triple {12722#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12722#false} is VALID [2022-04-08 11:22:43,376 INFO L290 TraceCheckUtils]: 85: Hoare triple {12722#false} assume !(#t~post6 < 10);havoc #t~post6; {12722#false} is VALID [2022-04-08 11:22:43,376 INFO L272 TraceCheckUtils]: 86: Hoare triple {12722#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {12722#false} is VALID [2022-04-08 11:22:43,376 INFO L290 TraceCheckUtils]: 87: Hoare triple {12722#false} ~cond := #in~cond; {12722#false} is VALID [2022-04-08 11:22:43,376 INFO L290 TraceCheckUtils]: 88: Hoare triple {12722#false} assume 0 == ~cond; {12722#false} is VALID [2022-04-08 11:22:43,376 INFO L290 TraceCheckUtils]: 89: Hoare triple {12722#false} assume !false; {12722#false} is VALID [2022-04-08 11:22:43,376 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-08 11:22:43,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:22:43,688 INFO L290 TraceCheckUtils]: 89: Hoare triple {12722#false} assume !false; {12722#false} is VALID [2022-04-08 11:22:43,689 INFO L290 TraceCheckUtils]: 88: Hoare triple {12722#false} assume 0 == ~cond; {12722#false} is VALID [2022-04-08 11:22:43,689 INFO L290 TraceCheckUtils]: 87: Hoare triple {12722#false} ~cond := #in~cond; {12722#false} is VALID [2022-04-08 11:22:43,689 INFO L272 TraceCheckUtils]: 86: Hoare triple {12722#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {12722#false} is VALID [2022-04-08 11:22:43,689 INFO L290 TraceCheckUtils]: 85: Hoare triple {12722#false} assume !(#t~post6 < 10);havoc #t~post6; {12722#false} is VALID [2022-04-08 11:22:43,689 INFO L290 TraceCheckUtils]: 84: Hoare triple {12722#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12722#false} is VALID [2022-04-08 11:22:43,689 INFO L290 TraceCheckUtils]: 83: Hoare triple {12722#false} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {12722#false} is VALID [2022-04-08 11:22:43,689 INFO L290 TraceCheckUtils]: 82: Hoare triple {13020#(< |main_#t~post7| 10)} assume !(#t~post7 < 10);havoc #t~post7; {12722#false} is VALID [2022-04-08 11:22:43,690 INFO L290 TraceCheckUtils]: 81: Hoare triple {13024#(< ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13020#(< |main_#t~post7| 10)} is VALID [2022-04-08 11:22:43,690 INFO L290 TraceCheckUtils]: 80: Hoare triple {13024#(< ~counter~0 10)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {13024#(< ~counter~0 10)} is VALID [2022-04-08 11:22:43,691 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {12721#true} {13024#(< ~counter~0 10)} #81#return; {13024#(< ~counter~0 10)} is VALID [2022-04-08 11:22:43,691 INFO L290 TraceCheckUtils]: 78: Hoare triple {12721#true} assume true; {12721#true} is VALID [2022-04-08 11:22:43,691 INFO L290 TraceCheckUtils]: 77: Hoare triple {12721#true} assume !(0 == ~cond); {12721#true} is VALID [2022-04-08 11:22:43,691 INFO L290 TraceCheckUtils]: 76: Hoare triple {12721#true} ~cond := #in~cond; {12721#true} is VALID [2022-04-08 11:22:43,691 INFO L272 TraceCheckUtils]: 75: Hoare triple {13024#(< ~counter~0 10)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {12721#true} is VALID [2022-04-08 11:22:43,691 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {12721#true} {13024#(< ~counter~0 10)} #79#return; {13024#(< ~counter~0 10)} is VALID [2022-04-08 11:22:43,692 INFO L290 TraceCheckUtils]: 73: Hoare triple {12721#true} assume true; {12721#true} is VALID [2022-04-08 11:22:43,692 INFO L290 TraceCheckUtils]: 72: Hoare triple {12721#true} assume !(0 == ~cond); {12721#true} is VALID [2022-04-08 11:22:43,692 INFO L290 TraceCheckUtils]: 71: Hoare triple {12721#true} ~cond := #in~cond; {12721#true} is VALID [2022-04-08 11:22:43,692 INFO L272 TraceCheckUtils]: 70: Hoare triple {13024#(< ~counter~0 10)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {12721#true} is VALID [2022-04-08 11:22:43,692 INFO L290 TraceCheckUtils]: 69: Hoare triple {13024#(< ~counter~0 10)} assume !!(#t~post6 < 10);havoc #t~post6; {13024#(< ~counter~0 10)} is VALID [2022-04-08 11:22:43,693 INFO L290 TraceCheckUtils]: 68: Hoare triple {13064#(< ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13024#(< ~counter~0 10)} is VALID [2022-04-08 11:22:43,693 INFO L290 TraceCheckUtils]: 67: Hoare triple {13064#(< ~counter~0 9)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {13064#(< ~counter~0 9)} is VALID [2022-04-08 11:22:43,693 INFO L290 TraceCheckUtils]: 66: Hoare triple {13064#(< ~counter~0 9)} assume !(~r~0 >= 2 * ~b~0); {13064#(< ~counter~0 9)} is VALID [2022-04-08 11:22:43,694 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {12721#true} {13064#(< ~counter~0 9)} #87#return; {13064#(< ~counter~0 9)} is VALID [2022-04-08 11:22:43,694 INFO L290 TraceCheckUtils]: 64: Hoare triple {12721#true} assume true; {12721#true} is VALID [2022-04-08 11:22:43,694 INFO L290 TraceCheckUtils]: 63: Hoare triple {12721#true} assume !(0 == ~cond); {12721#true} is VALID [2022-04-08 11:22:43,694 INFO L290 TraceCheckUtils]: 62: Hoare triple {12721#true} ~cond := #in~cond; {12721#true} is VALID [2022-04-08 11:22:43,694 INFO L272 TraceCheckUtils]: 61: Hoare triple {13064#(< ~counter~0 9)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {12721#true} is VALID [2022-04-08 11:22:43,695 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {12721#true} {13064#(< ~counter~0 9)} #85#return; {13064#(< ~counter~0 9)} is VALID [2022-04-08 11:22:43,695 INFO L290 TraceCheckUtils]: 59: Hoare triple {12721#true} assume true; {12721#true} is VALID [2022-04-08 11:22:43,695 INFO L290 TraceCheckUtils]: 58: Hoare triple {12721#true} assume !(0 == ~cond); {12721#true} is VALID [2022-04-08 11:22:43,695 INFO L290 TraceCheckUtils]: 57: Hoare triple {12721#true} ~cond := #in~cond; {12721#true} is VALID [2022-04-08 11:22:43,695 INFO L272 TraceCheckUtils]: 56: Hoare triple {13064#(< ~counter~0 9)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {12721#true} is VALID [2022-04-08 11:22:43,695 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {12721#true} {13064#(< ~counter~0 9)} #83#return; {13064#(< ~counter~0 9)} is VALID [2022-04-08 11:22:43,696 INFO L290 TraceCheckUtils]: 54: Hoare triple {12721#true} assume true; {12721#true} is VALID [2022-04-08 11:22:43,696 INFO L290 TraceCheckUtils]: 53: Hoare triple {12721#true} assume !(0 == ~cond); {12721#true} is VALID [2022-04-08 11:22:43,696 INFO L290 TraceCheckUtils]: 52: Hoare triple {12721#true} ~cond := #in~cond; {12721#true} is VALID [2022-04-08 11:22:43,696 INFO L272 TraceCheckUtils]: 51: Hoare triple {13064#(< ~counter~0 9)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {12721#true} is VALID [2022-04-08 11:22:43,696 INFO L290 TraceCheckUtils]: 50: Hoare triple {13064#(< ~counter~0 9)} assume !!(#t~post7 < 10);havoc #t~post7; {13064#(< ~counter~0 9)} is VALID [2022-04-08 11:22:43,697 INFO L290 TraceCheckUtils]: 49: Hoare triple {13122#(< ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13064#(< ~counter~0 9)} is VALID [2022-04-08 11:22:43,697 INFO L290 TraceCheckUtils]: 48: Hoare triple {13122#(< ~counter~0 8)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {13122#(< ~counter~0 8)} is VALID [2022-04-08 11:22:43,698 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {12721#true} {13122#(< ~counter~0 8)} #89#return; {13122#(< ~counter~0 8)} is VALID [2022-04-08 11:22:43,698 INFO L290 TraceCheckUtils]: 46: Hoare triple {12721#true} assume true; {12721#true} is VALID [2022-04-08 11:22:43,698 INFO L290 TraceCheckUtils]: 45: Hoare triple {12721#true} assume !(0 == ~cond); {12721#true} is VALID [2022-04-08 11:22:43,698 INFO L290 TraceCheckUtils]: 44: Hoare triple {12721#true} ~cond := #in~cond; {12721#true} is VALID [2022-04-08 11:22:43,698 INFO L272 TraceCheckUtils]: 43: Hoare triple {13122#(< ~counter~0 8)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {12721#true} is VALID [2022-04-08 11:22:43,698 INFO L290 TraceCheckUtils]: 42: Hoare triple {13122#(< ~counter~0 8)} assume !!(~r~0 >= 2 * ~b~0); {13122#(< ~counter~0 8)} is VALID [2022-04-08 11:22:43,699 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {12721#true} {13122#(< ~counter~0 8)} #87#return; {13122#(< ~counter~0 8)} is VALID [2022-04-08 11:22:43,699 INFO L290 TraceCheckUtils]: 40: Hoare triple {12721#true} assume true; {12721#true} is VALID [2022-04-08 11:22:43,699 INFO L290 TraceCheckUtils]: 39: Hoare triple {12721#true} assume !(0 == ~cond); {12721#true} is VALID [2022-04-08 11:22:43,699 INFO L290 TraceCheckUtils]: 38: Hoare triple {12721#true} ~cond := #in~cond; {12721#true} is VALID [2022-04-08 11:22:43,699 INFO L272 TraceCheckUtils]: 37: Hoare triple {13122#(< ~counter~0 8)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {12721#true} is VALID [2022-04-08 11:22:43,700 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {12721#true} {13122#(< ~counter~0 8)} #85#return; {13122#(< ~counter~0 8)} is VALID [2022-04-08 11:22:43,700 INFO L290 TraceCheckUtils]: 35: Hoare triple {12721#true} assume true; {12721#true} is VALID [2022-04-08 11:22:43,700 INFO L290 TraceCheckUtils]: 34: Hoare triple {12721#true} assume !(0 == ~cond); {12721#true} is VALID [2022-04-08 11:22:43,700 INFO L290 TraceCheckUtils]: 33: Hoare triple {12721#true} ~cond := #in~cond; {12721#true} is VALID [2022-04-08 11:22:43,700 INFO L272 TraceCheckUtils]: 32: Hoare triple {13122#(< ~counter~0 8)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {12721#true} is VALID [2022-04-08 11:22:43,700 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {12721#true} {13122#(< ~counter~0 8)} #83#return; {13122#(< ~counter~0 8)} is VALID [2022-04-08 11:22:43,701 INFO L290 TraceCheckUtils]: 30: Hoare triple {12721#true} assume true; {12721#true} is VALID [2022-04-08 11:22:43,701 INFO L290 TraceCheckUtils]: 29: Hoare triple {12721#true} assume !(0 == ~cond); {12721#true} is VALID [2022-04-08 11:22:43,701 INFO L290 TraceCheckUtils]: 28: Hoare triple {12721#true} ~cond := #in~cond; {12721#true} is VALID [2022-04-08 11:22:43,701 INFO L272 TraceCheckUtils]: 27: Hoare triple {13122#(< ~counter~0 8)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {12721#true} is VALID [2022-04-08 11:22:43,701 INFO L290 TraceCheckUtils]: 26: Hoare triple {13122#(< ~counter~0 8)} assume !!(#t~post7 < 10);havoc #t~post7; {13122#(< ~counter~0 8)} is VALID [2022-04-08 11:22:43,702 INFO L290 TraceCheckUtils]: 25: Hoare triple {13195#(< ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13122#(< ~counter~0 8)} is VALID [2022-04-08 11:22:43,702 INFO L290 TraceCheckUtils]: 24: Hoare triple {13195#(< ~counter~0 7)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {13195#(< ~counter~0 7)} is VALID [2022-04-08 11:22:43,703 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {12721#true} {13195#(< ~counter~0 7)} #81#return; {13195#(< ~counter~0 7)} is VALID [2022-04-08 11:22:43,703 INFO L290 TraceCheckUtils]: 22: Hoare triple {12721#true} assume true; {12721#true} is VALID [2022-04-08 11:22:43,703 INFO L290 TraceCheckUtils]: 21: Hoare triple {12721#true} assume !(0 == ~cond); {12721#true} is VALID [2022-04-08 11:22:43,703 INFO L290 TraceCheckUtils]: 20: Hoare triple {12721#true} ~cond := #in~cond; {12721#true} is VALID [2022-04-08 11:22:43,703 INFO L272 TraceCheckUtils]: 19: Hoare triple {13195#(< ~counter~0 7)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {12721#true} is VALID [2022-04-08 11:22:43,703 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12721#true} {13195#(< ~counter~0 7)} #79#return; {13195#(< ~counter~0 7)} is VALID [2022-04-08 11:22:43,704 INFO L290 TraceCheckUtils]: 17: Hoare triple {12721#true} assume true; {12721#true} is VALID [2022-04-08 11:22:43,704 INFO L290 TraceCheckUtils]: 16: Hoare triple {12721#true} assume !(0 == ~cond); {12721#true} is VALID [2022-04-08 11:22:43,704 INFO L290 TraceCheckUtils]: 15: Hoare triple {12721#true} ~cond := #in~cond; {12721#true} is VALID [2022-04-08 11:22:43,704 INFO L272 TraceCheckUtils]: 14: Hoare triple {13195#(< ~counter~0 7)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {12721#true} is VALID [2022-04-08 11:22:43,704 INFO L290 TraceCheckUtils]: 13: Hoare triple {13195#(< ~counter~0 7)} assume !!(#t~post6 < 10);havoc #t~post6; {13195#(< ~counter~0 7)} is VALID [2022-04-08 11:22:43,705 INFO L290 TraceCheckUtils]: 12: Hoare triple {13235#(< ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13195#(< ~counter~0 7)} is VALID [2022-04-08 11:22:43,705 INFO L290 TraceCheckUtils]: 11: Hoare triple {13235#(< ~counter~0 6)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {13235#(< ~counter~0 6)} is VALID [2022-04-08 11:22:43,705 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12721#true} {13235#(< ~counter~0 6)} #77#return; {13235#(< ~counter~0 6)} is VALID [2022-04-08 11:22:43,705 INFO L290 TraceCheckUtils]: 9: Hoare triple {12721#true} assume true; {12721#true} is VALID [2022-04-08 11:22:43,705 INFO L290 TraceCheckUtils]: 8: Hoare triple {12721#true} assume !(0 == ~cond); {12721#true} is VALID [2022-04-08 11:22:43,706 INFO L290 TraceCheckUtils]: 7: Hoare triple {12721#true} ~cond := #in~cond; {12721#true} is VALID [2022-04-08 11:22:43,706 INFO L272 TraceCheckUtils]: 6: Hoare triple {13235#(< ~counter~0 6)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {12721#true} is VALID [2022-04-08 11:22:43,706 INFO L290 TraceCheckUtils]: 5: Hoare triple {13235#(< ~counter~0 6)} 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; {13235#(< ~counter~0 6)} is VALID [2022-04-08 11:22:43,706 INFO L272 TraceCheckUtils]: 4: Hoare triple {13235#(< ~counter~0 6)} call #t~ret8 := main(); {13235#(< ~counter~0 6)} is VALID [2022-04-08 11:22:43,707 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13235#(< ~counter~0 6)} {12721#true} #93#return; {13235#(< ~counter~0 6)} is VALID [2022-04-08 11:22:43,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {13235#(< ~counter~0 6)} assume true; {13235#(< ~counter~0 6)} is VALID [2022-04-08 11:22:43,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {12721#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; {13235#(< ~counter~0 6)} is VALID [2022-04-08 11:22:43,707 INFO L272 TraceCheckUtils]: 0: Hoare triple {12721#true} call ULTIMATE.init(); {12721#true} is VALID [2022-04-08 11:22:43,708 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-08 11:22:43,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:22:43,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527407080] [2022-04-08 11:22:43,708 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:22:43,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236720438] [2022-04-08 11:22:43,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236720438] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:22:43,708 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:22:43,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-08 11:22:43,709 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:22:43,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [578145264] [2022-04-08 11:22:43,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [578145264] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:22:43,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:22:43,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 11:22:43,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940564335] [2022-04-08 11:22:43,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:22:43,709 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-08 11:22:43,710 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:22:43,710 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-08 11:22:43,762 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-08 11:22:43,763 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 11:22:43,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:22:43,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 11:22:43,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 11:22:43,763 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-08 11:22:44,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:22:44,309 INFO L93 Difference]: Finished difference Result 269 states and 336 transitions. [2022-04-08 11:22:44,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 11:22:44,309 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-08 11:22:44,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:22:44,310 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-08 11:22:44,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 143 transitions. [2022-04-08 11:22:44,311 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-08 11:22:44,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 143 transitions. [2022-04-08 11:22:44,313 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 143 transitions. [2022-04-08 11:22:44,424 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-08 11:22:44,427 INFO L225 Difference]: With dead ends: 269 [2022-04-08 11:22:44,427 INFO L226 Difference]: Without dead ends: 196 [2022-04-08 11:22:44,428 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=165, Unknown=0, NotChecked=0, Total=272 [2022-04-08 11:22:44,428 INFO L913 BasicCegarLoop]: 55 mSDtfsCounter, 30 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 11:22:44,428 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 193 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 11:22:44,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-04-08 11:22:44,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2022-04-08 11:22:44,709 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:22:44,709 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-08 11:22:44,710 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-08 11:22:44,710 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-08 11:22:44,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:22:44,713 INFO L93 Difference]: Finished difference Result 196 states and 232 transitions. [2022-04-08 11:22:44,713 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 232 transitions. [2022-04-08 11:22:44,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:22:44,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:22:44,714 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-08 11:22:44,714 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-08 11:22:44,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:22:44,718 INFO L93 Difference]: Finished difference Result 196 states and 232 transitions. [2022-04-08 11:22:44,718 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 232 transitions. [2022-04-08 11:22:44,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:22:44,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:22:44,718 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:22:44,718 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:22:44,719 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-08 11:22:44,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 232 transitions. [2022-04-08 11:22:44,722 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 232 transitions. Word has length 90 [2022-04-08 11:22:44,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:22:44,722 INFO L478 AbstractCegarLoop]: Abstraction has 196 states and 232 transitions. [2022-04-08 11:22:44,723 INFO L479 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-08 11:22:44,723 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 196 states and 232 transitions. [2022-04-08 11:22:44,994 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-08 11:22:44,995 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 232 transitions. [2022-04-08 11:22:45,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-04-08 11:22:45,005 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:22:45,005 INFO L499 BasicCegarLoop]: 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-08 11:22:45,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-04-08 11:22:45,219 WARN L460 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-08 11:22:45,220 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:22:45,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:22:45,220 INFO L85 PathProgramCache]: Analyzing trace with hash 447330249, now seen corresponding path program 3 times [2022-04-08 11:22:45,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:22:45,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [448088254] [2022-04-08 11:23:16,524 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:23:16,524 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:23:16,524 INFO L85 PathProgramCache]: Analyzing trace with hash 447330249, now seen corresponding path program 4 times [2022-04-08 11:23:16,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:23:16,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847173073] [2022-04-08 11:23:16,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:23:16,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:23:16,535 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:23:16,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [702375508] [2022-04-08 11:23:16,535 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 11:23:16,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:23:16,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:23:16,536 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-08 11:23:16,537 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-08 11:23:16,601 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 11:23:16,601 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:23:16,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-08 11:23:16,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:23:16,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:23:18,301 INFO L272 TraceCheckUtils]: 0: Hoare triple {14602#true} call ULTIMATE.init(); {14602#true} is VALID [2022-04-08 11:23:18,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {14602#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; {14602#true} is VALID [2022-04-08 11:23:18,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-08 11:23:18,301 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14602#true} {14602#true} #93#return; {14602#true} is VALID [2022-04-08 11:23:18,301 INFO L272 TraceCheckUtils]: 4: Hoare triple {14602#true} call #t~ret8 := main(); {14602#true} is VALID [2022-04-08 11:23:18,301 INFO L290 TraceCheckUtils]: 5: Hoare triple {14602#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; {14602#true} is VALID [2022-04-08 11:23:18,301 INFO L272 TraceCheckUtils]: 6: Hoare triple {14602#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {14602#true} is VALID [2022-04-08 11:23:18,302 INFO L290 TraceCheckUtils]: 7: Hoare triple {14602#true} ~cond := #in~cond; {14602#true} is VALID [2022-04-08 11:23:18,302 INFO L290 TraceCheckUtils]: 8: Hoare triple {14602#true} assume !(0 == ~cond); {14602#true} is VALID [2022-04-08 11:23:18,302 INFO L290 TraceCheckUtils]: 9: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-08 11:23:18,302 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14602#true} {14602#true} #77#return; {14602#true} is VALID [2022-04-08 11:23:18,302 INFO L290 TraceCheckUtils]: 11: Hoare triple {14602#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {14640#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:23:18,303 INFO L290 TraceCheckUtils]: 12: Hoare triple {14640#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14640#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:23:18,303 INFO L290 TraceCheckUtils]: 13: Hoare triple {14640#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 10);havoc #t~post6; {14640#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:23:18,303 INFO L272 TraceCheckUtils]: 14: Hoare triple {14640#(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)); {14602#true} is VALID [2022-04-08 11:23:18,303 INFO L290 TraceCheckUtils]: 15: Hoare triple {14602#true} ~cond := #in~cond; {14602#true} is VALID [2022-04-08 11:23:18,303 INFO L290 TraceCheckUtils]: 16: Hoare triple {14602#true} assume !(0 == ~cond); {14602#true} is VALID [2022-04-08 11:23:18,303 INFO L290 TraceCheckUtils]: 17: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-08 11:23:18,304 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {14602#true} {14640#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #79#return; {14640#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:23:18,304 INFO L272 TraceCheckUtils]: 19: Hoare triple {14640#(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)); {14602#true} is VALID [2022-04-08 11:23:18,304 INFO L290 TraceCheckUtils]: 20: Hoare triple {14602#true} ~cond := #in~cond; {14602#true} is VALID [2022-04-08 11:23:18,304 INFO L290 TraceCheckUtils]: 21: Hoare triple {14602#true} assume !(0 == ~cond); {14602#true} is VALID [2022-04-08 11:23:18,304 INFO L290 TraceCheckUtils]: 22: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-08 11:23:18,305 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {14602#true} {14640#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #81#return; {14640#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:23:18,305 INFO L290 TraceCheckUtils]: 24: Hoare triple {14640#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {14680#(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-08 11:23:18,305 INFO L290 TraceCheckUtils]: 25: Hoare triple {14680#(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; {14680#(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-08 11:23:18,306 INFO L290 TraceCheckUtils]: 26: Hoare triple {14680#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(#t~post7 < 10);havoc #t~post7; {14680#(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-08 11:23:18,306 INFO L272 TraceCheckUtils]: 27: Hoare triple {14680#(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)); {14602#true} is VALID [2022-04-08 11:23:18,306 INFO L290 TraceCheckUtils]: 28: Hoare triple {14602#true} ~cond := #in~cond; {14602#true} is VALID [2022-04-08 11:23:18,306 INFO L290 TraceCheckUtils]: 29: Hoare triple {14602#true} assume !(0 == ~cond); {14602#true} is VALID [2022-04-08 11:23:18,306 INFO L290 TraceCheckUtils]: 30: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-08 11:23:18,307 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {14602#true} {14680#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #83#return; {14680#(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-08 11:23:18,307 INFO L272 TraceCheckUtils]: 32: Hoare triple {14680#(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)); {14602#true} is VALID [2022-04-08 11:23:18,307 INFO L290 TraceCheckUtils]: 33: Hoare triple {14602#true} ~cond := #in~cond; {14602#true} is VALID [2022-04-08 11:23:18,307 INFO L290 TraceCheckUtils]: 34: Hoare triple {14602#true} assume !(0 == ~cond); {14602#true} is VALID [2022-04-08 11:23:18,307 INFO L290 TraceCheckUtils]: 35: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-08 11:23:18,307 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {14602#true} {14680#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #85#return; {14680#(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-08 11:23:18,308 INFO L272 TraceCheckUtils]: 37: Hoare triple {14680#(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)); {14602#true} is VALID [2022-04-08 11:23:18,308 INFO L290 TraceCheckUtils]: 38: Hoare triple {14602#true} ~cond := #in~cond; {14602#true} is VALID [2022-04-08 11:23:18,308 INFO L290 TraceCheckUtils]: 39: Hoare triple {14602#true} assume !(0 == ~cond); {14602#true} is VALID [2022-04-08 11:23:18,308 INFO L290 TraceCheckUtils]: 40: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-08 11:23:18,308 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {14602#true} {14680#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #87#return; {14680#(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-08 11:23:18,309 INFO L290 TraceCheckUtils]: 42: Hoare triple {14680#(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); {14680#(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-08 11:23:18,309 INFO L272 TraceCheckUtils]: 43: Hoare triple {14680#(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)); {14602#true} is VALID [2022-04-08 11:23:18,309 INFO L290 TraceCheckUtils]: 44: Hoare triple {14602#true} ~cond := #in~cond; {14602#true} is VALID [2022-04-08 11:23:18,309 INFO L290 TraceCheckUtils]: 45: Hoare triple {14602#true} assume !(0 == ~cond); {14602#true} is VALID [2022-04-08 11:23:18,309 INFO L290 TraceCheckUtils]: 46: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-08 11:23:18,309 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {14602#true} {14680#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #89#return; {14680#(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-08 11:23:18,310 INFO L290 TraceCheckUtils]: 48: Hoare triple {14680#(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; {14753#(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-08 11:23:18,311 INFO L290 TraceCheckUtils]: 49: Hoare triple {14753#(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; {14753#(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-08 11:23:18,311 INFO L290 TraceCheckUtils]: 50: Hoare triple {14753#(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 < 10);havoc #t~post7; {14753#(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-08 11:23:18,311 INFO L272 TraceCheckUtils]: 51: Hoare triple {14753#(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)); {14602#true} is VALID [2022-04-08 11:23:18,311 INFO L290 TraceCheckUtils]: 52: Hoare triple {14602#true} ~cond := #in~cond; {14602#true} is VALID [2022-04-08 11:23:18,311 INFO L290 TraceCheckUtils]: 53: Hoare triple {14602#true} assume !(0 == ~cond); {14602#true} is VALID [2022-04-08 11:23:18,311 INFO L290 TraceCheckUtils]: 54: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-08 11:23:18,312 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {14602#true} {14753#(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; {14753#(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-08 11:23:18,312 INFO L272 TraceCheckUtils]: 56: Hoare triple {14753#(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)); {14602#true} is VALID [2022-04-08 11:23:18,312 INFO L290 TraceCheckUtils]: 57: Hoare triple {14602#true} ~cond := #in~cond; {14602#true} is VALID [2022-04-08 11:23:18,312 INFO L290 TraceCheckUtils]: 58: Hoare triple {14602#true} assume !(0 == ~cond); {14602#true} is VALID [2022-04-08 11:23:18,312 INFO L290 TraceCheckUtils]: 59: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-08 11:23:18,313 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {14602#true} {14753#(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; {14753#(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-08 11:23:18,313 INFO L272 TraceCheckUtils]: 61: Hoare triple {14753#(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)); {14602#true} is VALID [2022-04-08 11:23:18,313 INFO L290 TraceCheckUtils]: 62: Hoare triple {14602#true} ~cond := #in~cond; {14602#true} is VALID [2022-04-08 11:23:18,313 INFO L290 TraceCheckUtils]: 63: Hoare triple {14602#true} assume !(0 == ~cond); {14602#true} is VALID [2022-04-08 11:23:18,313 INFO L290 TraceCheckUtils]: 64: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-08 11:23:18,314 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {14602#true} {14753#(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; {14753#(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-08 11:23:18,314 INFO L290 TraceCheckUtils]: 66: Hoare triple {14753#(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); {14808#(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-08 11:23:18,315 INFO L290 TraceCheckUtils]: 67: Hoare triple {14808#(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; {14812#(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-08 11:23:18,316 INFO L290 TraceCheckUtils]: 68: Hoare triple {14812#(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; {14812#(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-08 11:23:18,316 INFO L290 TraceCheckUtils]: 69: Hoare triple {14812#(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 < 10);havoc #t~post6; {14812#(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-08 11:23:18,316 INFO L272 TraceCheckUtils]: 70: Hoare triple {14812#(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)); {14602#true} is VALID [2022-04-08 11:23:18,316 INFO L290 TraceCheckUtils]: 71: Hoare triple {14602#true} ~cond := #in~cond; {14602#true} is VALID [2022-04-08 11:23:18,316 INFO L290 TraceCheckUtils]: 72: Hoare triple {14602#true} assume !(0 == ~cond); {14602#true} is VALID [2022-04-08 11:23:18,316 INFO L290 TraceCheckUtils]: 73: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-08 11:23:18,317 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {14602#true} {14812#(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; {14812#(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-08 11:23:18,317 INFO L272 TraceCheckUtils]: 75: Hoare triple {14812#(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)); {14602#true} is VALID [2022-04-08 11:23:18,317 INFO L290 TraceCheckUtils]: 76: Hoare triple {14602#true} ~cond := #in~cond; {14602#true} is VALID [2022-04-08 11:23:18,317 INFO L290 TraceCheckUtils]: 77: Hoare triple {14602#true} assume !(0 == ~cond); {14602#true} is VALID [2022-04-08 11:23:18,317 INFO L290 TraceCheckUtils]: 78: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-08 11:23:18,317 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {14602#true} {14812#(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; {14812#(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-08 11:23:18,318 INFO L290 TraceCheckUtils]: 80: Hoare triple {14812#(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; {14852#(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-08 11:23:18,318 INFO L290 TraceCheckUtils]: 81: Hoare triple {14852#(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; {14852#(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-08 11:23:18,319 INFO L290 TraceCheckUtils]: 82: Hoare triple {14852#(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 < 10);havoc #t~post7; {14852#(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-08 11:23:18,319 INFO L272 TraceCheckUtils]: 83: Hoare triple {14852#(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)); {14602#true} is VALID [2022-04-08 11:23:18,319 INFO L290 TraceCheckUtils]: 84: Hoare triple {14602#true} ~cond := #in~cond; {14602#true} is VALID [2022-04-08 11:23:18,319 INFO L290 TraceCheckUtils]: 85: Hoare triple {14602#true} assume !(0 == ~cond); {14602#true} is VALID [2022-04-08 11:23:18,319 INFO L290 TraceCheckUtils]: 86: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-08 11:23:18,320 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {14602#true} {14852#(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; {14852#(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-08 11:23:18,320 INFO L272 TraceCheckUtils]: 88: Hoare triple {14852#(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)); {14602#true} is VALID [2022-04-08 11:23:18,320 INFO L290 TraceCheckUtils]: 89: Hoare triple {14602#true} ~cond := #in~cond; {14880#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:23:18,320 INFO L290 TraceCheckUtils]: 90: Hoare triple {14880#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {14884#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:23:18,321 INFO L290 TraceCheckUtils]: 91: Hoare triple {14884#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {14884#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:23:18,321 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {14884#(not (= |__VERIFIER_assert_#in~cond| 0))} {14852#(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; {14891#(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-08 11:23:18,322 INFO L272 TraceCheckUtils]: 93: Hoare triple {14891#(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)); {14602#true} is VALID [2022-04-08 11:23:18,322 INFO L290 TraceCheckUtils]: 94: Hoare triple {14602#true} ~cond := #in~cond; {14602#true} is VALID [2022-04-08 11:23:18,322 INFO L290 TraceCheckUtils]: 95: Hoare triple {14602#true} assume !(0 == ~cond); {14602#true} is VALID [2022-04-08 11:23:18,322 INFO L290 TraceCheckUtils]: 96: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-08 11:23:18,322 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {14602#true} {14891#(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; {14891#(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-08 11:23:18,323 INFO L290 TraceCheckUtils]: 98: Hoare triple {14891#(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); {14891#(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-08 11:23:18,324 INFO L290 TraceCheckUtils]: 99: Hoare triple {14891#(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; {14913#(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-08 11:23:18,325 INFO L290 TraceCheckUtils]: 100: Hoare triple {14913#(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; {14913#(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-08 11:23:18,325 INFO L290 TraceCheckUtils]: 101: Hoare triple {14913#(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 < 10);havoc #t~post6; {14913#(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-08 11:23:18,326 INFO L272 TraceCheckUtils]: 102: Hoare triple {14913#(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)); {14923#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:23:18,326 INFO L290 TraceCheckUtils]: 103: Hoare triple {14923#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14927#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:23:18,327 INFO L290 TraceCheckUtils]: 104: Hoare triple {14927#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14603#false} is VALID [2022-04-08 11:23:18,327 INFO L290 TraceCheckUtils]: 105: Hoare triple {14603#false} assume !false; {14603#false} is VALID [2022-04-08 11:23:18,327 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-08 11:23:18,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:23:27,372 INFO L290 TraceCheckUtils]: 105: Hoare triple {14603#false} assume !false; {14603#false} is VALID [2022-04-08 11:23:27,372 INFO L290 TraceCheckUtils]: 104: Hoare triple {14927#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14603#false} is VALID [2022-04-08 11:23:27,372 INFO L290 TraceCheckUtils]: 103: Hoare triple {14923#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14927#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:23:27,373 INFO L272 TraceCheckUtils]: 102: Hoare triple {14943#(= (+ (* 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)); {14923#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:23:27,373 INFO L290 TraceCheckUtils]: 101: Hoare triple {14943#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !(#t~post6 < 10);havoc #t~post6; {14943#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:23:27,374 INFO L290 TraceCheckUtils]: 100: Hoare triple {14943#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14943#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:23:27,381 INFO L290 TraceCheckUtils]: 99: Hoare triple {14953#(= 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; {14943#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:23:27,381 INFO L290 TraceCheckUtils]: 98: Hoare triple {14953#(= 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); {14953#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-08 11:23:27,382 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {14602#true} {14953#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} #87#return; {14953#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-08 11:23:27,382 INFO L290 TraceCheckUtils]: 96: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-08 11:23:27,382 INFO L290 TraceCheckUtils]: 95: Hoare triple {14602#true} assume !(0 == ~cond); {14602#true} is VALID [2022-04-08 11:23:27,382 INFO L290 TraceCheckUtils]: 94: Hoare triple {14602#true} ~cond := #in~cond; {14602#true} is VALID [2022-04-08 11:23:27,382 INFO L272 TraceCheckUtils]: 93: Hoare triple {14953#(= 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)); {14602#true} is VALID [2022-04-08 11:23:27,384 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {14884#(not (= |__VERIFIER_assert_#in~cond| 0))} {14975#(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; {14953#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-08 11:23:27,384 INFO L290 TraceCheckUtils]: 91: Hoare triple {14884#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {14884#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:23:27,384 INFO L290 TraceCheckUtils]: 90: Hoare triple {14985#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {14884#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:23:27,385 INFO L290 TraceCheckUtils]: 89: Hoare triple {14602#true} ~cond := #in~cond; {14985#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 11:23:27,385 INFO L272 TraceCheckUtils]: 88: Hoare triple {14975#(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)); {14602#true} is VALID [2022-04-08 11:23:27,385 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {14602#true} {14975#(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; {14975#(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-08 11:23:27,385 INFO L290 TraceCheckUtils]: 86: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-08 11:23:27,386 INFO L290 TraceCheckUtils]: 85: Hoare triple {14602#true} assume !(0 == ~cond); {14602#true} is VALID [2022-04-08 11:23:27,386 INFO L290 TraceCheckUtils]: 84: Hoare triple {14602#true} ~cond := #in~cond; {14602#true} is VALID [2022-04-08 11:23:27,386 INFO L272 TraceCheckUtils]: 83: Hoare triple {14975#(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)); {14602#true} is VALID [2022-04-08 11:23:27,386 INFO L290 TraceCheckUtils]: 82: Hoare triple {14975#(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 < 10);havoc #t~post7; {14975#(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-08 11:23:27,387 INFO L290 TraceCheckUtils]: 81: Hoare triple {14975#(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; {14975#(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-08 11:23:27,387 INFO L290 TraceCheckUtils]: 80: Hoare triple {14602#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {14975#(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-08 11:23:27,387 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {14602#true} {14602#true} #81#return; {14602#true} is VALID [2022-04-08 11:23:27,387 INFO L290 TraceCheckUtils]: 78: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-08 11:23:27,387 INFO L290 TraceCheckUtils]: 77: Hoare triple {14602#true} assume !(0 == ~cond); {14602#true} is VALID [2022-04-08 11:23:27,387 INFO L290 TraceCheckUtils]: 76: Hoare triple {14602#true} ~cond := #in~cond; {14602#true} is VALID [2022-04-08 11:23:27,387 INFO L272 TraceCheckUtils]: 75: Hoare triple {14602#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {14602#true} is VALID [2022-04-08 11:23:27,388 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {14602#true} {14602#true} #79#return; {14602#true} is VALID [2022-04-08 11:23:27,388 INFO L290 TraceCheckUtils]: 73: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-08 11:23:27,388 INFO L290 TraceCheckUtils]: 72: Hoare triple {14602#true} assume !(0 == ~cond); {14602#true} is VALID [2022-04-08 11:23:27,388 INFO L290 TraceCheckUtils]: 71: Hoare triple {14602#true} ~cond := #in~cond; {14602#true} is VALID [2022-04-08 11:23:27,388 INFO L272 TraceCheckUtils]: 70: Hoare triple {14602#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {14602#true} is VALID [2022-04-08 11:23:27,388 INFO L290 TraceCheckUtils]: 69: Hoare triple {14602#true} assume !!(#t~post6 < 10);havoc #t~post6; {14602#true} is VALID [2022-04-08 11:23:27,388 INFO L290 TraceCheckUtils]: 68: Hoare triple {14602#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14602#true} is VALID [2022-04-08 11:23:27,388 INFO L290 TraceCheckUtils]: 67: Hoare triple {14602#true} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {14602#true} is VALID [2022-04-08 11:23:27,388 INFO L290 TraceCheckUtils]: 66: Hoare triple {14602#true} assume !(~r~0 >= 2 * ~b~0); {14602#true} is VALID [2022-04-08 11:23:27,388 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {14602#true} {14602#true} #87#return; {14602#true} is VALID [2022-04-08 11:23:27,389 INFO L290 TraceCheckUtils]: 64: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-08 11:23:27,389 INFO L290 TraceCheckUtils]: 63: Hoare triple {14602#true} assume !(0 == ~cond); {14602#true} is VALID [2022-04-08 11:23:27,389 INFO L290 TraceCheckUtils]: 62: Hoare triple {14602#true} ~cond := #in~cond; {14602#true} is VALID [2022-04-08 11:23:27,389 INFO L272 TraceCheckUtils]: 61: Hoare triple {14602#true} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {14602#true} is VALID [2022-04-08 11:23:27,389 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {14602#true} {14602#true} #85#return; {14602#true} is VALID [2022-04-08 11:23:27,389 INFO L290 TraceCheckUtils]: 59: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-08 11:23:27,389 INFO L290 TraceCheckUtils]: 58: Hoare triple {14602#true} assume !(0 == ~cond); {14602#true} is VALID [2022-04-08 11:23:27,389 INFO L290 TraceCheckUtils]: 57: Hoare triple {14602#true} ~cond := #in~cond; {14602#true} is VALID [2022-04-08 11:23:27,389 INFO L272 TraceCheckUtils]: 56: Hoare triple {14602#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {14602#true} is VALID [2022-04-08 11:23:27,389 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {14602#true} {14602#true} #83#return; {14602#true} is VALID [2022-04-08 11:23:27,389 INFO L290 TraceCheckUtils]: 54: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-08 11:23:27,390 INFO L290 TraceCheckUtils]: 53: Hoare triple {14602#true} assume !(0 == ~cond); {14602#true} is VALID [2022-04-08 11:23:27,390 INFO L290 TraceCheckUtils]: 52: Hoare triple {14602#true} ~cond := #in~cond; {14602#true} is VALID [2022-04-08 11:23:27,390 INFO L272 TraceCheckUtils]: 51: Hoare triple {14602#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {14602#true} is VALID [2022-04-08 11:23:27,390 INFO L290 TraceCheckUtils]: 50: Hoare triple {14602#true} assume !!(#t~post7 < 10);havoc #t~post7; {14602#true} is VALID [2022-04-08 11:23:27,390 INFO L290 TraceCheckUtils]: 49: Hoare triple {14602#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14602#true} is VALID [2022-04-08 11:23:27,390 INFO L290 TraceCheckUtils]: 48: Hoare triple {14602#true} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {14602#true} is VALID [2022-04-08 11:23:27,390 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {14602#true} {14602#true} #89#return; {14602#true} is VALID [2022-04-08 11:23:27,390 INFO L290 TraceCheckUtils]: 46: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-08 11:23:27,390 INFO L290 TraceCheckUtils]: 45: Hoare triple {14602#true} assume !(0 == ~cond); {14602#true} is VALID [2022-04-08 11:23:27,390 INFO L290 TraceCheckUtils]: 44: Hoare triple {14602#true} ~cond := #in~cond; {14602#true} is VALID [2022-04-08 11:23:27,391 INFO L272 TraceCheckUtils]: 43: Hoare triple {14602#true} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {14602#true} is VALID [2022-04-08 11:23:27,391 INFO L290 TraceCheckUtils]: 42: Hoare triple {14602#true} assume !!(~r~0 >= 2 * ~b~0); {14602#true} is VALID [2022-04-08 11:23:27,391 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {14602#true} {14602#true} #87#return; {14602#true} is VALID [2022-04-08 11:23:27,391 INFO L290 TraceCheckUtils]: 40: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-08 11:23:27,391 INFO L290 TraceCheckUtils]: 39: Hoare triple {14602#true} assume !(0 == ~cond); {14602#true} is VALID [2022-04-08 11:23:27,391 INFO L290 TraceCheckUtils]: 38: Hoare triple {14602#true} ~cond := #in~cond; {14602#true} is VALID [2022-04-08 11:23:27,391 INFO L272 TraceCheckUtils]: 37: Hoare triple {14602#true} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {14602#true} is VALID [2022-04-08 11:23:27,391 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {14602#true} {14602#true} #85#return; {14602#true} is VALID [2022-04-08 11:23:27,391 INFO L290 TraceCheckUtils]: 35: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-08 11:23:27,391 INFO L290 TraceCheckUtils]: 34: Hoare triple {14602#true} assume !(0 == ~cond); {14602#true} is VALID [2022-04-08 11:23:27,391 INFO L290 TraceCheckUtils]: 33: Hoare triple {14602#true} ~cond := #in~cond; {14602#true} is VALID [2022-04-08 11:23:27,392 INFO L272 TraceCheckUtils]: 32: Hoare triple {14602#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {14602#true} is VALID [2022-04-08 11:23:27,392 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {14602#true} {14602#true} #83#return; {14602#true} is VALID [2022-04-08 11:23:27,392 INFO L290 TraceCheckUtils]: 30: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-08 11:23:27,392 INFO L290 TraceCheckUtils]: 29: Hoare triple {14602#true} assume !(0 == ~cond); {14602#true} is VALID [2022-04-08 11:23:27,392 INFO L290 TraceCheckUtils]: 28: Hoare triple {14602#true} ~cond := #in~cond; {14602#true} is VALID [2022-04-08 11:23:27,392 INFO L272 TraceCheckUtils]: 27: Hoare triple {14602#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {14602#true} is VALID [2022-04-08 11:23:27,392 INFO L290 TraceCheckUtils]: 26: Hoare triple {14602#true} assume !!(#t~post7 < 10);havoc #t~post7; {14602#true} is VALID [2022-04-08 11:23:27,392 INFO L290 TraceCheckUtils]: 25: Hoare triple {14602#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14602#true} is VALID [2022-04-08 11:23:27,392 INFO L290 TraceCheckUtils]: 24: Hoare triple {14602#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {14602#true} is VALID [2022-04-08 11:23:27,392 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {14602#true} {14602#true} #81#return; {14602#true} is VALID [2022-04-08 11:23:27,393 INFO L290 TraceCheckUtils]: 22: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-08 11:23:27,393 INFO L290 TraceCheckUtils]: 21: Hoare triple {14602#true} assume !(0 == ~cond); {14602#true} is VALID [2022-04-08 11:23:27,393 INFO L290 TraceCheckUtils]: 20: Hoare triple {14602#true} ~cond := #in~cond; {14602#true} is VALID [2022-04-08 11:23:27,393 INFO L272 TraceCheckUtils]: 19: Hoare triple {14602#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {14602#true} is VALID [2022-04-08 11:23:27,393 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {14602#true} {14602#true} #79#return; {14602#true} is VALID [2022-04-08 11:23:27,393 INFO L290 TraceCheckUtils]: 17: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-08 11:23:27,393 INFO L290 TraceCheckUtils]: 16: Hoare triple {14602#true} assume !(0 == ~cond); {14602#true} is VALID [2022-04-08 11:23:27,393 INFO L290 TraceCheckUtils]: 15: Hoare triple {14602#true} ~cond := #in~cond; {14602#true} is VALID [2022-04-08 11:23:27,393 INFO L272 TraceCheckUtils]: 14: Hoare triple {14602#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {14602#true} is VALID [2022-04-08 11:23:27,393 INFO L290 TraceCheckUtils]: 13: Hoare triple {14602#true} assume !!(#t~post6 < 10);havoc #t~post6; {14602#true} is VALID [2022-04-08 11:23:27,393 INFO L290 TraceCheckUtils]: 12: Hoare triple {14602#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14602#true} is VALID [2022-04-08 11:23:27,394 INFO L290 TraceCheckUtils]: 11: Hoare triple {14602#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {14602#true} is VALID [2022-04-08 11:23:27,394 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14602#true} {14602#true} #77#return; {14602#true} is VALID [2022-04-08 11:23:27,394 INFO L290 TraceCheckUtils]: 9: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-08 11:23:27,394 INFO L290 TraceCheckUtils]: 8: Hoare triple {14602#true} assume !(0 == ~cond); {14602#true} is VALID [2022-04-08 11:23:27,394 INFO L290 TraceCheckUtils]: 7: Hoare triple {14602#true} ~cond := #in~cond; {14602#true} is VALID [2022-04-08 11:23:27,394 INFO L272 TraceCheckUtils]: 6: Hoare triple {14602#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {14602#true} is VALID [2022-04-08 11:23:27,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {14602#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; {14602#true} is VALID [2022-04-08 11:23:27,394 INFO L272 TraceCheckUtils]: 4: Hoare triple {14602#true} call #t~ret8 := main(); {14602#true} is VALID [2022-04-08 11:23:27,394 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14602#true} {14602#true} #93#return; {14602#true} is VALID [2022-04-08 11:23:27,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-08 11:23:27,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {14602#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; {14602#true} is VALID [2022-04-08 11:23:27,395 INFO L272 TraceCheckUtils]: 0: Hoare triple {14602#true} call ULTIMATE.init(); {14602#true} is VALID [2022-04-08 11:23:27,395 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-08 11:23:27,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:23:27,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847173073] [2022-04-08 11:23:27,395 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:23:27,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702375508] [2022-04-08 11:23:27,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702375508] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:23:27,396 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:23:27,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 18 [2022-04-08 11:23:27,396 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:23:27,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [448088254] [2022-04-08 11:23:27,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [448088254] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:23:27,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:23:27,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 11:23:27,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120417006] [2022-04-08 11:23:27,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:23:27,397 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-08 11:23:27,397 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:23:27,397 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-08 11:23:27,458 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-08 11:23:27,458 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 11:23:27,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:23:27,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 11:23:27,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-04-08 11:23:27,459 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-08 11:23:30,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:23:30,276 INFO L93 Difference]: Finished difference Result 281 states and 343 transitions. [2022-04-08 11:23:30,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 11:23:30,277 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-08 11:23:30,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:23:30,277 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-08 11:23:30,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 151 transitions. [2022-04-08 11:23:30,279 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-08 11:23:30,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 151 transitions. [2022-04-08 11:23:30,297 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 151 transitions. [2022-04-08 11:23:30,435 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-08 11:23:30,438 INFO L225 Difference]: With dead ends: 281 [2022-04-08 11:23:30,438 INFO L226 Difference]: Without dead ends: 185 [2022-04-08 11:23:30,438 INFO L912 BasicCegarLoop]: 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-08 11:23:30,439 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 31 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-08 11:23:30,439 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 267 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-08 11:23:30,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-04-08 11:23:30,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 184. [2022-04-08 11:23:30,679 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:23:30,679 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-08 11:23:30,680 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-08 11:23:30,680 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-08 11:23:30,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:23:30,683 INFO L93 Difference]: Finished difference Result 185 states and 219 transitions. [2022-04-08 11:23:30,683 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 219 transitions. [2022-04-08 11:23:30,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:23:30,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:23:30,684 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-08 11:23:30,684 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-08 11:23:30,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:23:30,687 INFO L93 Difference]: Finished difference Result 185 states and 219 transitions. [2022-04-08 11:23:30,687 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 219 transitions. [2022-04-08 11:23:30,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:23:30,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:23:30,687 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:23:30,687 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:23:30,688 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-08 11:23:30,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 218 transitions. [2022-04-08 11:23:30,691 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 218 transitions. Word has length 106 [2022-04-08 11:23:30,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:23:30,691 INFO L478 AbstractCegarLoop]: Abstraction has 184 states and 218 transitions. [2022-04-08 11:23:30,691 INFO L479 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-08 11:23:30,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 184 states and 218 transitions. [2022-04-08 11:23:30,943 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-08 11:23:30,943 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 218 transitions. [2022-04-08 11:23:30,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-04-08 11:23:30,944 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:23:30,944 INFO L499 BasicCegarLoop]: 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-08 11:23:30,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-04-08 11:23:31,151 WARN L460 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-08 11:23:31,151 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:23:31,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:23:31,152 INFO L85 PathProgramCache]: Analyzing trace with hash 2077207105, now seen corresponding path program 3 times [2022-04-08 11:23:31,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:23:31,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [584856248] [2022-04-08 11:24:03,375 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:24:03,376 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:24:03,376 INFO L85 PathProgramCache]: Analyzing trace with hash 2077207105, now seen corresponding path program 4 times [2022-04-08 11:24:03,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:24:03,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602581896] [2022-04-08 11:24:03,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:24:03,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:24:03,398 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:24:03,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [509721965] [2022-04-08 11:24:03,398 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 11:24:03,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:24:03,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:24:03,408 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-08 11:24:03,409 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-08 11:24:03,468 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 11:24:03,468 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:24:03,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-08 11:24:03,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:24:03,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:25:40,638 INFO L272 TraceCheckUtils]: 0: Hoare triple {16559#true} call ULTIMATE.init(); {16559#true} is VALID [2022-04-08 11:25:40,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {16559#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; {16559#true} is VALID [2022-04-08 11:25:40,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {16559#true} assume true; {16559#true} is VALID [2022-04-08 11:25:40,639 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16559#true} {16559#true} #93#return; {16559#true} is VALID [2022-04-08 11:25:40,639 INFO L272 TraceCheckUtils]: 4: Hoare triple {16559#true} call #t~ret8 := main(); {16559#true} is VALID [2022-04-08 11:25:40,639 INFO L290 TraceCheckUtils]: 5: Hoare triple {16559#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; {16559#true} is VALID [2022-04-08 11:25:40,639 INFO L272 TraceCheckUtils]: 6: Hoare triple {16559#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {16559#true} is VALID [2022-04-08 11:25:40,639 INFO L290 TraceCheckUtils]: 7: Hoare triple {16559#true} ~cond := #in~cond; {16559#true} is VALID [2022-04-08 11:25:40,639 INFO L290 TraceCheckUtils]: 8: Hoare triple {16559#true} assume !(0 == ~cond); {16559#true} is VALID [2022-04-08 11:25:40,639 INFO L290 TraceCheckUtils]: 9: Hoare triple {16559#true} assume true; {16559#true} is VALID [2022-04-08 11:25:40,639 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16559#true} {16559#true} #77#return; {16559#true} is VALID [2022-04-08 11:25:40,640 INFO L290 TraceCheckUtils]: 11: Hoare triple {16559#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {16597#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:25:40,640 INFO L290 TraceCheckUtils]: 12: Hoare triple {16597#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16597#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:25:40,640 INFO L290 TraceCheckUtils]: 13: Hoare triple {16597#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 10);havoc #t~post6; {16597#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:25:40,641 INFO L272 TraceCheckUtils]: 14: Hoare triple {16597#(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)); {16559#true} is VALID [2022-04-08 11:25:40,641 INFO L290 TraceCheckUtils]: 15: Hoare triple {16559#true} ~cond := #in~cond; {16559#true} is VALID [2022-04-08 11:25:40,641 INFO L290 TraceCheckUtils]: 16: Hoare triple {16559#true} assume !(0 == ~cond); {16559#true} is VALID [2022-04-08 11:25:40,641 INFO L290 TraceCheckUtils]: 17: Hoare triple {16559#true} assume true; {16559#true} is VALID [2022-04-08 11:25:40,642 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {16559#true} {16597#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #79#return; {16597#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:25:40,642 INFO L272 TraceCheckUtils]: 19: Hoare triple {16597#(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)); {16559#true} is VALID [2022-04-08 11:25:40,642 INFO L290 TraceCheckUtils]: 20: Hoare triple {16559#true} ~cond := #in~cond; {16559#true} is VALID [2022-04-08 11:25:40,642 INFO L290 TraceCheckUtils]: 21: Hoare triple {16559#true} assume !(0 == ~cond); {16559#true} is VALID [2022-04-08 11:25:40,642 INFO L290 TraceCheckUtils]: 22: Hoare triple {16559#true} assume true; {16559#true} is VALID [2022-04-08 11:25:40,643 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {16559#true} {16597#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #81#return; {16597#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:25:40,643 INFO L290 TraceCheckUtils]: 24: Hoare triple {16597#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {16637#(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-08 11:25:40,643 INFO L290 TraceCheckUtils]: 25: Hoare triple {16637#(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; {16637#(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-08 11:25:40,644 INFO L290 TraceCheckUtils]: 26: Hoare triple {16637#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(#t~post7 < 10);havoc #t~post7; {16637#(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-08 11:25:40,644 INFO L272 TraceCheckUtils]: 27: Hoare triple {16637#(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)); {16559#true} is VALID [2022-04-08 11:25:40,644 INFO L290 TraceCheckUtils]: 28: Hoare triple {16559#true} ~cond := #in~cond; {16559#true} is VALID [2022-04-08 11:25:40,644 INFO L290 TraceCheckUtils]: 29: Hoare triple {16559#true} assume !(0 == ~cond); {16559#true} is VALID [2022-04-08 11:25:40,644 INFO L290 TraceCheckUtils]: 30: Hoare triple {16559#true} assume true; {16559#true} is VALID [2022-04-08 11:25:40,645 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {16559#true} {16637#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #83#return; {16637#(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-08 11:25:40,645 INFO L272 TraceCheckUtils]: 32: Hoare triple {16637#(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)); {16559#true} is VALID [2022-04-08 11:25:40,645 INFO L290 TraceCheckUtils]: 33: Hoare triple {16559#true} ~cond := #in~cond; {16559#true} is VALID [2022-04-08 11:25:40,645 INFO L290 TraceCheckUtils]: 34: Hoare triple {16559#true} assume !(0 == ~cond); {16559#true} is VALID [2022-04-08 11:25:40,645 INFO L290 TraceCheckUtils]: 35: Hoare triple {16559#true} assume true; {16559#true} is VALID [2022-04-08 11:25:40,645 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {16559#true} {16637#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #85#return; {16637#(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-08 11:25:40,646 INFO L272 TraceCheckUtils]: 37: Hoare triple {16637#(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)); {16559#true} is VALID [2022-04-08 11:25:40,646 INFO L290 TraceCheckUtils]: 38: Hoare triple {16559#true} ~cond := #in~cond; {16559#true} is VALID [2022-04-08 11:25:40,646 INFO L290 TraceCheckUtils]: 39: Hoare triple {16559#true} assume !(0 == ~cond); {16559#true} is VALID [2022-04-08 11:25:40,646 INFO L290 TraceCheckUtils]: 40: Hoare triple {16559#true} assume true; {16559#true} is VALID [2022-04-08 11:25:40,646 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {16559#true} {16637#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #87#return; {16637#(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-08 11:25:40,647 INFO L290 TraceCheckUtils]: 42: Hoare triple {16637#(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); {16637#(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-08 11:25:40,647 INFO L272 TraceCheckUtils]: 43: Hoare triple {16637#(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)); {16559#true} is VALID [2022-04-08 11:25:40,647 INFO L290 TraceCheckUtils]: 44: Hoare triple {16559#true} ~cond := #in~cond; {16559#true} is VALID [2022-04-08 11:25:40,647 INFO L290 TraceCheckUtils]: 45: Hoare triple {16559#true} assume !(0 == ~cond); {16559#true} is VALID [2022-04-08 11:25:40,647 INFO L290 TraceCheckUtils]: 46: Hoare triple {16559#true} assume true; {16559#true} is VALID [2022-04-08 11:25:40,648 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {16559#true} {16637#(and (<= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #89#return; {16637#(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-08 11:25:40,649 INFO L290 TraceCheckUtils]: 48: Hoare triple {16637#(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; {16710#(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-08 11:25:40,649 INFO L290 TraceCheckUtils]: 49: Hoare triple {16710#(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; {16710#(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-08 11:25:40,650 INFO L290 TraceCheckUtils]: 50: Hoare triple {16710#(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 < 10);havoc #t~post7; {16710#(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-08 11:25:40,650 INFO L272 TraceCheckUtils]: 51: Hoare triple {16710#(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)); {16559#true} is VALID [2022-04-08 11:25:40,650 INFO L290 TraceCheckUtils]: 52: Hoare triple {16559#true} ~cond := #in~cond; {16723#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:25:40,650 INFO L290 TraceCheckUtils]: 53: Hoare triple {16723#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {16727#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:25:40,651 INFO L290 TraceCheckUtils]: 54: Hoare triple {16727#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {16727#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:25:40,651 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {16727#(not (= |__VERIFIER_assert_#in~cond| 0))} {16710#(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; {16734#(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-08 11:25:40,652 INFO L272 TraceCheckUtils]: 56: Hoare triple {16734#(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)); {16559#true} is VALID [2022-04-08 11:25:40,652 INFO L290 TraceCheckUtils]: 57: Hoare triple {16559#true} ~cond := #in~cond; {16559#true} is VALID [2022-04-08 11:25:40,652 INFO L290 TraceCheckUtils]: 58: Hoare triple {16559#true} assume !(0 == ~cond); {16559#true} is VALID [2022-04-08 11:25:40,652 INFO L290 TraceCheckUtils]: 59: Hoare triple {16559#true} assume true; {16559#true} is VALID [2022-04-08 11:25:40,652 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {16559#true} {16734#(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; {16734#(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-08 11:25:40,653 INFO L272 TraceCheckUtils]: 61: Hoare triple {16734#(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)); {16559#true} is VALID [2022-04-08 11:25:40,653 INFO L290 TraceCheckUtils]: 62: Hoare triple {16559#true} ~cond := #in~cond; {16559#true} is VALID [2022-04-08 11:25:40,653 INFO L290 TraceCheckUtils]: 63: Hoare triple {16559#true} assume !(0 == ~cond); {16559#true} is VALID [2022-04-08 11:25:40,653 INFO L290 TraceCheckUtils]: 64: Hoare triple {16559#true} assume true; {16559#true} is VALID [2022-04-08 11:25:40,653 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {16559#true} {16734#(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; {16734#(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-08 11:25:40,654 INFO L290 TraceCheckUtils]: 66: Hoare triple {16734#(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); {16734#(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-08 11:25:40,654 INFO L272 TraceCheckUtils]: 67: Hoare triple {16734#(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)); {16559#true} is VALID [2022-04-08 11:25:40,654 INFO L290 TraceCheckUtils]: 68: Hoare triple {16559#true} ~cond := #in~cond; {16559#true} is VALID [2022-04-08 11:25:40,654 INFO L290 TraceCheckUtils]: 69: Hoare triple {16559#true} assume !(0 == ~cond); {16559#true} is VALID [2022-04-08 11:25:40,654 INFO L290 TraceCheckUtils]: 70: Hoare triple {16559#true} assume true; {16559#true} is VALID [2022-04-08 11:25:40,655 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {16559#true} {16734#(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; {16734#(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-08 11:25:40,659 INFO L290 TraceCheckUtils]: 72: Hoare triple {16734#(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; {16786#(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-08 11:25:40,660 INFO L290 TraceCheckUtils]: 73: Hoare triple {16786#(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; {16786#(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-08 11:25:40,660 INFO L290 TraceCheckUtils]: 74: Hoare triple {16786#(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 < 10);havoc #t~post7; {16786#(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-08 11:25:40,660 INFO L272 TraceCheckUtils]: 75: Hoare triple {16786#(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)); {16559#true} is VALID [2022-04-08 11:25:40,660 INFO L290 TraceCheckUtils]: 76: Hoare triple {16559#true} ~cond := #in~cond; {16559#true} is VALID [2022-04-08 11:25:40,660 INFO L290 TraceCheckUtils]: 77: Hoare triple {16559#true} assume !(0 == ~cond); {16559#true} is VALID [2022-04-08 11:25:40,661 INFO L290 TraceCheckUtils]: 78: Hoare triple {16559#true} assume true; {16559#true} is VALID [2022-04-08 11:25:40,661 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {16559#true} {16786#(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; {16786#(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-08 11:25:40,661 INFO L272 TraceCheckUtils]: 80: Hoare triple {16786#(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)); {16559#true} is VALID [2022-04-08 11:25:40,661 INFO L290 TraceCheckUtils]: 81: Hoare triple {16559#true} ~cond := #in~cond; {16559#true} is VALID [2022-04-08 11:25:40,661 INFO L290 TraceCheckUtils]: 82: Hoare triple {16559#true} assume !(0 == ~cond); {16559#true} is VALID [2022-04-08 11:25:40,662 INFO L290 TraceCheckUtils]: 83: Hoare triple {16559#true} assume true; {16559#true} is VALID [2022-04-08 11:25:40,662 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {16559#true} {16786#(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; {16786#(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-08 11:25:40,662 INFO L272 TraceCheckUtils]: 85: Hoare triple {16786#(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)); {16559#true} is VALID [2022-04-08 11:25:40,662 INFO L290 TraceCheckUtils]: 86: Hoare triple {16559#true} ~cond := #in~cond; {16559#true} is VALID [2022-04-08 11:25:40,662 INFO L290 TraceCheckUtils]: 87: Hoare triple {16559#true} assume !(0 == ~cond); {16559#true} is VALID [2022-04-08 11:25:40,663 INFO L290 TraceCheckUtils]: 88: Hoare triple {16559#true} assume true; {16559#true} is VALID [2022-04-08 11:25:40,675 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {16559#true} {16786#(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; {16786#(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-08 11:25:40,676 INFO L290 TraceCheckUtils]: 90: Hoare triple {16786#(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); {16841#(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-08 11:25:40,682 INFO L290 TraceCheckUtils]: 91: Hoare triple {16841#(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; {16845#(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-08 11:25:40,683 INFO L290 TraceCheckUtils]: 92: Hoare triple {16845#(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; {16845#(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-08 11:25:40,684 INFO L290 TraceCheckUtils]: 93: Hoare triple {16845#(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 < 10);havoc #t~post6; {16845#(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-08 11:25:40,684 INFO L272 TraceCheckUtils]: 94: Hoare triple {16845#(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)); {16559#true} is VALID [2022-04-08 11:25:40,684 INFO L290 TraceCheckUtils]: 95: Hoare triple {16559#true} ~cond := #in~cond; {16559#true} is VALID [2022-04-08 11:25:40,684 INFO L290 TraceCheckUtils]: 96: Hoare triple {16559#true} assume !(0 == ~cond); {16559#true} is VALID [2022-04-08 11:25:40,684 INFO L290 TraceCheckUtils]: 97: Hoare triple {16559#true} assume true; {16559#true} is VALID [2022-04-08 11:25:40,685 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {16559#true} {16845#(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; {16845#(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-08 11:25:40,685 INFO L272 TraceCheckUtils]: 99: Hoare triple {16845#(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)); {16559#true} is VALID [2022-04-08 11:25:40,685 INFO L290 TraceCheckUtils]: 100: Hoare triple {16559#true} ~cond := #in~cond; {16559#true} is VALID [2022-04-08 11:25:40,685 INFO L290 TraceCheckUtils]: 101: Hoare triple {16559#true} assume !(0 == ~cond); {16559#true} is VALID [2022-04-08 11:25:40,685 INFO L290 TraceCheckUtils]: 102: Hoare triple {16559#true} assume true; {16559#true} is VALID [2022-04-08 11:25:40,686 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {16559#true} {16845#(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; {16845#(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-08 11:25:40,686 INFO L290 TraceCheckUtils]: 104: Hoare triple {16845#(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; {16885#(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-08 11:25:40,687 INFO L290 TraceCheckUtils]: 105: Hoare triple {16885#(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; {16885#(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-08 11:25:40,687 INFO L290 TraceCheckUtils]: 106: Hoare triple {16885#(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 < 10);havoc #t~post7; {16885#(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-08 11:25:40,690 INFO L290 TraceCheckUtils]: 107: Hoare triple {16885#(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; {16895#(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-08 11:25:40,691 INFO L290 TraceCheckUtils]: 108: Hoare triple {16895#(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; {16895#(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-08 11:25:40,692 INFO L290 TraceCheckUtils]: 109: Hoare triple {16895#(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 < 10);havoc #t~post6; {16895#(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-08 11:25:40,703 INFO L272 TraceCheckUtils]: 110: Hoare triple {16895#(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)); {16905#(exists ((v_main_~y~0_BEFORE_CALL_179 Int) (aux_div_aux_mod_aux_mod_v_main_~q~0_BEFORE_CALL_125_55_103_58 Int) (aux_div_aux_mod_v_main_~q~0_BEFORE_CALL_125_55_103 Int) (aux_div_v_main_~q~0_BEFORE_CALL_125_55 Int)) (and (< (* 2 aux_div_aux_mod_aux_mod_v_main_~q~0_BEFORE_CALL_125_55_103_58) 2) (<= (* aux_div_aux_mod_v_main_~q~0_BEFORE_CALL_125_55_103 2) (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~q~0_BEFORE_CALL_125_55_103_58) (* 2 aux_div_v_main_~q~0_BEFORE_CALL_125_55))) (< (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~q~0_BEFORE_CALL_125_55_103_58) (* 2 aux_div_v_main_~q~0_BEFORE_CALL_125_55)) (+ 2 (* aux_div_aux_mod_v_main_~q~0_BEFORE_CALL_125_55_103 2))) (= (* v_main_~y~0_BEFORE_CALL_179 aux_div_v_main_~q~0_BEFORE_CALL_125_55) (* v_main_~y~0_BEFORE_CALL_179 2)) (<= 0 (* 2 aux_div_aux_mod_aux_mod_v_main_~q~0_BEFORE_CALL_125_55_103_58)) (< (+ v_main_~y~0_BEFORE_CALL_179 (* (* v_main_~y~0_BEFORE_CALL_179 aux_div_aux_mod_aux_mod_v_main_~q~0_BEFORE_CALL_125_55_103_58) 4)) (* 2 (* aux_div_aux_mod_v_main_~q~0_BEFORE_CALL_125_55_103 v_main_~y~0_BEFORE_CALL_179))) (<= 1 |__VERIFIER_assert_#in~cond|)))} is VALID [2022-04-08 11:25:40,704 INFO L290 TraceCheckUtils]: 111: Hoare triple {16905#(exists ((v_main_~y~0_BEFORE_CALL_179 Int) (aux_div_aux_mod_aux_mod_v_main_~q~0_BEFORE_CALL_125_55_103_58 Int) (aux_div_aux_mod_v_main_~q~0_BEFORE_CALL_125_55_103 Int) (aux_div_v_main_~q~0_BEFORE_CALL_125_55 Int)) (and (< (* 2 aux_div_aux_mod_aux_mod_v_main_~q~0_BEFORE_CALL_125_55_103_58) 2) (<= (* aux_div_aux_mod_v_main_~q~0_BEFORE_CALL_125_55_103 2) (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~q~0_BEFORE_CALL_125_55_103_58) (* 2 aux_div_v_main_~q~0_BEFORE_CALL_125_55))) (< (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~q~0_BEFORE_CALL_125_55_103_58) (* 2 aux_div_v_main_~q~0_BEFORE_CALL_125_55)) (+ 2 (* aux_div_aux_mod_v_main_~q~0_BEFORE_CALL_125_55_103 2))) (= (* v_main_~y~0_BEFORE_CALL_179 aux_div_v_main_~q~0_BEFORE_CALL_125_55) (* v_main_~y~0_BEFORE_CALL_179 2)) (<= 0 (* 2 aux_div_aux_mod_aux_mod_v_main_~q~0_BEFORE_CALL_125_55_103_58)) (< (+ v_main_~y~0_BEFORE_CALL_179 (* (* v_main_~y~0_BEFORE_CALL_179 aux_div_aux_mod_aux_mod_v_main_~q~0_BEFORE_CALL_125_55_103_58) 4)) (* 2 (* aux_div_aux_mod_v_main_~q~0_BEFORE_CALL_125_55_103 v_main_~y~0_BEFORE_CALL_179))) (<= 1 |__VERIFIER_assert_#in~cond|)))} ~cond := #in~cond; {16909#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:25:40,704 INFO L290 TraceCheckUtils]: 112: Hoare triple {16909#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16560#false} is VALID [2022-04-08 11:25:40,704 INFO L290 TraceCheckUtils]: 113: Hoare triple {16560#false} assume !false; {16560#false} is VALID [2022-04-08 11:25:40,705 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-08 11:25:40,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:25:50,825 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:26:33,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:26:33,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602581896] [2022-04-08 11:26:33,280 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:26:33,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509721965] [2022-04-08 11:26:33,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509721965] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 11:26:33,280 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 11:26:33,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-04-08 11:26:33,280 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:26:33,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [584856248] [2022-04-08 11:26:33,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [584856248] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:26:33,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:26:33,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 11:26:33,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306103167] [2022-04-08 11:26:33,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:26:33,281 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-08 11:26:33,281 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:26:33,282 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-08 11:26:33,392 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-08 11:26:33,392 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 11:26:33,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:26:33,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 11:26:33,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=513, Unknown=0, NotChecked=0, Total=650 [2022-04-08 11:26:33,393 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-08 11:26:46,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:26:46,292 INFO L93 Difference]: Finished difference Result 230 states and 283 transitions. [2022-04-08 11:26:46,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 11:26:46,293 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-08 11:26:46,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:26:46,293 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-08 11:26:46,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 172 transitions. [2022-04-08 11:26:46,295 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-08 11:26:46,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 172 transitions. [2022-04-08 11:26:46,297 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 172 transitions. [2022-04-08 11:26:46,664 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:26:46,667 INFO L225 Difference]: With dead ends: 230 [2022-04-08 11:26:46,668 INFO L226 Difference]: Without dead ends: 217 [2022-04-08 11:26:46,668 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 179 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=151, Invalid=605, Unknown=0, NotChecked=0, Total=756 [2022-04-08 11:26:46,668 INFO L913 BasicCegarLoop]: 64 mSDtfsCounter, 47 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 1003 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 1048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 15 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-04-08 11:26:46,668 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 413 Invalid, 1048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1003 Invalid, 0 Unknown, 15 Unchecked, 4.7s Time] [2022-04-08 11:26:46,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-04-08 11:26:46,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 206. [2022-04-08 11:26:46,979 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:26:46,979 INFO L82 GeneralOperation]: Start isEquivalent. First operand 217 states. Second operand has 206 states, 131 states have (on average 1.1450381679389312) internal successors, (150), 132 states have internal predecessors, (150), 52 states have call successors, (52), 24 states have call predecessors, (52), 22 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2022-04-08 11:26:46,980 INFO L74 IsIncluded]: Start isIncluded. First operand 217 states. Second operand has 206 states, 131 states have (on average 1.1450381679389312) internal successors, (150), 132 states have internal predecessors, (150), 52 states have call successors, (52), 24 states have call predecessors, (52), 22 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2022-04-08 11:26:46,980 INFO L87 Difference]: Start difference. First operand 217 states. Second operand has 206 states, 131 states have (on average 1.1450381679389312) internal successors, (150), 132 states have internal predecessors, (150), 52 states have call successors, (52), 24 states have call predecessors, (52), 22 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2022-04-08 11:26:46,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:26:46,984 INFO L93 Difference]: Finished difference Result 217 states and 264 transitions. [2022-04-08 11:26:46,984 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 264 transitions. [2022-04-08 11:26:46,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:26:46,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:26:46,985 INFO L74 IsIncluded]: Start isIncluded. First operand has 206 states, 131 states have (on average 1.1450381679389312) internal successors, (150), 132 states have internal predecessors, (150), 52 states have call successors, (52), 24 states have call predecessors, (52), 22 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) Second operand 217 states. [2022-04-08 11:26:46,986 INFO L87 Difference]: Start difference. First operand has 206 states, 131 states have (on average 1.1450381679389312) internal successors, (150), 132 states have internal predecessors, (150), 52 states have call successors, (52), 24 states have call predecessors, (52), 22 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) Second operand 217 states. [2022-04-08 11:26:46,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:26:46,991 INFO L93 Difference]: Finished difference Result 217 states and 264 transitions. [2022-04-08 11:26:46,991 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 264 transitions. [2022-04-08 11:26:46,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:26:46,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:26:46,991 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:26:46,991 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:26:46,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 131 states have (on average 1.1450381679389312) internal successors, (150), 132 states have internal predecessors, (150), 52 states have call successors, (52), 24 states have call predecessors, (52), 22 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2022-04-08 11:26:46,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 252 transitions. [2022-04-08 11:26:46,996 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 252 transitions. Word has length 114 [2022-04-08 11:26:46,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:26:46,997 INFO L478 AbstractCegarLoop]: Abstraction has 206 states and 252 transitions. [2022-04-08 11:26:46,997 INFO L479 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-08 11:26:46,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 206 states and 252 transitions. [2022-04-08 11:26:47,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 252 edges. 252 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:26:47,414 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 252 transitions. [2022-04-08 11:26:47,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-08 11:26:47,415 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:26:47,415 INFO L499 BasicCegarLoop]: 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-08 11:26:47,431 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-08 11:26:47,629 WARN L460 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-08 11:26:47,629 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:26:47,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:26:47,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1338024082, now seen corresponding path program 5 times [2022-04-08 11:26:47,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:26:47,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [177681258] [2022-04-08 11:27:17,171 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:27:17,171 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:27:17,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1338024082, now seen corresponding path program 6 times [2022-04-08 11:27:17,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:27:17,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169390436] [2022-04-08 11:27:17,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:27:17,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:27:17,182 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:27:17,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [705760794] [2022-04-08 11:27:17,183 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 11:27:17,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:27:17,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:27:17,184 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-08 11:27:17,185 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-08 11:27:17,248 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-08 11:27:17,248 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:27:17,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-08 11:27:17,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:27:17,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:27:17,880 INFO L272 TraceCheckUtils]: 0: Hoare triple {18510#true} call ULTIMATE.init(); {18510#true} is VALID [2022-04-08 11:27:17,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {18510#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; {18510#true} is VALID [2022-04-08 11:27:17,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {18510#true} assume true; {18510#true} is VALID [2022-04-08 11:27:17,881 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18510#true} {18510#true} #93#return; {18510#true} is VALID [2022-04-08 11:27:17,881 INFO L272 TraceCheckUtils]: 4: Hoare triple {18510#true} call #t~ret8 := main(); {18510#true} is VALID [2022-04-08 11:27:17,881 INFO L290 TraceCheckUtils]: 5: Hoare triple {18510#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; {18510#true} is VALID [2022-04-08 11:27:17,881 INFO L272 TraceCheckUtils]: 6: Hoare triple {18510#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {18510#true} is VALID [2022-04-08 11:27:17,881 INFO L290 TraceCheckUtils]: 7: Hoare triple {18510#true} ~cond := #in~cond; {18510#true} is VALID [2022-04-08 11:27:17,881 INFO L290 TraceCheckUtils]: 8: Hoare triple {18510#true} assume !(0 == ~cond); {18510#true} is VALID [2022-04-08 11:27:17,881 INFO L290 TraceCheckUtils]: 9: Hoare triple {18510#true} assume true; {18510#true} is VALID [2022-04-08 11:27:17,881 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18510#true} {18510#true} #77#return; {18510#true} is VALID [2022-04-08 11:27:17,882 INFO L290 TraceCheckUtils]: 11: Hoare triple {18510#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {18548#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:27:17,882 INFO L290 TraceCheckUtils]: 12: Hoare triple {18548#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18548#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:27:17,882 INFO L290 TraceCheckUtils]: 13: Hoare triple {18548#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 10);havoc #t~post6; {18548#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:27:17,883 INFO L272 TraceCheckUtils]: 14: Hoare triple {18548#(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)); {18510#true} is VALID [2022-04-08 11:27:17,883 INFO L290 TraceCheckUtils]: 15: Hoare triple {18510#true} ~cond := #in~cond; {18510#true} is VALID [2022-04-08 11:27:17,883 INFO L290 TraceCheckUtils]: 16: Hoare triple {18510#true} assume !(0 == ~cond); {18510#true} is VALID [2022-04-08 11:27:17,883 INFO L290 TraceCheckUtils]: 17: Hoare triple {18510#true} assume true; {18510#true} is VALID [2022-04-08 11:27:17,883 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {18510#true} {18548#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #79#return; {18548#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:27:17,883 INFO L272 TraceCheckUtils]: 19: Hoare triple {18548#(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)); {18510#true} is VALID [2022-04-08 11:27:17,884 INFO L290 TraceCheckUtils]: 20: Hoare triple {18510#true} ~cond := #in~cond; {18510#true} is VALID [2022-04-08 11:27:17,884 INFO L290 TraceCheckUtils]: 21: Hoare triple {18510#true} assume !(0 == ~cond); {18510#true} is VALID [2022-04-08 11:27:17,884 INFO L290 TraceCheckUtils]: 22: Hoare triple {18510#true} assume true; {18510#true} is VALID [2022-04-08 11:27:17,884 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {18510#true} {18548#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #81#return; {18548#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:27:17,885 INFO L290 TraceCheckUtils]: 24: Hoare triple {18548#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {18548#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:27:17,885 INFO L290 TraceCheckUtils]: 25: Hoare triple {18548#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18548#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:27:17,885 INFO L290 TraceCheckUtils]: 26: Hoare triple {18548#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post7 < 10);havoc #t~post7; {18548#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:27:17,885 INFO L272 TraceCheckUtils]: 27: Hoare triple {18548#(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)); {18510#true} is VALID [2022-04-08 11:27:17,886 INFO L290 TraceCheckUtils]: 28: Hoare triple {18510#true} ~cond := #in~cond; {18510#true} is VALID [2022-04-08 11:27:17,886 INFO L290 TraceCheckUtils]: 29: Hoare triple {18510#true} assume !(0 == ~cond); {18510#true} is VALID [2022-04-08 11:27:17,886 INFO L290 TraceCheckUtils]: 30: Hoare triple {18510#true} assume true; {18510#true} is VALID [2022-04-08 11:27:17,886 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {18510#true} {18548#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #83#return; {18548#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:27:17,886 INFO L272 TraceCheckUtils]: 32: Hoare triple {18548#(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)); {18510#true} is VALID [2022-04-08 11:27:17,886 INFO L290 TraceCheckUtils]: 33: Hoare triple {18510#true} ~cond := #in~cond; {18510#true} is VALID [2022-04-08 11:27:17,886 INFO L290 TraceCheckUtils]: 34: Hoare triple {18510#true} assume !(0 == ~cond); {18510#true} is VALID [2022-04-08 11:27:17,887 INFO L290 TraceCheckUtils]: 35: Hoare triple {18510#true} assume true; {18510#true} is VALID [2022-04-08 11:27:17,887 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {18510#true} {18548#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #85#return; {18548#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:27:17,887 INFO L272 TraceCheckUtils]: 37: Hoare triple {18548#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {18510#true} is VALID [2022-04-08 11:27:17,887 INFO L290 TraceCheckUtils]: 38: Hoare triple {18510#true} ~cond := #in~cond; {18510#true} is VALID [2022-04-08 11:27:17,887 INFO L290 TraceCheckUtils]: 39: Hoare triple {18510#true} assume !(0 == ~cond); {18510#true} is VALID [2022-04-08 11:27:17,887 INFO L290 TraceCheckUtils]: 40: Hoare triple {18510#true} assume true; {18510#true} is VALID [2022-04-08 11:27:17,888 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {18510#true} {18548#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #87#return; {18548#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:27:17,888 INFO L290 TraceCheckUtils]: 42: Hoare triple {18548#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= 2 * ~b~0); {18548#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:27:17,888 INFO L272 TraceCheckUtils]: 43: Hoare triple {18548#(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)); {18510#true} is VALID [2022-04-08 11:27:17,888 INFO L290 TraceCheckUtils]: 44: Hoare triple {18510#true} ~cond := #in~cond; {18510#true} is VALID [2022-04-08 11:27:17,889 INFO L290 TraceCheckUtils]: 45: Hoare triple {18510#true} assume !(0 == ~cond); {18510#true} is VALID [2022-04-08 11:27:17,889 INFO L290 TraceCheckUtils]: 46: Hoare triple {18510#true} assume true; {18510#true} is VALID [2022-04-08 11:27:17,889 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {18510#true} {18548#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #89#return; {18548#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:27:17,889 INFO L290 TraceCheckUtils]: 48: Hoare triple {18548#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {18548#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:27:17,890 INFO L290 TraceCheckUtils]: 49: Hoare triple {18548#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18548#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:27:17,890 INFO L290 TraceCheckUtils]: 50: Hoare triple {18548#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post7 < 10);havoc #t~post7; {18548#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:27:17,890 INFO L272 TraceCheckUtils]: 51: Hoare triple {18548#(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)); {18510#true} is VALID [2022-04-08 11:27:17,890 INFO L290 TraceCheckUtils]: 52: Hoare triple {18510#true} ~cond := #in~cond; {18510#true} is VALID [2022-04-08 11:27:17,890 INFO L290 TraceCheckUtils]: 53: Hoare triple {18510#true} assume !(0 == ~cond); {18510#true} is VALID [2022-04-08 11:27:17,891 INFO L290 TraceCheckUtils]: 54: Hoare triple {18510#true} assume true; {18510#true} is VALID [2022-04-08 11:27:17,891 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {18510#true} {18548#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #83#return; {18548#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:27:17,891 INFO L272 TraceCheckUtils]: 56: Hoare triple {18548#(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)); {18510#true} is VALID [2022-04-08 11:27:17,891 INFO L290 TraceCheckUtils]: 57: Hoare triple {18510#true} ~cond := #in~cond; {18510#true} is VALID [2022-04-08 11:27:17,891 INFO L290 TraceCheckUtils]: 58: Hoare triple {18510#true} assume !(0 == ~cond); {18510#true} is VALID [2022-04-08 11:27:17,891 INFO L290 TraceCheckUtils]: 59: Hoare triple {18510#true} assume true; {18510#true} is VALID [2022-04-08 11:27:17,892 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {18510#true} {18548#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #85#return; {18548#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:27:17,892 INFO L272 TraceCheckUtils]: 61: Hoare triple {18548#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {18510#true} is VALID [2022-04-08 11:27:17,892 INFO L290 TraceCheckUtils]: 62: Hoare triple {18510#true} ~cond := #in~cond; {18510#true} is VALID [2022-04-08 11:27:17,892 INFO L290 TraceCheckUtils]: 63: Hoare triple {18510#true} assume !(0 == ~cond); {18510#true} is VALID [2022-04-08 11:27:17,892 INFO L290 TraceCheckUtils]: 64: Hoare triple {18510#true} assume true; {18510#true} is VALID [2022-04-08 11:27:17,893 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {18510#true} {18548#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #87#return; {18548#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:27:17,893 INFO L290 TraceCheckUtils]: 66: Hoare triple {18548#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= 2 * ~b~0); {18548#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:27:17,893 INFO L272 TraceCheckUtils]: 67: Hoare triple {18548#(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)); {18510#true} is VALID [2022-04-08 11:27:17,893 INFO L290 TraceCheckUtils]: 68: Hoare triple {18510#true} ~cond := #in~cond; {18510#true} is VALID [2022-04-08 11:27:17,893 INFO L290 TraceCheckUtils]: 69: Hoare triple {18510#true} assume !(0 == ~cond); {18510#true} is VALID [2022-04-08 11:27:17,893 INFO L290 TraceCheckUtils]: 70: Hoare triple {18510#true} assume true; {18510#true} is VALID [2022-04-08 11:27:17,894 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {18510#true} {18548#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #89#return; {18548#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:27:17,894 INFO L290 TraceCheckUtils]: 72: Hoare triple {18548#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {18548#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:27:17,895 INFO L290 TraceCheckUtils]: 73: Hoare triple {18548#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18548#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:27:17,895 INFO L290 TraceCheckUtils]: 74: Hoare triple {18548#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post7 < 10);havoc #t~post7; {18548#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:27:17,895 INFO L272 TraceCheckUtils]: 75: Hoare triple {18548#(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)); {18510#true} is VALID [2022-04-08 11:27:17,895 INFO L290 TraceCheckUtils]: 76: Hoare triple {18510#true} ~cond := #in~cond; {18510#true} is VALID [2022-04-08 11:27:17,895 INFO L290 TraceCheckUtils]: 77: Hoare triple {18510#true} assume !(0 == ~cond); {18510#true} is VALID [2022-04-08 11:27:17,895 INFO L290 TraceCheckUtils]: 78: Hoare triple {18510#true} assume true; {18510#true} is VALID [2022-04-08 11:27:17,896 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {18510#true} {18548#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #83#return; {18548#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:27:17,896 INFO L272 TraceCheckUtils]: 80: Hoare triple {18548#(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)); {18510#true} is VALID [2022-04-08 11:27:17,896 INFO L290 TraceCheckUtils]: 81: Hoare triple {18510#true} ~cond := #in~cond; {18510#true} is VALID [2022-04-08 11:27:17,896 INFO L290 TraceCheckUtils]: 82: Hoare triple {18510#true} assume !(0 == ~cond); {18510#true} is VALID [2022-04-08 11:27:17,896 INFO L290 TraceCheckUtils]: 83: Hoare triple {18510#true} assume true; {18510#true} is VALID [2022-04-08 11:27:17,897 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {18510#true} {18548#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #85#return; {18548#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:27:17,897 INFO L272 TraceCheckUtils]: 85: Hoare triple {18548#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {18510#true} is VALID [2022-04-08 11:27:17,897 INFO L290 TraceCheckUtils]: 86: Hoare triple {18510#true} ~cond := #in~cond; {18510#true} is VALID [2022-04-08 11:27:17,897 INFO L290 TraceCheckUtils]: 87: Hoare triple {18510#true} assume !(0 == ~cond); {18510#true} is VALID [2022-04-08 11:27:17,897 INFO L290 TraceCheckUtils]: 88: Hoare triple {18510#true} assume true; {18510#true} is VALID [2022-04-08 11:27:17,898 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {18510#true} {18548#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #87#return; {18548#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:27:17,898 INFO L290 TraceCheckUtils]: 90: Hoare triple {18548#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= 2 * ~b~0); {18548#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:27:17,898 INFO L272 TraceCheckUtils]: 91: Hoare triple {18548#(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)); {18510#true} is VALID [2022-04-08 11:27:17,898 INFO L290 TraceCheckUtils]: 92: Hoare triple {18510#true} ~cond := #in~cond; {18510#true} is VALID [2022-04-08 11:27:17,898 INFO L290 TraceCheckUtils]: 93: Hoare triple {18510#true} assume !(0 == ~cond); {18510#true} is VALID [2022-04-08 11:27:17,898 INFO L290 TraceCheckUtils]: 94: Hoare triple {18510#true} assume true; {18510#true} is VALID [2022-04-08 11:27:17,899 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {18510#true} {18548#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #89#return; {18548#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:27:17,900 INFO L290 TraceCheckUtils]: 96: Hoare triple {18548#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {18804#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:27:17,900 INFO L290 TraceCheckUtils]: 97: Hoare triple {18804#(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; {18804#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:27:17,901 INFO L290 TraceCheckUtils]: 98: Hoare triple {18804#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post7 < 10);havoc #t~post7; {18804#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 11:27:17,901 INFO L272 TraceCheckUtils]: 99: Hoare triple {18804#(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)); {18510#true} is VALID [2022-04-08 11:27:17,901 INFO L290 TraceCheckUtils]: 100: Hoare triple {18510#true} ~cond := #in~cond; {18817#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:27:17,901 INFO L290 TraceCheckUtils]: 101: Hoare triple {18817#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {18821#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:27:17,902 INFO L290 TraceCheckUtils]: 102: Hoare triple {18821#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18821#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:27:17,903 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {18821#(not (= |__VERIFIER_assert_#in~cond| 0))} {18804#(and (= (mod main_~a~0 2) 0) (= main_~x~0 main_~r~0) (= main_~q~0 0))} #83#return; {18828#(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-08 11:27:17,903 INFO L272 TraceCheckUtils]: 104: Hoare triple {18828#(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)); {18510#true} is VALID [2022-04-08 11:27:17,903 INFO L290 TraceCheckUtils]: 105: Hoare triple {18510#true} ~cond := #in~cond; {18510#true} is VALID [2022-04-08 11:27:17,903 INFO L290 TraceCheckUtils]: 106: Hoare triple {18510#true} assume !(0 == ~cond); {18510#true} is VALID [2022-04-08 11:27:17,903 INFO L290 TraceCheckUtils]: 107: Hoare triple {18510#true} assume true; {18510#true} is VALID [2022-04-08 11:27:17,904 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {18510#true} {18828#(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; {18828#(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-08 11:27:17,904 INFO L272 TraceCheckUtils]: 109: Hoare triple {18828#(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)); {18510#true} is VALID [2022-04-08 11:27:17,904 INFO L290 TraceCheckUtils]: 110: Hoare triple {18510#true} ~cond := #in~cond; {18510#true} is VALID [2022-04-08 11:27:17,904 INFO L290 TraceCheckUtils]: 111: Hoare triple {18510#true} assume !(0 == ~cond); {18510#true} is VALID [2022-04-08 11:27:17,904 INFO L290 TraceCheckUtils]: 112: Hoare triple {18510#true} assume true; {18510#true} is VALID [2022-04-08 11:27:17,905 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {18510#true} {18828#(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; {18828#(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-08 11:27:17,905 INFO L290 TraceCheckUtils]: 114: Hoare triple {18828#(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); {18828#(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-08 11:27:17,908 INFO L290 TraceCheckUtils]: 115: Hoare triple {18828#(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; {18865#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0)) (= (mod main_~q~0 2) 0))} is VALID [2022-04-08 11:27:17,908 INFO L290 TraceCheckUtils]: 116: Hoare triple {18865#(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; {18865#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0)) (= (mod main_~q~0 2) 0))} is VALID [2022-04-08 11:27:17,909 INFO L290 TraceCheckUtils]: 117: Hoare triple {18865#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0)) (= (mod main_~q~0 2) 0))} assume !(#t~post6 < 10);havoc #t~post6; {18865#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) (* main_~q~0 main_~y~0)) (= (mod main_~q~0 2) 0))} is VALID [2022-04-08 11:27:17,909 INFO L272 TraceCheckUtils]: 118: Hoare triple {18865#(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)); {18875#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:27:17,910 INFO L290 TraceCheckUtils]: 119: Hoare triple {18875#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18879#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:27:17,910 INFO L290 TraceCheckUtils]: 120: Hoare triple {18879#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18511#false} is VALID [2022-04-08 11:27:17,910 INFO L290 TraceCheckUtils]: 121: Hoare triple {18511#false} assume !false; {18511#false} is VALID [2022-04-08 11:27:17,911 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-08 11:27:17,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:27:22,597 INFO L290 TraceCheckUtils]: 121: Hoare triple {18511#false} assume !false; {18511#false} is VALID [2022-04-08 11:27:22,598 INFO L290 TraceCheckUtils]: 120: Hoare triple {18879#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18511#false} is VALID [2022-04-08 11:27:22,598 INFO L290 TraceCheckUtils]: 119: Hoare triple {18875#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18879#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:27:22,599 INFO L272 TraceCheckUtils]: 118: Hoare triple {18895#(= (+ (* 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)); {18875#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:27:22,599 INFO L290 TraceCheckUtils]: 117: Hoare triple {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !(#t~post6 < 10);havoc #t~post6; {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:27:22,599 INFO L290 TraceCheckUtils]: 116: Hoare triple {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:27:22,606 INFO L290 TraceCheckUtils]: 115: Hoare triple {18905#(= 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; {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:27:22,607 INFO L290 TraceCheckUtils]: 114: Hoare triple {18905#(= 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); {18905#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-08 11:27:22,607 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {18510#true} {18905#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} #87#return; {18905#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-08 11:27:22,607 INFO L290 TraceCheckUtils]: 112: Hoare triple {18510#true} assume true; {18510#true} is VALID [2022-04-08 11:27:22,607 INFO L290 TraceCheckUtils]: 111: Hoare triple {18510#true} assume !(0 == ~cond); {18510#true} is VALID [2022-04-08 11:27:22,608 INFO L290 TraceCheckUtils]: 110: Hoare triple {18510#true} ~cond := #in~cond; {18510#true} is VALID [2022-04-08 11:27:22,608 INFO L272 TraceCheckUtils]: 109: Hoare triple {18905#(= 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)); {18510#true} is VALID [2022-04-08 11:27:22,608 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {18510#true} {18905#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} #85#return; {18905#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-08 11:27:22,608 INFO L290 TraceCheckUtils]: 107: Hoare triple {18510#true} assume true; {18510#true} is VALID [2022-04-08 11:27:22,608 INFO L290 TraceCheckUtils]: 106: Hoare triple {18510#true} assume !(0 == ~cond); {18510#true} is VALID [2022-04-08 11:27:22,608 INFO L290 TraceCheckUtils]: 105: Hoare triple {18510#true} ~cond := #in~cond; {18510#true} is VALID [2022-04-08 11:27:22,608 INFO L272 TraceCheckUtils]: 104: Hoare triple {18905#(= 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)); {18510#true} is VALID [2022-04-08 11:27:22,609 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {18821#(not (= |__VERIFIER_assert_#in~cond| 0))} {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #83#return; {18905#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-08 11:27:22,610 INFO L290 TraceCheckUtils]: 102: Hoare triple {18821#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18821#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:27:22,610 INFO L290 TraceCheckUtils]: 101: Hoare triple {18951#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {18821#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:27:22,610 INFO L290 TraceCheckUtils]: 100: Hoare triple {18510#true} ~cond := #in~cond; {18951#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 11:27:22,610 INFO L272 TraceCheckUtils]: 99: Hoare triple {18895#(= (+ (* 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)); {18510#true} is VALID [2022-04-08 11:27:22,611 INFO L290 TraceCheckUtils]: 98: Hoare triple {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(#t~post7 < 10);havoc #t~post7; {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:27:22,611 INFO L290 TraceCheckUtils]: 97: Hoare triple {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:27:22,611 INFO L290 TraceCheckUtils]: 96: Hoare triple {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:27:22,612 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {18510#true} {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #89#return; {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:27:22,612 INFO L290 TraceCheckUtils]: 94: Hoare triple {18510#true} assume true; {18510#true} is VALID [2022-04-08 11:27:22,612 INFO L290 TraceCheckUtils]: 93: Hoare triple {18510#true} assume !(0 == ~cond); {18510#true} is VALID [2022-04-08 11:27:22,612 INFO L290 TraceCheckUtils]: 92: Hoare triple {18510#true} ~cond := #in~cond; {18510#true} is VALID [2022-04-08 11:27:22,612 INFO L272 TraceCheckUtils]: 91: Hoare triple {18895#(= (+ (* 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)); {18510#true} is VALID [2022-04-08 11:27:22,612 INFO L290 TraceCheckUtils]: 90: Hoare triple {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(~r~0 >= 2 * ~b~0); {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:27:22,613 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {18510#true} {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #87#return; {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:27:22,613 INFO L290 TraceCheckUtils]: 88: Hoare triple {18510#true} assume true; {18510#true} is VALID [2022-04-08 11:27:22,613 INFO L290 TraceCheckUtils]: 87: Hoare triple {18510#true} assume !(0 == ~cond); {18510#true} is VALID [2022-04-08 11:27:22,613 INFO L290 TraceCheckUtils]: 86: Hoare triple {18510#true} ~cond := #in~cond; {18510#true} is VALID [2022-04-08 11:27:22,613 INFO L272 TraceCheckUtils]: 85: Hoare triple {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {18510#true} is VALID [2022-04-08 11:27:22,614 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {18510#true} {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #85#return; {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:27:22,614 INFO L290 TraceCheckUtils]: 83: Hoare triple {18510#true} assume true; {18510#true} is VALID [2022-04-08 11:27:22,614 INFO L290 TraceCheckUtils]: 82: Hoare triple {18510#true} assume !(0 == ~cond); {18510#true} is VALID [2022-04-08 11:27:22,614 INFO L290 TraceCheckUtils]: 81: Hoare triple {18510#true} ~cond := #in~cond; {18510#true} is VALID [2022-04-08 11:27:22,614 INFO L272 TraceCheckUtils]: 80: Hoare triple {18895#(= (+ (* 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)); {18510#true} is VALID [2022-04-08 11:27:22,614 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {18510#true} {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #83#return; {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:27:22,615 INFO L290 TraceCheckUtils]: 78: Hoare triple {18510#true} assume true; {18510#true} is VALID [2022-04-08 11:27:22,615 INFO L290 TraceCheckUtils]: 77: Hoare triple {18510#true} assume !(0 == ~cond); {18510#true} is VALID [2022-04-08 11:27:22,615 INFO L290 TraceCheckUtils]: 76: Hoare triple {18510#true} ~cond := #in~cond; {18510#true} is VALID [2022-04-08 11:27:22,615 INFO L272 TraceCheckUtils]: 75: Hoare triple {18895#(= (+ (* 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)); {18510#true} is VALID [2022-04-08 11:27:22,615 INFO L290 TraceCheckUtils]: 74: Hoare triple {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(#t~post7 < 10);havoc #t~post7; {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:27:22,615 INFO L290 TraceCheckUtils]: 73: Hoare triple {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:27:22,616 INFO L290 TraceCheckUtils]: 72: Hoare triple {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:27:22,616 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {18510#true} {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #89#return; {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:27:22,616 INFO L290 TraceCheckUtils]: 70: Hoare triple {18510#true} assume true; {18510#true} is VALID [2022-04-08 11:27:22,616 INFO L290 TraceCheckUtils]: 69: Hoare triple {18510#true} assume !(0 == ~cond); {18510#true} is VALID [2022-04-08 11:27:22,616 INFO L290 TraceCheckUtils]: 68: Hoare triple {18510#true} ~cond := #in~cond; {18510#true} is VALID [2022-04-08 11:27:22,617 INFO L272 TraceCheckUtils]: 67: Hoare triple {18895#(= (+ (* 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)); {18510#true} is VALID [2022-04-08 11:27:22,617 INFO L290 TraceCheckUtils]: 66: Hoare triple {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(~r~0 >= 2 * ~b~0); {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:27:22,617 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {18510#true} {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #87#return; {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:27:22,617 INFO L290 TraceCheckUtils]: 64: Hoare triple {18510#true} assume true; {18510#true} is VALID [2022-04-08 11:27:22,617 INFO L290 TraceCheckUtils]: 63: Hoare triple {18510#true} assume !(0 == ~cond); {18510#true} is VALID [2022-04-08 11:27:22,618 INFO L290 TraceCheckUtils]: 62: Hoare triple {18510#true} ~cond := #in~cond; {18510#true} is VALID [2022-04-08 11:27:22,618 INFO L272 TraceCheckUtils]: 61: Hoare triple {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {18510#true} is VALID [2022-04-08 11:27:22,618 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {18510#true} {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #85#return; {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:27:22,618 INFO L290 TraceCheckUtils]: 59: Hoare triple {18510#true} assume true; {18510#true} is VALID [2022-04-08 11:27:22,618 INFO L290 TraceCheckUtils]: 58: Hoare triple {18510#true} assume !(0 == ~cond); {18510#true} is VALID [2022-04-08 11:27:22,618 INFO L290 TraceCheckUtils]: 57: Hoare triple {18510#true} ~cond := #in~cond; {18510#true} is VALID [2022-04-08 11:27:22,618 INFO L272 TraceCheckUtils]: 56: Hoare triple {18895#(= (+ (* 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)); {18510#true} is VALID [2022-04-08 11:27:22,619 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {18510#true} {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #83#return; {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:27:22,619 INFO L290 TraceCheckUtils]: 54: Hoare triple {18510#true} assume true; {18510#true} is VALID [2022-04-08 11:27:22,619 INFO L290 TraceCheckUtils]: 53: Hoare triple {18510#true} assume !(0 == ~cond); {18510#true} is VALID [2022-04-08 11:27:22,619 INFO L290 TraceCheckUtils]: 52: Hoare triple {18510#true} ~cond := #in~cond; {18510#true} is VALID [2022-04-08 11:27:22,619 INFO L272 TraceCheckUtils]: 51: Hoare triple {18895#(= (+ (* 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)); {18510#true} is VALID [2022-04-08 11:27:22,620 INFO L290 TraceCheckUtils]: 50: Hoare triple {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(#t~post7 < 10);havoc #t~post7; {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:27:22,620 INFO L290 TraceCheckUtils]: 49: Hoare triple {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:27:22,620 INFO L290 TraceCheckUtils]: 48: Hoare triple {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:27:22,621 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {18510#true} {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #89#return; {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:27:22,621 INFO L290 TraceCheckUtils]: 46: Hoare triple {18510#true} assume true; {18510#true} is VALID [2022-04-08 11:27:22,621 INFO L290 TraceCheckUtils]: 45: Hoare triple {18510#true} assume !(0 == ~cond); {18510#true} is VALID [2022-04-08 11:27:22,621 INFO L290 TraceCheckUtils]: 44: Hoare triple {18510#true} ~cond := #in~cond; {18510#true} is VALID [2022-04-08 11:27:22,621 INFO L272 TraceCheckUtils]: 43: Hoare triple {18895#(= (+ (* 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)); {18510#true} is VALID [2022-04-08 11:27:22,621 INFO L290 TraceCheckUtils]: 42: Hoare triple {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(~r~0 >= 2 * ~b~0); {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:27:22,622 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {18510#true} {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #87#return; {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:27:22,622 INFO L290 TraceCheckUtils]: 40: Hoare triple {18510#true} assume true; {18510#true} is VALID [2022-04-08 11:27:22,622 INFO L290 TraceCheckUtils]: 39: Hoare triple {18510#true} assume !(0 == ~cond); {18510#true} is VALID [2022-04-08 11:27:22,622 INFO L290 TraceCheckUtils]: 38: Hoare triple {18510#true} ~cond := #in~cond; {18510#true} is VALID [2022-04-08 11:27:22,622 INFO L272 TraceCheckUtils]: 37: Hoare triple {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {18510#true} is VALID [2022-04-08 11:27:22,623 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {18510#true} {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #85#return; {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:27:22,623 INFO L290 TraceCheckUtils]: 35: Hoare triple {18510#true} assume true; {18510#true} is VALID [2022-04-08 11:27:22,623 INFO L290 TraceCheckUtils]: 34: Hoare triple {18510#true} assume !(0 == ~cond); {18510#true} is VALID [2022-04-08 11:27:22,623 INFO L290 TraceCheckUtils]: 33: Hoare triple {18510#true} ~cond := #in~cond; {18510#true} is VALID [2022-04-08 11:27:22,623 INFO L272 TraceCheckUtils]: 32: Hoare triple {18895#(= (+ (* 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)); {18510#true} is VALID [2022-04-08 11:27:22,623 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {18510#true} {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #83#return; {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:27:22,624 INFO L290 TraceCheckUtils]: 30: Hoare triple {18510#true} assume true; {18510#true} is VALID [2022-04-08 11:27:22,624 INFO L290 TraceCheckUtils]: 29: Hoare triple {18510#true} assume !(0 == ~cond); {18510#true} is VALID [2022-04-08 11:27:22,624 INFO L290 TraceCheckUtils]: 28: Hoare triple {18510#true} ~cond := #in~cond; {18510#true} is VALID [2022-04-08 11:27:22,624 INFO L272 TraceCheckUtils]: 27: Hoare triple {18895#(= (+ (* 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)); {18510#true} is VALID [2022-04-08 11:27:22,624 INFO L290 TraceCheckUtils]: 26: Hoare triple {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(#t~post7 < 10);havoc #t~post7; {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:27:22,624 INFO L290 TraceCheckUtils]: 25: Hoare triple {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:27:22,625 INFO L290 TraceCheckUtils]: 24: Hoare triple {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:27:22,625 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {18510#true} {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #81#return; {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:27:22,625 INFO L290 TraceCheckUtils]: 22: Hoare triple {18510#true} assume true; {18510#true} is VALID [2022-04-08 11:27:22,625 INFO L290 TraceCheckUtils]: 21: Hoare triple {18510#true} assume !(0 == ~cond); {18510#true} is VALID [2022-04-08 11:27:22,625 INFO L290 TraceCheckUtils]: 20: Hoare triple {18510#true} ~cond := #in~cond; {18510#true} is VALID [2022-04-08 11:27:22,626 INFO L272 TraceCheckUtils]: 19: Hoare triple {18895#(= (+ (* 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)); {18510#true} is VALID [2022-04-08 11:27:22,626 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {18510#true} {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #79#return; {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:27:22,626 INFO L290 TraceCheckUtils]: 17: Hoare triple {18510#true} assume true; {18510#true} is VALID [2022-04-08 11:27:22,626 INFO L290 TraceCheckUtils]: 16: Hoare triple {18510#true} assume !(0 == ~cond); {18510#true} is VALID [2022-04-08 11:27:22,626 INFO L290 TraceCheckUtils]: 15: Hoare triple {18510#true} ~cond := #in~cond; {18510#true} is VALID [2022-04-08 11:27:22,626 INFO L272 TraceCheckUtils]: 14: Hoare triple {18895#(= (+ (* 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)); {18510#true} is VALID [2022-04-08 11:27:22,627 INFO L290 TraceCheckUtils]: 13: Hoare triple {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(#t~post6 < 10);havoc #t~post6; {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:27:22,627 INFO L290 TraceCheckUtils]: 12: Hoare triple {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:27:22,627 INFO L290 TraceCheckUtils]: 11: Hoare triple {18510#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {18895#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-08 11:27:22,627 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18510#true} {18510#true} #77#return; {18510#true} is VALID [2022-04-08 11:27:22,628 INFO L290 TraceCheckUtils]: 9: Hoare triple {18510#true} assume true; {18510#true} is VALID [2022-04-08 11:27:22,628 INFO L290 TraceCheckUtils]: 8: Hoare triple {18510#true} assume !(0 == ~cond); {18510#true} is VALID [2022-04-08 11:27:22,628 INFO L290 TraceCheckUtils]: 7: Hoare triple {18510#true} ~cond := #in~cond; {18510#true} is VALID [2022-04-08 11:27:22,628 INFO L272 TraceCheckUtils]: 6: Hoare triple {18510#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {18510#true} is VALID [2022-04-08 11:27:22,628 INFO L290 TraceCheckUtils]: 5: Hoare triple {18510#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; {18510#true} is VALID [2022-04-08 11:27:22,628 INFO L272 TraceCheckUtils]: 4: Hoare triple {18510#true} call #t~ret8 := main(); {18510#true} is VALID [2022-04-08 11:27:22,628 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18510#true} {18510#true} #93#return; {18510#true} is VALID [2022-04-08 11:27:22,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {18510#true} assume true; {18510#true} is VALID [2022-04-08 11:27:22,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {18510#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; {18510#true} is VALID [2022-04-08 11:27:22,628 INFO L272 TraceCheckUtils]: 0: Hoare triple {18510#true} call ULTIMATE.init(); {18510#true} is VALID [2022-04-08 11:27:22,629 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-08 11:27:22,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:27:22,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169390436] [2022-04-08 11:27:22,629 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:27:22,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705760794] [2022-04-08 11:27:22,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705760794] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:27:22,629 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:27:22,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 13 [2022-04-08 11:27:22,630 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:27:22,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [177681258] [2022-04-08 11:27:22,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [177681258] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:27:22,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:27:22,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 11:27:22,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890559406] [2022-04-08 11:27:22,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:27:22,630 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-08 11:27:22,631 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:27:22,631 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-08 11:27:22,672 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-08 11:27:22,672 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 11:27:22,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:27:22,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 11:27:22,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-04-08 11:27:22,673 INFO L87 Difference]: Start difference. First operand 206 states and 252 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-08 11:27:24,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:27:24,168 INFO L93 Difference]: Finished difference Result 240 states and 299 transitions. [2022-04-08 11:27:24,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 11:27:24,168 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-08 11:27:24,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:27:24,169 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-08 11:27:24,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2022-04-08 11:27:24,170 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-08 11:27:24,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2022-04-08 11:27:24,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 110 transitions. [2022-04-08 11:27:24,274 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-08 11:27:24,278 INFO L225 Difference]: With dead ends: 240 [2022-04-08 11:27:24,278 INFO L226 Difference]: Without dead ends: 237 [2022-04-08 11:27:24,279 INFO L912 BasicCegarLoop]: 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-08 11:27:24,279 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 35 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 11:27:24,279 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 185 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 11:27:24,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-04-08 11:27:24,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 234. [2022-04-08 11:27:24,630 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:27:24,630 INFO L82 GeneralOperation]: Start isEquivalent. First operand 237 states. Second operand has 234 states, 148 states have (on average 1.1554054054054055) internal successors, (171), 149 states have internal predecessors, (171), 61 states have call successors, (61), 26 states have call predecessors, (61), 24 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2022-04-08 11:27:24,631 INFO L74 IsIncluded]: Start isIncluded. First operand 237 states. Second operand has 234 states, 148 states have (on average 1.1554054054054055) internal successors, (171), 149 states have internal predecessors, (171), 61 states have call successors, (61), 26 states have call predecessors, (61), 24 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2022-04-08 11:27:24,631 INFO L87 Difference]: Start difference. First operand 237 states. Second operand has 234 states, 148 states have (on average 1.1554054054054055) internal successors, (171), 149 states have internal predecessors, (171), 61 states have call successors, (61), 26 states have call predecessors, (61), 24 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2022-04-08 11:27:24,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:27:24,636 INFO L93 Difference]: Finished difference Result 237 states and 294 transitions. [2022-04-08 11:27:24,636 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 294 transitions. [2022-04-08 11:27:24,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:27:24,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:27:24,637 INFO L74 IsIncluded]: Start isIncluded. First operand has 234 states, 148 states have (on average 1.1554054054054055) internal successors, (171), 149 states have internal predecessors, (171), 61 states have call successors, (61), 26 states have call predecessors, (61), 24 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) Second operand 237 states. [2022-04-08 11:27:24,637 INFO L87 Difference]: Start difference. First operand has 234 states, 148 states have (on average 1.1554054054054055) internal successors, (171), 149 states have internal predecessors, (171), 61 states have call successors, (61), 26 states have call predecessors, (61), 24 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) Second operand 237 states. [2022-04-08 11:27:24,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:27:24,640 INFO L93 Difference]: Finished difference Result 237 states and 294 transitions. [2022-04-08 11:27:24,640 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 294 transitions. [2022-04-08 11:27:24,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:27:24,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:27:24,641 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:27:24,641 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:27:24,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 148 states have (on average 1.1554054054054055) internal successors, (171), 149 states have internal predecessors, (171), 61 states have call successors, (61), 26 states have call predecessors, (61), 24 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2022-04-08 11:27:24,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 291 transitions. [2022-04-08 11:27:24,645 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 291 transitions. Word has length 122 [2022-04-08 11:27:24,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:27:24,645 INFO L478 AbstractCegarLoop]: Abstraction has 234 states and 291 transitions. [2022-04-08 11:27:24,646 INFO L479 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-08 11:27:24,646 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 234 states and 291 transitions. [2022-04-08 11:27:25,108 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 291 edges. 291 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:27:25,108 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 291 transitions. [2022-04-08 11:27:25,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-04-08 11:27:25,109 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:27:25,109 INFO L499 BasicCegarLoop]: 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-08 11:27:25,127 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-08 11:27:25,325 WARN L460 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-08 11:27:25,327 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:27:25,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:27:25,327 INFO L85 PathProgramCache]: Analyzing trace with hash -877539457, now seen corresponding path program 5 times [2022-04-08 11:27:25,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:27:25,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1178418657] [2022-04-08 11:28:04,322 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:28:04,323 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:28:04,323 INFO L85 PathProgramCache]: Analyzing trace with hash -877539457, now seen corresponding path program 6 times [2022-04-08 11:28:04,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:28:04,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317818321] [2022-04-08 11:28:04,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:28:04,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:28:04,336 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:28:04,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [158207117] [2022-04-08 11:28:04,337 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 11:28:04,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:28:04,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:28:04,338 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-08 11:28:04,339 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-08 11:28:04,392 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 11:28:04,393 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:28:04,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-08 11:28:04,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:28:04,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:28:04,634 INFO L272 TraceCheckUtils]: 0: Hoare triple {20680#true} call ULTIMATE.init(); {20680#true} is VALID [2022-04-08 11:28:04,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {20680#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; {20680#true} is VALID [2022-04-08 11:28:04,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {20680#true} assume true; {20680#true} is VALID [2022-04-08 11:28:04,634 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20680#true} {20680#true} #93#return; {20680#true} is VALID [2022-04-08 11:28:04,634 INFO L272 TraceCheckUtils]: 4: Hoare triple {20680#true} call #t~ret8 := main(); {20680#true} is VALID [2022-04-08 11:28:04,634 INFO L290 TraceCheckUtils]: 5: Hoare triple {20680#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; {20680#true} is VALID [2022-04-08 11:28:04,634 INFO L272 TraceCheckUtils]: 6: Hoare triple {20680#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {20680#true} is VALID [2022-04-08 11:28:04,634 INFO L290 TraceCheckUtils]: 7: Hoare triple {20680#true} ~cond := #in~cond; {20680#true} is VALID [2022-04-08 11:28:04,634 INFO L290 TraceCheckUtils]: 8: Hoare triple {20680#true} assume !(0 == ~cond); {20680#true} is VALID [2022-04-08 11:28:04,635 INFO L290 TraceCheckUtils]: 9: Hoare triple {20680#true} assume true; {20680#true} is VALID [2022-04-08 11:28:04,635 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20680#true} {20680#true} #77#return; {20680#true} is VALID [2022-04-08 11:28:04,635 INFO L290 TraceCheckUtils]: 11: Hoare triple {20680#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {20680#true} is VALID [2022-04-08 11:28:04,635 INFO L290 TraceCheckUtils]: 12: Hoare triple {20680#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20680#true} is VALID [2022-04-08 11:28:04,635 INFO L290 TraceCheckUtils]: 13: Hoare triple {20680#true} assume !!(#t~post6 < 10);havoc #t~post6; {20680#true} is VALID [2022-04-08 11:28:04,635 INFO L272 TraceCheckUtils]: 14: Hoare triple {20680#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {20680#true} is VALID [2022-04-08 11:28:04,635 INFO L290 TraceCheckUtils]: 15: Hoare triple {20680#true} ~cond := #in~cond; {20680#true} is VALID [2022-04-08 11:28:04,635 INFO L290 TraceCheckUtils]: 16: Hoare triple {20680#true} assume !(0 == ~cond); {20680#true} is VALID [2022-04-08 11:28:04,635 INFO L290 TraceCheckUtils]: 17: Hoare triple {20680#true} assume true; {20680#true} is VALID [2022-04-08 11:28:04,635 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {20680#true} {20680#true} #79#return; {20680#true} is VALID [2022-04-08 11:28:04,636 INFO L272 TraceCheckUtils]: 19: Hoare triple {20680#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {20680#true} is VALID [2022-04-08 11:28:04,636 INFO L290 TraceCheckUtils]: 20: Hoare triple {20680#true} ~cond := #in~cond; {20680#true} is VALID [2022-04-08 11:28:04,636 INFO L290 TraceCheckUtils]: 21: Hoare triple {20680#true} assume !(0 == ~cond); {20680#true} is VALID [2022-04-08 11:28:04,636 INFO L290 TraceCheckUtils]: 22: Hoare triple {20680#true} assume true; {20680#true} is VALID [2022-04-08 11:28:04,636 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {20680#true} {20680#true} #81#return; {20680#true} is VALID [2022-04-08 11:28:04,636 INFO L290 TraceCheckUtils]: 24: Hoare triple {20680#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {20680#true} is VALID [2022-04-08 11:28:04,636 INFO L290 TraceCheckUtils]: 25: Hoare triple {20680#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20680#true} is VALID [2022-04-08 11:28:04,636 INFO L290 TraceCheckUtils]: 26: Hoare triple {20680#true} assume !!(#t~post7 < 10);havoc #t~post7; {20680#true} is VALID [2022-04-08 11:28:04,636 INFO L272 TraceCheckUtils]: 27: Hoare triple {20680#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {20680#true} is VALID [2022-04-08 11:28:04,636 INFO L290 TraceCheckUtils]: 28: Hoare triple {20680#true} ~cond := #in~cond; {20680#true} is VALID [2022-04-08 11:28:04,637 INFO L290 TraceCheckUtils]: 29: Hoare triple {20680#true} assume !(0 == ~cond); {20680#true} is VALID [2022-04-08 11:28:04,637 INFO L290 TraceCheckUtils]: 30: Hoare triple {20680#true} assume true; {20680#true} is VALID [2022-04-08 11:28:04,637 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {20680#true} {20680#true} #83#return; {20680#true} is VALID [2022-04-08 11:28:04,637 INFO L272 TraceCheckUtils]: 32: Hoare triple {20680#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {20680#true} is VALID [2022-04-08 11:28:04,637 INFO L290 TraceCheckUtils]: 33: Hoare triple {20680#true} ~cond := #in~cond; {20680#true} is VALID [2022-04-08 11:28:04,637 INFO L290 TraceCheckUtils]: 34: Hoare triple {20680#true} assume !(0 == ~cond); {20680#true} is VALID [2022-04-08 11:28:04,637 INFO L290 TraceCheckUtils]: 35: Hoare triple {20680#true} assume true; {20680#true} is VALID [2022-04-08 11:28:04,637 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {20680#true} {20680#true} #85#return; {20680#true} is VALID [2022-04-08 11:28:04,637 INFO L272 TraceCheckUtils]: 37: Hoare triple {20680#true} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {20680#true} is VALID [2022-04-08 11:28:04,637 INFO L290 TraceCheckUtils]: 38: Hoare triple {20680#true} ~cond := #in~cond; {20680#true} is VALID [2022-04-08 11:28:04,637 INFO L290 TraceCheckUtils]: 39: Hoare triple {20680#true} assume !(0 == ~cond); {20680#true} is VALID [2022-04-08 11:28:04,638 INFO L290 TraceCheckUtils]: 40: Hoare triple {20680#true} assume true; {20680#true} is VALID [2022-04-08 11:28:04,638 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {20680#true} {20680#true} #87#return; {20680#true} is VALID [2022-04-08 11:28:04,638 INFO L290 TraceCheckUtils]: 42: Hoare triple {20680#true} assume !!(~r~0 >= 2 * ~b~0); {20680#true} is VALID [2022-04-08 11:28:04,638 INFO L272 TraceCheckUtils]: 43: Hoare triple {20680#true} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {20680#true} is VALID [2022-04-08 11:28:04,638 INFO L290 TraceCheckUtils]: 44: Hoare triple {20680#true} ~cond := #in~cond; {20680#true} is VALID [2022-04-08 11:28:04,638 INFO L290 TraceCheckUtils]: 45: Hoare triple {20680#true} assume !(0 == ~cond); {20680#true} is VALID [2022-04-08 11:28:04,638 INFO L290 TraceCheckUtils]: 46: Hoare triple {20680#true} assume true; {20680#true} is VALID [2022-04-08 11:28:04,638 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {20680#true} {20680#true} #89#return; {20680#true} is VALID [2022-04-08 11:28:04,638 INFO L290 TraceCheckUtils]: 48: Hoare triple {20680#true} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {20680#true} is VALID [2022-04-08 11:28:04,638 INFO L290 TraceCheckUtils]: 49: Hoare triple {20680#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20680#true} is VALID [2022-04-08 11:28:04,639 INFO L290 TraceCheckUtils]: 50: Hoare triple {20680#true} assume !!(#t~post7 < 10);havoc #t~post7; {20680#true} is VALID [2022-04-08 11:28:04,639 INFO L272 TraceCheckUtils]: 51: Hoare triple {20680#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {20680#true} is VALID [2022-04-08 11:28:04,639 INFO L290 TraceCheckUtils]: 52: Hoare triple {20680#true} ~cond := #in~cond; {20680#true} is VALID [2022-04-08 11:28:04,639 INFO L290 TraceCheckUtils]: 53: Hoare triple {20680#true} assume !(0 == ~cond); {20680#true} is VALID [2022-04-08 11:28:04,639 INFO L290 TraceCheckUtils]: 54: Hoare triple {20680#true} assume true; {20680#true} is VALID [2022-04-08 11:28:04,639 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {20680#true} {20680#true} #83#return; {20680#true} is VALID [2022-04-08 11:28:04,639 INFO L272 TraceCheckUtils]: 56: Hoare triple {20680#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {20680#true} is VALID [2022-04-08 11:28:04,639 INFO L290 TraceCheckUtils]: 57: Hoare triple {20680#true} ~cond := #in~cond; {20680#true} is VALID [2022-04-08 11:28:04,639 INFO L290 TraceCheckUtils]: 58: Hoare triple {20680#true} assume !(0 == ~cond); {20680#true} is VALID [2022-04-08 11:28:04,639 INFO L290 TraceCheckUtils]: 59: Hoare triple {20680#true} assume true; {20680#true} is VALID [2022-04-08 11:28:04,639 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {20680#true} {20680#true} #85#return; {20680#true} is VALID [2022-04-08 11:28:04,640 INFO L272 TraceCheckUtils]: 61: Hoare triple {20680#true} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {20680#true} is VALID [2022-04-08 11:28:04,640 INFO L290 TraceCheckUtils]: 62: Hoare triple {20680#true} ~cond := #in~cond; {20680#true} is VALID [2022-04-08 11:28:04,640 INFO L290 TraceCheckUtils]: 63: Hoare triple {20680#true} assume !(0 == ~cond); {20680#true} is VALID [2022-04-08 11:28:04,640 INFO L290 TraceCheckUtils]: 64: Hoare triple {20680#true} assume true; {20680#true} is VALID [2022-04-08 11:28:04,640 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {20680#true} {20680#true} #87#return; {20680#true} is VALID [2022-04-08 11:28:04,640 INFO L290 TraceCheckUtils]: 66: Hoare triple {20680#true} assume !!(~r~0 >= 2 * ~b~0); {20680#true} is VALID [2022-04-08 11:28:04,640 INFO L272 TraceCheckUtils]: 67: Hoare triple {20680#true} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {20680#true} is VALID [2022-04-08 11:28:04,640 INFO L290 TraceCheckUtils]: 68: Hoare triple {20680#true} ~cond := #in~cond; {20680#true} is VALID [2022-04-08 11:28:04,640 INFO L290 TraceCheckUtils]: 69: Hoare triple {20680#true} assume !(0 == ~cond); {20680#true} is VALID [2022-04-08 11:28:04,640 INFO L290 TraceCheckUtils]: 70: Hoare triple {20680#true} assume true; {20680#true} is VALID [2022-04-08 11:28:04,641 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {20680#true} {20680#true} #89#return; {20680#true} is VALID [2022-04-08 11:28:04,641 INFO L290 TraceCheckUtils]: 72: Hoare triple {20680#true} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {20680#true} is VALID [2022-04-08 11:28:04,641 INFO L290 TraceCheckUtils]: 73: Hoare triple {20680#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20680#true} is VALID [2022-04-08 11:28:04,641 INFO L290 TraceCheckUtils]: 74: Hoare triple {20680#true} assume !!(#t~post7 < 10);havoc #t~post7; {20680#true} is VALID [2022-04-08 11:28:04,641 INFO L272 TraceCheckUtils]: 75: Hoare triple {20680#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {20680#true} is VALID [2022-04-08 11:28:04,641 INFO L290 TraceCheckUtils]: 76: Hoare triple {20680#true} ~cond := #in~cond; {20680#true} is VALID [2022-04-08 11:28:04,641 INFO L290 TraceCheckUtils]: 77: Hoare triple {20680#true} assume !(0 == ~cond); {20680#true} is VALID [2022-04-08 11:28:04,641 INFO L290 TraceCheckUtils]: 78: Hoare triple {20680#true} assume true; {20680#true} is VALID [2022-04-08 11:28:04,641 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {20680#true} {20680#true} #83#return; {20680#true} is VALID [2022-04-08 11:28:04,641 INFO L272 TraceCheckUtils]: 80: Hoare triple {20680#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {20680#true} is VALID [2022-04-08 11:28:04,641 INFO L290 TraceCheckUtils]: 81: Hoare triple {20680#true} ~cond := #in~cond; {20680#true} is VALID [2022-04-08 11:28:04,642 INFO L290 TraceCheckUtils]: 82: Hoare triple {20680#true} assume !(0 == ~cond); {20680#true} is VALID [2022-04-08 11:28:04,642 INFO L290 TraceCheckUtils]: 83: Hoare triple {20680#true} assume true; {20680#true} is VALID [2022-04-08 11:28:04,642 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {20680#true} {20680#true} #85#return; {20680#true} is VALID [2022-04-08 11:28:04,642 INFO L272 TraceCheckUtils]: 85: Hoare triple {20680#true} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {20680#true} is VALID [2022-04-08 11:28:04,642 INFO L290 TraceCheckUtils]: 86: Hoare triple {20680#true} ~cond := #in~cond; {20680#true} is VALID [2022-04-08 11:28:04,642 INFO L290 TraceCheckUtils]: 87: Hoare triple {20680#true} assume !(0 == ~cond); {20680#true} is VALID [2022-04-08 11:28:04,642 INFO L290 TraceCheckUtils]: 88: Hoare triple {20680#true} assume true; {20680#true} is VALID [2022-04-08 11:28:04,642 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {20680#true} {20680#true} #87#return; {20680#true} is VALID [2022-04-08 11:28:04,642 INFO L290 TraceCheckUtils]: 90: Hoare triple {20680#true} assume !(~r~0 >= 2 * ~b~0); {20680#true} is VALID [2022-04-08 11:28:04,642 INFO L290 TraceCheckUtils]: 91: Hoare triple {20680#true} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {20680#true} is VALID [2022-04-08 11:28:04,643 INFO L290 TraceCheckUtils]: 92: Hoare triple {20680#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20680#true} is VALID [2022-04-08 11:28:04,643 INFO L290 TraceCheckUtils]: 93: Hoare triple {20680#true} assume !!(#t~post6 < 10);havoc #t~post6; {20680#true} is VALID [2022-04-08 11:28:04,643 INFO L272 TraceCheckUtils]: 94: Hoare triple {20680#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {20680#true} is VALID [2022-04-08 11:28:04,643 INFO L290 TraceCheckUtils]: 95: Hoare triple {20680#true} ~cond := #in~cond; {20680#true} is VALID [2022-04-08 11:28:04,643 INFO L290 TraceCheckUtils]: 96: Hoare triple {20680#true} assume !(0 == ~cond); {20680#true} is VALID [2022-04-08 11:28:04,643 INFO L290 TraceCheckUtils]: 97: Hoare triple {20680#true} assume true; {20680#true} is VALID [2022-04-08 11:28:04,643 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {20680#true} {20680#true} #79#return; {20680#true} is VALID [2022-04-08 11:28:04,643 INFO L272 TraceCheckUtils]: 99: Hoare triple {20680#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {20680#true} is VALID [2022-04-08 11:28:04,643 INFO L290 TraceCheckUtils]: 100: Hoare triple {20680#true} ~cond := #in~cond; {20680#true} is VALID [2022-04-08 11:28:04,643 INFO L290 TraceCheckUtils]: 101: Hoare triple {20680#true} assume !(0 == ~cond); {20680#true} is VALID [2022-04-08 11:28:04,643 INFO L290 TraceCheckUtils]: 102: Hoare triple {20680#true} assume true; {20680#true} is VALID [2022-04-08 11:28:04,644 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {20680#true} {20680#true} #81#return; {20680#true} is VALID [2022-04-08 11:28:04,644 INFO L290 TraceCheckUtils]: 104: Hoare triple {20680#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {20680#true} is VALID [2022-04-08 11:28:04,644 INFO L290 TraceCheckUtils]: 105: Hoare triple {20680#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21000#(<= (+ |main_#t~post7| 1) ~counter~0)} is VALID [2022-04-08 11:28:04,645 INFO L290 TraceCheckUtils]: 106: Hoare triple {21000#(<= (+ |main_#t~post7| 1) ~counter~0)} assume !(#t~post7 < 10);havoc #t~post7; {21004#(<= 11 ~counter~0)} is VALID [2022-04-08 11:28:04,645 INFO L290 TraceCheckUtils]: 107: Hoare triple {21004#(<= 11 ~counter~0)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {21004#(<= 11 ~counter~0)} is VALID [2022-04-08 11:28:04,645 INFO L290 TraceCheckUtils]: 108: Hoare triple {21004#(<= 11 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21011#(<= 11 |main_#t~post6|)} is VALID [2022-04-08 11:28:04,646 INFO L290 TraceCheckUtils]: 109: Hoare triple {21011#(<= 11 |main_#t~post6|)} assume !!(#t~post6 < 10);havoc #t~post6; {20681#false} is VALID [2022-04-08 11:28:04,646 INFO L272 TraceCheckUtils]: 110: Hoare triple {20681#false} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {20681#false} is VALID [2022-04-08 11:28:04,646 INFO L290 TraceCheckUtils]: 111: Hoare triple {20681#false} ~cond := #in~cond; {20681#false} is VALID [2022-04-08 11:28:04,646 INFO L290 TraceCheckUtils]: 112: Hoare triple {20681#false} assume !(0 == ~cond); {20681#false} is VALID [2022-04-08 11:28:04,646 INFO L290 TraceCheckUtils]: 113: Hoare triple {20681#false} assume true; {20681#false} is VALID [2022-04-08 11:28:04,646 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {20681#false} {20681#false} #79#return; {20681#false} is VALID [2022-04-08 11:28:04,646 INFO L272 TraceCheckUtils]: 115: Hoare triple {20681#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {20681#false} is VALID [2022-04-08 11:28:04,647 INFO L290 TraceCheckUtils]: 116: Hoare triple {20681#false} ~cond := #in~cond; {20681#false} is VALID [2022-04-08 11:28:04,647 INFO L290 TraceCheckUtils]: 117: Hoare triple {20681#false} assume !(0 == ~cond); {20681#false} is VALID [2022-04-08 11:28:04,647 INFO L290 TraceCheckUtils]: 118: Hoare triple {20681#false} assume true; {20681#false} is VALID [2022-04-08 11:28:04,647 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {20681#false} {20681#false} #81#return; {20681#false} is VALID [2022-04-08 11:28:04,647 INFO L290 TraceCheckUtils]: 120: Hoare triple {20681#false} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {20681#false} is VALID [2022-04-08 11:28:04,647 INFO L290 TraceCheckUtils]: 121: Hoare triple {20681#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20681#false} is VALID [2022-04-08 11:28:04,647 INFO L290 TraceCheckUtils]: 122: Hoare triple {20681#false} assume !(#t~post7 < 10);havoc #t~post7; {20681#false} is VALID [2022-04-08 11:28:04,647 INFO L290 TraceCheckUtils]: 123: Hoare triple {20681#false} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {20681#false} is VALID [2022-04-08 11:28:04,647 INFO L290 TraceCheckUtils]: 124: Hoare triple {20681#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20681#false} is VALID [2022-04-08 11:28:04,647 INFO L290 TraceCheckUtils]: 125: Hoare triple {20681#false} assume !(#t~post6 < 10);havoc #t~post6; {20681#false} is VALID [2022-04-08 11:28:04,647 INFO L272 TraceCheckUtils]: 126: Hoare triple {20681#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {20681#false} is VALID [2022-04-08 11:28:04,648 INFO L290 TraceCheckUtils]: 127: Hoare triple {20681#false} ~cond := #in~cond; {20681#false} is VALID [2022-04-08 11:28:04,648 INFO L290 TraceCheckUtils]: 128: Hoare triple {20681#false} assume 0 == ~cond; {20681#false} is VALID [2022-04-08 11:28:04,648 INFO L290 TraceCheckUtils]: 129: Hoare triple {20681#false} assume !false; {20681#false} is VALID [2022-04-08 11:28:04,648 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-08 11:28:04,648 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:28:04,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:28:04,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317818321] [2022-04-08 11:28:04,649 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:28:04,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158207117] [2022-04-08 11:28:04,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158207117] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:28:04,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:28:04,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:28:04,649 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:28:04,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1178418657] [2022-04-08 11:28:04,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1178418657] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:28:04,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:28:04,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:28:04,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53806749] [2022-04-08 11:28:04,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:28:04,650 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-08 11:28:04,650 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:28:04,650 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-08 11:28:04,690 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-08 11:28:04,690 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 11:28:04,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:28:04,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 11:28:04,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 11:28:04,691 INFO L87 Difference]: Start difference. First operand 234 states and 291 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-08 11:28:05,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:28:05,136 INFO L93 Difference]: Finished difference Result 316 states and 400 transitions. [2022-04-08 11:28:05,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 11:28:05,136 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-08 11:28:05,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:28:05,136 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-08 11:28:05,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2022-04-08 11:28:05,137 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-08 11:28:05,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2022-04-08 11:28:05,138 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 82 transitions. [2022-04-08 11:28:05,194 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-08 11:28:05,197 INFO L225 Difference]: With dead ends: 316 [2022-04-08 11:28:05,197 INFO L226 Difference]: Without dead ends: 219 [2022-04-08 11:28:05,197 INFO L912 BasicCegarLoop]: 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-08 11:28:05,198 INFO L913 BasicCegarLoop]: 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-08 11:28:05,198 INFO L914 BasicCegarLoop]: 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-08 11:28:05,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-04-08 11:28:05,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 211. [2022-04-08 11:28:05,467 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:28:05,467 INFO L82 GeneralOperation]: Start isEquivalent. First operand 219 states. Second operand has 211 states, 134 states have (on average 1.1194029850746268) internal successors, (150), 136 states have internal predecessors, (150), 52 states have call successors, (52), 26 states have call predecessors, (52), 24 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-08 11:28:05,467 INFO L74 IsIncluded]: Start isIncluded. First operand 219 states. Second operand has 211 states, 134 states have (on average 1.1194029850746268) internal successors, (150), 136 states have internal predecessors, (150), 52 states have call successors, (52), 26 states have call predecessors, (52), 24 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-08 11:28:05,468 INFO L87 Difference]: Start difference. First operand 219 states. Second operand has 211 states, 134 states have (on average 1.1194029850746268) internal successors, (150), 136 states have internal predecessors, (150), 52 states have call successors, (52), 26 states have call predecessors, (52), 24 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-08 11:28:05,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:28:05,471 INFO L93 Difference]: Finished difference Result 219 states and 258 transitions. [2022-04-08 11:28:05,471 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 258 transitions. [2022-04-08 11:28:05,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:28:05,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:28:05,471 INFO L74 IsIncluded]: Start isIncluded. First operand has 211 states, 134 states have (on average 1.1194029850746268) internal successors, (150), 136 states have internal predecessors, (150), 52 states have call successors, (52), 26 states have call predecessors, (52), 24 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) Second operand 219 states. [2022-04-08 11:28:05,472 INFO L87 Difference]: Start difference. First operand has 211 states, 134 states have (on average 1.1194029850746268) internal successors, (150), 136 states have internal predecessors, (150), 52 states have call successors, (52), 26 states have call predecessors, (52), 24 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) Second operand 219 states. [2022-04-08 11:28:05,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:28:05,474 INFO L93 Difference]: Finished difference Result 219 states and 258 transitions. [2022-04-08 11:28:05,474 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 258 transitions. [2022-04-08 11:28:05,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:28:05,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:28:05,475 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:28:05,475 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:28:05,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 134 states have (on average 1.1194029850746268) internal successors, (150), 136 states have internal predecessors, (150), 52 states have call successors, (52), 26 states have call predecessors, (52), 24 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-08 11:28:05,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 251 transitions. [2022-04-08 11:28:05,478 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 251 transitions. Word has length 130 [2022-04-08 11:28:05,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:28:05,479 INFO L478 AbstractCegarLoop]: Abstraction has 211 states and 251 transitions. [2022-04-08 11:28:05,479 INFO L479 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-08 11:28:05,479 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 211 states and 251 transitions. [2022-04-08 11:28:05,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 251 edges. 251 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:28:05,842 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 251 transitions. [2022-04-08 11:28:05,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-04-08 11:28:05,842 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:28:05,842 INFO L499 BasicCegarLoop]: 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-08 11:28:05,861 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-08 11:28:06,043 WARN L460 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-08 11:28:06,043 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:28:06,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:28:06,043 INFO L85 PathProgramCache]: Analyzing trace with hash 518951120, now seen corresponding path program 7 times [2022-04-08 11:28:06,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:28:06,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2139208138] [2022-04-08 11:28:42,643 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:28:42,643 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:28:42,643 INFO L85 PathProgramCache]: Analyzing trace with hash 518951120, now seen corresponding path program 8 times [2022-04-08 11:28:42,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:28:42,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906198404] [2022-04-08 11:28:42,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:28:42,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:28:42,660 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:28:42,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1936581461] [2022-04-08 11:28:42,661 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:28:42,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:28:42,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:28:42,662 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-08 11:28:42,662 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-08 11:28:42,743 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:28:42,743 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:28:42,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 11:28:42,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:28:42,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:28:43,272 INFO L272 TraceCheckUtils]: 0: Hoare triple {22568#true} call ULTIMATE.init(); {22568#true} is VALID [2022-04-08 11:28:43,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {22568#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; {22576#(<= ~counter~0 0)} is VALID [2022-04-08 11:28:43,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {22576#(<= ~counter~0 0)} assume true; {22576#(<= ~counter~0 0)} is VALID [2022-04-08 11:28:43,273 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22576#(<= ~counter~0 0)} {22568#true} #93#return; {22576#(<= ~counter~0 0)} is VALID [2022-04-08 11:28:43,274 INFO L272 TraceCheckUtils]: 4: Hoare triple {22576#(<= ~counter~0 0)} call #t~ret8 := main(); {22576#(<= ~counter~0 0)} is VALID [2022-04-08 11:28:43,274 INFO L290 TraceCheckUtils]: 5: Hoare triple {22576#(<= ~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; {22576#(<= ~counter~0 0)} is VALID [2022-04-08 11:28:43,274 INFO L272 TraceCheckUtils]: 6: Hoare triple {22576#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {22576#(<= ~counter~0 0)} is VALID [2022-04-08 11:28:43,275 INFO L290 TraceCheckUtils]: 7: Hoare triple {22576#(<= ~counter~0 0)} ~cond := #in~cond; {22576#(<= ~counter~0 0)} is VALID [2022-04-08 11:28:43,275 INFO L290 TraceCheckUtils]: 8: Hoare triple {22576#(<= ~counter~0 0)} assume !(0 == ~cond); {22576#(<= ~counter~0 0)} is VALID [2022-04-08 11:28:43,275 INFO L290 TraceCheckUtils]: 9: Hoare triple {22576#(<= ~counter~0 0)} assume true; {22576#(<= ~counter~0 0)} is VALID [2022-04-08 11:28:43,275 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22576#(<= ~counter~0 0)} {22576#(<= ~counter~0 0)} #77#return; {22576#(<= ~counter~0 0)} is VALID [2022-04-08 11:28:43,276 INFO L290 TraceCheckUtils]: 11: Hoare triple {22576#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {22576#(<= ~counter~0 0)} is VALID [2022-04-08 11:28:43,277 INFO L290 TraceCheckUtils]: 12: Hoare triple {22576#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22610#(<= ~counter~0 1)} is VALID [2022-04-08 11:28:43,277 INFO L290 TraceCheckUtils]: 13: Hoare triple {22610#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {22610#(<= ~counter~0 1)} is VALID [2022-04-08 11:28:43,277 INFO L272 TraceCheckUtils]: 14: Hoare triple {22610#(<= ~counter~0 1)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22610#(<= ~counter~0 1)} is VALID [2022-04-08 11:28:43,278 INFO L290 TraceCheckUtils]: 15: Hoare triple {22610#(<= ~counter~0 1)} ~cond := #in~cond; {22610#(<= ~counter~0 1)} is VALID [2022-04-08 11:28:43,278 INFO L290 TraceCheckUtils]: 16: Hoare triple {22610#(<= ~counter~0 1)} assume !(0 == ~cond); {22610#(<= ~counter~0 1)} is VALID [2022-04-08 11:28:43,278 INFO L290 TraceCheckUtils]: 17: Hoare triple {22610#(<= ~counter~0 1)} assume true; {22610#(<= ~counter~0 1)} is VALID [2022-04-08 11:28:43,279 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {22610#(<= ~counter~0 1)} {22610#(<= ~counter~0 1)} #79#return; {22610#(<= ~counter~0 1)} is VALID [2022-04-08 11:28:43,279 INFO L272 TraceCheckUtils]: 19: Hoare triple {22610#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22610#(<= ~counter~0 1)} is VALID [2022-04-08 11:28:43,279 INFO L290 TraceCheckUtils]: 20: Hoare triple {22610#(<= ~counter~0 1)} ~cond := #in~cond; {22610#(<= ~counter~0 1)} is VALID [2022-04-08 11:28:43,280 INFO L290 TraceCheckUtils]: 21: Hoare triple {22610#(<= ~counter~0 1)} assume !(0 == ~cond); {22610#(<= ~counter~0 1)} is VALID [2022-04-08 11:28:43,280 INFO L290 TraceCheckUtils]: 22: Hoare triple {22610#(<= ~counter~0 1)} assume true; {22610#(<= ~counter~0 1)} is VALID [2022-04-08 11:28:43,280 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {22610#(<= ~counter~0 1)} {22610#(<= ~counter~0 1)} #81#return; {22610#(<= ~counter~0 1)} is VALID [2022-04-08 11:28:43,281 INFO L290 TraceCheckUtils]: 24: Hoare triple {22610#(<= ~counter~0 1)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {22610#(<= ~counter~0 1)} is VALID [2022-04-08 11:28:43,281 INFO L290 TraceCheckUtils]: 25: Hoare triple {22610#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22650#(<= ~counter~0 2)} is VALID [2022-04-08 11:28:43,281 INFO L290 TraceCheckUtils]: 26: Hoare triple {22650#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {22650#(<= ~counter~0 2)} is VALID [2022-04-08 11:28:43,282 INFO L272 TraceCheckUtils]: 27: Hoare triple {22650#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22650#(<= ~counter~0 2)} is VALID [2022-04-08 11:28:43,282 INFO L290 TraceCheckUtils]: 28: Hoare triple {22650#(<= ~counter~0 2)} ~cond := #in~cond; {22650#(<= ~counter~0 2)} is VALID [2022-04-08 11:28:43,282 INFO L290 TraceCheckUtils]: 29: Hoare triple {22650#(<= ~counter~0 2)} assume !(0 == ~cond); {22650#(<= ~counter~0 2)} is VALID [2022-04-08 11:28:43,283 INFO L290 TraceCheckUtils]: 30: Hoare triple {22650#(<= ~counter~0 2)} assume true; {22650#(<= ~counter~0 2)} is VALID [2022-04-08 11:28:43,283 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {22650#(<= ~counter~0 2)} {22650#(<= ~counter~0 2)} #83#return; {22650#(<= ~counter~0 2)} is VALID [2022-04-08 11:28:43,284 INFO L272 TraceCheckUtils]: 32: Hoare triple {22650#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22650#(<= ~counter~0 2)} is VALID [2022-04-08 11:28:43,284 INFO L290 TraceCheckUtils]: 33: Hoare triple {22650#(<= ~counter~0 2)} ~cond := #in~cond; {22650#(<= ~counter~0 2)} is VALID [2022-04-08 11:28:43,284 INFO L290 TraceCheckUtils]: 34: Hoare triple {22650#(<= ~counter~0 2)} assume !(0 == ~cond); {22650#(<= ~counter~0 2)} is VALID [2022-04-08 11:28:43,284 INFO L290 TraceCheckUtils]: 35: Hoare triple {22650#(<= ~counter~0 2)} assume true; {22650#(<= ~counter~0 2)} is VALID [2022-04-08 11:28:43,285 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {22650#(<= ~counter~0 2)} {22650#(<= ~counter~0 2)} #85#return; {22650#(<= ~counter~0 2)} is VALID [2022-04-08 11:28:43,285 INFO L272 TraceCheckUtils]: 37: Hoare triple {22650#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {22650#(<= ~counter~0 2)} is VALID [2022-04-08 11:28:43,286 INFO L290 TraceCheckUtils]: 38: Hoare triple {22650#(<= ~counter~0 2)} ~cond := #in~cond; {22650#(<= ~counter~0 2)} is VALID [2022-04-08 11:28:43,286 INFO L290 TraceCheckUtils]: 39: Hoare triple {22650#(<= ~counter~0 2)} assume !(0 == ~cond); {22650#(<= ~counter~0 2)} is VALID [2022-04-08 11:28:43,286 INFO L290 TraceCheckUtils]: 40: Hoare triple {22650#(<= ~counter~0 2)} assume true; {22650#(<= ~counter~0 2)} is VALID [2022-04-08 11:28:43,287 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {22650#(<= ~counter~0 2)} {22650#(<= ~counter~0 2)} #87#return; {22650#(<= ~counter~0 2)} is VALID [2022-04-08 11:28:43,287 INFO L290 TraceCheckUtils]: 42: Hoare triple {22650#(<= ~counter~0 2)} assume !!(~r~0 >= 2 * ~b~0); {22650#(<= ~counter~0 2)} is VALID [2022-04-08 11:28:43,287 INFO L272 TraceCheckUtils]: 43: Hoare triple {22650#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {22650#(<= ~counter~0 2)} is VALID [2022-04-08 11:28:43,287 INFO L290 TraceCheckUtils]: 44: Hoare triple {22650#(<= ~counter~0 2)} ~cond := #in~cond; {22650#(<= ~counter~0 2)} is VALID [2022-04-08 11:28:43,288 INFO L290 TraceCheckUtils]: 45: Hoare triple {22650#(<= ~counter~0 2)} assume !(0 == ~cond); {22650#(<= ~counter~0 2)} is VALID [2022-04-08 11:28:43,288 INFO L290 TraceCheckUtils]: 46: Hoare triple {22650#(<= ~counter~0 2)} assume true; {22650#(<= ~counter~0 2)} is VALID [2022-04-08 11:28:43,288 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {22650#(<= ~counter~0 2)} {22650#(<= ~counter~0 2)} #89#return; {22650#(<= ~counter~0 2)} is VALID [2022-04-08 11:28:43,289 INFO L290 TraceCheckUtils]: 48: Hoare triple {22650#(<= ~counter~0 2)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {22650#(<= ~counter~0 2)} is VALID [2022-04-08 11:28:43,289 INFO L290 TraceCheckUtils]: 49: Hoare triple {22650#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22723#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:43,290 INFO L290 TraceCheckUtils]: 50: Hoare triple {22723#(<= ~counter~0 3)} assume !!(#t~post7 < 10);havoc #t~post7; {22723#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:43,290 INFO L272 TraceCheckUtils]: 51: Hoare triple {22723#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22723#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:43,290 INFO L290 TraceCheckUtils]: 52: Hoare triple {22723#(<= ~counter~0 3)} ~cond := #in~cond; {22723#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:43,291 INFO L290 TraceCheckUtils]: 53: Hoare triple {22723#(<= ~counter~0 3)} assume !(0 == ~cond); {22723#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:43,291 INFO L290 TraceCheckUtils]: 54: Hoare triple {22723#(<= ~counter~0 3)} assume true; {22723#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:43,291 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {22723#(<= ~counter~0 3)} {22723#(<= ~counter~0 3)} #83#return; {22723#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:43,292 INFO L272 TraceCheckUtils]: 56: Hoare triple {22723#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22723#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:43,292 INFO L290 TraceCheckUtils]: 57: Hoare triple {22723#(<= ~counter~0 3)} ~cond := #in~cond; {22723#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:43,292 INFO L290 TraceCheckUtils]: 58: Hoare triple {22723#(<= ~counter~0 3)} assume !(0 == ~cond); {22723#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:43,293 INFO L290 TraceCheckUtils]: 59: Hoare triple {22723#(<= ~counter~0 3)} assume true; {22723#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:43,293 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {22723#(<= ~counter~0 3)} {22723#(<= ~counter~0 3)} #85#return; {22723#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:43,293 INFO L272 TraceCheckUtils]: 61: Hoare triple {22723#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {22723#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:43,294 INFO L290 TraceCheckUtils]: 62: Hoare triple {22723#(<= ~counter~0 3)} ~cond := #in~cond; {22723#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:43,294 INFO L290 TraceCheckUtils]: 63: Hoare triple {22723#(<= ~counter~0 3)} assume !(0 == ~cond); {22723#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:43,294 INFO L290 TraceCheckUtils]: 64: Hoare triple {22723#(<= ~counter~0 3)} assume true; {22723#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:43,295 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {22723#(<= ~counter~0 3)} {22723#(<= ~counter~0 3)} #87#return; {22723#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:43,295 INFO L290 TraceCheckUtils]: 66: Hoare triple {22723#(<= ~counter~0 3)} assume !!(~r~0 >= 2 * ~b~0); {22723#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:43,295 INFO L272 TraceCheckUtils]: 67: Hoare triple {22723#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {22723#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:43,296 INFO L290 TraceCheckUtils]: 68: Hoare triple {22723#(<= ~counter~0 3)} ~cond := #in~cond; {22723#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:43,296 INFO L290 TraceCheckUtils]: 69: Hoare triple {22723#(<= ~counter~0 3)} assume !(0 == ~cond); {22723#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:43,296 INFO L290 TraceCheckUtils]: 70: Hoare triple {22723#(<= ~counter~0 3)} assume true; {22723#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:43,297 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {22723#(<= ~counter~0 3)} {22723#(<= ~counter~0 3)} #89#return; {22723#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:43,297 INFO L290 TraceCheckUtils]: 72: Hoare triple {22723#(<= ~counter~0 3)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {22723#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:43,298 INFO L290 TraceCheckUtils]: 73: Hoare triple {22723#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22796#(<= ~counter~0 4)} is VALID [2022-04-08 11:28:43,298 INFO L290 TraceCheckUtils]: 74: Hoare triple {22796#(<= ~counter~0 4)} assume !!(#t~post7 < 10);havoc #t~post7; {22796#(<= ~counter~0 4)} is VALID [2022-04-08 11:28:43,298 INFO L272 TraceCheckUtils]: 75: Hoare triple {22796#(<= ~counter~0 4)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22796#(<= ~counter~0 4)} is VALID [2022-04-08 11:28:43,299 INFO L290 TraceCheckUtils]: 76: Hoare triple {22796#(<= ~counter~0 4)} ~cond := #in~cond; {22796#(<= ~counter~0 4)} is VALID [2022-04-08 11:28:43,299 INFO L290 TraceCheckUtils]: 77: Hoare triple {22796#(<= ~counter~0 4)} assume !(0 == ~cond); {22796#(<= ~counter~0 4)} is VALID [2022-04-08 11:28:43,299 INFO L290 TraceCheckUtils]: 78: Hoare triple {22796#(<= ~counter~0 4)} assume true; {22796#(<= ~counter~0 4)} is VALID [2022-04-08 11:28:43,300 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {22796#(<= ~counter~0 4)} {22796#(<= ~counter~0 4)} #83#return; {22796#(<= ~counter~0 4)} is VALID [2022-04-08 11:28:43,300 INFO L272 TraceCheckUtils]: 80: Hoare triple {22796#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22796#(<= ~counter~0 4)} is VALID [2022-04-08 11:28:43,300 INFO L290 TraceCheckUtils]: 81: Hoare triple {22796#(<= ~counter~0 4)} ~cond := #in~cond; {22796#(<= ~counter~0 4)} is VALID [2022-04-08 11:28:43,301 INFO L290 TraceCheckUtils]: 82: Hoare triple {22796#(<= ~counter~0 4)} assume !(0 == ~cond); {22796#(<= ~counter~0 4)} is VALID [2022-04-08 11:28:43,301 INFO L290 TraceCheckUtils]: 83: Hoare triple {22796#(<= ~counter~0 4)} assume true; {22796#(<= ~counter~0 4)} is VALID [2022-04-08 11:28:43,301 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {22796#(<= ~counter~0 4)} {22796#(<= ~counter~0 4)} #85#return; {22796#(<= ~counter~0 4)} is VALID [2022-04-08 11:28:43,302 INFO L272 TraceCheckUtils]: 85: Hoare triple {22796#(<= ~counter~0 4)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {22796#(<= ~counter~0 4)} is VALID [2022-04-08 11:28:43,302 INFO L290 TraceCheckUtils]: 86: Hoare triple {22796#(<= ~counter~0 4)} ~cond := #in~cond; {22796#(<= ~counter~0 4)} is VALID [2022-04-08 11:28:43,302 INFO L290 TraceCheckUtils]: 87: Hoare triple {22796#(<= ~counter~0 4)} assume !(0 == ~cond); {22796#(<= ~counter~0 4)} is VALID [2022-04-08 11:28:43,303 INFO L290 TraceCheckUtils]: 88: Hoare triple {22796#(<= ~counter~0 4)} assume true; {22796#(<= ~counter~0 4)} is VALID [2022-04-08 11:28:43,303 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {22796#(<= ~counter~0 4)} {22796#(<= ~counter~0 4)} #87#return; {22796#(<= ~counter~0 4)} is VALID [2022-04-08 11:28:43,303 INFO L290 TraceCheckUtils]: 90: Hoare triple {22796#(<= ~counter~0 4)} assume !(~r~0 >= 2 * ~b~0); {22796#(<= ~counter~0 4)} is VALID [2022-04-08 11:28:43,304 INFO L290 TraceCheckUtils]: 91: Hoare triple {22796#(<= ~counter~0 4)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {22796#(<= ~counter~0 4)} is VALID [2022-04-08 11:28:43,304 INFO L290 TraceCheckUtils]: 92: Hoare triple {22796#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22854#(<= ~counter~0 5)} is VALID [2022-04-08 11:28:43,304 INFO L290 TraceCheckUtils]: 93: Hoare triple {22854#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {22854#(<= ~counter~0 5)} is VALID [2022-04-08 11:28:43,305 INFO L272 TraceCheckUtils]: 94: Hoare triple {22854#(<= ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22854#(<= ~counter~0 5)} is VALID [2022-04-08 11:28:43,305 INFO L290 TraceCheckUtils]: 95: Hoare triple {22854#(<= ~counter~0 5)} ~cond := #in~cond; {22854#(<= ~counter~0 5)} is VALID [2022-04-08 11:28:43,305 INFO L290 TraceCheckUtils]: 96: Hoare triple {22854#(<= ~counter~0 5)} assume !(0 == ~cond); {22854#(<= ~counter~0 5)} is VALID [2022-04-08 11:28:43,306 INFO L290 TraceCheckUtils]: 97: Hoare triple {22854#(<= ~counter~0 5)} assume true; {22854#(<= ~counter~0 5)} is VALID [2022-04-08 11:28:43,306 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {22854#(<= ~counter~0 5)} {22854#(<= ~counter~0 5)} #79#return; {22854#(<= ~counter~0 5)} is VALID [2022-04-08 11:28:43,307 INFO L272 TraceCheckUtils]: 99: Hoare triple {22854#(<= ~counter~0 5)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22854#(<= ~counter~0 5)} is VALID [2022-04-08 11:28:43,307 INFO L290 TraceCheckUtils]: 100: Hoare triple {22854#(<= ~counter~0 5)} ~cond := #in~cond; {22854#(<= ~counter~0 5)} is VALID [2022-04-08 11:28:43,307 INFO L290 TraceCheckUtils]: 101: Hoare triple {22854#(<= ~counter~0 5)} assume !(0 == ~cond); {22854#(<= ~counter~0 5)} is VALID [2022-04-08 11:28:43,307 INFO L290 TraceCheckUtils]: 102: Hoare triple {22854#(<= ~counter~0 5)} assume true; {22854#(<= ~counter~0 5)} is VALID [2022-04-08 11:28:43,308 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {22854#(<= ~counter~0 5)} {22854#(<= ~counter~0 5)} #81#return; {22854#(<= ~counter~0 5)} is VALID [2022-04-08 11:28:43,308 INFO L290 TraceCheckUtils]: 104: Hoare triple {22854#(<= ~counter~0 5)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {22854#(<= ~counter~0 5)} is VALID [2022-04-08 11:28:43,309 INFO L290 TraceCheckUtils]: 105: Hoare triple {22854#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22894#(<= ~counter~0 6)} is VALID [2022-04-08 11:28:43,309 INFO L290 TraceCheckUtils]: 106: Hoare triple {22894#(<= ~counter~0 6)} assume !!(#t~post7 < 10);havoc #t~post7; {22894#(<= ~counter~0 6)} is VALID [2022-04-08 11:28:43,310 INFO L272 TraceCheckUtils]: 107: Hoare triple {22894#(<= ~counter~0 6)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22894#(<= ~counter~0 6)} is VALID [2022-04-08 11:28:43,310 INFO L290 TraceCheckUtils]: 108: Hoare triple {22894#(<= ~counter~0 6)} ~cond := #in~cond; {22894#(<= ~counter~0 6)} is VALID [2022-04-08 11:28:43,310 INFO L290 TraceCheckUtils]: 109: Hoare triple {22894#(<= ~counter~0 6)} assume !(0 == ~cond); {22894#(<= ~counter~0 6)} is VALID [2022-04-08 11:28:43,310 INFO L290 TraceCheckUtils]: 110: Hoare triple {22894#(<= ~counter~0 6)} assume true; {22894#(<= ~counter~0 6)} is VALID [2022-04-08 11:28:43,311 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {22894#(<= ~counter~0 6)} {22894#(<= ~counter~0 6)} #83#return; {22894#(<= ~counter~0 6)} is VALID [2022-04-08 11:28:43,311 INFO L272 TraceCheckUtils]: 112: Hoare triple {22894#(<= ~counter~0 6)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22894#(<= ~counter~0 6)} is VALID [2022-04-08 11:28:43,312 INFO L290 TraceCheckUtils]: 113: Hoare triple {22894#(<= ~counter~0 6)} ~cond := #in~cond; {22894#(<= ~counter~0 6)} is VALID [2022-04-08 11:28:43,312 INFO L290 TraceCheckUtils]: 114: Hoare triple {22894#(<= ~counter~0 6)} assume !(0 == ~cond); {22894#(<= ~counter~0 6)} is VALID [2022-04-08 11:28:43,312 INFO L290 TraceCheckUtils]: 115: Hoare triple {22894#(<= ~counter~0 6)} assume true; {22894#(<= ~counter~0 6)} is VALID [2022-04-08 11:28:43,313 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {22894#(<= ~counter~0 6)} {22894#(<= ~counter~0 6)} #85#return; {22894#(<= ~counter~0 6)} is VALID [2022-04-08 11:28:43,313 INFO L272 TraceCheckUtils]: 117: Hoare triple {22894#(<= ~counter~0 6)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {22894#(<= ~counter~0 6)} is VALID [2022-04-08 11:28:43,313 INFO L290 TraceCheckUtils]: 118: Hoare triple {22894#(<= ~counter~0 6)} ~cond := #in~cond; {22894#(<= ~counter~0 6)} is VALID [2022-04-08 11:28:43,314 INFO L290 TraceCheckUtils]: 119: Hoare triple {22894#(<= ~counter~0 6)} assume !(0 == ~cond); {22894#(<= ~counter~0 6)} is VALID [2022-04-08 11:28:43,314 INFO L290 TraceCheckUtils]: 120: Hoare triple {22894#(<= ~counter~0 6)} assume true; {22894#(<= ~counter~0 6)} is VALID [2022-04-08 11:28:43,314 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {22894#(<= ~counter~0 6)} {22894#(<= ~counter~0 6)} #87#return; {22894#(<= ~counter~0 6)} is VALID [2022-04-08 11:28:43,314 INFO L290 TraceCheckUtils]: 122: Hoare triple {22894#(<= ~counter~0 6)} assume !!(~r~0 >= 2 * ~b~0); {22894#(<= ~counter~0 6)} is VALID [2022-04-08 11:28:43,315 INFO L272 TraceCheckUtils]: 123: Hoare triple {22894#(<= ~counter~0 6)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {22894#(<= ~counter~0 6)} is VALID [2022-04-08 11:28:43,315 INFO L290 TraceCheckUtils]: 124: Hoare triple {22894#(<= ~counter~0 6)} ~cond := #in~cond; {22894#(<= ~counter~0 6)} is VALID [2022-04-08 11:28:43,315 INFO L290 TraceCheckUtils]: 125: Hoare triple {22894#(<= ~counter~0 6)} assume !(0 == ~cond); {22894#(<= ~counter~0 6)} is VALID [2022-04-08 11:28:43,316 INFO L290 TraceCheckUtils]: 126: Hoare triple {22894#(<= ~counter~0 6)} assume true; {22894#(<= ~counter~0 6)} is VALID [2022-04-08 11:28:43,316 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {22894#(<= ~counter~0 6)} {22894#(<= ~counter~0 6)} #89#return; {22894#(<= ~counter~0 6)} is VALID [2022-04-08 11:28:43,316 INFO L290 TraceCheckUtils]: 128: Hoare triple {22894#(<= ~counter~0 6)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {22894#(<= ~counter~0 6)} is VALID [2022-04-08 11:28:43,317 INFO L290 TraceCheckUtils]: 129: Hoare triple {22894#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22967#(<= |main_#t~post7| 6)} is VALID [2022-04-08 11:28:43,317 INFO L290 TraceCheckUtils]: 130: Hoare triple {22967#(<= |main_#t~post7| 6)} assume !(#t~post7 < 10);havoc #t~post7; {22569#false} is VALID [2022-04-08 11:28:43,317 INFO L290 TraceCheckUtils]: 131: Hoare triple {22569#false} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {22569#false} is VALID [2022-04-08 11:28:43,317 INFO L290 TraceCheckUtils]: 132: Hoare triple {22569#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22569#false} is VALID [2022-04-08 11:28:43,317 INFO L290 TraceCheckUtils]: 133: Hoare triple {22569#false} assume !(#t~post6 < 10);havoc #t~post6; {22569#false} is VALID [2022-04-08 11:28:43,318 INFO L272 TraceCheckUtils]: 134: Hoare triple {22569#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22569#false} is VALID [2022-04-08 11:28:43,318 INFO L290 TraceCheckUtils]: 135: Hoare triple {22569#false} ~cond := #in~cond; {22569#false} is VALID [2022-04-08 11:28:43,319 INFO L290 TraceCheckUtils]: 136: Hoare triple {22569#false} assume 0 == ~cond; {22569#false} is VALID [2022-04-08 11:28:43,319 INFO L290 TraceCheckUtils]: 137: Hoare triple {22569#false} assume !false; {22569#false} is VALID [2022-04-08 11:28:43,320 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 43 proven. 647 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-04-08 11:28:43,320 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:28:43,819 INFO L290 TraceCheckUtils]: 137: Hoare triple {22569#false} assume !false; {22569#false} is VALID [2022-04-08 11:28:43,819 INFO L290 TraceCheckUtils]: 136: Hoare triple {22569#false} assume 0 == ~cond; {22569#false} is VALID [2022-04-08 11:28:43,819 INFO L290 TraceCheckUtils]: 135: Hoare triple {22569#false} ~cond := #in~cond; {22569#false} is VALID [2022-04-08 11:28:43,819 INFO L272 TraceCheckUtils]: 134: Hoare triple {22569#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22569#false} is VALID [2022-04-08 11:28:43,820 INFO L290 TraceCheckUtils]: 133: Hoare triple {22569#false} assume !(#t~post6 < 10);havoc #t~post6; {22569#false} is VALID [2022-04-08 11:28:43,820 INFO L290 TraceCheckUtils]: 132: Hoare triple {22569#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22569#false} is VALID [2022-04-08 11:28:43,820 INFO L290 TraceCheckUtils]: 131: Hoare triple {22569#false} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {22569#false} is VALID [2022-04-08 11:28:43,820 INFO L290 TraceCheckUtils]: 130: Hoare triple {23013#(< |main_#t~post7| 10)} assume !(#t~post7 < 10);havoc #t~post7; {22569#false} is VALID [2022-04-08 11:28:43,820 INFO L290 TraceCheckUtils]: 129: Hoare triple {23017#(< ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23013#(< |main_#t~post7| 10)} is VALID [2022-04-08 11:28:43,821 INFO L290 TraceCheckUtils]: 128: Hoare triple {23017#(< ~counter~0 10)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {23017#(< ~counter~0 10)} is VALID [2022-04-08 11:28:43,821 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {22568#true} {23017#(< ~counter~0 10)} #89#return; {23017#(< ~counter~0 10)} is VALID [2022-04-08 11:28:43,821 INFO L290 TraceCheckUtils]: 126: Hoare triple {22568#true} assume true; {22568#true} is VALID [2022-04-08 11:28:43,821 INFO L290 TraceCheckUtils]: 125: Hoare triple {22568#true} assume !(0 == ~cond); {22568#true} is VALID [2022-04-08 11:28:43,821 INFO L290 TraceCheckUtils]: 124: Hoare triple {22568#true} ~cond := #in~cond; {22568#true} is VALID [2022-04-08 11:28:43,822 INFO L272 TraceCheckUtils]: 123: Hoare triple {23017#(< ~counter~0 10)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {22568#true} is VALID [2022-04-08 11:28:43,822 INFO L290 TraceCheckUtils]: 122: Hoare triple {23017#(< ~counter~0 10)} assume !!(~r~0 >= 2 * ~b~0); {23017#(< ~counter~0 10)} is VALID [2022-04-08 11:28:43,822 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {22568#true} {23017#(< ~counter~0 10)} #87#return; {23017#(< ~counter~0 10)} is VALID [2022-04-08 11:28:43,822 INFO L290 TraceCheckUtils]: 120: Hoare triple {22568#true} assume true; {22568#true} is VALID [2022-04-08 11:28:43,823 INFO L290 TraceCheckUtils]: 119: Hoare triple {22568#true} assume !(0 == ~cond); {22568#true} is VALID [2022-04-08 11:28:43,823 INFO L290 TraceCheckUtils]: 118: Hoare triple {22568#true} ~cond := #in~cond; {22568#true} is VALID [2022-04-08 11:28:43,823 INFO L272 TraceCheckUtils]: 117: Hoare triple {23017#(< ~counter~0 10)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {22568#true} is VALID [2022-04-08 11:28:43,823 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {22568#true} {23017#(< ~counter~0 10)} #85#return; {23017#(< ~counter~0 10)} is VALID [2022-04-08 11:28:43,823 INFO L290 TraceCheckUtils]: 115: Hoare triple {22568#true} assume true; {22568#true} is VALID [2022-04-08 11:28:43,823 INFO L290 TraceCheckUtils]: 114: Hoare triple {22568#true} assume !(0 == ~cond); {22568#true} is VALID [2022-04-08 11:28:43,823 INFO L290 TraceCheckUtils]: 113: Hoare triple {22568#true} ~cond := #in~cond; {22568#true} is VALID [2022-04-08 11:28:43,824 INFO L272 TraceCheckUtils]: 112: Hoare triple {23017#(< ~counter~0 10)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22568#true} is VALID [2022-04-08 11:28:43,824 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {22568#true} {23017#(< ~counter~0 10)} #83#return; {23017#(< ~counter~0 10)} is VALID [2022-04-08 11:28:43,824 INFO L290 TraceCheckUtils]: 110: Hoare triple {22568#true} assume true; {22568#true} is VALID [2022-04-08 11:28:43,824 INFO L290 TraceCheckUtils]: 109: Hoare triple {22568#true} assume !(0 == ~cond); {22568#true} is VALID [2022-04-08 11:28:43,824 INFO L290 TraceCheckUtils]: 108: Hoare triple {22568#true} ~cond := #in~cond; {22568#true} is VALID [2022-04-08 11:28:43,824 INFO L272 TraceCheckUtils]: 107: Hoare triple {23017#(< ~counter~0 10)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22568#true} is VALID [2022-04-08 11:28:43,825 INFO L290 TraceCheckUtils]: 106: Hoare triple {23017#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {23017#(< ~counter~0 10)} is VALID [2022-04-08 11:28:43,825 INFO L290 TraceCheckUtils]: 105: Hoare triple {23090#(< ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23017#(< ~counter~0 10)} is VALID [2022-04-08 11:28:43,826 INFO L290 TraceCheckUtils]: 104: Hoare triple {23090#(< ~counter~0 9)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {23090#(< ~counter~0 9)} is VALID [2022-04-08 11:28:43,826 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {22568#true} {23090#(< ~counter~0 9)} #81#return; {23090#(< ~counter~0 9)} is VALID [2022-04-08 11:28:43,826 INFO L290 TraceCheckUtils]: 102: Hoare triple {22568#true} assume true; {22568#true} is VALID [2022-04-08 11:28:43,826 INFO L290 TraceCheckUtils]: 101: Hoare triple {22568#true} assume !(0 == ~cond); {22568#true} is VALID [2022-04-08 11:28:43,827 INFO L290 TraceCheckUtils]: 100: Hoare triple {22568#true} ~cond := #in~cond; {22568#true} is VALID [2022-04-08 11:28:43,827 INFO L272 TraceCheckUtils]: 99: Hoare triple {23090#(< ~counter~0 9)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22568#true} is VALID [2022-04-08 11:28:43,827 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {22568#true} {23090#(< ~counter~0 9)} #79#return; {23090#(< ~counter~0 9)} is VALID [2022-04-08 11:28:43,827 INFO L290 TraceCheckUtils]: 97: Hoare triple {22568#true} assume true; {22568#true} is VALID [2022-04-08 11:28:43,827 INFO L290 TraceCheckUtils]: 96: Hoare triple {22568#true} assume !(0 == ~cond); {22568#true} is VALID [2022-04-08 11:28:43,827 INFO L290 TraceCheckUtils]: 95: Hoare triple {22568#true} ~cond := #in~cond; {22568#true} is VALID [2022-04-08 11:28:43,827 INFO L272 TraceCheckUtils]: 94: Hoare triple {23090#(< ~counter~0 9)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22568#true} is VALID [2022-04-08 11:28:43,828 INFO L290 TraceCheckUtils]: 93: Hoare triple {23090#(< ~counter~0 9)} assume !!(#t~post6 < 10);havoc #t~post6; {23090#(< ~counter~0 9)} is VALID [2022-04-08 11:28:43,828 INFO L290 TraceCheckUtils]: 92: Hoare triple {23130#(< ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23090#(< ~counter~0 9)} is VALID [2022-04-08 11:28:43,829 INFO L290 TraceCheckUtils]: 91: Hoare triple {23130#(< ~counter~0 8)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {23130#(< ~counter~0 8)} is VALID [2022-04-08 11:28:43,829 INFO L290 TraceCheckUtils]: 90: Hoare triple {23130#(< ~counter~0 8)} assume !(~r~0 >= 2 * ~b~0); {23130#(< ~counter~0 8)} is VALID [2022-04-08 11:28:43,829 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {22568#true} {23130#(< ~counter~0 8)} #87#return; {23130#(< ~counter~0 8)} is VALID [2022-04-08 11:28:43,829 INFO L290 TraceCheckUtils]: 88: Hoare triple {22568#true} assume true; {22568#true} is VALID [2022-04-08 11:28:43,829 INFO L290 TraceCheckUtils]: 87: Hoare triple {22568#true} assume !(0 == ~cond); {22568#true} is VALID [2022-04-08 11:28:43,830 INFO L290 TraceCheckUtils]: 86: Hoare triple {22568#true} ~cond := #in~cond; {22568#true} is VALID [2022-04-08 11:28:43,830 INFO L272 TraceCheckUtils]: 85: Hoare triple {23130#(< ~counter~0 8)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {22568#true} is VALID [2022-04-08 11:28:43,830 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {22568#true} {23130#(< ~counter~0 8)} #85#return; {23130#(< ~counter~0 8)} is VALID [2022-04-08 11:28:43,830 INFO L290 TraceCheckUtils]: 83: Hoare triple {22568#true} assume true; {22568#true} is VALID [2022-04-08 11:28:43,830 INFO L290 TraceCheckUtils]: 82: Hoare triple {22568#true} assume !(0 == ~cond); {22568#true} is VALID [2022-04-08 11:28:43,830 INFO L290 TraceCheckUtils]: 81: Hoare triple {22568#true} ~cond := #in~cond; {22568#true} is VALID [2022-04-08 11:28:43,831 INFO L272 TraceCheckUtils]: 80: Hoare triple {23130#(< ~counter~0 8)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22568#true} is VALID [2022-04-08 11:28:43,831 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {22568#true} {23130#(< ~counter~0 8)} #83#return; {23130#(< ~counter~0 8)} is VALID [2022-04-08 11:28:43,831 INFO L290 TraceCheckUtils]: 78: Hoare triple {22568#true} assume true; {22568#true} is VALID [2022-04-08 11:28:43,831 INFO L290 TraceCheckUtils]: 77: Hoare triple {22568#true} assume !(0 == ~cond); {22568#true} is VALID [2022-04-08 11:28:43,831 INFO L290 TraceCheckUtils]: 76: Hoare triple {22568#true} ~cond := #in~cond; {22568#true} is VALID [2022-04-08 11:28:43,831 INFO L272 TraceCheckUtils]: 75: Hoare triple {23130#(< ~counter~0 8)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22568#true} is VALID [2022-04-08 11:28:43,832 INFO L290 TraceCheckUtils]: 74: Hoare triple {23130#(< ~counter~0 8)} assume !!(#t~post7 < 10);havoc #t~post7; {23130#(< ~counter~0 8)} is VALID [2022-04-08 11:28:43,832 INFO L290 TraceCheckUtils]: 73: Hoare triple {22894#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23130#(< ~counter~0 8)} is VALID [2022-04-08 11:28:43,832 INFO L290 TraceCheckUtils]: 72: Hoare triple {22894#(<= ~counter~0 6)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {22894#(<= ~counter~0 6)} is VALID [2022-04-08 11:28:43,833 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {22568#true} {22894#(<= ~counter~0 6)} #89#return; {22894#(<= ~counter~0 6)} is VALID [2022-04-08 11:28:43,833 INFO L290 TraceCheckUtils]: 70: Hoare triple {22568#true} assume true; {22568#true} is VALID [2022-04-08 11:28:43,833 INFO L290 TraceCheckUtils]: 69: Hoare triple {22568#true} assume !(0 == ~cond); {22568#true} is VALID [2022-04-08 11:28:43,833 INFO L290 TraceCheckUtils]: 68: Hoare triple {22568#true} ~cond := #in~cond; {22568#true} is VALID [2022-04-08 11:28:43,833 INFO L272 TraceCheckUtils]: 67: Hoare triple {22894#(<= ~counter~0 6)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {22568#true} is VALID [2022-04-08 11:28:43,834 INFO L290 TraceCheckUtils]: 66: Hoare triple {22894#(<= ~counter~0 6)} assume !!(~r~0 >= 2 * ~b~0); {22894#(<= ~counter~0 6)} is VALID [2022-04-08 11:28:43,834 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {22568#true} {22894#(<= ~counter~0 6)} #87#return; {22894#(<= ~counter~0 6)} is VALID [2022-04-08 11:28:43,834 INFO L290 TraceCheckUtils]: 64: Hoare triple {22568#true} assume true; {22568#true} is VALID [2022-04-08 11:28:43,834 INFO L290 TraceCheckUtils]: 63: Hoare triple {22568#true} assume !(0 == ~cond); {22568#true} is VALID [2022-04-08 11:28:43,834 INFO L290 TraceCheckUtils]: 62: Hoare triple {22568#true} ~cond := #in~cond; {22568#true} is VALID [2022-04-08 11:28:43,834 INFO L272 TraceCheckUtils]: 61: Hoare triple {22894#(<= ~counter~0 6)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {22568#true} is VALID [2022-04-08 11:28:43,835 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {22568#true} {22894#(<= ~counter~0 6)} #85#return; {22894#(<= ~counter~0 6)} is VALID [2022-04-08 11:28:43,835 INFO L290 TraceCheckUtils]: 59: Hoare triple {22568#true} assume true; {22568#true} is VALID [2022-04-08 11:28:43,835 INFO L290 TraceCheckUtils]: 58: Hoare triple {22568#true} assume !(0 == ~cond); {22568#true} is VALID [2022-04-08 11:28:43,835 INFO L290 TraceCheckUtils]: 57: Hoare triple {22568#true} ~cond := #in~cond; {22568#true} is VALID [2022-04-08 11:28:43,835 INFO L272 TraceCheckUtils]: 56: Hoare triple {22894#(<= ~counter~0 6)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22568#true} is VALID [2022-04-08 11:28:43,836 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {22568#true} {22894#(<= ~counter~0 6)} #83#return; {22894#(<= ~counter~0 6)} is VALID [2022-04-08 11:28:43,836 INFO L290 TraceCheckUtils]: 54: Hoare triple {22568#true} assume true; {22568#true} is VALID [2022-04-08 11:28:43,836 INFO L290 TraceCheckUtils]: 53: Hoare triple {22568#true} assume !(0 == ~cond); {22568#true} is VALID [2022-04-08 11:28:43,836 INFO L290 TraceCheckUtils]: 52: Hoare triple {22568#true} ~cond := #in~cond; {22568#true} is VALID [2022-04-08 11:28:43,836 INFO L272 TraceCheckUtils]: 51: Hoare triple {22894#(<= ~counter~0 6)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22568#true} is VALID [2022-04-08 11:28:43,836 INFO L290 TraceCheckUtils]: 50: Hoare triple {22894#(<= ~counter~0 6)} assume !!(#t~post7 < 10);havoc #t~post7; {22894#(<= ~counter~0 6)} is VALID [2022-04-08 11:28:43,837 INFO L290 TraceCheckUtils]: 49: Hoare triple {22854#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22894#(<= ~counter~0 6)} is VALID [2022-04-08 11:28:43,837 INFO L290 TraceCheckUtils]: 48: Hoare triple {22854#(<= ~counter~0 5)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {22854#(<= ~counter~0 5)} is VALID [2022-04-08 11:28:43,838 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {22568#true} {22854#(<= ~counter~0 5)} #89#return; {22854#(<= ~counter~0 5)} is VALID [2022-04-08 11:28:43,838 INFO L290 TraceCheckUtils]: 46: Hoare triple {22568#true} assume true; {22568#true} is VALID [2022-04-08 11:28:43,838 INFO L290 TraceCheckUtils]: 45: Hoare triple {22568#true} assume !(0 == ~cond); {22568#true} is VALID [2022-04-08 11:28:43,838 INFO L290 TraceCheckUtils]: 44: Hoare triple {22568#true} ~cond := #in~cond; {22568#true} is VALID [2022-04-08 11:28:43,838 INFO L272 TraceCheckUtils]: 43: Hoare triple {22854#(<= ~counter~0 5)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {22568#true} is VALID [2022-04-08 11:28:43,838 INFO L290 TraceCheckUtils]: 42: Hoare triple {22854#(<= ~counter~0 5)} assume !!(~r~0 >= 2 * ~b~0); {22854#(<= ~counter~0 5)} is VALID [2022-04-08 11:28:43,839 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {22568#true} {22854#(<= ~counter~0 5)} #87#return; {22854#(<= ~counter~0 5)} is VALID [2022-04-08 11:28:43,839 INFO L290 TraceCheckUtils]: 40: Hoare triple {22568#true} assume true; {22568#true} is VALID [2022-04-08 11:28:43,839 INFO L290 TraceCheckUtils]: 39: Hoare triple {22568#true} assume !(0 == ~cond); {22568#true} is VALID [2022-04-08 11:28:43,839 INFO L290 TraceCheckUtils]: 38: Hoare triple {22568#true} ~cond := #in~cond; {22568#true} is VALID [2022-04-08 11:28:43,839 INFO L272 TraceCheckUtils]: 37: Hoare triple {22854#(<= ~counter~0 5)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {22568#true} is VALID [2022-04-08 11:28:43,839 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {22568#true} {22854#(<= ~counter~0 5)} #85#return; {22854#(<= ~counter~0 5)} is VALID [2022-04-08 11:28:43,840 INFO L290 TraceCheckUtils]: 35: Hoare triple {22568#true} assume true; {22568#true} is VALID [2022-04-08 11:28:43,840 INFO L290 TraceCheckUtils]: 34: Hoare triple {22568#true} assume !(0 == ~cond); {22568#true} is VALID [2022-04-08 11:28:43,840 INFO L290 TraceCheckUtils]: 33: Hoare triple {22568#true} ~cond := #in~cond; {22568#true} is VALID [2022-04-08 11:28:43,840 INFO L272 TraceCheckUtils]: 32: Hoare triple {22854#(<= ~counter~0 5)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22568#true} is VALID [2022-04-08 11:28:43,840 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {22568#true} {22854#(<= ~counter~0 5)} #83#return; {22854#(<= ~counter~0 5)} is VALID [2022-04-08 11:28:43,840 INFO L290 TraceCheckUtils]: 30: Hoare triple {22568#true} assume true; {22568#true} is VALID [2022-04-08 11:28:43,840 INFO L290 TraceCheckUtils]: 29: Hoare triple {22568#true} assume !(0 == ~cond); {22568#true} is VALID [2022-04-08 11:28:43,841 INFO L290 TraceCheckUtils]: 28: Hoare triple {22568#true} ~cond := #in~cond; {22568#true} is VALID [2022-04-08 11:28:43,841 INFO L272 TraceCheckUtils]: 27: Hoare triple {22854#(<= ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22568#true} is VALID [2022-04-08 11:28:43,841 INFO L290 TraceCheckUtils]: 26: Hoare triple {22854#(<= ~counter~0 5)} assume !!(#t~post7 < 10);havoc #t~post7; {22854#(<= ~counter~0 5)} is VALID [2022-04-08 11:28:43,841 INFO L290 TraceCheckUtils]: 25: Hoare triple {22796#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22854#(<= ~counter~0 5)} is VALID [2022-04-08 11:28:43,842 INFO L290 TraceCheckUtils]: 24: Hoare triple {22796#(<= ~counter~0 4)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {22796#(<= ~counter~0 4)} is VALID [2022-04-08 11:28:43,842 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {22568#true} {22796#(<= ~counter~0 4)} #81#return; {22796#(<= ~counter~0 4)} is VALID [2022-04-08 11:28:43,842 INFO L290 TraceCheckUtils]: 22: Hoare triple {22568#true} assume true; {22568#true} is VALID [2022-04-08 11:28:43,842 INFO L290 TraceCheckUtils]: 21: Hoare triple {22568#true} assume !(0 == ~cond); {22568#true} is VALID [2022-04-08 11:28:43,843 INFO L290 TraceCheckUtils]: 20: Hoare triple {22568#true} ~cond := #in~cond; {22568#true} is VALID [2022-04-08 11:28:43,843 INFO L272 TraceCheckUtils]: 19: Hoare triple {22796#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {22568#true} is VALID [2022-04-08 11:28:43,843 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {22568#true} {22796#(<= ~counter~0 4)} #79#return; {22796#(<= ~counter~0 4)} is VALID [2022-04-08 11:28:43,843 INFO L290 TraceCheckUtils]: 17: Hoare triple {22568#true} assume true; {22568#true} is VALID [2022-04-08 11:28:43,843 INFO L290 TraceCheckUtils]: 16: Hoare triple {22568#true} assume !(0 == ~cond); {22568#true} is VALID [2022-04-08 11:28:43,843 INFO L290 TraceCheckUtils]: 15: Hoare triple {22568#true} ~cond := #in~cond; {22568#true} is VALID [2022-04-08 11:28:43,843 INFO L272 TraceCheckUtils]: 14: Hoare triple {22796#(<= ~counter~0 4)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {22568#true} is VALID [2022-04-08 11:28:43,844 INFO L290 TraceCheckUtils]: 13: Hoare triple {22796#(<= ~counter~0 4)} assume !!(#t~post6 < 10);havoc #t~post6; {22796#(<= ~counter~0 4)} is VALID [2022-04-08 11:28:43,844 INFO L290 TraceCheckUtils]: 12: Hoare triple {22723#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22796#(<= ~counter~0 4)} is VALID [2022-04-08 11:28:43,845 INFO L290 TraceCheckUtils]: 11: Hoare triple {22723#(<= ~counter~0 3)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {22723#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:43,845 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22568#true} {22723#(<= ~counter~0 3)} #77#return; {22723#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:43,845 INFO L290 TraceCheckUtils]: 9: Hoare triple {22568#true} assume true; {22568#true} is VALID [2022-04-08 11:28:43,845 INFO L290 TraceCheckUtils]: 8: Hoare triple {22568#true} assume !(0 == ~cond); {22568#true} is VALID [2022-04-08 11:28:43,845 INFO L290 TraceCheckUtils]: 7: Hoare triple {22568#true} ~cond := #in~cond; {22568#true} is VALID [2022-04-08 11:28:43,845 INFO L272 TraceCheckUtils]: 6: Hoare triple {22723#(<= ~counter~0 3)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {22568#true} is VALID [2022-04-08 11:28:43,846 INFO L290 TraceCheckUtils]: 5: Hoare triple {22723#(<= ~counter~0 3)} 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; {22723#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:43,846 INFO L272 TraceCheckUtils]: 4: Hoare triple {22723#(<= ~counter~0 3)} call #t~ret8 := main(); {22723#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:43,846 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22723#(<= ~counter~0 3)} {22568#true} #93#return; {22723#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:43,846 INFO L290 TraceCheckUtils]: 2: Hoare triple {22723#(<= ~counter~0 3)} assume true; {22723#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:43,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {22568#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; {22723#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:43,847 INFO L272 TraceCheckUtils]: 0: Hoare triple {22568#true} call ULTIMATE.init(); {22568#true} is VALID [2022-04-08 11:28:43,847 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 43 proven. 55 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2022-04-08 11:28:43,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:28:43,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906198404] [2022-04-08 11:28:43,848 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:28:43,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936581461] [2022-04-08 11:28:43,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936581461] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:28:43,848 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:28:43,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2022-04-08 11:28:43,848 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:28:43,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2139208138] [2022-04-08 11:28:43,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2139208138] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:28:43,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:28:43,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 11:28:43,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321983521] [2022-04-08 11:28:43,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:28:43,849 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 9 states have call successors, (23), 9 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-08 11:28:43,849 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:28:43,850 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 9 states have call successors, (23), 9 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-08 11:28:43,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:28:43,920 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 11:28:43,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:28:43,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 11:28:43,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 11:28:43,920 INFO L87 Difference]: Start difference. First operand 211 states and 251 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 9 states have call successors, (23), 9 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-08 11:28:44,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:28:44,867 INFO L93 Difference]: Finished difference Result 300 states and 342 transitions. [2022-04-08 11:28:44,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 11:28:44,867 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 9 states have call successors, (23), 9 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-08 11:28:44,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:28:44,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 9 states have call successors, (23), 9 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-08 11:28:44,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 158 transitions. [2022-04-08 11:28:44,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 9 states have call successors, (23), 9 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-08 11:28:44,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 158 transitions. [2022-04-08 11:28:44,871 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 158 transitions. [2022-04-08 11:28:44,989 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-08 11:28:44,994 INFO L225 Difference]: With dead ends: 300 [2022-04-08 11:28:44,994 INFO L226 Difference]: Without dead ends: 292 [2022-04-08 11:28:44,994 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 262 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=211, Unknown=0, NotChecked=0, Total=342 [2022-04-08 11:28:44,995 INFO L913 BasicCegarLoop]: 65 mSDtfsCounter, 52 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 11:28:44,995 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 229 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 11:28:44,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-04-08 11:28:45,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 287. [2022-04-08 11:28:45,386 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:28:45,387 INFO L82 GeneralOperation]: Start isEquivalent. First operand 292 states. Second operand has 287 states, 187 states have (on average 1.0962566844919786) internal successors, (205), 189 states have internal predecessors, (205), 63 states have call successors, (63), 38 states have call predecessors, (63), 36 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2022-04-08 11:28:45,387 INFO L74 IsIncluded]: Start isIncluded. First operand 292 states. Second operand has 287 states, 187 states have (on average 1.0962566844919786) internal successors, (205), 189 states have internal predecessors, (205), 63 states have call successors, (63), 38 states have call predecessors, (63), 36 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2022-04-08 11:28:45,387 INFO L87 Difference]: Start difference. First operand 292 states. Second operand has 287 states, 187 states have (on average 1.0962566844919786) internal successors, (205), 189 states have internal predecessors, (205), 63 states have call successors, (63), 38 states have call predecessors, (63), 36 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2022-04-08 11:28:45,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:28:45,391 INFO L93 Difference]: Finished difference Result 292 states and 333 transitions. [2022-04-08 11:28:45,391 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 333 transitions. [2022-04-08 11:28:45,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:28:45,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:28:45,392 INFO L74 IsIncluded]: Start isIncluded. First operand has 287 states, 187 states have (on average 1.0962566844919786) internal successors, (205), 189 states have internal predecessors, (205), 63 states have call successors, (63), 38 states have call predecessors, (63), 36 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) Second operand 292 states. [2022-04-08 11:28:45,392 INFO L87 Difference]: Start difference. First operand has 287 states, 187 states have (on average 1.0962566844919786) internal successors, (205), 189 states have internal predecessors, (205), 63 states have call successors, (63), 38 states have call predecessors, (63), 36 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) Second operand 292 states. [2022-04-08 11:28:45,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:28:45,396 INFO L93 Difference]: Finished difference Result 292 states and 333 transitions. [2022-04-08 11:28:45,396 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 333 transitions. [2022-04-08 11:28:45,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:28:45,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:28:45,397 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:28:45,397 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:28:45,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 187 states have (on average 1.0962566844919786) internal successors, (205), 189 states have internal predecessors, (205), 63 states have call successors, (63), 38 states have call predecessors, (63), 36 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2022-04-08 11:28:45,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 328 transitions. [2022-04-08 11:28:45,402 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 328 transitions. Word has length 138 [2022-04-08 11:28:45,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:28:45,402 INFO L478 AbstractCegarLoop]: Abstraction has 287 states and 328 transitions. [2022-04-08 11:28:45,403 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 9 states have call successors, (23), 9 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-08 11:28:45,403 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 287 states and 328 transitions. [2022-04-08 11:28:45,872 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 328 edges. 328 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:28:45,872 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 328 transitions. [2022-04-08 11:28:45,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-04-08 11:28:45,873 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:28:45,873 INFO L499 BasicCegarLoop]: trace histogram [23, 22, 22, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2022-04-08 11:28:45,898 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-08 11:28:46,089 WARN L460 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-08 11:28:46,089 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:28:46,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:28:46,090 INFO L85 PathProgramCache]: Analyzing trace with hash -559679257, now seen corresponding path program 7 times [2022-04-08 11:28:46,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:28:46,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [832832836] [2022-04-08 11:29:30,495 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:29:30,495 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:29:30,495 INFO L85 PathProgramCache]: Analyzing trace with hash -559679257, now seen corresponding path program 8 times [2022-04-08 11:29:30,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:29:30,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135925533] [2022-04-08 11:29:30,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:29:30,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:29:30,510 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:29:30,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1064677598] [2022-04-08 11:29:30,511 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:29:30,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:29:30,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:29:30,512 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-08 11:29:30,512 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-08 11:29:30,584 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:29:30,584 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:29:30,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 11:29:30,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:29:30,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:29:31,175 INFO L272 TraceCheckUtils]: 0: Hoare triple {25177#true} call ULTIMATE.init(); {25177#true} is VALID [2022-04-08 11:29:31,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {25177#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; {25185#(<= ~counter~0 0)} is VALID [2022-04-08 11:29:31,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {25185#(<= ~counter~0 0)} assume true; {25185#(<= ~counter~0 0)} is VALID [2022-04-08 11:29:31,177 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25185#(<= ~counter~0 0)} {25177#true} #93#return; {25185#(<= ~counter~0 0)} is VALID [2022-04-08 11:29:31,177 INFO L272 TraceCheckUtils]: 4: Hoare triple {25185#(<= ~counter~0 0)} call #t~ret8 := main(); {25185#(<= ~counter~0 0)} is VALID [2022-04-08 11:29:31,177 INFO L290 TraceCheckUtils]: 5: Hoare triple {25185#(<= ~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; {25185#(<= ~counter~0 0)} is VALID [2022-04-08 11:29:31,178 INFO L272 TraceCheckUtils]: 6: Hoare triple {25185#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {25185#(<= ~counter~0 0)} is VALID [2022-04-08 11:29:31,178 INFO L290 TraceCheckUtils]: 7: Hoare triple {25185#(<= ~counter~0 0)} ~cond := #in~cond; {25185#(<= ~counter~0 0)} is VALID [2022-04-08 11:29:31,178 INFO L290 TraceCheckUtils]: 8: Hoare triple {25185#(<= ~counter~0 0)} assume !(0 == ~cond); {25185#(<= ~counter~0 0)} is VALID [2022-04-08 11:29:31,178 INFO L290 TraceCheckUtils]: 9: Hoare triple {25185#(<= ~counter~0 0)} assume true; {25185#(<= ~counter~0 0)} is VALID [2022-04-08 11:29:31,179 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {25185#(<= ~counter~0 0)} {25185#(<= ~counter~0 0)} #77#return; {25185#(<= ~counter~0 0)} is VALID [2022-04-08 11:29:31,179 INFO L290 TraceCheckUtils]: 11: Hoare triple {25185#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {25185#(<= ~counter~0 0)} is VALID [2022-04-08 11:29:31,180 INFO L290 TraceCheckUtils]: 12: Hoare triple {25185#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25219#(<= ~counter~0 1)} is VALID [2022-04-08 11:29:31,180 INFO L290 TraceCheckUtils]: 13: Hoare triple {25219#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {25219#(<= ~counter~0 1)} is VALID [2022-04-08 11:29:31,181 INFO L272 TraceCheckUtils]: 14: Hoare triple {25219#(<= ~counter~0 1)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25219#(<= ~counter~0 1)} is VALID [2022-04-08 11:29:31,181 INFO L290 TraceCheckUtils]: 15: Hoare triple {25219#(<= ~counter~0 1)} ~cond := #in~cond; {25219#(<= ~counter~0 1)} is VALID [2022-04-08 11:29:31,181 INFO L290 TraceCheckUtils]: 16: Hoare triple {25219#(<= ~counter~0 1)} assume !(0 == ~cond); {25219#(<= ~counter~0 1)} is VALID [2022-04-08 11:29:31,181 INFO L290 TraceCheckUtils]: 17: Hoare triple {25219#(<= ~counter~0 1)} assume true; {25219#(<= ~counter~0 1)} is VALID [2022-04-08 11:29:31,182 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {25219#(<= ~counter~0 1)} {25219#(<= ~counter~0 1)} #79#return; {25219#(<= ~counter~0 1)} is VALID [2022-04-08 11:29:31,182 INFO L272 TraceCheckUtils]: 19: Hoare triple {25219#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25219#(<= ~counter~0 1)} is VALID [2022-04-08 11:29:31,183 INFO L290 TraceCheckUtils]: 20: Hoare triple {25219#(<= ~counter~0 1)} ~cond := #in~cond; {25219#(<= ~counter~0 1)} is VALID [2022-04-08 11:29:31,183 INFO L290 TraceCheckUtils]: 21: Hoare triple {25219#(<= ~counter~0 1)} assume !(0 == ~cond); {25219#(<= ~counter~0 1)} is VALID [2022-04-08 11:29:31,183 INFO L290 TraceCheckUtils]: 22: Hoare triple {25219#(<= ~counter~0 1)} assume true; {25219#(<= ~counter~0 1)} is VALID [2022-04-08 11:29:31,184 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {25219#(<= ~counter~0 1)} {25219#(<= ~counter~0 1)} #81#return; {25219#(<= ~counter~0 1)} is VALID [2022-04-08 11:29:31,184 INFO L290 TraceCheckUtils]: 24: Hoare triple {25219#(<= ~counter~0 1)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {25219#(<= ~counter~0 1)} is VALID [2022-04-08 11:29:31,184 INFO L290 TraceCheckUtils]: 25: Hoare triple {25219#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {25259#(<= ~counter~0 2)} is VALID [2022-04-08 11:29:31,185 INFO L290 TraceCheckUtils]: 26: Hoare triple {25259#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {25259#(<= ~counter~0 2)} is VALID [2022-04-08 11:29:31,185 INFO L272 TraceCheckUtils]: 27: Hoare triple {25259#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25259#(<= ~counter~0 2)} is VALID [2022-04-08 11:29:31,185 INFO L290 TraceCheckUtils]: 28: Hoare triple {25259#(<= ~counter~0 2)} ~cond := #in~cond; {25259#(<= ~counter~0 2)} is VALID [2022-04-08 11:29:31,186 INFO L290 TraceCheckUtils]: 29: Hoare triple {25259#(<= ~counter~0 2)} assume !(0 == ~cond); {25259#(<= ~counter~0 2)} is VALID [2022-04-08 11:29:31,186 INFO L290 TraceCheckUtils]: 30: Hoare triple {25259#(<= ~counter~0 2)} assume true; {25259#(<= ~counter~0 2)} is VALID [2022-04-08 11:29:31,186 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {25259#(<= ~counter~0 2)} {25259#(<= ~counter~0 2)} #83#return; {25259#(<= ~counter~0 2)} is VALID [2022-04-08 11:29:31,187 INFO L272 TraceCheckUtils]: 32: Hoare triple {25259#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25259#(<= ~counter~0 2)} is VALID [2022-04-08 11:29:31,187 INFO L290 TraceCheckUtils]: 33: Hoare triple {25259#(<= ~counter~0 2)} ~cond := #in~cond; {25259#(<= ~counter~0 2)} is VALID [2022-04-08 11:29:31,188 INFO L290 TraceCheckUtils]: 34: Hoare triple {25259#(<= ~counter~0 2)} assume !(0 == ~cond); {25259#(<= ~counter~0 2)} is VALID [2022-04-08 11:29:31,188 INFO L290 TraceCheckUtils]: 35: Hoare triple {25259#(<= ~counter~0 2)} assume true; {25259#(<= ~counter~0 2)} is VALID [2022-04-08 11:29:31,188 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {25259#(<= ~counter~0 2)} {25259#(<= ~counter~0 2)} #85#return; {25259#(<= ~counter~0 2)} is VALID [2022-04-08 11:29:31,189 INFO L272 TraceCheckUtils]: 37: Hoare triple {25259#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {25259#(<= ~counter~0 2)} is VALID [2022-04-08 11:29:31,189 INFO L290 TraceCheckUtils]: 38: Hoare triple {25259#(<= ~counter~0 2)} ~cond := #in~cond; {25259#(<= ~counter~0 2)} is VALID [2022-04-08 11:29:31,189 INFO L290 TraceCheckUtils]: 39: Hoare triple {25259#(<= ~counter~0 2)} assume !(0 == ~cond); {25259#(<= ~counter~0 2)} is VALID [2022-04-08 11:29:31,189 INFO L290 TraceCheckUtils]: 40: Hoare triple {25259#(<= ~counter~0 2)} assume true; {25259#(<= ~counter~0 2)} is VALID [2022-04-08 11:29:31,190 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {25259#(<= ~counter~0 2)} {25259#(<= ~counter~0 2)} #87#return; {25259#(<= ~counter~0 2)} is VALID [2022-04-08 11:29:31,190 INFO L290 TraceCheckUtils]: 42: Hoare triple {25259#(<= ~counter~0 2)} assume !!(~r~0 >= 2 * ~b~0); {25259#(<= ~counter~0 2)} is VALID [2022-04-08 11:29:31,191 INFO L272 TraceCheckUtils]: 43: Hoare triple {25259#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {25259#(<= ~counter~0 2)} is VALID [2022-04-08 11:29:31,191 INFO L290 TraceCheckUtils]: 44: Hoare triple {25259#(<= ~counter~0 2)} ~cond := #in~cond; {25259#(<= ~counter~0 2)} is VALID [2022-04-08 11:29:31,191 INFO L290 TraceCheckUtils]: 45: Hoare triple {25259#(<= ~counter~0 2)} assume !(0 == ~cond); {25259#(<= ~counter~0 2)} is VALID [2022-04-08 11:29:31,191 INFO L290 TraceCheckUtils]: 46: Hoare triple {25259#(<= ~counter~0 2)} assume true; {25259#(<= ~counter~0 2)} is VALID [2022-04-08 11:29:31,192 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {25259#(<= ~counter~0 2)} {25259#(<= ~counter~0 2)} #89#return; {25259#(<= ~counter~0 2)} is VALID [2022-04-08 11:29:31,192 INFO L290 TraceCheckUtils]: 48: Hoare triple {25259#(<= ~counter~0 2)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {25259#(<= ~counter~0 2)} is VALID [2022-04-08 11:29:31,194 INFO L290 TraceCheckUtils]: 49: Hoare triple {25259#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {25332#(<= ~counter~0 3)} is VALID [2022-04-08 11:29:31,194 INFO L290 TraceCheckUtils]: 50: Hoare triple {25332#(<= ~counter~0 3)} assume !!(#t~post7 < 10);havoc #t~post7; {25332#(<= ~counter~0 3)} is VALID [2022-04-08 11:29:31,194 INFO L272 TraceCheckUtils]: 51: Hoare triple {25332#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25332#(<= ~counter~0 3)} is VALID [2022-04-08 11:29:31,195 INFO L290 TraceCheckUtils]: 52: Hoare triple {25332#(<= ~counter~0 3)} ~cond := #in~cond; {25332#(<= ~counter~0 3)} is VALID [2022-04-08 11:29:31,195 INFO L290 TraceCheckUtils]: 53: Hoare triple {25332#(<= ~counter~0 3)} assume !(0 == ~cond); {25332#(<= ~counter~0 3)} is VALID [2022-04-08 11:29:31,195 INFO L290 TraceCheckUtils]: 54: Hoare triple {25332#(<= ~counter~0 3)} assume true; {25332#(<= ~counter~0 3)} is VALID [2022-04-08 11:29:31,196 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {25332#(<= ~counter~0 3)} {25332#(<= ~counter~0 3)} #83#return; {25332#(<= ~counter~0 3)} is VALID [2022-04-08 11:29:31,196 INFO L272 TraceCheckUtils]: 56: Hoare triple {25332#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25332#(<= ~counter~0 3)} is VALID [2022-04-08 11:29:31,196 INFO L290 TraceCheckUtils]: 57: Hoare triple {25332#(<= ~counter~0 3)} ~cond := #in~cond; {25332#(<= ~counter~0 3)} is VALID [2022-04-08 11:29:31,197 INFO L290 TraceCheckUtils]: 58: Hoare triple {25332#(<= ~counter~0 3)} assume !(0 == ~cond); {25332#(<= ~counter~0 3)} is VALID [2022-04-08 11:29:31,197 INFO L290 TraceCheckUtils]: 59: Hoare triple {25332#(<= ~counter~0 3)} assume true; {25332#(<= ~counter~0 3)} is VALID [2022-04-08 11:29:31,197 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {25332#(<= ~counter~0 3)} {25332#(<= ~counter~0 3)} #85#return; {25332#(<= ~counter~0 3)} is VALID [2022-04-08 11:29:31,198 INFO L272 TraceCheckUtils]: 61: Hoare triple {25332#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {25332#(<= ~counter~0 3)} is VALID [2022-04-08 11:29:31,198 INFO L290 TraceCheckUtils]: 62: Hoare triple {25332#(<= ~counter~0 3)} ~cond := #in~cond; {25332#(<= ~counter~0 3)} is VALID [2022-04-08 11:29:31,198 INFO L290 TraceCheckUtils]: 63: Hoare triple {25332#(<= ~counter~0 3)} assume !(0 == ~cond); {25332#(<= ~counter~0 3)} is VALID [2022-04-08 11:29:31,199 INFO L290 TraceCheckUtils]: 64: Hoare triple {25332#(<= ~counter~0 3)} assume true; {25332#(<= ~counter~0 3)} is VALID [2022-04-08 11:29:31,199 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {25332#(<= ~counter~0 3)} {25332#(<= ~counter~0 3)} #87#return; {25332#(<= ~counter~0 3)} is VALID [2022-04-08 11:29:31,199 INFO L290 TraceCheckUtils]: 66: Hoare triple {25332#(<= ~counter~0 3)} assume !!(~r~0 >= 2 * ~b~0); {25332#(<= ~counter~0 3)} is VALID [2022-04-08 11:29:31,200 INFO L272 TraceCheckUtils]: 67: Hoare triple {25332#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {25332#(<= ~counter~0 3)} is VALID [2022-04-08 11:29:31,200 INFO L290 TraceCheckUtils]: 68: Hoare triple {25332#(<= ~counter~0 3)} ~cond := #in~cond; {25332#(<= ~counter~0 3)} is VALID [2022-04-08 11:29:31,200 INFO L290 TraceCheckUtils]: 69: Hoare triple {25332#(<= ~counter~0 3)} assume !(0 == ~cond); {25332#(<= ~counter~0 3)} is VALID [2022-04-08 11:29:31,201 INFO L290 TraceCheckUtils]: 70: Hoare triple {25332#(<= ~counter~0 3)} assume true; {25332#(<= ~counter~0 3)} is VALID [2022-04-08 11:29:31,201 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {25332#(<= ~counter~0 3)} {25332#(<= ~counter~0 3)} #89#return; {25332#(<= ~counter~0 3)} is VALID [2022-04-08 11:29:31,201 INFO L290 TraceCheckUtils]: 72: Hoare triple {25332#(<= ~counter~0 3)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {25332#(<= ~counter~0 3)} is VALID [2022-04-08 11:29:31,202 INFO L290 TraceCheckUtils]: 73: Hoare triple {25332#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {25405#(<= ~counter~0 4)} is VALID [2022-04-08 11:29:31,202 INFO L290 TraceCheckUtils]: 74: Hoare triple {25405#(<= ~counter~0 4)} assume !!(#t~post7 < 10);havoc #t~post7; {25405#(<= ~counter~0 4)} is VALID [2022-04-08 11:29:31,203 INFO L272 TraceCheckUtils]: 75: Hoare triple {25405#(<= ~counter~0 4)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25405#(<= ~counter~0 4)} is VALID [2022-04-08 11:29:31,203 INFO L290 TraceCheckUtils]: 76: Hoare triple {25405#(<= ~counter~0 4)} ~cond := #in~cond; {25405#(<= ~counter~0 4)} is VALID [2022-04-08 11:29:31,203 INFO L290 TraceCheckUtils]: 77: Hoare triple {25405#(<= ~counter~0 4)} assume !(0 == ~cond); {25405#(<= ~counter~0 4)} is VALID [2022-04-08 11:29:31,203 INFO L290 TraceCheckUtils]: 78: Hoare triple {25405#(<= ~counter~0 4)} assume true; {25405#(<= ~counter~0 4)} is VALID [2022-04-08 11:29:31,204 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {25405#(<= ~counter~0 4)} {25405#(<= ~counter~0 4)} #83#return; {25405#(<= ~counter~0 4)} is VALID [2022-04-08 11:29:31,205 INFO L272 TraceCheckUtils]: 80: Hoare triple {25405#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25405#(<= ~counter~0 4)} is VALID [2022-04-08 11:29:31,205 INFO L290 TraceCheckUtils]: 81: Hoare triple {25405#(<= ~counter~0 4)} ~cond := #in~cond; {25405#(<= ~counter~0 4)} is VALID [2022-04-08 11:29:31,205 INFO L290 TraceCheckUtils]: 82: Hoare triple {25405#(<= ~counter~0 4)} assume !(0 == ~cond); {25405#(<= ~counter~0 4)} is VALID [2022-04-08 11:29:31,206 INFO L290 TraceCheckUtils]: 83: Hoare triple {25405#(<= ~counter~0 4)} assume true; {25405#(<= ~counter~0 4)} is VALID [2022-04-08 11:29:31,206 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {25405#(<= ~counter~0 4)} {25405#(<= ~counter~0 4)} #85#return; {25405#(<= ~counter~0 4)} is VALID [2022-04-08 11:29:31,207 INFO L272 TraceCheckUtils]: 85: Hoare triple {25405#(<= ~counter~0 4)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {25405#(<= ~counter~0 4)} is VALID [2022-04-08 11:29:31,207 INFO L290 TraceCheckUtils]: 86: Hoare triple {25405#(<= ~counter~0 4)} ~cond := #in~cond; {25405#(<= ~counter~0 4)} is VALID [2022-04-08 11:29:31,207 INFO L290 TraceCheckUtils]: 87: Hoare triple {25405#(<= ~counter~0 4)} assume !(0 == ~cond); {25405#(<= ~counter~0 4)} is VALID [2022-04-08 11:29:31,211 INFO L290 TraceCheckUtils]: 88: Hoare triple {25405#(<= ~counter~0 4)} assume true; {25405#(<= ~counter~0 4)} is VALID [2022-04-08 11:29:31,212 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {25405#(<= ~counter~0 4)} {25405#(<= ~counter~0 4)} #87#return; {25405#(<= ~counter~0 4)} is VALID [2022-04-08 11:29:31,212 INFO L290 TraceCheckUtils]: 90: Hoare triple {25405#(<= ~counter~0 4)} assume !(~r~0 >= 2 * ~b~0); {25405#(<= ~counter~0 4)} is VALID [2022-04-08 11:29:31,212 INFO L290 TraceCheckUtils]: 91: Hoare triple {25405#(<= ~counter~0 4)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {25405#(<= ~counter~0 4)} is VALID [2022-04-08 11:29:31,213 INFO L290 TraceCheckUtils]: 92: Hoare triple {25405#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25463#(<= ~counter~0 5)} is VALID [2022-04-08 11:29:31,213 INFO L290 TraceCheckUtils]: 93: Hoare triple {25463#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {25463#(<= ~counter~0 5)} is VALID [2022-04-08 11:29:31,214 INFO L272 TraceCheckUtils]: 94: Hoare triple {25463#(<= ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25463#(<= ~counter~0 5)} is VALID [2022-04-08 11:29:31,214 INFO L290 TraceCheckUtils]: 95: Hoare triple {25463#(<= ~counter~0 5)} ~cond := #in~cond; {25463#(<= ~counter~0 5)} is VALID [2022-04-08 11:29:31,215 INFO L290 TraceCheckUtils]: 96: Hoare triple {25463#(<= ~counter~0 5)} assume !(0 == ~cond); {25463#(<= ~counter~0 5)} is VALID [2022-04-08 11:29:31,215 INFO L290 TraceCheckUtils]: 97: Hoare triple {25463#(<= ~counter~0 5)} assume true; {25463#(<= ~counter~0 5)} is VALID [2022-04-08 11:29:31,216 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {25463#(<= ~counter~0 5)} {25463#(<= ~counter~0 5)} #79#return; {25463#(<= ~counter~0 5)} is VALID [2022-04-08 11:29:31,216 INFO L272 TraceCheckUtils]: 99: Hoare triple {25463#(<= ~counter~0 5)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25463#(<= ~counter~0 5)} is VALID [2022-04-08 11:29:31,216 INFO L290 TraceCheckUtils]: 100: Hoare triple {25463#(<= ~counter~0 5)} ~cond := #in~cond; {25463#(<= ~counter~0 5)} is VALID [2022-04-08 11:29:31,217 INFO L290 TraceCheckUtils]: 101: Hoare triple {25463#(<= ~counter~0 5)} assume !(0 == ~cond); {25463#(<= ~counter~0 5)} is VALID [2022-04-08 11:29:31,217 INFO L290 TraceCheckUtils]: 102: Hoare triple {25463#(<= ~counter~0 5)} assume true; {25463#(<= ~counter~0 5)} is VALID [2022-04-08 11:29:31,218 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {25463#(<= ~counter~0 5)} {25463#(<= ~counter~0 5)} #81#return; {25463#(<= ~counter~0 5)} is VALID [2022-04-08 11:29:31,218 INFO L290 TraceCheckUtils]: 104: Hoare triple {25463#(<= ~counter~0 5)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {25463#(<= ~counter~0 5)} is VALID [2022-04-08 11:29:31,219 INFO L290 TraceCheckUtils]: 105: Hoare triple {25463#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {25503#(<= ~counter~0 6)} is VALID [2022-04-08 11:29:31,219 INFO L290 TraceCheckUtils]: 106: Hoare triple {25503#(<= ~counter~0 6)} assume !!(#t~post7 < 10);havoc #t~post7; {25503#(<= ~counter~0 6)} is VALID [2022-04-08 11:29:31,220 INFO L272 TraceCheckUtils]: 107: Hoare triple {25503#(<= ~counter~0 6)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25503#(<= ~counter~0 6)} is VALID [2022-04-08 11:29:31,220 INFO L290 TraceCheckUtils]: 108: Hoare triple {25503#(<= ~counter~0 6)} ~cond := #in~cond; {25503#(<= ~counter~0 6)} is VALID [2022-04-08 11:29:31,220 INFO L290 TraceCheckUtils]: 109: Hoare triple {25503#(<= ~counter~0 6)} assume !(0 == ~cond); {25503#(<= ~counter~0 6)} is VALID [2022-04-08 11:29:31,221 INFO L290 TraceCheckUtils]: 110: Hoare triple {25503#(<= ~counter~0 6)} assume true; {25503#(<= ~counter~0 6)} is VALID [2022-04-08 11:29:31,221 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {25503#(<= ~counter~0 6)} {25503#(<= ~counter~0 6)} #83#return; {25503#(<= ~counter~0 6)} is VALID [2022-04-08 11:29:31,222 INFO L272 TraceCheckUtils]: 112: Hoare triple {25503#(<= ~counter~0 6)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25503#(<= ~counter~0 6)} is VALID [2022-04-08 11:29:31,223 INFO L290 TraceCheckUtils]: 113: Hoare triple {25503#(<= ~counter~0 6)} ~cond := #in~cond; {25503#(<= ~counter~0 6)} is VALID [2022-04-08 11:29:31,223 INFO L290 TraceCheckUtils]: 114: Hoare triple {25503#(<= ~counter~0 6)} assume !(0 == ~cond); {25503#(<= ~counter~0 6)} is VALID [2022-04-08 11:29:31,223 INFO L290 TraceCheckUtils]: 115: Hoare triple {25503#(<= ~counter~0 6)} assume true; {25503#(<= ~counter~0 6)} is VALID [2022-04-08 11:29:31,224 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {25503#(<= ~counter~0 6)} {25503#(<= ~counter~0 6)} #85#return; {25503#(<= ~counter~0 6)} is VALID [2022-04-08 11:29:31,224 INFO L272 TraceCheckUtils]: 117: Hoare triple {25503#(<= ~counter~0 6)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {25503#(<= ~counter~0 6)} is VALID [2022-04-08 11:29:31,225 INFO L290 TraceCheckUtils]: 118: Hoare triple {25503#(<= ~counter~0 6)} ~cond := #in~cond; {25503#(<= ~counter~0 6)} is VALID [2022-04-08 11:29:31,225 INFO L290 TraceCheckUtils]: 119: Hoare triple {25503#(<= ~counter~0 6)} assume !(0 == ~cond); {25503#(<= ~counter~0 6)} is VALID [2022-04-08 11:29:31,225 INFO L290 TraceCheckUtils]: 120: Hoare triple {25503#(<= ~counter~0 6)} assume true; {25503#(<= ~counter~0 6)} is VALID [2022-04-08 11:29:31,226 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {25503#(<= ~counter~0 6)} {25503#(<= ~counter~0 6)} #87#return; {25503#(<= ~counter~0 6)} is VALID [2022-04-08 11:29:31,226 INFO L290 TraceCheckUtils]: 122: Hoare triple {25503#(<= ~counter~0 6)} assume !!(~r~0 >= 2 * ~b~0); {25503#(<= ~counter~0 6)} is VALID [2022-04-08 11:29:31,227 INFO L272 TraceCheckUtils]: 123: Hoare triple {25503#(<= ~counter~0 6)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {25503#(<= ~counter~0 6)} is VALID [2022-04-08 11:29:31,227 INFO L290 TraceCheckUtils]: 124: Hoare triple {25503#(<= ~counter~0 6)} ~cond := #in~cond; {25503#(<= ~counter~0 6)} is VALID [2022-04-08 11:29:31,227 INFO L290 TraceCheckUtils]: 125: Hoare triple {25503#(<= ~counter~0 6)} assume !(0 == ~cond); {25503#(<= ~counter~0 6)} is VALID [2022-04-08 11:29:31,228 INFO L290 TraceCheckUtils]: 126: Hoare triple {25503#(<= ~counter~0 6)} assume true; {25503#(<= ~counter~0 6)} is VALID [2022-04-08 11:29:31,228 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {25503#(<= ~counter~0 6)} {25503#(<= ~counter~0 6)} #89#return; {25503#(<= ~counter~0 6)} is VALID [2022-04-08 11:29:31,229 INFO L290 TraceCheckUtils]: 128: Hoare triple {25503#(<= ~counter~0 6)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {25503#(<= ~counter~0 6)} is VALID [2022-04-08 11:29:31,229 INFO L290 TraceCheckUtils]: 129: Hoare triple {25503#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {25576#(<= ~counter~0 7)} is VALID [2022-04-08 11:29:31,230 INFO L290 TraceCheckUtils]: 130: Hoare triple {25576#(<= ~counter~0 7)} assume !!(#t~post7 < 10);havoc #t~post7; {25576#(<= ~counter~0 7)} is VALID [2022-04-08 11:29:31,230 INFO L272 TraceCheckUtils]: 131: Hoare triple {25576#(<= ~counter~0 7)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25576#(<= ~counter~0 7)} is VALID [2022-04-08 11:29:31,230 INFO L290 TraceCheckUtils]: 132: Hoare triple {25576#(<= ~counter~0 7)} ~cond := #in~cond; {25576#(<= ~counter~0 7)} is VALID [2022-04-08 11:29:31,231 INFO L290 TraceCheckUtils]: 133: Hoare triple {25576#(<= ~counter~0 7)} assume !(0 == ~cond); {25576#(<= ~counter~0 7)} is VALID [2022-04-08 11:29:31,231 INFO L290 TraceCheckUtils]: 134: Hoare triple {25576#(<= ~counter~0 7)} assume true; {25576#(<= ~counter~0 7)} is VALID [2022-04-08 11:29:31,231 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {25576#(<= ~counter~0 7)} {25576#(<= ~counter~0 7)} #83#return; {25576#(<= ~counter~0 7)} is VALID [2022-04-08 11:29:31,232 INFO L272 TraceCheckUtils]: 136: Hoare triple {25576#(<= ~counter~0 7)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25576#(<= ~counter~0 7)} is VALID [2022-04-08 11:29:31,232 INFO L290 TraceCheckUtils]: 137: Hoare triple {25576#(<= ~counter~0 7)} ~cond := #in~cond; {25576#(<= ~counter~0 7)} is VALID [2022-04-08 11:29:31,233 INFO L290 TraceCheckUtils]: 138: Hoare triple {25576#(<= ~counter~0 7)} assume !(0 == ~cond); {25576#(<= ~counter~0 7)} is VALID [2022-04-08 11:29:31,233 INFO L290 TraceCheckUtils]: 139: Hoare triple {25576#(<= ~counter~0 7)} assume true; {25576#(<= ~counter~0 7)} is VALID [2022-04-08 11:29:31,234 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {25576#(<= ~counter~0 7)} {25576#(<= ~counter~0 7)} #85#return; {25576#(<= ~counter~0 7)} is VALID [2022-04-08 11:29:31,234 INFO L272 TraceCheckUtils]: 141: Hoare triple {25576#(<= ~counter~0 7)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {25576#(<= ~counter~0 7)} is VALID [2022-04-08 11:29:31,234 INFO L290 TraceCheckUtils]: 142: Hoare triple {25576#(<= ~counter~0 7)} ~cond := #in~cond; {25576#(<= ~counter~0 7)} is VALID [2022-04-08 11:29:31,235 INFO L290 TraceCheckUtils]: 143: Hoare triple {25576#(<= ~counter~0 7)} assume !(0 == ~cond); {25576#(<= ~counter~0 7)} is VALID [2022-04-08 11:29:31,235 INFO L290 TraceCheckUtils]: 144: Hoare triple {25576#(<= ~counter~0 7)} assume true; {25576#(<= ~counter~0 7)} is VALID [2022-04-08 11:29:31,235 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {25576#(<= ~counter~0 7)} {25576#(<= ~counter~0 7)} #87#return; {25576#(<= ~counter~0 7)} is VALID [2022-04-08 11:29:31,236 INFO L290 TraceCheckUtils]: 146: Hoare triple {25576#(<= ~counter~0 7)} assume !(~r~0 >= 2 * ~b~0); {25576#(<= ~counter~0 7)} is VALID [2022-04-08 11:29:31,236 INFO L290 TraceCheckUtils]: 147: Hoare triple {25576#(<= ~counter~0 7)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {25576#(<= ~counter~0 7)} is VALID [2022-04-08 11:29:31,236 INFO L290 TraceCheckUtils]: 148: Hoare triple {25576#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25634#(<= |main_#t~post6| 7)} is VALID [2022-04-08 11:29:31,237 INFO L290 TraceCheckUtils]: 149: Hoare triple {25634#(<= |main_#t~post6| 7)} assume !(#t~post6 < 10);havoc #t~post6; {25178#false} is VALID [2022-04-08 11:29:31,237 INFO L272 TraceCheckUtils]: 150: Hoare triple {25178#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25178#false} is VALID [2022-04-08 11:29:31,237 INFO L290 TraceCheckUtils]: 151: Hoare triple {25178#false} ~cond := #in~cond; {25178#false} is VALID [2022-04-08 11:29:31,237 INFO L290 TraceCheckUtils]: 152: Hoare triple {25178#false} assume 0 == ~cond; {25178#false} is VALID [2022-04-08 11:29:31,237 INFO L290 TraceCheckUtils]: 153: Hoare triple {25178#false} assume !false; {25178#false} is VALID [2022-04-08 11:29:31,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1044 backedges. 44 proven. 896 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-04-08 11:29:31,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:29:31,754 INFO L290 TraceCheckUtils]: 153: Hoare triple {25178#false} assume !false; {25178#false} is VALID [2022-04-08 11:29:31,754 INFO L290 TraceCheckUtils]: 152: Hoare triple {25178#false} assume 0 == ~cond; {25178#false} is VALID [2022-04-08 11:29:31,754 INFO L290 TraceCheckUtils]: 151: Hoare triple {25178#false} ~cond := #in~cond; {25178#false} is VALID [2022-04-08 11:29:31,755 INFO L272 TraceCheckUtils]: 150: Hoare triple {25178#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25178#false} is VALID [2022-04-08 11:29:31,755 INFO L290 TraceCheckUtils]: 149: Hoare triple {25662#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {25178#false} is VALID [2022-04-08 11:29:31,755 INFO L290 TraceCheckUtils]: 148: Hoare triple {25666#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25662#(< |main_#t~post6| 10)} is VALID [2022-04-08 11:29:31,756 INFO L290 TraceCheckUtils]: 147: Hoare triple {25666#(< ~counter~0 10)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {25666#(< ~counter~0 10)} is VALID [2022-04-08 11:29:31,756 INFO L290 TraceCheckUtils]: 146: Hoare triple {25666#(< ~counter~0 10)} assume !(~r~0 >= 2 * ~b~0); {25666#(< ~counter~0 10)} is VALID [2022-04-08 11:29:31,756 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {25177#true} {25666#(< ~counter~0 10)} #87#return; {25666#(< ~counter~0 10)} is VALID [2022-04-08 11:29:31,756 INFO L290 TraceCheckUtils]: 144: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-04-08 11:29:31,756 INFO L290 TraceCheckUtils]: 143: Hoare triple {25177#true} assume !(0 == ~cond); {25177#true} is VALID [2022-04-08 11:29:31,757 INFO L290 TraceCheckUtils]: 142: Hoare triple {25177#true} ~cond := #in~cond; {25177#true} is VALID [2022-04-08 11:29:31,757 INFO L272 TraceCheckUtils]: 141: Hoare triple {25666#(< ~counter~0 10)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {25177#true} is VALID [2022-04-08 11:29:31,757 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {25177#true} {25666#(< ~counter~0 10)} #85#return; {25666#(< ~counter~0 10)} is VALID [2022-04-08 11:29:31,757 INFO L290 TraceCheckUtils]: 139: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-04-08 11:29:31,757 INFO L290 TraceCheckUtils]: 138: Hoare triple {25177#true} assume !(0 == ~cond); {25177#true} is VALID [2022-04-08 11:29:31,757 INFO L290 TraceCheckUtils]: 137: Hoare triple {25177#true} ~cond := #in~cond; {25177#true} is VALID [2022-04-08 11:29:31,757 INFO L272 TraceCheckUtils]: 136: Hoare triple {25666#(< ~counter~0 10)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25177#true} is VALID [2022-04-08 11:29:31,758 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {25177#true} {25666#(< ~counter~0 10)} #83#return; {25666#(< ~counter~0 10)} is VALID [2022-04-08 11:29:31,758 INFO L290 TraceCheckUtils]: 134: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-04-08 11:29:31,758 INFO L290 TraceCheckUtils]: 133: Hoare triple {25177#true} assume !(0 == ~cond); {25177#true} is VALID [2022-04-08 11:29:31,758 INFO L290 TraceCheckUtils]: 132: Hoare triple {25177#true} ~cond := #in~cond; {25177#true} is VALID [2022-04-08 11:29:31,758 INFO L272 TraceCheckUtils]: 131: Hoare triple {25666#(< ~counter~0 10)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25177#true} is VALID [2022-04-08 11:29:31,759 INFO L290 TraceCheckUtils]: 130: Hoare triple {25666#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {25666#(< ~counter~0 10)} is VALID [2022-04-08 11:29:31,759 INFO L290 TraceCheckUtils]: 129: Hoare triple {25724#(< ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {25666#(< ~counter~0 10)} is VALID [2022-04-08 11:29:31,760 INFO L290 TraceCheckUtils]: 128: Hoare triple {25724#(< ~counter~0 9)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {25724#(< ~counter~0 9)} is VALID [2022-04-08 11:29:31,760 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {25177#true} {25724#(< ~counter~0 9)} #89#return; {25724#(< ~counter~0 9)} is VALID [2022-04-08 11:29:31,760 INFO L290 TraceCheckUtils]: 126: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-04-08 11:29:31,760 INFO L290 TraceCheckUtils]: 125: Hoare triple {25177#true} assume !(0 == ~cond); {25177#true} is VALID [2022-04-08 11:29:31,760 INFO L290 TraceCheckUtils]: 124: Hoare triple {25177#true} ~cond := #in~cond; {25177#true} is VALID [2022-04-08 11:29:31,761 INFO L272 TraceCheckUtils]: 123: Hoare triple {25724#(< ~counter~0 9)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {25177#true} is VALID [2022-04-08 11:29:31,761 INFO L290 TraceCheckUtils]: 122: Hoare triple {25724#(< ~counter~0 9)} assume !!(~r~0 >= 2 * ~b~0); {25724#(< ~counter~0 9)} is VALID [2022-04-08 11:29:31,761 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {25177#true} {25724#(< ~counter~0 9)} #87#return; {25724#(< ~counter~0 9)} is VALID [2022-04-08 11:29:31,761 INFO L290 TraceCheckUtils]: 120: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-04-08 11:29:31,761 INFO L290 TraceCheckUtils]: 119: Hoare triple {25177#true} assume !(0 == ~cond); {25177#true} is VALID [2022-04-08 11:29:31,761 INFO L290 TraceCheckUtils]: 118: Hoare triple {25177#true} ~cond := #in~cond; {25177#true} is VALID [2022-04-08 11:29:31,762 INFO L272 TraceCheckUtils]: 117: Hoare triple {25724#(< ~counter~0 9)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {25177#true} is VALID [2022-04-08 11:29:31,762 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {25177#true} {25724#(< ~counter~0 9)} #85#return; {25724#(< ~counter~0 9)} is VALID [2022-04-08 11:29:31,762 INFO L290 TraceCheckUtils]: 115: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-04-08 11:29:31,762 INFO L290 TraceCheckUtils]: 114: Hoare triple {25177#true} assume !(0 == ~cond); {25177#true} is VALID [2022-04-08 11:29:31,762 INFO L290 TraceCheckUtils]: 113: Hoare triple {25177#true} ~cond := #in~cond; {25177#true} is VALID [2022-04-08 11:29:31,762 INFO L272 TraceCheckUtils]: 112: Hoare triple {25724#(< ~counter~0 9)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25177#true} is VALID [2022-04-08 11:29:31,763 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {25177#true} {25724#(< ~counter~0 9)} #83#return; {25724#(< ~counter~0 9)} is VALID [2022-04-08 11:29:31,763 INFO L290 TraceCheckUtils]: 110: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-04-08 11:29:31,763 INFO L290 TraceCheckUtils]: 109: Hoare triple {25177#true} assume !(0 == ~cond); {25177#true} is VALID [2022-04-08 11:29:31,763 INFO L290 TraceCheckUtils]: 108: Hoare triple {25177#true} ~cond := #in~cond; {25177#true} is VALID [2022-04-08 11:29:31,763 INFO L272 TraceCheckUtils]: 107: Hoare triple {25724#(< ~counter~0 9)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25177#true} is VALID [2022-04-08 11:29:31,764 INFO L290 TraceCheckUtils]: 106: Hoare triple {25724#(< ~counter~0 9)} assume !!(#t~post7 < 10);havoc #t~post7; {25724#(< ~counter~0 9)} is VALID [2022-04-08 11:29:31,764 INFO L290 TraceCheckUtils]: 105: Hoare triple {25576#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {25724#(< ~counter~0 9)} is VALID [2022-04-08 11:29:31,764 INFO L290 TraceCheckUtils]: 104: Hoare triple {25576#(<= ~counter~0 7)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {25576#(<= ~counter~0 7)} is VALID [2022-04-08 11:29:31,765 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {25177#true} {25576#(<= ~counter~0 7)} #81#return; {25576#(<= ~counter~0 7)} is VALID [2022-04-08 11:29:31,765 INFO L290 TraceCheckUtils]: 102: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-04-08 11:29:31,765 INFO L290 TraceCheckUtils]: 101: Hoare triple {25177#true} assume !(0 == ~cond); {25177#true} is VALID [2022-04-08 11:29:31,765 INFO L290 TraceCheckUtils]: 100: Hoare triple {25177#true} ~cond := #in~cond; {25177#true} is VALID [2022-04-08 11:29:31,765 INFO L272 TraceCheckUtils]: 99: Hoare triple {25576#(<= ~counter~0 7)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25177#true} is VALID [2022-04-08 11:29:31,766 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {25177#true} {25576#(<= ~counter~0 7)} #79#return; {25576#(<= ~counter~0 7)} is VALID [2022-04-08 11:29:31,766 INFO L290 TraceCheckUtils]: 97: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-04-08 11:29:31,766 INFO L290 TraceCheckUtils]: 96: Hoare triple {25177#true} assume !(0 == ~cond); {25177#true} is VALID [2022-04-08 11:29:31,766 INFO L290 TraceCheckUtils]: 95: Hoare triple {25177#true} ~cond := #in~cond; {25177#true} is VALID [2022-04-08 11:29:31,766 INFO L272 TraceCheckUtils]: 94: Hoare triple {25576#(<= ~counter~0 7)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25177#true} is VALID [2022-04-08 11:29:31,766 INFO L290 TraceCheckUtils]: 93: Hoare triple {25576#(<= ~counter~0 7)} assume !!(#t~post6 < 10);havoc #t~post6; {25576#(<= ~counter~0 7)} is VALID [2022-04-08 11:29:31,767 INFO L290 TraceCheckUtils]: 92: Hoare triple {25503#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25576#(<= ~counter~0 7)} is VALID [2022-04-08 11:29:31,767 INFO L290 TraceCheckUtils]: 91: Hoare triple {25503#(<= ~counter~0 6)} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {25503#(<= ~counter~0 6)} is VALID [2022-04-08 11:29:31,767 INFO L290 TraceCheckUtils]: 90: Hoare triple {25503#(<= ~counter~0 6)} assume !(~r~0 >= 2 * ~b~0); {25503#(<= ~counter~0 6)} is VALID [2022-04-08 11:29:31,768 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {25177#true} {25503#(<= ~counter~0 6)} #87#return; {25503#(<= ~counter~0 6)} is VALID [2022-04-08 11:29:31,768 INFO L290 TraceCheckUtils]: 88: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-04-08 11:29:31,768 INFO L290 TraceCheckUtils]: 87: Hoare triple {25177#true} assume !(0 == ~cond); {25177#true} is VALID [2022-04-08 11:29:31,768 INFO L290 TraceCheckUtils]: 86: Hoare triple {25177#true} ~cond := #in~cond; {25177#true} is VALID [2022-04-08 11:29:31,768 INFO L272 TraceCheckUtils]: 85: Hoare triple {25503#(<= ~counter~0 6)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {25177#true} is VALID [2022-04-08 11:29:31,769 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {25177#true} {25503#(<= ~counter~0 6)} #85#return; {25503#(<= ~counter~0 6)} is VALID [2022-04-08 11:29:31,769 INFO L290 TraceCheckUtils]: 83: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-04-08 11:29:31,769 INFO L290 TraceCheckUtils]: 82: Hoare triple {25177#true} assume !(0 == ~cond); {25177#true} is VALID [2022-04-08 11:29:31,769 INFO L290 TraceCheckUtils]: 81: Hoare triple {25177#true} ~cond := #in~cond; {25177#true} is VALID [2022-04-08 11:29:31,769 INFO L272 TraceCheckUtils]: 80: Hoare triple {25503#(<= ~counter~0 6)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25177#true} is VALID [2022-04-08 11:29:31,779 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {25177#true} {25503#(<= ~counter~0 6)} #83#return; {25503#(<= ~counter~0 6)} is VALID [2022-04-08 11:29:31,779 INFO L290 TraceCheckUtils]: 78: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-04-08 11:29:31,780 INFO L290 TraceCheckUtils]: 77: Hoare triple {25177#true} assume !(0 == ~cond); {25177#true} is VALID [2022-04-08 11:29:31,780 INFO L290 TraceCheckUtils]: 76: Hoare triple {25177#true} ~cond := #in~cond; {25177#true} is VALID [2022-04-08 11:29:31,780 INFO L272 TraceCheckUtils]: 75: Hoare triple {25503#(<= ~counter~0 6)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25177#true} is VALID [2022-04-08 11:29:31,780 INFO L290 TraceCheckUtils]: 74: Hoare triple {25503#(<= ~counter~0 6)} assume !!(#t~post7 < 10);havoc #t~post7; {25503#(<= ~counter~0 6)} is VALID [2022-04-08 11:29:31,781 INFO L290 TraceCheckUtils]: 73: Hoare triple {25463#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {25503#(<= ~counter~0 6)} is VALID [2022-04-08 11:29:31,781 INFO L290 TraceCheckUtils]: 72: Hoare triple {25463#(<= ~counter~0 5)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {25463#(<= ~counter~0 5)} is VALID [2022-04-08 11:29:31,782 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {25177#true} {25463#(<= ~counter~0 5)} #89#return; {25463#(<= ~counter~0 5)} is VALID [2022-04-08 11:29:31,782 INFO L290 TraceCheckUtils]: 70: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-04-08 11:29:31,782 INFO L290 TraceCheckUtils]: 69: Hoare triple {25177#true} assume !(0 == ~cond); {25177#true} is VALID [2022-04-08 11:29:31,782 INFO L290 TraceCheckUtils]: 68: Hoare triple {25177#true} ~cond := #in~cond; {25177#true} is VALID [2022-04-08 11:29:31,782 INFO L272 TraceCheckUtils]: 67: Hoare triple {25463#(<= ~counter~0 5)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {25177#true} is VALID [2022-04-08 11:29:31,782 INFO L290 TraceCheckUtils]: 66: Hoare triple {25463#(<= ~counter~0 5)} assume !!(~r~0 >= 2 * ~b~0); {25463#(<= ~counter~0 5)} is VALID [2022-04-08 11:29:31,783 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {25177#true} {25463#(<= ~counter~0 5)} #87#return; {25463#(<= ~counter~0 5)} is VALID [2022-04-08 11:29:31,783 INFO L290 TraceCheckUtils]: 64: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-04-08 11:29:31,783 INFO L290 TraceCheckUtils]: 63: Hoare triple {25177#true} assume !(0 == ~cond); {25177#true} is VALID [2022-04-08 11:29:31,783 INFO L290 TraceCheckUtils]: 62: Hoare triple {25177#true} ~cond := #in~cond; {25177#true} is VALID [2022-04-08 11:29:31,783 INFO L272 TraceCheckUtils]: 61: Hoare triple {25463#(<= ~counter~0 5)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {25177#true} is VALID [2022-04-08 11:29:31,784 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {25177#true} {25463#(<= ~counter~0 5)} #85#return; {25463#(<= ~counter~0 5)} is VALID [2022-04-08 11:29:31,784 INFO L290 TraceCheckUtils]: 59: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-04-08 11:29:31,784 INFO L290 TraceCheckUtils]: 58: Hoare triple {25177#true} assume !(0 == ~cond); {25177#true} is VALID [2022-04-08 11:29:31,784 INFO L290 TraceCheckUtils]: 57: Hoare triple {25177#true} ~cond := #in~cond; {25177#true} is VALID [2022-04-08 11:29:31,784 INFO L272 TraceCheckUtils]: 56: Hoare triple {25463#(<= ~counter~0 5)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25177#true} is VALID [2022-04-08 11:29:31,784 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {25177#true} {25463#(<= ~counter~0 5)} #83#return; {25463#(<= ~counter~0 5)} is VALID [2022-04-08 11:29:31,785 INFO L290 TraceCheckUtils]: 54: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-04-08 11:29:31,785 INFO L290 TraceCheckUtils]: 53: Hoare triple {25177#true} assume !(0 == ~cond); {25177#true} is VALID [2022-04-08 11:29:31,785 INFO L290 TraceCheckUtils]: 52: Hoare triple {25177#true} ~cond := #in~cond; {25177#true} is VALID [2022-04-08 11:29:31,785 INFO L272 TraceCheckUtils]: 51: Hoare triple {25463#(<= ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25177#true} is VALID [2022-04-08 11:29:31,785 INFO L290 TraceCheckUtils]: 50: Hoare triple {25463#(<= ~counter~0 5)} assume !!(#t~post7 < 10);havoc #t~post7; {25463#(<= ~counter~0 5)} is VALID [2022-04-08 11:29:31,786 INFO L290 TraceCheckUtils]: 49: Hoare triple {25405#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {25463#(<= ~counter~0 5)} is VALID [2022-04-08 11:29:31,786 INFO L290 TraceCheckUtils]: 48: Hoare triple {25405#(<= ~counter~0 4)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {25405#(<= ~counter~0 4)} is VALID [2022-04-08 11:29:31,786 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {25177#true} {25405#(<= ~counter~0 4)} #89#return; {25405#(<= ~counter~0 4)} is VALID [2022-04-08 11:29:31,787 INFO L290 TraceCheckUtils]: 46: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-04-08 11:29:31,787 INFO L290 TraceCheckUtils]: 45: Hoare triple {25177#true} assume !(0 == ~cond); {25177#true} is VALID [2022-04-08 11:29:31,787 INFO L290 TraceCheckUtils]: 44: Hoare triple {25177#true} ~cond := #in~cond; {25177#true} is VALID [2022-04-08 11:29:31,787 INFO L272 TraceCheckUtils]: 43: Hoare triple {25405#(<= ~counter~0 4)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {25177#true} is VALID [2022-04-08 11:29:31,787 INFO L290 TraceCheckUtils]: 42: Hoare triple {25405#(<= ~counter~0 4)} assume !!(~r~0 >= 2 * ~b~0); {25405#(<= ~counter~0 4)} is VALID [2022-04-08 11:29:31,787 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {25177#true} {25405#(<= ~counter~0 4)} #87#return; {25405#(<= ~counter~0 4)} is VALID [2022-04-08 11:29:31,788 INFO L290 TraceCheckUtils]: 40: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-04-08 11:29:31,788 INFO L290 TraceCheckUtils]: 39: Hoare triple {25177#true} assume !(0 == ~cond); {25177#true} is VALID [2022-04-08 11:29:31,788 INFO L290 TraceCheckUtils]: 38: Hoare triple {25177#true} ~cond := #in~cond; {25177#true} is VALID [2022-04-08 11:29:31,788 INFO L272 TraceCheckUtils]: 37: Hoare triple {25405#(<= ~counter~0 4)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {25177#true} is VALID [2022-04-08 11:29:31,788 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {25177#true} {25405#(<= ~counter~0 4)} #85#return; {25405#(<= ~counter~0 4)} is VALID [2022-04-08 11:29:31,788 INFO L290 TraceCheckUtils]: 35: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-04-08 11:29:31,788 INFO L290 TraceCheckUtils]: 34: Hoare triple {25177#true} assume !(0 == ~cond); {25177#true} is VALID [2022-04-08 11:29:31,789 INFO L290 TraceCheckUtils]: 33: Hoare triple {25177#true} ~cond := #in~cond; {25177#true} is VALID [2022-04-08 11:29:31,789 INFO L272 TraceCheckUtils]: 32: Hoare triple {25405#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25177#true} is VALID [2022-04-08 11:29:31,789 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {25177#true} {25405#(<= ~counter~0 4)} #83#return; {25405#(<= ~counter~0 4)} is VALID [2022-04-08 11:29:31,789 INFO L290 TraceCheckUtils]: 30: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-04-08 11:29:31,789 INFO L290 TraceCheckUtils]: 29: Hoare triple {25177#true} assume !(0 == ~cond); {25177#true} is VALID [2022-04-08 11:29:31,789 INFO L290 TraceCheckUtils]: 28: Hoare triple {25177#true} ~cond := #in~cond; {25177#true} is VALID [2022-04-08 11:29:31,789 INFO L272 TraceCheckUtils]: 27: Hoare triple {25405#(<= ~counter~0 4)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25177#true} is VALID [2022-04-08 11:29:31,790 INFO L290 TraceCheckUtils]: 26: Hoare triple {25405#(<= ~counter~0 4)} assume !!(#t~post7 < 10);havoc #t~post7; {25405#(<= ~counter~0 4)} is VALID [2022-04-08 11:29:31,790 INFO L290 TraceCheckUtils]: 25: Hoare triple {25332#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {25405#(<= ~counter~0 4)} is VALID [2022-04-08 11:29:31,790 INFO L290 TraceCheckUtils]: 24: Hoare triple {25332#(<= ~counter~0 3)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {25332#(<= ~counter~0 3)} is VALID [2022-04-08 11:29:31,791 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {25177#true} {25332#(<= ~counter~0 3)} #81#return; {25332#(<= ~counter~0 3)} is VALID [2022-04-08 11:29:31,791 INFO L290 TraceCheckUtils]: 22: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-04-08 11:29:31,791 INFO L290 TraceCheckUtils]: 21: Hoare triple {25177#true} assume !(0 == ~cond); {25177#true} is VALID [2022-04-08 11:29:31,791 INFO L290 TraceCheckUtils]: 20: Hoare triple {25177#true} ~cond := #in~cond; {25177#true} is VALID [2022-04-08 11:29:31,791 INFO L272 TraceCheckUtils]: 19: Hoare triple {25332#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {25177#true} is VALID [2022-04-08 11:29:31,792 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {25177#true} {25332#(<= ~counter~0 3)} #79#return; {25332#(<= ~counter~0 3)} is VALID [2022-04-08 11:29:31,792 INFO L290 TraceCheckUtils]: 17: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-04-08 11:29:31,792 INFO L290 TraceCheckUtils]: 16: Hoare triple {25177#true} assume !(0 == ~cond); {25177#true} is VALID [2022-04-08 11:29:31,792 INFO L290 TraceCheckUtils]: 15: Hoare triple {25177#true} ~cond := #in~cond; {25177#true} is VALID [2022-04-08 11:29:31,792 INFO L272 TraceCheckUtils]: 14: Hoare triple {25332#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {25177#true} is VALID [2022-04-08 11:29:31,792 INFO L290 TraceCheckUtils]: 13: Hoare triple {25332#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {25332#(<= ~counter~0 3)} is VALID [2022-04-08 11:29:31,793 INFO L290 TraceCheckUtils]: 12: Hoare triple {25259#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25332#(<= ~counter~0 3)} is VALID [2022-04-08 11:29:31,793 INFO L290 TraceCheckUtils]: 11: Hoare triple {25259#(<= ~counter~0 2)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {25259#(<= ~counter~0 2)} is VALID [2022-04-08 11:29:31,794 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {25177#true} {25259#(<= ~counter~0 2)} #77#return; {25259#(<= ~counter~0 2)} is VALID [2022-04-08 11:29:31,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-04-08 11:29:31,794 INFO L290 TraceCheckUtils]: 8: Hoare triple {25177#true} assume !(0 == ~cond); {25177#true} is VALID [2022-04-08 11:29:31,794 INFO L290 TraceCheckUtils]: 7: Hoare triple {25177#true} ~cond := #in~cond; {25177#true} is VALID [2022-04-08 11:29:31,794 INFO L272 TraceCheckUtils]: 6: Hoare triple {25259#(<= ~counter~0 2)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {25177#true} is VALID [2022-04-08 11:29:31,794 INFO L290 TraceCheckUtils]: 5: Hoare triple {25259#(<= ~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; {25259#(<= ~counter~0 2)} is VALID [2022-04-08 11:29:31,795 INFO L272 TraceCheckUtils]: 4: Hoare triple {25259#(<= ~counter~0 2)} call #t~ret8 := main(); {25259#(<= ~counter~0 2)} is VALID [2022-04-08 11:29:31,795 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25259#(<= ~counter~0 2)} {25177#true} #93#return; {25259#(<= ~counter~0 2)} is VALID [2022-04-08 11:29:31,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {25259#(<= ~counter~0 2)} assume true; {25259#(<= ~counter~0 2)} is VALID [2022-04-08 11:29:31,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {25177#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; {25259#(<= ~counter~0 2)} is VALID [2022-04-08 11:29:31,796 INFO L272 TraceCheckUtils]: 0: Hoare triple {25177#true} call ULTIMATE.init(); {25177#true} is VALID [2022-04-08 11:29:31,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1044 backedges. 44 proven. 76 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2022-04-08 11:29:31,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:29:31,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135925533] [2022-04-08 11:29:31,797 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:29:31,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064677598] [2022-04-08 11:29:31,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064677598] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:29:31,797 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:29:31,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2022-04-08 11:29:31,797 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:29:31,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [832832836] [2022-04-08 11:29:31,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [832832836] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:29:31,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:29:31,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 11:29:31,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872119919] [2022-04-08 11:29:31,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:29:31,798 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 10 states have internal predecessors, (59), 10 states have call successors, (26), 10 states have call predecessors, (26), 8 states have return successors, (24), 8 states have call predecessors, (24), 9 states have call successors, (24) Word has length 154 [2022-04-08 11:29:31,798 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:29:31,798 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 10 states have internal predecessors, (59), 10 states have call successors, (26), 10 states have call predecessors, (26), 8 states have return successors, (24), 8 states have call predecessors, (24), 9 states have call successors, (24) [2022-04-08 11:29:31,874 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-08 11:29:31,874 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 11:29:31,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:29:31,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 11:29:31,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 11:29:31,875 INFO L87 Difference]: Start difference. First operand 287 states and 328 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 10 states have internal predecessors, (59), 10 states have call successors, (26), 10 states have call predecessors, (26), 8 states have return successors, (24), 8 states have call predecessors, (24), 9 states have call successors, (24) [2022-04-08 11:29:32,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:29:32,899 INFO L93 Difference]: Finished difference Result 362 states and 414 transitions. [2022-04-08 11:29:32,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 11:29:32,899 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 10 states have internal predecessors, (59), 10 states have call successors, (26), 10 states have call predecessors, (26), 8 states have return successors, (24), 8 states have call predecessors, (24), 9 states have call successors, (24) Word has length 154 [2022-04-08 11:29:32,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:29:32,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 10 states have internal predecessors, (59), 10 states have call successors, (26), 10 states have call predecessors, (26), 8 states have return successors, (24), 8 states have call predecessors, (24), 9 states have call successors, (24) [2022-04-08 11:29:32,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 181 transitions. [2022-04-08 11:29:32,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 10 states have internal predecessors, (59), 10 states have call successors, (26), 10 states have call predecessors, (26), 8 states have return successors, (24), 8 states have call predecessors, (24), 9 states have call successors, (24) [2022-04-08 11:29:32,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 181 transitions. [2022-04-08 11:29:32,902 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 181 transitions. [2022-04-08 11:29:33,036 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:29:33,042 INFO L225 Difference]: With dead ends: 362 [2022-04-08 11:29:33,043 INFO L226 Difference]: Without dead ends: 355 [2022-04-08 11:29:33,043 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 294 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=192, Unknown=0, NotChecked=0, Total=306 [2022-04-08 11:29:33,044 INFO L913 BasicCegarLoop]: 71 mSDtfsCounter, 67 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 11:29:33,044 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 240 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 11:29:33,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2022-04-08 11:29:33,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 344. [2022-04-08 11:29:33,533 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:29:33,534 INFO L82 GeneralOperation]: Start isEquivalent. First operand 355 states. Second operand has 344 states, 223 states have (on average 1.094170403587444) internal successors, (244), 228 states have internal predecessors, (244), 77 states have call successors, (77), 45 states have call predecessors, (77), 43 states have return successors, (74), 70 states have call predecessors, (74), 74 states have call successors, (74) [2022-04-08 11:29:33,534 INFO L74 IsIncluded]: Start isIncluded. First operand 355 states. Second operand has 344 states, 223 states have (on average 1.094170403587444) internal successors, (244), 228 states have internal predecessors, (244), 77 states have call successors, (77), 45 states have call predecessors, (77), 43 states have return successors, (74), 70 states have call predecessors, (74), 74 states have call successors, (74) [2022-04-08 11:29:33,534 INFO L87 Difference]: Start difference. First operand 355 states. Second operand has 344 states, 223 states have (on average 1.094170403587444) internal successors, (244), 228 states have internal predecessors, (244), 77 states have call successors, (77), 45 states have call predecessors, (77), 43 states have return successors, (74), 70 states have call predecessors, (74), 74 states have call successors, (74) [2022-04-08 11:29:33,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:29:33,539 INFO L93 Difference]: Finished difference Result 355 states and 406 transitions. [2022-04-08 11:29:33,540 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 406 transitions. [2022-04-08 11:29:33,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:29:33,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:29:33,540 INFO L74 IsIncluded]: Start isIncluded. First operand has 344 states, 223 states have (on average 1.094170403587444) internal successors, (244), 228 states have internal predecessors, (244), 77 states have call successors, (77), 45 states have call predecessors, (77), 43 states have return successors, (74), 70 states have call predecessors, (74), 74 states have call successors, (74) Second operand 355 states. [2022-04-08 11:29:33,541 INFO L87 Difference]: Start difference. First operand has 344 states, 223 states have (on average 1.094170403587444) internal successors, (244), 228 states have internal predecessors, (244), 77 states have call successors, (77), 45 states have call predecessors, (77), 43 states have return successors, (74), 70 states have call predecessors, (74), 74 states have call successors, (74) Second operand 355 states. [2022-04-08 11:29:33,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:29:33,546 INFO L93 Difference]: Finished difference Result 355 states and 406 transitions. [2022-04-08 11:29:33,546 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 406 transitions. [2022-04-08 11:29:33,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:29:33,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:29:33,546 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:29:33,547 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:29:33,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 223 states have (on average 1.094170403587444) internal successors, (244), 228 states have internal predecessors, (244), 77 states have call successors, (77), 45 states have call predecessors, (77), 43 states have return successors, (74), 70 states have call predecessors, (74), 74 states have call successors, (74) [2022-04-08 11:29:33,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 395 transitions. [2022-04-08 11:29:33,553 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 395 transitions. Word has length 154 [2022-04-08 11:29:33,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:29:33,553 INFO L478 AbstractCegarLoop]: Abstraction has 344 states and 395 transitions. [2022-04-08 11:29:33,553 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 10 states have internal predecessors, (59), 10 states have call successors, (26), 10 states have call predecessors, (26), 8 states have return successors, (24), 8 states have call predecessors, (24), 9 states have call successors, (24) [2022-04-08 11:29:33,553 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 344 states and 395 transitions. [2022-04-08 11:29:34,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 395 edges. 395 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:29:34,121 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 395 transitions. [2022-04-08 11:29:34,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-04-08 11:29:34,122 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:29:34,122 INFO L499 BasicCegarLoop]: trace histogram [24, 23, 23, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:29:34,140 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-08 11:29:34,322 WARN L460 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-08 11:29:34,322 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:29:34,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:29:34,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1775621107, now seen corresponding path program 3 times [2022-04-08 11:29:34,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:29:34,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1784119983] [2022-04-08 11:30:10,790 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:30:10,790 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:30:10,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1775621107, now seen corresponding path program 4 times [2022-04-08 11:30:10,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:30:10,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682426923] [2022-04-08 11:30:10,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:30:10,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:30:10,811 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:30:10,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [459888055] [2022-04-08 11:30:10,811 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 11:30:10,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:30:10,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:30:10,812 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:30:10,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-08 11:30:10,893 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 11:30:10,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:30:10,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-08 11:30:10,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:30:10,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:30:48,873 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:30:50,930 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful